Genetic Algorithms Digest Tuesday, May 22, 2001 Volume 15 : Issue 19 - 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: - NFL and algorithmic complexity (by R. Hartley) - WSC6 Deadline extended to June 22 - 2nd CFP: 6th On-line World Conference on Soft Computing - genetic algorithms and statistical problems -------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) 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) WSC6 6th Online World Conf on Soft Computing..., www Sep 10-24, 01 (v15n19) 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 Conf Active Media Tech, Hong Kong, China 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: Ralph Hartley Subject: NFL and algorithmic complexity Tom English points out that a form of NFL holds for a uniform distribution over the needle-in-a-haystack functions, all of which are of low algorithmic complexity. While obviously true, this misses the point of the "free nibble". Of course there are problem distributions for which NFL is true, there must be billions, even considering only those with low algorithmic complexity. The question is, what fraction of ALL low complexity problems is made up of these hard problems? Of course, if one knows that the problem at hand is to maximize a needle-in-a-haystack problem, one should abandon fancy optimization algorithms, evaluate points as cheaply as possible, and expect to evaluate half of them on average. The problem with the NFL theorems is not that the are untrue (they are theorems after all) it is that they are less often applicable than one might think, just from the statement of the theorem. As English notes, the NFL theorem is a property of the distribution of functions. It is easy to assume that a uniform distribution is a realistic distribution, there are classes of functions for which it is (such as needle-in-a-haystack functions), but others for which it is not. For example a uniform distribution over the set of all functions, with reasonable sized inputs and outputs, is not realistic (because most of the functions are not physically realizable). As far as I know, there is nothing really known about how big the "free nibble", due to algorithmic complexity limitations on the problems, actually is. Nor is it known how much of this potential can be realized in practice (e.g. including the cost of computation). It also possible that there are other, stronger, principles that have some degree of "universal" applicability, that might allow a "free snack". I don't know of any. Ralph Hartley -------------------------------- Sender: "Fabio Abbattista" Subject: WSC6 Deadline extended to June 22 The initial submission deadline for the "6th On-line World Conference on Soft Computing in Industrial Applications (WSC6)" of May 21 has been extended to June 22. As a consequence, the date for acceptance/rejection notification for the authors was also extended to July 22. CALL FOR PAPERS Soft Computing for Intelligent 3D Agents http://www.darmstadt.gmd.de/mobile/wsc6/cfp.html September 10-24, 2001 On-line on the WWW a session of the 6th Online World Conference on Soft Computing in Industrial Applications (WSC6) http://vision.fhg.de/wsc6/ AIM The field of Intelligent 3D Agents is a new emerging discipline that is becoming increasingly important in the Web community. An Intelligent 3D Agent is an embodied agent in an interactive environment, usually 3D. The new trends move toward autonomous agents, which, drawing from Artificial Intelligence, Soft Computing, Artificial Life technology, exhibit intelligent behavior interacting with their environment and with human users. Several application areas do exist for this new field, such as e-commerce, entertainment, distance learning, etc. The development of believable 3D Intelligent Agents requires a multidisciplinary approach, bringing together technology, aesthetic and psychology. As a matter of fact, the new technology opens a number of issues related to establishment and maintenance of social relationships between artificial agents and natural partners, as well as to affective computing, and graphical rendering of emotions. The aim of this session is to present the actual state of researches on Soft Computing for Intelligent 3D Agents, including animation techniques, behavioral and social models, compliance with standards like MPEG-4, H-Anim, X3D, evaluation studies, social issues etc. TOPICS: Under the title "Soft Computing for Intelligent 3D Agents", several themes could be covered by the authors of papers. The following not exhaustive list gives an idea of possible themes: · Soft Computing techniques in facial/body design/modeling. · Animation and Soft Computing. · Behavioral animation. · Design of intelligent 3D agents. · Computer graphics and learning. · Applications of Intelligent 3D Agents. · Architectures for Intelligent 3D Agents. · Virtual worlds and virtual ecology. · MPEG-4-based 3D agent systems. · VRML-based 3D agent systems. · JAVA-based 3D agent systems. · Embodiment and anthropomorphism · Believability and usability of 3D agents. · Social dynamics in Human-Agent interaction · etc. Submission Authors should submit an extended abstract (3 pages) no later than June 22nd 2001. Electronic submissions are strongly encouraged. The extended abstract in PostScript or Adobe PDF format should be sent to: Fabio Abbattista fabio@di.uniba.it Dipartimento di Informatica Universitą di Bari Via E. Orabona 4 - 70126 Bari (Italy) Organizing Committee · Fabio Abbattista, Dipartimento di Informatica, Universitą di Bari, Bari, Italy. · Antonella De Angeli, NCR Self-Service, Advance Technology & Research, Dundee UK. · Aldo Paradiso, GMD-IPSI, Darmstadt, Germany. · Giovanni Semeraro, Dipartimento di Informatica, Universitą di Bari, Bari, Italy. · Fabio Zambetta, Dipartimento di Informatica, Universitą di Bari, Bari, Italy. === Fabio Abbattista Dipartimento di Informatica Universita' di Bari Via E. Orabona 4 70126 Bari - Italy tel. +39 080 5443298 fax +39 080 5443196 mobile: 0347 5444757 0339 7724061 e-mail: fabio@di.uniba.it URL: http://www.di.uniba.it/people/complete/Web_Page_fabio.htm -------------------------------- Sender: Mario Koeppen Subject: 2nd CFP: 6th On-line World Conference on Soft Computing Dear Colleague, I would like to remind you on the upcoming deadline of the "6th On-line World Conference on Soft Computing in Industrial Applications," from September 10-24, 2001 on the Internet, which is JUNE 22. WSC6 Mario Koeppen (General Chair) *** SECOND CALL FOR PAPERS 6th ONLINE WORLD CONFERENCE ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS (WSC6) September 10 - 24, 2001 On the Internet (World Wide Web) http://vision.fhg.de/wsc6 *** Extended Deadline for Paper Submission: June 22, 2001 *** Honorary Chair: Prof. David E. Goldberg University of llinois at Urbana-Champaign Plenary Presentations: Dr. Jim Bezdek University of West Florida Prof. Yasuhiko Dote Muroran Institute of Technolgy Dr. Daniel Dubois University of Liege Dr. Vera Kurkova Institute of Computer Science Academy of Sciences of the Czech Republic Drs. Letelier & Mpodosis Universidad de Chile Dr. David Wolpert NASA Ames Research Center *** Please have a look at WSC6 Conference Page http://vision.fhg.de/wsc6 or one of the WSC6 MIRROR SITES: http://www.cranfield.ac.uk/wsc6 http://www.cec.uchile.cl/~wsc6 http://wsc6.softcomputing.net http://www.fmt.vein.hu/wsc6 *** EXTENDED SUBMISSION DEADLINE: June 22 Due to many requests, we have decided to extend the initial submission deadline of May 21 to June 22. For those of you who have already submitted a paper, and want to take the chance to modify their paper, there is always the possibility to resubmit again before June 22. Just upload the paper on the WSC6 website as for a regular submission, and send the old and the new papercode to wsc6@ipk.fhg.de. *** For FURTHER INFORMATION and ENQUIRIES, registration, sponsorship, and advertisement please contact the Conference Chair: Mario Koeppen WSC6 General Chair (wsc6@ipk.fhg.de) Fraunhofer IPK Berlin Dept. Pattern Recognition Pascalstr. 8-9, 10587 Berlin, Germany Tel. +49-30-39006 200 Fax. +49-30-391 7517 E-Mail: mario.koeppen@ipk.fhg.de Please visit the World Federation on Soft Computing website: http://www.pa.info.mie-u.ac.jp/WFSC/ Mario Koeppen Department Pattern Recognition Fraunhofer IPK-Berlin Pascalstr. 8-9, 10587 Berlin, Germany phone (++49)(0)30 390 06 200 fax (++49)(0)30 391 7517 email mario.koeppen@ipk.fhg.de homepage http://vision.fhg.de/ipk/koeppen ~~~ "Most impediments of science stems from conceptual locks, not factual lacks." Stephen Jay Gould pgp key at: http://vision.fhg.de/ipk/koeppen/mk.asc -------------------------------- Sender: yeniay@hacettepe.edu.tr Subject: genetic algorithms and statistical problems Dear Collegues, Given a data consisting of large number of variables, one of the most inportant problems in linear regression is to select a subset of them. Statisticians usually achieve this by using classical methods (forward selection, sequantial replacement, stepwise procedures etc.). I would like to use genetic algorithms for subset regression as an alternative method. I would like to contact researchers who are working on utilization of GAs in order to select these variables. Are there any GA program which can solve this problem ? and Do you know any statistical applications of GAs? Thanks Ozgur Yeniay Hacettepe University Department of Statistics 06532 Beytepe Ankara Turkey yeniay@hacettepe.edu.tr -------------------------------- End of Genetic Algorithms Digest ********************************