
Genetic Algorithms Digest   Monday, July 13 1992   Volume 6 : Issue 24

 - Send submissions to GA-List@AIC.NRL.NAVY.MIL
 - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL
 - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (see v6n5 for details)

Today's Topics:
	- GENEsYs-1.0 available
	- a specific crossover operator closure problem
	- TR's on GACS
	- 1993 IEEE International Conference on Neural Networks

****************************************************************************

CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference)

 10th National Conference on AI, San Jose,                      Jul 12-17, 92
 FOGA-92, Foundations of Genetic Algorithms, Colorado (v5n32)   Jul 26-29, 92
 COG SCI 92, Cognitive Science Conf., Indiana, (v5n39, v6n22)   Jul 29-1,  92
 ECAI 92, 10th European Conference on AI (v5n13)                Aug  3-7,  92
 Parallel Problem Solving from Nature, Brussels, (v5n29)        Sep 28-30, 92
 SAB92, From Animals to Animats, Honolulu (v6n6)                Dec  7-11, 92
 ICNN93, IEEE Intl. Conf. on Neural Networks, Calif (v6n24)     Mar 28-1,  93
 Intl. Conf. on Neural Networks and GAs, Innsbruck (v6n22)      Apr 13-16, 93

 (Send announcements of other activities to GA-List@aic.nrl.navy.mil)

****************************************************************************
----------------------------------------------------------------------

From: Thomas Baeck <baeck@home.informatik.uni-dortmund.de>
Date: Tue, 7 Jul 92 11:37:19 +0200
Subject: GENEsYs-1.0 available

	GENEsYs 1.0  

	The GA-software GENEsYs 1.0 (GA-Digest v6n10)  is available now 
	by anonymous ftp from lumpi.informatik.uni-dortmund.de (details
	are explained below).

	[Editor's  Note:  GENEsYs 1.0 is also available from the ga-list
	ftp server ftp.aic.nrl.navy.mil (192.26.18.74) in
	/pub/galist/source-code/ga-source -- ACS]

	The  implementation is based on  John  Grefenstette's  software
	package GENESIS, version 4.5 (1987, an early public domain ver-
	sion of the software). It  includes extensions for experimental
	purposes, e.g.  different selection mechanisms  (linear ranking,
	Boltzmann selection,  (mu, lambda)-selection) and  extended re-
	combination  operators  (m-point crossover,  uniform crossover, 
	discrete and intermediate recombination). Furthermore, a set of
	objective functions  is incorporated, which currently  includes
	24 more  or less  complicated topologies.  Last not least, some
	additional data-monitoring facilities such as recording average,
	variance and skewness of all object variables are provided.

	To  obtain the  software  including  documentation,  proceed as 
	follows:

            ----------------------------------------------

	ftp lumpi.informatik.uni-dortmund.de (129.217.36.140)
	Connected to lumpi.informatik.uni-dortmund.de.
	220 lumpi FTP server (Version 6.14 Fri Feb 21 18:11:53 MET 1992) 
	ready.
	Name: ftp
	331 Guest login ok, send e-mail address as password.
	Password: <userid>@<complete machine address>
	230-
	230-    Welcome to the official ES/GA FTP server at the 
	230-	University of Dortmund.
	230-
	230-    Local time here is Tue Jul  7 10:13:46 1992
	230-
	230-    --> This is an unsecure service now. It may be terminated 
	230-	    at any time without prior announcement.
	230-
	230-    Make sure to transfer the files in binary mode!
	230-
	230-    Ulrich Hermes, hermes@ls11.informatik.uni-dortmund.de
	230-    Frank Wiesenfeller, fw@irb.informatik.uni-dortmund.de (FTP)
	230-
	230-
	230 Guest login ok, access restrictions apply.
	ftp> cd pub/GA/src	
	250 CWD command successful.
	ftp> binary
	200 Type set to I.
	ftp> get GENEsYs-1.0.tar.Z 	
	200 PORT command successful.
	150 Opening BINARY mode data connection for GENEsYs-1.0.tar.Z 
	(708103 bytes).
	226 Transfer complete.
	local: GENEsYs-1.0.tar.Z remote: GENEsYs-1.0.tar.Z
	708103 bytes received in 7.4 seconds (93 Kbytes/s)
	ftp> quit
	221 Goodbye.

	If you are - at first - only  interested in the  documentation, 
	you can find it in the file 

		GENEsYs-1.0-doc.tar.Z

	in directory

		pub/GA/docs

	Please, do NOT forget to give  your full email-address as pass-
	word ! Thank you.

           ======================================================
    	Thomas Baeck	          Computer Science Department, LS XI
				  University of Dortmund
				  P.O. Box 50 05 00
    	Phone : +49-231-755-4678  Baroper Str. 301
    	Fax   : +49-231-755-2047  D-4600 Dortmund 50
			    	  Germany

    	e-mail: baeck@home.informatik.uni-dortmund.de
  	  	baeck@ls11.informatik.uni-dortmund.de

