
Genetic Algorithms Digest   Wednesday, September 15, 1993   Volume 7 : 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 (Info in /pub/galist/FTP)

Today's Topics:
	- TCGA report announcement
	- EC Bibliography
	- GA Internet Resources
	- GA-molecule (Was: GA Internet Resources)
	- Basins of Attraction in CA
	- SAC-94 Call For Papers - Second Notice
	- Adaptive Mutation Literature
	- Looking for people in the HP Labs working on GA
	- Anyone working on GAs at Cambridge University, London

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

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

IEE/IEEE Workshop on Nat Alg in Signal Processing, Essex (v7n5) Nov 15-16, 93
AI'93 Workshop on Evolutionary Computation, Melbourne, Aust(v7n16) Nov 16, 93
EP94 3rd Ann Conf on Evolutionary Programming, San Diego (v7n7) Feb 24-25, 94
IEE94 Colloquium on Molecular Bioinformatics, London, UK (v7n21)   Feb 28, 94
SPIE, Neural & Stoch. Methods in Image & Sig Proc, Orlando(v7n18) Apr 5-8, 94
FLAIRS-94 Workshop on Artif Life and AI, Pensacola Beach, FL(v7n23) May 4, 94
The IEEE Conference on Evolutionary Computation, Orlando(v7n10) Jun 26-30, 94
SAB94 3rd Intl Conf on Sim of Adaptive Behavior, Brighton(v7n11) Aug 8-12, 94
ECAI-94, 11th European Conference on AI, Amsterdam (v7n23)       Aug 8-12, 94
ISRAM94 Special Session on Robotics & GAs, Maui, Hawaii (v7n22) Aug 14-17, 94
PPSN-94 Parallel Problem Solving from Nature, Israel (v7n9)      Oct 9-14, 94

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

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

From: Robert Elliott Smith <rob@comec4.mh.ua.edu>
Date: Mon, 23 Aug 93 13:10:02 -0600
Subject: TCGA report announcement

The Clearinghouse for Genetic Algorithms (TCGA) at 
The University of Alabama is pleased to announce the availability of the following
technical report (hardcopy only):

TCGA Report #93002:
APPLICATION OF GENETIC ALGORITHMS TO AIR COMBAT MANEUVERING

B. A. Dike
Operations Analysis Department
McDonnell Douglas Aerospace
St. Louis MO

R. E. Smith
Department of Engineering Science and Mechanics
The University of Alabama
Tuscaloosa AL

SUMMARY:  A machine learning capability using a Genetic
Algorithm (GA) to define air-to-air tactics for agile
fighter aircraft was successfully developed.  Initial
success was achieved with a stimulus-response Learning
Classifier System approach.  The approach was tested in a
comparison between conventional and advanced fighter
aircraft using a digital computer simulation of air-to-air
combat.  The results demonstrated the GA's capability to
discover novel tactics for effective employment of agile
fighter aircraft.

If you would like to receive a copy of this report (hardcopy only), please send you
ground mail address to:
The Clearinghouse for Genetic Algorithms (TCGA)
c/o Robert Elliott Smith
    Department of Engineering Science and Mechanics
    Room 210 Hardaway Hall
    The University of Alabama
    Box 870278
    Tuscaloosa, Alabama 35487
<<email>> rob@comec4.mh.ua.edu
<<phone>> (205) 348-1618
<<fax>> (205) 348-7240    

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

From: fogel@ece.UCSD.EDU (Fogel)
Date: Thu, 26 Aug 93 13:51:51 PDT
Subject: EC Bibliography

Dear Colleagues:

A bibliography of over 400 entries in the area of Evolutionary
Computation (GA/ES/EP/GP) is now available (in BibTeX and postscript
formats) by anonymous FTP from:

magenta.me.fau.edu:/pub/ep-list/bib/EC-ref.bib.Z  ( BibTeX file)
magenta.me.fau.edu:/pub/ep-list/bib/EC-ref.ps.Z  (postscript file)

The above files are compressed. Please make sure you use "binary" mode
when you transfer these files.

Please send any additions and corrections to :

saravan@amber.me.fau.edu or EP-List@amber.me.fau.edu

This is a revised and  greatly enhanced version of references that was
previously made available.

Regards,
David & Saravan

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

