[DMANET] Deadline Extension: ICN 2013 || January 27 - February 1, 2013 - Seville, Spain

INVITATION:

=================

Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and
publish original scientific results to ICN 2013.

The submission deadline has been extended to September 22, 2012.

Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org

=================


============== ICN 2013 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICN 2013, The Twelfth International Conference on Networks
January 27 - February 1, 2013 - Seville, Spain


General page: http://www.iaria.org/conferences2013/ICN13.html

Call for Papers: http://www.iaria.org/conferences2013/CfPICN13.html

- regular papers

- short papers (work in progress)

- posters

Submission page: http://www.iaria.org/conferences2013/SubmitICN13.html


Submission deadline: September 22, 2012

Sponsored by IARIA, www.iaria.org


Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html

Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org


Please note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research,
standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to
submit complete unpublished papers, which are not under review in any other conference or journal in the
following, but not limited to, topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in
progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html


ICN 2013 Topics (topics and submission details: see CfP on the site)


1. Communication theory

2. Communications switching and routing

3. Communications modeling

4. Communications security

5. Computer communications

6. Distributed communications

7. Signal processing in communications

8. Multimedia and multicast communications

9. Wireless communications (satellite, WLL, 4G, Ad Hoc, sensor networks)

10. Next generation networks [NGN] principles

11. Storage area networks [SAN]

12. Access and home networks

13. High-speed networks

14. Optical networks

15. Peer-to-peer and overlay networking

16. Mobile networking and systems

17. MPLS-VPN, IPSec-VPN networks

18. GRID networks

19. Broadband networks

20. Quality of service, service level agreement [QoS/SLA]

21. Reliability, availability, serviceabiliy [RAS]

22. Traffic engineering, metering, monitoring

23. Voice over IP services

24. Performance evaluation, tools, simulation

25. Network, control and service architectures

26. Network signalling, pricing and billing

27. Network middleware

28. Telecommunication networks architectures

29. On-demand networks, utility computing architectures

30. Applications and case studies

31. NGN protocol design and evaluation

32. NGN Standard Activities [ITU, TMF, 3GPP, IETF, etc.]

33. NGN Device Instrumentation

34. Network Management, scheduling and policy

35. NGN policy-based control

36. Networks policy-based management

37. Management of autonomic networks and systems

38. Vehicular Networks

----------------------
Committee: http://www.iaria.org/conferences2013/ComICN13.html
================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] TPNC 2012: call for participation

1st INTERNATIONAL CONFERENCE ON THE
THEORY AND PRACTICE OF NATURAL COMPUTING

TPNC 2012

Tarragona, Spain

October 2-4, 2012

http://grammars.grlmc.com/tpnc2012/

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

PROGRAMME

Tuesday, October 2

8:30 - 9:00 Registration

9:00 - 9:15 Opening

9:15 - 10:15 Ponnuthurai N. Suganthan: Differential Evolution: Recent Advances - Invited Talk

10:15 - 10:45 Coffee Break

10:45 - 11:45

Michelangelo Cianciulli, Rocco Zaccagnino, Rosalba Zizza: An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words

Daniela Genova, Kalpana Mahalingam: Generating DNA Code Words Using Forbidding and Enforcing Systems

11:45 - 12:00 Break

12:00 - 13:00 Max H. Garzon: Theory and Applications of DNA Codeword Design - Invited Talk

13:00 - 14:45 Lunch

14:45 - 15:45

Poster session

Fatiha Djahafi: Matching XML Documents by the Similarity Measure Based WordNet

Shin Watanabe, Atsuko Takamatsu, Yasuhiro Hayashi: Design of Electric Power Distribution Networks Using a Biologically Inspired Algorithm

Vladimir Shpilrain, Dima Grigoriev: Nature-Based Cryptography

Alexander Spirov, David Holloway: Using Evolutionary Computations to Understand the Evolutionary Design of Gene Regulatory Networks

Ilja Kucevalovs, Ojars Krasts, Rusins Freivalds, Thomas Zeugmann: Influence of Technology on Learning Processes

Kaspars Balodis, Karlis Jerins, Rusins Freivalds, Agnis Skuskovniks, Ilja Kucevalovs: Weak Computation by Frequency Finite-State Transducers

15:45 - 16:00 Break

16:00 - 17:10

Poster session

Chu Qin, Xiao Hua Ma, Zhe Shi, Yu Zong Chen: Evaluation of the Hit and Target Selectivity Performance of Machine Learning Multi-Target Virtual Screening Models

Lin Tao, Feng Zhu, Yuzong Chen: Genome-Wide Protein-Protein Interactions Prediction from Amino Acid Sequence Using Support Vector Machines

Mauricio Guevara-Souza, Edgar Vallejo: Accelerating Simulations of Population Replacement Using Multicore Technologies

Adam Kozaný: Influence of Forbidding a Rule Type on the Development of PM Colony

David Iclanzan, Camelia Chira: Evolving Complex Cellular Automata Rules

David Iclanzan, D. Dumitrescu: Multiobjective Evolution of Mixed Nash Equilibria

Alina Vasilieva, Elena Shishova: Quantum Query Algorithms for Computing Multivalued Functions

17:10 - 17:25 Break

17:25 - 18:25 Faustino Gómez: Scalable Neuroevolution for Reinforcement Learning - Invited Talk

Wednesday, October 3

9:00 - 11:00 Christian Blum: Hybrid Metaheuristics - Invited Tutorial

11:00 - 11:30 Coffee Break

11:30 - 13:00

Petr Sosik, Ludek Cienciala: Tissue P Systems with Cell Separation: Upper Bound by PSPACE

Tibor Kmet, Maria Kmetova: Neural Netwoks Solving Free Final Time Optimal

Darko Stefanovic: Maze Exploration with Molecular-Scale Walkers

13:00 - 14:45 Lunch

14:45 - 16:45

Sergio Santander-Jiménez, Miguel A. Vega-Rodríguez, Juan A. Gómez-Pulido, Juan M. Sánchez-Pérez: Comparing Different Operators and Models to Improve a Multiobjective Artificial Bee Colony Algorithm for Inferring Phylogenies

Víctor Berrocal-Plaza, Miguel A. Vega-Rodríguez, Juan M. Sánchez-Pérez, Juan A. Gómez-Pulido: A Multi-Objective Approach to Solve the Location Areas Problem

Ran Gelles, Tal Mor: On the Security of Interferometric Quantum Key Distribution

Michel Boyer, Ran Gelles, Tal Mor: Attacks on QKD with Fixed Apparatus

16:45 - 17:00 Break

17:00 - 18:00 Barbara M. Terhal: Fragility of Quantum Information and Quantum Error Correction - Invited Talk

Thursday, October 4

9:00 - 10:00 Peter Tiño: Computational Intelligence in Astronomy - Win-Win Situation - Invited Talk

10:00 - 10:30 Coffee Break

10:30 - 12:00

Mauricio Guevara and Edgar Vallejo: Wolbachia Infection Improves Genetic Algorithms as Optimization Procedure

Salimur Choudhury, Kai Salomaa, Selim G. Akl: Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks

María Botón-Fernández, Francisco Prieto, Miguel A. Vega-Rodríguez: Nature-inspired Algorithms Applied to an Efficient and Self-adaptive Resources Selection Model for Grid Applications

12:00 - 12:15 Break

12:15 - 13:15 Andrew Childs: Universal Computation by Multi-particle Quantum Walk - Invited Talk

13:15 Closing

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFC--NIPS Workshop on Social Choice: Theory and Practice

Workshop on Social Choice: Theory and Practice
------------------------------------------------------------------------
Held in conjunction with the Neural Information Processing Systems
(NIPS) Conference

Date: December 7th or 8th (TBA), 2012, Lake Tahoe, USA

Overview
------------
The workshop aims to bring together experts in social choice theory,
social sciences, psychology, mathematics, statistics, decision and
information theory, as well as computer scientists in order to create
a forum for discussing new and old challenges in social choice theory
and its applications.

Topics of interest for this workshop include, but are not limited to:
- social decision making mechanisms,
- voting protocols and vote aggregation,
- voting and voter influence over social networks,
- opinion dynamics analysis and modeling,
- statistical inference methods for voting systems,
- connections between voting systems and database systems.

Dates
------------
- Submission deadline: October 19, 2012
- Acceptance notification: November 11, 2012
- Workshop date: December 7th or 8th, 2012

More information about the workshop can be found at:
https://netfiles.uiuc.edu/touri1/www/nips/

List of Confirmed Speakers
-------------
Farzad Farnoud (Engineering), University of Illinois at Urbana-Champaign

Amy Langville (Mathematics/Social Science), College of Charlston

Jure Leskovec (Machine Learning/Social Networks), Stanford University