------------------------------

From: henrik@tazdevil.llnl.gov (Henrik Klagges)
Date: Wed, 8 Jul 92 10:18:14 PDT
Subject: a specific crossover operator closure problem

   Hi !

   Suppose a genome consists out of integer tuples, like (x,y) or (x,y,z)
   with x,y,z out of 1..n, with the restriction that no two elements are
   equal (x != y != z != x). A standard crossover operator would produce
   new tuples where repetitions occur, so it isn't fullfilling the closure
   requirement:
   reprocude (3,4) with (2,3) -> (3,3) -> unallowed tuple !

   How does one avoid this ? I actually could handle a few tuples of that,
   if a heuristic could guarantee that at least most tuples are created
   correctly, but the performance penalty for (k,k,l) tuples is BAD.

   Thanks, Henrik
   MPCI at LLNL
   IBM Research

------------------------------

From: qix@roma.eng2.uconn.edu (Xiaofeng Qi)
Date: Sat, 4 Jul 92 13:16:19 GMT-0500
Subject: TR's on GACS

   The Laboratory for Signal Processing, Computational Methods and Neural
   Networks, at the EE Dept. of University of Connecticut announces two tech.
   reports on Genetic Algorithms in the Continuous Space (GACS):

   Technical Report EE-92-01:

   This report analyzes a class of ``Genetic Algorithms'' in the continuous
   space (GACS). A complete convergence analysis is given for the large
   sample case with a quadratic cost function, which reveals important near
   convergence behavior of the algorithm. An approximate analysis is
   conducted for the finite sample version, with emphasis on the quadratic
   cost function case. The formulation of the crossover operator and its
   analysis are deferred to another report due to the unique importance and
   rich properties of the operator. The analyses add much light to the
   understanding of the underlying mechanism of population-oriented search
   algorithms in general and GACS in particular.


   Technical Report EE-92-05:

   This report aims to establish some fundamental properties of a class of
   Genetic Algorithms in the Continuous Space (GACS). The report augments a
   previous one on the near convergence behavior of a GACS (Tech. Report
   EE-92-01). A general class of GACS is formulated that employs selection,
   crossover and mutation operators, all in the framework of
   multi-dimensional euclidean spaces. A special case of the generalized GACS
   is then analyzed that uses fitness-proportional selection, coordinate-wise
   uniform crossover and coordinate-wise mutation schemes. Time-recursive
   equations for the probability density functions representing the
   population are derived under the assumption of a large population size,
   and their validity rigorously proved. Based on these equations, a detailed
   convergence analysis is performed for a simplified version of the GACS,
   namely, a GACS without crossover. The uniform crossover operator is
   analysed separately due to the rich properties of its own, and the results
   are combined with those of s

   To acquire them please send me a email message and the reports will be
   mailed to you. Or you can write:

   Xiaofeng Qi
   U-157, Dept. of Electrical and Systems Engineering
   The University of Connecticut
   Storrs, CT 06269-3157
   U.S.A.

------------------------------

