Genetic Algorithms Digest Thursday, October 11, 2001 Volume 15 : Issue 35 SUBMISSION ADDRESS: GA-List@gmu.edu LIST INFORMATION: http://ga-digest.research.ucf.edu/ LIST ARCHIVE: http://www.aic.nrl.navy.mil/galist/ (UN)SUBSCRIPTION INSTRUCTIONS: at the bottom af this email -------------------------------- Today's Topics: - Question about GA's and protein structure - Question about hypermutation - Gene Expression Programming tutorial - ECOMAS Webiste and Discussion Group - PhD Position at The University of Nottingham, UK - Research Position at University of Essex - EuroGP2002 41 days before deadline! - CFP: Journal, Special Issue on Real Life Apps of Nature Inspired... - ECAI 2002 : Call for Tutorials - CFP:Machine Learning for Games of Perfect and Imperfect Information - Update of www.gene-expression-programming.com -------------------------------- CALENDAR OF GA-RELATED ACTIVITIES: (with GA-List issue reference) 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) AL'01 1st Workshop on Art. Life Adelaide, Australia Dec 11, 01 (v15n25) HIS 2001 Int Wkshp on Hybrid Intel. Sys, Adelaide, Austr Dec 11-12, 01 (v15n31) SAGA2001 1st Symp on Stoch Alg..., Berlin, Germany Dec 13-14, 01 (v15n25) 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) WSES-EC2002 3rd Int Conf on EC Interlaken, Switzerland Feb 11-15, 02 (v15n26) ICAIS2002 1st ICSC on Aut. Int. Sys., Geelong, Australia Feb 12-15, 02 (v15n22) FEA2002 4th Int. WS on the Frontiers of EAs, NC, USA Mar 8-13, 02 (v15n34) IAS-7 7th Int. Conf. on Int. Aut. Sys., Marina..., Calif Mar 25-27, 02 (v15n33) EVOLANG2002 4th Int Conf on Evolution of Language, USA Mar 27-30, 02 (v15n21) EvoSTIM/EvoPLAN2002 WS EC on schedu..., Kinsale, Ireland Apr 3-5, 02 (v15n26) EvoCOP2002 2nd Euro WS EC on Combin..., Kinsale, Ireland Apr 3-4, 02 (v15n26) EVOIASP2001 4th Euro WS EC on Image..., Kinsale, Ireland Apr 3, 02 (v15n26) EuroGP2002 5th Euro Conference on GP , Kinsale, Ireland Apr 3-5, 02 (v15n28) BioSP3-IPDPS2002 Bio-Inspired..,Fort Lauderdale, Florida Apr 15, 02 (v15n34) Local Search Workshop, City University, London, UK Apr 16-17, 02 (v15n27) ACDM2002 5th Int. Conf. on Adaptive Comp...Devon, UK Apr 16-18, 02 (v15n25) MICAI2002 Mexican Int. Conf. on AI, Mexico, Apr 22-26, 02 (v15n32) CCSS 1st Conf. Comp. Soc. Sci..., Lake Arrowhead, CA USA May 9-12, 02 (v15n26) CEC2002 Congress on Evolutionary Comput., Honolulu, HI May 12-17, 02 (v15n23) ICMLA02 Int. Conf. on Mach. Learn...., Las Vegas, NV USA Jun 24-27, 02 (v15n35) ICML02 19th Int. Conf. on Mach. Learn., Sydney, Australi Jul 8-12, 02 (v15n33) GECCO2002 Genetic and Evolutionary Comp. Conf, NY, USA Jul 9-13, 02 (v15n30) PATAT 2002 4rth Int. Conf. ... Auto. Timetbl., Belgium Aug 21-23, 02 (v15n10) FOGA VII Foundations of GA's., Torremolinos, Spain Sep 4-6, 02 (v15n30) PPSN VII 7th Int Conf on Parallel Prob.., Granada, Spain Sep 7-11, 02 (v15n21) ICSC-NAISO 3rd ICSC on Eng of Int. Sys., Malago, Spain Sep 24-27, 02 (v15n24) AI'02 15th Australian Joint Conf. on AI, Canberra, Aust. Dec 2-6, 02 (v15n28) Send announcements of other activities to GA-List@gmu.edu -------------------------------- Sender: Rufus Subject: Request for relevant papers! I'm trying to apply genetic algorithms to predict 3D (tertiary) structures of proteins. I intend to use ECEPP/3 energy model. I would therefore be grateful if you could send me some relevant work in this area. Thank you ! With regards, Rufus Oladele. -------------------------------- Sender: Anabela_Simoes Subject: Hypermuttion Hi! I am a PhD student working in non-stationary problems. I am trying to compare my algorithm with the the GA using hypermutation (H. Cobb) but reading the two papers that I have about this subject I have some questions that I hope you can answer me. It was clear to me that when the problem reaches a stationary phase the mutation rate is set equal to 0.001. My question is, how is the mutation rate changed when changes occur? The maximum value is 0.5, but in figure 8c of paper (1) we can see that the mutation rate varies during the time between several different values. Which is the policy used to adapt the hypermutation rate? The papers that I have about this subject are: (1) H. Cobb - An investigation into the use of hypermutation as an adaptive operator in GA having continuous, time-dependent nonstationary environments, TR AIC 90-001, 1990. (2) H. Cobb, J. Grefenstette - GAs for tracking changing environments, ICGA 1993. I hope that anyone can help me. Thanks in advance Anabela -------------------------------- Sender: "Candida Ferreira" Subject: Gene Expression Programming tutorial Hello, everyone For those who missed it, the GEP tutorial presented this last September at the 6th Online World Conference on Soft Computing in Industrial Applications is now available for download at the Gene Expression Programming web site: paper: http://www.gene-expression-programming.com/webpapers/GEPtutorial.pdf presentation: http://www.gene-expression-programming.com/webpapers/slideShow.pdf As always, all constructive comments are welcome. Best, Candida Ferreira ++++++++++++++++++++++++++++++++++++++++++ Dr Candida Ferreira, Chief Scientist Gepsoft, 37 The Ridings, Bristol BS13 8NU, UK candidaf@gepsoft.com, tel: +44 (0) 117 907 1668 http://www.gepsoft.com ++++++++++++++++++++++++++++++++++++++++++ -------------------------------- Sender: "Robert E. Smith" Subject: ECOMAS Webiste and Discussion Group The organizers of the ECOMAS (Evolutionary Computation in Multi-Agent Systems) workshop at GECCO 2001 are please to announce that we are trying to promote a community on this topic, via our website, and an associated discussion group. If you are interested, please visit: http://www.csm.uwe.ac.uk/~rsmith/ECOMAS/ R. -- Robert E. Smith Director Intelligent Computer Systems Centre University of The West of England for further info and contact details, see: http://www.csm.uwe.ac.uk/~rsmith -------------------------------- Sender: Graham Kendall Subject: PhD Position at The University of Nottingham, UK A funded PhD position is available within the Automated Scheduling, Optimisation and Planning (ASAP) research group within the School of Computer Science and IT at The University of Nottingham. This research is due to start on the 1st February 2002. A brief description of the proposed research is given below We plan to investigate and further develop recent advances in heuristic optimisation techniques to produce good quality shelf layouts (also called planograms). Specifically, the objectives are to 1.Investigate modelling issues in formulating a shelf layout and develop appropriate models. The models will be capable of being optimised by exact techniques (e.g. linear programming, graph theory etc.) and AI techniques (e.g. genetic algorithms, ant algorithms, evolutionary strategies, multi-objective approaches etc.) 2.Investigate and develop operational research and artificial intelligence techniques to optimise the model developed in 1. The range of techniques we will consider will include initialisation strategies (so that we start searching from reasonable solutions), decomposition (to break the larger problem into sub-problems which may be easier to solve), case based reasoning (both as an initialisation strategy and as a method in its own right) and hybridisation (to combine two (or more) different algorithms). 3.Implement a prototype system for the next generation of planograms. These will produce planograms of higher quality than is currently available, using less time and labour than current methods. 4.Evaluate and assess the model on a range of real problems from the retail sector. More details (including a much fuller description of the research) can be seen at http://www.cs.nott.ac.uk/~gxk/positions/ You are encouraged to look at this information. The closing date for this position is 15th November 2001. If you apply, as well as sending your CV, please ensure you also include the following The reference for this position, which is "GXKplanogram" Your degree subject together with the classification achieved or expected Two people we can approach for references, with EMAIL addresses If applicable, your English language qualifications, with the score obtained When you would be available to start, should the position be offered It is important that we have this information and failure to provide it will slow down your application. Applications should be made to Mrs Diana French School of Computer Science and IT University of Nottingham Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK email : dxf@cs.nott.ac.uk -- Dr. Graham Kendall - Room C76 Lecturer, School Of Computer Science & IT University of Nottingham Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK Tel : +44 (0) 115 846 6514 Fax +44 (0) 115 951 4249 EMAIL : gxk@cs.nott.ac.uk WWW : http://cs.nott.ac.uk/~gxk -------------------------------- Sender: "Qingfu Zhang" 10/05/01 04:52AM Subject: job vacancies SENIOR RESEARCH OFFICER (A Rigorous Investigation into Estimation of Distribution Algorithms) Department of Computer Science (Constraint Programming and Optimisation Research Group) Applications are invited for the above post to join an EPSRC-funded research project on Evolutionary Computation. Candidates should have a PhD or equivalent research experience in evolutionary computation, optimisation, statistics, computer science or other related area. Good programming skills are essential. The appointment will be for 18 months from 1 December 2001, or as soon as possible thereafter. Starting salary will be in the range £17,451 - £22,299 per annum, on the Grade 1A scale for research staff. Informal enquiries should be addressed to Dr Q. Zhang, Professor E.P.K. Tsang or Dr. J. A. Ford (e-mail: {qzhang;edward;fordj}@essex.ac.uk) Further particulars and application details may be obtained by telephoning Colchester (01206) 872462 (24 hours), quoting reference R/990, e-mail to staffing@essex.ac.uk or by writing to the Personnel Section, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ. Closing date: 31 October 2001 -------------------------------- Sender: Julian F Miller Subject: EuroGP2002 41 days before deadline! ****** SECOND CALL FOR PAPERS ******** ****** EuroGP2002 ******** ****** 5th European Conference ******** ****** on Genetic Programming ******** ****** 3-5 April, Kinsale, Ireland ******** ****** http://evonet.dcs.napier.ac.uk/eurogp2002 ******** --- Key dates Submission deadline: 16 November 2001 Notification of acceptance: 18 December 2001 Camera ready copy due: 11 January 2002 --- The annual EuroGP series are the premier conferences in Europe devoted entirely to genetic programming. It attracts about 125 registrants including many of the leading names in the field from all over the world. Typically 30-35 submitted papers are published in the conference proceedings. The standard is high with about 40% of submissions accepted. The conference is a mixture of oral presentations and poster sessions. ALL accepted papers (both orals and posters) are published as full papers in the proceedings. EuroGP conferences are always enjoyable and offer good opportunities for informal contact with fellow researchers in a friendly and relaxed setting. EuroGP2002 will be held in the historic town of Kinsale, County Cork in the southwest of Ireland with its pretty streets, friendly pubs and natural harbour. --- Submission procedure --- High quality papers are sought on topics strongly relating to genetic programming. Submissions should be a maximum of ten A4 pages and they should be sent in zipped postscript format. It is advisable that the papers conform to the Springer Lecture Notes in Computer Science format (http://www.springer.de/comp/lncs/authors.html). It is very important that the email accompaying submission should state ALL the authors, including ALL their email addresses. Papers should be emailed to one of the program chairs James Foster Foster@cs.uidaho.edu Evelyne Lutton Evelyne.Lutton@inria.fr --- Organising Committe --- Program co-chairs (as above) Local chair: Conor Ryan conor.ryan@ul.ie Publication chair: Andrea Tettamanzi tettaman@genetica-soft.com Publicity chair: Julian Miller j.miller@cs.bham.ac.uk ************ END ************************************* -------------------------------- Sender: Hussein A Abbass Subject: CFP: Special Issue on Real Life Applications of Nature Inspired Combinatorial Heuristics: JASS, Cambridge International Science Publishing, Cambridge, UK Special Issue: Real Life Applications of Nature Inspired Combinatorial Heuristics -- Journal of Applied Systems Studies (JASS) Cambridge International Science Publishing, Cambridge, UK -- http://www.cs.adfa.edu.au/~abbass/JASS/ Theme and Scope -- Combinatorial problems are indispensable part of many real life applications. For example, the Traveling Salesman Problem, Scheduling, and Propositional Satisfiability are some of the conventional combinatorial problems that are being used as a template for many real life applications. More recently, the area of combinatorial problems attracted many research with the advances in Heuristics and Multi-agent Systems. The dramatic increase in the size of the search space, the non-stationary nature of the environment, and the need for real-time responses motivated research into solving combinatorial problems using heuristic techniques. Nowadays, heuristic techniques went beyond their traditional definition as a simple rule of thumb. They are inspired by nature, biology, statistical mechanics, physics, and neuroscience, to name but a few. Nature inspired heuristics are inspired by natural phenomena or behavior such as Evolution, Ants, Honey-Bees, Immune systems, Forest, etc. This special issue will ONLY accept papers on real life applications of Nature inspired heuristics in combinatorial problems. Submitted papers must contain original materials not published in nor submitted to other journals. Manuscripts should not exceed 15 typed single-space A4 (printing area 14.7 x 24.7 cm) pages including title page, abstract, text, figures, tables and references. Potential authors should adhere to the "Guidelines for Contributors" of JASS, which can be found at http://www.unipi.gr/jass/. All the submissions for this special issue should be sent to the Guest Editor at the address shown below. (Electronic Submission is Preferred) Dr. Hussein A. Abbass School of Computer Science, University of New South Wales, Australian Defense Force Academy Campus, NorthCott Drive, Canberra ACT 2600, Australia. Email: abbass@cs.adfa.edu.au Topics Covered -- Real life applications of the following heuristics -- 1. Evolutionary and Memetic Algorithms 2. Ant Colony Optimization 3. Marriage in Honey-Bees Optimization 4. Immune Systems 5. Others to the following areas -- 1. Agriculture 2. Bioinformatics 3. Defense 4. Production Systems 5. Data Mining 6. Finance 7. Engineering Applications 8. Others Proposed Referees: -- The author(s) of each article need to nominate at least 5 candidates of reviewers (names, institution, mailing address, and email) for their submitted paper. Nominated reviewers should be recognized researchers in the field. Proposed timetable Submissions due: March 1, 2002 Notification to authors: July 1, 2002 Revisions due: September 1, 2002 Final acceptance: December 1, 2002 Proposed publication: Within 2003 Hussein A. Abbass, Ph.D. School of Computer Science, Email: abbass@cs.adfa.edu.au Australian Defence Force Academy, http: http://www.cs.adfa.edu.au/~abbass University College, Tel.(W) (+61) (2) 62688158 University of New South Wales, Fax.(W) (+61) (2) 62688581 Canberra, ACT2600, Australia. -------------------------------- Sender: Yannick Pri Subject: ECAI 2002 : Call for Tutorials CALL FOR ECAI 2002 TUTORIAL PROPOSALS The 15th European Conference on Artificial Intelligence ECAI 2002 will be organized in Lyon (France), July 21-26, 2002. Full information at ECAI 2002 website: http://ecai2002.univ-lyon1.fr/ The deadline for tutorial proposal at ECAI 2002 is now approaching. The tutorials will be held on 21-22 July 2002, immediately prior to the start of the main conference. IMPORTANT DATES 1 Nov 2001 Deadline for proposals 1 Dec 2001 Notification of acceptance 15 Dec 2001 Deadline for tutorial summaries 5 Jan 2002 Publication of ECAI-2002 tutorial programme 25 May 2002 Camera-ready tutorial notes 21-22 Jul 2002 Tutorials at ECAI-2002 We invite proposals for four-hour or full day tutorials on topics relating to theoretical and applied AI. The aim is to offer conference delegates both tutorials on up-to-date AI technologies, and case study tutorials on the application of the AI technologies to real-world problems. A list of suggested topics is given below: artificial life knowledge representation automated deduction language technology case-based reasoning logic programming constraint processing machine learning data, text and web mining model-based reasoning entertainment and arts ontological engineering intelligent agents planning and scheduling intelligent interfaces probabilistic reasoning knowledge discovery and uncertainty knowledge engineering qualitative modelling knowledge management and simulation semantic web temporal and spatial reasoning Tutorials can play a major role in educating the AI community. It might concern emerging pportunities, technologies and problem areas: topics we did not imagine to mention are thus welcome. It can equally concern core methods from other disciplines that promise a strong synergy with AI methods, e.g., cognitive psychology, biology, statistics. Jean-Francois Boulicaut ECAI 2002 Tutorial Chair -- Y. -- Yannick Prié - Associate Prof. - LISI - UFR Informatique - bât. 710 Université Claude Bernard Lyon1 / F-69622 Villeurbanne Cedex FRANCE Tel: (+33) 4 72 43 16 36 Email: yprie@lisi.univ-lyon1.fr Fax: (+33) 4 72 43 15 36 Web: http://lisi.insa-lyon.fr/~yprie -------------------------------- Sender: Graham Kendall Subject: CFP - Machine Learning for Games of Perfect and Imperfect Information ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Call for Papers Machine Learning for "Games" of Perfect and Imperfect Information Special Session at The 2002 International Conference on Machine Learning and Applications (ICMLA'02) Monte Carlo Resort, Las Vegas, Nevada, USA June 24-27, 2002 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ See http://www.cs.nott.ac.uk/~gxk/icmla/2002/ for fuller details Topics of interest to this session could include, but are not limited to. Adaptive Computing Awari Backgammon Bridge Case-Based Reasoning Chess Cooperative Learning Co-Evolution Cribbage Evolutionary Computing Foreign Currency Trading Game Theory Hybrid Algorithms Multi-Agent Learning Multistrategy Learning Negotiation Neural Networks Othello Poker Prisoners Dilemma Reinforcement Learning Rummy Statistical Learning Stock Market Forecasting Some recent work (which may provide inspiration) in this area is shown at the end of this page, but this is only to demonstrate the type of areas that would be ideal for this sesssion and to provide inspiration. It is not meant to be a complete survey of the area, nor is it any indication of the quality of any conference, organisation or individuals. You are invited to submit a paper (max 7 pages). All papers will be reviewed and those accepted will be published in the conference proceedings. All accepted papers must be presented at the conference. Important Dates 1st January 2002 (Monday) : Deadline for submission of papers (max 7 pages) 15th March 2002 (Friday) : Notification of Acceptance 22nd April 2002 (Monday): Camera-Ready Papers & Pre-registration due 24th June 2002 to 27th June 2002 (Monday to Thursday) : ICMLA Conference Submission of Papers Authors will need to submit three copies of their paper; maximum of 7 pages; single-spaced; with a font size of 11 or 12. Papers must not have been previously published. The first page of the paper should include: title of the paper, names, email addresses, the affiliations the postal address, telephone number, and fax number for the first or corresponding author only abstract of maximum of 150 words a list of max 5 keywords Papers should be sent to Graham Kendall School Of Computer Science & IT University of Nottingham Jubilee Campus Wollaton Road Nottingham NG8 1BB UK E-mail submissions are also acceptable (to gxk@cs.nott.ac.uk) as either Word of PDF. Evaluation Process Papers will be evaluated for originality, significance, and clarity. Each paper will be evaluated by at least two reviewers. Publication The conference proceedings will be published by CSREA Press (ISBN), as a hardcopy. In addition, a CD version will also be available. The proceedings will be available at the conference. After the conference some papers will be considered for journal publication. -------------------------------- Sender: "Candida Ferreira" Subject: Update of www.gene-expression-programming.com Hello, everyone The Gene Expression Programming web site has been updated and now includes: - The GEP Online Bibliography to which you can add your own GEP publications; - A GEP tutorial presented at the WSC6 this last September; Check also the latest news for information on the release of APS 2.0 Academic Edition. http://www.gene-expression-programming.com/gep/ See you there! Candida Ferreira PS - I apologize for the server downtime in the last few days. +++ Dr Candida Ferreira, Chief Scientist Gepsoft, 37 The Ridings, Bristol BS13 8NU, UK candidaf@gepsoft.com, tel: +44 (0) 117 907 1668 http://www.gepsoft.com +++ -------------------------------- (UN)SUBSCRIPTION INSTRUCTIONS: - 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. -------------------------------- End of Genetic Algorithms Digest ********************************