Andrea Montanari (Physics/Engineering/Social Networks), Stanford University

Michael Regenwetter (Psychology), University of Illinois at Urbana-Champaign

Devavrat Shah (Engineering/Social Networks), MIT


Organizers

------------
* Faramarz Fekri: Georgia Tech University
* Olgica Milenkovic: University of Illinois at Urbana-Champaign
* Behrouz Touri: University of Illinois at Urbana-Champaign

Submissions
------------
We invite submission of extended abstracts for 20 minute oral
presentations. The extended abstract should not exceed 4 pages and
must satisfy the formatting instructions described in the NIPS 2012
call for papers.

Style files are available at http://nips.cc/PaperInformation/StyleFiles.
Please note that the review process is not double blind, so that the
submitted manuscripts must contain contact information of the authors.
Contributions should be submitted to touri1@illinois.edu not later
than 23:59 EST on
Friday, October 19, 2012
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] STACS 2013 - Call for Papers

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

STACS 2013 CALL FOR PAPERS (3rd call)

30th International Symposium on Theoretical Aspects of Computer Science

February 27-March 2, 2013, Kiel, Germany

Submission Deadline: Sep 21, 2012

http://www.stacs2013.uni-kiel.de

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

SCOPE
*****
Authors are invited to submit papers presenting original and
unpublished research on theoretical aspects of computer
science. Typical areas include (but are not limited to):

* algorithms and data structures, including: parallel, distributed,
approximation, and randomized algorithms, computational geometry,
cryptography, algorithmic learning theory, analysis of algorithms;
* automata and formal languages, games;
* computational complexity, randomness in computation;
* logic in computer science, including: semantics, specification and
verification, rewriting and deduction;
* current challenges, for example: natural computing, quantum
computing, mobile and net computing.

PROGRAM COMMITTEE
*****************
- Eric Allender, Rutgers U.
- Pablo Barceló, U. de Chile
- Frédérique Bassino, U. Paris 13
- Artur Czumaj, U. of Warwick
- Hervé Fournier, U. Paris Diderot
- Edward A. Hirsch, Steklov Institute, St. Petersburg
- Iordanis Kerenidis, U. Paris Diderot
- Michal Koucký, Czech Academy of Sciences
- Dieter Kratsch, U. de Lorraine
- Andrei Krokhin, Durham U.
- Antonín Kučera, Masaryk U.
- Markus Lohrey, U. of Leipzig
- Katarzyna Paluch, U. of Wroclaw
- Natacha Portier, ENS Lyon, co-chair
- Kirk Pruhs, U. of Pittsburgh
- Peter Rossmanith, RWTH Aachen
- Günter Rote, Freie Universität Berlin
- Thomas Sauerwald, MPI Saarbrücken
- Sandeep Sen, IIT Delhi
- Subhash Suri, UC Santa Barbara
- Jacobo Toran, Ulm U.
- Jouko Väänänen, U. of Helsinki and U. of Amsterdam
- Thomas Wilke, Kiel U., co-chair
- Carsten Witt, Technical U. of Denmark
- Gerhard J. Woeginger, TU Eindhoven
- Marc Zeitoun, U. Bordeaux 1

INVITED SPEAKERS
****************
- Kousha Etessami, University of Edinburgh
- Kurt Mehlhorn, MPI Saarbrücken and Saarland University
- Stéphan Thomassé, Ecole Normale Supérieure de Lyon

TUTORIAL
********
Dániel Marx, MTA SZTAKI, Hungarian Academy of Sciences:
Algorithmic Graph Structure Theory

SUBMISSIONS
***********
Authors are invited to submit a draft of a full paper with at most 12
pages (including references). The usage of pdflatex and the LIPIcs
style file (see below) are mandatory; no changes to font size, page
geometry etc. are permitted.

The paper should contain a succinct statement of the issues and of
their motivation, a summary of the main results, and a brief
explanation of their significance, accessible to non-specialist
readers. Proofs omitted due to space constraints must be put into an
appendix to be read by the program committee members at their
discretion.

Simultaneous submission to other conferences with published
proceedings is not allowed.

The submission site, which opened on June 1, 2012, is
http://www.easychair.org/conferences/?conf=stacs2013 .

PROCEEDINGS
***********
Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work.

In addition, the proceedings will also be available as archives in the
open access electronic repository HAL.

With their submission, authors consent to sign a license authorizing
the program committee chairs to organize the electronic publication of
their paper, provided the paper is accepted.

Further details are available on www.stacs-conf.org and on the
conference website, http://www.stacs2013.uni-kiel.de .

Each participant of the conference will receive a USB flash drive with
an electronic version of the proceedings. It is also planned to publish
selcted papers in a journal.

IMPORTANT DATES
***************
Submission deadline: Sep 21, 2012
website open through 23:59 UTC-12:00
Notification: Dec 7, 2012
Final version due: Jan 9, 2013
Symposium: Feb 27-Mar 2, 2013

LIPICS STYLE FILES
******************
LIPIcs homepage: http://www.dagstuhl.de/en/publications/lipics
tar ball: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz

CONTACT INFORMATION
*******************
info@stacs2013.uni-kiel.de (for general information)
pc-chairs@stacs2013.uni-kiel.de (for information regarding paper submission)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CALCO 2013: First Call for Papers

[Apologies for multiple copies]

=========================================================================

FIRST CALL FOR PAPERS: CALCO 2013

5th International Conference on Algebra and Coalgebra in Computer Science

September 3 - 6, 2013

Warsaw, Poland

http://coalg.org/calco13/

=========================================================================

Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013

=========================================================================

-- SCOPE --

CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science.

It is a high-level, bi-annual conference formed by joining the
forces and reputations of CMCS (the International Workshop on
Coalgebraic Methods in Computer Science), and WADT (the Workshop on
Algebraic Development Techniques). Previous CALCO editions took place
in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009)
and Winchester (UK, 2011). The fifth edition will be held in Warsaw,
the capital of Poland.

-- INVITED SPEAKERS --

N.N.

-- TOPICS OF INTEREST --

We invite submissions of technical papers that report results of
theoretical work on the mathematics of algebras and coalgebras, the
way these results can support methods and techniques for software
development, as well as experience with the transfer of the resulting
technologies into industrial practice. We encourage submissions in
topics included or related to those listed below.

* Abstract models and logics
- Automata and languages
- Categorical semantics
- Modal logics
- Relational systems
- Graph transformation
- Term rewriting
- Adhesive categories

* Specialised models and calculi
- Hybrid, probabilistic, and timed systems
- Calculi and models of concurrent, distributed, mobile, and
context-aware computing
- General systems theory and computational models (chemical,
biological, etc.)

* Algebraic and coalgebraic semantics
- Abstract data types
- Inductive and coinductive methods
- Re-engineering techniques (program transformation)
- Semantics of conceptual modelling methods and techniques
- Semantics of programming languages

* System specification and verification
- Algebraic and coalgebraic specification
- Formal testing and quality assurance
- Validation and verification
- Generative programming and model-driven development
- Models, correctness and (re)configuration of
hardware/middleware/architectures,
- Process algebra

-- NEW TOPICS --

This edition of CALCO will feature two new topics, and submission of
papers on these topics is especially encouraged.

* Corecursion in Programming Languages
- Corecursion in logic / constraint / functional / answer set
programming
- Corecursive type inference
- Coinductive methods for proving program properties
- Implementing corecursion
- Applications

* Algebra and Coalgebra in quantum computing
- Categorical semantics for quantum computing
- Quantum calculi and programming languages
- Foundational structures for quantum computing
- Applications of quantum algebra

-- SUBMISSION GUIDELINES --

