Evolutionary Computation Digest Monday, August 2, 2010 Volume 24: Issue 8
SUBMISSION ADDRESS: [log in to unmask]
LIST INFORMATION: http://ec-digest.research.ucf.edu/
OLD LIST ARCHIVE: http://www.aic.nrl.navy.mil/galist/
NEW LIST ARCHIVE: http://listserv.gmu.edu/cgi-bin/wa?A0=EC-DIGEST-L
(UN)SUBSCRIPTION INSTRUCTIONS: at the bottom of this email
--------------------------------
Today's Topics:
CFPs
----
- Call for Abstracts for the Third International Workshop on Guided Self-Org...
- CFP:International Journal of Applied Metaheuristic Computing
- Extended Deadline: Special Issue on Heuristic Search Methods for Large Sca...
- 3rd CFP EC track - ACM SAC 2011
--------------------------------
CALENDAR OF GA-RELATED ACTIVITIES: (with EC-Digest issue reference)
PRICAI'10,11th Pacific Rim Intl Conf on AI, Daegu, Korea, Aug30-Sept2 '10(v24n7)
ICES'10,9th Intl Conference on Evolvable Systems, York, UK, Sep 5-8, 2010(v24n2)
ANTS10,7th Intl Conf on Swarm Intelligence, Brussels, Belgium,Sep8-10 '10(v23n9)
PPSN'10,11th Intl Conf on Parallel Problem ..., Krakow, Poland, Sep 11-15(v23n9)
PABA'10,3rd WKSP on Parallel Arch. and Bio...,Vienna, Austria,Sep11-15'10(v24n6)
AIAI 2010,6th IFIP Conf on AI Applicatio..., Ayia Napa, Cyprus, Oct5-7'10(v24n7)
META'10,Intl. Conf. on Meta. and Nature ..., Djerba, Tunisia,Oct28-30'10 (v24n5)
BIONETICS'10,5th Intl ICST Conf on Bio-Inspi...,Boston, MA, USA,Dec1-3'10(v24n6)
NaBIC'10,2nd World Congress on Nature ..., Kitakyushu, Japan,Dec 15-17'10(v24n6)
SEMCCO'10,Intl Conf on Swarm, Evolut..., Chennai, India, Dec. 16-18, 2010(v24n6)
FOGA'11,Foundations of Gen. Alg. XI, Schwarzenberg, Austria, Jan 5-9 2011(v24n3)
ACM-SAC11,26th ACM Symp Applied Comp EC Track,TaiChung Taiwan,Mar21-25'11(v24n7)
IEEE SDE'11,IEEE Symp on Differential Evolution,Paris, France,Apr11-15'11(v24n6)
ICANNGA'11,Intl Conf. on Adaptive and ...,Ljubljana, Slovenia,Apr14-16'11(v24n6)
GECCO'11,Genetic and Evol Comp Conference, Dublin, Ireland,July 12-16 '11(v24n7)
--------------------------------
Sender: Larry Yaeger <[log in to unmask]>
Subject: Call for Abstracts for the Third International Workshop on Guided
Self-Organisation
The Third International Workshop on Guided Self-Organization (GSO-2010)
http://informatics.indiana.edu/larryy/gso3/
4-6 September 2010
Indiana University
Bloomington, Indiana, USA
Sponsors: School of Informatics and Computing
Center for Complex Networks and Systems Research
Research Aims and Topics:
The GSO-2010 workshop will bring together invited experts and researchers in
self-organizing systems, with particular emphasis on the information- and graph-
theoretic foundations of GSO and information dynamics in cognitive systems.
The GSO-2010 workshop is third in the GSO series. The First International
Workshop on Guided Self-Organisation (GSO-2008
<http://www.prokopenko.net/gso.html>) was held 24-27 November 2008 in Sydney,
Australia. It was followed by The Second International Workshop on Guided
Self-Organisation (GSO-2009
<http://www.mis.mpg.de/calendar/conferences/2009/gs09.html>) on August 18-20,
2009 in Leipzig, Germany.
The goal of GSO is to leverage the strengths of self-organization while still
being able to direct the outcome of the self-organizing process. In its most
general form, GSO combines task-independent objectives (universal utility
functions) with task-specific constraints. One may consider different ways to
guide the process (dynamics) of self-organization, achieving a specific
increase in structure or function within a system. This guidance may be provided
by limiting the scope or extent of the self-organizing structures/functions,
specifying the rate of the internal dynamics, or simply selecting a subset of
all possible trajectories that the dynamics may take.
There have been a few recent attempts at formalizing aspects of GSO,
specifically within information theory and dynamical systems: empowerment,
information-driven evolution, robust overdesign, reinforcement-driven
homeokinesis, predictive information-based homeokinesis, interactive learning,
etc. What is common to many examples of GSO is the characterization of a
system-environment loop (e.g., sensorimotor or perception-action loop) in
information-theoretic terms. For instance, given an agent's behavior, the
empowerment measures the amount of Shannon information that the agent can
"inject into" its sensors through the environment, affecting future actions and
future perceptions. On the other hand, maximization of the predictive
information or excess entropy during a time interval enables an
adaptive/evolutionary change in controllers' logic in such a way that the system
becomes coordinated. Furthermore, methods relying on the use of predictive
information in a sensorimotor process may produce explicit learning rules for
the agent optimizing its behavior.
However, the lack of a common mathematical framework across multiple scales and
contexts leaves GSO methodology somehow vague, indicating a clear gap. Filling
this gap and identifying common principles of guidance are the main themes of
GSO workshops.
Program:
The program includes 3 days of presentations, each day with two or three keynote
talks (1 hour each), and 5-7 scheduled presentations (30 minutes each).
The following topics are of special interest: information-theoretic measures of
complexity, graph-theoretic metrics of networks, information-driven
self-organization (IDSO), applications of GSO to systems biology, computational
neuroscience, cooperative and modular robotics, sensor networks.
Submissions to the workshop are extended abstracts (one page). Authors of
accepted submissions will present the content to the workshop. It is expected
that post-workshop publication of selected papers will follow in a special
journal issue (as has been the case for previous GSO workshops). Selected papers
of GSO-2008 were published by the Human Frontier Science Program (HFSP) Journal,
in the Special Issue on Guided Self-Organization
<http://scitation.aip.org/dbt/dbt.jsp?KEY=HJFOA5&Volume=3&Issue=5> (full text
papers online at <http://www.ncbi.nlm.nih.gov/pmc/issues/183859/>). A special
issue <http://www.prokopenko.net/special-issue-gso-2009.html> of Theory in
Biosciences is under review with selected papers from GSO-2009.
Invited speakers (confirmed):
* Nihat Ay (MPI, Germany)
* John Beggs (Indiana University, USA)
* Josh Bongard (University of Vermont, USA)
* James Crutchfield (University of California, Davis, USA)
* Ralf Der (MPI, Germany)
* Daniel Polani (University of Hertfordshire, UK)
* Mikhail Prokopenko (CSIRO, Australia)
* Olaf Sporns (Indiana University, USA)
* (Additional speakers to be announced)
Participation:
If you are interested in presenting, please email a one-page extended abstract
to the conference organizers. If you are interested in attending, please send a
short email to the conference organizers announcing your intentions (so we can
adjust catering plans for coffee breaks and such). Following the workshop, a
formal call for papers will be issued for a special journal issue. The workshop
is free and open to all interested researchers, though for practical
considerations the total number of presenters will be limited to 21, and the
total number of attendees will be limited to 40.
Venue:
Indiana University
Bloomington, Indiana, USA
Program Committee:
Larry Yaeger, Indiana University, USA (Chair)
Nihat Ay, MPI, Germany
John Beggs, Indiana University, USA
Ralf Der, MPI, Germany
Keith Downing, NTNU, Norway
Carlos Gershenson, UNAM, Mexico
Joseph Lizier, University of Sydney, Australia
Stefano Nolfi, ISTC-CNR, Italy
Oliver Obst, CSIRO, Australia
Daniel Polani, University of Hertfordshire, UK
Mikhail Prokopenko, CSIRO, Australia
Ivan Tanev, Doshisha University, Japan
--------------------------------
Sender: pyyin <[log in to unmask]>
Subject: CFP:International Journal of Applied Metaheuristic Computing
We like to draw your attention to the release of the inaugural issue of
”International Journal of Applied Metaheuristic Computing”
http://www.igi-global.com/Bookstore/TitleDetails.aspx?TitleId=1139&DetailsType=FreeSampleCopy
You are courteously invited to submit your research articles to this journal.
Please find below the articles from the first issue.
********************************************************************************
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary
Optimization – Part I : Exploiting Proximity
Fred Glover, Saïd Hanafi
A New Multiagent Algorithm for Dynamic Continuous Optimization
Julien Lepagnot, Amir Nakib, Hamouche Oulhadj and Patrick Siarry
A Reinforcement Learning – Great-Deluge Hyper-heuristic for Examination
Timetabling
Ender Özcan, Mustafa Mısır, Gabriela Ochoa, Edmund K. Burke
A Survey on Evolutionary Instance Selection and Generation
Joaquín Derrac, Salvador García and Francisco Herrera
Theorems Supporting r-flip Search for Pseudo-Boolean Optimization
Bahram Alidaee, Gary Kochenberger, Haibo Wang
A Sociopsychological Perspective on Collective Intelligence in Metaheuristic
Computing
Yingxu Wang
********************************************************************************
All inquiries and submissions should be directed to the attention of:
Peng-Yeng Yin
Editor-in-Chief
International Journal of Applied Metaheuristic Computing
E-mail: [log in to unmask]
www.igi-global.com/ijamc
--------------------------------
Sender: Frank Neumann <[log in to unmask]>
Subject: Extended Deadline: Special Issue on Heuristic Search Methods for Large
Scale Optimization Problems in Industry, Evolutionary Computation
Journal
Special Issue on
Heuristic Search Methods for Large Scale Optimization Problems in Industry
Evolutionary Computation Journal, MIT Press
http://ecj.lri.fr/
EXTENDED DEADLINE: August 31, 2010.
Guest Editors:
Andreas Ernst, CSIRO Mathematical and Information Science,
[log in to unmask]
Zbigniew Michalewicz, University of Adelaide,
[log in to unmask]
Frank Neumann, Max Planck Institute for Informatics, [log in to unmask]
Description:
This special issue aims to provide a forum for researchers working on large
applied optimization problems arising in industry. Such problems often defy
solution by exact approaches such as integer and constraint programming.
Particular challenges of large applied problems include the presence of complex
objectives containing a mixture of real costs and soft constraints which can be
time consuming to evaluate. In addition the search space of problems is often so
large that traversing it with neighbourhood-move, crossover or mutation
operators can take too long to allow effective exploration. This special issue
solicits novel high-quality contributions on heuristic methods for large applied
optimization problems that have been used in practice. While papers on any
aspect of solving large scale optimization problems in industry are welcome, of
special interest are submissions on:
-Scheduling/planning problems solved for particular organizations
-Novel methods for exploring very large search spaces
-Decomposition and parallel computing techniques for solving large optimization
problems
-Hybrid heuristics for real world optimization problems
-Methods for dealing with large data sets in formulating and solving large
optimization problems, including issues around data consistency and
completeness.
-Case studies of successful (or unsuccessful) implementations of large scale
heuristic optimization algorithms in a business and lessons learned from these.
Authors are encouraged to make available (de-identified) versions of some of
their real world data sets to support the development of more sophisticated
methods to deal with some of these challenging problems.
This special issue will not consider the solution of large abstract problems
(eg classical VRP or job shop scheduling problems) nor papers that only test
algorithms on randomly generated data sets. Authors are invited to submit
original work on topics relevant for this special issue. The publication of the
special issue is tentatively scheduled for Summer 2011.
Submission:
Authors should submit their manuscripts to the Evolutionary Computation
Editorial Manager at http://ecj.lri.fr/.
When submitting a paper, please send at the same time also an email to
Frank Neumann ([log in to unmask]) and a copy to [log in to unmask] mentioning the
special issue, the paper title, and author list to inform about the submission.
--------------------------------
Sender: Federico Divina <[log in to unmask]>
Subject: 3rd CFP EC track - ACM SAC 2011
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
--------------------------------
(UN)SUBSCRIPTION INSTRUCTIONS:
- Send submissions (articles) to [log in to unmask]
DO NOT send submissions to the [log in to unmask] address.
- To subscribe send email to [log in to unmask] containing the
following text in the body of the message:
subscribe ec-digest-l <Your Name (up to 4 words)>
- To unsubscribe send email to [log in to unmask] containing the
following text in the body of the message:
unsubscribe ec-digest-l
- To change your email address, simply unsubscribe the old address
and subscribe the new one.
- Send other administrative requests to [log in to unmask]
- For further information about the digest, see
http://ec-digest.research.ucf.edu
--------------------------------
End of Evolutionary Computation Digest
********************************
|
