Genetic Algorithms Digest Friday, March 6 1992 Volume 6 : Issue 9 - 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: - Index to Conference Proceedings Wanted - GAC/GAL now available from ga-list ftp site - Discrete solution space mapping - German Visit - Intelligent Imaging at low SNR using Genetic Algorithm - TCGA report announcement - Need info on Neural Net conference - CFP: Biocomputation Workshop: Evolution as a computational process ********************************************************************** CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) Canadian AI Conference, Vancouver, 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 Evolution as a computational process, Monterey (v6n9) Jun 22-24, 1992 ML-92, Machine Learning Conference, Aberdeen (v6n8) Jul 1-3, 1992 10th National Conference on AI, San Jose, 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 SAB92, From Animals to Animats, Honolulu (v6n6) Dec 7-11, 1992 (Send announcements of other activities to GA-List@aic.nrl.navy.mil) ********************************************************************** ---------------------------------------------------------------------- From: Kate Juliff Date: Thu, 27 Feb 92 18:35:09 EST Subject: Index to Conference Proceedings Wanted The proceedings of the latest International Conferences on Genetic Algorithms, are not available at any library in Australia. We can however get individual articles from overseas libraries if we know the author, title and year. Is there anyway of getting index pages of the proceedings from the third conference on? Thanks in advance, Kate Juliff. ------------------------------ From: spears@AIC.NRL.Navy.Mil Date: Thu, 27 Feb 92 18:05:31 EST Subject: GAC/GAL now available from ga-list ftp site In a previous volume of GA-List I announced the availability of my GA code, GAC and GAL (not to be confused with GAC and GIL, one of my favorite nursery rhymes). GAC and GAL are simple GAs, patterned after Genesis, but without many of the bells and whistles of Genesis. GAC is written in C, and GAL is essentially the same code in Lisp. Although I can make no promises that the code is bug free, it has been successfully used by myself for a number of years... Both GAs are available via the ga-list ftp server mentioned in Volume 6, Issue 5. If there are any questions please feel free to contact me at spears@aic.nrl.navy.mil. Feedback is welcome! Bill [Editors Note: You can receive GAC and GAL via anonymous ftp from ftp.aic.nrl.navy.mil. The path is /pub/galist/source-code/ga-source and the files are gac.tar.Z and gal.tar.Z.] ------------------------------ From: sscott@cse.unl.edu (Stephen Scott) Date: Fri, 28 Feb 92 13:25:42 CST Subject: Discrete solution space mapping Hello there, I am beginning research in an area in which the solution space is discrete. I want to know of works that deal with such domains. In particular, when a new population is generated, how can one guarantee that the new members are in the solution space? Any ideas/references/pointers would be welcome. Thanks in advance, Steve Scott sscott@cse.unl.edu ------------------------------ From: Ian Parmi Date: Wed, 26 Feb 92 15:43:20 GMT Subject: German Visit I am intending to visit Germany later this year with the intention of visiting companies / institutions actively involved in the application of the GA and related techniques to Engineering Design. The purpose of these visits will be to discuss such applications, exchange information and to explore common fields of interest. I would be happy to hear from anybody out there who feels that there would be some mutual benefit to such a meeting! Regards, Dr. Ian Parmee (Centre Manager), email: ian@cx.psw.ac.uk Engineering Design Centre, Plymouth Polytechnic South West, Drakes Circus, Plymouth, Devon PL4 8AA UK ------------------------------ From: Badri Roysam Date: Tue, 3 Mar 92 14:21:46 EST Subject: Intelligent Imaging at low SNR using Genetic Algorithm Greetings, I am new to this list, so it is appropriate that I introduce myself. My name is Badri Roysam, and I am on the faculty at Rensselaer Polytechnic Institute in Troy, NY. My interests are in the joint solution of high and low-level vision problems in the specific context of low-signal applications (radar, sonar, emission tomography, confocal microscopy etc.), and parallel processing. We have recently published a paper on the use of a genetic algorithm for simultaneous solution of the following problems from quantum-limited data: * estimation of (x,y) position; * estimation of rotation; * estimation of scale (magnification); * object recognition (from a finite library). In addition to solving a rather big optimization, the genetic algorithm provided a major architectural benefit. It induced packet-switched fault-tolerant parallel architectures. Our implementations were carried out on a 40-node transputer system. Copies of the paper may be requested at roysam@ecse.rpi.edu. Regards, Badri Roysam Assistant Professor Department of Electrical, Computer and Systems Engineering, Rensselear Polytechnic Institute, Troy, NY 12180, USA. (518)-276-8067 Fax: 518-276-6261. ------------------------------ From: rob@galab2.mh.ua.edu Date: Thu, 05 Mar 92 09:59:45 CST Subject: TCGA report announcement The Clearinghouse for Genetic Algorithms at The University of Alabama is pleased to announce the availability of the following technical report: "Optimal Clustering of Power Networks Using Genetic Algorithms" by H. Ding, A.A. El-Keib, and R. E. Smith The University of Alabama Tuscaloosa, Alabama 35487-0286 TCGA Report #92001 Abstract ------ This paper presents a new method for optimal network decomposition based on genetic algorithms (GAs). GAs present a powerful, globally-oriented optimization method which exploits the mechanism of natural genetics working on populations of candidate solutions in an effort to reach optima or near optima. Test results on IEEE standard networks are given and compared with those using simulated annealing. The genetic algorithm approach is found to produce significantly better solutions. Copies of this report can be obtained by contacting me via email, phone, fax, or US mail at the address listed below: Robert Elliott Smith Department of Engineering of Mechanics Room 210 Hardaway Hall The University of Alabama Box 870278 Tuscaloosa, Alabama 35487 <> @ua1ix.ua.edu:rob@galab2.mh.ua.edu <> (205) 348-1618 <> (205) 348-6419 ------------------------------ From: Andrea Lonon Date: Wed, 04 Mar 92 09:00:05 EST Subject: Need info on Neural Net conference If anyone knows any information pertaining to the upcoming NN conference in Baltimore starting June 6, please send the information to me. I need the most important and essential information, such as how to sign up, to whom I should my registration, how much it will cost, etc. Thank you in advance for your help in this matter. Andrea Lonon EMAIL: AMLONO00@UKCC (BITNET) AMLONO00@UKCC.UKY.EDU (INTERNET) ------------------------------ From: rsjuds@snll-arpagw.llnl.gov (judson richard s) Date: Thu, 5 Mar 92 11:55:10 -0800 Subject: CFP: Biocomputation Workshop: Evolution as a computational process CALL FOR PAPERS CALL FOR PAPERS CALL FOR PAPERS BIOCOMPUTATION WORKSHOP Evolution as a computational process June 22-24, 1992 Monterey, CA This workshop brings together biologists, physicists and computer scientists with interests in the study of evolution. The premise of the workshop is that natural evolution is computational process of adaptation to an ever changing environment. Mathematical theory and computer modeling are therefore ideally suited to study evolution and conversely, evolution may be used as a model system to study the computational processes of optimization and emergent pattern formation. Fifteen invited speakers will provide general reviews and summaries of their recent research. Although oral presentations will be limited to invited speakers, original research contributions are solicited for poster sessions in the following areas: natural evolution artificial life genetic algorthms and optimization List of speakers: ---------------- Stuart Kauffman --- University of Pensylvania, Santa Fe Institute Alan Templeton --- Washington University, St. Louis Daniel Hillis --- Thinking Machines Inc. Richard Hudson --- University of California, Irvine Steven Frank --- University of California, Irvine Joseph Felsenstein --- University of Washington Alan Hastings --- University of California, Davis Warren Ewens --- Melbourne University and University of Phil Mark Feldman --- Stanford University Lee Altenberg --- Duke University Aviv Bergman --- SRI and Stanford University Mark Bedau --- Reed College Gary Beluzo --- Holyoke Community College Instructions for Submissions and registration: --------------------------------------------- Authors should submit a single page abstract clearly stating their results by May 15 1992 to the Meeting Coordinator at the address listed below. Please indicate which of the above categories best applies to your paper. There will be no parallel sessions, and the workshop will be structured to stimulate and facilitate the active involvement of all attendees. Registration fees are $100 for full-time Ph.D. students and $250 for all others. Fees include admission to a banquet, at the Monterey aquarium, to be held on Monday night. (There is a $50 discount for students presenting posters at the meeting.) To obtain registration materials, abstract forms and housing information, please contact the meeting coordinator. Organizing Committee: Joachim Buhmann (LLNL), Michael Colvin (SNL), Richard Durbin (MRC), Frank Eeckman (LLNL), Richard Judson (SNL), Nora Smiriga (LLNL) For information only please contact eeckman@mozart.llnl.gov. Electronic submissions only at jb@s1.gov Meeting Coordinator: Chris Ghinazzi P.O. Box 808, L-426 Lawrence Livermore Laboratory Livermore, CA 94550 ------------------------------ End of Genetic Algorithms Digest ******************************