
Genetic Algorithms Digest   Tuesday, February 18 1992   Volume 6 : Issue 5

 - 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:
	- FTP now set up for GA-List!
	- Gray code (source)
	- Re: hybrid systems - request for information
	- optimisation of NON-BINARY strings
	- Golden Section

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

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

 Canadian AI Conference, Vancouver, (CFP 1/7)                 May 11-15, 1992
 COGANN, Combinations of GAs and NNs, @ IJCNN-92 (v5n31)      Jun 6,     1992
 ARTIFICIAL LIFE III, Santa Fe, NM                            Jun 15-19, 1992
 10th National Conference on AI, San Jose, (CFP 1/15)         Jul 12-17, 1992
 FOGA-92, Foundations of Genetic Algorithms, Colorado (v5n32) Jul 26-29, 1992
 COG SCI 92, Cognitive Science Conference, Indiana, (v5n39)   Jul 29-1,  1992
 ECAI 92, 10th European Conference on AI (v5n13)              Aug  3-7,  1992
 Parallel Problem Solving from Nature, Brussels, (v5n29)      Sep 28-30, 1992

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

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

From: Alan C. Schultz - GA-List moderator (schultz@aic.nrl.navy.mil)
Date: Tue Feb 18 08:25:13 EST 1992
Subject: FTP now set up for GA-List!

      I am pleased to announce that we have finally set up our ftp
      server for the use of GA-List members via anonymous ftp.
      GA-List readers can now access all back issues of GA-List,
      either by individual issue or as a complete set.  Also, other
      informational files are available.  The top level README file
      is reproduced below.

      To use this service, ftp to ftp.aic.nrl.navy.mil using
      "anonymous" as your user name and your email address as your
      password.  Then cd to pub/galist.  Here is an example
      that shows the log on process and a listing of the
      galist directory: 

      % ftp  ftp.aic.nrl.navy.mil
      Connected to ftp.aic.nrl.navy.mil.
      220 ftp.aic.nrl.navy.mil FTP server (SunOS 4.1) ready.
      Name (ftp.aic.nrl.navy.mil:user): anonymous
      331 Guest login ok, send ident as password.
      Password: jones@cs.gmu.edu             <- Use you email address
      230 Guest login ok, access restrictions apply.
      ftp> cd pub/galist
      250 CWD command successful.
      ftp> dir
      200 PORT command successful.
      150 ASCII data connection for /bin/ls (192.26.18.51,1156) (0 bytes).
      total 607
      -rw-r--r--  1 schultz  mlg       924 Feb 14 21:23 README
      drwxr-xr-x  2 schultz  mlg       512 Feb 18 10:22 conferences
      drwxr-xr-x  2 schultz  mlg      2560 Feb 14 21:03 digests
      -rw-r--r--  1 schultz  mlg    600795 Feb 14 21:05 digests-v6n4.tar.Z
      -rw-r--r--  1 schultz  mlg      2128 Feb 14 21:22 publications
      drwxr-xr-x  4 schultz  mlg       512 Feb 18 10:22 source-code
      226 ASCII Transfer complete.
      278 bytes received in 0.09 seconds (3 Kbytes/s)
      ftp> quit
      %

      Etiquette: Please use your email address as your password.
      This will help us to track usage of the facility.  Also, please
      restrict your usage to off-peak hours.  Do NOT use between
      8:00am and 6:00pm EST Monday through Friday.

      Please remember to use binary mode if you plan to grab any
      non-text files, e.g. tar files.

      Here is part of the top-level README file from the pub/galist
      directory:

        ****************************************
        This directory contains various information for the GA-List digest.

        In this, the top level directory (/pub/galist), you will find the
        following:

      		 README - This file.

           digests-vNnM.tar.Z - A compressed tar file of all ga-list digests
      			  from v1n1 to vNnM where N is the volume
      			  and M is the number.

      		digests - This is a directory that contains the INDEX
      			  and all individual issues.  Issues are each
      			  contained in a file with a name in the form
      			  vNnM, as explained above.  The file INDEX
      			  contains a table of contents for all issues.

      	   publications - This is a list of the more common books,
      			  journals and conference proceedings on
      			  Genetic Algorithms.

      	    conferences - This directory contains the text of
      			  GA-related conference CFPs and announcements.

      	    source-code - This directory contains various source code
      			  as follows:

          source-code/digests - This directory contains source code fragments
      			  that were sent as submissions to ga-list, but
      			  were too large to be put into the digest.
      			  The ga-list issue will then contain an
      			  editors note pointing readers to the proper
      			  file in this directory.  Names should be
      			  obvious; e.g. the file "v6n5-greycode"
      			  contains code from an article on grey codes
      			  that appeared in v6n5 of ga-list.

        source-code/ga-source - This directory will archive Genetic
      			  Algorithm source code. Please contact me to
      			  arrange submission of code.

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

      Enjoy the service, and send any suggestions to the usual place:
      ga-list-request@aic.nrl.navy.mil.

      --Alan C. Schultz (GA-List Moderator)

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