Prospective authors are invited to submit full papers in English
presenting original research. Submitted papers must be unpublished and
not submitted for publication elsewhere. Experience papers are
welcome, but they must clearly present general lessons learned that
would be of interest and benefit to a broad audience of both
researchers and practitioners. As with previous editions, the
proceedings will be published in the Springer LNCS series. Final
papers should be no more than 15 pages long in the format specified by
Springer (see http://www.springer.de/comp/lncs/authors.html). It is
recommended that submissions adhere to that format and
length. Submissions that are clearly too long may be rejected
immediately. Proofs omitted due to space limitations may be included
in a clearly marked appendix. Both an abstract and the full paper must
be submitted by their respective submission deadlines.

-- BEST PAPER AND BEST PRESENTATION AWARDS --

For the first time, this edition of CALCO will feature two kinds of
awards: a best paper award whose recipients will be selected by the PC
before the conference and a best presentation award, elected by the
participants.

-- IMPORTANT DATES --

Abstract submission: February 22, 2013
Paper submission: March 1, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013

-- PROGRAMME COMMITTEE --

Luca Aceto - Reykjavik University, Iceland
Jiri Adamek - TU Braunschweig, D
Lars Birkedal - IT University of Copenhagen, DK
Filippo Bonchi - CNRS, ENS-Lyon, F
Corina Cirstea - University of Southhampton, UK
Bob Coecke - University of Oxford, UK
Andrea Corradini - University of Pisa, I
Mai Gehrke - Université Paris Diderot - Paris 7, F
H. Peter Gumm - Philipps University Marburg, D
Gopal Gupta - University of Texas at Dallas, USA
Ichiro Hasuo - Tokyo University, Japan
Reiko Heckel - University of Leicester, UK (cochair)
Bart Jacobs - Radboud University Nijmegen, NL
Ekaterina Komendantskaya - University of Dundee, Scotland, UK
Barbara König - University of Duisburg-Essen, D
José Meseguer - University of Illinois, Urbana-Champaign, USA
Marino Miculan - University of Udine, I
Stefan Milius - TU Braunschweig, D (cochair)
Larry Moss - Indiana University, Bloomington, USA
Till Mossakowski - DFKI Lab Bremen and University of Bremen, D
Prakash Panangaden - McGill University, Montreal, Canada
Dirk Pattinson - Imperial College London, UK
Dusko Pavlovic - Royal Holloway, University of London, UK
Daniela Petrisan - University of Leicester, UK
John Power - University of Bath, UK
Jan Rutten - CWI Amsterdam and Radboud University Nijmegen, NL
Lutz Schröder - Friedrich-Alexander Universität Erlangen-Nürnberg, D
Monika Seisenberger - Swansea University, UK
Sam Staton - University of Cambridge, UK
Alexandra Silva - Radboud University Nijmegen and CWI Amsterdam, NL
Pawel Sobocinski - University of Southampton, UK
Yde Venema - University of Amsterdam, NL
Uwe Wolter - University of Bergen, NO

-- ORGANISING COMMITTEE --

Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)

-- LOCATION --

Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.

-- SATELLITE WORKSHOPS --

CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired
by Monika Seisenberger (Swansea University). The workshop is dedicated
to presentation of work in progress and original research
proposals. PhD students and young researchers are particularly
encouraged to contribute.

A workshop dedicated to tools based on algebraic and/or coalgebraic
principles, CALCO Tools, will be held alongside the main conference,
chaired by Lutz Schröder (Friedrich Alexander Universität
Erlangen-Nürnberg). Papers of this workshop will be included in the
CALCO proceedings.

-- FURTHER INFORMATION --

Queries related to submission, reviewing, and programme should be sent
to the relevant conference or workshop chairs.

Queries related to the organisation should be emailed to
calco2013@mimuw.edu.pl
.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] EuroGP 2013: Third CfP

(apologies for cross-posting)

*****************************************************************************
EuroGP 2013, 16th European Conference on Genetic Programming
3-5 April 2013, Vienna, Austria
www.evostar.org
THIRD CALL FOR PAPERS
*****************************************************************************

SUBMISSION DEADLINE: 1 November 2012

EuroGP is the premier annual conference on Genetic Programming,
attracting participants from all over the world. High quality papers
describing new original research are sought on topics strongly related
to the evolution of computer programs, ranging from theoretical work to
innovative applications. Topics include but are not limited to:

* Theoretical developments
* Empirical studies of GP performance and behavior
* Algorithms, representations and operators
* Applications of GP to real-world problems
* Tree-based, Linear, Graph-based, Grammar-based GP
* Evolutionary design
* Evolutionary robotics
* Evolvable hardware
* Self-reproducing programs
* Fast/Parallel GP
* Probabilistic GP
* Evolution of various classes of automata or machine
* GP for evolving meta- and hyper-heuristic algorithms
* Software Engineering and GP
* Unconventional evolvable computation

In 2012, EuroGP acceptance rate was 50% (39% for oral presentations).
Accepted papers will be included in the proceedings published by
Springer Verlag in the Lecture Notes in Computer Science (LNCS) series.
The papers which receive the best reviews will be nominated for the Best
Paper Award. Authors of selected papers may be invited to submit
extended versions of their work to the Springer journal Genetic
Programming and Evolvable Machines (GPEM).

EuroGP 2013 will be co-located within the EvoStar event with four
related conferences: EvoBIO, EvoCOP, EvoMUSART, and EvoApplications.

Visit http://www.evostar.org/cfpEuroGP.html or join the EVOstar group on
LinkedIn for more details and updates.

EuroGP programme chairs
Krzysztof Krawiec, Poznan University of Technology, Poland
Alberto Moraglio, University of Birmingham, UK
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] FPS 2012: Call for Participation, Montréal, Canada, October 25-26

[Apologies if you receive multiple copies of this message]
CALL FOR PARTICIPATION

******************************************************************************
5th International Symposium on Foundations & Practice of Security (FPS 2012)
Montreal, Canada -- October 25-26, 2012
http://conferences.telecom-bretagne.eu/fps2012/
******************************************************************************


OVERVIEW
The Foundations & Practice of Security (FPS) Symposium started as a
Franco-Canadian meeting sponsored by MITACS, INRIA and Institut
Mines-Télécom, and has since 2011 grown to be an international event
on its own. This fifth edition will be held in Montréal (Canada), the
25th and 26th of October of 2012. The objective of the FPS symposium
is to present and discuss international research in different areas of
theoretical and practical security solutions.

The program of this year is organized as a 2-day event featuring two
keynote speakers and more than 20 regular presentations that will
include research work on Security on Social networks, Intrusion
detection, Wireless Network Security, Privacy and Trust, Policy-based
Security Architectures, Cryptography and Cryptanalysis, Security of
Mobile Applications, Testing Techniques for Security Validation, and
Information Theoretic Security.


IMPORTANT DATES
* Early Bird Registration: Before September 14, 2012
* Regular Registration: Before October 25, 2012
* Symposium Dates: October 25 and 26, 2012

REGISTRATION
Registration information is available at:
http://conferences.telecom-bretagne.eu/fps2012/registration.html

PROGRAM AND KEYNOTES
The list of papers and keynote talks will be published online at:
http://conferences.telecom-bretagne.eu/fps2012/program.html

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Reminder CFC: NIPS workshop on Discrete Optimization in Machine Learning

===================================================================

Call for Contributions

4th Workshop on
Discrete Optimization in Machine Learning (DISCML):
Structure and Scalability

at the Annual Conference on Neural Information Processing Systems (NIPS 2012)

http://www.discml.cc

Submission Deadline: Sunday 16th September, 11:59pm Samoa time

===================================================================
- We apologize for multiple postings -


Optimization problems with ultimately discretely solutions are
becoming increasingly important in machine learning: At the core of
statistical machine learning is to infer conclusions from data, and
when the variables underlying the data are discrete, both the tasks of
inferring the model from data, as well as performing predictions using
the estimated model are discrete optimization problems. Two factors
complicate matters: first, many discrete problems are in the general
case very hard, and second, machine learning applications often demand
solving such problems at large scale. The focus of this year's
workshop lies on structures that enable scalability. Which properties
of the problem make it possible to still efficiently obtain exact or
decent approximate solutions? What are the challenges posed by
parallel and distributed processing? Which discrete problems in
machine learning are in need of more scalable algorithms? How can we
make discrete algorithms scalable? Some heuristics perform well but are
as yet devoid of a theoretical foundation. What explains this
behavior?

We would like to encourage high quality submissions of short papers
relevant to the workshop topics. Accepted papers will be presented as
spotlight talks and posters. Of particular interest are new algorithms
with theoretical guarantees, as well as applications of discrete
optimization to machine learning problems.

Areas of interest include

Optimization

• Combinatorial algorithms
• Submodular / supermodular optimization
• Discrete Convex Analysis
• Pseudo-boolean optimization
• Parallel & distributed discrete optimization


Continuous relaxations

• Sparse approximation & compressive sensing
• Regularization techniques
• Structured sparsity models


Learning in discrete domains

• Online learning / bandit optimization
• Generalization in discrete learning problems
• Adaptive / stochastic optimization


Applications

• Graphical model inference & structure learning
• Clustering
• Feature selection, active learning & experimental design
• Structured prediction
• Novel discrete optimization problems in ML, Computer Vision, NLP, ...


Submission deadline: September 16, 2012

Length & Format: max. 6 pages NIPS 2012 format

Time & Location: December 7 or 8 2012, Lake Tahoe, Nevada, USA

Submission instructions: Email submit@discml.cc


Invited talks by

• Satoru Fujishige
• Amir Globerson
• Alex Smola


