From: IN%"mkant+ai-faq@cs.cmu.edu" 13-AUG-1993 07:30:12.62 To: IN%"news-answers@cs.utexas.edu" CC: Subj: FAQ: Artificial Intelligence FTP Resources 4/6 [Monthly posting] Archive-name: ai-faq/part4 Last-Modified: Mon Jul 19 19:32:33 1993 by Mark Kantrowitz Version: 1.9 ;;; **************************************************************** ;;; Answers to Questions about Artificial Intelligence ************* ;;; **************************************************************** ;;; Written by Mark Kantrowitz ;;; ai-faq-4.text -- 63332 bytes If you think of questions that are appropriate for this FAQ, or would like to improve an answer, please send email to mkant+ai-faq@cs.cmu.edu. Please note that the FTP Resources are now split across parts 4 and 5 of the AI FAQ. Part 4 (FTP Resources): [4-0] General Information about FTP Resources for AI [4-1] FTP Repositories [4-2] FTP and Other Resources Search for [#] to get to question number # quickly. ---------------------------------------------------------------- Subject: [4-0] General Information about FTP Resources for AI Remember, when ftping compressed or compacted files (.Z, .z, .arc, .fit, etc.) to use binary mode for retrieving the files. Files that end with a .z suffix were compressed with the patent-free gzip (no relation to zip). Source for gzip is available from: prep.ai.mit.edu:pub/gnu/{gzip-1.2.3.shar,gzip-1.2.3.tar,gzip-1.2.3.msdos.exe} If you do not have ftp access, you can FTP files by E-mail. Send a message with the word "help" in the body to ftpmail@decwrl.dec.com. In general, see the Lisp FAQ for Lisp-related software and the Prolog Resource Guide and the Prolog FAQ for Prolog-related software. If a Lisp-based or Prolog-based system is listed here, only the ftp site and directory will be listed; for a more detailed description, see the Lisp FAQ and the Prolog Resource Guide. For information on obtaining the Lisp FAQ or the Prolog Resource Guide see [1-0]. When referring to software, "alpha" indicates an internal early release, "beta" indicates an external early release, and "omega" indicates an external "finished" release. Generally an "alpha" release means the creator hasn't yet tested for bugs. ---------------------------------------------------------------- Subject: [4-1] FTP Repositories CMU AI Repository: Construction of the repository is taking longer than expected. (You don't realize how slow ftp is until you try ftping several hundred megabytes at a time.) We're about 90% done collecting materials, and are currently reorganizing the contents. It should become available within a week or two, the end of August at the latest. An announcement will be made to all relevant newsgroups and mailing lists when the repository is ready. Ada Repository: The Ada Repository on wsmr-simtel20.army.mil (mailing list ada-sw@wsmr-simtel20.army.mil) contains a directory of AI programs in PD2:*.*. A somewhat easier to access copy of the archives is available as wuarchive.wustl.edu:/mirrors/ada/ai. UCLA Artificial Life Depository: ftp.cognet.ucla.edu:~ftp/pub/alife [128.97.50.19] Repository of papers, articles, tech reports, software and other items of interest to Artificial Life researchers. It includes an archive of past postings to the alife mailing list, alife@cognet.ucla.edu (send mail to alife-request@cognet.ucla.edu to be added to the list). (Other artificial life information is available from santafe.edu or ftp.santafe.edu [192.12.12.1] in the directory pub/Artificial-Life-III.) Consortium for Lexical Research: clr.nmsu.edu [128.123.1.12] equivalently, lexical.nmsu.edu [128.123.1.12] Archive containing a variety of programs and data files related to natural language processing research, with a particular focus on lexical research. See the file catalog-short for a quick listing of the contents of the archive. Long descriptions are in the info/ subdirectory. Publicly available materials are in the pub/ subdirectory (see pub/catalog). Materials for paid-up members of the Consortium are in the members-only/ subdirectory. Public materials include the Alvey Natural Language Tools, Sowa's Conceptual Graph parser implemented in YACC by Maurice Pagnucco, a morphological parsing lexicon of English, a phonological rule compiler for PC-KIMMO, C source code for the NIST SGML parser, PC-KIMMO sources, the 1911 Roget Thesaurus, and a variety of word lists (including English, Dutch, and male/female/last names). Comments and questions may be directed to lexical@nmsu.edu. FJ Repository: The FJ Repository contains freeware from Japan (FJ = "From Japan"). The fj.sources subdirectory is a good place to look for free software from Japan. Some files in the repository may contain Kana and Kanji characters. The repository is available by anonymous ftp from utsun.s.u-tokyo.ac.jp:fj/fj.sources [133.11.11.11] The file Index contains an index of all the files in each volume. Files of particular interest include: v07/786: Portable Prolog for Common Lisp v25/2577: General-Purpose Fuzzy Inference Library Ver. 3.0 (1/1) Fuzzy Logic Repositories: ntia.its.bldrdoc.gov:pub/fuzzy [132.163.64.201] contains information concerning fuzzy logic, including bibliographies (bib/), product descriptions and demo versions (com/), machine readable published papers (lit/), miscellaneous information, documents and reports (txt/), and programs, code and compilers (prog/). You may download new items into the new/ subdirectory. If you deposit anything in new/, please inform fuzzy@its.bldrdoc.gov. The repository is maintained by Timothy Butler, tim@its.bldrdoc.gov. The Fuzzy Logic Repository is also accessible through a mail server, rnalib@its.bldrdoc.gov. For help on using the server, send mail to the server with the following line in the body of the message: @@ help Other commands available include index, list, find, send, and credits. Ostfold Regional College in Norway recently started a ftp site for material related to fuzzy logic, ftp.dhhalden.no:pub/Fuzzy/ [158.36.33.11]. Material to be included in the archive (e.g., papers and code) may be placed in the upload/ directory. Now holds the files from Togai's mail-server, and other files from Timothy Butler's site ntia.its.bldrdoc.gov. It also includes some demo programs. Send email to Asgeir Osterhus, . Togai InfraLogic, Inc. (TIL) also runs a fuzzy logic email server which contains demo versions of some of their software, fuzzy logic bibliographies, conference announcements, a short introduction to fuzzy logic, copies of the company newsletter, archives of comp.ai.fuzzy, and so on. See the entry in the answer to question [1-8] for more information on the company. To get started with the fuzzy logic email server, send a message with NO SUBJECT LINE to fuzzy-server@til.com, containing just the word "help" in the message body. The server will reply with a set of instructions. Please address any comments, questions or requests to either erik@til.com or tanaka@til.com. Most of the contents of the TIL server is mirrored at Tim Butler's fuzzy logic ftp repository at ntia.its.bldrdoc.gov and at Ostfold ftp repository at ftp.dhhalden.no. For more information, write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718 or call 714-975-8522. The Aptronix FuzzyNet files are available through an email server. Send email to fuzzynet@aptronix.com with "help" in the message body to get instructions on how to retrieve files. "catalog" or "index" will get you a listing of available files. (You can also connect to the FuzzyNet repository by modem to Aptronix FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud.) Files on the server include descriptions of fuzzy logic applications (e.g., washing machines, camera focusing, air conditioning), introductory materials, Fide related information, archives of comp.ai.fuzzy, etc. If you'd like to have a file included in the FuzzyNet server (e.g., moderate length technical reports), send email to Scott Irwin . Genetic Algorithms: The Genetic Algorithms Repository is located at ftp.aic.nrl.navy.mil. It includes past copies of the genetic algorithms digest in /pub/galist/, a copy of Nici Schraudolph's survey of free and commercial GA software in /pub/galist/information/ga-software-survey.txt (send email to to add to the list), and some software, including GAC (a simple GA written in C), GAL (a simple GA written in Common Lisp), GAucsd, GECO (a Common Lisp toolbox for constructing genetic algorithms), GENESIS, GENOCOP, Paragenesis (a parallel version of GENESIS that runs on the CM-200), SGA-C (a C implementation/extension of Goldberg's SGA system). Genetic Programming: The Genetic Programming Repository is located at ftp.cc.utexas.edu:pub/genetic-programming/ [128.83.186.13]. It contains the archives of the genetic programming mailing list (including the GP FAQ posting), papers and source code. The source code includes the GP implementation from Koza's book and some related systems. UC/Irvine (UCI) AI/Machine Learning Repository: ics.uci.edu has a variety of AI-related materials, with a special focus on machine learning. The directory pub/machine-learning-databases contains over 80 benchmark data sets for classifier systems (30mb). Files may also be retrieved by email using the archive server archive-server@ics.uci.edu. Commands to the server should be given in the message body. Some commands are: help send find The help command replies with a useful help message. Site Librarian: Patrick M. Murphy (ml-repository@ics.uci.edu) Off-Site Assistant: David W. Aha (aha@cs.jhu.edu) Machine Learning: Various programs (e.g., ID3) and publications related to machine learning are available by anonymous ftp from the machine learning group (under Raymond Mooney) at UT-Austin, at cs.utexas.edu:pub/mooney. Subdirectories include ml-course information and homeworks from a graduate course in machine learning taught by Dr. Mooney. Homeworks include "miniatures" of various machine learning systems written in Common Lisp. ml-code Common Lisp code corresponding to the assignments for the course in the ml-course directory. ml-progs More "research-level" versions of inductive classification algorithms and software for automated experiments that generation learning curves that compare several systems. papers Publications producted by the machine learning research group. Machine Learning Algorithms Implemented in Prolog: In 1988 the Special Interest Group on Machine Learning of the German Society for Computer Science (GI e.V.) decided to establish a library of PROLOG implementations of Machine Learning algorithms. The library includes - amongst others - PROLOG implementations of Winston's arch, Becker's AQ-PROLOG, Fisher's COBWEB, Brazdil's generation of discriminations from derivation trees, Quinlan's ID3, inverse resolution, and Mitchell's version spaces algorithm. The programs are currently available via anonymous ftp-server from the GMD: ftp.gmd.de:/gmd/mlt/ML-Program-Library [129.26.8.90] Send additional PROLOG implementations of Machine Learning Algorithms, complaints about them and detected bugs or problems to Thomas Hoppe, . Send suggestions and complaints about the ftp library to Werner Emde, Gesellschaft fuer Mathematik und Datenverarbeitung, Bonn, . CMU Simulator Collection: The CMU Simulator Collection is available by anonymous ftp from ftp.cs.cmu.edu [128.2.206.173] in the directory /afs/cs.cmu.edu/project/connect/code/ The collection includes Lisp and C implementations of Scott Fahlman's Cascade Correlation algorithm, Scott Fahlman's Quickprop variation on the back-propagation algorithm, and Scott Fahlman's Recurrent Cascade-Correlation simulator. The collection also includes Aspririn/Migraines and Tesauro. The neural network benchmark collection is available in /afs/cs.cmu.edu/project/connect/bench/ The data sets include the NETtalk data, a vowel recognition task, and several others. The archives of the connectionists mailing list are kept in /afs/cs.cmu.edu/project/connect/connect-archives/ along with a Lisp implementation of a backprop simulator. Funic Neural FTP Archive Site: The Finnish University maintains an archive site containing a large collection of neural network papers and public domain software gathered from FTP sites in the US. The files are available by anonymous ftp from funic.funet.fi:/pub/sci/neural [128.214.6.100]. (Also know as ftp.funet.fi, nic.funet.fi.) See the file 01README for details. A list of mirrored ftp sites is in 04Neural_FTP_Sites. For further information, contact neural-adm@funic.funet.fi or Marko Gronroos (or ). OSU Neuroprose: archive.cis.ohio-state.edu:/pub/neuroprose [128.146.8.52] This directory contains technical reports as a public service to the connectionist and neural network scientific community which has an organized mailing list (for info: connectionists-request@cs.cmu.edu) UKaiserslautern Neural/Fuzzy Repository: The University of Kaiserslautern has set up a ftp server for reports and software related to its neural networks and fuzzy logic projects, including the MOBOT, SPIN, and ALBATROSS projects. Programs currently available include Joerg Bruske's neural fuzzy decision system SPIN-NFDS and Herman Keuchel's unsupervised clustering system. Most of the ready-to-run programs were written for the Apple Macintosh. Sources for the "kernel" of the programs are available by ftp, written in Pascal. The user-interface code is also available upon request. Some of the documentation is in German. The papers and software are available from ag_vp_file_server.informatik.uni-kl.de in the directories Neural_Networks/Reports/ and Neural_Networks/Software/. Some papers and software are also available from ftp.uni-kl.de in the directory reports_uni-kl/computer_science/mobile_robots/. For further information, contact Uwe R. Zimmer . NL Software Registry: The Natural Language Software Registry is a catalogue of software implementing core natural language processing techniques, whether available on a commercial or noncommercial basis. Some of the topics listed include speech signal processing, morphological analysis, parsers, and knowledge representation systems. The catalogue is available from the German Research Institute for Artificial Intelligence (DFKI) in Saarbruecken (Germany) by anonymous ftp to ftp.dfki.uni-sb.de:registry/, email to registry@dfki.uni-sb.de, or physical mail to NL Software Registry, Deutsches Forschungszentrum fuer Kuenstliche Intelligenz, Stuhlsatzenhausweg 3, D-W-6600 Saarbruecken, Germany, or by telephone to +49 (681) 303-5282. Miscellaneous AI: Some miscellaneous AI programs may be found on ftp.uu.net:/pub/ai Most are mirrors of programs available at other sites. AI_ATTIC is an anonymous ftp collection of classic AI programs and other information maintained by the University of Texas at Austin. It includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork, Babbler, Jive, and some AI-related programming languages. This archive is available by anonymous ftp from ftp.cc.utexas.edu (bongo.cc.utexas.edu, 128.83.186.13) in the directory /pub/AI_ATTIC. For more information, contact atticmaster@bongo.cc.utexas.edu. ---------------------------------------------------------------- Subject: [4-2] FTP and Other Resources In addition to programs available free by anonymous ftp, we've included some programs which are available by contacting the authors, and some programs which charge a nominal fee. Agent Modelling: ANIMALS is a simulation system written by Toby Tyrrell, , for his PhD thesis. The thesis examines the problem of action selection when dealing with realistic, animal-like situations: how to choose, at each moment in time, the most appropriate out of a repertoire of possible actions. It includes a description is given of a simulated environment which is an extensive and detailed simulation of the problem of action selection for animals. This simulated environment is used to investigate the adequacy of several theories of action selection (from both ethology and artificial intelligence) such as the drive model, Lorenz's psycho-hydraulic model and Maes' spreading activation network, and outlines deficiencies in each mechanism. Finally, it proposes a new approach to action selection is developed which determines the most appropriate action in a principled way, and which does not suffer from the inherent shortcomings found in other methods. The thesis includes a review and bibliography of existing work on action selection. The thesis is available by anonymous ftp from ftp.ed.ac.uk:pub/lrtt/ [129.215.146.5] as the files as.1.ps.Z, as.2.ps.Z, ..., and as.7.ps.Z. The simulation software is also available from the same site, as the file se.tar.Z. The simulation software was written in Suntools rather than Xtools. It can be run only from SunView or OpenWindows. The action selection problem modelled by the simulated environment comprises 15 different `sub-problems' (getting food, reproducing, not getting lost, being vigilant for predators, etc), many internal and external stimuli, and 35 different low-level actions to select between. ViewGen (Viewpoint Generator) is a Prolog program that implements a "Belief Ascription Algorithm" as described in Ballim and Wilks (see the bibliography section on User Modelling). This can be seen as a form of agent modelling tool, which allows for the generation of arbitrarily deep nested belief spaces based on the system's own beliefs, and on beliefs that are typically held by groups of agents. ViewGen is available by anonymous ftp from crl.nmsu.edu:pub/ViewFinder [128.123.1.18] (user anonymous) ftp.ims.uni-stuttgart.de:pub/ballim [141.58.127.8] (user ftp) as the file ViewGen.tar.Z. The theory of belief ascription upon which it is based is described in detail in Ballim and Wilks, and a general framework for attributing and maintaining nested propositional attitudes is described in Afzal Ballim's dissertation which is archived with the Viewgen program (in the files ViewFinder-{A4/A5/US}.tar.Z, the variable part indicating the format of the PostScript file). The inheritance reasoner is in the file vf-hetis.tar.Z. Implemented in Sicstus prolog, and hence easily convertible to any Edinburgh-style prolog. Contact Afzal Ballim for more information. Analogical Reasoning: SME -- multivac.ils.nwu.edu:pub/SME Contact: Brian Falkenhainer Ken Forbus the Structure-Mapping Engine, as described in Falkenhainer, Forbus, and Gentner's 1987 AIJ article. Artificial Life: Tierra is an artificial life system for studying the evolution of digital organisms. Tierra runs in Unix and MS-DOS. Source code and documentation is available by anonymous ftp at tierra.slhs.udel.edu (128.175.41.34) and life.slhs.udel.edu (128.175.41.33) in the directories almond/, beagle/, doc/, and tierra/. To be added to either the tierra-announce (official announcements only) or tierra-digest (moderated discussion plus announcements) mailing lists, send mail to tierra-request@life.slhs.udel.edu. Send bug reports to tierra-bug@life.slhs.udel.edu. Blackboard Architectures: GBB (PD Version) -- dime.cs.umass.edu:/gbb GEST -- Contact: Susan Coryell Blackboard system. Runs on Symbolics and SUN. Georgia Tech's Generic Expert System Tool (GEST) Available to academic institutions for classroom use. Case-based Reasoning: CL-Protos -- cs.utexas.edu:/pub/porter Contact: Dan Dvorak Ray Bareiss Erik Eilerts Bruce W. Porter MICRO-xxx -- cs.umd.edu:/pub/schank/icbr Contact: waander@cs.umd.edu The directory pub/schank/icbr contains the complete code for "Inside Case-Based Reasoning" by Riesbeck and Schank, 1989. This includes code for an instructional version of CHEF by Kristian Hammond. Chess: The SAN Kit chess programming C source toolkit provides common routines for move notation I/O, move generation, move execution, etc. Only search routines and an evaluation function need be added to obtain a working chess program. It runs on Apple Macintosh (Think C 5.0), Commodore Amiga (SAS C), MS-DOS, and Unix. It is available by anonymous ftp from valkyries.andrew.cmu.edu [128.2.232.4] in the directory pub/chess/misc as the compressed tar file SAN.tar.Z. Also at this site is the SCP package, a restructured ANSI C port of the 1987 Stanback Chess Program. Contact Steven J. Edwards, sje@xylos.ma30.bull.com for more information. Constraint Programming and Non-determinism: SCREAMER: Screamer is an extension of Common Lisp that adds support for nondeterministic programming. Screamer consists of two levels. The basic nondeterministic level adds support for backtracking and undoable side effects. On top of this nondeterministic substrate, Screamer provides a comprehensive constraint programming language in which one can formulate and solve mixed systems of numeric and symbolic constraints. Together, these two levels augment Common Lisp with practically all of the functionality of both Prolog and constraint logic programming languages such as CHiP and CLP(R). Furthermore, Screamer is fully integrated with Common Lisp. Screamer programs can coexist and interoperate with other extensions to Common Lisp such as CLOS, CLIM and Iterate. In several ways Screamer is more efficient than other implementations of backtracking languages. First, Screamer code is transformed into Common Lisp which can be compiled by the underlying Common Lisp system. Many competing implementations of nondeterministic Lisp are interpreters and thus are far less efficient than Screamer. Second, the backtracking primitives require fairly low overhead in Screamer. Finally, this overhead to support backtracking is only paid for those portions of the program which use the backtracking primitives. Deterministic portions of user programs pass through the Screamer to Common Lisp transformation unchanged. Since in practise, only small portions of typical programs utilize the backtracking primitives, Screamer can produce more efficient code than compilers for languages in which backtracking is more pervasive. Screamer is fairly portable across most Common Lisp implementations. It currently runs under Genera 8.1.1 and 8.3 on both Symbolics 36xx and Ivory machines, under Lucid 4.0.2 and 4.1 on Sun SPARC machines, under MCL 2.0 and 2.0p2 on Apple Macintosh machines, and under Poplog Common Lisp on Sun SPARC machines. It should run under any implementation of Common Lisp which is compliant with CLtL2 and with minor revision could be made to run under implementations compliant with CLtL1 or dpANS. Screamer is available by anonymous FTP from ftp.ai.mit.edu as the file /pub/screamer.tar.Z. Contact Jeffrey Mark Siskind for further information. Eliza and Similar Programs: The software from Peter Norvig's book "Paradigms of AI Programming" is available by anonymous ftp from unix.sri.com:pub/norvig and on disk in Macintosh or DOS format from the publisher, Morgan Kaufmann. The software includes Common Lisp implementations of: Eliza and pattern matchers, Emycin, Othello, Parsers, Scheme interpreters and compilers, Unification and a prolog interpreter and compiler, Waltz line-labelling, implementation of GPS, macsyma, and random number generators. For more information, write to Morgan Kaufmann, Dept. P1, 2929 Campus Drive, Suite 260, San Mateo CA 94403, call 800-745-7323, or fax 415-578-0672. (Mac ISBN 1-55860-227-5; DOS 3.5" ISBN 1-55860-228-3; or DOS 5.25" ISBN 1-55860-229-1). The doctor.el is an implementation of Eliza for GNU-Emacs emacs-lisp. Invoke it with "Meta-X doctor". Source code for ELIZA in Prolog (implemented by Viren Patel) is available by ftp from aisun1.ai.uga.edu. muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes a Lisp implementation of Eliza. Compute!'s Gazette, June 1984, includes source for a BASIC implementation of Eliza. You can also find it in 101 more computer games, edited by David Ahl, published by Creative Computing (alas, they're defunct, and the book is out of print). Herbert Schildt "Artificial Intelligence using C", McGraw-Hill, 1987, ISBN 0-07-881255-0, pp315-338, includes a simple version of DOCTOR. ucsd.edu:pub/pc-ai contains implementations of Eliza for the IBM PC. The original Parry (in MLISP for a PDP-10) is available in labrea.stanford.edu:/pub/parry.tar.Z. RACTER is *not* public domain. It costs $50 for MS-DOS and Macintosh versions, the Inrac compiler is $200 (MS-DOS only), and the Inrac manual alone is $25. Racter is available from John Owens, INRAC Corp./Nickers International Ltd., 12 Schubert Street, Staten Island, NY 10305, Tel: 718-448-6283, or Fax: 718-448-6298. Racter was published in 1984, and written in compiled BASIC. To read some of RACTER's work, see "The Policeman's Beard is Half Constructed", Computer Prose and Poetry by Racter, Warner Books, 1984. ISBN 0-446-38051-2 (paperback). Written by William Chamberlain and Thomas Etter. Some discussion of RACTER appears in A.K. Dewdney's book, "The Armchair Universe". The Macintosh version runs only on SEs and Pluses (it comes on a single-sided 400k copy-protected disk, with an old version of the system). Expert Systems: Free ftpable expert system shells are listed in [6-3]. Frame Systems: FrameWork -- ftp.cs.cmu.edu:user/ai/software/kr/frames/framework/ Theo -- Contact: Tom.Mitchell@cs.cmu.edu FrameKit -- Contact: Eric.Nyberg@cs.cmu.edu KR -- Contact: Brad.Myers@cs.cmu.edu PARKA -- Contact: spector@cs.umd.edu Frames for the CM PARMENIDES (Frulekit) -- Contact: Peter.Shell@cs.cmu.edu FROBS -- cs.utah.edu:/pub/frobs.tar.Z Contact: Robert Kessler PFC -- linc.cis.upenn.edu: YAK -- Contact: Enrico Franconi Fuzzy Logic: FLIE -- ural.ethz.ch:/robo/flie Contact: vestli@ifr.ethz.ch Fuzzy Logic Inference Engine, Institute of Robotics, ETH. Game Playing: METAGAME is a game-playing workbench for developing and playing metagame programs. It includes a generator for symmetric chess-like games; definitions of chess, checkers, chinese chess, shogi, lose chess, lose checkers, french checkers, and tic tac toe translated into symmetric chess-like games; a legal move generator; and a variety of player programs, from simple through sophisticated. The METAGAME Workbench runs in Quintus or Sictus Prolog. Available by anonymous ftp from ftp.cl.cam.ac.uk [128.232.0.56] in users/bdp/metagame.tar.Z. For more information, contact Barney Pell of the University of Cambridge Computer Laboratory. Genetic Algorithms: SCS (Simple Classifier System) is a C port of the system from Appendix D of "Genetic Algorithms in Search, Optimization, and Machine Learning" by David E. Goldberg. It was ported to C by Erik Mayer . For more information, contact the author. SCS-C is another port to C of Goldberg's Simple Classifier System. It includes some extensions, and runs on Sun 10/30 and Atari ST. SCS-C is available via anonymous ftp as scs-c-0.98j.tar.Z from lumpi.informatik.uni-dortmund.de:/pub/LCS/src/ [129.217.36.140]. The documentation alone is available as scs-c-doc.tar.Z in the directory /pub/LCS/docs/. For more information, contact Joerg Heitkoetter , c/o Systems Analysis Group, LSXI, Department of Computer Science, University of Dortmund, D-44221 Dortmund, Germany. GENITOR is available by anonymous ftp from the Colorado State University Computer Science Department in beethoven.cs.colostate.edu:pub/GENITOR.tar [129.82.102.183] For further information, contact starkwea@cs.colostate.edu or mathiask@cs.colostate.edu. If these fail to work, contact whitley@cs.colostate.edu. Other packages are described in detail in Nici Schraudolph's survey of free and commercial GA software (see the Genetic Algorithms Repository in [4-1]). Some of the free ones from Nici's list are summarized below. Many are available from the GA Repository. GAucsd Genetic algorithms software cs.ucsd.edu:/pub/GAucsd/GAucsd14.ps.Z [132.239.51.3] Nici Schraudolph To be put on a mailing list of GAucsd users, send the message "add GAucsd" to listserv@cs.ucsd.edu. GAbench Genetic algorithms benchmarks and test problems cs.ucsd.edu:/pub/GAbench/ Thomas Kammeyer (tkammeye@cs.ucsd.edu) EM Evolution Machine (EM) ftp-bionik.fb10.tu-berlin.de:pub/software/Evolution-Machine/ [130.149.192.50] em_tc.exe (EM for Turbo C) em_tcp.exe (EM for Turbo C++) em_man.exe (the manual) Joachim Born Genie GA-based modeling/forecasting system Lance Chambers GENOCOP GEnetic algorithm for Numerical Optimization for COnstrained Problems. Optimizes function with any number of linear constraints (equalities and inequalities) Genetic-2 Optimization package for the linear transportation problem. Genetic-2N Optimization package for the nonlinear transportation problem. All three were developed by Zbigniew Michalewicz and are described in detail in his book "Genetic Algorithms + Data Structures = Evolution Programs", Springer Verlag, August 1992. unccsun.uncc.edu:coe/evol/ [152.15.10.88] (also known as ftp.uncc.edu) Zbigniew Michalewicz WOLF Simulator for G/SPLINES algorithm (genetic spline models) David Rogers GAC, GAL GA written in C/Lisp. Similar to John Grefenstette's Genesis. Bill Spears ESCaPaDE Experiments with evolutionary algorithsm. Frank Hoffmeister (Send mail with subject line "help" or "get ESCaPaDE") mGA1.0 Common Lisp implementation of a messy GA as described in TCGA report 90004. SGA-C C-language port and extension of the original Pascal SGA code presented in Goldberg's book "Genetic Algorithms in Search, Optimization & Machine