
Genetic Algorithms Digest   Tuesday, December 22, 1992   Volume 6 : Issue 40

 - 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 (Info in /pub/galist/FTP)

Today's Topics:
	- Survey of Universities teaching Genetic Algorithms
	- New Book Available: COGANN-92 proceedings
 	- Very Fast Simulated Reannealing code available (2 messages)
	- Formula approximation
	- about Instruction scheduling
	- Symposium on Pattern Formation
	- ISEC-94; preliminary call for papers

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

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

SAB92, From Animals to Animats, Honolulu (v6n6)                 Dec 07-11, 92
ICNN93, IEEE Intl. Conf. on Neural Networks, Calif (v6n24)      Mar 28-01, 93
ECML-93, European Conf. on Machine Learning, Vienna (v6n26)	Apr 05-07, 93
Foundations of Evolutionary Computation WS, Vienna (v6n34)      Apr     8, 93
Intl. Conf. on Neural Networks and GAs, Innsbruck (v6n22)       Apr 13-16, 93
ECAL-93, 2nd European Conference on A-Life, Brussels (v6n31)    May 24-26, 93
ANN93, IEE Intl Conf on Artificial Neural Nets, Brighton        May 25-27, 93
ICGA-93, Fifth Intl. Conf. on GAs, Urbana-Champaign (v6n29)     Jul 17-22, 93
COLT93, ACM Conf on Computational Learning Theory, UCSC (v6n34) Jul 26-28, 93
ISEC-94 Int. Symp. on Evolutionary Computation, Orlando (v6n40) Jun 25-30, 94

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

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

From: Alan C. Schultz (GA-List Moderator)
Date: Mon, Nov 30 14:21:07 EST 1992
Subject: Survey of Universities teaching Genetic Algorithms

   I just got the following message from ds1@philabs.Philips.Com  (Dave
   Schaffer):

   >  Just saw the request by Bongseog Jang  in GA-List v6n38.
   >  He raises a very good question. I think it would be an
   >  excellent service to the community to do a quick survey
   >  (thru the GA-List) of any universities teaching GAs.
   >
   >  Dave

   I agree; this sounds like a worthwhile venture.  If you are located at
   a University that teaches courses in genetic algorithms, please take a
   moment to complete the following.  Send it back to me at
   ga-list-request@aic.nrl.navy.nil.  The "Subject:" line should contain
   the single word "SURVEY".  I will tally and post the results.

   --Alan C. Schultz

 ======= Survey of Universities teaching genetic algorithms ===========

 1) What is the name of the university?

 2) In what City/State/Country is the university located?

 3) Approximately how many courses are taught PER YEAR that deal in depth
 with GAs?  (Give a breakdown between seminal and regular if appropriate.)

 4) Approximately how many courses are taught PER YEAR that mention or
 introduce GAs? (Do NOT include courses counted in last question.)

 5) How many faculty know the subject?

 6) Is there any supported GA-related research?  (If possible, can you
 give an idea of the size of the project, e.g. how many faculty and
 students does it support?)

 7) What are the names of faculty at this University that teach courses or
 perform research in GAs?

 8) Additional comments:

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