From: cramos@conicit.ve (Cesar Ramos Cedeno (CEDITEC))
Date: Sun, 15 Aug 93 18:23:53 AST
Subject: GA Internet Resources

   Dear Netters!  
 
> This is a summary of Internet Resources available to those interested in
> genetic Algorithms related topics.
> 
> I. ACADEMIC DISCUSSION LISTS:
> 
> 1. GA-LIST@AIC.NRL.NAVY.MIL . All administrative details are available from
> GA-LIST-REQUEST@AIC.NRL.NAVY.MIL
> 
> 2. GA-MOLECULE@TAMMY.HARVARD.EDU . All administrative detail are available
> from GA-MOLECULE-REQUEST@TAMMY.HARVARD.EDU
> 
> 3. EVOLUTIONARY-COMPUTING@MAILBASE.AC.UK. All administrative details are
> available from EVOLUTIONARY-COMPUTING-REQUEST@MAILBASE.AC.UK
> 
> II. USENET GROUPS:
> 
> 1. COMP.AI.GENETIC . It deals with genetics Algorithms and AI
> 
> III. FTP ANONYMOUS SITES
> 
> 1.  FTP.AIC.NRL.NAVY.MIL   Directory /pub/galist/FTP

 IV. FREE GA SOFTWARE:
  
  1. LibGa version 1.00 is available using FTP ANONYMOUS from
     Directory /pub/galist/src/ga/libga100.tar.Z at the site above
     indicated .
  2. Other GA Software: a complete Ga-Software-Guide is available at the
     site above indicated. 

V.  ELECTRONIC PUBLICATIONS:
 
1. GA-DiGEST . This publication is available to all GA-LIST Members. The
   last issue Vol. 7, No 22 was published in august. 1993


I am now collecting a complete guide that will be available soon, so I
would greatly appreciate if you send me information on Internet/Bitnet
resources related to GA not listed here. What about stablishing a
GA-GOPHER SERVER?

My best regards,
Cesar Ramos-Cedeno
IVIC, Venezuela


Cesar Ramos-Cedeno
Instituto Venezolano de Investigaciones
Cientificas (IVIC)
Apartado 21827, Caracas 1020A
Phone: +58-2-5011398
Fax:   +58-2-5712557
E-mail: cramos@ivic.ivic.ve
        cramos@dino.conicit.ve 

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

From: ngo@interval.com (Tom Ngo)
Date: Mon, 30 Aug 1993 09:13:09 -0800
Subject: GA-molecule (Was: GA Internet Resources)

Cesar Ramos-Cedeno recently posted a summary of Internet resources
available to those interested in GA-related topics.  Thanks very much,
Cesar!  I would like to clarify one thing about GA-molecule, however;
several people have subscribed who may not be aware of the list's real
intent.

> 2. GA-MOLECULE@TAMMY.HARVARD.EDU. All administrative detail are available
> from GA-MOLECULE-REQUEST@TAMMY.HARVARD.EDU.

GA-molecule is (was) a very small, low-traffic group for people interested
in the application of GA's to molecular-structure prediction (e.g., protein
folding).  Below please find the introductory message.

--Tom Ngo
  GA-molecule maintainer

P.S. As with other mailing lists, please mail subscribe/unsubscribe
requests to the admin address, in this case
ga-molecule-request@tammy.harvard.edu.  If you mail to
ga-molecule@tammy.harvard.edu, the other members of the group receive your
request too.


Unlike GA-List, this is an unmoderated mailing list.  To keep traffic
down and interest up, please abide by the following guidelines:

(1) Write meaningful subject lines.
(2) Keep messages fairly terse.
(3) Refrain from including large portions of previous messages.
(4) Use ga-molecule-request@tammy.harvard.edu for adds/deletes and other admin.
                    =======

Otherwise, feel free to use this forum creatively.  Ideas:
 * Consider all stochastic algorithms fair game.
 * Entertain molecules small and large, biological or not.
 * Discuss half-baked ideas.
 * Share research plans.
 * Announce papers, pre- or post-publication, if appropriate.

Enjoy!                                     ga-molecule@tammy.harvard.edu

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

From: Andrew Wuensche <100020.2727@CompuServe.COM>
Date: 13 Aug 93 06:26:04 EDT
Subject: Basins of Attraction in CA

Basins of Attraction in Cellular Automata

