Hi everybody

I am a new to this group and looking for clear examples that can make GP more
clear to me.

i am a good programer php and java. I've read many of GP books but i couldn't
understand them at all.

Any help would be appreciated.
Sam

PPSN 2010 Workshop on

'Self-tuning, self-configuring and self-generating search heuristics (Self* 2010)'
http://www.cs.nott.ac.uk/~gxo/ppsn2010-selfstar.html
Submission Deadline: June 3o, 2010

http://home.agh.edu.pl/~ppsn/
September 11-15, Krakow, Poland

Extended versions of selected contributions from this workshop will be considered for publication in a Special Issue of the Evolutionary Computation Journal, MIT Press.
http://www.cs.nott.ac.uk/~gxo/papers/ECJ_CFP2010.pdf

/* Objectives and Themes */

There is a renewed and growing research interest in techniques for automating the design of heuristic search methods, in order to remove or reduce the need for a human expert in the process of designing an effective algorithm to solve a search problem. Using machine learning or meta-level search, several approaches have been proposed in order to turn base search heuristics into self-* algorithms, either by adapting their control parameters or by dynamically assembling their algorithmic building blocks. Related self-adaptive and meta-level methods have thus been proposed in different communities, from stochastic local search and metaheuristic search to operational research and artificial intelligence. In this workshop we distinguish 3 general processes in automated heuristic design: 1) tuning: the process of adjusting the algorithm's control parameters, 2) configuring: the process of selecting and using existing algorithmic components such as search operators, construction heuristics, or acceptance criteria, and 3) generating: the process of creating altogether new heuristics (or heuristic components) from the basic sub-components of previously existing methods.

/* Topics of interest */

This workshop aims at bringing together researchers from different sub-fields of computer science, artificial intelligence and operations research that have recognised the need for developing automated systems to replace the role of a human expert in the design, tuning and generation of search heuristics (Self* search heuristics), and who are, therefore, interested in developing more generally applicable methodologies. Our interest is also directed towards the potential theoretical limitations of these approaches.

Relevant topics include, but are not limited to:

o adaptive and self-tuning algorithms
o adaptive multi-meme algorithms
o adaptive operator selection
o algorithm selection and portfolios
o applications and new challenging domains
o design of class-specific heuristics (e.g. using genetic programming)
o foundations of heuristic algorithms
o hybrid approaches
o hyper-heuristics
o model-based search
o online parameter control
o reactive search optimisation

/* Invited Speakers */

o Nikolaus Hansen, Machine Learning and Optimization group (TAO), INRIA Saclay – Île-de-France, University Paris Sud, France
o Rong Qu, Automated Scheduling, Optimisation and Planing group (ASAP), School of Computer Science, University of Nottingham, UK

/* Call for papers */

Self* 2010 accepts the following submission types:

1. Extended abstracts (max. 4 pages in in Springer LNCS format)
2. Short papers (max. 10 pages in in Springer LNCS format)
3. Work already published (or submitted) elsewhere, which is relevant and may promote fruitful discussion at the workshop (for oral presentation only, with no format restriction and limited to the size of standard journal papers, e.g. 30-40 pages at most)

The workshop proceedings will be published as a Computer Science technical report at the  University of Nottingham.

Contributions should be submitted in PDF format directly to the following e-mail address: selfstar2010@...