From: ds1@philabs.Philips.Com  (Dave Schaffer)
Date: Wed, 25 Nov 92 14:42:40 EST
Subject: New Book Available

  Announcing the availability of a new book:

  Proceedings COGANN-92 International Workshop on
  Combinations of Genetic Algorithms and Neural Networks

  Editors: L.D. Whitley and J.D. Schaffer
  ISBN 0-8186-2787-5
  Publisher: IEEE Computer Society Press
	  10662 Los Vaqueros Circle
	  P.O. Box 3014
	  Los Alamitos, CA 90720-1264
	  USA
	  Phone: 800-272-6657
	  (714) 821-4010 (FAX)

  Price: $34.00 for members of IEEE or Computer Society
	  $68.00 for non-members
	  add $4.00 for shipping and handling.

  CONTENTS

  Preface

  AUTHORS: J. David Schaffer, Darrell Whitley and Larry J. Eshelman 
  TITLE:   Combinations of Genetic Algorithms and Neural Networks: 
	   A Survey of the State of the Art

  AUTHOR:  John G. Elias 
  TITLE:   Genetic Generation of Connection Patterns 
	   for a Dynamic Artificial Neural Network.

  AUTHOR:  Frederic Gruau
  TITLE:   Genetic Synthesis of Boolean Neural Networks
	   with a Cell Rewriting Developmental Process 

  AUTHORS: Kristian Lindgren, Anders Nilsson, Mats Nordahl and Ingrid Rade
  TITLE:   Regular Language Inference Using Evolving Neural Networks.

  AUTHORS: Dipankar Dasgupta and Douglas McGregor 
  TITLE:   Designing Application-Specific Neural Networks
	   using the Structured Genetic Algorithm.

  AUTHORS: Rajarshi Das and Darrell Whitley
  TITLE:   Genetic Sparse Distributed Memories.

  AUTHOR:  Peter J.B. Hancock
  TITLE:   Genetic Algorithms and Permutation Problems:
	   A Comparison of Recombination Operators for
	   Neural Net Structure Specification.

  AUTHOR:  Mitchell A. Potter
  TITLE:   A Genetic Cascade-Correlation Learning Algorithm.

  AUTHORS: Nachimuthu Karunanithi, Rajarshi Das and Darrell Whitley
  TITLE:   Genetic Cascade Learning for Neural Networks.

  AUTHOR:  K. KrishnaKumar
  TITLE:   Immunized Neurocontrol--Concepts and Initial Results.

  AUTHOR:  Russell C. Eberhart
  TITLE:   The Role of Genetic Algorithms in Neural Network 
	   Query-Based Learning and Explanation Facilities.

  AUTHOR:  Thomas P. Caudell
  TITLE:   Genetic Algorithms as a Tool for the Analysis of
	   Adaptive Resonance Theory Network Training Sets.

  AUTHORS: C.N. Schizas, C.S. Pattichis and L.T. Middleton
  TITLE:   Neural Networks, Genetic Algorithms and K-Means Algorithm:
	   In Search of Data Classification.

  AUTHORS: Zhichao Guo and Robert Uhrig
  TITLE:   Using Genetic Algorithms to Select Inputs for Neural Networks.

  AUTHORS: Loke Soo Hsu and Zhi Biao Wu
  TITLE:   Input Pattern Encoding Though Generalized Adaptive Search.

  AUTHORS: R. Shonkwiler and Kenyon R. Miller
  TITLE:   Genetic Algorithm/Neural Network Synergy
	   For Nonlinear Constrained Optimization Problems.

  COGANN-92 Attendees

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

From: Lester Ingber <ingber@alumni.cco.caltech.edu>
Date: Sun, 22 Nov 1992 20:34:54 -0800
Subject: Very Fast Simulated Reannealing code available for beta testing

	     VERY FAST SIMULATED REANNEALING (VFSR) (C)

	       Lester Ingber ingber@alumni.caltech.edu
				 and
		Bruce Rosen rosen@ringer.cs.utsa.edu

  1.  License and Availability

  1.1.  GNU Copyleft License

       This  Very  Fast  Simulated Reannealing (VFSR) code is being
  made available under a GNU COPYING-LIB "copyleft" license, and is
  owned  jointly  by Lester Ingber and Bruce Rosen[1].  Please read
  the copy of this license contained in this directory.

  1.2.  NETLIB Electronic Availability of VFSR

       You can obtain our code  from  NETLIB.   This  can  be  done
  interactively, or you can obtain it by electronic mail request.

  1.2.1.  Interactive

       From your local machine login to research.att.com:
	  local% ftp research.att.com
	  Name (research.att.com:your_login_name): netlib
	  Password: [type in your_login_name or anything]
	  ftp> cd opt
	  ftp> binary
	  ftp> get vfsr.Z
	  ftp> quit
  After  `uncompress  vfsr.Z'  read  the  header of vfsr for simple
  directions on obtaining your source files.  For example, on  most
  machines, after `sh vfsr' they will reside in a VFSR directory.

  1.2.2.  Electronic Mail Request

       Send the following one-line electronic mail request
	  send vfsr from opt
	  [For general NETLIB info, just use: send index]
  to one of the NETLIB sites:
	  netlib@research.att.com (AT&T Bell Labs, NJ, USA)
		  [most recent version]
	  netlib@ornl.gov         (Oak Ridge Natl Lab, TN, USA)
	  netlib@ukc.ac.uk        (U Kent, UK)
	  netlib@nac.no           (Oslo, Norway)
	  netlib@cs.uow.edu.au    (U Wollongong, NSW, Australia)

  2.  Background and Context

       VFSR  was  developed  in  1987 to deal with the necessity of
  performing adaptive global optimization on multivariate nonlinear
  stochastic  systems[2].   VFSR was recoded and applied to several
  complex systems, in combat analysis[3],  finance[4],  and  neuro-
  science[5].   A  comparison  has  shown  VFSR to be superior to a
  standard genetic algorithm simulation on a suite of standard test
  problems[6],  and  VFSR  has  been  examined  in the context of a
  review of methods of simulated annealing[7].  A project comparing
  standard  Boltzmann  annealing  with "fast" Cauchy annealing with
  VFSR has concluded that VFSR is a superior algorithm[8].  A paper
  has  indicated how this technique can be enhanced by combining it
  with some other powerful algorithms[9].

  2.1.  Efficiency Versus Necessity

       VFSR is not necessarily an "efficient" code.   For  example,
  if  you know that your cost function to be optimized is something
  close to a parabola, then a simple gradient Newton search  method
  most  likely  would  be faster than VFSR.  VFSR is believed to be
  faster and more robust than other simulated annealing  techniques
  for  most  complex problems with multiple local optima; again, be
  careful to note that some problems  are  best  treated  by  other
  algorithms.   If you do not know much about the structure of your
  system, and especially if it has  complex  constraints,  and  you
  need  to  search for a global optimum, then we heartily recommend
  our VFSR code to you.