From: Hamid Berenji <berenji@ptolemy.arc.nasa.gov>
Date: Tue, 30 Jun 92 10:57:09 PDT
Subject: 1993 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS

   [Editor's Note:  The full text of the announcement can be found on the
   ga-list ftp server, ftp.aic.nrl.navy.mil (192.26.18.74) in the file
   /pub/galist/information/conferences/ICNN93. - ACS]

	   1993 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS
	    San Francisco, California, March 28 - April 1, 1993


   The IEEE Neural Networks Council is pleased to announce its 1993
   International Conference on Neural Networks (ICNN'93) to be held in
   San Francisco, California from March 28 to April 1, 1993.  ICNN'93
   will be held concurrently with the Second IEEE International
   Conference on Fuzzy Systems (FUZZ-IEEE'93).  Participants will be able
   to attend the technical events of both meetings.

   ICNN '93 will be devoted to the discussion of basic advances and
   applications of neurobiological systems, neural networks, and neural
   computers.  Topics of interest include:

   * Neurodynamics
   * Associative Memories
   * Intelligent Neural Networks
   * Invertebrate Neural Networks
   * Neural Fuzzy Systems
   * Evolutionary Programming
   * Optical Neurocomputers
   * Supervised Learning
   * Unsupervised Learning
   * Sensation and Perception
   * Genetic Algorithms
   * Virtual Reality & Neural Networks
   * Applications to:
       - Image Processing and Understanding
       - Optimization
       - Control
       - Robotics and Automation
       - Signal Processing


   ORGANIZATION:

   General Chair: Enrique H. Ruspini

   Program Chairs: Hamid R. Berenji, Elie Sanchez, Shiro Usui

   SPONSORING SOCIETIES:

   ICNN'93 is sponsored by the Neural Networks Council.

   Constituent Societies:

   * IEEE Circuits and Systems Society
   * IEEE Communications Society
   * IEEE Computer Society
   * IEEE Control Systems Society
   * IEEE Engineering in Medicine & Biology Society
   * IEEE Industrial Electronics Society
   * IEEE Industry Applications Society
   * IEEE Information Theory Society
   * IEEE Lasers and Electro-Optics Society
   * IEEE Oceanic Engineering Society
   * IEEE Power Engineering Society
   * IEEE Robotics and Automation Society
   * IEEE Signal Processing Society
   * IEEE Systems, Man, and Cybernetics Society

   CALL FOR PAPERS

   The program committee cordially invites interested authors to submit
   papers dealing with any aspects of research and applications related
   to the use of neural models.  Papers must be written in English and
   must be received by SEPTEMBER 21, 1992.  Six copies of the paper must
   be submitted and the paper should not exceed 8 pages including
   figures, tables, and references.  Papers should be prepared on 8.5" x
   11" white paper with 1" margins on all sides, using a typewriter or
   letter quality printer in one column format, in Times or similar
   style, 10 points or larger, and printed on one side of the paper only.
   Please include title, authors name(s) and affiliation(s) on top of
   first page followed by an abstract.  FAX submissions are not
   acceptable.  Please send submissions prior to the deadline to:
   Dr. Hamid Berenji, AI Research Branch, MS 269-2, NASA Ames Research Center,
   Moffett Field, California 94035


   CALL  FOR VIDEOS:

   The IEEE Neural Networks Council is pleased to announce its first
   Video Proceedings program, intended to present new and significant
   experimental work in the fields of artificial neural networks and
   fuzzy systems, so as to enhance and complement results presented in
   the Conference Proceedings.  Interested researchers should submit a 2
   to 3 minute video segment (preferred formats: 3/4" Betacam, or Super
   VHS) and a one page information sheet (including title, author,
   affiliation, address, a 200-word abstract, 2 to 3 references, and a
   short acknowledgment, if needed), prior to September 21, 1992, to
   Meeting Management, 5665 Oberlin Drive, Suite 110, San Diego, CA
   92121.  We encourage those interested in participating in this program
   to write to this address for important suggestions to help in the
   preparation of their submission.

   TUTORIALS:

   The Computational Brain: Biological Neural Networks
   Terrence J. Sejnowski
   The Salk Institute

   Evolutionary Programming
   David Fogel
   Orincon Corporation

   Expert Systems and Neural Networks   
   George Lendaris
   Portland State University

   Genetic Algorithms and Neural Networks
   Darrell Whitley
   Colorado State University

   Introduction to Biological and Artificial Neural Networks
   Steven Rogers
   Air Force Institute of Technology

   Suggestions from Cognitive Science for Neural Network Applications
   James A. Anderson
   Department of Cognitive and Linguistic Sciences
   Brown University


   EXHIBITS:

   ICNN '93 will be held concurrently with the Second IEEE International
   Conference on Fuzzy Systems (FUZZ-IEEE '93).  ICNN '93 and FUZZ-IEEE
   '93 are the largest conferences and trade shows in their fields.
   Participants to either conference will be able to attend the combined
   exhibit program.  We anticipate an extraordinary trade show offering
   a unique opportunity to become acquainted with the latest developments
   in products based on neural-networks and fuzzy-systems techniques.
   Interested exhibitors are requested to contact the Chairman, Exhibits,
   ICNN '93 and FUZZ-IEEE '93, Wei Xu at Telephone (408) 428-1888, FAX
   (408) 428-1884.

   FOR ADDITIONAL INFORMATION, CONTACT

   Meeting Management
   5665 Oberlin Drive
   Suite 110
   San Diego, CA 92121

   Tel. (619) 453-6222
   FAX  (619) 535-3880

------------------------------
End of Genetic Algorithms Digest
******************************

