Genetic Algorithms Digest Thursday, May 3, 2001 Volume 15 : Issue 16 - 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: - AMT01 paper submission extended - No free lunch theorum - Two Ph.D. student positions open - theory-edge mailing list - Journal special issue on co-evolution -------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) NCCIDM2001 1st Conf on Computer Int...,Coimbatore, India May 14-15, 01 (v15n11) 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) IWLCS-2001 4rth Int. Conf. on Classifier Sys., SF, CA Jul 7-8, 01 (v15n10) 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) WATT2001 Wrkshp of...Automated Timetabling, Rotterdam Jul 9-11, 01 (v15n8) NASAEH 3rd Wrkshp on Evolvable Hardware, Pasadena, CA Jul 12-14, 01 (v15n2) SCI2001 Evolvable Sys. and Gen. Prog., Orlando, FL USA Jul 22-25, 01 (v15n8) IJCAI-01 WS on Empirical MEthods in AI, Seattle, USA Aug 4, 01 (v15n5) 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) MCCS 2001 6th Int. Conf on Msr & Ctrl in Compl. Sys, Ukr Oct. 8-12, 01 (v15n10) 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) AMT01 6th Int CS Conf Active Media Tech, Hong Kong Dec 18-20, 01 (v15n16) NF2002 1st Int ICSC Congress on Neuro-Fuzzy, Cuba Jan 15-18, 02 (v14n18) PATAT 2002 4rth Int. Conf. ... Auto. Timetbl., Belgium Aug 21-23, 02 (v15n10) Send announcements of other activities to GA-List@gmu.edu -------------------------------- Sender: AMT 2001 Secretariat Subject: AMT01 paper submission extended ****************************************************************** Deadline Extended to JUNE 15, 2001 !! ****************************************************************** Second Call for Papers ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ The Sixth International Computer Science Conference: ACTIVE MEDIA TECHNOLOGY (AMT-01) 18 - 20 December 2001, Hong Kong Home Page: http://www.comp.hkbu.edu.hk/~amt01 Organized by IEEE Hong Kong Section Computer Chapter Department of Computer Science, Hong Kong Baptist University ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ As a newly-emerged, fast-growing area in information technology and computer science, Active Media Technology (AMT) strongly emphasizes the increasingly important proactive roles of computational systems and media in different aspects of digital life. This conference will particularly focus on (i) the current state of research and development in theory, art, and science of AMT, and (ii) the demonstration of the latest architectures, prototypes, tools, and fielded systems that demonstrate or enable AMT. The topics of interest include, but are not limited to: * Human-Machine Interaction * Self-Adapting Computers * Face and Gesture Recognition * Machine Learning * Visualization * Evolutionary Art * Models of Emotion, Motivation, or Personality * Wearable Computers, Hand-Held or Wireless Devices * Avatars * Multi-Agent Systems * Multi-Modal Interfaces * Smart Environments * Collaborative Information Gathering * Virtual Marketplace or Community, Internet Ecology * Augmented Reality * Knowledge Network * Personalization * Distributed Softbots and Netbots * Synthetic and Believable Agents * Pervasive Technology, Push Technology * WWW Content/Service Delivery * Active Perception Keynote Speakers: ================= Prof. James L. Crowley INRIA Rhone-Alpes, France Prof. Toshio Fukuda Nagoya University, Japan Prof. Toru Ishida Kyoto University, Japan Prof. Oussama Khatib Stanford University, USA Prof. Takeo Kanade The Robotics Institute, Carnegie Mellon University, USA Submission: =========== Submission of paper must be in full manuscript. Electronic submission is encouraged. The accepted papers will be published in conference pro-ceedings. It is understood that one of the authors of the accepted paper will register and pre-sent their paper at the conference. Selected high-quality papers from the proceedings will be published in an international journal. Important Dates: ================ Submission Due : June 15, 2001 Notification of Acceptance: August 1, 2001 Camera Ready Manuscripts Due: August 15, 2001 For more information, please contact: ===================================== AMT 2001 Secretariat Department of Computer Science Hong Kong Baptist University, Hong Kong Fax: (852)-2339-7892 Email: amt01@comp.hkbu.edu.hk ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -------------------------------- Sender: "Mayer, David" Subject: No free lunch theorum In "No free lunch theorums for optimization" (IEEE Trans. on Evolutionary Computation 1, 1977, 67-82), Wolpert & Macready claim "the average performance of any pair of algorithms across all possible problems is identical" (p. 67) - and include random search in this (p. 70). Their appendices outline proofs which back this up; eg, p. 77, "... we ensure that the past performance of an algorithm has no bearing on its future performance. Accordingly ..., all algorithms perform equally." Note that these proofs include Kronecker delta functions, Kullback-Liebler distances, L'hopital's rule, and Riemann sums - none of which are referenced for the layman. This surely contrasts with the wide experience that evolutionary algorithms 'win' across a vast range of application types (yes, I will acknowledge that quasi-Newton methods go well on quadratic surfaces, and tabu search is generally superior for combinatorial problems). In facing an unknown problem (eg, my field of agricultural systems optimization), I'd bet on an EA, vs Wolpert & Macready's assertion that "there is no a priori justification for using a search algorithm's observed behaviour to date on a particular cost function to predict its future behaviour on that function." So, what are we practitioners to make of this? Is their whole set of comparisons limited to combinatorial optimization problems, as initially introduced on their p. 68? I was even looking for a clue that this may have been a mathematically well-disguised send-up, as has previously appeared (Anon. 1972, "A new algorithm for optimization", Mathematical Programming 3, 124-128). Regards, David Mayer, Queensland Beef Industry Institute, LMB 4 Moorooka QLD 4105, Australia. (ph) +61 7 3362 9574; (f)+61 7 3362 9429 ********************************DISCLAIMER**************************** The information contained in the above e-mail message or messages (which includes any attachments) is confidential and may be legally privileged. It is intended only for the use of the person or entity to which it is addressed. If you are not the addressee any form of disclosure, copying, modification, distribution or any action taken or omitted in reliance on the information is unauthorised. Opinions contained in the message(s) do not necessarily reflect the opinions of the Queensland Government and its authorities. If you received this communication in error, please notify the sender immediately and delete it from your computer system network. -------------------------------- Sender: Monaldo Mastrolilli Subject: Two Ph.D. student positions open Two Ph.D. student positions with 3 years funding are open for applications: (1) one will be in the field of METAHEURISTICS, (2) and one in APPROXIMATION ALGORITHMS. We are looking for people with a background in computer science or mathematics, preferably with a specialization in one of the following topics: combinatorial optimization (or discrete mathematics), algorithms and data structures. The right people will have a commitment to research and publication, and possess good communication and presentation skills (in English). The positions will be positioned at IDSIA starting May 1st 2001 or later. IDSIA is a non-profit oriented research institute located in Lugano (Switzerland). IDSIA is affiliated with the Swiss Italian University (USI) and the Swiss Italian University for Applied Science (SUPSI). (More information about IDSIA are available at http://www.idsia.ch/) (1) METAHEURISTICS The goal is to deepen our understanding of metaheuristics so that they can be applied more effectively to the solution of important practical combinatorial optimisation problems. (More information are available at http://www.idsia.ch/luca/Meta2000PD.htm) (2) APPROXIMATION ALGORITHMS. Numerous practical problems are integer optimization problems that are intractable. Such problems are commonly addressed with heuristics that provide a solution, but not information on the solution's quality. The approximation algorithms' framework provides a guarantee on the quality of the solution obtained. The main objective is in the design, analysis, and experimental test of Approximation Algorithms with special emphasis on Scheduling Problems. Topics include theoretical results such as polynomial algorithms, complexity results and approximation schemes. (More information are available at http://www.idsia.ch/~monaldo/PHD2001.html) IMPORTANT NOTICE: Read the following conditions (http://www.idsia.ch/luca/Meta2000PD.htm#CONDITIONS FOR EU GRANTS) before applying. For more information you can contact: Luca Maria Gambardella IDSIA Galleria 2 6928 Manno-Lugano Switzerland Phone : +41 91 - 610 8663 Fax : +41 91 - 610 8661 Secretary: +41 91 - 6108660 email: luca@idsia.ch and Monaldo Mastrolilli Phone : +41 91 - 610 8664 email: monaldo@idsia.ch -------------------------------- Sender: vznuri@earthlink.net Subject: theory-edge mailing list hi, I moderate the theory-edge mailing list dedicated to cutting edge mathematical and computational topics of potential interest to many on this list. http://groups.yahoo.com/group/theory-edge/ 400 subscribers, about 3000 messages in openly searchable archives. 3rd year anniversary in a few weeks. you can subscribe via email or over the web. currently around 5 msgs/day. we have a very engaging mix between theory and application. many graduate students and PhDs on the list. here are some frequent topics: - computer science complexity theory is a frequent topic / P=?NP - we have had many great threads on genetic algorithms & their applications, machine learning, etcetera. - advances in computing systems (quantum computing), supercomputing clusters, reconfigurable computing etcetera. - focus on recent research advances as reported in the media (wired/new york times/new scientist). especially seeking subscribers/academics who will engage in lively threads & comment on state of the art advances across various fields. -------------------------------- Sender: Paul Darwen Subject: Journal special issue on co-evolution Call for Papers Special Issue on Co-Evolution International Journal of Computational Intelligence and Applications Website: http://www.csee.uq.edu.au/~darwen/ijcia.html Important dates: Paper submission 1 August 2001 Notification of acceptance 1 November 2001 Final camera-ready manuscripts 1 January 2002 Publication of special issue March 2002 For enquiries please contact Paul Darwen . THEMES The special issue will cover a range of research topics relating to co-evolutionary methods in evolutionary computation. Usually in evolutionary computation, the evaluation function is hand-written by a human expert. In co-evolution, trial solutions in the population are evaluated by other trial solutions in either the same evolving population, or in another population that evolves in tandem. The aim is to induce an upward spiral, an arms race, of innovation and improvement. This broad approach has been gained notable successes in a range of tasks, including learning to play board games, schedule optimization, and the automatic design of sorting algorithms. REQUIREMENTS Researchers are invited to submit original work that has not been presented elsewhere. Substantially revised and extended versions of conference papers are most welcome. Authors are invited to submit 6 copies of full papers for review. Papers should be written in English, on A4 or US letter size paper. The first page of each paper must include the following information: - title of the paper, - names(s) and affiliation(s) of the author(s), - abstract of the paper, - maximum 5 keywords, - name, postal address, phone and fax numbers and e-mail address of the corresponding author. Please send papers to either of: Paul Darwen Xin Yao Dept. of CSEE Dept. of Computer Science The University of Queensland The University of Birmingham Brisbane QLD 4072 Birmingham B15 2TT Australia United Kingdom Email: darwen@ieee.org Email: xin@cs.bham.ac.uk -------------------------------- End of Genetic Algorithms Digest ********************************