Genetic Algorithms Digest Tuesday, February 27, 2001 Volume 15 : Issue 7 - Send submissions (articles) to GA-List@gmu.edu. DO NOT send submissions to the listproc@gmu.edu address. - To subscribe send email to listproc@gmu.edu containing the following text in the body of the message: subscribe ga-list - To unsubscribe send email to listproc@gmu.edu containing the following text in the body of the message: unsubscribe ga-list - To change your email address, simply unsubscribe the old address and subscribe the new one. - Send other administrative requests to GA-List@gmu.edu. - 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 in /pub/galist. ------------------------------------------------------------------------------- Today's Topics: - GA&NN Thesis for download - Tuning Crossover: information needed - ECOMAS Workshop: deadline extended to March 12 - WOMA II - Second call for papers - TSP Data requested - CFP: RoboCup Symposium - User supplied fitness functions: summary of responses - ISMDA 2001-Call for papers (biology-based computing) - Job Offers: Data mining and AI scientists needed. - CFP: Bayesian Models in Medicine - WS during AIME'01 - FUZZ-IEEE2001: Extension of deadline for paper submission - New search engine for EA-literature ------------------------------------------------------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) EMO01 1st Int Con of Evol Multi-Criterion Opt, Zurich Mar 7-9, 01 (v14n4) SAC2001 16th ACM Symp on Applied Computing, Las Vegas Mar 11-14, 01 (v14n14) IWES01 3rd Int WS on Emergent Synthesis, Bled, Slovenia Mar 12-13, 01 (v14n15) CSMR2001 5th Eur Conf on Soft Maint and Reeng, Portugal Mar 14-16, 01 (v14n13) ISAS2001 Int Symp on Adaptive Systems, Havana, Cuba Mar 19-23, 01 (v14n16) ISI2001 Int Congress on Info Science Innovations, Dubai Mar 20-23, 01 (v13n25) MAICS2001 Midwest AI & Cognitive Science Conf, Ohio Mar 31-Apr 1, 01 (v14n20) PAKDD01 Pacific-Asia Conf on KD and Data Min, Hong Kong Apr 16-18, 01 (v14n15) EUROGP2001 4th Euro Conf on GP, Milan, Italy Apr 18-20, 01 (v14n15) EvoWorkshops2001 at the Euro Conf on GP, Milan, Italy Apr 18, 01 (v14n16) ICANNGA2001 5th Int Conf on Artif NN and GAs, Prague Apr 22-25, 01 (v14n11) CEC2001 Congress on EC, Seoul, Korea May 27-30, 01 (v14n15) ICCS2001 Int Conf on Computational Sci, San Francisco May 28-30, 01 (v14n19) Agents2001 5th Int Conf Autonomous Agents, Montreal May 28-Jun 1, 01 (v14n14) CSCS13 Int. Conf. on Control Sys. and CS, Bucharest May 31-June 3, 01 (v15n4) IC-AI2001 Int Conf on AI, Las Vegas, NV Jun 25-28, 01 (v14n16) SOCO Soft Computing & Intell Sys for Industry, Scotland Jun 26-29, 01 (v14n18) CEF'2001 Sessions on EC in Econ. and Fin., New Haven, CN Jun 28-30, 01 (v15n4) ICML2001 18th Int Conf on Machine Learning, MA Jun 28-Jul 1, 01 (v14n16) AIME01 8th Euro Conf on AI in Medicine, Portugal Jul 1-4, 01 (v14n16) CIMCA2001 Int Conf on Comp Intelligence, Las Vegas Jul 4-6, 01 (v14n19) WOMAII Workshop on Memetic Algorithms, SF, CA Jul 7, 01 (v15n4) GECCO2001 Gen & Evolutionary Computation Conf, SF, CA Jul 7-11, 01 (v14n16) TARK VIII 8th Conf Theor Aspects of Ratnlty & Knowl, It Jul 8-10, 01 (v14n16) CIMCA2001 Int. Conf. on Comp. Int.,..., Las Vegas, NV Jul 9-11, 01 (v15n4) IAWTIC2001 Int. Conf. on Int. Agents,..., Las Vegas, NV Jul 9-11, 01 (v15n4) NASAEH 3rd Wrkshp on Evolvable Hardware, Pasadena, CA Jul 12-14, 01 (v15n2) IJCAI-01 WS on Empirical MEthods in AI, Seattle, USA Aug 4, 01 (v15n5) RoboCup-01 International Symposium, Seattle, USA Aug 7-10, 01 (v15n7) IDAMAP2001 Intelligent Data Analysis in Medicine & Phar Sep 4, 01 (v15n3) FUZZY DAYS Int Conf on Comp Intell, Dortmund, Germany Oct 1-3, 01 (v14n17) ICES2001 4th Int Conf on Evolvable Systems, Tokyo Oct 3-5, 01 (v14n19) ISMDA2001 2nd Int. Symp. on Medical..., Madrid, Spain Oct 8-9, 01 (v15n7) IAT2001 2nd Asia Pac Conf on Intell Agent Tech, Japan Oct 23-26, 01 (v14n14) EA01 VOLUTION ARTIFICIELLE 2001, Le Creusot, France Oct 29-31, 01 (v15n5) ICDM01 IEEE Int Conf on Data Mining, Silicon Valley, Nov 29-Dec 2, 01 (v14n14) ANNIE 2001 Smart Eng. Systems Design Conf, StL, MO, USA Nov 4-7, 01 (v15n5) FUZZ-IEEE01 10th IEEE Int Conf on Fuzzy Systems, Austr Dec 2- 5, 01 (v14n20) NF2002 1st Int ICSC Congress on Neuro-Fuzzy, Cuba Jan 15-18, 02 (v14n18) Send announcements of other activities to GA-List@gmu.edu ------------------------------ Sender: Rameri Salama Subject: GA&NN Thesis I finished my thesis sometime ago, and thought some of this forum might be interested in the material. The thesis can be downloaded in gzipped postscript from: http://www.cs.uwa.edu.au/pub/robvis/theses/RameriSalama.ps.gz The abstract is included below: On Evolving Modular Neural Networks - Rameri Salama The basis of this thesis is the presumption that while neural networks are useful structures that can be used to model complex, highly non-linear systems, current methods of training the neural networks are inadequate in some problem domains. Genetic algorithms have been used to optimise both the weights and architectures of neural networks, but these approaches do not treat the neural network in a sensible manner. In this thesis, I define the basis of computation within a neural network as a single neuron and its associated input connections. Sets of these neurons, stored in a matrix representation, comprise the building blocks that are transferred during a one or more epochs of a genetic algorithm. I develop the concept of a Neural Building Block and two new genetic algorithms are created that utilise this concept. The first genetic algorithm utilises the micro neural building block (micro-NBB); a unit consisting of one or more neurons and their input connections. The micro-NBB is a unit that is transmitted through the process of crossover (and hence requires the introduction of a new crossover operator). However the micro-NBB can not be stored as a reusable component, and must exist only as the product of the crossover operator. The macro neural building block (macro-NBB) is utilised in the second genetic algorithm, and encapsulates the idea that fit neural networks contain fit sub-networks, that need to be preserved across multiple epochs. A macro-NBB is a micro-NBB that exists across multiple epochs. Macro-NBBs must exist across multiple epochs, and this necessitates the use of a genetic store, and a new operator to introduce macro-NBBs back into the population at random intervals. Once the theoretical presentation is completed the newly developed genetic algorithms are used to evolve weights for a variety of architectures of neural networks to demonstrate the feasibility of the approach. Comparison of the new genetic algorithm with other approaches is very favourable on two problems: a multiplexer problem, and a robot control problem. ------------------------------ Sender: Efendi Suprayitno Subject: Tuning Crossover Hi everyone... If somebody know about tuning crossover, if you don't mind could you explain to me about that ? Because I search in internet I don't find. Thank a lot. Best Regards, Efendi Suprayitno email : efendis@elang.stts.edu ------------------------------ Sender: "Robert Elliott Smith" Subject: ECOMAS Workshop DEADLINE EXTENDED TO MARCH 12!!! Call for Participation: Evolutionary COmputation and Multi-Agent Systems (ECOMAS) (see http://www.csm.uwe.ac.uk/~rsmith/ECOMAS) A Birds-Of-A-Feather Workshop At GECCO 2001 (http://gal4.ge.uiuc.edu:8080/gecco-2001/) Extended: Submissions Due: March 12, 2001 Workshop Date: July 7, 2001 Description Of The Workshop Topic Multi-agent systems (MAS) are collections of interacting autonomous entities. The behaviour of the MAS is a result of the repeated asynchronous action and interaction of the agents. Understanding how to engineer adaptation and self-organisation is thus central to the application of agents on a large scale. Moreover, multi-agent simulations can also be used to study emergent behaviour in real systems. Desirable self-organisation is observed in many biological, social and physical systems. However, fostering these conditions in artificial systems proves to be difficult and offers the potential for undesirable behaviours to emerge. Thus, it is vital to be able to understand and shape emergent behaviours in agent based systems. Current mathematical and empirical tools give only a partial insight into emergent behaviour in large, agent-based societies. EC provides on paradigm for addressing this need. Moreover, EC techniques are inherently based on a distributed paradigm (natural evolution), making them particularly well suited for adaptation in agents. At the same time, ideas from natural ecosystems or economies, such as resource flows, niches, and spatial context or neighbourhood can contribute both to the development of MAS and to the improvement of EC techniques. The interaction between these different sources of natural inspiration and the two computing disciplines of MAS and EC is beginning to stimulate a range of systems with properties that extend the MAS and EC concepts in new and interesting directions. Notable examples of systems of that begin to examine the issues of EC in MAS include Holland's ECHO system, Tierra, Avalanche, Egglets, Amalthaea, InfoSpiders, and many others . The goal of EcoMAS is to open a dialog among researchers and practitioners who are examining EC in MAS. EcoMAS represents an important opportunity for those active or interested in this area to hear about current work, discuss future directions and priorities, and form invaluable research contacts. Interest To The GEC Community With the advance of computational power and communications speed, we now live in a computational world where a large number of agents may be working on behalf of any given user. A large number of Internet software agents may be acting on behalf of even the most casual user: searching for music, comparing pension schemes, purchasing good and services, identifying chat partners, etc. Moreover, these agents may be collaborating with those of other users, while spawning and managing agents of their own. In more formal settings, a business, academic, or government user may simultaneously employ many software agents to manage workflow, trade goods or information, collaboratively solve problems, etc. In the future, even relatively simple household appliances may play a role in this churning system of interacting, computational agents. In this world, EC theories and practices have new implications. Agents that interact according to these theories are no longer locked inside the laboratory conditions imposed by EC researchers and users.The interest in merging the EC and MAS research communities is certainly growing. In the opinion of the organizers, it is important to the GEC community that there is a forum to discuss the particular issues of EC in MAS. Simultaneously, such a forum allows for ideas from contemporary MAS research to spread to the GEC community. Workshop Format In the opinion of the organizers, it is important that a workshop involve more than talks and presentations. Therefore, the workshop will be focused on an extensive, directed discussion on the future of EC in MAS. Other aspects of the workshop will be directed at facilitating this discussion: 1) The workshop will allow for the selected presenters to post "mini-posters." Much of this material will be available before the workshop, via a web site. 2) 3) The first hour of the workshop will consist of "mini-presentations" to preview the mini-poster session. Authors will be allowed to present at most two transparencies. Time constraints will be adjusted, depending on the number of presenters selected, but a limit will be maintained, to allow for the sessions outlined below. 4) 5) The second hour of the workshop will consist of a mini-poster session. 6) 7) The third hour of the workshop will focus on a discussion of the future of EC in MAS. 8) 9) The final, and perhaps most important, hour of the workshop will be a discussion focused on action items for advancing EC in MAS. The organizers feel that explicitly providing time to discuss agendas in the fashion will give the workshop an atypical, meaningful outcome. 10) Submission Instructions If you would like to present material at the workshop (in the format noted above), please submit a 4 page extended abstract in Postscript or PDF form to cefn.hoile@bt.com by March 12, 2001. If your submission is accepted, expect to submit a camera ready version of the extended abstract by April 15th, 2001, and to submit a web-based presentation (PowerPoint, HTML, PDF, etc.) by June 1st, 2001. If you would like to participate, but not present, please notify cefn.hoile@bt.com by February 15th, 2001, as GECCO requires us to submit a participants list. Important Dates: Extended: Submissions Due: March 12, 2001 Review Decisions To Authors By: March 23, 2001 Camera Ready Due: April 15, 2001 Reservations Due at Holiday Inn Golden Gateway Hotel: June 6, 2001 Web Materials Due: June 1, 2001 Workshop Date: July 7, 2001 Workshop Organizers Claudio Bonacina, Robert Smith Intelligent Computing Systems Centre University of The West of England Coldharbour Lane, Frenchay Bristol BS16 1QY, UK Cefn Hoile, Paul Marrow Intelligent Systems Laboratory, BTexaCT Admin 2 PP 5, Adastral Park Ipswich IP5 3RE, UK ------------------------------ Sender: Natalio Krasnogor Subject: WOMA II - Second call for papers Dear Colleague, You are invited to submit papers to the "2nd Workshop on Memetic Algorithms (WOMA II)". WOMA II will be held within the "Genetic and Evolutionary Computation Conference (GECCO-2001)" in San Francisco, California, U.S.A. the 7th of July 2001 at the Holiday Inn Golden Gateway Hotel. The Workshop is open to the participation of all GECCO-2001 attendees. 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, Cultural Algorithms, 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 is the second edition of a previous Workshop held at GECCO2000 in Las Vegas last year. It will provide a forum for both: - identifying and exploring the key issues that affect the theory, design and application of MAs and - the development of new collaborations between people involved with MAs in the academia and industry. The topics of interest are (but not limited to): * Theory of Memetic Algorithms and Memetics. * Applications of MAs on continuous, discrete and mixed domains. * Memetic Algorithms for multi-objective optimization. * Hybridization issues for constrained problems. * MAs applied to dynamic optimization. * Frameworks for describing and classifying MAs. * Practical guidelines to combine local search and EAs. * Scalability of MAs. * Distinction between `intelligent' evolutionary operators and local search. * Distributed/Parallel MAs. * Tools and software engineering of MAs. Submission details like deadlines, style, publication, etc are described in WOMA II web page at http://www.csm.uwe.ac.uk/~n2krasno/WOMAII/WOMAII.html. Authors are invited to submit 2 to 4 pages-long extended abstracts papers. The papers must fulfill GECCO-2001 main conference papers formatting instructions. The planned deadlines for authors are: * March 26, Paper submission deadline (electronic copies preferable). * April 7, Notification of paper acceptance/rejection. * April 20, Camera ready paper (ONLY hard copies accepted). * July 7, WOMA II in San Francisco. The organizers of WOMA II will appreciate if you can send 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 meeting you in WOMA II!!! 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 Web : www.cs.sandia.gov/~wehart/main.html 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 Web : www.csm.uwe.ac.uk/~n2krasno 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: jim.smith@ics.uwe.ac.uk Web : www.csm.uwe.ac.uk/~jsmith ------------------------------ Sender: Prashant Arya Subject: TSP Data hi i am compiling various comparison of approaches in heurisitic and hybrid approaches vs GA as applied to TSP in form of a technical report to be submitted as my VII sem dissertion.the topics covered are: 1. Simulated Annealing 2. Ant Colony Optimization 3. GA with various order preserving Crossover operators 4. order-messy GA 5. Memetic Algorithm i need analytical results of these comparisons or instances of TSP ( not more than 35-40 cities) which i can use in my algorithms in order to generate my own evaluations. Prashant Arya Final yr BE( computer engg) NSIT, Delhi ------------------------------ Sender: Andreas Birk Subject: RoboCup Symposium The RoboCup 2001 International Symposium Call for Papers August 7 - 10, 2001 colocated with the International Joint Conference on AI, IJCAI-01 Seattle, USA Please visit: http://arti.vub.ac.be/RoboCupSym2001/ The RoboCup International Symposium will be held in conjunction with the RoboCup 2001 Competitions and Demonstrations as the core meeting for the presentation of scientific contributions in areas of relevance to RoboCup. Its scope is mainly within the fields of Artificial Intelligence and Robotics with a broad range of areas of interest, including: * Sensor-Motor Control * Vision and Image-Processing * Self-localisation and Navigation * Planning, Reasoning, and Modeling * Learning and Adaptive Systems * Multi-Agent Systems * Multi-Robot Systems * Co-operation and Collaboration * Simulation and Visualisation * Realtime and Concurrent Programming * Embedded and Mobile Hardware * Non-conventional actuation systems, especially artificial muscles * Next generation sensors for robotics * Mobile Robots and Humanoids * Search and rescue robots * Disaster rescue information systems * Wireless Communication and Mobile Computing * System integration and Software-Engineering * Robotics and Science Education * Computer and Robotic Entertainment * Commentators, Speech Synthesis and Natural Language Generation Submissions to the RoboCup International Symposium do not necessarily need to be linked to an active participation in the RoboCup games and competitions. Due to its interdisciplinary nature, the RoboCup International Symposium provides an excellent opportunity to introduce and spread novel ideas and approaches into various scientific disciplines. The experimental character of the RoboCup games gives in addition the possibility to get novel ideas and approaches adopted and field-tested by a constantly growing community. Papers describing real-world research as well as papers dealing with strong theoretical results are both welcome. We also encourage the submission of high-quality overview articles for any field related to the scope of RoboCup, especially the ones listed above. The proceedings of RoboCup are published within the Springer LNAI-series. All submissions to the International Symposium enter the selection process for the RoboCup "Scientific Challenge Award", which recognizes outstanding research within a field related to the scope of RoboCup. Important dates ==== * March 15, 2001 submission deadline * May 1, 2001 notification of acceptance * June 1, 2001 camera-ready due * August 1 - 10, 2001 RoboCup Instruction for Submissions ==== Submissions must be made by March 15, 2001 in electronic form as Postscript or PDF file. Submissions must be formatted according to the "Instructions for Authors" of the Springer LNCS/LNAI series. The according style-file is available via the Symposium's website at "http://arti.vub.ac.be/RoboCupSym2001/". Contributions can either be full paper or poster submissions. Full paper and poster submissions are 10 and 6 pages long, respectively. Submissions should be sent via anonymous ftp to "arti.vub.ac.be" and placed into the directory "pub/RoboCupSym2001/". In addition, each submission should be notified via email to birk@ieee.org with following information (please do NOT send your complete submission via email): email-subject: submission for RoboCup 2001 email-body: Corresponding Author name: email: affiliation: street address: tel/fax: Submission file-name: title: authors: Organizers and Program Chairs ==== Andreas Birk Free University of Brussels, Belgium, birk@ieee.org Silvia Coradeschi Orebro University, Sweden, silvia.coradeschi@tech.oru.se Satoshi Tadokoro Kobe University, Japan, tadokoro@cs.kobe-u.ac.jp Symposium Website: http://arti.vub.ac.be/RoboCupSym2001/ ------------------------------ Sender: "Martin C. Martin" Subject: User supplied fitness functions: summary of responses Hi all, A little while back I asked for examples of EC where the user(S) supply the fitness function. Here's the original post, which went to both the GP and GA mailing lists, and the responses. Enjoy, Martin [Original Post] Martin C Martin Hey all, I'm looking for examples of ECs where the user(s) supply the fitness function. As I recall, in "the early days of the web," the there was a genetic music page. There were 10 sound clips, and visitors to the site could rate each of them. When enough ratings were in, it would use the (average?) rating as the fitness, and create the next generation. Anyone have a link to this, or more info? There was also Richard Dawkin's program for a Mac, which would evolve "stick figures." I think he vaguely intended them to look like trees, but they ended up looking like insects and all sorts of crazy stuff. Does anyone remember the name of the program or which book it was in? Was it in his TV show? [Answer to Original Post from] Richard Dawkins did something called "biomorphs." They were described in his book "The Blind Watchmaker," and you might even have been in his TV show. You can check out the list of "a large number" of Biomorph programs available on the net here: http://www.world-of-dawkins.com/software.htm [Answer to Original Post from] Anthony C. Zboralski Subject: richard dawkins Hi, I think the book you refer to is "the blind watchmaker: Why the Evidence of Evolution Reveals a Universe Without Design" where there is this GA program for evolving insect shapes. the software: http://www.amazon.com/exec/obidos/ASIN/0393993418/o/qid=981491098/sr=8-3/ref=aps _sr_b_1_3/105-2013325-3983151 [Answer to Original Post from] Peter von Buelow Dawkins story of his creatures was in "The Blind Watch Makermaker": Richard Dawkins, The Blind Watchmaker (New York/London: W.W. Norton, 1986). There are versions (rewrites) of that around, e.g. Bugs or Biomorph. Check: http://www.csa.ru:81/ai/faq/kantrowitz/genetic_5/faq-doc-2.html [Answer to Original Post from] C. Setzkorn hi, do you ask for something like this: http://www.geom.umn.edu/~trowley/genetic/ perhaps it helps .... [Answer to Original Post from] David Wolfe Corne Martin, I have one such thing just submitted to CEC; it's on evolving large-scale schedules for big projects (e.g. construction site scheduling). Standard automated scheduling in such cases just breaks down since the project manager has all sorts of implicit fuzzy requirements that scheduling s/w doesn't capture. So, we have the project manager and the EA collaborating. You know about the standard classic stuff, I guess? I.e.: the GA/user collab. used to evolve criminlal photifits ? Dave [Answer to Original Post from] Dan Costelloe Hi Martin, Two that spring to mind are GenJam: http://www.it.rit.edu/~jab/GenJam.html and Brad Johanson's GP music system: http://graphics.stanford.edu/~bjohanso/gp-music/ I'm very interested in this sort of stuff myself, and there are a potentially large number of examples (optimal toast, toothpaste, route through a town...), especially when dealing with subjectivity. There was a workshop at GECCO 2000 involving GAs in visual art and music, some info there might be of help: http://galileo.dc.fi.udc.es/workshop/gecco2000/ I hope these links help, I'd be interested to hear more about the work you are doing / intending to do on this subject! Cheers, -dan [Answer to Original Post from] Anargyros Sarafopoulos Hello There is a nice page with a lot of information and many "Visual Aesthetic Evolutionary Design Links" at: http://www.cgrg.ohio-state.edu/~mlewis/aed.html There I found few interactive selection links : http://www.cs.cmu.edu/~jmount/g3.html http://www.cambrianart.com/ Also look at Karl Sims' work: http://www.genarts.com/galapagos/index.html And a commercial product at: http://www.cinegrfx.com/genshade/index.html Found this link at W.B. Langdon's page http://graphics.stanford.edu/~bjohanso/gp-music/ Regards Ari [Answer to Original Post from] Marc Schoenauer Hi You should try to contact Gusz Eiben (gusz@cs.vu.nl, I Cc him this mail) I know he has evolved some art piece in one of Amsterdam museum using the visitors'ranking. Hope this helps Marc [Answer to Original Post from] dave.schaffer@philips.com There is a site at New Mexico State (I think -- look for most beautiful face/Vic Johnston) Dept of Psych. http://www-psych.nmsu.edu/victorpg.html Please post your findings; we're thinking of doing something alone these lines, so we're keen to hear what you find. Pax Dave [Answer to Original Post from] Collin Lynch You might want to contact Lee Spector (lspector@hampshire.edu) who has a simple MCL applet that selects images based upon user prefrences. Ultimately this system would evolve more complex peices of art allthough he uses it largely for demonstration purposes. Collin Lynch. [Answer to Original Post from] Riccardo Poli This was the MSc project of one of my students, Brad Johanson. He is at Stanford (http://www.stanford.edu/~bjohanso/). You can find the GP Music System there at http://graphics.Stanford.EDU/~bjohanso/gp-music/ We published a paper on this in the GP 1998 conference: B. Johanson and R. Poli, GP-Music: An Interactive Genetic Programming System for Music Generation with Automated Fitness Raters, Proceedings of the Third International Conference on Genetic Programming, GP'98, pp. 181-186, Madison, Wisconsin, July 1998. Morgan Kaufmann. A version of it is also available from http://www.cs.bham.ac.uk/~rmp/papers/Johanson-GP1998.ps.gz > Anyone know of any other examples? Stefano Cagnoni and I did some work on the topic years ago: R. Poli and S. Cagnoni, Evolution of Psuedo-colouring Algorithms for Image Enhancement with Interactive Genetic Programming, Proceedings of the Second International Conference on Genetic Programming, GP'97, pp. 269-277, Stanford, July 1997. Morgan Kaufmann. A version of it is also available from http://www.cs.bham.ac.uk/~rmp/papers/Poli-GP1997-UM.ps.gz However, there must be tens of other papers on this subject. I suggest you search the web or on-line bibliographies for "interactive evolution". [Answer to Original Post from] Mark C. Sinclair I recall one at ICANNGA'97 (Proc. Intl. Conf. on Artificial Neural Networks and Genetic Algorithms, Norwich, UK, April1997) where a user selected from different holiday packages - the aim of the EC was to find good service/price combinations. I can't give you the title just now, as I don't have the proceedings to hand - there at my office. [Answer to Original Post from] Peter von Buelow I read your note in the GA-Digest. User supplied fitness functions is an aspect of my research. I am working on a GA application which I call an Interactive Genetic Design Tool (IGDT). It makes use of user selection in exploring the space of "pretty good" truss topologies. These are like bridge or roof trusses. The tool is intended for design engineers and architects. I'd be happy to send you an article if you like. I have also collected info on other similar things and would be interested in exchanging references. One that was also passed around several years ago was "Imogenes". try: ftp.cc.utexas.edu:/pub/genetic-programming/code/imogenes.zip Also, if you haven't already, look through the FAQ http://alife.santafe.edu/~joke/encore/ Let me here what you are working on. [Answer to Original Post from] "Hart, William E" The most interesting example of a 'user defined' objective function was at ICGA91 (I think), where a suspect identification tool was developed using GAs. Users provided feedback about facial features, and this was fed into a GA that selected images from a database. [Answer to Original Post from] Jano van Hemert Although in a very early stage I'm doing a project where the user takes the role of supplying a fitness. Up until now, two not so different applications have been created: - Mondriaan generator http://www.liacs.nl/~jvhemert/mondriaan - Online abstract art generator http://www.liacs.nl/~jvhemert/eartweb I have some literature here and there about the subject, ranging from fractals to walking stick figures. What is your interest? ------------------------------ Sender: Vctor Maojo Subject: ISMDA 2001-Call for papers Call for papers 2nd International Symposium on Medical Data Analysis ISMDA 2001 October 8-9, 2001. Hotel Monterreal. Madrid, Spain. Objectives The 2nd International Symposium on Medical Data Analysis (ISMDA-2001) is the continuation of the 1st symposium, held in Frankfurt, Germany, on September, 2000. It aims to integrate interdisciplinary research from scientific fields such as statistics, signal processing, biomedical informatics, data mining and biometrics for biomedical data analysis. It will provide an international forum for sharing and exchanging of original research results, ideas and practical development experiences in areas related to the analysis of biomedical data. Proceedings of the conference are programmed to be published within a forthcoming issue of Springer Verlag's Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/fcp2001.html) Organizing Committee General Chair Victor Maojo, Polytechnical Univ. of Madrid. Spain. Scientific Committee Coordinator Fernando Martin, Institute of Health Carlos III. Spain SYMPOSIUM TOPICS Bayesian networks Clinical trials analysis Cluster analysis, state space analysis for medical applications Data analysis for image processing Data mining and predictions, knowledge discovery Dependency analysis, sensitivity analysis Health bioinformatics and genomics Internet-based solutions for collecting, exchanging and analyzing medical data Medical data visualization Medical decision support systems Modeling of medical systems Neural networks, fuzzy computing, biology-based computing On-line monitoring Software tools for medical data analysis Survival analysis Time series analysis This list is not exhaustive. Papers on all aspects of biomedical data analysis and prediction are welcome. Both research and applications papers are solicited. All submitted papers will be reviewed on the basis of technical quality, relevance, originality, significance, and clarity. Author information at http://www.springer.de/comp/lncs/authors.html Nevertheless, Authors are encouraged to submit electronically as stated in the electronic submission guidelines (see http://www.seis.es/ISMDA/ ). Otherwise, papers should be mailed to: CEFIC, Technical secretary ISMDA 2001 C/ Olimpo, 33 - 1 C. 28043 Madrid. Spain Deadline for Submission of Draft Papers: May 3, 2001 Notification of Acceptance: June 18, 2001 Deadline for Submission of Camera-ready Paper and registration July 20, 2001 [ ... Modified by moderator for brevity. For more information refer to the ISMDA home page at http://www.seis.es/ISMDA/] ------------------------------ Sender: Eric Bonabeau Subject: Job offers Icosystem combines advances in network theory, leading-edge economic simulation modeling techniques and evolutionary computation to discover winning business models for exploitation through partnership with consulting clients or external investors, through independent spin-off activities and as part of an IP portfolio. More information about Icosystem can be found at www.icosystem.net. The company is looking for outstanding individuals to join its team. Positions to be filled immediately include: AI scientist: You will play a key technical role in the R&D teams efforts to develop a new set of evolutionary and co-evolutionary computation techniques to explore business ecosystems. An acknowledged expert in AI with a focus on evolutionary computation and/or co-evolutionary techniques, with a PhD and a broad experience of multiple techniques including genetic algorithms, classifier systems, genetic programming, evolutionary strategies, you are comfortable with one or more programming languages including C, C++ and/or Java. Experience with genetic programming and/or evolutionary computation applied to design is desired. Data mining scientist: An acknowledged expert with a PhD and preferably a postdoctoral or industry experience in market research, you will apply a wide range of statistical analysis, segmentation and other data mining techniques to the discovery of patterns in databases used by Icosystem to build and validate its models. You must have a programming experience using such languages as C, C++ and/or Java and/or Matlab and Simulink and/or other statistical and data analysis software. Work in a fast-paced, cutting-edge environment. Work with experts in the field of complexity science to invent the winning business models of tomorrow. If this sort of environment appeals and you have skills that match any of the above positions, we would like to hear from you. All positions are initially based in Paris, France. We offer competitive compensation packages. Send resumes to HR@icosystem.net ------------------------------ Sender: Peter Lucas Subject: CFP: Bayesian Models in Medicine - WS during AIME'01 ** BAYESIAN MODELS IN MEDICINE ** Workshop during the European Conference on Artificial Intelligence in Medicine (AIME'01), Cascais, Portugal, 1 July 2001 For details, see http://www.csd.abdn.ac.uk/~plucas/aime01-ws.html o Submission of papers: 1 May, 2001 o Conference: 1-4 July, 2001 o Workshop: Sunday, 1 July, 2001 o Special issue: second half of 2002 (planned) Bayesian networks (also known as causal probabilistic networks) with their associated methods have now been around in biomedicine for more than a decade. They have become increasingly popular for representing and handling uncertain knowledge in medicine. Almost simultaneously, the use of Bayesian statistics has increased in popularity in medicine. This workshop aims to bring together researchers in these fields in order to assess the current state of the art, to identify obstacles for progress and to determine future research directions. The workshop's aim is also to promote research collaboration among different groups in these fields. Extended versions of the best papers of the workshop will be published in a special issue of the journal Artificial Intelligence in Medicine. PLEASE LET US KNOW IF YOU INTEND TO SUBMIT A PAPER. For more information about the workshop, please contact one of the co-chairs: Peter Lucas, plucas@csd.abdn.ac.uk Linda van der Gaag, linda@cs.uu.nl Ameen Abu-Hanna, A.Abu-Hanna@amc.uva.nl or consult http://www.csd.abdn.ac.uk/~plucas/aime01-ws.html. Peter Lucas Dept. of Computing Science, University of Aberdeen Aberdeen AB24 3UE, Scotland, UK Tel: +44 1224 273829/272296; Fax: +44 1224 273422/487048 E-mail: plucas@csd.abdn.ac.uk; URL: http://www.csd.abdn.ac.uk/~plucas ------------------------------ Sender: fuzz-ieee01 Subject: FUZZ-IEEE2001: Extension of deadline for paper submission The deadline for paper submission to FUZZ-IEEE2001 has been extended to Friday, 20 April 2001. Call for papers and other conference information can be found on http://www.csse.melbourne.edu/FUZZ-IEEE2001 ------------------------------ Sender: Rasmus Kjaer Ursem Subject: New search engine for EA-literature Dear colleagues, We would hereby like to announce a new search engine for EA-related literature. The engine is available at http://www.evalife.dk/bbase and has been developed by researchers connected to the EvALife research group at DAIMI, University of Aarhus, Denmark (see http://www.evalife.dk). The database currently holds more than 13000 EA-references, which we, with your help, hope to increase in the near future. We hope you will find it as useful as we do. On behalf of the EvALife group, Rasmus K. Ursem End of Genetic Algorithms Digest ********************************