From: Larry Yaeger <larryy@apple.com>
Date: Wed, 8 Jan 92 18:42:32 -0800
Subject: Gray code (source)

   In GA-List v5n11, vose@cs.utk.edu pointed out that Gray coded strings
   could be generated from binary coded strings, and vice versa, by some
   modulo 2 matrix-vector multiplications.  It was suggested that since
   modulo 2 addition and multiplication can be done using XOR and AND,
   respectively, that this technique might provide an efficient means of
   translating between the two representations.

   Following is some source code that implements this technique for arbitrary
   bit-length strings (#define NUMBITS 8, for example).  The matrices that
   are needed for the computation (b2g[][] and g2b[][]) are built on the fly,
   based on NUMBITS.

   I don't know how the efficiency of these routines compares to other
   approaches as this is the only version of a Gray code translator I've
   written.

   However, everybody knows table look-up is generally preferred to actual
   computation, and this is especially true of these Gray codes.  So the main
   feature of the following source code is that it will, upon request
   (#define MAKEINCLUDE 1), produce a "graycode.h" file that properly defines
   an array binofgray[2^NUMBITS] that will take a Gray-coded "integer" and
   look up the corresponding Binary-coded integer.  For 8 bit strings, you
   only invest 256 bytes of storage to reduce your computation to a single
   extra dereference.  A sample (4 bit) include file is included after the
   source code.

   I've compiled this on an Iris using cc and CC (AT&T's CFRONT C++
   "compiler"), and on a Vax using cc and gcc.  For C++ and full ANSI
   compilers, just #define __ANSI__ to get the extra <libc.h> include file
   and to keep the compiler from bugging you about old syntax.  It is
   currently in the form liked by old, generic C compilers.

   The code will show you the bit-patterns (printed to stdout) if you #define
   PRINTOUT 1.  A sample output is appended at the end.  (I admit I prettied
   up the column headers; they're set up for larger bit strings.)

   Enjoy  -  larryy

   P.S. The bin2gray and gray2bin procedures and all the majority of
   variables are only set to unsigned long in order to handle the most
   extreme bit-lengths.  The binofgray[] array is the smallest possible size
   variable that can handle the specified bit-length.


[ED's NOTE: The code has been placed in the ga-list archive (see last message)
            PATH: pub/galist/source-code/digests/v6n5-greycode

	    -- Alan]	    

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

From: yu qian <yuqian@ppc.ubc.ca>
Date: 16 Feb 92 12:35 -0800
Subject: Re: hybrid systems - request for information

   Respose to "hybrid systems - request for information" :
   In GA-List v6n4, S.Khebbal@cs.ucl.ac.uk wrote:

   >>   I am about to do a comprehensive survey of Intelligent Hybrid Systems:
   >>   systems that hybridise/incorporate one or several of the following 
   >>   techniques: 
   >>     Expert Systems, Neural Networks, Genetic Algorithms, Fuzzy Logic, 
   >>     Rule Induction. 
   >>   (eg. ES<->NN, NN<->GA, ES<->FL, GA<->FL, RI<->ES etc ). 

   Listed here are three papers from my colleagues and I addressing the point:

   1.	Qian, Y. and Kristian M. Lien, "Fuzzy Match: a parallel inference 
	   strategy for engineering expert systems",(1991).

   2.	Qian, Y. and Kristian M. Lien, "Application of fuzzy match inference
	   strategy in synthesis of separation systems", (1991).

   3.	Qian Y., Partrick Tessier, and G. Dumont, "Fuzzy logic based 
	   approach for process modeling and optimization", (1992).

   The first two feature Expert-system/fuzzy-logic/rule-induction, while the 
   third one features fuzzy-logic/genetic-algorithms/optimization. 

   Hard copies avaliable upon request.

   Yu Qian
   Department of Chemical Engineering
   The University of British Columbia,
   Vancouver, B.C. V6T 1Z4
   Canada.

   Phone: (604) 822-9146
   Fax: (604) 822-8563

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

From: Leo "A." Kiernan <shrkiern@susssys1.reading.ac.uk>
Date: Mon, 17 Feb 92 11:42:24 GMT
Subject: optimisation of NON-BINARY strings

   I am currently researching the use of genetic algorithms in
   the optimisation of NON-BINARY strings in a task akin to
   understanding written sentences from word level. I would
   appreciate any correspondence on the subject, especially
   with reference to the use of messy GAs.

	Thanks in advance.

	Leo Kiernan,
	Department of Cybernetics,
	School of Engineering & Information Sciences,
	University of Reading, Whiteknights,
	PO Box 225, Reading,
	Berks, RG6 2AY

	FAX:    (0734) 318220
	EMAIL:  shrkiern@uk.ac.reading.susssys1

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

From: Jean-Bernard Condat <0005013469@mcimail.com>
Date: Tue, 11 Feb 92 07:12 GMT
Subject: Golden Section
 
   Hello!

   I work on the golden section in sciences and look at all possible
   references and/or article related to this subject. If you known one, could
   you please send me one copy and/or the reference?

   Thank you very much for your kind help.

   Jean-Bernard Condat
   CCCF
   B.P. 8005
   69351 Lyon Cedex 08 France

   Fax.: +33 1 47 87 70 70
   Phone: +33 1 47 87 40 83
   DialMail #24064
   MCI Mail #501-3469

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