ref recent enquiry from John Boller..

>Is there any literature or anyone familiar with
>Basins of Attraction in Cellular Automata,
>and their relation to Genetic Algorithms?
>I would appreciate anyone who might be able
>to point me in the right direction.

The book "The Global Dynamics of Cellular Automata" and pre-print "The
Ghost in the Machine" detailed below may be of interest..

The pre-print describes recent work on the basins of attraction of
random Boolean networks (disorderd cellular automata), and implications
on memory and learning. Currently only hard-copies are available. To
request copies, send email to:

andywu@cogs.susx.ac.uk, or write to
Andy Wuensche, 48 Esmond Road, London W4 1JQ, UK
dont forget to give a surface mail address.


The Global Dynamics of Cellular Automata
========================================
An Atlas of Basin of Attraction Fields of
One-Dimensional Cellular Automata.

Andrew Wuensche
Mike Lesser

Foreword by Chris Langton
Diskette included for PC-compatible computers.

Santa Fe Institute Studies in the Sciences of Complexity
Reference Vol 1  Addison-Wesley  IBSN 0-201-55740-1  1992  

ABSTRACT
--------
The Global Dynamics of Cellular Automata introduces a new global
perspective for the study of discrete dynamical systems, analogous to
the phase portrait in continuous dynamical systems.

   As well as looking at the unique trajectory of the systems future, 
an algorithm is presented that directly computes the multiple merging
trajectories that may have constituted the system's past. A given set
of cellular automata parameters will, in a sense, crystallize state
space into a set of basins of attraction that will typically have the
topology of branching trees rooted on attractor cycles. The explicit
portraits of these mathematical objects are made accessible. The Atlas
presents two complete classes of such objects: for the 3-neighbour
rules (elementary rules) and for the 5-neighbour totalistic rules. 

   The book looks in detail at CA architecture and rule systems, and
the corresponding global dynamics. It is shown that the evolution of CA
with periodic boundary conditions is bound by general principles
relating to symmetries of the circular array. The rule numbering system
and equivalence classes are reviewed. Symmetry categories, rule
clusters, limited pre-image rules, and the reverse algorithm are
introduced. The Z parameter (depending only on the rule table) is
introduced, reflecting the degree of pre-imaging, or the convergence of
dynamical flow in state space evident in the basin of attraction
field. A relationship between the Z parameter, basin field topology, 
and rule behaviour classes is proposed. A genotype-phenotype analogy
looks at the effect of mutating the rule table to produce mutant basin
fields.

   The accompanying software is an interactive research tool for
generating basins of attraction for any of the 2^32 CA rules in
5-neighbour rule space (for a range of array size), as well as
pre-images, space-time patterns and mutation. The operating
instructions are contained in the book.
                           

The Ghost in the Machine
========================
Basins of Attraction of Random Boolean Networks

Cognitive Science Research Paper 281, University of Sussex, 1993 (to be
published in Artificial Life III, Santa Fe Institute Studies in the
Sciences of Complexity).

Andrew Wuensche

ABSTRACT 
--------
This paper examines the basins of attraction of random Boolean networks,
a very general class of discrete dynamical systems, in which cellular
automata (CA) form a special sub-class. A reverse algorithm is presented
which directly computes the set of pre-images (if any) of a network's
state. Computation is many orders of magnitude faster than exhaustive
testing, making the detailed structure of random network basins of
attraction readily accessible for the first time. They are portrayed as
diagrams that connect up the network's global states according to their
transitions. Typically, the topology is branching trees rooted on
attractor cycles. 

   The homogeneous connectivity and rules of CA are necessary for the
emergence of coherent space-time structures such as gliders, the basis of
CA models of artificial life. On the other hand random Boolean networks
have a vastly greater parameter/basin field configuration space capable
of emergent categorisation.

   I argue that the basin of attraction field constitutes the network's
memory; but not simply because separate attractors categorise state space
- in addition, within each basin, sub-categories of state space are
categorised along transient trees far from equilibrium, creating a
complex hierarchy of content addressable memory. This may answer a basic
difficulty in explaining memory by attractors in biological networks
where transient lengths are probably astronomical.

   I describe a single step learning algorithm for re-assigning