[Ed's Note:  The original posting has been shortened due to space
constraints.  The removed sections described implementation details and
instructions for using it on specific applications.  Please contact the
authors for complete details. --Alan]

  References

  1.   L.  Ingber  and  B. Rosen, "vfsr," Very Fast Simulated Rean-
       nealing (VFSR) Source Code, NETLIB Electronic  Ftp  Archive,
       netlib@research.att.com (1992).

  2.   L.  Ingber,  "Very fast simulated re-annealing," Mathl. Com-
       put. Modelling, 8, 12, pp. 967-973 (1989).

  3.   L. Ingber, H. Fujio, and M.F. Wehner, "Mathematical compari-
       son of combat computer models to exercise data," Mathl. Com-
       put. Modelling, 1, 15, pp. 65-90 (1991).

  4.   L. Ingber, "Statistical mechanical aids to calculating  term
       structure  models,"  Phys.  Rev.  A,  12,  42, pp. 7057-7064
       (1990).

  5.   L. Ingber, "Statistical mechanics  of  neocortical  interac-
       tions:  A  scaling  paradigm applied to electroencephalogra-
       phy," Phys. Rev. A, 6, 44, pp. 4017-4060 (1991).

  6.   L. Ingber and B. Rosen, "Genetic algorithms  and  very  fast
       simulated  reannealing:  A  comparison," Mathl. Comput. Mod-
       elling, 11, 16, pp. 87-100 (1992).

  7.   L. Ingber, "Simulated annealing:  Practice  versus  theory,"
       Statistics Comput., p. (to be published) (1993).

  8.   B. Rosen, "Function optimization based on advanced simulated
       annealing," Report, University of  Texas,  San  Antonio,  TX
       (1992).

  9.   L. Ingber, "Generic mesoscopic neural networks based on sta-
       tistical mechanics of neocortical interactions," Phys.  Rev.
       A, 4, 45, pp. R2183-R2186 (1992).

  [*]  Some  (p)reprints  can  be  obtained  via anonymous ftp from
       ftp.umiacs.umd.edu [128.8.120.23] in the  pub/ingber  direc-
       tory.

  |  Prof. Lester Ingber               ingber@alumni.caltech.edu  #
  |  P.O. Box 857                                                 #
  |  McLean, VA 22101       703-848-1859 = [10ATT]0-700-L-INGBER  #

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