Extended versions of selected contributions from this workshop will be considered for publication in a Special Issue of Evolutionary Computation Journal, MIT.  (http://www.cs.nott.ac.uk/~gxo/papers/ECJ_CFP2010.pdf)

/* Organisers */

Gabriela Ochoa, University of Nottingham, UK
Marc Schoenauer, University Paris Sud, France
Darrell Whitley, Colorado State University, Colorado, USA

/* Important dates */

- Paper submission: June 30, 2010
- Notification of paper acceptance: July 30, 2010
- Final paper submission: September 1, 2010
- PPSN  2010 Workshops: September 11, 2010
- ECJ special issue deadline: December 31, 2010

/* Website */

Further information can be found online.
http://www.cs.nott.ac.uk/~gxo/ppsn2010-selfstar.html

We are looking forward to meeting you at PPSN-2010!

**** GECCO-2011: Call for New Frontiers Track Proposals ****

2011 Genetic and Evolutionary Computation Conference (GECCO-2011)
July 12-16, Dublin, Ireland

Organized by ACM SIGEVO

20th International Conference on Genetic Algorithms (ICGA) and the
16th Annual Genetic Programming Conference (GP)

One Conference - Many Mini-Conferences‚ 15 Program Tracks

The organization of GECCO 2011 is well underway and we are happy
to announce a very exciting program of tracks:

- Ant Colony Optimization and Swarm Intelligence
- Artificial Life, Evolutionary Robotics,
Adaptive Behaviour and Evolvable Hardware
- Bioinformatics, Computational, Systems and Synthetic Biology
- Estimation of Distribution Algorithms
- Evolutionary Strategies, Evolutionary Programming
- Evolutionary (& Metaheuristics) Combinatorial Optimisation
- Evolutionary Multiobjective Optimisation
- Generative and Developmental Systems
- Genetic Algorithms
- Genetic Programming
- Genetics-based Machine Learning
- Parallel Evolutionary Systems
- Real World Applications
- Search Based Software Engineering
- Theory

For GECCO-2011, we wish to expand the list of usual tracks with one New
Frontiers Tracks (NFTs).

The goal of New Frontiers Tracks is to allow our community to explore
emerging, exciting new ideas that relate or impinge into Genetic and
Evolutionary Computation and Natural Computing.

Thus, we are delighted to invite for NFTs proposals.

** NEW FRONTIERS TRACK PROPOSAL FORMAT **
Proposals should include a track title, the list of up to two co-chairs
and an abstract of max 1000 characters. The abstract should both
(i) describe the track focus and (ii) point out why the track should
be added to GECCO.

** SUBMISSION **
Proposals for NFTs should be submitted to Natalio Krasnogor
(Natalio.Krasnogor@...) with subject‚ "GECCO 2011 NFT
Proposal"‚ not later than 30th June 2010.

** SELECTION **
The list of all NFTs will be in display at GECCO 2010 and a ballot
(details to be announced later) will be carried out during GECCO 2010.

Prospective chairs will be allowed to submit a one minute video to
support their track. The videos will be put on-line on the
GECCO-2011 website.

The most voted NFT will be selected for inclusion into GECCO 2011 program.
The selected NFT will have the same status, editorial procedures and quality
control as normal GECCO tracks. NFTs are expected to run for one year only.

We believe this to be an exciting opportunity for the community to explore
innovative, perhaps risky & adventurous research topics, within the
framework
of the top conference in the field. Hence, we very much look forward for a
strong response from the community to this call for New Frontiers Track
proposals!

Nat Krasnogor (GECCO 2011, Editor-in-chief)
Pier Luca Lanzi (GECCO 2011, General Chair)

GECCO is sponsored by the Association for Computing Machinery Special
Interest
Group for Genetic and Evolutionary Computation (ACM SIGEVO).

26th ACM Symposium On Applied Computing
March 21-25, 2011
TaiChung, Taiwan

For the past twenty-five years, the ACM Symposium on Applied Computing
has been a primary gathering forum for applied computer scientists,
computer engineers, software engineers, and application developers from
around the world. SAC 2011 is sponsored by the ACM Special Interest
Group on Applied Computing (SIGAPP), and is hosted by Tunghai
University, Taichung, Taiwan.

The Evolutionary Computation (EC) track welcomes original, unpublished
papers describing advances in and applications of evolutionary
computation and related techniques, including genetic algorithms,
evolution strategies, evolutionary programming, memetic algorithms,
genetic programming, ant colony optimization, co-evolutionary
algorithms, artificial immune systems, particle swarm optimization, and
classifier systems. All accepted papers will appear in the SAC 2010
Proceedings. Selected papers, not accepted as full papers, will be
accepted as poster papers. These will be presented at a poster session
during the Symposium and will be published as two-page extended
abstracts in the Proceedings.
Peer groups with expertise in the track focus area will blindly review
submissions to that track. Accepted papers will be published in the
annual conference proceedings. Submission guidelines can be found on SAC
2011 Website (http://www.acm.org/conferences/sac/sac2011/)
A paper may be submitted to only one track of SAC 2011.

GUIDELINES FOR SUBMISSION
* Papers should represent original and previously unpublished works that
are currently not under review for any journal or other conference. Both
basic and applied research papers are welcome.
* Submissions will be in electronic format via this web site:
https://www.softconf.com/b/sac11-tp/
* Submission must follow ths template found at this URL:
http://www.acm.org/conferences/sac/sac2011/
* Authors are allowed up to eight (8) pages in the specified format, but
there is a charge of US$80 for each page over five (5).
* Authors' names and addresses must not appear in the body of the
submitted papers, and self-references should be in the third person.
This is to facilitate blind review.
* Begin the submission process by submitting your paper's abstract on
the conference web site at the URL above.
* All submitted papers must include the paper identification number
(assigned when the abstract is submitted) on the front page above the
title of the paper.
* No author's name may appear on more than two papers accepted to the EC
track.

Note also the guidelines in the general SAC 2011 Call for Papers
(http://www.acm.org/conferences/sac/sac2011/SAC2011-CFP.pdf).

IMPORTANT DATES (all deadlines will be strictly enforced)
Aug 24, 2010: Paper Submission
Sept 21, 2010: Tutorial Proposals Oct 12, 2010: Author Notification
Nov 2, 2010: Camera-ready copies

For additional information, visit the SAC 2010 EC Track web page
(www.upo.es/eps/SAC/cfpSAC2011EC.html) and the general  SAC 2010 web
page (http://www.acm.org/conferences/sac/sac2011/).

TRACK CHAIRS
Federico Divina, Raúl Giráldez Rojo
School of Engineering
Pablo de Olavide University
Seville, Spain
{fdivina,giraldez} AT upo DOT es
Phone: +34 954 977592
Fax: +34 9543 48689

--
______________________________

Dr. Federico Divina
Assistant Professor
School of Engineering
Pablo de Olavide University
Seville, Spain
______________________________

** Apologies for cross-postings. Please send to interested colleagues and
students **

-- CALL FOR PAPERS - Deadline for submissions (1st call extension): 25 June 2010
--

               IADIS INTERNATIONAL CONFERENCE WWW/INTERNET 2010
                     Timisoara, Romania, 14 - 17 October 2010
                       (http://www.internet-conf.org/)


* Keynote Speakers (confirmed):
Mark Frydenberg, Senior Lecture, Bentley University, USA
Molly Holzschlag, Web Evangelist, Developer Relations, Opera Software, USA

* Conference background and goals
The IADIS WWW/Internet 2010 conference aims to address the main issues of
concern within WWW/Internet. WWW and Internet had a huge development in recent
years. Aspects of concern are no longer just technical anymore but other aspects
have aroused. This conference aims to cover both technological as well as
non-technological issues related to these developments. Main tracks have been
identified (see below). However innovative contributes that don't fit into these
areas will also be considered since they might be of benefit to conference
attendees.

* Format of the Conference
The conference will comprise of invited talks and oral presentations. The
proceedings of the conference will be published in the form of a book and CD-ROM
with ISBN, and will be available also in the IADIS Digital Library
(http://www.iadis.net/dl). The best paper authors will be invited to publish
extended versions of their papers in the IADIS International Journal on
WWW/Internet (ISSN: 1645-7641) and also in other selected Journals.

* Types of submissions
Full and Short Papers, Reflection Papers, Posters/Demonstrations, Tutorials,
Panels and Doctoral Consortium. All submissions are subject to a blind
refereeing process.

* Topics related to WWW/Internet are of interest. These include, but are not
limited to the following areas:

Web 2.0
- Collaborative Systems
- Social Networks
- Folksonomies
- Enterprise Wikis and Blogging
- Mashups and Web Programming
- Tagging and User Rating Systems
- Citizen Journalism


Semantic Web and XML
- Semantic Web Architectures
- Semantic Web Middleware
- Semantic Web Services
- Semantic Web Agents
- Ontologies
- Applications of Semantic Web
- Semantic Web Data Management
- Information Retrieval in Semantic Web

Applications and Uses
- e-Learning
- e-Commerce / e-Business
- e-Government
- e-Health
- e-Procurement
- e-Society
- Digital Libraries
- Web Services/SaaS
- Application Interoperability
- Web-based multimedia technologies

Services, Architectures and Web Development
- Wireless Web
- Mobile Web
- Cloud/Grid Computing
- Web Metrics
- Web Standards
- Internet Architectures
- Network Algorithms
- Network Architectures
- Network Computing
- Network Management
- Network Performance
- Content Delivery Technologies
- Protocols and Standards
- Traffic Models

Research Issues
- Web Science
- Digital Rights Management
- Bioinformatics
- Human Computer Interaction and Usability
- Web Security and Privacy
- Online Trust and Reputation Systems
- Data Mining
- Information Retrieval
- Search Engine Optimization

* Important Dates:
- Submission Deadline (1st call extension): 25 June 2010
- Notification to Authors (1st call extension): 28 July 2010
- Final Camera-Ready Submission and Early Registration (1st call extension):
Until 6 September 2010
- Late Registration (1st call extension): After 6 September 2010
- Conference: Timisoara, Romania, 14 to 17 October 2010

* Conference Location
The conference will be held in Timisoara, Romania.

* Secretariat
IADIS Secretariat - IADIS INTERNATIONAL CONFERENCE WWW/INTERNET 2010
Rua Sao Sebastiao da Pedreira, 100, 3
1050-209 Lisbon, Portugal
E-mail: secretariat@...
Web site: http://www.internet-conf.org/

* Program Committee

Program Chair
Bebo White, Stanford University, USA

Conference Co-Chairs
Pedro Isaías, Universidade Aberta (Portuguese Open University), Portugal
Diana Andone, "Politehnica" University of Timisoara, Romania

Committee Members: *
* for committee list please refer to http://www.internet-conf.org/committees.asp

* Co-located events
Please also check the co-located events Applied Computing 2010
(http://www.computing-conf.org/) - 14-16 October 2010 and CELDA 2010
(http://www.celda-conf.org/) - 15-17 October 2010.

* Registered participants in the WWW/Internet conference may attend the Applied
Computing and CELDA conferences' sessions free of charge.

We have recently released Psh v1.0, a Java implementation of the Push 3.0
programming language and PushGP genetic programming environment. Push is a
stack-based programming language intended primarily for use in evolutionary
computation systems as the language in which evolving programs are expressed.
PushGP is a mostly generic genetic programming system, except that it evolves
Push programs rather than Lisp-style program trees. This release of Psh contains
new example problems for PushGP, an extended instruction set, and is released
under the Apache 2.0 License.

Push has an unusually simple syntax, which facilitates the development of
mutation and recombination operators that generate and manipulate programs.
Despite this simple syntax, Push provides more expressive power than most other
program representations that are used for program evolution. Push programs can
process multiple data types (without the syntax restrictions that usually
accompany this capability), and they can express and make use of arbitrary
control structures (e.g. recursive subroutines and macros) through the explicit
manipulation of their own code (via "CODE" and "EXEC" data types).

To learn more about or get started with Psh, visit the open source repository at
http://github.com/jonklein/Psh/tree/v1.0 . If you would prefer a different
version of Push -- versions exist in C++, JavaScript, Scheme, Clojure, and
Common Lisp -- or would like more information, see
http://hampshire.edu/lspector/push.html .

Tom Helmuth
University of Massachusetts Amherst
thelmuth@...

Workshop on Experimental Methods for the Assessment of Computational Systems
(WEMACS)
on September 11, 2010 in Krakow, Poland, as part of the PPSN 2010 workshop
program
http://www.imada.sdu.dk/~marco/EMAA2010/

Organizers: Thomas Bartz-Beielstein, Marco Chiarandini, Luis Paquete, Mike
Preuss
Advisory board: Mauro Birattari, Juergen Branke, Dimo Brockhoff, Carlos Fonseca,
				 David Ginsbourger, Yuri Goegebeur, Gusz Eiben, Wolfgang Konen,
				 Joern Mehnen, Boris Naujoks, Ruxandra Stoean, Heike Trautmann

Submission: abstracts (<=4pages) or papers (<=10pages), LNCS formatted PDF, via
             mail to Mike Preuss (mike.preuss@...), --deadline-- July
15

Accepted papers must be presented at the workshop and will be considered for a
special
issue of the Evolutionary Computation Journal, MIT Press.


Scope of the Workshop
=====================
The experimental analysis of computational systems inspired by nature can be
made more sound and effective by the use of appropriate experimental methods.
More severe requirements have been transmitted to draw objective conclusions
from computational experiments, while at the same time the design and
configuration of the computational systems can be improved by profitable ways of
looking into the data collected. The quest for these methods is spawning a
considerable amount of interdisciplinary research, mainly between the fields of
computer science, artificial intelligence, optimization, statistics and machine
learning.

The aim of this workshop is to collect works in this interdisciplinary area. On
the one side, we look for submissions advancing the quality of experimental
methods. Some types of analysis still remain peculiar to the field of computer
science and require ad hoc methods. Examples are modeling algorithm behavior
over time, dealing with censored data, multiobjective and dynamic environments. 
On the other side, we look for works that possibly reinvestigate previously
published computational systems and algorithms and extend the characterization
of their empirical performances, producing novel results.

Relevant topics for this workshop are:
+ Tuning and configuration: new methods and comparison of existing ones
+ Modeling algorithm behavior over time and applications of survival analysis
+ Learning methods for algorithm analysis and design
+ Methods for algorithm selection in algorithm portfolios
+ Generation of data sets for benchmarking
+ Novel results on empirical assessment and comparisons of known methods in old
or new settings
+ Setting up and maintenance of data repositories
+ Assessment of analysis methods in terms of errors and predictive power
+ Performance assessment methods in multiobjective and dynamic environments
+ Novel ways to visualize results
+ Simulation techniques and meta-models for algorithm analysis
+ Assessment methods for competitions
+ Experiments to validate/substantiate recent advances in the theory of
heuristic computations

PPSN 2010 Workshop on

'Self-tuning, self-configuring and self-generating search heuristics (Self* 2010)'
http://www.cs.nott.ac.uk/~gxo/ppsn2010-selfstar.html

Submission Deadline: July 15, 2010 (Extended)

http://home.agh.edu.pl/~ppsn/
September 11-15, Krakow, Poland

Extended versions of selected contributions from this workshop will be considered for publication in a Special Issue of the Evolutionary Computation Journal, MIT Press.
http://www.cs.nott.ac.uk/~gxo/papers/ECJ_CFP2010.pdf

/* Objectives and Themes */

There is a renewed and growing research interest in techniques for automating the design of heuristic search methods, in order to remove or reduce the need for a human expert in the process of designing an effective algorithm to solve a search problem. Using machine learning or meta-level search, several approaches have been proposed in order to turn base search heuristics into self-* algorithms, either by adapting their control parameters or by dynamically assembling their algorithmic building blocks. Related self-adaptive and meta-level methods have thus been proposed in different communities, from stochastic local search and metaheuristic search to operational research and artificial intelligence. In this workshop we distinguish 3 general processes in automated heuristic design: 1) tuning: the process of adjusting the algorithm's control parameters, 2) configuring: the process of selecting and using existing algorithmic components such as search operators, construction heuristics, or acceptance criteria, and 3) generating: the process of creating altogether new heuristics (or heuristic components) from the basic sub-components of previously existing methods.

/* Topics of interest */

This workshop aims at bringing together researchers from different sub-fields of computer science, artificial intelligence and operations research that have recognised the need for developing automated systems to replace the role of a human expert in the design, tuning and generation of search heuristics (Self* search heuristics), and who are, therefore, interested in developing more generally applicable methodologies. Our interest is also directed towards the potential theoretical limitations of these approaches.

Relevant topics include, but are not limited to:

o adaptive and self-tuning algorithms
o adaptive multi-meme algorithms
o adaptive operator selection
o algorithm selection and portfolios
o applications and new challenging domains
o design of class-specific heuristics (e.g. using genetic programming)
o foundations of heuristic algorithms
o hybrid approaches
o hyper-heuristics
o model-based search
o online parameter control
o reactive search optimisation

/* Invited Speakers */

o Nikolaus Hansen, Machine Learning and Optimization group (TAO), INRIA Saclay – Île-de-France, University Paris Sud, France
o Rong Qu, Automated Scheduling, Optimisation and Planing group (ASAP), School of Computer Science, University of Nottingham, UK

/* Call for papers */

Self* 2010 accepts the following submission types:

1. Extended abstracts (max. 4 pages in in Springer LNCS format)
2. Short papers (max. 10 pages in in Springer LNCS format)
3. Work already published (or submitted) elsewhere, which is relevant and may promote fruitful discussion at the workshop (for oral presentation only, with no format restriction and limited to the size of standard journal papers, e.g. 30-40 pages at most)

The workshop proceedings will be published as a Computer Science technical report at the  University of Nottingham.

Contributions should be submitted in PDF format directly to the following e-mail address: selfstar2010@...

Extended versions of selected contributions from this workshop will be considered for publication in a Special Issue of Evolutionary Computation Journal, MIT.  (http://www.cs.nott.ac.uk/~gxo/papers/ECJ_CFP2010.pdf)

/* Organisers */

Gabriela Ochoa, University of Nottingham, UK
Marc Schoenauer, University Paris Sud, France
Darrell Whitley, Colorado State University, Colorado, USA

/* Important dates */

- Paper submission: July 15, 2010
- Notification of paper acceptance: July 30, 2010
- Final paper submission: September 1, 2010
- PPSN  2010 Workshops: September 11, 2010
- ECJ special issue deadline: December 31, 2010

/* Website */

Further information can be found online.
http://www.cs.nott.ac.uk/~gxo/ppsn2010-selfstar.html

We are looking forward to meeting you at PPSN-2010!

**** GECCO-2011: Call for New Frontiers Track Proposals ****

2011 Genetic and Evolutionary Computation Conference (GECCO-2011)
July 12-16, Dublin, Ireland

Organized by ACM SIGEVO

20th International Conference on Genetic Algorithms (ICGA) and the
16th Annual Genetic Programming Conference (GP)

One Conference - Many Mini-Conferences‚ 15 Program Tracks

The organization of GECCO 2011 is well underway and we are happy
to announce a very exciting program of tracks:

- Ant Colony Optimization and Swarm Intelligence
- Artificial Life, Evolutionary Robotics,
Adaptive Behaviour and Evolvable Hardware
- Bioinformatics, Computational, Systems and Synthetic Biology
- Estimation of Distribution Algorithms
- Evolutionary Strategies, Evolutionary Programming
- Evolutionary (& Metaheuristics) Combinatorial Optimisation
- Evolutionary Multiobjective Optimisation
- Generative and Developmental Systems
- Genetic Algorithms
- Genetic Programming
- Genetics-based Machine Learning
- Parallel Evolutionary Systems
- Real World Applications
- Search Based Software Engineering
- Theory

For GECCO-2011, we wish to expand the list of usual tracks with one New
Frontiers Tracks (NFTs).

The goal of New Frontiers Tracks is to allow our community to explore
emerging, exciting new ideas that relate or impinge into Genetic and
Evolutionary Computation and Natural Computing.

Thus, we are delighted to invite for NFTs proposals.

** NEW FRONTIERS TRACK PROPOSAL FORMAT **
Proposals should include a track title, the list of up to two co-chairs
and an abstract of max 1000 characters. The abstract should both
(i) describe the track focus and (ii) point out why the track should
be added to GECCO.

** SUBMISSION **
Proposals for NFTs should be submitted to Natalio Krasnogor
(Natalio.Krasnogor@...) with subject‚ "GECCO 2011 NFT
Proposal"‚ not later than 30th June 2010.

** SELECTION **
The list of all NFTs will be in display at GECCO 2010 and a ballot
(details to be announced later) will be carried out during GECCO 2010.

Prospective chairs will be allowed to submit a one minute video to
support their track. The videos will be put on-line on the
GECCO-2011 website.

The most voted NFT will be selected for inclusion into GECCO 2011 program.
The selected NFT will have the same status, editorial procedures and quality
control as normal GECCO tracks. NFTs are expected to run for one year only.

We believe this to be an exciting opportunity for the community to explore
innovative, perhaps risky & adventurous research topics, within the
framework
of the top conference in the field. Hence, we very much look forward for a
strong response from the community to this call for New Frontiers Track
proposals!

Nat Krasnogor (GECCO 2011, Editor-in-chief)
Pier Luca Lanzi (GECCO 2011, General Chair)

GECCO is sponsored by the Association for Computing Machinery Special
Interest
Group for Genetic and Evolutionary Computation (ACM SIGEVO).

> Steve DiPaola has a National Portrait Gallery talk (this Thurs) and coinciding
> week long gallery show this upcoming week (Tues-Sat) in London that
> showcases the genetic programing Darwin's Gaze evolved portrait /
> creativity work. The talk will discuss it but will center on artists
> as cognitive scientists (via computer modelling studies).
>
> The art show will center on the creativity/genetic programming
> work. This is the same work that was shown recently at the MIT Museum
> as well as Cambridge Univ for the Darwin Festival but combined with new
> work on Rembrandt/cognition.
>
> For more details see:
>  http://www.dipaola.org/creativity/


                                 Bill

         Dr. W. B. Langdon,
         http://www.cs.ucl.ac.uk/staff/W.Langdon/

FOGA 2011              http://www.sigevo.org/foga-2011/
CIGPU 2010             http://www.cs.ucl.ac.uk/external/W.Langdon/cigpu
A Field Guide to Genetic Programming
                        http://www.gp-field-guide.org.uk/
RNAnet 	       http://bioinformatics.essex.ac.uk/users/wlangdon/rnanet
GP EM                  http://www.springer.com/10710
GP Bibliography        http://www.cs.bham.ac.uk/~wbl/biblio/

Note that John's article is available for FREE under open access, as is the
Langdon and Gustafson article in the same issue.

Even better, the ENTIRE ISSUE is available for FREE during the month of July,
2010.

This is because the publisher would like to promote this "Tenth Anniversary
Issue: Progress in Genetic Programming and Evolvable Machines," edited by Julian
Miller and Riccardo Poli.

I think that this is a really nice special issue, containing some excellent
summaries of the state of the field and directions in which it is expected to
move in the near future.

The link to the online version of the entire issue is:

    
http://www.springerlink.com/content/h46r77k291rn/?p=bfaf36a87f704d5cbcb66429f9c8\
a808&pi=0

  -Lee


On Jul 2, 2010, at 12:31 PM, John Koza wrote:
> Hello:
>
>
> The Genetic Programming and Evolvable Machines journal has just published my
article (which is available in its entirety) on “Human-competitive results
produced by genetic programming.”   It lists 76 human-competitive results
produced by genetic programming and various features common to work done in
different fields by many different researchers.
>
> http://www.springerlink.com/content/92n753376213655k/
>
--
Lee Spector, Professor of Computer Science
School of Cognitive Science, Hampshire College
893 West Street, Amherst, MA 01002-3359
lspector@..., http://hampshire.edu/lspector/
Phone: 413-559-5352, Fax: 413-559-5438

Check out Genetic Programming and Evolvable Machines:
http://www.springer.com/10710 - http://gpemjournal.blogspot.com/

The free issue is now included in the latest issue of the GP bibliography
http://www.cs.bham.ac.uk/~wbl/biblio/

Bill

** Apologies for cross-postings. Please send to interested colleagues and
students **

-- CALL FOR PAPERS - Deadline for submissions (2nd call): 26 July 2010 --

               IADIS INTERNATIONAL CONFERENCE WWW/INTERNET 2010
                     Timisoara, Romania, 14 - 17 October 2010
                       (http://www.internet-conf.org/)


* Keynote Speakers (confirmed):
Mark Frydenberg, Senior Lecturer, Bentley University, USA
Molly Holzschlag, Web Evangelist, Developer Relations, Opera Software, USA

* Conference background and goals
The IADIS WWW/Internet 2010 conference aims to address the main issues of
concern within WWW/Internet. WWW and Internet had a huge development in recent
years. Aspects of concern are no longer just technical anymore but other aspects
have aroused. This conference aims to cover both technological as well as
non-technological issues related to these developments. Main tracks have been
identified (see below). However innovative contributes that don't fit into these
areas will also be considered since they might be of benefit to conference
attendees.

* Format of the Conference
The conference will comprise of invited talks and oral presentations. The
proceedings of the conference will be published in the form of a book and CD-ROM
with ISBN, and will be available also in the IADIS Digital Library
(http://www.iadis.net/dl). The best paper authors will be invited to publish
extended versions of their papers in the IADIS International Journal on
WWW/Internet (ISSN: 1645-7641) and also in other selected Journals.

* Types of submissions
Full and Short Papers, Reflection Papers, Posters/Demonstrations, Tutorials,
Panels and Doctoral Consortium. All submissions are subject to a blind
refereeing process.

* Topics related to WWW/Internet are of interest. These include, but are not
limited to the following areas:

Web 2.0
- Collaborative Systems
- Social Networks
- Folksonomies
- Enterprise Wikis and Blogging
- Mashups and Web Programming
- Tagging and User Rating Systems
- Citizen Journalism


Semantic Web and XML
- Semantic Web Architectures
- Semantic Web Middleware
- Semantic Web Services
- Semantic Web Agents
- Ontologies
- Applications of Semantic Web
- Semantic Web Data Management
- Information Retrieval in Semantic Web

Applications and Uses
- e-Learning
- e-Commerce / e-Business
- e-Government
- e-Health
- e-Procurement
- e-Society
- Digital Libraries
- Web Services/SaaS
- Application Interoperability
- Web-based multimedia technologies

Services, Architectures and Web Development
- Wireless Web
- Mobile Web
- Cloud/Grid Computing
- Web Metrics
- Web Standards
- Internet Architectures
- Network Algorithms
- Network Architectures
- Network Computing
- Network Management
- Network Performance
- Content Delivery Technologies
- Protocols and Standards
- Traffic Models

Research Issues
- Web Science
- Digital Rights Management
- Bioinformatics
- Human Computer Interaction and Usability
- Web Security and Privacy
- Online Trust and Reputation Systems
- Data Mining
- Information Retrieval
- Search Engine Optimization

* Important Dates:
- Submission Deadline (2nd call): 26 July 2010
- Notification to Authors (2nd call): 6 September 2010
- Final Camera-Ready Submission and Early Registration (2nd call): Until 20
September 2010
- Late Registration (2nd call): After 20 September 2010
- Conference: Timisoara, Romania, 14 to 17 October 2010

* Conference Location
The conference will be held in Timisoara, Romania.

* Secretariat
IADIS Secretariat - IADIS INTERNATIONAL CONFERENCE WWW/INTERNET 2010
Rua Sao Sebastiao da Pedreira, 100, 3
1050-209 Lisbon, Portugal
E-mail: secretariat@...
Web site: http://www.internet-conf.org/

* Program Committee

Program Chair
Bebo White, Stanford University, USA

Conference Co-Chairs
Pedro Isaías, Universidade Aberta (Portuguese Open University), Portugal
Diana Andone, "Politehnica" University of Timisoara, Romania

Committee Members: *
* for committee list please refer to http://www.internet-conf.org/committees.asp

* Co-located events
Please also check the co-located events Applied Computing 2010
(http://www.computing-conf.org/) - 14-16 October 2010 and CELDA 2010
(http://www.celda-conf.org/) - 15-17 October 2010.

* Registered participants in the WWW/Internet conference may attend the Applied
Computing and CELDA conferences' sessions free of charge.

***************************************************
26th ACM Symposium On Applied Computing
March 21-25, 2011
TaiChung, Taiwan
***************************************************

[Apologies for possible multiple copies]


For the past twenty-five years, the ACM Symposium on Applied Computing
has been a primary gathering forum for applied computer scientists,
computer engineers, software engineers, and application developers from
around the world. SAC 2011 is sponsored by the ACM Special Interest
Group on Applied Computing (SIGAPP), and is hosted by Tunghai
University, Taichung, Taiwan.

The Evolutionary Computation (EC) track welcomes original, unpublished
papers describing advances in and applications of evolutionary
computation and related techniques, including genetic algorithms,
evolution strategies, evolutionary programming, memetic algorithms,
genetic programming, ant colony optimization, co-evolutionary
algorithms, artificial immune systems, particle swarm optimization, and
classifier systems. All accepted papers will appear in the SAC 2011
Proceedings. Selected papers, not accepted as full papers, will be
accepted as poster papers. These will be presented at a poster session
during the Symposium and will be published as two-page extended
abstracts in the Proceedings.
Peer groups with expertise in the track focus area will blindly review
submissions to that track. Accepted papers will be published in the
annual conference proceedings. Submission guidelines can be found on SAC
2011 Website (http://www.acm.org/conferences/sac/sac2011/)
A paper may be submitted to only one track of SAC 2011.

GUIDELINES FOR SUBMISSION
* Papers should represent original and previously unpublished works that
are currently not under review for any journal or other conference. Both
basic and applied research papers are welcome.
* Submissions will be in electronic format via this web site:
https://www.softconf.com/b/sac11-tp/
* Submission must follow ths template found at this URL:
http://www.acm.org/conferences/sac/sac2011/
* Authors are allowed up to eight (8) pages in the specified format, but
there is a charge of US$80 for each page over six (6).
* Authors' names and addresses must not appear in the body of the
submitted papers, and self-references should be in the third person.
This is to facilitate blind review.
* Begin the submission process by submitting your paper's abstract on
the conference web site at the URL above.
* All submitted papers must include the paper identification number
(assigned when the abstract is submitted) on the front page above the
title of the paper.
* No author's name may appear on more than two papers accepted to the EC
track.

Note also the guidelines in the general SAC 2011 Call for Papers
(http://www.acm.org/conferences/sac/sac2011/SAC2011-CFP.pdf).

IMPORTANT DATES (all deadlines will be strictly enforced)
Aug 24, 2010: Paper Submission
Sept 21, 2010: Tutorial Proposals
Oct 12, 2010: Author Notification
Nov 2, 2010: Camera-ready copies

For additional information, visit the SAC 2011 EC Track web page
(www.upo.es/eps/SAC/cfpSAC2011EC.html) and the general  SAC 2011 web page
(http://www.acm.org/conferences/sac/sac2011/).

TRACK CHAIRS
Federico Divina, Raúl Giráldez Rojo
School of Engineering
Pablo de Olavide University
Seville, Spain
{fdivina,giraldez} AT upo DOT es
Phone: +34 954 977592
Fax: +34 9543 48689

[Please reply DIRECTLY TO ME (sean@...) rather than spamming
the list!]
[also please feel free to distribute this to other people to whom you
think this message might be appropriate]

Hi everybody.  I truly apologize if you get multiple copies of this
message.

I am working on a grant proposal to support further development,
improvement, and significant expansion of the ECJ toolkit.  My goal is
to move ECJ towards a general-purpose, industrial-grade metaheuristics
toolkit.  As part of this proposal I need to gather evidence of ECJ's
historical use over the last ten years, and particularly its current
use.  Here are examples of evidence (there could be lots more):

	 - Use of ECJ in published or unpublished research
	 - Use of ECJ in education
	 - Use of ECJ in dissertations and theses of all kinds
	 - Use of ECJ in commercial work
	 - In-house use of ECJ of any kind
	 - Extensions to ECJ available online
	 - Tutorials or manuals about ECJ (other than my own)

For publications and theses etc. it'd be particularly helpful if you
provided me with BibTeX entries (but not required -- I'll do the
legwork).

Also I'd appreciate some pull quotes I could use describing any of the
following:

	 - How you use the system
	 - Your opinion of the system
	 - How you view the system situated in the EC community
	 - How well we have provided support over the last ten years

Last, I'd like some opinions on directions we should take in extending
ECJ.  Here are some I have in mind.  Which matter most to you?  What
am I missing that you'd really like to see?

	 - Better internal software testing (unit tests, etc.)
	 - Better reporting and parameter sweeping
	 - A usable GUI
	 - Simplification
	 - Frameworks for easier parallel computing
	 - More and better representations (Note: grammatical evolution, PUSH,
and maybe NEAT are on their way)
	 - More and better multiobjective optimization support (note: NSGA-II
is on the way).
	 - Ant colony optimization, GRASP, and other combinatorial methods
	 - Optimization with hard constraints
	 - Good single-state optimization support (hill-climbing, simulated
annealing, tabu search, ILS)
	 - Good memetic / hybrid algorithm support
	 - Diversity maintenance methods
	 - Heavily revised support for DE and PSO

	 - What else would you really like to see?

Which SPECIFIC algorithms and/or representations would you like to see

Thank you in advance for any help you can provide along these lines!
Anything is helpful.

Sean Luke
George Mason University
sean@...

*** Apologies for multiple posting ***



Last news: Extended versions of selected contributions from this workshop will
be considered for publication in a Special Issue of the Soft Computing Journal,
Springer.



Let me kindly inform you that the paper submission deadline for PABA 2010
(Parallel Architectures and Bioinspired Algorithms) has been extended to July
25th, which is rapidly approaching in case you are interested in submitting a
paper. Please find additional details below.



Workshop: Parallel Architectures and Bioinspired Algorithms (PABA-2010)

Dates: 11-12 September 2010

Venue: Vienna, Austria

Websites: http://bioinspired.dacya.ucm.es,
http://www.pactconf.org/workshops.html



Extended Paper Submission Deadline: 25 July 2010 (Hard Deadline)

Submit a paper here: http://www.easychair.org/conferences/?conf=wpaba2010



The topics of interest to this conference include but are not limited to the
following:



- Evolutionary Algorithms for Parallel Computer Architectures optimization.

- Computer Architecture optimizations using other biologically inspired
algorithms: Ant Colonies, Immune Systems, Artificial Life, Cultural Algorithms,
etc...

- Cluster and Grid Deployment of Bioinspired Algorithms.

- Desktop Grids infrastructures for supporting Bioinspired Algorithms.

- Large Scale Parallel Processing.

- Heterogeneous Computing Platforms for Bioinspired Algorithms.

- Improvement on scheduling techniques by means of Bioinspired Algorithms.

- Fault tolerant implementations of PEAs.

- Performance evaluation of PEAs.

- Improvement in system performance through optimization and tuning.

- Parallel Reconfigurable Architectures for Bioinspired Algorithms.

- Graphics processing units and Evolutionary Algorithms.

- Profiting from Cloud infrastructure when running Bioinspired Algorithms.



We are looking forward to meeting you at PABA-2010!

Morning (my local time) everyone,

I'm planning on getting (slowly, my problem) into GP. I expect to use
ECJ for my renewed simulations. My questions I expect to be directed
mostly to those folks. My first question that is probably specific to
GP has never occurred to me until yesterday evening. In a population
each individual is tested and a fitness generated. Does ECJ maintain the
fitness across generations? Has anyone used an implicit sliding fitness?

I have a few specific areas that I want to experiment with GPs in those
domains. A long time interest is the stock market. My understanding of the
Koza scales of (0 .. 1) is that when 1 is found then a perfect solution
has been found. In each generation basing the Koza fitness on the best
results of that generation, not the best theoretical results, should still
work for finding the most fit individual of each generation. I don't
see that there is a requirement for the fitness values to be constant
(static) for the duration of the experiment.

It was my own self imposed assumption that I realized last night is false.

Mike

Mike, any further ECJ specific questions are probably best posted in
the ECJ-INTEREST mailing list.  But in quick answer to your two
questions:

On Jul 12, 2010, at 11:05 AM, Mike Eggleston wrote:
> I'm planning on getting (slowly, my problem) into GP. I expect to use
> ECJ for my renewed simulations. My questions I expect to be directed
> mostly to those folks. My first question that is probably specific to
> GP has never occurred to me until yesterday evening. In a population
> each individual is tested and a fitness generated. Does ECJ maintain
> the
> fitness across generations? Has anyone used an implicit sliding
> fitness?
>
When you evaluate an individual and set its Fitness, you have the
option (usually normally you do this) of setting the Individual's
'evaluated' flag.  This tells evolutionary algorithms that you believe
the Fitness to be finished and the Individual needn't be reevaluated.
Normally as a result the Individual is moved to the next generation,
or a perfect clone is made of it, etc. the Individual won't get
reevaluated.  But an algorithm is free to ignore this flag and
reevaluate the Individual (recomputing it Fitness) and you are free
not to set this flag, forcing recomputation each generation.

There's a fair bit of previous literature on Fitnesses which change
over time.  You might look for two terms which do it in different ways:

	 - Dynamic [Fitness] Landscapes
	 - Injection Island Models

Sean

===============================================================
Call for Papers

The 4th International Workshop on Mining Multiple Information Sources (MMIS)
http://www.cse.fau.edu/~xqzhu/mmis/mmis-10/mmis10.html
--------------------------------------------------------------------------------\
---

The aim of the fourth MMIS workshop is to bring together data mining experts to
advance research on pattern discovery from multiple information sources, and
identify current needs for such purposes. Representative issues to be addressed
include but are not limited to:

Machine learning in multiple source environments
Multiple information source data mining applications and case studies
Harnessing complex data relationship
Integrative and cooperative mining
Multiple information source differentiation and correlation
Stream data mining algorithms

-----------------------------------------------------------------------
Special Issue Publication

Selected workshop papers will be invited for journal publication in the
Neurocomputing, Special Issue on Data Mining Applications and Case Study

************************************************************************

Important Dates
July 23, 2010 : Submission Due Date
September 20, 2010: Notification of paper acceptance to authors
October 11, 2010: Camera-ready of accepted papers
December 13, 2010: Workshop in Sydney, Australia


************************************************************************
Workshop Co-Chairs

Ruoming Jin
Kent State University, USA

Xingquan Zhu
University of Technology, Sydney, Australia

Haixun Wang
Microsoft Research Asia, China

Zoran Obradovic
Temple University, USA

The 5th Int'l ICST Conference on Bio-Inspired Models of Network, Information and
Computing Systems (http://www.bionetics.org/)

December 1 - 3, 2010
Boston, MA, USA

Technical cooperation with Create-Net, ACM SIGSIM and Springer

BIONETICS 2010 aims to provide a world-leading and unique opportunity for
bringing together researchers and practitioners from diverse disciplines that
seek the understanding of the fundamental principles and design strategies in
biological systems and leverage those understandings to build bio-inspired
systems. We are soliciting high-quality original papers in the following topics
(but not limited to):

* Signal/information processing and communication models in biological systems
* Bio-inspired formal models and methods
* Bio-inspired algorithms and mechanisms
* Bio-inspired software and hardware systems
* Biomimetics, bioenginereing and synthetic biological systems
* Modeling and simulation of bio-inspired systems, biological systems and
synthetic biological systems
* Self-* properties in bio-inspired systems, biological systems and synthetic
biological systems
* Design and performance issues in bio-inspired systems and synthetic biological
systems
* Tools, testbeds and deployment aspects in bio-inspired systems and synthetic
biological systems
* Real-world applications and standardization of bio-inspired systems and
synthetic biological systems
* Socially-aware, game theoretic and other metaphor-driven interdisciplinary
approaches to bio-inspired systems and synthetic biological systems

Application domains include, but not limited to, autonomic computing,
bioinformatics, biological engineering, computer networks, computer vision, data
mining, green computing and networking, grid/cloud computing, intelligent
agents, mechanical engineering, molecular communication, nano-scale computing
and networking, optimization, pervasive computing, robotics, security, software
engineering, and systems engineering.

Paper Submission:

Authors are invited to submit papers in the following categories:

   * Regular papers: Up to 15 pages
   * Short papers: Up to 2 pages
   * Work-in-progress (WIP) papers: Up to 6 pages
   * Demo papers: Up to 4 pages

Papers must follow the Springer LNICST format. Please visit
http://www.bionetics.org/submission.shtml for detailed submission instructions.

Important Dates:

    Regular paper submission due: July 30
    Short, WIP and demo paper submission due: September 19
    Notification of acceptance for regular papers: September 12
    Notification of acceptance for short, WIP and demo papers: September 30
    Camera ready due: October 10

Publication:

All accepted paper will be published by Springer. A selected number of best
papers will be considered for publication in leading journals such as:

    * ACM Trans. on Autonomous and Adaptive Systems (http://taas.acm.org/),
    * Int'l Journal of Autonomous and Adaptive Communications Systems
(http://www.inderscience.com/browse/index.php?journalCODE=ijaacs),
    * Elsevier Nano Communication Networks Journal 
(http://www.elsevier.com/locate/nanocomnet),
    * Int'l Journal of Software Engineering and Knowledge Engineering
(http://www.worldscinet.com/ijseke/ijseke.shtml),
    * Journal of Ambient Intelligence and Humanized Computing
(http://www.springer.com/engineering/journal/12652), and
    * Journal of Bioinformatics and Computational Biology
(http://www.worldscinet.com/jbcb/).

Keynote Speakers:

    * Radhika Nagpal (Harvard University)
    * Cheng Li (Harvard School of Public Health and Dana-Farber Cancer Institute)
    * Ian F. Akyildiz (Georgia Institute of Technology)
    * Karl Lieberherr (Northeastern University)
    * Thilo Gross (Max Planck Institute for the Physics of Complex Systems)

Special Tracks (http://www.bionetics.org/sp/):

    * Artificial Intelligence and Software Engineering
    * Artificial Life and Bio-inspired Robotics
    * Biologically-inspired Communications for Nanonetworks
    * Bioinformatics
    * Bio-Inspired Machine Vision
    * Game Theory and its Applications
    * Network based computation
    * State-Topology Coevolution in Adaptive Networks

General Chair:

    Junichi Suzuki, University of Massachusetts, Boston, USA

PC Chair:

    Tadashi Nakano, Osaka University, Japan

Steering Committee:

    Tatsuya Suda, chair, University of California, Irvine, USA
    Iacopo Carreras, Create-Net, Italy
    Imrich Chlamtac, Create-Net and University of Trento, Italy
    Falko Dressler, University of Erlangen, Germany

PC Vice Chairs:

    Ozgur Akan, Middle East Technical University, Turkey
    Eduard Alarcón, Universitat Politècnica de Catalunya, Spain
    Albert Cabellos-Aparicio, Universitat Politècnica de Catalunya, Spain
    Tyler Garaas, Mitsubishi Electric Research Laboratories, USA
    Thilo Gross, Max Planck Institute for the Physics of Complex Systems, Germany
    Nurit Haspel, University of Massachusetts, Boston, USA
    Shih-Hsi "Alex" Liu, California State University, Fresno, USA
    Jian-Qin Liu, National Institute of Information and Communications
Technology, Japan
    Marjan Mernik, University of Maribor, Slovenia
    Hiroyuki Ohsaki, Osaka University, Japan
    Marc Pomplun, University of Massachusetts, Boston, USA
    Hiroki Sayama, Binghamton University, State University of New York, USA
    Amarda Shehu, George Mason University, USA
    Hideaki Suzuki, National Institute of Information and Communications
Technology, Japan
    Athanasios Vasilakos, University of Western Macedonia, Greece

Workshop Chair:

    Marc Pomplun, University of Massachusetts, Boston, USA

Publication Chair:

    Foad Dabiri, University of California, Los Angels, USA

Publicity Chairs:

    Pruet Boonma, Chiang Mai University, Thailand
    Michael Moore, University of California, Irvine, USA

Local Arrangement Chair:

    Tyler Garaas, Mitsubishi Electric Research Laboratories, USA

Web Chair:

    Chonho Lee, University of Massachusetts, Boston, USA

Conference Coordinator:

    Gabriella Magyar, ICST