Organizers:
Stefanie Jegelka (UC Berkeley),
Andreas Krause (ETH Zurich, Switzerland),
Jeff A. Bilmes (University of Washington),
Pradeep Ravikumar (University of Texas, Austin)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Research Associates / Fellows (3 posts)

Research Associates / Fellows (3 posts)

Three outstanding candidates are required to support Nottingham's
contribution to the LANCS initiative 'Systems to Build Systems' and
'Heuristic Understanding' research clusters, working in the Automated
Scheduling Planning and Optimisation (ASAP) Research Group. This is an
exciting opportunity to become a member of the £13m LANCS initiative
which brings together four British universities - Cardiff, Lancaster,
Nottingham and Southampton Universities - to develop world-leading
research at the interface between Operational Research and Computer
Science.

Applications are invited from highly skilled researchers in Computer
Science, Artificial Intelligence, Operational Research, Mathematics or
related area. A good understanding of combinatorial optimisation and
related concepts, in particular, heuristics, hyper-heuristics,
evolutionary algorithms, landscape analysis and/or time complexity
analysis of randomised algorithms will be an advantage. In addition,
strong either mathematical or programming skills are essential.

The applicants must have (or be very close to completing) a PhD in
Computer Science, Operational Research or related disciplines. The
successful candidates will be working on the development or run-time
analysis of heuristic search methodologies. They should be able to
work independently and meet tight deadlines. Good communication skills
to work within multidisciplinary teams are crucial. The candidates are
expected to disseminate research results in peer-reviewed journals and
conferences.

This post is available from October 2012 and will be offered on a
fixed-term contract for a period of 12 Months.

Enquiries about these posts may be addressed to Professor U Aickelin,
tel: +44 0115 9514215 or Email: uwe.aickelin@nottingham.ac.uk. Other
informal enquiries may be addressed to the LANCS initiative lecturers:
Jason Atkin, email: jason.atkin@nottingham.ac.uk, Per Kristian Lehre,
email: perkristian.lehre@nottingham.ac.uk , Ender Özcan, email:
ender.ozcan@nottingham.ac.uk and Andrew Parkes, email:
andrew.parkes@nottingham.ac.uk . Please note that the applications
sent directly to these email addresses will not be accepted.

For more information, please see

http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI09413
http://www.lancs-initiative.ac.uk/
http://asap.cs.nott.ac.uk

This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.

This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] EvoENERGY 2013 call for papers

EvoENERGY 2013
Evolutionary Algorithms in Energy Applications
3-5 April 2013 - Vienna, Austria
http://www.evostar.org


INTRODUCTION
Along with the worldwide incentive to reduce fossil and
nuclear based power generation, the number of distributed
generators and other forms of distributed energy resources
which are installed in power networks has been steadily
increasing over the last years. This increased integration
has triggered a transformation of the energy system and
challenges the conventional operation of these networks.

On a network level, this transformation requires new control
and communication approaches, to guarantee the security of
energy supplies as well as an optimal exploitation of
available resources. On a generator level, advanced control
strategies as well as morphological optimization (e.g.,
tuning of wind-blade design) can help to assure an optimal
performance of the generator.

EvoEnergy is intended as a platform for new, innovative
computational intelligence and nature-inspired techniques in
the domain of energy-related optimization research. We seek
contributions ranging from new control concepts for
decentralized generation, strategies for their coordination
in the network to the morphological optimization of
distributed generators.


TOPICS
Topics of interest include, but are not limited to, any of
the following:
- management of distributed generation and storage
- evolutionary design and morphological optimization in
energy systems
- advanced distribution management system functionalities
- Smart Grid monitoring and control
- real time configurations of energy networks
- distributed optimization in energy networks
- grid planning and asset management


PUBLICATION DETAILS
Accepted papers will appear in the proceedings of EvoStar,
published as Springer Lecture Notes in Computer Science.

Submissions must be novel and original. Submissions will be
peer reviewed by at least three members of the program
committee and authors of accepted papers are required to
address the reviewer's comments to produce a camera-ready
version of their manuscripts. At least one author of each
accepted paper must register for the conference and attend
the conference to present their work.

The reviewing process will be double-blind and any
information that may identify the authors should be removed
from the initial submission. Please submit your contribution
to EvoENERGY in Springer LNCS format at
http://myreview.csregistry.org/evoapps13. The page limit is
10 pages.


IMPORTANT DATES
Submission deadline: 1 November 2012
Notification to authors: 21 December 2012
Camera-ready deadline: 15 January 2013
EvoStar event: 3-5 April 2013


CHAIRS
Konrad Diwold, Institute for Wind Energy and Energy System Technology,
konrad.diwold(at)iwes.fraunhofer.de
Kyrre Glette, University of Oslo, kyrrehg(at)ifi.uio.no

CONFIRMED PROGRAM COMMITTEE
Istvan Erlich (University of Duisburg-Essen)
Paul Kaufmann (Fraunhofer IWES)
Martin Middendorf (University of Leipzig)
Julian F. Miller (University of York)
Frank Neumann (University of Adelaide)
Peter Palensky (AIT: Austrian Institute of Technology)
Jan Ringelstein (Fraunhofer IWES)
Andy Tyrrell (University of York)


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call For Papers: ACM SIGMETRICS 2013 Pittsburgh, PA, USA, June 17-21, 2013.

(Please accept our apologies if you receive multiple copies of this message)

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Call For Papers
ACM SIGMETRICS 2013 -- International Conference on Measurement and
Modeling of Computer Systems
June 17-21, 2013
Carnegie Mellon University, Pittsburgh, PA, USA
http://www.sigmetrics.org/sigmetrics2013/
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

ACM SIGMETRICS 2013 solicits papers on the development and application
of state-of-the-art, broadly applicable analytic, simulation and
measurement-based performance evaluation techniques. Of particular
interest is work that presents new performance evaluation methods or
that creatively applies previously developed methods to make predictions
about, or gain insights into key design trade-offs in, computer and
networked systems. The main conference will be held from June 18-20,
2013. There will be workshops and tutorials on June 17, 2013. There
will also be workshops on June 21, 2013. Submission details will be
published shortly on this Web site. A rebuttal process will be piloted this
year to provide authors with the opportunity to clarify
misunderstandings perceived in the first round reviews.

The notion of performance is broadly construed – including
considerations of speed and scalability as well as reliability,
availability,
sustainability and manageability of systems. We encourage both
theoretical contributions and also submissions relating to real world
empirical studies or focusing on implementation and experimental issues.

Quantitative design and evaluation studies of:

* Computer and communication networks, protocols and algorithms
* Wireless, mobile, ad-hoc and sensor networks
* Computer architectures, multi-core processors, memory systems and
storage networks
* Operating systems, file systems and databases
* Virtualization and data centers
* Distributed and cloud computing
* Energy-efficient computing systems
* Real-time and fault-tolerant systems
* Mobile and personal computing systems
* Large-scale operational systems
* Software systems and enterprise applications
* Smart power grids
* Social networks, multimedia systems, service-oriented architectures
and Web services
* Emerging technologies

Methodologies, formalisms, solution techniques and algorithms for:

* Performance, scalability, power and reliability analysis
* Sustainability analysis and power management
* Capacity planning, resource allocation, run time management and scheduling
* Anomaly detection
* Analytical modeling techniques and model validation
* System measurement, monitoring and forecasting
* Workload characterization and benchmarking
* Quality of service, total cost of ownership and pricing
* Experimental design, statistical analysis, simulation
* Performance-oriented applications of game theory, economics, machine
learning, control theory, and signal processing

ORGANIZING COMMITTEE
General Chair: Mor Harchol-Balter, Carnegie Mellon University
PC Co-Chairs: John Douceur, Microsoft Research
Jun Xu, Georgia Institute of Technology
Workshop Chair: Cathy Xia, The Ohio State University
Tutorials Chair: Eno Thereska, Microsoft Research
Publicity Co-Chairs: Jia Wang, AT&T Labs - Research
Marc Lelarge, INRIA
Finance Chair: Alma Riska, EMC Corporation
Student Activity Chair: Urtzi Ayesta, CNRS
Publications Chair: Ton Dieker, Georgia Institute of Technology
Registrations Chair: Patrick Loiseau, Eurecom
Local Arrangements Chair: Nicole Stenger, Carnegie Mellon University
Webmaster: Anshul Gandhi, Carnegie Mellon University

IMPORTANT DATES
Abstracts due: November 2, 2012 (11:59PM EDT)
Full papers due: November 9, 2012 (11:59PM EST)
First-round reviews available: December 26, 2012
Rebuttals to reviews: January 4, 2013 (11:59PM EST)
Notification: February 11, 2013