From: Lester Ingber <ingber@alumni.cco.caltech.edu>
Date: Mon, 30 Nov 1992 07:17:21 -0800
Subject: Very Fast Simulated Reannealing version 6.20

	      VERY FAST SIMULATED REANNEALING (VFSR) (C)

		Lester Ingber ingber@alumni.caltech.edu
				  and
		 Bruce Rosen rosen@ringer.cs.utsa.edu

   The good news is that the people who have gotten our beta version of
   VFSR to work on their applications are very pleased.  The bad news is
   that because of some blunders made in the process of making the code
   user-friendly, the code has to be modified to use as a standalone
   function call.  This bug is corrected and some other fixes/changes
   are made in version v6.20.

   This version is now updated in netlib@research.att.com.  It will
   eventually find its way into the other NETLIB archives.

   To access the new version:

   Interactive
	local% ftp research.att.com
	Name (research.att.com:your_login_name): netlib
	Password: [type in your_login_name or anything]
	ftp> cd opt
	ftp> binary
	ftp> get vfsr.Z
	ftp> quit
	local% uncompress vfsr.Z
	local% sh vfsr

   Electronic Mail Request
	local% mail netlib@research.att.com
	[mail netlib@ornl.gov]
	[mail netlib@ukc.ac.uk]
	[mail netlib@nac.no]
	[mail netlib@cs.uow.edu.au]
	send vfsr from opt
	^D [or however you send mail]

   Lester


     ||  Prof. Lester Ingber               ingber@alumni.caltech.edu  ||
     ||  P.O. Box 857                                                 ||
     ||  McLean, VA 22101       703-848-1859 = [10ATT]0-700-L-INGBER  ||

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

From: capints!evert@relay.nluug.nl (Evert Haasdijk)
Date: Thu, 12 Nov 92 11:08:08 +0100
Subject: Formula approximation

   Hello there,

   I'm writing an article on using GAs to approximate symbolic formulae from
   a set of test-data. I represent these formulae as RPN-trees.  Research
   concentrates on defining meaningful crossover operators. One of the main
   problems is how to control the complexity of generated formulae. Also,
   exploiting building-block features in these formulae ranks high among the
   topics of research.  Does anybody know of similar research? Any pointers
   to articles would be greatly appreciated.

   Thanks in advance, Evert

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

From: hjsong@camool.kaist.ac.kr (Song Hyojeong ( Olive))
Date: Sun, 22 Dec 91 18:21:26 KST
Subject: about Instruction scheduling

  Hi.

  I want to find some references or S/W about GA approach used to
  "instruction scheduling on parallel processors".  If someone who knows
  that give me informations about that, it'll be much help to me.  

  Thank you in advance.

     from Song Hyojeong 
      Computer Architecture Lab.
	Computer Science Department 
	  373-1 KUSEONG-DONG YUSEONG-KU
	    DAEJEON, KOREA.
    e-mail : hjsong@camars.kaist.ac.kr
    phone  : +82-042-869-5559

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

From: "Robert M. Keller" <keller@jarthur.Claremont.EDU>
Date: Mon, 30 Nov 92 9:26:54 PST
Subject: Symposium on Pattern Formation

			SYMPOSIUM on PATTERN FORMATION

			     February 12-13, 1993
			      Harvey Mudd College
			  Claremont, California 91711

  The   symposium   will   provide  a   focus   on  pattern   formation  from
  multidisciplinary  vantage points, particularly  on aspects  of interest to
  biologists,  computer scientists,  mathematicians, and physical scientists.
  It will examine current questions in pattern formation within each of these
  fields and also with cross-disciplinary perspectives.  The area  of pattern
  formation  includes formation  of  both  natural  and  artificial  cellular
  organisms,  formation  of patterns  on  and  within  these  organisms,  and
  space-time  growth patterns.  Of major concern is the formation of emergent
  patterns  through  the  actions  and  interactions  of many semi-autonomous
  units, none of which directs or has full knowledge of the overall process.

  Topics of interest include, but are not limited to:
       Cell growth		Fractals		Morphogenesis
       Cellular automata	Genetic algorithms	Osmotic growth
       Chaotic patterns		Genetic patterns	Percolation theory
       Emergent computation	L-systems		Reaction-diffusion
       Feature formation		

  Partial list of invited speakers and their topics

  Richard Belew, University of California, San Diego  
  Interposing a model of development between neural networks and 
    genetic algorithms

  Bruce Boghosian, Thinking Machines Inc.
  Cellular automata fluids

  Leah Edelstein-Keshet, University of British Columbia  
  Theories of pattern formation based on short and long-ranged interaction

  Stephanie Forrest, University of New Mexico     
  Emergent computation in the immune system

  Scott Fraser, Caltech
  Patterning of the developing brain

  John Gerhart, University of California, Berkeley 

  Rob Shaw, MacArthur Fellow              
  Transitions to turbulence in a reaction-diffusion system

  David Soll, University of Iowa                 
  Rhythmic behavior of cells in chemotactic waves during 
      dicytostelium aggregation

  Requests for participation 

  Requests for participation by  researchers, faculty, and students should be
  directed  to one  of the organizing  committee  listed  below.   Applicants
  should state briefly why they desire to participate and indicate the nature
  of their contribution, if any.  The  number of participants may be  limited
  due  to physical constraints.  Contributed  papers  are welcome  and  it is
  anticipated that  a proceedings will be  published. The final selection  of
  papers will be  made by the organizing  committee in consultation  with the
  advisory board.   A registration fee of $75 U.S. will be charged to  defray
  costs.  The fee will include two lunches and  one dinner  at the conference
  site.  Student participation is  encouraged  and it is  expected that  some
  scholarships will be available.

  Organizing committee

  T.J.  Mueller, Biology (chair)   mueller@hmcvax.claremont.edu, 909-621-8561
  Robert Keller, Computer Science  keller@jarthur.claremont.edu, 909-621-8483
  Robert Borrelli, Mathematics    borrelli@hmcvax.claremont.edu, 909-621-8023
  Stavros Busenberg, Mathematics busenberg@hmcvax.claremont.edu, 909-621-8023
  Harvey Mudd College        
  Claremont, CA 91711

  Symposium advisory board

  Leah Edelstein-Keshet, University of British Columbia
  Scott Fraser, Caltech
  David Goldberg, University of Illinois
  J.D. Murray, University of Washington
  Clifford Pickover, IBM Watson Research Center

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

