Genetic Algorithms Digest  Tuesday, April  2, 2001  Volume 15 : Issue 12

 - 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 <Your Name (up to 4 words)>

 - 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:
        - Just a question ...
        - Announcing ICML-2001 Tutorials
        - [reply -- v15n11] EA, LCS and internet safe information request
        - diversity vs fitness
        - EC Book Announcement
-------------------------------------------------------------------------------

CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference)

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)
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)
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: "Simone Ribeiro" <simone@biof.ufrj.br>
Subject: Just a question ...

Hi!

I intend to do my PHD on Genetic Algorithms applied to the reconstruction of 
biological images and I've been trying to find some related stuff in the web.
Do you have any information about anybody doing some research on this?
I would be grateful if you could help me.

Yours sincerely,
Simone Ribeiro
simone@ufrj.br
State University of Brazil
Antecipadamente obrigada,

Simone Ribeiro
simone@biof.ufrj.br
Núcleo de Informática
Instituto de Biofísica Carlos Chagas Filho
UFRJ

--
Webmail System of the Carlos Chagas Filho Biophysics Institute

Federal University of Rio de Janeiro - Brazil

http://www.biof.ufrj.br


 --------------

Sender: Andrea Danyluk <andrea@cs.williams.edu>
Subject: Announcing ICML-2001 Tutorials

ICML-2001 announces its tutorial program, which will run in parallel
with workshops on Thursday, June 28, 2001:

Support Vector and Kernel Methods for Learning [Morning tutorial]
Nello Cristianini, Royal Holloway, University of London.

Knowledge Representation for Machine Learning [Afternoon tutorial]
Peter A. Flach, University of Bristol

Text Classification in vivo [Afternoon tutorial]
David D. Lewis

For descriptions of the tutorials, please see:

 http://www.ecn.purdue.edu/icml2001/tutorials.html

>>>Coming in the next couple of weeks: Registration and Housing
Information<<<


 --------------

Sender: "Fabio Abbattista" <fabio@di.uniba.it>
Subject: [reply -- v15n11] EA, LCS and internet safe information request

Dear Yu Xinje and GA-List members,
I am currently starting some research on a similar subject. In my idea an EA
or a LCS (Learning Classifier System) should analyze logs files in order to
infer a/some model/pattern of the normal (and intrusive) behavior of network
users/processes. The inferred model could be used to detect intvasion or
anomalous behavior.
    Can anybody list important papers (books), or comments?
    Many thanks in advance.
FAbio

 > Sender: Yu Xinjie <yuxinjie96@mails.tsinghua.edu.cn>
 > Subject: EA and internet safe information request
 >
 > Dear All,
 >
 >   I'd like to do some research work on Internet safe( including invasion
 > detection, attack pattern recognition, etc.) by using Evolutionary
 > Algorithm.  In my original idea, Genetic Programming (or Gene Express 
 > Programming) can deal with learning problem, and Genetic Algorithm is 
 > used to evolve the operation.
 >   Can anybody give some ideas, important papers (books), or comments?
 > Many thanks in advance.
 >
 > Best regards,
 >
 > Yu Xinjie


 --------------

Sender: juergen@idsia.ch
Subject: diversity vs fitness


The March 28/April 4 issue of "Technology Research News" is featuring
an article about recent work by Marcus Hutter of IDSIA (Switzerland). In
http://www.trnmag.com/Stories/032801/Diversity_trumps_fitness_032801.html
Kimberly Patch writes:

>>>Diversity trumps fitness: Evolutionary computing is usually about
making everybody better. It turns out that for complicated problems
keeping the losers around is the way to go.  [...] The approach
is novel, according to Erick Cantu-Paz, a computer scientist at the
Center for Applied Scientific Computing at Lawrence Livermore National
Laboratories. "I was actually surprised by the originality of the idea,"
he said. The approach "breaks out of the convention of trying to increase
the average fitness of the population. This method obviously preserves
diversity [and] preserving diversity is a good thing because it prevents
useful building blocks [from being deleted] from the population,"
he said.<<<

Here is Hutter's original paper:
Fitness Uniform Selection to Preserve Genetic Diversity

Abstract: In evolutionary algorithms, the fitness of a population
increases with time by mutating and recombining individuals and by a
biased selection of fitter individuals. Proper selection pressure is
critical in ensuring sufficient optimization progress while preserving
genetic diversity to escape from local optima. We propose a new selection
scheme which is uniform in the fitness values. It generates selection
pressure towards sparsely populated fitness regions, not necessarily
towards higher fitness, as is the case for all other selection schemes. We
show analytically on a simple example and numerically for the Traveling
Salesman Problem that the new selection scheme can be much more effective
than standard selection schemes.

ftp://ftp.idsia.ch/pub/techrep/IDSIA-01-01.ps.gz
http://arxiv.org/abs/cs.AI/0103015

I think it is funny that the paper was rejected by a conference on genetic
algorithms (GECCO 2001) - I saw the reviews and can testify they were
truly inadequate.

The same Marcus Hutter recently also published a very remarkable paper:
"The fastest and shortest algorithm for all well-defined problems"
ftp://ftp.idsia.ch/pub/techrep/IDSIA-16-00.ps.gz

-------------------------------------------------------------------------

Juergen Schmidhuber               director
IDSIA, Galleria 2, 6928 Manno, Switzerland
juergen@idsia.ch     www.idsia.ch/~juergen


PS: EURO-GP 2001 (April 18-20) will take place in Como, Italy, only 40
min by train or car from IDSIA (across the Swiss border).  To arrange
for a visit in April please contact juergen@idsia.ch


 --------------

Sender: Hans-Georg Beyer <beyer@zappa.cs.uni-dortmund.de>
Subject: EC Book Announcement


Now available:

                 THE THEORY OF EVOLUTION STRATEGIES

                        by Hans-Georg Beyer

                  Springer-Verlag, Heidelberg, 2001
                         ISBN 3-540-67297-4

    http://ls11-www.cs.uni-dortmund.de/people/beyer/Welcome.html


>From the book jacket:

Evolutionary Algorithms, in particular Evolution Strategies, Genetic 
Algorithms, or Evolutionary Programming, have found wide acceptance as 
robust optimization algorithms in the last ten years. Compared with the 
broad propagation and the resulting practical prosperity in different 
scientific fields, the theory has not progressed as much.

This monograph provides the framework and the first steps toward the 
theoretical analysis of Evolution Strategies (ES). The main emphasis is 
on understanding the functioning of these probabilistic optimization
algorithms in real-valued search spaces by investigating the dynamical 
properties of some well-established ES algorithms. The book introduces 
the basic concepts of this analysis, such as progress rate, quality gain,
and self-adaptation response, and describes how to calculate these 
quantities. Based on the analysis, functioning principles are derived, 
aiming at a qualitative understanding of why and how ES algorithms work. 

For more information on this book, visit the web page:
http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-67297-4

If you are an author (or contributor) of a Springer book, you should check: 
http://www.springer.de/forumforauthors/index.html 
in order to get your special author discount.


--------------

End of Genetic Algorithms Digest
******************************