TECHNICAL PROGRAM COMMITTEE
Tarek Abdelzaher, UIUC
Aditya Akella, University of Wisconsin
Urtzi Ayesta, LAAS-CNRS
Sem Borst, Bell Labs, TU/e, CWI
Niklas Carlsson, Linköping University
Giuliano Casale, Imperial College London
Lucy Cherkasova, HP Labs
Florin Ciucu, TU Berlin, Deutsche Telekom Labs
John Douceur, Microsoft Research
Ton Dieker, Georgia Tech
Do Young Eun, North Carolina State University
Zihui Ge, AT&T Labs
Garth Gibson, CMU
Leana Golubchik, USC
Ajay Gulati, VMware
Varun Gupta, University of Chicago
Charlie Hu, Purdue University
Canturk Isci, IBM T J Watson Research Center
Alain Jean-Marie, INRIA
Mike Kozuch, Intel Research Pittsburgh
Marc Lelarge, INRIA
Baochun Li, University of Toronto
Bill Lin, UCSD
Alex Liu, Michigan State University
John Lui, Chinese University of Hong Kong
Qin Lv, University of Colorado at Boulder
Richard Ma, National University of Singapore
Ishai Menache, Microsoft Research
Arif Merchant, Google
Vishal Mishra, Columbia University
Jason Nieh, Columbia University
Ana Radovanovic, Google
Rhonda Righter, UC Berkeley
Alma Riska, EMC Corporation
Philippe Robert, INRIA
Dan Rubenstein, Columbia University
Sujay Sanghavi, UT Austin
Saswati Sarkar, University of Pennsylvania
Karsten Schwan, Georgia Tech
Jiri Schindler, NetApp
Evgenia Smirni, College of William and Mary
Thrasyvoulos Spyropoulos, Eurecom
Christopher Stewart, Ohio State University
Y. C. Tay, National University of Singapore
Don Towsley, University of Massachusetts
Bhuvan Urgaonkar, Penn State University
Darryl Veitch, University of Melbourne
Milan Vojnovic, Microsoft Research
Jia Wang, AT&T Labs
Tom Wenisch, University of Michigan
Adam Wierman, CalTech
Carey Williamson, University of Calgary
Cathy Xia, Ohio State University
Jun Xu, Georgia Tech
Li Zhang, IBM T. J. Watson Research Center
Zhi-Li Zhang, University of Minnesota
Gil Zussman, Columbia University
Bert Zwart, VU University Amsterdam
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CfP (J-15): 2d International Workshop on Worst-case Traversal Time (WCTT'2012)

Abstract submission deadline : J-15

**********************************************************************
2d International Workshop on Worst-case Traversal Time (WCTT'2012)
San Juan, Puerto Rico, Dec. 4, 2012
co-located with the 33nd IEEE Real-time Systems Symposium (RTSS)
website: http://www.wctt.info
info: wctt@cng1.iet.unipi.it
**********************************************************************


Following the success of the first editions, the WCTT workshop will
gather together scientists and practitioners from both academia and
industry to discuss methods for analysis of bounds on the traversal
time in networked systems. Multi-hop, network-like traversal will be
a mandatory requirement. Contributions that describe software tools
for computing worst-case bounds and/or assess the scalability and
accuracy of the performance methods will be given particular
attention. The workshop values both theoretical and practical
research. Experiences with real-life case studies (e.g., industrial
networks of practical relevance, fieldbuses, embedded networks and
network-on-chip) will also be appreciated, as well as those on the
integration of applicative scheduling and network.


Topics of interest include, but are not limited to:

Methods:
- Network Calculus (both deterministic and stochastic),
- Real-time Calculus
- Trajectory Approach
- Event-based methods
- Formal methods

Areas of applications:
- Embedded systems
- Computer networks
- Network-on-Chip
- Industrial networks

We solicit submission of manuscripts that present original research
results, neither previously published nor currently under review by
another conference or journal. Submitted papers must be formatted
according to the ACM conference proceedings format. Only PDF files
will be accepted. Papers must be up to eight pages long, including
references and title. Please note that the camera-ready version
will conform to the same guidelines as the submission for review.
All submitted papers will go through a rigorous peer review process.
Submissions will be judged on originality, significance, interest,
clarity, relevance, and correctness. Submission implies the
willingness of at least one author to attend the workshop and
present the paper. Accepted papers will be printed in the workshop
proceedings. Distinguished papers, after further revisions, may be
considered for a journal special issue.


---------------
Important Dates
---------------

Abstract submission deadline: Sep 19th, 2012
Paper submission deadline: Sep 30th, 2012
Paper decision deadline: Oct 21th, 2012
Camera-ready deadline: Nov 9th, 2012
Workshop date: Dec 4th, 2012

-------------------
Workshop organizers
-------------------

- Marc Boyer (ONERA, Toulouse, FR)
- Christian Fraboul (Univ. de Toulouse, FR)
- Giovanni Stea (University of Pisa, IT)

---------------------------
Technical Program Committee
---------------------------

- Annne Bouillard (ENS Ulm, FR)
- Jian-Jia Chen (KIT, DE)
- Florin Ciucu (T-labs TU Berlin, DE)
- Markus Fidler (Univ. of Hannover, DE)
- Jean Yves Le Boudec (EPFL, CH)
- Steven Martin (LRI, FR)
- Matthieu Moy (Ensimag/Verimag, FR)
- Linh Thi Xuan Phan (Univ. of Pennsylvania, US)
- Jens Schmitt (Univ. of Kaiserslautern, DE)
- Frank Slomka (University of Ulm, DE)

--
Marc Boyer, Ingenieur de recherche ONERA
Tel: (33) 5.62.25.26.36 DTIM
Fax: (33) 5.62.25.26.93 2, av Edouard Belin
http://www.onera.fr/staff/marc-boyer/ 31055 TOULOUSE Cedex 4
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: 10th Metaheuristics International Conference (MIC)

=======================================================
10th METAHEURISTICS INTERNATIONAL CONFERENCE (MIC 2013)
=======================================================

FIRST CALL FOR PAPERS

August 5-8, 2013, Singapore

http://www.sis.smu.edu.sg/mic2013/

The Metaheuristics International Conference (MIC) is a forum for the
exchange of new algorithmic developments, high-impact and novel
applications, new research challenges, theoretical developments,
implementation issues, and in-depth experimental studies in metaheuristics.


Topics of interest include, but are not limited to:

- Techniques such as tabu search, simulated annealing, iterated local
search, variable neighborhood search, memory-based optimization,
evolutionary algorithms, memetic algorithms, ant colony optimization,
particle swarm optimization, scatter search, path relinking, etc.

- Techniques that enhance the usability and increase the potential of
metaheuristic algorithms such as parallelization of algorithms, reactive
search mechanisms for self-tuning, offline metaheuristic algorithm
configuration techniques, algorithm portfolios, etc.

- Empirical and theoretical research in metaheuristics including
large-scale experimental analyses, algorithm comparisons, new
experimental methodologies, engineering methodologies for stochastic
local search algorithms, search space analysis, theoretical insights
into properties of metaheuristic algorithms.

- High-impact applications of metaheuristics in fields such as
bioinformatics, data mining, planning and scheduling,
telecommunications. logistics and supply chains, etc. Particularly
welcome are innovative applications of metaheuristics that have a
potential of widening research frontiers.

- Contributions on the interface of metaheuristics with other
disciplines, such as agent-based models, integer programming, constraint
programming, machine learning, etc.

- Challenging problems such as multi-objective, stochastic, or dynamic
problems.


MIC2013 will feature refereed and invited presentations and panels on
emerging issues that bring academic and industry participants together
in dialogue. We plan to organize special sessions on Big Data decision
analytics and distributed problem solving. Because of conference's
proximity to the vibrant international business and high-tech setting of
Singapore, we expect to have participation from practitioners.


Program Chairs

Hoong Chuin Lau (hclau@smu.edu.sg), Singapore Management University,
Singapore

Günther Raidl (raidl@ads.tuwien.ac.at), Vienna University of Technology,
Austria

Pascal Van Hentenryck (pvh@nicta.com.au), NICTA and University of
Melbourne, Australia


Invited Speakers

Pablo Moscato, Professor, School of Electrical Engineering and Computer
Science, University of Newcastle

Steven Kimbrough, Professor, Wharton Business School, University of
Pennsylvania

Panos M. Pardalos, Distinguished Professor, Industrial and Systems
Engineering, and Director, Centre for Applied Optimization, University
of Florida


Publications

Invited are original full papers of up to 10 pages as well as extended
abstracts of work-in-progress and position notes of up to 3 pages.
Accepted papers will be published in the proceedings that will be
available at the conference. In addition, a post-conference special
issue of an appropriate journal (to be announced later) is planned to be
published. Participants will be invited to submit extended versions of
their work for consideration.


Key Dates and Deadlines

Electronic paper submission deadline: February 28, 2013
Notification of acceptance: April 30, 2013
Camera-ready papers: May 30, 2013
Workshops and tutorials: August 5, 2013
Main conference: August 6-8, 2013


--
+- Guenther Raidl -+
+- Institute of Computer Graphics and Algorithms -+
+- Vienna University of Technology -+
+- Favoritenstrasse 9-11/1861, 1040 Vienna, Austria, Europe -+
+- email: raidl@ads.tuwien.ac.at | phone: +43(1)58801/18616 -+
+- http://www.ads.tuwien.ac.at/ | fax: +43(1)58801/18699 -+
(DVR: 0005886)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Demos - NetSys 2013

KuVS -- Communication Software - Award

The special interest group for communication and distributed systems of the
German Association for Computer Science (GI/ITG Fachgruppe KuVS) is calling
applications for the biennial Communication Software Award. The
Communication
Software Award honors the best practice-oriented application, tool,
framework,
or demonstration showing innovative and original research in the areas of
networks, communication, or distributed systems. Submissions of novel,
original work from both academia and industry are invited, nominations of
students, from academic research projects, or SME are especially encouraged.
Products commercially available during the NetSys 2013 conference already,
are
excluded from the awards. Nominations of either single applicants or groups
are welcome, the best student application may get an additional award.

The submission should include an extended abstract of up to two pages. They
should include authorship (with affiliations), the problem domain and
application of the communication software nominated, platform requirements,
and the envisioned licensing scheme, and they should explicitly state what
will be demonstrated at the NetSys 2013 conference and how the audience will
be
able to interact and experiment with it. The following assessment criteria
should additionally be explicitly addressed:

- the relevance to its application in practice
- innovation and novelty of the new software
- enhancements as compared to prior systems
- the state of the software and its maturity for application

All nominations will undergo a preliminary review process for short listing.
All short listed systems will have to be presented at the NetSys 2013
conference in Stuttgart (registration to the conference will be needed) in a
demo session, and the price will be awarded following the final selection of
the committee on site.

Further information is available on the Web site:
http://www.netsys2013.de/cfd.html

All submissions should be emailed to the committee chair:
strufe (AT) cs.tu-darmstadt.de


IMPORTANT DATES:
Abstract submission deadline: October 5 2012
Notification of invitation: November 5 2012
Camera ready submission: December 7 2012
NetSys - KiVS 2012: March 11-15 2013


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Tenure-track position in information and computer science at Aalto University, Finland

Aalto University School of Science (Helsinki, Finland) invites
applications for:

TENURE TRACK OR TENURED POSITION IN INFORMATION AND COMPUTER SCIENCE
(ESPECIALLY ALGORITHMS, LOGIC, AND COMPLEXITY)

Aalto University ("http://aalto.fi/en/") is a new university created in
2010 from the merger of the Helsinki University of Technology TKK, the
Helsinki School of Economics, and the University of Art and Design
Helsinki. The University's cornerstones are its strengths in education
and research, with 20,000 basic degree and graduate students, and a
staff of 4,500 of whom 300 are professors.

The position is located at the University's Department of Information
and Computer Science ("http://ics.aalto.fi/"), and is open to
outstanding individuals who hold a doctorate and have excellent
potential for a successful scientific career. On the basis of their
experience and competence, applicants will be placed at one of the four
levels of the tenure track system: Assistant Professor (1), Assistant
Professor (2), Associate Professor, and (Full) Professor. Applicants to
the junior positions (levels 1 and 2) are required to have carried out
at least one successful postdoctoral period after their doctorate.
Successful candidates at the two first-mentioned levels will be
appointed for a fixed term, whereas appointments at the Associate
Professor level are either permanent (tenured) or for a fixed term. Full
Professor positions are always tenured.

The focus of the Information and Computer Science Department's research
and teaching activity is on advanced computational methods for
modelling, analysing, and solving complex tasks in technology and
science. The research aims at the development of fundamental computer
science methods for the analysis of large and high-dimensional data
sets, and for the modelling and design of complex software, networking
and other computational systems.

- In the Aalto Research Assessment Exercise 2009, covering all the 46
academic units of Aalto University, the Department was identified as
one of the select two highest-ranking performers (RAE score 24/25).
The full report "Striving for Excellence, Aalto University
Research Assessment Exercise 2009" is available at
"http://dept.ics.aalto.fi/calls/rae2009/".

- In a recent ranking of world universities according to their
publication performance, computer science research at Aalto
University was ranked #83 world-wide: #22 in Europe and #2 in the
Nordic countries. (For the full listing, see
"http://taiwanranking.lis.ntu.edu.tw/Default-EN.aspx",
"By Subject" -> "Engineering" -> "Computer Science".)

- The present call for applications is targeted particularly to the
fields of algorithms, logic, and complexity. A joint appointment with
the Helsinki Institute for Information Technology HIIT
("http://hiit.fi/") can be negotiated.

The closing date of the call is 15 October 2012. Should there be a
lack of eligible outstanding applicants, the application period may
be extended. While all applicants who have submitted an application
by the deadline will be appropriately considered, Aalto University
reserves the right to consider also other candidates for the announced
position.

Further details on the position and the application procedure are
available at:

"http://www.aalto.fi/en/current/jobs/" and
"http://dept.ics.aalto.fi/calls/tenuretrack2013/".

For additional information, please contact Professor Pekka Orponen
(departmental information), tel. +358 9 470 25246, or HR Coordinator
Stefan Ehrstedt (application process), tel. +358 50 340 7662. E-mails:
firstname.lastname@aalto.fi.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] JVLC Call for Special Issue

CALL FOR SPECIAL ISSUE

Visualization and Reasoning with Euler Diagrams: Special issue of the Journal
of Visual Languages and Computing.

Please consider forwarding this call for papers to the appropriate groups or
individuals.

IMPORTANT DATES

Abstract submission: Friday, 7th September, 2012
Paper submission: Friday, 5th October, 2012

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

Euler diagrams represent relationships between sets, including intersection,
containment, and disjointness. These diagrams have become the foundations of
various visual languages and have notably facilitated the modelling of, and
logical reasoning about, complex systems. Over the years, they have been
extensively used in areas such as biosciences, business, criminology and
national security to intuitively visualize relationships and relative
cardinalities of sets. This widespread adoption has allowed analysis of
complex collections of data.

The special issue will cover all aspects of Euler diagram research, including,
but not limited to:

- theoretical advances:
o drawability,
o layouts,
o logic,
o reasoning,

- software support:
o diagram generation,
o automated reasoning,
o data exploration,

- real-world applications:
o system modelling,
o information visualization,
o education,

- cognition and perceptual principles:
o readability,
o aesthetics,
o evaluation including comparison to other representations.

Recently, there have been significant advances in all of the above areas.

All papers will be subject to full peer-review in line with standard JVLC
practice.


SUBMISSIONS

We solicit submission of papers consisting of original research and surveys,
including, but not limited to, substantially extended papers published at
Euler Diagrams 2012 and other similar conferences.

Formatting guidelines can be found on the JVLC webpage
(http://www.elsevier.com/wps/find/journaldescription.cws_home/622907/authorinstructions)

Submission is via the EasyChair system, at

www.easychair.org/conferences/?conf=vred13


SPECIAL ISSUE EDITORS

Peter Chapman (University of Brighton, UK)
Luana Micallef (University of Kent, UK)


ABOUT JVLC

The Journal of Visual Languages and Computing is a forum for researchers,
practitioners, and developers to exchange ideas and results for the
advancement of visual languages and its implication to the art of computing.
The journal publishes research papers, state-of-the-art surveys, and review
articles in all aspects of visual languages.


CONTACT

If you have any questions, please contact the Special Issue Editors
vred13@easychair.org.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CfP: Reachability Problems 2012 - Bordeaux (17 - 19 Sept.)

Dear Colleague,

The early registration deadline for the RP12 workshop in Bordeaux is extended to September 5.
Please consider participating and inform your colleagues that can be interested by the event.

=================================
CALL FOR PARTICIPATION

RP 2012
6th International Workshop on Reachability Problem
September 17 - 19 2012
Bordeaux, FR

http://rp12.labri.fr/
=================================


AIMS AND OBJECTIVES
===================
The Reachability Workshop is specifically aimed at gathering
together scholars from diverse disciplines and backgrounds
interested in reachability problems that appear in
- Algebraic structures
- Computational models
- Hybrid systems
- Logic
- Verification

PROGRAM
=======
http://rp12.labri.fr/index.php?page=program

IMPORTANT DATE
===============
Deadline for early registration: September 5, 2012

PROGRAM COMMITTEE
=================
Davide Ancona, Genova
Bernard Boigelot, Liege
Olivier Bournez, Palaiseau
Cristian S. Calude, Auckland
Giorgio Delzanno, Genova
Javier Esparza, München
Alain Finkel, Cachan
Vesa Halava, Turku
Juhani Karhumäki, Turku
Alexander Kurz, Leicester
Kim G. Larsen, Aalborg
Jerome Leroux, Bordeaux
Richard Mayr, Edinburgh
Alexei Lisitsa, Liverpool
Igor Potapov, Liverpool
Jean-Francois Raskin, Bruxels
Sylvain Schmitz, Cachan
Wolfgang Thomas, Aachen
James Worrell, Oxford
Hsu-Chun Yen, Taipei
Gianluigi Zavattaro, Bologna

ORGANIZING COMMITTEE
====================
Alain Finkel, Cachan
Jérôme Leroux, Bordeaux
Igor Potapov, Liverpool

CONTACTS
========
E-mail: leroux@labri.fr, finkel@lsv.ens-cachan.fr, potapov@liverpool.ac.uk
Web: http://rp12.labri.fr


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] IPDPS 2013 - Call for paper: Abstract due on September 24, 2012

September 2, 2012 Release

IEEE IPDPS 2013 CALL FOR PAPERS
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20 May - 24 May 2013
www.ipdps.org
----------------------------------------------
IMPORTANT DATES
• Abstracts due.....September 24, 2012
• Submissions due.....October 1, 2012
• Rebuttal period.....November 14-18, 2012
• Author notification.....December 23, 2012
• Camera-ready due.....February 1, 2013
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
IPDPS 2013 CALL FOR PARTICIPATION
In 2013, IPDPS will be held along the banks of the Charles River at
the Hyatt Regency Cambridge with great views of the Boston skyline.
The Boston-Cambridge venue offers an exciting multicultural setting
where visitors from around the world mingle in the midst of world
renowned educational institutions and landmarks of America's founding.
The Greater Boston Metropolitan Area with many historic and tourist
attractions is easily navigable by foot and public transit. Check the
IPDPS Web pages for updates and information on workshops, the PhD
Forum, and other events as the full program develops.

GENERAL CO-CHAIRS
Martin Herbordt, Boston University, USA
Charles C. (Chip) Weems, University of Massachusetts at Amherst, USA

PROGRAM CHAIR
Sanjay Ranka, University of Florida, USA

PROGRAM VICE-CHAIRS
ALGORITHMS: Frédéric Vivien, INRIA, France
APPLICATIONS: Assaf Schuster, Technion – Israel Institute of Technology, Israel
ARCHITECTURE: David Kaeli, Northeastern University, USA
SOFTWARE: David Padua, University of Illinois at Urbana-Champaign, USA

PROGRAM COMMITTEE (See listing below Call for Papers that follows.)

************************************
************************************
IPDPS 2013 CALL FOR PAPERS
http://www.ipdps.org/ipdps2013/2013_call_for_papers.html
************************************
SCOPE
Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:

•Parallel and distributed algorithms, focusing on issues such as:
stability, scalability, and fault-tolerance of algorithms and data
structures for parallel and distributed systems, communication and
synchronization protocols, network algorithms, scheduling, and load
balancing.

•Applications of parallel and distributed computing, including web
applications, peer-to-peer computing, parallel crowd sourcing, social
network analysis, management of big data, cloud and grid computing,
scientific applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, or
discussing scalability toward the exascale level are encouraged.

•Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; special-purpose architectures, including graphics
processors, signal processors, network processors, media accelerators,
and other special purpose processors and accelerators; impact of
technology on architecture; network and interconnect architectures;
parallel I/O and storage systems; architecture of the memory
hierarchy; power-efficient and green computing architectures;
dependable architectures; and performance modeling and evaluation.

•Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools.

BEST PAPERS AWARDS
Awards will be given for one best paper in each of the four conference
technical tracks: algorithms, applications, architectures, and
software. Selected papers will be considered for possible publication
in a special issue of the Journal of Parallel and Distributed
Computing.

WHAT/WHERE TO SUBMIT
Submitted manuscripts may not exceed ten (10) single-spaced
double-column pages using 10-point size font on 8.5x11 inch pages
(IEEE conference style), including figures, tables, and references.
See style templates at
http://www.ipdps.org/ipdps2013/2013_call_for_papers.html. IPDPS will
again require submission of abstracts and registration of papers one
week before the paper submission deadline without any late exceptions.
The submission portal will be available in early September.

REVIEW OF MANUSCRIPTS
All submitted manuscripts will be reviewed. The review process is not
double blind, i.e., authors will be known to reviewers. All submitted
manuscripts will be reviewed. Submissions will be judged on
correctness, originality, technical strength, significance, quality of
presentation, and interest and relevance to the conference scope.
Submitted papers may NOT have appeared in or be under consideration
for another conference or workshop or journal. Abstracts are due
September 24, 2012, and full manuscripts must be received by October
1, 2012. This is a final, hard deadline; to ensure fairness, no
extensions will be given. There will be a rebuttal period from
November 14-18, 2012. Notification of review decisions will be mailed
by December 23, 2012, and camera-ready papers will be due February 1,
2013.

PROGRAM COMMITTEE
Tor AAMODT (UMBC) Puerto Rico
Tarek S. ABDELRAHMAN (EECG, Toronto) Canada
David ABRAMSON (Monash) Australia
Mark ADAMS (Columbia University) USA
Orna AGMON BEN-YEHUDA (Technion) Israel
Kunal AGRAWAL (Washington University in St. Louis) USA
Gagan AGRAWAL (CSE Ohio State) USA
Emmanuel AGULLO (INRIA) France
Shoukat ALI (IBM Research - Ireland) Ireland
Srinivas ALURU (Iowa State University) USA
Emmanuel ARZUAGA (UPRM) Puerto Rico
Rafael ASENJO PLAZA (University of Málaga) Spain
Zaks AYAL (Intel) Israel
Eduard AYGUADE (Technical University of Catalunya -UPC) Spain
David A. BADER (Georgia Institute of Technology) USA
Amitabha BAGCHI (Indian Institute of Technology Delhi) India
Zhaojun BAI (University of California, Davis) USA
Denis BARTHOU (University of Bordeaux) France
Olivier BEAUMONT (INRIA) France
Michael A. BENDER (State University of New York at Stony Brook) USA
Anne BENOIT (ENS Lyon) France
Yitzhak (Tsahi) BIRK (Technion) Israel
Rob BISSELING (U. Utrecht) The Netherlands
George BOSILCA (University of Tennessee, Knoxville) USA
Aurélien BOUTEILLER (University of Tennessee, Knoxville) USA
Michael J. BRIM (ORNL) USA
Mats BRORSSON (KTH Royal Institute of Technology) Sweden
Aydin BULUÇ (Lawrence Berkeley National Laboratory) USA
Darius BUNTINAS (MCS - Argonne National Laboratory) USA
Ioana BURCEA (IBM Research) USA
Michael BURKE (Rice University) USA
Ramon CANAL (UPC Spain) Spain
Franck CAPPELLO (University of Illinois at Urbana-Champaign) USA
Eddy CARON (ENS Lyon) France
Paul CARPENTER (BSC) Spain
Henri CASANOVA (University of Hawaii at Manoa) USA
Yuval CASSUTO (Technion) Israel
Claris CASTILLO (IBM T.J. Watson Research Center) USA
Bryan CATANZARO (NVIDIA) USA
Rezaul A. CHOWDHURY (Stony Brook University) USA
Marcelo CINTRA (The University of Edinburgh) UK
Mark CLEMENT (Brigham Young University) USA
Ayse COSKUN (Boston University) USA
Neal CRAGO (Intel, VSSAD) USA
Dilma DA SILVA (Qualcomm) USA
Alain DARTE (École Normale Supérieure de Lyon) France
Sajal DAS (UT Arlington) USA
Bronis DE SUPINSKI (LLNL) USA
Gregory DIAMOS (NVIDIA) USA
Danny DIG (University of Illinois at Urbana-Champaign) USA
Chen DING (University of Rochester) USA
Shlomi DOLEV (Ben Gurion University of the Negev) Israel
Rudolf EIGENMANN (Purdue University) USA
Natalie ENRIGHT-JERGER (Univ. of Toronto) Canada
Mattan EREZ (Univ. of Texas) USA
Yoav ETSION (Technion) Israel
Lionel EYRAUD-DUBOIS (INRIA) France
Michael FACTOR (IBM) Israel
Babek FALSAFI (EPFL) Switzerland
John FEO (Pacific Northwest National Laboratory) USA
Michael FERDMAN (Stony Brook University) USA
Christof FETZER (TU-DRESDEN) Germany
Peirfrancesco FOGLIA (University of Pisa) Italy
Liana L FONG (IBM T.J. Watson Research Center) USA
Eitan FRACHTENBERG (Facebook) USA
Basilio FRAGUELA (University of A Coruna) Spain
Pierre FRAIGNAUD (CNRS) France
Franz FRANCHETTI (Carnegie Mellon University) USA
Davide FREY (INRIA) France
Arik FRIEDMAN (NICTA) Australia
Xin FU (University of Kansas) USA
Grigori FURSIN (INRIA) France
Kyle GALLIVAN (Florida State University) USA
Eftratios GALLOPOULOS (University of Patras) Greece
Guang GAO (University of Delaware) USA
Michale GARLAND (NVIDIA) USA
María Jesús GARZARÁN (University of Illinois at Urbana-Champaign) USA
Leszek GASIENIEC (University of Liverpool) UK
Cyril GAVOILLE (University of Bordeaux) France
Issac GELADO (BSC) Spain
Michael GERNDT (Technische Universität München) Germany
Ran GILAD-BACHRACH (MSR) USA
Luc GIRAUD (INRIA) France
Alfredo GOLDMAN (University of São Paulo) Brazil
María Angeles GONZÁLEZ NAVARRO (University of Málaga) Spain
Laura GRIGORI (INRIA) France
Thomas GROSS (ETH Zurich) Switzerland
Abdou GUERMOUCHE (U. of Brodeaux) France
Rajiv GUPTA (University of California Riverside) USA
Haldun HADIMIOGLU (Polytechnic Institute of NYU ) USA
Thomas HERAULT (LRI) France
Bo HONG (Georgia Institute of Technology) USA
Paul HOVLAND (Argonne National Laboratory) USA
Kevin HUCK (ParaTools) USA
Liviu IFTODE (Rutgers) USA
Francois IRIGOIN (MINES ParisTech/CRI) France
Ayal ITZKOVITZ (Oracle Communications) Israel
Mathias JACQUELIN (INRIA) France
Byunghyun JANG (AMD) USA
Langou JULIEN (UC Denver) USA
Sven KARLSSON (DTU) Denmark
Paul KELLY (Imperial College) UK
Nakajima KENGO (University of Tokyo) Japan
Christoph KESSLER (Linköping University) Sweden
Thilo KIELMANN (Vrije Universiteit) Netherlands
Volodymyr KINDRATENKO (UIUC/NCSA) USA
Gabriel KLIOT (MSR) USA
Miroslaw KORZENIOWSKI (Wroclaw University of Technology) Poland
Harald KOSCH (Passau University) Germany
Milind KULKARNI (Purdue University) USA
Sameer KUMAR (IBM T.J. Watson Research Center) USA
Jaejin LEE (Seoul National University) Korea
Jenq-Kuen LEE (National Tsing Hua University) Taiwan
Arnaud LEGRAND (CNRS) France
Xiaoming LI (University of Delaware) USA
Zhiyuan LI (Purdue University) USA
Xiaoye Sherry LI (Lawrence Berkeley National Laboratory) USA
Calvin LIN (The University of Texas at Austin) USA
David LOWENTHAL (The University of Arizona) USA
Robert F. LUCAS (University of Southern California) USA
Mikel LUJAN (University of Manchester) UK
Steven LUMETTA (University of Illinois at Urbana-Champaign) USA
Andrew LUMSDAINE (Indiana University) USA
Kamesh MADDURI (PennState University) USA
Fredrik MANNE (University of Bergen) Norway
Pierre MANNEBACK (University of Mons) Belgium
Loris MARCHAL (CNRS) France
Tomàs MARGALEF (Universitat Autònoma de Barcelona) Spain
Naoya MARUYAMA (RIKEN) Japan
Niko MATSAKIS (MIT) USA
Satoshi MATSUOKA (TITECH) Japan
Jean-Francois MEHAUT (Ensimag) France
Rami MELHEM (University of Pittsburgh) USA
Avi MENDELSON (Microsoft) Israel
Duane MERRILL (NVIDIA) USA
Samuel MIDKIFF (Purdue University) USA
Jose MOREIRA (IBM T.J. Watson Research Center) USA
J. Eliot B. MOSS (University of Massachusetts) USA
Esmond NG (Lawrence Berkeley National Laboratory) USA
Alex NICOLAU (University of California Irvine) USA
Dimitris NIKOLOPOULOS (QUB, Belfast) UK
Yun PAEK (Seoul National University) Korea
Dhabaleswar K. PANDA (Ohio State University) USA
Santosh PANDE (Georgia Tech) USA
Victor PANKRATIUS (MIT) USA
Yale PATT (Univ. of Texas) USA
Jih-Kwon PEIR (CISE – University of Florida) USA
Miquel PERICÀS (Tokyo Institute of Technology) Japan
Salvador PETIT (DISCA-UPV) Spain
Michael PHILIPPSEN (University of Erlangen-Nuremberg) Germany
Cynthia A. PHILLIPS (Sandia National Labs) USA
Don PORTER (Stony Brook University) USA
Sushil K. PRASAD (Georgia State University) USA
Susanne Cech PREVITALI (ETH Zurich) Switzerland
Markus PÜSCHEL (ETH Zurich) Switzerland
Padma RAGHAVAN (The Pennsylvania State University) USA
Sanjay RAJOPADHYE (Colorado State University) USA
Smruti RANJAN SARANGI (IIT Delhi) India
Thomas RAUBER (University of Bayreuth) Germany
Lawrence RAUCHWERGER (Texas A&M University) USA
Alistair RENDELL (Australian National University) Australia
Jason RIEDY (Georgia Institute of Technology) USA
Rolf RIESEN (IBM, Dublin) Ireland
Étienne RIVIÈRE (University of Neuchâtel) Switzerland
Chris ROSSBACH (MSR) USA
Larry RUDOLPH (CSAIL-MIT) USA
Gudula RÜNGER (Technische Universität Chemnitz) Germany
Krzysztof RZADCA (University of Warsaw) Poland
Yogish SABHARWAL (IBM Research) India
P. SADAYAPPAN (Ohio State University) USA
Rizos SAKELLARIOU (U. of Manchester) UK
Beverly SANDERS (University of Florida) USA
Mitsuhisa SATO (University of Tsukuba) Japan
Erik SAULE (Ohio State University) USA
André SCHIPER (EPFL) Switzerland
Gunar SCHIRNER (Northeastern University) USA
Stefan SCHMID (Deutsche Telekom Laboratories and TU Berlin) Germany
Martin SCHULZ (LLNL) USA
Pierre SENS (University Paris 6) France
Xipeng SHEN (College of William & Mary) USA
Mark SILBERSTEIN (UT Austin) USA
Francesco SILVESTRI (University of Padova) Italy
Yogesh SIMMHAN (University of Southern California) USA
Oliver SINNEN (University of Auckland) New Zealand
Quinn SNELL (Brigham Young University) USA
Veronika SONIGO (IUT Besançon-Vesoul) France
Leonel SOUSA (INESC-ID/IST, Technical University of Lisbon) Portugal
Evan SPEIGHT (IBM Research) USA
Thomas STERLING (Indiana University) USA
Mark STILLWELL (Cranfield University) UK
Jeff STUECHELI (IBM Research) USA
Jaspal SUBHLOK (University of Houston) USA
Frédéric SUTER (CNRS, IN2P3 Computing Center) France
Douglas THAIN (University of Notre Dame) USA
Samuel THIBAULT (University of Bordeaux) France
Sivan TOLEDO (Tel Aviv University) Israel
Pedro TRANCOSO (University of Cyprus) Cyprus
Denis TRYSTRAM (ENSIMAG) France
Dan TSAFRIR (Technion) Israel
Philippas TSIGAS (Chalmers University) Sweden
Rafael UBAL (Northeastern University) USA
Bora UÇAR (ENS Lyon) France
Alex VEIDENBAUM (University of California Irvine) USA
Jeff VETTER (Oak Ridge National Laboratory and Georgia Tech) USA
Carlos VILLAVIEJA (University of Texas) USA
C.L. WANG (HKU) Hong Kong
Jon WEISSMAN (University of Minnesota, Twin Cities) USA
Bernard WONG (University of Waterloo) Canada
David WONNACOTT (Haverford College) USA
Peng WU (IBM TJ watson Research Center) USA
Carole-Jean WU (Arizona State University) USA
Quing YI (University of Texas at San Antonio) USA
Rio YOKOTA (King Abdullah University) Saudi Arabia
Hu YU (ICT - Chinese Academy of Sciences) China
Eitan ZAHAVI (Mellanox) Israel
Antonia ZHAI (University of Minnesota) USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************