From: zbyszek@mosaic.uncc.edu (Zbigniew Michalewicz)
Date: Mon, 30 Nov 92 16:28:48 EST
Subject: ISEC-94; preliminary call for papers

                       Preliminary call for papers

           INTERNATIONAL SYMPOSIUM ON EVOLUTIONARY COMPUTATION

                Orlando, Florida, June 25 - July 1, 1994

                     Walt Disney World Dolphin Hotel
                         Disney Village, Florida

  The symposium will be part of the World Congress on Computational
  Intelligence, which will also include the International Conference on
  Neural Networks, FUZZ IEEE '94, and the 1994 Virtual Reality Annual
  International Symposium (VRAIS).  The World Congress is sponsored by the
  IEEE Neural Networks Council.

  There are four major meeting topics: neural networks, fuzzy logic,
  evolutionary computation and virtual reality. The early arrangements are
  (these are not final yet) that during the Congress two meetings would run
  in parallel at the beginning of the week, and two in parallel at the end
  of the week, with some, carefully designed overlap/common-session activity
  during one day in the middle of the week. There would be just one
  registration fee for attendance at all four meetings, but the registrant
  would choose just one Proceedings; the others could be purchased at
  additional fee.

  The time & place are quite attractive. Accomodation arrangements were made
  inside the Disneyworld, and a few games of the 1994 Soccer World Cup are
  scheduled in Orlando at that time. We expect over 1000 participants.

  Authors should submit four (4) copies of their paper (hard copies
  only), received by 15 January 1994, to appropriate Program Co-chair.
  These are:

  America:               Dr. J. David Schaffer
			 Philips Laboratories
			 345 Scarborough Road
			 Briarcliff Manor, NY 10510
			 USA

  Europe:                Dr. H.-P. Schwefel
			 University of Dortmund
			 Department of Computer Science
			 P.O. Box 500 500
			 D-4600 Dortmund 50
			 Germany

  Asia/Australia:        Dr. Hiroaki Kitano
			 Software Engineering Laboratory
			 NEC Corporation
			 2-11-5 Shibaura
			 Minato, Tokyo 108
			 Japan


  I am the General Chair & Program Chair of the Symposium; I will provide
  additional information on the Symposium to the GA Digest at regular
  intervals.

  Zbigniew Michalewicz

******************************************************************************
* Mail: Department of Computer Science      E-mail: zbyszek@mosaic.uncc.edu  *
*       University of North Carolina        Phone:  (704) 547-4873           *
*       Charlotte, NC 28223                 Fax:    (704) 547-2352           *
******************************************************************************

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