pre-images in random Boolean networks. This allows the sculpting of their
basin of attraction fields to approach any desired configuration. The
process of learning and its side effects are made visible. In the context
of many semi-autonomous weakly coupled networks, the basin field/network
relationship may provide a fruitful metaphor for the mind/brain.

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

From: rogerw@penguin.mcs.utulsa.edu (Roger Wainwright)
Date: Fri, 3 Sep 93 15:47:59 cdt
Subject: SAC-94 Call For Papers - Second Notice

     |                  CALL FOR PAPERS                          |
     |                  ===============                          |
     |                                                           |
     |     1994 ACM Symposium on Applied Computing (SAC'94)      |
     |                                                           |
     |      Genetic Algorithms and Optimization Track            |
     |                                                           |
     |        Phoenix Civic Plaza, Phoenix, Arizona              |
     |                                                           |
     |                  March 6-8 1994                           |

ACM/SAC'94 is the annual conference of the ACM special interest 
group on Applied Computing (SIGAPP), APL (SIGAPL), Biomedical 
Computing (SIGBIO), Business Information Technology (SIGBIT), 
Computer Uses in Education (SIGCUE), Forth (SIGFORTH), and Small 
and Personal Computer (SIGSMALL/PC). 

For the past nine years, SAC has become a primary forum for applied 
computing practitioners and researchers. Once again SAC'94 will be 
held in conjunction with the 1994 ACM Computer Science Conference,
(CSC'94).
 
Applications using genetic algorithms, genetic programming and 
other optimization techniques is one of the major tracks in SAC.
 
The purpose of this track is to provide a forum for the interchange 
of ideas, research, development activities, and applications among 
academicians and practitioners in the areas related to genetic 
algorithms and other optimization techniques in applications.

State-of-the-art and state-of-the-practice original papers 
relevant to the track themes as well as panel proposals are solicited.
 
RELEVANT TOPICS:
  - Genetic Algorithms
  - Genetic Programming 
  - Evolutionary Computing
  - Simulated Annealing
  
POSSIBLE KEYWORDS:
Representation           Genetic Operators          Selection 
Population Dynamics      Population size            Fitness Functions 
Difficult functions      Dynamic environments       Mathematical Foundations
Schema analysis          Transform analysis         Sampling theory 
Dynamical systems        Complexity theory          Parallel computation
Optimization             Implementation techniques  Biological modeling
Population genetics      Molecular genetics         Artificial life 
Evolution and learning   Genetic Programming        Classifier systems 
Evolution Strategies     Messy Genetic Algorithms   Neural Networks 
Simulated annealing

Applications:
      - Vision/signal processing
      - Pattern classification/categorization
      - Control
      - Robotics
      - Design
      - Diagnosis
      - Database/Information retrieval
      - Graphics
      - Graph Layout
      - Load balancing
      - Music
      - Function optimization
      - Combinatorial optimization
      - Scheduling
      - Other (please specify)
      - Constraint satisfaction

GUIDELINES FOR SUBMISSION

Original unpublished papers dealing with any aspect of computing
applications will be considered for presentation and publication
in the SAC'94 Proceedings.  Accepted papers will be published in
the ACM/SAC'94 Conference Proceedings to be printed by the ACM Press. 

In order to facilitate the blind external review process, submission
guidelines must be strictly adhered to:

- Submit 5 copies of your manuscript to the genetic algorithms track 
  chair, (name and address is given below).

- Author names and addresses MUST NOT appear in the body of the paper,
  self-reference must be in the third person, attribution to the
  author(s) must be in the form of "author", and bibliographical entries
  by the author(s) must also be in the form of "author".

- The body of the paper should not exceed 5,000 words (approximately
  20 double-spaced pages).

- A separate cover sheet should be attached to each copy, containing the
  title of the paper, the author(s) and affiliation(s), and the address 
  (including e-mail address and fax number, if available) to which 
  correspondence should be sent.

- Panel proposals must include abstract of the topics and a copy
  of resume/vita of the moderator. 

GENETIC ALGORITHMS TRACK CHAIR:
Roger L. Wainwright
Track Editor SAC'94, Genetic Algorithms
Department of Mathematical and Computer Sciences
University of Tulsa
600 South College Ave.
Tulsa, OK   74104-3189
Ph:  (918) 631-3143
Fax: (918) 631-3077
rogerw@penguin.mcs.utulsa.edu


     |             IMPORTANT DATES                   |
     |                                               |
     |	OCTOBER    1, 1993   PAPER SUBMISSION        |
     |	NOVEMBER  15, 1993   AUTHOR NOTIFICATION     |
     |	DECEMBER  15, 1993   CAMERA-READY COPY DUE   |
     |  MARCH      6, 1994   CONFERENCE BEGINS       |

   For General Inquires Contact The Conference Coordinator
                 Ed Deaton
                 Dept. of Mathematical Sciences
                 San Diego State University
                 San Diego, CA 92182
                 deaton@cs.sdsu.edu
                 Tele: (619)-594-5962
                 Fax:  (619)-594-6746

====================== SAC '94 Organization ======================

1994 SYMPOSIUM ON APPLIED COMPUTING (SAC'94)
March 6-8 Phoenix Civic Plaza, Phoenix, Arizona

CONFERENCE CHAIR
Hal Berghel, Univ. of Arkansas,  hlb@uafhp.uark.edu

PROGRAM CO-CHAIRS:
Terry Hengl, Knowledge Technology, Inc.
Joseph Urban, Arizona State University,   jurban@asuvax.eas.asu.edu

CONFERENCE COORDINATOR
Edmund Deaton, San Diego State University,  deaton@cs.sdsu.edu

SAC STEERING COMMITTEE
Elias Awad                  Univ. of Virginia (SIGBIT)
Hal Berghel                 Univ. of Arkansas (SIGAPP)
George Hedrick              Oklahoma State University
Richard Hetherington        Univ. of Missouri-KC
John Hightower              cal. State (SIGCUE)
Abe Kandel                  Univ. of South Florida
S. Lakshmivarahan           Univ. of Oklahoma
Irving Montanez             Brookhaven Labs (SIGFORTH)
William Poucher             Baylor University
Roy Rada                    University of Liverpool (SIGBIO)
Lynne Shaw                  Consultant (SIGAPL)
John Talburt                Univ. of Arkansas-LR
Glenn Thompson              AMOCO
Elizabeth Unger             Kansas State (SIGSAMLL/PC) 
Joe Urban                   Arizona State University
Roger Wainwright            Univ. of Tulsa
Kam-Fai Wong                ECRC

          SAC'94 IS CO-SPONSERED BY FOLLWOING ACM SIGS

   SIGAPP, SIGAPL, SIGBIT, SIGBIO, SIGCUE, SIGFORTH, and SIGSAMLL/PC

====================== SAC '94 Organization ======================

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

From: Wenceslau Gouveia <wgouveia@dix.Mines.Colorado.EDU>
Date: Tue, 10 Aug 93 13:25:15 -0600
Subject: Adaptive Mutation Literature

Dear colleagues,

I would like to study different approaches for implementing an  
adaptive mutation probability scheme on an evolution algorithm. In  
this sense I'd like to receive references of works previously done  
about this subject.

Any contribution is highly appreciated.

Thanks in advance
Wenceslau Gouveia
Colorado School of Mines

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

From: Chandan Haldar <chandan@chanakya.csa.iisc.ernet.in>
Date: Fri, 13 Aug 93 11:49:29 IST
Subject: Looking for people in the HP Labs working on GA.

Hello everybody!

I'm trying to locate people working at the Hewlett Packard Labs who work on
GA/GP or any applications of these, possibly in circuit, hardware, or program
evolution.  I'll be very grateful for any contact email addresses.
Please email directly to my address below.  Thanks a lot.

- Chandan

 Dr. Chandan Haldar                   | Internet:
 Research Associate                   |   chandan@csa.iisc.ernet.in
 Department of Computer Science       |
               and Automation         | Phone:
 Indian Institute of Science          |   (080) 344411 x2368
 Bangalore 560 012, INDIA             |

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

From: 0000 kalyanmoy deb <deb@iitk.ernet.in>
Date: Fri, 13 Aug 93 16:29:35 +0530
Subject: Anyone working on GAs at Cambridge University, London

I am a graduate student here at Indian Institute of Technology, Kanpur.
I have been working on GAs for quite  some time. 
I would like to know if anybody is working on GAs at the Department of 
Mechanical Engineering at Cambridge University, since I am planning to 
apply for a PhD position there.
Please respond me at deb@iitk.ernet.in. Thanks very much.
N. Srinivas
s.

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

