From nobody@cs.rit.edu Wed Mar 8 19:15:00 2000 -0500 Received: from Sun0.AIC.NRL.Navy.Mil (sun0.aic.nrl.navy.mil [132.250.84.10]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with SMTP id TAA16474 for ; Wed, 8 Mar 2000 19:15:17 -0500 (EST) Received: by Sun0.AIC.NRL.Navy.Mil (4.1/SMI-4.0) id AA03896; Wed, 8 Mar 00 19:15:17 EST Date: Wed, 8 Mar 00 19:15:17 EST From: gadistr@AIC.NRL.Navy.Mil (GA List Moderator) Message-Id: <10003090015.AA03896@Sun0.AIC.NRL.Navy.Mil> To: nobody@cs.rit.edu Subject: GA-List v14n5 Content-Type: text X-Keywords: X-UID: 11 Status: RO Content-Length: 39028 Lines: 1040 Genetic Algorithms Digest Wednesday, Mar 8, 2000 Volume 14 : Issue 5 - Do NOT send email or reply to gadistr@aic.nrl.navy.mil - Send submissions (articles) to GA-List@aic.nrl.navy.mil - Send administrative requests (subscribe, unsubscribe, change of address, etc.,) to GA-List-Request@aic.nrl.navy.mil ********************************************************************** You can access back issues, GA code, conference announcements, etc., either through the WWW at http://www.aic.nrl.navy.mil/galist/ or through anonymous ftp at ftp.aic.nrl.navy.mil [132.250.84.25] in /pub/galist. ********************************************************************** Today's Topics: - GA vs. SA - QUERY: Stochastic optimization via genetic algorithms - Special algorithm for negative fitness problem - Post Doc required - IWLCS-2000 - Soft Computing Technologies for Pattern Recognition (KES'2000) - PPSN 2000 - EXTENDED DEALINE - Multi-objective optimization repository - GAs and capacity planning - ADVIS'2000 CALL FOR PAPERS - Evolving whiskers - Looking for a paper - NRL AI Center Summer Job - REMINDER: CFP: The Second NASA/DoD Workshop on Evolvable Hardware - ISA'2000 Call for Papers - GECCO2000 Workshop On Memetic Algorithms - Extended Deadline - Evolang - Call for participation ------------------------------------------------------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) SAC2000 15th ACM Symp on Applied Comp, Como, Italy Mar 19-21, 00 (v13n16) ACIDCA2000 Int Conf on Artif and Comp Intell, Tunisia Mar 22-24, 00 (v13n29) Evolang Evolution of Language Conference Paris, FR Apr 3-6, 00 (v14n5) GWAL2000 4th German WS on ALife, Bayreuth, Germany Apr 5-7, 00 (v14n4) MICAI2000 Mexican Int Conf on AI, Mexico City, MX Apr 10-14, 00 (v13n13) EuroGP2000 3rd European Conf on GP, Edinburgh, UK Apr 15-16, 00 (v13n19) EVOROBOT2000 3rd Euro WS On Evol Robotics, Edinburgh, UK Apr 17 00 (v13n22) ICES2000 Int Conf on Evolvable Systems, Edinburgh, UK Apr 17-19, 00 (v13n13) OR16 Appl and Science of Comp Intel III, Orlando, USA Apr 24-28, 00 (v13n20) ACDM2000 Adaptive Comp in Design and Manuf, Plymouth, UK Apr 26-28, 00 (v13n9) BioSP3 3rd WS on Bio-Inspired Sols to Para Proc Prob, MX May 1, 00 (v13n21) APGA2000 2nd Asia Pac Conf on GAs and Applications, HK May 3-5, 00 (v13n8) ECNN2000 1st IEEE Symp on Comb of EC/NN, San Antonio, TX May 11-12, 00 (v13n19) ICCS2000 3rd Int Conf on Complex Systems, Nashua, NH USA May 21-26, 00 (v13n28) NC2000 2nd Int ICSC Symp on Neural Computation, Berlin May 23-26, 00 (v13n14) WS2000 7th Viennese WS Opt Ctrl, Dyn Games, & Nonlin Dyn May 24-26, 00 (v13n12) First Robocup Euro Champ, Amsterdam, Netherlands May 28-Jun 2, 00 (v13n29) ECML2000 11th Eur Conf on Machine Learning, Barcelona May 30-Jun 2, 00 (v13n26) WAC2000 8th Int Sym on Robotics with Apps, Maui, Hawaii Jun 11-16, 00 (v13n7) TAINN2000 9th Turkish Symp on AI and NN, Izmir, Turkey Jun 21-23, 00 (v13n28) ICAI2000 Int Conf on Artificial Intelligence, Las Vegas Jun 26-29, 00 (v13n25) RAS2000 Int Conf Recent Advances Soft Comp, Leicester,UK Jun 29-30, 00 (v14n4) EIS2000 2nd Int ICSC Sym on Engr of Intell Sys, UK Jun 29-Jul 2, 00 (v13n16) ICML2000 7th Int Conf on Machine Learning, Stanford Jun 29-Jul 2, 00 (v13n25) UAI2000 16th Conf on Uncertainty in AI, Stanford, CA Jun 30-Jul 3, 00 (v14n4) IPMU2000 8th Int Conf on IP and Manag of Uncer, Madrid Jul 3-7, 00 (v13n15) SCE2000 6th Int Conf on Comp in Eco&Fi, Barcelona, Spain Jul 6-8, 00 (v13n28) GECCO2000 Genetic and EC Conference, Las Vegas, NV, USA Jul 8-12, 00 (v13n24) NNW2000 Neural Network World 2000, Prague, Czech Rep Jul 9-12, 00 (v14n4) 2nd NASA/DoD Workshop on Evolvable Hardware, Silicon Val Jul 13-15, 00 (v14n2) CEC2000 Congress on EC, La Jolla, CA, USA Jul 16-19, 00 (v13n17) FOGA2000 Foundations of GAs, Charlottesville, VA, USA Jul 21-24, 00 (v13n24) IJCNN2000 Int Joint Conf on Neural Networks, Como, Italy Jul 24-27, 00 (v13n23) IAS6 The 6Th Int Conf on Intell Auton Sys, Venice, Italy Jul 25-27, 00 (v13n29) ALIFE VII 7th Int Conf on Artificial Life, Portland, OR Aug 1- 6, 00 (v13n25) PATAT2000 3rd Int Conf Prac & Theor of Auto Timetabling Aug 16-18, 00 (v13n8) ECAI2000 14th Euro Conf on AI, Berlin, Germany Aug 20-25, 00 (v13n26) KES2000 4th Int Conf KB Intell Engr Sys & Allied Tech Aug 30-Sep 1, 00 (v14n4) HUMANOIDS2000 1st IEEE-RAS Conf Humanoid Robots, Boston Sep 7-8, 00 (v14n1) ANTS2000 2nd Int WS on Ant Algorithms, Brussels, Belgium Sep 8-9, 00 (v13n28) SAB2000 Int Conf on Sim Of Adaptive Behavior, Paris, FR Sep 11-15, 00 (v13n24) IWLCS2000 3rd Int WS on Learning Class Systems, Paris Sep 16, 00 (v13n26) PPSNVI Parallel Problem Solving from Nature, Paris, FR Sep 16-20, 00 (v13n24) ISMIS00 Int Sym Meth for Intell Sys, SS on EC, Charlotte Oct 11-14, 00 (v14n1) RSCTC2000 2nd Int Conf Rough Sets & Cur Trends in Comp Oct 16-19, 00 (v13n26) SEAL2000 3rd Asia-Pac Conf on Sim Evol and Learning Oct 25-27, 00 (v13n25) ADVIS2000 1st Biennial Int Conf on Adv in IS, Izmir, TR Oct 25-27, 00 (v14n5) ANNIE2000 Artificial NN in Engineering, St. Louis, MO Nov 5-8, 00 (v14n4) ICARCV2000 6th Int Conf on Cont/Aut/Rob/Vis, Singapore Dec 6-8, 00 (v13n28) ISA2000 Int Congress on Intell Sys and Appl, Sydney, AU Dec 12-15, 00 (v14n5) EMO01 1st Int Con of Evol Multi-Criterion Opt, Zurich Mar 7-9, 01 (v14n4) ISI2001 Int Congress on Info Science Innovations, Dubai Mar 20-23, 01 (v13n25) Send announcements of other activities to GA-List@aic.nrl.navy.mil. ------------------------------ Date: Thu, 24 Feb 2000 10:21:44 +0900 From: Mineo Morohashi Subject: GA vs. SA Hello, I'm looking for papers which refer to compare the performance, or behavior between SA and GA mathematically or analytically. Please let me know if anyone knows some references regarding the topic. Thank you, --- Mineo Morohashi [moro@mineo.com] Systems Biology Group Kitano Symbiotic Systems Project, ERATO URL: http://www.symbio.jst.go.jp/~moro/ TEL: +81-3-5468-1661 FAX: +81-3-5468-1664 ------------------------------ Date: Thu, 24 Feb 2000 12:28:04 +0000 (GMT) From: D Fouskakis Subject: QUERY: Stochastic optimization via genetic algorithms Greetings, and apologies for cross-posting. My PhD supervisor, Prof. David Draper, and I are working on a large global optimization problem arising in Bayesian decision theory applied to an application in health policy. Given binary input variables ( x1, ..., xp ), the problem is to find as many as possible of the k best choices of the xi in a fixed (and rather small) amount of CPU time, where "best" is with respect to maximizing a particular real-valued function f( x1, ..., xp ). For example, with p = 83 and k = 20 there are 2**p (about 10**25) possible choices of ( x1, ..., xp ), from ( 0, ..., 0 ) to ( 1, ... 1 ); call each of these choices a "model". Imagine rank-ordering from largest to smallest all 2**p values of f( x1, ..., xp ). We want to find as many as possible of the 20 biggest such values of f in a small amount of CPU time, and the particular ( x1, ..., xp ) choices associated with these f values. It takes about 1 second at 400 MHz to evaluate f once in our problem, so brute-force enumeration of all possibilities is far from feasible for us. We have instead been looking at a variety of stochastic optimization methods, including simulated annealing (SA), tabu search (TS), and genetic algorithms (GA). Our initial work with GA has been based on what might be termed a plain or "vanilla" implementation of the algorithm, not far from the initial plan laid out by, e.g., Holland JH (1975: Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press). We wish to publish results in the statistics and/or optimization literature comparing GA with SA and TS on our problem, and we are aware that we may be criticized for using such an "old" version of GA. Questions: (1) Are you aware of any specific references in the open literature to more recent versions of GA that might be expected to work particularly well on problems like ours? (2) More generally, if we wish to conduct a literature search of our own to answer question (1), can you recommend to us one or two recent and good survey papers which have tried to summarize the current state of play in GA? In either or both cases, if the answer is yes, could you please send any such references to me? Many thanks in advance for any help you can provide. Best wishes, Dimitris Fouskakis --- DIMITRIS FOUSKAKIS Department of Mathematical Sciences, Tel: +44 1225 826978 Group of Statistics, ROOM 1W 3.8 University of Bath, Fax: +44 1225 826492 Claverton Down, Tel(Home):+44 1225 319290 BATH E-mail: df@maths.bath.ac.uk, BA2 7AY, URL (WWW): UK http: //www.bath.ac.uk/~mapdf/ ------------------------------ Date: Thu, 24 Feb 2000 10:05:46 -0500 From: "Bill Tian" Subject: Special algorithm for negative fitness problem I was looking for some effective algorithm/special treatment for a problem with negative fitness( and positive also). Any informamtion/pointers would be greatly appreciated. Bill Tian ------------------------------ Date: Thu, 24 Feb 2000 16:06:53 +0000 From: Terry Fogarty Subject: Post Doc required South Bank University School of Computing, Information Systems and Mathematics Research Fellow in Evolutionary Computing (FIXED TERM FOR 3 YEARS) Starting Salary from =A317,320 This is a unique opportunity for researchers in the field of evolutionary computation to play their part in an exciting project to build and use an evolutionary computing engine with enormous power. The Distributed Resource Evolutionary Algorithm Machine (DREAM) Project is funded by the European Commission as part of the Universal Information Ecosystems Pro-active Initiative and includes top evolutionary computing research groups from around Europe. The project seeks to provide a universal framework for allowing evolution, co-operation, negotiation and trading of infohabitants across large numbers of machines connected over the Internet. Around 25% of your time will be spent aiding with the administration and co-ordination of the project. You should possess a PhD. in an appropriate discipline and should be an experienced programmer in an object oriented language. Experience of programming for the Internet is desirable. An application form and further details are available from the Human Resources Department, South Bank University, 103 Borough Road, London, SE1 0AA, or telephone: (0171) 815 6223 (24 hour answering service) or email: sharpeb@sbu.ac.uk Closing date for the request of applications: 31 March 2000 For an informal discussion of the post, please contact Terry Fogarty - +44 131 455 4398, fogarttc@sbu.ac.uk. --- Prof. Terence C. Fogarty landline: +44 (0)131 455 4371 * Napier University mobile: +44 (0)772 005 3513 * * 219 Colinton Road email: tcf@dcs.napier.ac.uk * * * Edinburgh EH14 1DJ, UK www: http://www.dcs.napier.ac.uk/~tcf/ ------------------------------ Date: Thu, 24 Feb 2000 18:09:04 +0100 From: iwlcs-2000@psychologie.uni-wuerzburg.de Subject: IWLCS-2000 Dear colleagues, We decided to extend the submission deadline for IWLCS-2000. (http://www.psychologie.uni-wuerzburg.de/iwlcs-2000/) The new deadline is WEDNESDAY, 15 MARCH 2000. Best regards, Wolfgang Stolzmann --- Dr. Wolfgang Stolzmann Universitaet Wuerzburg Inst. f. Psychologie III Roentgenring 11 D-97070 Wuerzburg, Germany Tel. (++49) +931 31 2176 FAX (++49) +931 31 2815 WWW www.psychologie.uni-wuerzburg.de/stolzmann ------------------------------ Date: Sat, 26 Feb 2000 10:49:43 +0100 (MET) From: Franco Masulli Subject: Soft Computing Technologies for Pattern Recognition (KES'2000) We apologize if you receive multiple copies KES'2000 Invitation for papers to the session: "Soft Computing Technologies for Pattern Recognition" (LAST CALL FOR PAPERS) The Fourth International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies (KES'2000), 30 August-1 September 2000, University of Brighton, Sussex, U.K. TOPICS You are invited to submit session papers related, but not limited, to the following topics: a) Neural, Fuzzy and Evolutionary models for supervised and unsupervised classification. b) Multiple Classifiers, Hybrid Models. c) Hardware/Software implementations. d) Applications. e) Others. SUBMISSION OF PAPERS The session chairs forsee a "6 papers" session". Guidelines for Authors of Papers are provided at http://luna.bton.ac.uk/~kes2000/guide.htm Please provide the following information: full name, address, telephone and fax numbers, and E-mail address of the authors. Every paper will be reviewed by two reviewers. Accepted session contributions will be published in the conference proceedings. Please e-mail your papers' postscript files or send your papers to one of the sessions chairs: Dr. Francesco Masulli Dept. Computer and Information Sciences DISI - University of Genoa Via Dodecaneso 35 16146 Genova - Italy masulli@ge.infm.it Dr. Leonard Studer Inst. de Physique des Hautes Energies Batiment des Sciences Physiques Universite de Lausanne CH-1015 Dorigny - Switzerland leonard.studer@iphe.unil.ch DEADLINES Receipt of papers (3 copies): 1 March 2000 Notification of acceptance: 20 March 2000 Receipt of camera-ready copies of papers: 10 April 2000 CONFERENCE INFORMATION For further information about the conference, please visit the conference web site: http://luna.bton.ac.uk/~kes2000/ ------------------------------ Date: Mon, 28 Feb 2000 14:48:05 +0100 (MET) From: Evelyne.Lutton@inria.fr Subject: PPSN 2000 - EXTENDED DEALINE THE SIXTH INTERNATIONAL CONFERENCE ON PARALLEL PROBLEM SOLVING FROM NATURE PPSN VI Paris, France, September 16-20, 2000 EXTENDED DEADLINE FOR SUBMISSIONS: March 10, 2000 http://www.inria.fr/PPSN2000/ Due to the request of numerous authors, the PPSN VI deadline for paper submission has been extended to MARCH, 10, 2000. Electronic submissions are more than ever encouraged. PPSN VI is the sixth edition of the international conference dedicated to all aspects of Natural Computation, a common name for the design, theoretical analysis and empirical understanding of algorithms gleaned from nature. Characteristic for Natural Computation is the metaphorical use of concepts, principles and mechanisms underlying natural systems. ------------------------------ Date: Mon, 28 Feb 2000 18:29:36 +0100 (MET) From: Bernhard Sendhoff Subject: Multi-objective optimization repository Dear colleagues, There have recently been several postings asking for or providing information about the application of evolutionary algorithms to the design optimisation of aerodynamic structures. Prompted by the excellent work of Carlos Coello Coello for multi-objective optimisation and from our own experience, we started a web page on this issue aimed at compiling a bibliography of papers from this area. Therefore, we would like to ask everybody who is working in this area to visit the page at: www.neuroinformatik.ruhr-uni-bochum.de/ini/PEOPLE/bs/BladeOpt/design.html and contribute their research papers in order to realize a comprehensive repository. Thank you and best regards, Bernhard --- Dr.rer.nat. Bernhard Sendhoff Future Technology Research (FTR) HONDA R&D Europe (Deutschland) GmbH Carl-Legien-Strasse 30 Fon: ++49 (0)69 89011-736 63073 Offenbach/Main Fax: ++49 (0)69 89011-749 Germany Bernhard.Sendhoff@hre-ftr.f.rd.honda.co.jp ------------------------------ Date: Mon, 28 Feb 2000 19:26:54 -0600 (CST) From: Ignacio Castillo Subject: GAs and capacity planning Dear List, I would like to know if there is work done on GAs and capacity planning and inventory control. Please let me know. --- Ignacio Castillo Texas A&M University Department of Industrial Engineering 301A Zachry Engineering Center College Station, TX 77843-3131 ------------------------------ Date: Wed, 1 Mar 2000 19:22:44 +0200 (EET) From: advis-org@balina.cs.deu.edu.tr Subject: ADVIS'2000 CALL FOR PAPERS FIRST CALL for PAPERS ADVIS 2000 First Biennial International Conference on Advances in Information Systems 25 - 27 October 2000 Izmir, Turkey "To the memory of Professor Dr. Esen OZKARAHAN" This is the first conference to be held to honor the late Professor Esen Ozkarahan (1940-1999) and his outstanding contributions to databases and information systems. Professor Ozkarahan was one of the pioneers of database machine research as well as the founder of database systems research in Turkey. Moreover, his studies centered on database machines to which he made significant contributions. Professor Ozkarahan is well known for his pioneering work on the RAP (Relational Associative Processor) database machine. He designed RAP to provide hardware implementations of relational databases. RAP includes all the relational algebra operations, and an implicit form of the semi join operation that later became the cornerstone of query optimization in relational databases. Everyone who had the pleasure of knowing Esen Ozkarahan and working with him will always remember his great vision, eminent achievements, and generous friendship. AIMS AND SCOPE The aim of the Conference is to provide a forum for the presentation and in-depth discussion of current research directions in Information Systems as a developing science. It is important to continue consolidating ideas, concepts and models in Information Systems, where movement in this direction is one of the goals of the Conference. In addition to papers in the list of topics, papers both bridging the gap between different directions, and promoting mutual exchange and understanding of researchers in related areas are welcome. CONFERENCE TOPICS The main topics to be covered during conference as follows: * Information Systems (IS) Development and Management * Advanced Programming Paradigms for IS * IS Tools and Environments * Multimedia IS * Information Retrieval * Digital Libraries * Enterprise Knowledge Development * Business Process Models and Reengineering * Cooperative Information Systems * Workflow Management systems * New Applications of IS Technology * Information Privacy and Security * Data Models and Database Design * Deductive and Object-Oriented Databases * Temporal and Spatial Databases * Constraint Databases * Multimedia Databases * Data warehousing and warehouse DBMS * Parallel and Distributed Data Processing * Support for Non-Traditional Data * Applications of Databases * Data Mining and Knowledge Discovery * Knowledge Bases and Expert Systems * Intellectual Interfaces to Data Bases and IS * Decision Support Systems * Intelligent Agent Technology * Neural Networks * Genetics Algorithms * Network Management * Network Applications * Network Performance Analysis LOCATION The conference will be held in Izmir, a major city located in the West Coast of Turkey. Izmir is in close proximity to well known ancient historical sites such as Efesos, Pergamon as well as vacation resorts such as Kusadasi, Cesme, and Foca. COMMUNICATION Mail Address : ADVIS'2000 Dokuz Eylul University Dept. of Computer Engineering Bornova 35100 IZMIR - TURKEY E-Mail : advis@cs.deu.edu.tr WWW : http://advis.cs.deu.edu.tr Phone & Fax : +90 (232) 373 60 40 - 388 03 73 IMPORTANT DATES April 30, 2000 : Submission deadline of extended abstracts June 15, 2000 : Notification of acceptance (by e-mail) July 15, 2000 : Camera ready due October 25-27 : Conference dates [ This submission has been shortened. For the complete CFP, see http://advis.cs.deu.edu.tr -Moderator ] ------------------------------ Date: Thu, 02 Mar 2000 18:25:57 +0000 From: A R Wilson Subject: Evolving whiskers I am currently evolving a rat's whiskers and a neural network to control its behaviour. I would be interested in hearing about any similar work. Cheers. Andy Wilson. ------------------------------ Date: Fri, 03 Mar 2000 16:46:11 +0900 From: Mineo Morohashi Subject: Looking for a paper Hello, Does anyone have following paper? Nix, A.E. and Vose, M.D., "Modeling genetic algorithms with Markov chains", Genetic Algorithms in Artificial Intelligence, Vol.5, No.1, 1992. Would you please send me a copy of it, if any one have the paper? Thank you and regards, --- Mineo Morohashi [moro@mineo.com] Systems Biology Group Kitano Symbiotic Systems Project, ERATO URL: http://www.symbio.jst.go.jp/~moro/ TEL: +81-3-5468-1661 FAX: +81-3-5468-1664 ------------------------------ Date: Fri, 3 Mar 2000 14:04:00 -0500 (EST) From: spears@AIC.NRL.Navy.Mil (William Spears) Subject: NRL AI Center Summer Job Job Opportunity at the Naval Research Laboratory The Navy Center for Applied Research in Artificial Intelligence at the Naval Research Laboratory (NRL) in Washington, D.C. is seeking a qualified computer science graduate student for full-time research on a variety of interesting projects. One project models the spread of viruses and anti-viruses through a network, and the improvement of anti-virus strategies using evolutionary algorithms. Another project uses formal verification and control theoretic methods to ensure the behavior of adaptive and/or evolving agents. A third project involves methods for distributed control of large numbers of agents using artificial physics-inspired forces. The job entails designing novel algorithms and simulation environments, designing experiments and analyzing the data, and implementing demos of the software. This would be a summer position. Job requirements include knowledge of C, Java, and Unix, and experience with graphical interfaces. Applicants must either be U.S. citizens or permanent residents. Compensation will be based on qualifications and experience. Interested candidates please send a resume and three professional references to one of the following: Dr. William Spears Email: spears@aic.nrl.navy.mil Phone: (202)-767-9006 http://www.aic.nrl.navy.mil/~spears Dr. Diana Gordon Email: gordon@aic.nrl.navy.mil Phone: (202)-767-2686 http://www.aic.nrl.navy.mil/~gordon ------------------------------ Date: Mon, 6 Mar 2000 01:35:11 -0800 (PST) From: Jason Lohn Subject: REMINDER: CFP: The Second NASA/DoD Workshop on Evolvable Hardware Call for Papers The Second NASA/DoD Workshop on Evolvable Hardware July 13 - 15, 2000 Silicon Valley, California, USA http://ic.arc.nasa.gov/ic/eh2000 Sponsored by: National Aeronautics and Space Administration (NASA) Defense Advanced Research Projects Agency (DARPA) Hosted by: NASA Ames Information Sciences and Technology Directorate JPL Center for Integrated Space Microsystems (CISM) Evolvable hardware is an emerging field that applies simulated evolution to the design and adaptation of physical structures, particularly electronic systems. The Second NASA/DoD Workshop on Evolvable Hardware (EH-2000) will bring together leading researchers and technologists from academia, government, and industry to discuss advances and the state-of-the-art in this field. Evolvable hardware techniques enable self-reconfigurability and adaptability of programmable devices and thus have the potential to significantly increase the functionality of deployed hardware systems. Moreover, these techniques have the potential to reduce costs by automating numerous design and optimization tasks encountered in engineering design. A focus of this year's workshop is on real-world applications of evolvable hardware. Current application areas include adaptive and reconfigurable computing, circuit and antenna design, and evolutionary robotics. Evolvable hardware methods could also be effective in dealing with increased complexity and reliability requirements in areas such as sensors, MEMS, biomolecular design, quantum computing, and nanoelectronics. Topics to be covered include, but are not limited to: - Evolutionary hardware design (including mechanical and robotic systems, electronic circuit synthesis) - Real-world applications of evolvable hardware - Co-evolutionary methods - Online and offline evolution methods - Hardware/software co-evolution - Testbeds and evolutionary design automation tools - Self-repairing hardware - Self-reconfiguring hardware - Embryonic hardware - Morphogenesis - Novel devices and hardware platforms suitable for evolution - Adaptive hardware, adaptive computing - Adaptive flight hardware Important Dates: Submission deadline: March 17, 2000 Author notification: April 17, 2000 Camera ready manuscript deadline: May 15, 2000 Workshop: July 13-15, 2000 Submission of Papers: Please see the workshop web page at http://ic.arc.nasa.gov/ic/eh2000 For further information please check the workshop web site or contact: Jason Lohn NASA Ames Research Center MS 269-1 Mountain View, CA 94035, USA jlohn@ptolemy.arc.nasa.gov Tel: +1 (650) 604-5138 Fax: +1 (650) 604-3594 [ This submission has been shortened. For the complete CFP, see http://ic.arc.nasa.gov/ic/eh2000 -Moderator ] ------------------------------ Date: Mon, 6 Mar 2000 10:22:03 From: "ICSC Canada" Subject: ISA'2000 Call for Papers We apologize for possible multiple postings due to technical problems. Second Call for Papers International Congress on INTELLIGENT SYSTEMS AND APPLICATIONS (ISA'2000) to be held at the University of Wollongong (near Sydney), Australia from December 12-15, 2000 http://www.icsc.ab.ca/isa2000.htm Honorary Chair: Prof. Hans-Juergen Zimmermann, RWTH Aachen, Germany General Chair: Prof. Fazel Naghdy, University of Wollongong, Australia SPONSORS University of Wollongong, Industrial Automation Research Centre Nortel Networks IEE The Institution of Electrical Engineers IEAust The Institution of Engineers, Australia CRC IMST Cooperate Resarch Centre for Intelligent Manufacturing Systems and Technologies Ltd. ICSC International Computer Science Conventions TOPICS The ISA'2000 Congress aims to provide researchers and practitioners from academia and industry with a forum to report on the latest developments in intelligent systems and their applications within the four major areas of computational intelligence, interactive and collaborative computing, industrial systems, and biologically inspired systems. The Congress will also provide a unique opportunity for dialogue and synergy between scientists and engineers from different backgrounds with the common interest in intelligent systems. The congress includes the following symposia and workshops: SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE (CI'2000) http://www.icsc.ab.ca/151-info.htm Chair: Prof. Franz J. Kurfess, Concordia University, Montreal, Canada - Adaptive and Learning Systems - Artificial Intelligence - Artificial Life - Biocybernetics - Cognitive and Neural Modelling - Evolutionary Computation - Fuzzy Systems - Genetic Algorithms - Knowledge-based Systems - Machine Learning and Perception - Image Processing and Classification - Multi Agent Systems - Neural Networks - Optimization, Heuristics and Search Methods - Parallel and Distributed Computing - Pattern Recognition and Classification - Self-organizing Systems - Statistics and Forecasting A special session and tutorial on INTELLIGENT DECISION SUPPORT FOR LEGAL PRACTICE will be organized in connection with the CI symposium Organizer: John Zeleznikow, La Trobe University, Bundoora, Australia - AI and Law - including Case Based Reasoning, Knowledge Discovery from Databases, Rule Based Reasoning, Soft Computing - DSS to Support Advice about Entitlements - Jurisdential Theories for Building Legal DSS - Law and Information Retrieval - Legal Drafting Systems - WWW Resources for Legal Practice SYMPOSIUM ON INTERACTIVE AND COLLABORATIVE COMPUTING (ICC'2000) http://www.icsc.ab.ca/152-info.htm Chairs: Prof. Yoneo Yano, The University of Tokushima, Japan and Prof. Hiroaki Ogata, The University of Tokushima, Japan - Agent Based Systems - Adaptive and Adaptable Systems - Application for Disabled People - Computer Mediated Communication - Computer Supported Cooperative Work - Computer Supported Collaborative Learning - Cooperative Database Systems - Digital Libraries / Museums - Ergonomic, Interface, and Cognitive Issues - Interactive Learning / Tutoring Environments - Human Computer Interaction - Multimedia, Hypermedia and New Media - User Modeling - Socialware / Communityware - Systems Evaluation - Teleworking / Telelearning Environments - Wearable / Ubiquitos Computing - Internet / Web Based Computing - Virtual and Augmented Realities SYMPOSIUM ON INDUSTRIAL SYSTEMS (IS'2000) http://www.icsc.ab.ca/153-info.htm Chair: Prof. Edward Szczerbicki, University of Newcastle, Australia - Autonomous Decentralized Systems - Behavioral Decision Making - Communications and Transportation Systems - Continuous Simulation and Applications - Data Mining and Knowledge Discovery - Decision Technologies - Design Coordination - Discrete Event Dynamic Systems - Distributed Decision Making - Education and Multimedia - Ecological Monitoring and Simulation Systems - Energy and Environmental Systems - Human Decision Making - Information and Decision Systems - InterNet, IntraNet and Virtual Reality Applications - Manufacturing Systems and Petri Nets - Mass Customization - Qualitative Reasoning Conflict Analysis - Quality & Reliability Engineering - Product Development and Planning - Risk Management - Robotics - Service and Public Sector Systems - Simulation Methodology - Simulation Training Systems - Supervisory Control - Systems Modeling, Analysis and Evaluation - Technology Forecasting - Transportation Systems A workshop on MASS CUSTOMIZATION MANAGEMENT (MCM'2000) will be organized in connection with the IS Symposium: Organizers: Prof. Claus Rautenstrauch, University of Magdeburg, Germany and Dr. Klaus Turwoski, University of Magdeburg, Germany - Planning Methods for Mass Customization - Managing Organic Manufacturing Organizations - Agile Manufacturing - Engineering Concepts and Technologies - Supply Chain Management and Mass Customization - Product Networks - Product Configuration - Case Studies - Service Individualization - Mass Customization Concepts SYMPOSIUM ON BIOLOGICALLY INSPIRED SYSTEMS (BIS'2000) http://www.icsc.ab.ca/153-info.htm Chair: Hans-Heinrich Bothe, Technical University of Denmark - Sensor and Sensory System - Intelligent Sensor Fusion - Computer Vision, Audition, Olfaction, High-level Perception - Smart Human-machine Communication - Autonomous Robots - Behavior based Control - Neuromorphic Engineering - Hardware- and Software Implementations SCIENTIFIC PROGRAM ISA'2000 will include invited plenary talks, contributed sessions, invited sessions, workshops and tutorials. Updated details are available from the ISA'2000 website at http://www.icsc.ab.ca/isa2000.htm CALL FOR INVITED SESSIONS The organization of invited sessions is encouraged. Prospective organizers are requested to send a session proposal (consisting of 4-5 invited papers, the recommended session-chair and co-chair, as well as a short statement describing the title and the purpose of the session) to the respective symposium chair or the congress organizer. Invited sessions should preferably start with a tutorial paper. The registration fee of the session organizer will be waived, if at least 4 authors of invited papers register to the conference. POSTER PRESENTATIONS Poster presentations are encouraged for people who wish to receive peer feedback, and practical examples of applied research are particularly welcome. Poster sessions will allow the presentation and discussion of respective papers, which will also be included in the conference proceedings. CALL FOR WORKSHOPS, TUTORIALS AND OTHER CONTRIBUTIONS Several workshops/tutorials are planned for ISA'2000. Each workshop/tutorial will focus on a particular topic, and consist of several presentations and open discussions. The proposal for a workshop/tutorial should include the title, topics covered, proposed speakers, targeted audiences, and estimated length (hours) of the workshop/tutorial. The proposal should be submitted either to the congress chair, the corresponding symposium chair or the congress organizer by March 31, 2000. SUBMISSION OF PAPERS Prospective authors are requested to either send a draft paper (maximum 7 pages) or an extended abstract for review by the International Program Committee. All submissions must be written in English, starting with a succinct statement of the problem, the results achieved, their significance and a comparison with previous work. Submissions must be received by March 31, 2000. The submission should also include - Title of symposium or workshop (CI'2000, ICC'2000, IS'2000, BIS'2000, MCM'2000) - Type of paper (regular, poster, tutorial or invited) - Authors names, affiliations, addresses - Name of author to contact for correspondence - E-mail address and fax # of contact author - Topics which best describe the paper (max. 5 keywords) - Short CV of authors (recommended) Submission by electronic mail is strongly recommended to icsc@incentre.net or else by fax or mail (2 copies) to the following address: ICSC Canada 5101C - 50 Street Wetaskiwin Alberta T9A 1K1 / Canada Fax: +1-780-352-1913 PROCEEDINGS AND PUBLICATIONS All accepted and invited papers will be included in the congress proceedings, published in print and on CD-ROM by ICSC Academic Press, Canada/Switzerland. A selected number of papers will be nexpanded and revised for possible inclusion in special issues of some prestigious journals. IMPORTANT DATES March 31, 2000: Submission deadline May 31, 2000: Notification of acceptance July 30, 2000: Delivery of full papers December 12-15, 2000: ISA'2000 congress CONGRESS GENERAL CHAIR Prof. Fazel Naghdy School of Electrical, Computer, and Telecommunications Engineering University of Wollongong NSW 2522 / Australia Email: f.naghdy@uow.edu.au CONGRESS ORGANIZER ICSC International Computer Science Conventions 5101C - 50 Street Wetaskiwin AB, T9A 1K1 / Canada Phone: +1-780-352-1912 Fax: +1-780-352-1913 Email Operating Division: operating@icsc.ab.ca Email Planning Division: planning@icsc.ab.ca ------------------------------ Date: Mon, 06 Mar 2000 18:40:11 +0000 From: Natalio Krasnogor Subject: GECCO2000 Workshop On Memetic Algorithms - Extended Deadline Dear Colleagues, The deadline for submitting papers to the Workshop On Memetic Algorithms (WOMA) has been extended to the 24 of March (Friday) 2000. Please read below for more information. Looking forward to meeting you at WOMA, Natalio Krasnogor. ------------------------------ Date: Tue, 7 Mar 100 21:09:32 +0100 (MET) From: Conference Evolang Subject: Evolang - Call for participation *********************************************** ****** Evolution of Language Conference ****** *********************************************** Paris, 3-6 April CALL FOR PARTICIPATION This is the third conference in a series concerned with the evolutionary emergence of speech. From a wide range of disciplines, we seek to attract researchers willing to integrate their perspectives with those of modern Darwinism. The aim is to bring together linguists, computer scientists, anthropologists, palaeontologists, ethologists, geneticists, neuroscientists, and other scientists who are concerned with the question of the origin and evolution of language. All useful information (scientific programme, registration information) can be found at the following address: http://www.infres.enst.fr/confs/evolang Scientific programme: http://www.infres.enst.fr/confs/evolang/program.html Registration information: http://www.infres.enst.fr/confs/evolang/registration.html You may send a message to: evolang-registration@cwtfrance.com or write to Wagonlit Evenements, 16, Rue Ballu - 75009 Paris, France We invite you to consider sending your registration before March 15 to benefit from reduced rates (155 Euros, instead of 230 Euros after this date). The number of available places is limited, and priority will be given to early registrations. Jean-Louis Dessalles ================================================= Conference : The Evolution of Language April 3rd - 6th , 2000 Ecole Nationale Superieure des Telecommunications Paris - France http://www.infres.enst.fr/confs/evolang ================================================= ------------------------------ End of Genetic Algorithms Digest ****************************** From nobody@cs.rit.edu Thu Mar 9 09:22:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id JAA13004 for ; Thu, 9 Mar 2000 09:22:19 -0500 (EST) Date: Thu, 9 Mar 2000 09:22:19 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Clarification of term paper requirements Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 12 Status: RO Content-Length: 1798 Lines: 69 > The project also needs a descriptive paper. This paper (and this paper alone) can carry more than one author (amount to be determined). Suggestion: in case several students are interested in the same application or technology for a term project, it would be excellent for them to communicate extensively, cooperate in the design of experiments and measurement techniques. Then, they can each, say, try to solve the problem in their own, individual manner. For example, there are many variations on GAs: bit-string-based and permutation-based GAs can attack the same problem, as can simulated annealing, tabu search, etc., etc. Even within bit-string GAs there are still lots of variations, and no one student (or small research team) can exhaust the possibilities. I think the comparison approach would be extremely interesting! > An important part of the GA class is the issue of "experimental design." This is experimental CS! With the simple GA code I gave you in meeting 1, there are many parameters that affect the behavior (which I want you to experiment with for programming assignment 1): population size tournament size mutation rate HOW do these parameters affect the speed or success rate of a run? It's important here to learn how to ask such questions set up experiments to answer such questions refine same describe the outputs and pose new approaches Remember: GAs seek to solve problems Well (maybe not perfectly) Quickly but these two desires can work against each other. Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Sat Mar 11 12:21:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id MAA21348 for ; Sat, 11 Mar 2000 12:21:02 -0500 (EST) Date: Sat, 11 Mar 2000 12:21:02 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Lab 1 (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 16 Status: RO Content-Length: 1881 Lines: 88 I'm answering the student's question to the whole group. > Prof. Andersen, > > What exactly is it that you want us to do for the lab? > > Stu Dent The lab that's due meeting 4 requires that you 1. Prove to me that you could find, compile, run my code. 2. Show that you can do some sort of reasonable experimentation using params 3. See if you can show any differences between the convergence behavior of problems 2 and 3 when you use 1 or 2 point xover. 4. Write a short lab report (LaTeX is desirable but not mandatory; eventually nice looking reports are mandatory, but I just want SOMETHING SOON). Feel free to experiment with other problems and to describe the output of all experiments graphically (gnuplot, excell, etc.). Here is another problem you might consider. It's not _serious_ but _toy_: Find a set of positive integers that sums to N with the largest possible product. The number of numbers is not fixed. For example, if N=8, you see which of the following products is largest: 6.2 6.1.1 6.3 5.2.1 5.1.1 4.4 4.3.1 4.2.2 4.2.1.1 4.1.1.1.1 3.3.2 3.3.1.1 3.2.2.1 etc........this is tiring! Besides, I shouldn't even consider the partitions that have 1's in them. Representation: Use a bit string of length N For example, 011110110 represents 8 = 1+4+1+2+1 via the lengths of the blocks of 0's and 1's If N is quite large, you should consider maximizing the sum of the logarithms of the pieces; the product of the pieces can get pretty large. Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ .ig ======= 0's 1's N eample etc........this excell gnuplot params xover ======= .. From nobody@cs.rit.edu Sun Mar 12 14:08:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id OAA29137 for ; Sun, 12 Mar 2000 14:07:13 -0500 (EST) Date: Sun, 12 Mar 2000 14:07:13 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Re: Lab 1 (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 20 Status: RO Content-Length: 1081 Lines: 49 > Dr Andersen, > > If you could go over in class on Tuesday or briefly in an email the > definition of a one and 2 point xover. For some reason I did not get that > in class on Thurs. > > thanks, > Stu Dent Suppose you have 2 individual bit strings, p1 and p2, of length L. These are the "parents". Pick a random number r satisfying 1 <= r <= L-1 Define A1, A2, B1, B2 as follows. p1 = A1 A2 p2 = B1 B2 Juxtaposition denotes bit string concatenation. length(A1) = length(B1) = r Then the children of p1 and p2 using 1-point xover are c1 = A1 B2 c2 = B1 A2 2-point xover works like this: p1 = A1 A2 A3 p2 = B1 B2 B3 where the lengths of corresponding substrings are equal, and these lengths were chosen randomly. You should have: 0 < length(A2) < L c1 = A1 B2 A3 c2 = B1 A2 B3 My C code should make everything clear. Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Sun Mar 12 14:45:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id OAA00632 for ; Sun, 12 Mar 2000 14:45:19 -0500 (EST) Date: Sun, 12 Mar 2000 14:45:19 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Pictures in LaTeX (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 22 Status: RO Content-Length: 603 Lines: 32 > Prof. > > How do I include pictures in LaTeX such as GIF files? I would like to > include the graph that I created for lab1. > > Stu Dent See the examples in /usr/local/pub/pga/Documentation/Lots_of_Features As far as I know, you need to include -.ps figures. Or encapsulated postscript. xv will convert gif files to postscript. --PGA Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Mon Mar 13 13:12:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id NAA06146 for ; Mon, 13 Mar 2000 13:12:15 -0500 (EST) Date: Mon, 13 Mar 2000 13:12:15 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Jforum: MSO Programming tournament (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 27 Status: RO Content-Length: 1435 Lines: 47 This may have hit the streets a little too early in the Quarter for us to win the $500, but it's still a good problem. I recommend that you take a look. --PGA > ---------- Forwarded message ---------- > Date: Sun, 12 Mar 00 14:04:28 -0500 > From: Gilles Kirouac > Reply-To: forum@jsoftware.com > To: J Forum > Subject: Jforum: MSO Programming tournament > > > If you have spare time (do you?) and are challenged by > contests, you might have a look at the third monthly > tournament of MSO (Mind Sports Olympiads). > > http://www.msoworld.com/programming.html > > The contest is to fill a rectangle with tetrominoes. > > The contest is from 17:00 GMT (12:00EST) on March 12 and > runs for a week. 500$ to win. > > To win, you have to QUICKLY submit a FAST solution that has > the SMALLEST EXECUTABLE. A J solution is at a disadvantage > if a full runtime (with the Windows driver) is submitted; > a Linux solution would thus appear preferable. > > > -------------------------------------------------------------------------------- > J Forum: for information about this list, see http://www.jsoftware.com/forum.htm Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Mon Mar 13 13:15:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id NAA06612 for ; Mon, 13 Mar 2000 13:14:48 -0500 (EST) Date: Mon, 13 Mar 2000 13:14:47 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Re: Lab 1 (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 28 Status: RO Content-Length: 916 Lines: 35 > ---------- Forwarded message ---------- > > What do you mean by the following: > 3. See if you can show any differences between > the convergence behavior of problems 2 and 3 > when you use 1 or 2 point xover. > > I am not quite sure what you mean by convergence. Do you mean their > likelihood to arrive at the same value within the same timeframe? The good schemas for one of these two problems are compact, for the other problem they are wide. The wide ones are more subject to disruption by 1 and 2 point xover. Presumably, uniform xover would affect both equally. See Goldberg's discussion. --PGA Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Mon Mar 13 23:12:00 2000 -0500 Received: from d185fc416.rochester.rr.com (IDENT:root@d185fc416.rochester.rr.com [24.95.196.22]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id XAA29182 for ; Mon, 13 Mar 2000 23:11:56 -0500 (EST) From: nobody@d185fc416.rochester.rr.com Received: (from nobody@localhost) by d185fc416.rochester.rr.com (8.9.3/8.9.3) id XAA25297 for ga@cs.rit.edu; Mon, 13 Mar 2000 23:14:57 -0500 Message-Id: <200003140414.XAA25297@d185fc416.rochester.rr.com> Subject: 3SAT data To: ga@cs.rit.edu Date: Mon, 13 Mar 2000 23:14:57 -0500 (EST) Reply-To: nobody@cs.rit.edu (Peter Anderson) X-Mailer: ELM [version 2.5 PL1] MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset=us-ascii X-Keywords: X-UID: 30 Status: RO Content-Length: 1965 Lines: 138 Here is a copy of one of a large number of sample data files for the "3SAT" problem. I found these file starting at the O.R. Library: http://www.ms.ic.ac.uk/info.html (which is a rich source of problems and links to problems). Take a look at this file -- understand it? The "p" line says that there are 20 variables and 91 clauses. Then come the 91 clauses. I'm not sure what the three lines with the "?" are telling us. c This Formular is generated by mcnf c c horn? no c forced? no c mixed sat? no c clause length = 3 c p cnf 20 91 4 -18 19 0 3 18 -5 0 -5 -8 -15 0 -20 7 -16 0 10 -13 -7 0 -12 -9 17 0 17 19 5 0 -16 9 15 0 11 -5 -14 0 18 -10 13 0 -3 11 12 0 -6 -17 -8 0 -18 14 1 0 -19 -15 10 0 12 18 -19 0 -8 4 7 0 -8 -9 4 0 7 17 -15 0 12 -7 -14 0 -10 -11 8 0 2 -15 -11 0 9 6 1 0 -11 20 -17 0 9 -15 13 0 12 -7 -17 0 -18 -2 20 0 20 12 4 0 19 11 14 0 -16 18 -4 0 -1 -17 -19 0 -13 15 10 0 -12 -14 -13 0 12 -14 -7 0 -7 16 10 0 6 10 7 0 20 14 -16 0 -19 17 11 0 -7 1 -20 0 -5 12 15 0 -4 -9 -13 0 12 -11 -7 0 -5 19 -8 0 1 16 17 0 20 -14 -15 0 13 -4 10 0 14 7 10 0 -5 9 20 0 10 1 -19 0 -16 -15 -1 0 16 3 -11 0 -15 -10 4 0 4 -15 -3 0 -10 -16 11 0 -8 12 -5 0 14 -6 12 0 1 6 11 0 -13 -5 -1 0 -7 -2 12 0 1 -20 19 0 -2 -13 -8 0 15 18 4 0 -11 14 9 0 -6 -15 -2 0 5 -12 -15 0 -6 17 5 0 -13 5 -19 0 20 -1 14 0 9 -17 15 0 -5 19 -18 0 -12 8 -10 0 -18 14 -4 0 15 -9 13 0 9 -5 -1 0 10 -19 -14 0 20 9 4 0 -9 -2 19 0 -5 13 -17 0 2 -10 -18 0 -18 3 11 0 7 -9 17 0 -15 -6 -3 0 -2 3 -13 0 12 3 -2 0 -2 -3 17 0 20 -15 -16 0 -5 -17 -19 0 -20 -18 11 0 -9 1 -5 0 -19 9 17 0 12 -2 17 0 4 -16 -5 0 % 0 ======================================= Peter G. Anderson, Computer Science Department Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 http://www.cs.rit.edu/~pga/ nobody@cs.rit.edu ========> Do not "respond" to this mail. ========> Use the email address above. ======================================= From nobody@cs.rit.edu Wed Mar 15 21:56:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id VAA02777 for ; Wed, 15 Mar 2000 21:56:23 -0500 (EST) Date: Wed, 15 Mar 2000 21:56:22 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Re: Another question... In-Reply-To: <00031521420100.00361@Blaze> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 34 Status: RO Content-Length: 652 Lines: 27 On Wed, 15 Mar 2000, Stu Dent wrote: > Another question... > > In the first GA lab, do you want us to just use your code and play with the > params, or do you want us to re-implement the problem from scratch? > > Stu Dent > Re-implement all you choose, but that's not required. What I'm looking for is for you all to really understand what is going on in this simple example. --PGA Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Wed Mar 15 22:03:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id WAA03036 for ; Wed, 15 Mar 2000 22:03:31 -0500 (EST) Date: Wed, 15 Mar 2000 22:03:31 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Gleason's matrix problem Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 35 Status: RO Content-Length: 1136 Lines: 45 In class Tuesday, we discussed whether Gleason's matrix problem had local optima which were not global optimum. I have an example. I'll use + and - for +1 and -1 The matrix: + + - - + - + + + + + - + + + has a majority of +'s in every row and column, hence it cannot be improved by any single row or column sign inversion. However, it can be improved by inverting the top row and the first two columns, getting: + + + + + + - + + + - + + + + And this looks to me like the best we can achieve, although I'm not sure exactly how to prove it. There are 256 = 2^(3+5) inversion patterns, so we could check the claim by exhaustion. But there must be a more eloquent way. More interesting: prove that this problem is NP complete! To do so, we need to be able to polynomially convert some known NP-complete problem to this. HOW? (I' offering gobs of extra credit). --PGA Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Sat Mar 18 09:51:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id JAA29199 for ; Sat, 18 Mar 2000 09:51:37 -0500 (EST) Date: Sat, 18 Mar 2000 09:51:37 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: CA question Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 38 Status: RO Content-Length: 984 Lines: 30 > Professor Anderson, > > In class on Thursday you were talking about a cellular automata problem where > an array of cells has a goal of setting its own state to the majority state > at t=0. I was kind of wondering something about the problem. Can cells > have information stored in them? Like a list of previous states or just a > few memory variables? Or is its knowledge at any time totally dependent > on its current state and its neighbors' current states? Your last sentence captures the notion totally A CA just tiles the line (or plane, etc.) with identical FSMs. These FSMs are not different form those in CS Theory, I. The Pascal triangle reduced mod 2 is a good example I wish I had gone into in more depth. Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Sat Mar 18 13:48:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id NAA05254 for ; Sat, 18 Mar 2000 13:48:01 -0500 (EST) Date: Sat, 18 Mar 2000 13:48:01 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Re: Lab 2 In-Reply-To: <38D39F8C.A1F7FAFE@cs.rit.edu> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 40 Status: RO Content-Length: 1993 Lines: 64 > Prof. Andersen, > > The labs that are posted on the web site are very vague - is it possible > for you to give a little more explanation? They are deliberately vague. It is now up to the students to supply both the functional specs and the design and implementation. I supply the requirements spec: I want these problems solved. > Also for Labs 3+, I was wondering if there were descriptions of these > problems elsewhere on the web( N queens, etc ). I would like to read a > full description rather than trying to remember from class. Gosh - I thought the N Queens problem was well-know since Gauss's letters: place 8 mutually non-attacking Queens on an 8x8 chessboard. Then, replace 8 with N (e.g., 10, 20, 1000). A super-Queen is whatever you might want it to be. Classically, its moves are the union of those of a Queen and a knight (so many N-Queen solutions are just a pattern of knight's moves; this breaks up that pattern). Queens move on a 3D chessboard according to your own choices, e.g., the Queen can move from to (x,y,z) to (p,q,r) in case |x-p| = |y-q| = |z-r| (but this is just a for-instance!). Students' grades in this course will mostly depend on the performance on the major term project and accompanying papers and presentation. To prepare for that, experiment with a variety of problems and techniques. This is a time for experimentation and fun. I know I'm scaring the bejeebers out of some students with this sort of policy, but it's important to prepare for the important real-world tasks of seeking out what needs to be done, doing it well, floating an IPO, giving your old professors stock options, and donating gobs back to RIT so they can build a filed house! OK? Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Tue Mar 21 19:54:00 2000 -0500 Received: from Sun0.AIC.NRL.Navy.Mil (sun0.aic.nrl.navy.mil [132.250.84.10]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with SMTP id TAA29429 for ; Tue, 21 Mar 2000 19:54:51 -0500 (EST) Received: by Sun0.AIC.NRL.Navy.Mil (4.1/SMI-4.0) id AA25121; Tue, 21 Mar 00 19:54:44 EST Date: Tue, 21 Mar 00 19:54:44 EST From: gadistr@aic.nrl.navy.mil (GA List Moderator) Message-Id: <10003220054.AA25121@Sun0.AIC.NRL.Navy.Mil> To: nobody@cs.rit.edu Subject: GA-List v14n6 Content-Type: text X-Keywords: X-UID: 43 Status: RO Content-Length: 48191 Lines: 1181 Genetic Algorithms Digest Friday, Mar 17, 2000 Volume 14 : Issue 6 - Do NOT send email or reply to gadistr@aic.nrl.navy.mil - Send submissions (articles) to GA-List@aic.nrl.navy.mil - Send administrative requests (subscribe, unsubscribe, change of address, etc.,) to GA-List-Request@aic.nrl.navy.mil ********************************************************************** You can access back issues, GA code, conference announcements, etc., either through the WWW at http://www.aic.nrl.navy.mil/galist/ or through anonymous ftp at ftp.aic.nrl.navy.mil [132.250.84.25] in /pub/galist. ********************************************************************** Today's Topics: - Experimental methodology - ANNIE 2000 - GA information - Re: Special algorithm for negative fitness problem - Re: QUERY: Stochastic optimization via genetic algorithms - CFP: special issue of JoM-EMIT on "Computational Memetics" - Workshop On Memetic Algorithms - First CFP GECPEM - ACDM2000 Registration - New IlliGAL Reports Announcement (March, 2000) - Journal Special Issue CFP (reminder) - posting - (MVL-IJ) Call For Papers - Book Announcement - GECCO 2000 Evolvable Hardware Workshop ------------------------------------------------------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) SAC2000 15th ACM Symp on Applied Comp, Como, Italy Mar 19-21, 00 (v13n16) ACIDCA2000 Int Conf on Artif and Comp Intell, Tunisia Mar 22-24, 00 (v13n29) Evolang Evolution of Language Conference Paris, FR Apr 3-6, 00 (v14n5) GWAL2000 4th German WS on ALife, Bayreuth, Germany Apr 5-7, 00 (v14n4) MICAI2000 Mexican Int Conf on AI, Mexico City, MX Apr 10-14, 00 (v13n13) EuroGP2000 3rd European Conf on GP, Edinburgh, UK Apr 15-16, 00 (v13n19) EVOROBOT2000 3rd Euro WS On Evol Robotics, Edinburgh, UK Apr 17 00 (v13n22) ICES2000 Int Conf on Evolvable Systems, Edinburgh, UK Apr 17-19, 00 (v13n13) OR16 Appl and Science of Comp Intel III, Orlando, USA Apr 24-28, 00 (v13n20) ACDM2000 Adaptive Comp in Design and Manuf, Plymouth, UK Apr 26-28, 00 (v13n9) BioSP3 3rd WS on Bio-Inspired Sols to Para Proc Prob, MX May 1, 00 (v13n21) APGA2000 2nd Asia Pac Conf on GAs and Applications, HK May 3-5, 00 (v13n8) ECNN2000 1st IEEE Symp on Comb of EC/NN, San Antonio, TX May 11-12, 00 (v13n19) ICCS2000 3rd Int Conf on Complex Systems, Nashua, NH USA May 21-26, 00 (v13n28) NC2000 2nd Int ICSC Symp on Neural Computation, Berlin May 23-26, 00 (v13n14) WS2000 7th Viennese WS Opt Ctrl, Dyn Games, & Nonlin Dyn May 24-26, 00 (v13n12) First Robocup Euro Champ, Amsterdam, Netherlands May 28-Jun 2, 00 (v13n29) ECML2000 11th Eur Conf on Machine Learning, Barcelona May 30-Jun 2, 00 (v13n26) WAC2000 8th Int Sym on Robotics with Apps, Maui, Hawaii Jun 11-16, 00 (v13n7) TAINN2000 9th Turkish Symp on AI and NN, Izmir, Turkey Jun 21-23, 00 (v13n28) ICAI2000 Int Conf on Artificial Intelligence, Las Vegas Jun 26-29, 00 (v13n25) RAS2000 Int Conf Recent Advances Soft Comp, Leicester,UK Jun 29-30, 00 (v14n4) EIS2000 2nd Int ICSC Sym on Engr of Intell Sys, UK Jun 29-Jul 2, 00 (v13n16) ICML2000 7th Int Conf on Machine Learning, Stanford Jun 29-Jul 2, 00 (v13n25) UAI2000 16th Conf on Uncertainty in AI, Stanford, CA Jun 30-Jul 3, 00 (v14n4) IPMU2000 8th Int Conf on IP and Manag of Uncer, Madrid Jul 3-7, 00 (v13n15) SCE2000 6th Int Conf on Comp in Eco&Fi, Barcelona, Spain Jul 6-8, 00 (v13n28) GECCO2000 Genetic and EC Conference, Las Vegas, NV, USA Jul 8-12, 00 (v13n24) NNW2000 Neural Network World 2000, Prague, Czech Rep Jul 9-12, 00 (v14n4) 2nd NASA/DoD Workshop on Evolvable Hardware, Silicon Val Jul 13-15, 00 (v14n2) CEC2000 Congress on EC, La Jolla, CA, USA Jul 16-19, 00 (v13n17) FOGA2000 Foundations of GAs, Charlottesville, VA, USA Jul 21-24, 00 (v13n24) IJCNN2000 Int Joint Conf on Neural Networks, Como, Italy Jul 24-27, 00 (v13n23) IAS6 The 6Th Int Conf on Intell Auton Sys, Venice, Italy Jul 25-27, 00 (v13n29) ALIFE VII 7th Int Conf on Artificial Life, Portland, OR Aug 1- 6, 00 (v13n25) PATAT2000 3rd Int Conf Prac & Theor of Auto Timetabling Aug 16-18, 00 (v13n8) ECAI2000 14th Euro Conf on AI, Berlin, Germany Aug 20-25, 00 (v13n26) KES2000 4th Int Conf KB Intell Engr Sys & Allied Tech Aug 30-Sep 1, 00 (v14n4) HUMANOIDS2000 1st IEEE-RAS Conf Humanoid Robots, Boston Sep 7-8, 00 (v14n1) ANTS2000 2nd Int WS on Ant Algorithms, Brussels, Belgium Sep 8-9, 00 (v13n28) SAB2000 Int Conf on Sim Of Adaptive Behavior, Paris, FR Sep 11-15, 00 (v13n24) IWLCS2000 3rd Int WS on Learning Class Systems, Paris Sep 16, 00 (v13n26) PPSNVI Parallel Problem Solving from Nature, Paris, FR Sep 16-20, 00 (v13n24) ISMIS00 Int Sym Meth for Intell Sys, SS on EC, Charlotte Oct 11-14, 00 (v14n1) RSCTC2000 2nd Int Conf Rough Sets & Cur Trends in Comp Oct 16-19, 00 (v13n26) SEAL2000 3rd Asia-Pac Conf on Sim Evol and Learning Oct 25-27, 00 (v13n25) ADVIS2000 1st Biennial Int Conf on Adv in IS, Izmir, TR Oct 25-27, 00 (v14n5) ANNIE2000 Artificial NN in Engineering, St. Louis, MO Nov 5-8, 00 (v14n4) ICARCV2000 6th Int Conf on Cont/Aut/Rob/Vis, Singapore Dec 6-8, 00 (v13n28) ISA2000 Int Congress on Intell Sys and Appl, Sydney, AU Dec 12-15, 00 (v14n5) EMO01 1st Int Con of Evol Multi-Criterion Opt, Zurich Mar 7-9, 01 (v14n4) ISI2001 Int Congress on Info Science Innovations, Dubai Mar 20-23, 01 (v13n25) Send announcements of other activities to GA-List@aic.nrl.navy.mil. ------------------------------ Date: Fri Mar 17 14:51:09 EST 2000 From: GA Digest Moderators Subject: Experimental methodology With several EC related conferences having paper deadlines in the spring, many of you are currently or have recently been involved with either writing or reviewing papers in the area. Given that much of the research being done in our field is empirical, of importance to us, both when doing our own research and reviewing that of others, are the elements of a good experimental methodology. We would like to present the following questions to the readers of GA Digest for discussion: 1. What are the basic and necessary components of a good experimental methodology? 2. What are the requirements of a good conference or journal paper with regard to the presentation of experimental results. 3. What can we learn from other fields with respect to experimental methodology? -- Mitch Potter and Annie Wu ------------------------------ Date: Wed, 8 Mar 2000 09:32:40 -0700 From: "Buczak, Anna L." Subject: ANNIE 2000 On behalf of the organizing committee I would like to invite you to attend ANNIE 2000 ( http://www.umr.edu~annie/annie2000.htm ) which will be held November 5th-8th, 2000, at the Marriott Pavilion Hotel in downtown St. Louis, Missouri, USA. This will be the tenth international gathering of researchers interested in Smart Engineering System Design using neural networks, fuzzy logic, evolutionary computation (Genetic Algorithms, Evolutionary Programming, Evolution Strategies etc.), complex systems, data mining, and rough sets. Each previous conference drew approximately 150 papers from twenty countries. The proceedings of all conferences have been published by ASME Press as hardbound books in nine volumes. The latest volume, edited by Dagli, et. al., was titled "Smart Engineering System Design: Neural Networks, Fuzzy Logic, Evolutionary Programming, Data Mining, and Complex Systems." You can visit ANNIE home page for details of these conferences http://www.umr.edu/~annie/ . ANNIE 2000 ( http://www.umr.edu/~annie/annie2000.htm ) will cover the theory of Smart Engineering System Design techniques, namely: neural networks, fuzzy logic, evolutionary computation, complex systems, data mining, and rough sets. Presentations dealing with applications of these technologies are encouraged. The organizing committee invites all persons interested in Computational Intelligence to submit papers for presentation at the conference. You can submit your abstracts online at http://www.umr.edu/~annie/oas.htm . All papers accepted for presentation will be published in the conference proceedings. They will be reviewed by two referees, senior researchers in the field, for technical merit and content. AUTHORS SCHEDULE April 15, 2000: Extended deadline for contributed paper abstract, information sheet, and letter of intent. May 5, 2000: Deadline for full papers. June 16, 2000: Notification of status of contributed papers. July 21, 2000: Deadline for camera ready manuscripts. In addition, ANNIE 2000 will offer special sessions (http://www.umr.edu/~annie/ss.htm) on "Pattern Recognition for Safer Driving", " Evolvable Hardware", and "Black Box System Identification". There is also a one-day workshop on Neural Networks in Medicine and Biology" (http://www.umr.edu/~annie/workshop.htm). Approximately six pages will be allocated for each accepted paper in the proceedings. All accepted papers will be published as a hardbound book by ASME Press. Authors are requested to submit the following by April 15, 2000: 1) an abstract (up to 200 words) 2) an information sheet that includes the full name of the authors, address, phone and FAX number, E-mail,Web address 3) a letter of intent Authors should forward their letter of intent, information sheet, abstract, and full paper to: Dr. Cihan H. Dagli, Conference Chair Smart Engineering Systems Laboratory Department of Engineering Management University of Missouri - Rolla 1870 Miner Circle Rolla, MO 65409-0370, USA Phone: (573) 341-6576 or (573) 341-4374 FAX: (573) 341-6567 E-Mail: annie@umr.edu -or- dagli@umr.edu Internet: http://www.umr.edu/~annie Looking forward to meeting you in St. Louis Anna L. Buczak, Ph.D. Information and Decision Technology Honeywell Technology Center Honeywell Inc. 101 Columbia Rd., Morristown, NJ 07962-1021 phone: 973-455-3676; fax: 973-455-5991 e-mail: anna.buczak@honeywell.com ------------------------------ Date: Wed, 8 Mar 2000 15:50:06 -0600 From: Jorge Ramirez Subject: GA information i'm looking for information (applications, algoritms, articles, new stuff, history) about genetic algorithms, if you could send me any information i'd be more than thankful... Jorge Mario Ramirez Camargo Programador Gerencia de Inform=E1tica Banco de Desarrollo Rural de Guatemala, S.A. > Tels. (502) 361-6263, 332-0068, 3341383 mailto:jramirez@banrural.com.gt mailto:georgemrc@yahoo.com ------------------------------ Date: Thu, 09 Mar 2000 00:16:30 +0100 From: Emanuel Falkenauer Subject: Re: Special algorithm for negative fitness problem Hello, >I was looking for some effective algorithm/special treatment for a problem >with negative fitness( and positive also). Any informamtion/pointers would >be greatly appreciated. Just wanted to point out that unlike roulette, tournament or ranking selection schemes are oblivious to negative fitness values. Cheers, Emanuel. ------------------------------ Date: Thu, 09 Mar 2000 00:16:15 +0100 From: Emanuel Falkenauer Subject: Re: QUERY: Stochastic optimization via genetic algorithms Hello, The essence of Dimitris Fouskakis' query boils down to the following: >[...] the problem is to find [...] best choices for xi [...] with respect >to maximizing a particular real-valued function f( x1, ..., xp ). With such a loose definition of the problem, the best reference to look up is definitely Wolpert David H. and Macready William G., "No Free Lunch Theorems for Search", Technical Report SFI-TR-95-02-010, The Santa Fe Institute, 1995. That paper shows that Dimitris has basically NO chance to get anywhere, what- ever method he tries. Indeed, a "particular real-valued function" can really be anything - and the NFLT shows us that on such a large set of objective functions, all algorithms are equally good (i.e., equally bad). The correct interpretation of the NFLT is, as far as I am concerned, that you MUST restrict the target problem in some reasonable way, and exploit the resulting (fixed) structure in any efficient algorithm. A much les ambitious, yet more GA-related discussion of the issue can also be found in Falkenauer Emanuel, "Genetic Algorithms and Grouping Problems", Wiley, 1998. Cheers, Emanuel. ------------------------------ Date: Thu, 09 Mar 2000 09:33:25 +0000 From: B.Edmonds@mmu.ac.uk Subject: CFP: special issue of JoM-EMIT on "Computational Memetics" CFP for a Special Issue on: Computational Memetics Journal of Memetics - Evolutionary Models of Information Transmission http://www.cpm.mmu.ac.uk/jom-emit Papers are solicited for a special issue of the Journal of Memetics - Evolutionary Models of Information Transmission. The special issue will focus on computational models of memetics, broadly conceived. Example topics include: o simulation models of information evolution and transmission o computational culture o computational anthropology o formal models of memetics o computational social learning theory o computational approaches to the evolution of language o gene/culture co-evolution simulation o computer models of cognitive ecology o models of memetic activity on the internet Although all papers on the above topics will be considered, particular attention will be paid to submissions which: 1.lay out a formal model of the phenomena in question, and 2.support the model with computer-based simulation or other computational methods. Submissions are due by 15 September 2000. It is anticipated that the special issue will be released before the end of the year. All submissions should comport to the format and style requirement outlined at: http://www.cpm.mmu.ac.uk/jom-emit/ifa.html Submissions, and queries, are to be directed to the special issue editors: Michael L. Best Media Laboratory Massachusetts Institute of Technology http://www.media.mit.edu/~mikeb mikeb@media.mit.edu Bruce Edmonds Centre for Policy Modelling Manchester Metropolitan University http://www.cpm.mmu.ac.uk/~bruce b.edmonds@mmu.ac.uk ------------------------------ Date: Thu, 09 Mar 2000 12:07:28 +0000 From: Natalio Krasnogor Subject: Workshop On Memetic Algorithms Dear Colleagues, The deadline for submitting papers to the Workshop On Memetic Algorithms (WOMA) has been extended to the 24 of March (Friday) 2000. Please read below for more information. Looking forward to meeting you at WOMA, Natalio Krasnogor. Dear Colleague, You are invited to submit papers to the "Workshop on Memetic Algorithms (WOMA)". WOMA will be held within the "Genetic and Evolutionary Computation Conference (GECCO-2000)" in Las Vegas, Nevada, U.S.A. the 8th of July 2000 at the Riviera Hotel and Casino. Memetic algorithms (MAs) are evolutionary algorithms (EAs) that apply a separate local search process to refine individuals (i.e. improve their fitness by hill-climbing). Under different contexts and situations, MAs are also known as hybrid EAs, genetic local searchers, Baldwinian EAs, Lamarkian EAs, etc. Combining global and local search is a strategy used by many successful global optimization approaches, and MAs have in fact been recognized as a powerful algorithmic paradigm for evolutionary computing. In particular, the relative advantage of MAs over EAs is quite consistent on complex search spaces. It is the purpose of this workshop to bring together researchers working on the general topic of Memetic Algorithms. This workshop will provide a forum for identifying and exploring the key issues that affect the theory, design and application of MAs. Submissions details like deadlines, style, publication, etc are described in WOMA's home page at http://www.ics.uwe.ac.uk/~natk/WOMA/WOMA.html. Authors are invited to submit 2 to 4 pages-long extended abstracts papers. The papers must fulfill GECCO-2000 main conference papers formatting instructions. The planned deadlines for authors are: * March 24, 2000 NEW submittion deadline (electronic copies preferable) * April 1, 2000 notification of acceptance/rejection * April 10, 2000 camera ready deadline (ONLY hard copies accepted) All submittions (electronics/hard copies) must be sent to Bill Hart (wehart@sandia.gov) The organizers of the WOMA will appreciate if you can send as soon as possible a letter of intention that will help with organizational matters. Furthermore, if you have any inquiry please don't hesitate to contact any of the organizers. Looking forward to hearing from you soon. William Hart Natalio Krasnogor Jim Smith. Contact Details: William E. Hart Optimization/Uncertainty Estimation Dept (9211), MS 1110 P.O. Box 5800, Sandia National Labs Albuquerque, NM 87185-1110 Phone: (505) 844-2217 FAX: (505) 845-7442 Email: wehart@sandia.gov Natalio Krasnogor Intelligent Computer Systems Centre Faculty of Computer Studies and Mathematics University of the West of England Coldarbour Lane, Bristol, BS16 1QY United Kingdom. Phone: +44 (0) 117 3443357 FAX : +44 (0) 117 9750416 Email: Natalio2.Krasnogor@uwe.ac.uk Jim E. Smith Intelligent Computer Systems Centre Faculty of Computer Studies and Mathematics University of the West of England Coldarbour Lane, Bristol, BS16 1QY United Kingdom. Phone: +44 (0) 117 3443161 FAX : +44 (0) 117 9750416 Email: James.Smith@uwe.ac.uk ------------------------------ Date: Fri, 10 Mar 2000 10:35:08 -0500 From: Oswaldo Velez-Langs Subject: First CFP GECPEM FIRST ANNOUNCEMENT AND CALL FOR PAPERS First International Workshop GENETIC AND EVOLUTIONARY COMPUTATION PARADIGM IN EDUCATIONAL MODELS FOR ENGINEERING (GECPEM) Oswaldo Velez-Langs July 8, 2000, Las Vegas, USA At the Genetic and Evcolutionary Computation Conference (GECCO-2000) July 8-12 (Saturday-Wednesday), 2000 Las Vegas, Riviera Hotel, Nevada, USA. The GEC paradigm as new ?Thinking school? is force to contribute with the transformation of the structures of the educational systems, in the revolution of the programs and to procure for an orientation mores focused to the future. The GEC is compromise with to question to the status quo. If is the school the appropiate place for the instruction and the new education must stimulate the beyond society: Must the school change itself for this? This new educational model must to prepare to the students for temporal organizations, for to change dinamically for an organization to another and to change himself. The new engineers must be more interdisciplinaries and ready to adquire new traits within their perfomance. This workshop invites discussion on general issues of EC in the context of Educational Models, including (but not limited to): GEC for Curriculum GEC for emerging creativity GEC in Intelligent design systems GEC in ?Learn to know?and?Learn to do? in Engineering The format of workshop will be breakout groups with individual surveys and 15-minute long presentations, each followed by a 15 minute discussion. The emphasis of the workshop will be on the discussion of GEC paradigm for Educational issues of general interest. Participation Those interested in making a presentation at the workshop should send a 2-3 page extended abstract to the organizer before March 31, 2000. Preferable in Word format (*.Doc files) or electronic format (Postcript or PDF). Presentations that promote discussion are wlcome, regardless of their publication or submission status. Papers presented at the workshop will be included in the workshop summary that will be published as a suplement to the main GECCO proceedings. Attendace to the workshop is open to all GECCO attendees. The registration fee for the workshop is included in the conference?s registration fee. Summaries due: March 31 Notification of acceptance: April 6, 2000 Final papers due: April 20, 2000 Workshop: July 8, 2000 Please contact to the organizer for questions or suggestions regarding this workshop. Oswaldo Velez-Langs Director Programa Ingenieria de Sistemas Facultad de Ingenierias Wk. (57) 4 7840340 Corporacion Universitaria del Sinu FAX (57) 4 7840677 Carrera 1w calle 38 olangs@unisinu.edu.co, olangs@usa.net Monteria, Colombia ------------------------------ Date: Fri, 10 Mar 2000 17:22:40 -0000 From: "Pat Trundley" Subject: ACDM2000 Registration !!Reduced Registration until March 20th!! ************************************** 4th International Conference on Adaptive Computing in Design and Manufacture ACDM2000 26th - 28th April 2000 Sherwell Centre, University of Plymouth, UK Incorporating NETWORKS DAY 27th April ***************************************** As in previous years ACDM2000 explores the utility of various evolutionary / adaptive search algorithms and complementary computational intelligence techniques within design and manufacturing. The Plymouth conference has become a well- established biennial event, attracting an international audience of leading researchers and practitioners in the field. The conference retains the support of several UK Engineering Institutions and is now recognised by the International Society for Genetic and Evolutionary Computation as a mainstream event. The true potential of evolutionary and adaptive computing within the design and manufacture field is now becoming very apparent with significant research effort moving away from relatively straightforward optimisation to investigate interactive exploratory systems, multi-disciplinary decision support, evolutionary and agent-assisted multi-objective strategies and problems relating to appropriate design representation. These aspects are fully explored during ACDM2000 which maintains its policy of single stream presentation and associated poster and demonstrator sessions. In most cases results from application to or integration with real- world industrial problems are very much in evidence. Topics this year include: * aerospace engineering * mechanical engineering * thermal engineering * structural engineering * urban planning * food and chemical design * network design * cell formation * facility design * system control * robotics The Joint Networks Event on April 27th brings together related UK EPSRC and European networks for a poster and software demonstrator session. A full programme plus registration form is available at: http://www.tech.plym.ac.uk/soc/research/edc/acdm2 000.html Contact details: Conference Administrator ptrund@soc.plym.ac.uk Tel: +44(0)1752 233508, Fax: +44(0)1752 233529 Plymouth Engineering Design Centre ------------------------------ Date: Sun, 12 Mar 2000 16:46:46 -0600 From: Martin Pelikan Subject: New IlliGAL Reports Announcement (March, 2000) The Illinois Genetic Algorithms Laboratory (IlliGAL) is pleased to announce the publication of the following new technical reports. Most IlliGAL technical reports, as well as reprints of other publications, are available in hardcopy and can be ordered from the IlliGAL librarian, (see below for ordering information). The technical reports in this announcement are also available electronically on our ftp and WWW servers (see the end of this announcement for ftp and WWW access instructions). ========================== IlliGAL Report No 2000008 First Cognitive Capabilities in the Anticipatory Classifier System Wolfgang Stolzmann, Martin V. Butz, Joachim Hoffmann, and David E. Goldberg Abstract: This paper adds a new viewpoint to the Anticipatory Classifier System (ACS). It approaches the system from a psychological perspective and thus provides new insights to the current system. The main learning mechanism in the ACS, the Anticipatory Learning Process (ALP), evolved out of the psychological learning theory of anticipatory behavioral control. The paper compares the ALP directly to this theory and reveals the similarities. Moreover, it investigates the behavior of the ACS. By simulating previously published rat experiments, the paper compares the behavior of the ACS with the behavior of the rats. Finally, two further cognitive mechanisms are introduced to the ACS. These two mechanisms result in an animal-like behavior of the ACS in the simulations. Furthermore, they prove the usability of the internal environmental model for reward-learning tasks for the first time. ========================== IlliGAL Report No 2000009 Some Reflections on Learning Classifier Systems David E. Goldberg Abstract: I appreciate the editors' invitation to contribute to this important volume marking what must be called a renaissance of learning classifier systems (LCSs). Although I have kept my finger in the LCS pie through occasional papers on LCS subjects, the main body of my work shifted following my 1983 dissertation applying genetic algorithms (GAs) and LCSs to gas pipeline control; in recent years, I have largely focused my efforts to develop (1) an effective methodology for the design of GAs, (2) an integrated design theory for selectorecombinative GA design, (3) competent genetic algorithms-GAs that solve hard problems, quickly, reliably, and accurately, and (4) efficiency enhancement technologies (EETs) for faster solutions. In this short essay, I'd like to give some personal reflections on why I shifted my work away from learning classifier systems, what I learned from those efforts, and why I am renewing a more active program in LCS research. I start by reflecting on my involvement in classifier systems back in the eighties. ========================== IlliGAL Report No 2000010 Research on the Bayesian Optimization Algorithm Martin Pelikan and David E. Goldberg Abstract: This paper summarizes our recent research on the Bayesian optimization algorithm (BOA) and outlines the directions our research in this area has been following. It settles the algorithm in the problem decomposition framework used often to understand the complex behavior of genetic algorithms. It provides the most important research issues to tackle and reviews our recent progress in each of these areas. ========================== IlliGAL Report No 2000011 Pruefernumbers and Genetic Algorithms: A lesson how the low locality of an encoding can harm the performance of GAs Franz Rothlauf and David Goldberg Abstract: When handling tree networks, researchers have sometimes tried using the pruefernumber representation for encoding networks, but GAs often degraded or broke down when used on this encoding. This paper investigates the locality of the pruefernumber and its effect on the performance of a Genetic Algorithm (GA). The locality describes how the neighborhood of the genotype is preserved, when constructing the phenotype (the tree) from the genotype (the pruefernumber). It is shown that the locality of the pruefernumber is highly irregular on the entire solution space and that the performance of a GA depends on the structure of the optimal solution. A GA is able to perform well only for networks that have a good locality (stars). For all other types of networks (lists, trees) the locality is low and a GA fails to find the best list or tree. Using a GA with the pruefernumber encoding can be useful, when the good solutions tend to be a star. The locality of an encoding could have a strong influence on the performance of a GA. When choosing encodings for optimization problems, researchers should be aware of this and be careful with low locality encodings. If the locality of the encoding is low, a failure of the GA is often inescapable. ========================== IlliGAL Report No 2000012 Large-Scale Permutation Optimization with the Ordering Messy Genetic Algorithm Dimitri Knjazew and David E. Goldberg Abstract: This paper presents a scaling analysis of the ordering messy genetic algorithm (OmeGA), a fast messy genetic algorithm that uses random keys to represent solutions. In experiments with hard permutation problems - so-called ordering deceptive problems - it is shown that the algorithm scales up as O(l^1.4) with the problem length l ranging from 32 to 512. Moreover, the OmeGA performs efficiently with small populations thereby consuming little memory. Since the algorithm is independent of the structure of the building blocks, it outperforms the random key-based simple genetic algorithm (RKGA) for loosely coded problems. ========================== IlliGAL Report No 2000013 Genetic Algorithms, Clustering, and the Breaking of Symmetry Martin Pelikan and David E. Goldberg Abstract: This paper introduces clustering as a tool to improve the effects of recombination and incorporate niching in evolutionary algorithms. Instead of processing the entire set of parent solutions, the set is first clustered and the solutions in each of the clusters are processed separately. This alleviates the problem of symmetry which is often a major difficulty of many evolutionary algorithms in combinatorial optimization. Furthermore, it incorporates niching into genetic algorithms and, for the first time, the probabilistic model-building genetic algorithms. The dynamics and performance of the proposed method are illustrated on example problems. ========================== IlliGAL Report No 2000014 Investigating Generalization in the Anticipatory Classifier System Martin V. Butz, David E. Goldberg, and Wolfgang Stolzmann Abstract: Recently, a genetic algorithm (GA) was introduced to the Anticipatory Classifier System (ACS) which surmounted the occasional problem of over-specification of rules. This paper investigates the resulting generalization capabilities further by monitoring in detail the performance of the ACS in the highly challenging multiplexer task. Moreover, by comparing the ACS to XCS in this task it is shown that the ACS generates accurate, maximally general rules and its population converges to those rules. Besides the observed ability of latent learning and the formation of an internal environmental representation, this ability of generalization adds a new advantage to the ACS in comparison with similar approaches. ==== RETRIEVAL/ORDERING: The above IlliGAL reports and publications, along with other publications and source code, are available electronically via FTP or WWW, or as hardcopy directly from us: FTP: ftp ftp-illigal.ge.uiuc.edu login: anonymous password: (your email address) cd /pub/papers/IlliGALs (for reports) or cd /pub/papers/Publications (for preprints) or cd /pub/src (for GA and classifier system source code) binary get 99022.ps.Z (for example) Please look at the README files for explanations of what the file names mean. IlliGAL reports are all compressed postscript files. WWW: To access the IlliGAL home page, open http://www-illigal.ge.uiuc.edu/ HARDCOPY: You can also order hardcopy versions of most IlliGAL publications Use the order form in the web or request them directly (by IlliGAL number or title) from the IlliGAL librarian: Internet: library@illigal.ge.uiuc.edu Phone: 217/333-2346 Fax: 217/244-5705 Surface mail: IlliGAL Librarian Department of General Engineering 117 Transportation Building 104 South Mathews Avenue Urbana, IL 61801-2996 USA When ordering hardcopy, please include your surface mail address! Martin Pelikan Illinois Genetic Algorithms Laboratory University of Illinois at Urbana Champaign 117 Transportation Building 104 S. Mathews Avenue, Urbana, IL 61801 tel: (217) 333-2346, fax: (217) 244-5705 ------------------------------ Date: Mon, 13 Mar 2000 18:45:43 -0500 (GMT) From: Uday Kumar Chakraborty Subject : Journal Special Issue CFP (reminder) CALL FOR PAPERS Journal of Systems Architecture (Elsevier) Special Issue on Evolutionary Computing Guest Editor: Uday K. Chakraborty Submission deadline: April 14, 2000 Journal of Systems Architecture - The Euromicro Journal (Elsevier) (http://ww1.elsevier.nl/locate/sysarc) invites original contributions for a forthcoming special issue on evolutionary computing. The special issue is scheduled to appear in mid-2001. For the special issue, papers describing (i) EA approaches to systems design and (ii) novel architectures for EA-based systems are particularly encouraged. Topics of interest include (but are not limited to): -- Theory of EAs (mathematical description of EA-behaviour) -- Design of new, improved EAs -- Hybrid systems (e.g., Neuro-fuzzy-EA, EA-simulated annealing-tabu search, etc.) -- Evolutionary robotics -- Evolving hardware architectures -- Architectures for parallel EAs Manuscripts (in English) should not normally exceed 10,000 words in length. Please provide a title page containing the title of the paper, names and affiliations of the authors, and mailing address, e-mail address, telephone and fax numbers of the corresponding author. The manuscript must contain a brief summary (maximum 150 words). Four hard copies (not faxes) of the manuscript should be submitted to the guest editor: Uday K. Chakraborty Dept. of Computer Science & Engineering Jadavpur University, Calcutta 700032, INDIA E-mail: uday@jadav.ernet.in uchakra@hotmail.com Phone: +91 33 413 0382 (home) +91 33 473 1138 (office) Fax: +91 33 473 4266 ------------------------------ Date: Mon, 13 Mar 2000 08:17:52 -0700 From: "Buczak, Anna L." Subject: posting Please post the following info: You are invited to submit proposals for organizing a Special Session at the ANNIE'2000 conference in Evolutionary Computation related area such as: - Genetic Algorithms (e.g. Parallel or MultiObjective) - Evolution Strategies - Evolutionary Programming - Artificial Life Each special session should contain 4-6 papers. Deadline for Special Session proposals is April 10, 2000. Please send your session proposals to: Dr. Anna L. Buczak Information and Decision Technology Honeywell Technology Center Honeywell Inc. 101 Columbia Rd., Morristown, NJ 07962-1021 phone: 973-455-3676; fax: 973-455-5991 e-mail: anna.buczak@honeywell.com Anna L. Buczak, Ph.D. Senior Scientist / Project Leader Information and Decision Technology Honeywell Technology Center Honeywell Inc. 101 Columbia Rd., Morristown, NJ 07962-1021 phone: 973-455-3676; fax: 973-455-5991 e-mail: anna.buczak@honeywell.com ------------------------------ Date: Wed, 15 Mar 2000 09:54:44 -0500 (EST) From: Alioune Ngom Subject: (MVL-IJ) Call For Papers CALL FOR PAPERS MULTIPLE-VALUED LOGIC --- AN INTERNATIONAL JOURNAL (http://www.site.uottawa.ca/~ivan/mvl.html) Special Issue: COMPUTATIONAL INTELLIGENCE IN MULTIPLE-VALUED LOGIC Guest Editors: Yutaka Hata, Alioune Ngom, Zoran Obradovic MVLIJ creates a forum for scientists, engineers and practitioners throughout the world to present the latest research, results, and ideas in the field of multiple-valued logic. This special issue provides a medium for the exchange of ideas between theoreticians and practitioners to address the important issues of the practice of artificial intelligence in multiple-valued logic. It will consist of contributory papers focusing on theory, implementation and application of computational intelligence techniques to multiple-valued logic. Topics of this issue must be limited to computational intelligence and may include: - Evolutionary computing in MVL such as - Evolutionary programming - Evolution strategies - Genetic programming - Genetic algorithms - Neural computing in MVL - Machine learning in MVL - Fuzzy computing in MVL - Other complex adaptive methods in MVL such as - Computer immune system - Simulated annealing - Cellular automata - Ants systems - Tabu search - Other intelligent search techniques in MVL The topic areas may include (but not limited to) - Pattern recognition, clustering or classification - Logic circuit/expression optimization - Qualitative or approximate reasoning - Signal processing or understanding - Logic or functional decomposition - System identification - Information retrieval - Datafusion or mining - Knowledge discovery - Evolvable hardwares - Automated reasoning - Fault diagnosis - Control Submission of Papers Papers will be selected based on their originality, significance, correctness and clarity of presentation. Papers should present original work, which has not been submitted nor published in other journals. Five copies of the papers (maximum 30 pages double-spaced including figures) should be received by December 1, 2000. For each author, including the corresponding author, provide name, affiliation, full address, phone number, fax number and email address. Please include keywords to indicate the topic and area of the paper. Notification of acceptance and authors kits will be mailed by March 15, 2001. The final manuscripts are due by May 1, 2001. Important Dates Full paper submission: December 1, 2000 Notification of acceptance: March 15, 2001 Final manuscripts: Mai 1, 2001 Please send all submissions to one of the guest editors. Electronic submissions are also welcome. If you do submit by e-mail, please specify which editor; e-mail to all three editors is fine, but hard copies goes to only one of us. The editors' address is given below. Yutaka Hata, Associate Professor, Computer Engineering Department, Himeji Institute of Technology, 2167, Shosha, Himeji, 671-2201, Japan. hata@comp.eng.himeji-tech.ac.jp Alioune Ngom, Assistant Professor, Computer Science Department, 5115 Lambton Tower, University of Windsor, Windsor, Ontario N9B 3P4 Canada. angom@cs.uwindsor.ca Zoran Obradovic, Associate Professor, School of Electrical Engineering And Computer Science, Washington State University, Pullman, WA 99164-2752, USA. zoran@eecs.wsu.edu ------------------------------ Date: Thu, 16 Mar 2000 12:29:07 +0000 (GMT) From: Conor Ryan Subject: Book Announcement Book Announcement: Automatic Re-engineering of Software Using Genetic Programming Kluwer Academic Publishers; ISBN: 0792386531 http://www.wkap.nl/book.htm/0-7923-8653-1 Conor Ryan, University of Limerick, Ireland. Description Automatic Re-engineering of Software Using Genetic Programming describes the application of Genetic Programming to a real world application area -- software re-engineering in general and automatic parallelization specifically. Unlike most uses of Genetic Programming, this book evolves sequences of provable transformations rather than actual programs. It demonstrates that the benefits of this approach are twofold: first, the time required for evaluating a population is drastically reduced, and second, the transformations can subsequently be used to prove that the new program is functionally equivalent to the original. Automatic Re-engineering of Software Using Genetic Programming shows that there are applications where it is more practical to use GP to assist with software engineering rather than to entirely replace it. It also demonstrates how the author isolated aspects of a problem that were particularly suited to GP, and used traditional software engineering techniques in those areas for which they were adequate. Automatic Re-engineering of Software Using Genetic Programming is an excellent resource for researchers in this exciting new field. ==== Preface ======= As Genetic Programming increases in popularity, many of the papers currently being written fall into two categories. There are papers which describe clever approaches to areas foreign to the GP population at large, and those that attempt to lay some theoretical foundations under the already vast amount of work done. The latter are, of course, absolutely necessary, as without solid theory, the development of GP becomes less of a scientific and more of a intuitive pursuit. The former are important and necessary if GP is to be accepted into the more general scientific community, but run the risk of alienating the more general GP practitioners. If people do not understand or appreciate the importance of the work, it risks being overlooked. Furthermore, if GP had to be tuned too much to produce the results, there is the further risk that a particular experiment may be viewed as too problem specific. Many papers have challenged solutions produced by humans and / or other computational approaches, but again, one is often left wondering as to the significance of the results. Of course, all the community is pleased to hear when GP proves to be as good at a task as a human, but at times, that is the only information given. How quick was GP compared to the human? What kind of human completed the task to begin with? Did the solution generated by GP arrive twenty years too late? And, most importantly, is it the case that the result simply satisfies the curiosity of a GP researcher, or is it actually of some use to somebody else? This has lead to some confusion over what exactly GP is capable of, and the question is often asked, ``Can GP evolve a word processor?'' The answer is, of course, ``no, GP cannot evolve a word processor''. Another answer, however, could be ``no, but why would anyone want to do such a thing?'' In fact, a better question might be ``Could GP be involved in the design of a word processor?'' This question is better from our point of view because the answer contains the word yes. GP is not intended to be a fully automatic programming system which can generate elaborate code for all manner of exotic applications, with merely a gentle prod from a human. GP is an excellent problem solver, a superb function approximater and an efficacious tool for writing functions to solve specific tasks. However, despite all these areas in which it excels, it still doesn't replace programmers, rather it helps them. A human is still required to specify the fitness function, and to identify the problem that GP is to actually be applied to. The Scare project, about which this book is written, is concerned with the transformation of serial code into functionally equivalent parallel code. If one were to ask the question ``How can GP convert a program into parallel?'', we would probably have to answer that it cannot. However, if the question was the more GP-friendly, ``How can GP help convert a program into parallel form?'' then the answer would simply be, read on. Parallel computing is becoming an increasingly important paradigm as hardware such as Beowulf systems have made available powerful computational resources to those with even the most humble of budgets. However, to effectively use parallel hardware, the quality of one's software is of the utmost importance. Poorly designed, communication-intensive programs can even run more slowly on parallel machines than their serial counterparts. Furthermore, there currently exists a significant number of institutions who run intensive applications on serial machines and, despite being the kind of users who stand to benefit most from parallel architectures, are faced the expensive task of rewriting their code from scratch. The Scare project is essentially a software re-engineering project that generates a sequence of transformations which, when applied to an existing serial program, generate a functionally equivalent parallel version. These transformations can subsequently be used to prove that the two versions of the program are functionally identical. The core of Scare is Paragen, a technique that uses GP to generate the all important transformation sequences. The first few chapters of the book concentrate on the problem domain of parallelization, and describe how those parts of the problem that were most likely to benefit from GP were isolated. Once these are identified, we discuss the design of our own particular version of GP, concentrating on issues such as genetic structure, breeding strategies and the choice between embryonic and absolute representations. These issues are of concern to many problems, and we believe that our experiences with them will be of value to others. Moreover, we believe that this work is valuable not only from the insights which were gained during it's execution, but also from the point of view that the solutions the system generates are also of interest to another community, specifically, those involved in parallel programming. ======= Ordering Information: Direct from Kluwer: http://www.wkap.nl/book.htm/0-7923-8653-1 Amazon.com: http://www.amazon.com/exec/obidos/ASIN/0792386531/qid%3D953208468/ 03-0123991-2257467 Telephone (USA): (781) 871-6600 Telephone (Europe): +31-78-6392392 ------------------------------ Date: Thu, 16 Mar 2000 14:52:02 +0000 From: "Morgan R. Tamplin" Subject: GECCO 2000 Evolvable Hardware Workshop GECCO 2000 Workshop: The future direction of evolvable hardware July 8, 2000 Free to anyone registered for GECCO-2000 (July 8-12) The Riviera Hotel and Casino, Las Vegas, Nevada, USA Organised by: Morgan R. Tamplin and Ben I. Hounsell Dept. of Electronics and Electrical Engineering, University of Edinburgh, Scotland Short description: Success in evolvable hardware suggests that it holds the potential to impact circuit production and design, not just following advances in silicon technologies, but driving such trends. The GECCO2000 workshop on "The future direction of evolvable hardware" seeks to bring together those influential in evolvable hardware with those intrigued by its promise. The workshop discusses major issues concerning evolvable hardware today, addressing research motivation and future directions, both academic and industrial. Broken into four topic discussions, followed by an overview and panel discussion, the workshop aims to suggest goals for evolvable hardware, provide insight into potential applications and broaden their relevance to genetic algorithms and design communities. More Details: http://www.genetic-algorithm.org/GECCO2000/workshops.htm Further information and tentative schedule: http://www.ee.ed.ac.uk/~SLIg/GECCO_2000.html Call for presentations and demonstrations: http://www.ee.ed.ac.uk/~SLIg/GECCO_2000.html If, after reading the above web page, you have a suitable presentation suggestion, please email it to both workshop organisers. Selected workshop-related materials will be published with the assistance of AAAI. Suggestions must be recieved by April 1, 2000. Final camera ready copies must be received in Edinburgh before the end of April. Instructions for electronic or paper submission will appear on the workshop web page before April. == Morgan R. Tamplin --PhD Student, Integrated Systems Group Electronics & Electrical Engineering, University of Edinburgh King's Buildings, Mayfield Rd, Edinburgh EH9 3JL, Scotland fax: +(44)-(0)131-650-6554 ------------------------------ End of Genetic Algorithms Digest ****************************** From nobody@cs.rit.edu Thu Mar 23 08:38:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id IAA08721 for ; Thu, 23 Mar 2000 08:37:59 -0500 (EST) Date: Thu, 23 Mar 2000 08:37:59 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Lab 2 (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 45 Status: RO Content-Length: 1540 Lines: 50 > Professor Anderson, > > I was working on the lab last night and noticed that it asks us to > create a solution for Problem 4'. In class, we only discussed the single > variable scenario (Prob 4) and I also recall some mention of the wrong > problem being listed on the web page (in addition to another student > telling me that the problem required for lab 2 was 4 (not 4'). I just > wanted to find out which was right (you probably mentioned it in class, > and I apologize if I forgot). 4' isn't all that much more difficult, but I > just wanted to know which was due for Lab 2. Right: 4, 4', and 4'' are just functions of 1, 2, 3 variables; not really different problems. Since we only discussed 4 in class, I will accept a 4 for this week's assignment. However, if you have the time, give 4' and 4" a crack. Like you said, they are not all that different -- mostly it's the issue of cleverly getting a good function to play with. > Also, for the lab write-up, you just want our code and maybe the > results of some sample runs w/explanations for the results? Give me the parts of the code that are interesting for this assignment. Probably just the fitness functions. However, those of you who are writing brand new tools, let me see them See you tonight. --PGA Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/ From nobody@cs.rit.edu Thu Mar 23 17:08:00 2000 -0500 Received: from fibonacci (fibonacci [129.21.38.152]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id RAA29243 for ; Thu, 23 Mar 2000 17:08:01 -0500 (EST) Date: Thu, 23 Mar 2000 17:08:01 -0500 (EST) From: "Peter G Anderson;;;" To: ga@cs.rit.edu Subject: Re: Lab2 In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Keywords: X-UID: 48 Status: RO Content-Length: 492 Lines: 25 > > Dr. Anderson, > For the function maximization question. What is the MAX_Hero? > > It seems that max hero should be the value with the largest functional > > value. But isn't that what we are looking for? > You cannot say! Peter G. Anderson, PhD Professor and Graduate Chairman Computer Science Department Room 10-1168 Rochester Institute of Technology Rochester, New York 14623-5608 Phone: 716-475-2979 FAX: 716-475-7100 nobody@cs.rit.edu http://www.cs.rit.edu/~pga/