CSR-2014: Second Call for Papers
The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014
DEADLINE:
Submission: December 9, 2013
*** NEWS: ***
Associated Workshops:
* June 5: Workshop on Current Trends in Cryptology, CTCrypt
(organized by Technical committee on standardization
"Cryptography and security mechanisms" (TC26))
* June 6: Extremal graph theory
(organized by A. Raigorodsky)
Invited speakers: Joel Spencer, Endre Szemeredi, ...
* June 12: New directions in cryptography
(organized by A.V. Mikhalev, A.A.Mikhalev, S.Glavatsky, D.Grigoriev and V.Shpilrain)
Special Issue:
* There will be a special issue of Theory of Computing Systems
(refereed accordingly to the journal standards)
containing selected papers from those presented at CSR-2014
CONFERENCE:
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers U.)
Andris Ambainis (U. of Latvia)
Christel Baier (TU Dresden)
Petra Berenbrink (Simon Fraser U.)
Mikolaj Bojanczyk (U. of Warsaw)
Andrei Bulatov (Simon Fraser U.)
Victor Dalmau (U. Pompeu Fabra)
Manfred Droste (U. of Leipzig)
Zoltan Esik (U. of Szeged)
Fedor Fomin (U. of Bergen)
Edward A. Hirsch (Steklov Inst./St.Petersburg)
Gregory Kucherov (CNRS and U. Marne-la-Vallee)
Michal Kunc (Masaryk U.)
Leonid Libkin (U. of Edinburgh)
Konstantin Makarychev (Microsoft Research)
Kurt Mehlhorn (Max-Planck Inst.)
Georg Moser (U. of Innsbruck)
Alexander Okhotin (U. of Turku)
Giovanni Pighizzini (U. of Milano)
Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
Michel Rigo (U. of Liege)
Nicole Schweikardt (U. of Frankfurt)
Jacobo Toran (U. of Ulm)
Mikhail Volkov (Ural Federal U.)
Carsten Witt (TU Denmark)
Distinguished opening lecture:
Shafi Goldwasser (MIT)
Invited Speakers:
Mark Braverman (Princeton)
Volker Diekert (Stuttgart)
Martin Grohe (RWTH Aachen)
Benjamin Rossman (National Institute of Informatics, Tokyo)
Alexei Semenov (Moscow)
Igor Walukiewicz (Bordeaux)
Important Dates:
Submission: December 9, 2013
Notification: February 12, 2014
Topics: include, but are not limited to:
algorithms and data structures
algorithms for concurrent and distributed systems, networks
computational complexity
proof complexity
Kolmogorov complexity
combinatorial optimization
constraint solving
cryptography
combinatorics in computer science
automata theory and formal languages
computational models and concepts
database theory
applications of logic to computer science
proof theory
model checking
automated reasoning
deductive methods
Submission:
Authors are invited to submit original (and not previously published)
research. Submissions consist of two parts: the main paper and an appendix
(which might be empty). The main paper must be at most 14 pages in length,
including references. All proofs omitted from the main paper due to space
constraints should be given in the appendix or made accessible through a
reliable link to a freely available electronic preprint. The papers must
be submitted in English, in the LNCS format (LaTeX, as pdf; final version
with source) with page numbering turned on using the \pagestyle{plain}
command; instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented
at the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2014
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
Conference co-Chairs:
Nikolay Vereshchagin (Moscow)
Edward A. Hirsch (St.Petersburg)
Sergei O. Kuznetsov (Moscow)
Organized by
Moscow Center for Continuous Mathematical Education
National Research University Higher School of Economics
Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences
Sponsored by
Yandex
National Research University Higher School of Economics
Russian Foundation for Basic Research
Further information and contacts:
Web: http://logic.pdmi.ras.ru/csr2014
Email: csr2014 "at" googlegroups.com
UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
Monday, November 25, 2013
Sunday, November 24, 2013
[DMANET] CSR 2014: Second Call for Papers
CSR-2014: Second Call for Papers
The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014
DEADLINE:
Submission: December 9, 2013
*** NEWS: ***
Associated Workshops:
* June 5: Workshop on Current Trends in Cryptology, CTCrypt
(organized by Technical committee on standardization
"Cryptography and security mechanisms" (TC26))
* June 6: Extremal graph theory
(organized by A. Raigorodsky)
Invited speakers: Joel Spencer, Endre Szemeredi, ...
* June 12: New directions in cryptography
(organized by A.V. Mikhalev, A.A.Mikhalev, S.Glavatsky, D.Grigoriev and V.Shpilrain)
Special Issue:
* There will be a special issue of Theory of Computing Systems
(refereed accordingly to the journal standards)
containing selected papers from those presented at CSR-2014
CONFERENCE:
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers U.)
Andris Ambainis (U. of Latvia)
Christel Baier (TU Dresden)
Petra Berenbrink (Simon Fraser U.)
Mikolaj Bojanczyk (U. of Warsaw)
Andrei Bulatov (Simon Fraser U.)
Victor Dalmau (U. Pompeu Fabra)
Manfred Droste (U. of Leipzig)
Zoltan Esik (U. of Szeged)
Fedor Fomin (U. of Bergen)
Edward A. Hirsch (Steklov Inst./St.Petersburg)
Gregory Kucherov (CNRS and U. Marne-la-Vallee)
Michal Kunc (Masaryk U.)
Leonid Libkin (U. of Edinburgh)
Konstantin Makarychev (Microsoft Research)
Kurt Mehlhorn (Max-Planck Inst.)
Georg Moser (U. of Innsbruck)
Alexander Okhotin (U. of Turku)
Giovanni Pighizzini (U. of Milano)
Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
Michel Rigo (U. of Liege)
Nicole Schweikardt (U. of Frankfurt)
Jacobo Toran (U. of Ulm)
Mikhail Volkov (Ural Federal U.)
Carsten Witt (TU Denmark)
Distinguished opening lecture:
Shafi Goldwasser (MIT)
Invited Speakers:
Mark Braverman (Princeton)
Volker Diekert (Stuttgart)
Martin Grohe (RWTH Aachen)
Benjamin Rossman (National Institute of Informatics, Tokyo)
Alexei Semenov (Moscow)
Igor Walukiewicz (Bordeaux)
Important Dates:
Submission: December 9, 2013
Notification: February 12, 2014
Topics: include, but are not limited to:
algorithms and data structures
algorithms for concurrent and distributed systems, networks
computational complexity
proof complexity
Kolmogorov complexity
combinatorial optimization
constraint solving
cryptography
combinatorics in computer science
automata theory and formal languages
computational models and concepts
database theory
applications of logic to computer science
proof theory
model checking
automated reasoning
deductive methods
Submission:
Authors are invited to submit original (and not previously published)
research. Submissions consist of two parts: the main paper and an appendix
(which might be empty). The main paper must be at most 14 pages in length,
including references. All proofs omitted from the main paper due to space
constraints should be given in the appendix or made accessible through a
reliable link to a freely available electronic preprint. The papers must
be submitted in English, in the LNCS format (LaTeX, as pdf; final version
with source) with page numbering turned on using the \pagestyle{plain}
command; instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented
at the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2014
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
Conference co-Chairs:
Nikolay Vereshchagin (Moscow)
Edward A. Hirsch (St.Petersburg)
Sergei O. Kuznetsov (Moscow)
Organized by
Moscow Center for Continuous Mathematical Education
National Research University Higher School of Economics
Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences
Sponsored by
Yandex
National Research University Higher School of Economics
Russian Foundation for Basic Research
Further information and contacts:
Web: http://logic.pdmi.ras.ru/csr2014
Email: csr2014 "at" googlegroups.com
UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
**********************************************************
*
* 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/
*
**********************************************************
The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014
DEADLINE:
Submission: December 9, 2013
*** NEWS: ***
Associated Workshops:
* June 5: Workshop on Current Trends in Cryptology, CTCrypt
(organized by Technical committee on standardization
"Cryptography and security mechanisms" (TC26))
* June 6: Extremal graph theory
(organized by A. Raigorodsky)
Invited speakers: Joel Spencer, Endre Szemeredi, ...
* June 12: New directions in cryptography
(organized by A.V. Mikhalev, A.A.Mikhalev, S.Glavatsky, D.Grigoriev and V.Shpilrain)
Special Issue:
* There will be a special issue of Theory of Computing Systems
(refereed accordingly to the journal standards)
containing selected papers from those presented at CSR-2014
CONFERENCE:
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers U.)
Andris Ambainis (U. of Latvia)
Christel Baier (TU Dresden)
Petra Berenbrink (Simon Fraser U.)
Mikolaj Bojanczyk (U. of Warsaw)
Andrei Bulatov (Simon Fraser U.)
Victor Dalmau (U. Pompeu Fabra)
Manfred Droste (U. of Leipzig)
Zoltan Esik (U. of Szeged)
Fedor Fomin (U. of Bergen)
Edward A. Hirsch (Steklov Inst./St.Petersburg)
Gregory Kucherov (CNRS and U. Marne-la-Vallee)
Michal Kunc (Masaryk U.)
Leonid Libkin (U. of Edinburgh)
Konstantin Makarychev (Microsoft Research)
Kurt Mehlhorn (Max-Planck Inst.)
Georg Moser (U. of Innsbruck)
Alexander Okhotin (U. of Turku)
Giovanni Pighizzini (U. of Milano)
Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
Michel Rigo (U. of Liege)
Nicole Schweikardt (U. of Frankfurt)
Jacobo Toran (U. of Ulm)
Mikhail Volkov (Ural Federal U.)
Carsten Witt (TU Denmark)
Distinguished opening lecture:
Shafi Goldwasser (MIT)
Invited Speakers:
Mark Braverman (Princeton)
Volker Diekert (Stuttgart)
Martin Grohe (RWTH Aachen)
Benjamin Rossman (National Institute of Informatics, Tokyo)
Alexei Semenov (Moscow)
Igor Walukiewicz (Bordeaux)
Important Dates:
Submission: December 9, 2013
Notification: February 12, 2014
Topics: include, but are not limited to:
algorithms and data structures
algorithms for concurrent and distributed systems, networks
computational complexity
proof complexity
Kolmogorov complexity
combinatorial optimization
constraint solving
cryptography
combinatorics in computer science
automata theory and formal languages
computational models and concepts
database theory
applications of logic to computer science
proof theory
model checking
automated reasoning
deductive methods
Submission:
Authors are invited to submit original (and not previously published)
research. Submissions consist of two parts: the main paper and an appendix
(which might be empty). The main paper must be at most 14 pages in length,
including references. All proofs omitted from the main paper due to space
constraints should be given in the appendix or made accessible through a
reliable link to a freely available electronic preprint. The papers must
be submitted in English, in the LNCS format (LaTeX, as pdf; final version
with source) with page numbering turned on using the \pagestyle{plain}
command; instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented
at the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2014
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
Conference co-Chairs:
Nikolay Vereshchagin (Moscow)
Edward A. Hirsch (St.Petersburg)
Sergei O. Kuznetsov (Moscow)
Organized by
Moscow Center for Continuous Mathematical Education
National Research University Higher School of Economics
Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences
Sponsored by
Yandex
National Research University Higher School of Economics
Russian Foundation for Basic Research
Further information and contacts:
Web: http://logic.pdmi.ras.ru/csr2014
Email: csr2014 "at" googlegroups.com
UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
**********************************************************
*
* 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/
*
**********************************************************
Saturday, November 23, 2013
Postdoc positions in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for two postdoctoral positions in theoretical computer science.
KTH is the leading technical university in Sweden. The Theory Group at KTH
(http://www.csc.kth.se/tcs/) offers a strong research environment covering
a wide range of research topics such as complexity theory and
approximation algorithms, computer and network security, cryptography,
formal methods and natural language processing. The group has a consistent
track record of publishing in the leading theoretical computer science
conferences and journals worldwide, and the research conducted here has
attracted numerous international awards and grants in recent years. We are
now set to expand further, and these positions are just two of several new
openings.
The postdoctoral researchers will be working in the research group of
Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of
this group revolve around the themes of proof complexity and SAT solving.
However, these areas have also turned out to have deep, and sometimes
surprising, connections to other topics such as, e.g., circuit complexity,
communication complexity, and hardness of approximation, and therefore
researchers in these or other related areas are more than welcome to
apply.
The research project is financed by a Breakthrough Research Grant from the
Swedish Research Council and a Starting Independent Researcher Grant from
the European Research Council. In addition to the project leader, the
group currently consists of one postdoc and two PhD students. Travel
funding is included, and the group also receives short-term and long-term
visitors on a regular basis.
These are full-time employed positions for one year with a possible
one-year extension. The successful candidates are expected to start in
August-September 2014, although this is to some extent negotiable.
The application deadline is December 15, 2013. More information and
instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0712-Eng.php . Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
for two postdoctoral positions in theoretical computer science.
KTH is the leading technical university in Sweden. The Theory Group at KTH
(http://www.csc.kth.se/tcs/) offers a strong research environment covering
a wide range of research topics such as complexity theory and
approximation algorithms, computer and network security, cryptography,
formal methods and natural language processing. The group has a consistent
track record of publishing in the leading theoretical computer science
conferences and journals worldwide, and the research conducted here has
attracted numerous international awards and grants in recent years. We are
now set to expand further, and these positions are just two of several new
openings.
The postdoctoral researchers will be working in the research group of
Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of
this group revolve around the themes of proof complexity and SAT solving.
However, these areas have also turned out to have deep, and sometimes
surprising, connections to other topics such as, e.g., circuit complexity,
communication complexity, and hardness of approximation, and therefore
researchers in these or other related areas are more than welcome to
apply.
The research project is financed by a Breakthrough Research Grant from the
Swedish Research Council and a Starting Independent Researcher Grant from
the European Research Council. In addition to the project leader, the
group currently consists of one postdoc and two PhD students. Travel
funding is included, and the group also receives short-term and long-term
visitors on a regular basis.
These are full-time employed positions for one year with a possible
one-year extension. The successful candidates are expected to start in
August-September 2014, although this is to some extent negotiable.
The application deadline is December 15, 2013. More information and
instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0712-Eng.php . Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
PhD position in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for a PhD position in theoretical computer science.
KTH Royal Institute of Technology is the leading technical university in
Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a
strong research environment covering a wide range of research topics such
as complexity theory and approximation algorithms, computer and network
security, cryptography, formal methods and natural language processing.
The group has a consistent track record of publishing in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years. We are now set to expand further, and this
position is just one of several new openings.
Proving formulas in propositional logic is a problem of immense importance
both theoretically and practically. This computational task is widely
believed to be intractable in the worst case, although proving (or
disproving) this is a major open problem in theoretical computer science
and mathematics. (This is one of the famous million dollar Millennium
Problems, known as the P vs. NP problem.) In spite of this, today
so-called SAT solvers are routinely used to solve large-scale real-world
problem instances with millions of variables. The intriguing question of
when SAT solvers perform well or badly, and what properties of the
formulas explain this behaviour, remains quite poorly understood.
Proof complexity studies formal systems for reasoning about logic
formulas. This field has deep connections to fundamental questions in
computational complexity, but another important motivation is the
connection to SAT solving. All SAT solvers use some kind of method or
system in which proofs are searched for, and proof complexity analyses the
potential and limitations of such proof systems (and thereby of the
algorithms using them).
Our research aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
We want to understand what makes formulas hard or easy in practice, and to
gain theoretical insights into other crucial but poorly understood issues
in SAT solving. We are also interested in exploring the possibility of
basing SAT solvers on stronger proof systems than are currently being
used. In order to do so, however, a crucial step is to obtain a better
understanding of the corresponding proof systems, and in this context
there are a number of well-known and relatively longstanding open
questions in proof complexity that we want to study and try to resolve.
This research project is led by Jakob Nordstrom
(http://www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research
Grant from the Swedish Research Council and a Starting Independent
Researcher Grant from the European Research Council. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.
This is a four-year full-time employed position, but PhD positions usually
(but not necessarily) include 20% teaching, in which case they are
prolonged for one more year. The successful candidate is expected to start
in August-September 2014, although this is to some extent negotiable.
The application deadline is December 15, 2013. See
http://www.csc.kth.se/~jakobn/openings/D-2013-0620-Eng.php for the full,
formal announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be sent
to Jakob Nordstrom.
for a PhD position in theoretical computer science.
KTH Royal Institute of Technology is the leading technical university in
Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a
strong research environment covering a wide range of research topics such
as complexity theory and approximation algorithms, computer and network
security, cryptography, formal methods and natural language processing.
The group has a consistent track record of publishing in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years. We are now set to expand further, and this
position is just one of several new openings.
Proving formulas in propositional logic is a problem of immense importance
both theoretically and practically. This computational task is widely
believed to be intractable in the worst case, although proving (or
disproving) this is a major open problem in theoretical computer science
and mathematics. (This is one of the famous million dollar Millennium
Problems, known as the P vs. NP problem.) In spite of this, today
so-called SAT solvers are routinely used to solve large-scale real-world
problem instances with millions of variables. The intriguing question of
when SAT solvers perform well or badly, and what properties of the
formulas explain this behaviour, remains quite poorly understood.
Proof complexity studies formal systems for reasoning about logic
formulas. This field has deep connections to fundamental questions in
computational complexity, but another important motivation is the
connection to SAT solving. All SAT solvers use some kind of method or
system in which proofs are searched for, and proof complexity analyses the
potential and limitations of such proof systems (and thereby of the
algorithms using them).
Our research aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
We want to understand what makes formulas hard or easy in practice, and to
gain theoretical insights into other crucial but poorly understood issues
in SAT solving. We are also interested in exploring the possibility of
basing SAT solvers on stronger proof systems than are currently being
used. In order to do so, however, a crucial step is to obtain a better
understanding of the corresponding proof systems, and in this context
there are a number of well-known and relatively longstanding open
questions in proof complexity that we want to study and try to resolve.
This research project is led by Jakob Nordstrom
(http://www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research
Grant from the Swedish Research Council and a Starting Independent
Researcher Grant from the European Research Council. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.
This is a four-year full-time employed position, but PhD positions usually
(but not necessarily) include 20% teaching, in which case they are
prolonged for one more year. The successful candidate is expected to start
in August-September 2014, although this is to some extent negotiable.
The application deadline is December 15, 2013. See
http://www.csc.kth.se/~jakobn/openings/D-2013-0620-Eng.php for the full,
formal announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be sent
to Jakob Nordstrom.
Wednesday, November 20, 2013
[DMANET] CFP: 2014 IEEE CEC Special Session on Theoretical Foundations of Bio-inspired Computation
** Apologies for multiple postings **
CALL FOR PAPERS
CEC 2014 Special Session on
Theoretical Foundations of Bio-inspired Computation
July 6 - 11, 2014, Beijing, China
*** Paper submission deadline: December 20, 2013 ***
Website: http://www.cs.colostate.edu/~sutton/CEC2014/
==========
Motivation
==========
Bio-inspired search heuristics often turn out to be highly successful
for optimization in practice. The theory of these randomized search
heuristics explains the success or the failure of these methods in
practical applications. Theoretical analyses lead to the understanding
of which problems are optimized (or approximated) efficiently by a
given algorithm and which are not.
The benefits of theoretical understanding for practitioners are
threefold.
1. Aiding the algorithm design,
2. guiding the choice of the best algorithm for the problem at
hand,
3. determining the optimal parameter settings.
The theory of evolutionary computation has grown rapidly in recent
years. The primary aim of this special session is to bring together
people working on theoretical aspects of bio-inspired computation. The
latest breakthroughs in the theory of bio-inspired computation will be
reported and new directions will be set.
=====
Scope
=====
Potential authors are invited to submit papers describing original
contributions to foundations of evolutionary computation. Although we
are most interested in theoretical foundations, computational studies
of a foundational nature are also welcome.
The scope of this special session includes (but is not limited to) the
following topics:
* Theoretical foundations of bio-inspired heuristics
* Exact and approximation runtime analysis
* Black box complexity
* Self-adaptation
* Population dynamics
* Fitness landscape and problem difficulty analysis
* No free lunch theorems
* Statistical approaches for understanding the behavior of
bio-inspired heuristics
* Computational studies of a foundational nature
All problem domains will be considered including:
* combinatorial and continuous optimization
* single‐objective and multi‐objective optimization
* constraint handling
* dynamic and stochastic optimization
* co‐evolution and evolutionary learning
================
Paper Submission
================
You should follow the IEEE CEC 2014 submission website at:
http://ieee-cis.org/conferences/cec2014/upload.php
On the submission system you must select "SS4. EC04: Theoretical
Foundations of Bio-inspired Computation" as "Main Research Topic".
Special session papers are treated in the same way as regular
conference papers.
===============
Important Dates
===============
* Paper submissions: December 20, 2013
* Notification of acceptance: March 15, 2014
* Final paper submission: April 15, 2014
=====================
Journal Special Issue
=====================
Papers of the highest quality among those published in this special
session will be selected for invitation to a special issue of the
"Evolutionary Computation" journal published by MIT Press.
==========================
Special Session Organizers
==========================
Pietro S. Oliveto
Department of Computer Science
University of Sheffield
Sheffield, UK
http://staffwww.dcs.shef.ac.uk/people/P.Oliveto/
Andrew M. Sutton
Department of Computer Science
Colorado State University
Fort Collins, CO, USA
http://www.cs.colostate.edu/~sutton/
===================
Programme Committee
===================
Youhei Akimoto
Dirk Arnold
Sandra Astete
Dimo Brockhoff
Tianshi Chen
Francisco Chicano
Kalyanmoy Deb
Benjamin Doerr
Carola Doerr
Tobias Friedrich
Marcus Gallagher
Christian Gießen
Thomas Jansen
Timo Kötzing
Per Kristian Lehre
Andrea Mambrini
Alexander Melkozerov
Alberto Moraglio
Rachael Morgan
Samadhi Nallaperuma
Frank Neumann
Günter Rudolph
Jonathan Shapiro
Dirk Sudholt
Olivier Teytaud
Markus Wagner
Carsten Witt
Xin Yao
Yang Yu
Christine Zarges
----------------------------------------------------------------------
This special session is organized as a part of the IEEE CIS Task Force
on Theoretical Foundations of Bio-inspired Computation
Task Force Website:
http://staffwww.dcs.shef.ac.uk/people/P.Oliveto/CIStheory.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] PhD Position in Operations Research at Maastricht University
4-year PhD Position in Operations Research at Maastricht University
--------------------------------------------------------------------
The Operations Research Group at Maastricht University is seeking
applications for a 4-year PhD position.
The OR group is part of the School of Business and Economics and
currently has six faculty members
who conduct research in the areas of:
* Operations Research
* Algorithmic Game Theory,
* Economic Theory,
* Scheduling,
* Combinatorial Optimization, and
* Approximation and Online Algorithms.
Please see the website of the OR group for more details on its members
and their research interests:
http://www.maastrichtuniversity.nl/web/Faculties/SBE/Theme/Departments/QuantitativeEconomics/Research/OperationsResearch.htm
We encourage candidates with an MSc or Diploma in Mathematics, Computer
Science or
Operations Research to apply. Background in Discrete or Continuous
Optimization, Theoretical Computer
Science, or Economic and Game Theory is a plus but not mandatory.
The position will be hosted by the NWO-funded project
"Optimal Coordination Mechanisms for Distributed Resource Allocation"
under the supervision of Tobias Harks.
The position is full-time with a four year contract (starting salary
EUR2042 according to the Dutch salary norm).
The deadline to send in applications is December, 15th 2013.
Please send an application (including curriculum vitae, list of
publications, names of two references with their e-mail addresses) to
Tobias Harks (t.harks@maastrichtuniversity.nl).
**********************************************************
*
* 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/
*
**********************************************************
--------------------------------------------------------------------
The Operations Research Group at Maastricht University is seeking
applications for a 4-year PhD position.
The OR group is part of the School of Business and Economics and
currently has six faculty members
who conduct research in the areas of:
* Operations Research
* Algorithmic Game Theory,
* Economic Theory,
* Scheduling,
* Combinatorial Optimization, and
* Approximation and Online Algorithms.
Please see the website of the OR group for more details on its members
and their research interests:
http://www.maastrichtuniversity.nl/web/Faculties/SBE/Theme/Departments/QuantitativeEconomics/Research/OperationsResearch.htm
We encourage candidates with an MSc or Diploma in Mathematics, Computer
Science or
Operations Research to apply. Background in Discrete or Continuous
Optimization, Theoretical Computer
Science, or Economic and Game Theory is a plus but not mandatory.
The position will be hosted by the NWO-funded project
"Optimal Coordination Mechanisms for Distributed Resource Allocation"
under the supervision of Tobias Harks.
The position is full-time with a four year contract (starting salary
EUR2042 according to the Dutch salary norm).
The deadline to send in applications is December, 15th 2013.
Please send an application (including curriculum vitae, list of
publications, names of two references with their e-mail addresses) to
Tobias Harks (t.harks@maastrichtuniversity.nl).
**********************************************************
*
* 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/
*
**********************************************************
Tuesday, November 19, 2013
Position in Operations Research and Statistics at MIT
FACULTY POSITION IN
OPERATIONS RESEARCH AND STATISTICS
Massachusetts Institute of Technology
MIT Sloan School of Management
100 Main Street
Cambridge, Massachusetts 02142
________________________________________________
The MIT Sloan School of Management invites applications for a tenure-track faculty position in the area of Operations Research and Statistics beginning July, 2014 or as soon thereafter as possible. Strong applicants will demonstrate the potential for research and for teaching excellence in the area of Operations Research, Statistics, Analytics or Data Sciences; duties will include teaching undergraduate and graduate level courses in the areas listed above. We are especially interested in candidates who can build a strong methodological research base, contribute to application areas of high impact, and be a successful teacher for the undergraduate, MBA, and PhD programs.
Applicants should possess or be close to completion of a PhD in relevant fields by start of employment. Applications must include an up-to-date curriculum vitae; three letters of recommendation; a personal statement describing research and teaching experience, if any, and aspirations in research and education; papers, if available. Please submit your application by December 1, 2013 at http://sloanfacultysearches.mit.edu/or-stat/ .
MIT is an equal opportunity employer committed to building a culturally diverse intellectual community and strongly encourages applications from women and minorities.
[DMANET] CLAIO Monterrey 2014
I will appreciate the distribution of this message.
Thank you.
Roger
--
---------- Forwarded message ----------
=================================================
CLAIO XVII / CSMIO III
Joint ALIO/SMIO Conference
Monterrey, Mexico
6-10 October 2014
http://pisis.fime.uanl.mx/claio2014/
=================================================
PRELIMINARY CALL FOR PAPERS
We invite members of the Latin-Iberian-American Association of
Operations Research (ALIO) and the worldwide Operational
Research (OR) community to take part in the
XVII Latin-Iberian-American Conference on Operations Research
held jointly with the III Conference of the Mexican Society of
Operations Research (CLAIO/CSMIO 2014) in Monterrey, Mexico,
October 6-10, 2014. The academic program will consist of parallel,
technical and special sessions, plenary talks and tutorials
covering several aspects of OR.
PAPER / ABSTRACT SUBMISSION
To participate, a 200-word abstract must be submitted. Additionally,
an 8-page paper going through a review process may be submitted.
Papers and abstracts may be written in Spanish, English, or
Portuguese, the three official languages of CLAIO. Accepted papers
of registered authors will be published in the conference proceedings
CD-ROM with an ISBN. All accepted abstracts will be published in
the conference book of abstracts.
A post-conference special issue of "Annals of Operations Research"
devoted to the best works of the conference will be published.
See details in the conference web site.
IMPORTANT DATES
01/Jan/2014 Paper/abstract submission begins.
01/Mar/2014 Paper submission deadline.
01/May/2014 Abstract submission deadline.
15/May/2014 Paper acceptance/rejection notification.
01/Jun/2014 Abstract acceptance/rejection notification.
15/Jun/2014 Camera-ready paper deadline.
CONFIRMED PLENARY SPEAKERS
Carlos Coello Coello, CINVESTAV-IPN, Mexico
Elena Fernandez, Universitat Politecnica de Catalunya, Spain
Hector Cancela, Universidad de La Republica, Uruguay
Jonathan F. Bard, U. of Texas at Austin, USA
COMMITTEES
Conference Chairs: Jose Luis Gonzalez-Velarde (Tecnologico de Monterrey)
and Roger Z. Rios (UANL)
Program Committee Chair: Manuel Laguna (U. of Colorado)
Organizing Committee: Ada Alvarez (UANL), Angelica Salazar (UANL),
Fernando Camacho (UANL), Iris Martinez (UANL), Maria Temblador (Tecnologico
de Monterrey), Romeo Sanchez (UANL), Tomas Snchez (Tecnologico de Monterrey),
Yajaira Cardona (Tecnologico de Monterrey), Yasmin Rios (UANL)
See you in Monterrey!!!!
_______________________________________________
Optimization-society mailing list
Optimization-society@list.informs.org
http://list.informs.org/mailman/listinfo/optimization-society
**********************************************************
*
* 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/
*
**********************************************************
Thank you.
Roger
--
---------- Forwarded message ----------
=================================================
CLAIO XVII / CSMIO III
Joint ALIO/SMIO Conference
Monterrey, Mexico
6-10 October 2014
http://pisis.fime.uanl.mx/claio2014/
=================================================
PRELIMINARY CALL FOR PAPERS
We invite members of the Latin-Iberian-American Association of
Operations Research (ALIO) and the worldwide Operational
Research (OR) community to take part in the
XVII Latin-Iberian-American Conference on Operations Research
held jointly with the III Conference of the Mexican Society of
Operations Research (CLAIO/CSMIO 2014) in Monterrey, Mexico,
October 6-10, 2014. The academic program will consist of parallel,
technical and special sessions, plenary talks and tutorials
covering several aspects of OR.
PAPER / ABSTRACT SUBMISSION
To participate, a 200-word abstract must be submitted. Additionally,
an 8-page paper going through a review process may be submitted.
Papers and abstracts may be written in Spanish, English, or
Portuguese, the three official languages of CLAIO. Accepted papers
of registered authors will be published in the conference proceedings
CD-ROM with an ISBN. All accepted abstracts will be published in
the conference book of abstracts.
A post-conference special issue of "Annals of Operations Research"
devoted to the best works of the conference will be published.
See details in the conference web site.
IMPORTANT DATES
01/Jan/2014 Paper/abstract submission begins.
01/Mar/2014 Paper submission deadline.
01/May/2014 Abstract submission deadline.
15/May/2014 Paper acceptance/rejection notification.
01/Jun/2014 Abstract acceptance/rejection notification.
15/Jun/2014 Camera-ready paper deadline.
CONFIRMED PLENARY SPEAKERS
Carlos Coello Coello, CINVESTAV-IPN, Mexico
Elena Fernandez, Universitat Politecnica de Catalunya, Spain
Hector Cancela, Universidad de La Republica, Uruguay
Jonathan F. Bard, U. of Texas at Austin, USA
COMMITTEES
Conference Chairs: Jose Luis Gonzalez-Velarde (Tecnologico de Monterrey)
and Roger Z. Rios (UANL)
Program Committee Chair: Manuel Laguna (U. of Colorado)
Organizing Committee: Ada Alvarez (UANL), Angelica Salazar (UANL),
Fernando Camacho (UANL), Iris Martinez (UANL), Maria Temblador (Tecnologico
de Monterrey), Romeo Sanchez (UANL), Tomas Snchez (Tecnologico de Monterrey),
Yajaira Cardona (Tecnologico de Monterrey), Yasmin Rios (UANL)
See you in Monterrey!!!!
_______________________________________________
Optimization-society mailing list
Optimization-society@list.informs.org
http://list.informs.org/mailman/listinfo/optimization-society
**********************************************************
*
* 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] PhD and Postdoc at University of Innsbruck
Within the FWF project "Automated Complexity Analysis via
Transformations (ACAT)"
a PhD position (3 years) and
a postdoctoral research position (2 years)
are available. Both positions are potentially extendable.
The project is hosted at the Computational Logic group of the
Institute of Computer Science, University of Innsbruck,
Austria. Candidates for the postdoctoral position are required to hold
a PhD degree. A strong background in key areas of the ACAT project is
an asset: program transformation, program analysis, runtime complexity
analysis, etc.
Candidates are expected to contribute to research within the project.
Knowledge of German is not required. We follow the remuneration
scheme of the Austrian Science Fund: approximately EUR 47.000,—
(gross) per year for the postdoc and EUR 27.000,— (gross) for the
doctoral candidate.
Applications (including CV, publication list, and two references) may
be sent by email, to
georg.moser@uibk.ac.at
no later than November 30, 2013. Informal inquiries are also welcome at
the same email address.
Further information is available from the following links:
*) Project ACAT:
http://cl-informatik.uibk.ac.at/research/projects/automated-complexity-analysis-via-transformations/
*) Institute of Computer Science:
http://informatik.uibk.ac.at/
*) University of Innsbruck:
http://www.uibk.ac.at/
**********************************************************
*
* 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/
*
**********************************************************
Transformations (ACAT)"
a PhD position (3 years) and
a postdoctoral research position (2 years)
are available. Both positions are potentially extendable.
The project is hosted at the Computational Logic group of the
Institute of Computer Science, University of Innsbruck,
Austria. Candidates for the postdoctoral position are required to hold
a PhD degree. A strong background in key areas of the ACAT project is
an asset: program transformation, program analysis, runtime complexity
analysis, etc.
Candidates are expected to contribute to research within the project.
Knowledge of German is not required. We follow the remuneration
scheme of the Austrian Science Fund: approximately EUR 47.000,—
(gross) per year for the postdoc and EUR 27.000,— (gross) for the
doctoral candidate.
Applications (including CV, publication list, and two references) may
be sent by email, to
georg.moser@uibk.ac.at
no later than November 30, 2013. Informal inquiries are also welcome at
the same email address.
Further information is available from the following links:
*) Project ACAT:
http://cl-informatik.uibk.ac.at/research/projects/automated-complexity-analysis-via-transformations/
*) Institute of Computer Science:
http://informatik.uibk.ac.at/
*) University of Innsbruck:
http://www.uibk.ac.at/
**********************************************************
*
* 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] [IJRIE]-Call for paper (Vol. 3, No. 1, 2014)
Call for Paper
Greetings and call for paper for Vol. 3, No.1.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 3, Number 1, March 2014.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Sincerely,
IJRIE Office,
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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/
*
**********************************************************
Greetings and call for paper for Vol. 3, No.1.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 3, Number 1, March 2014.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Sincerely,
IJRIE Office,
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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: Special session "Evolutionary Computation in Combinatorial Optimization" at WCCI'2014
-----------------------------------------------
Call for Paper
Special Session on
/*Evolutionary Computation in Combinatorial Optimization*/ http://www.cs.nott.ac.uk/~rxq/CEC2014ECCO.htm
at 2014 IEEE Congress on Evolutionary Computation (CEC'2014), WCCI'2014
-----------------------------------------------
This special session aims to bring together state-of-the-art research on evolutionary computation in a wide range of combinatorial optimization problems. Examples of computational algorithms include ant colony systems, artificial immune systems, cultural algorithms, evolutionary strategies, genetic algorithms, genetic programming, evolutionary based hyper-heuristics, memetic algorithms, path relinking, particle swarm optimization and scatter search, etc.
Topics of applications include but not limited to:
- 2D/3D strip packing and bin packing
- assignment problem
- cutting stock
- scheduling, dynamic scheduling and rescheduling
- educational timetabling
- grid scheduling
- knapsack problems
- multi-objective scheduling
- network routing
- personnel scheduling
- portfolio optimisation
- production scheduling
- project scheduling
- recourse allocation
- space allocation
- sports timetabling
- transport scheduling
- and many more
/*Important Dates*/
Paper Submission: 20 December 2013
Decision Notification: 15 March 2014
Camera-Ready Submission: 15 April 2014
/*Paper submission*/
Please follow the IEEE CEC/WCCI 2014 Submission Web Site. Please select the corresponding special session name ("Evolutionary Computation in Combinatorial Optimisation") as the "main research topic" in submission. Special session papers are included as regular conference papers.
/*Organizers*/
Rong Qu
School of Computer Science
University of Nottingham, Nottingham, NG8 1BB, UK
Email: rxq@cs.nott.ac.uk
A. Sima Uyar
Computer Engineering Department
Istanbul Technical University, Istanbul, Turkey
Email: etaner@itu.edu.tr
Michel Toulouse
Department of computer science
Oklahoma State University, Oklahoma, USA
Email: michel.toulouse@cirrelt.ca
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/
*
**********************************************************
Call for Paper
Special Session on
/*Evolutionary Computation in Combinatorial Optimization*/ http://www.cs.nott.ac.uk/~rxq/CEC2014ECCO.htm
at 2014 IEEE Congress on Evolutionary Computation (CEC'2014), WCCI'2014
-----------------------------------------------
This special session aims to bring together state-of-the-art research on evolutionary computation in a wide range of combinatorial optimization problems. Examples of computational algorithms include ant colony systems, artificial immune systems, cultural algorithms, evolutionary strategies, genetic algorithms, genetic programming, evolutionary based hyper-heuristics, memetic algorithms, path relinking, particle swarm optimization and scatter search, etc.
Topics of applications include but not limited to:
- 2D/3D strip packing and bin packing
- assignment problem
- cutting stock
- scheduling, dynamic scheduling and rescheduling
- educational timetabling
- grid scheduling
- knapsack problems
- multi-objective scheduling
- network routing
- personnel scheduling
- portfolio optimisation
- production scheduling
- project scheduling
- recourse allocation
- space allocation
- sports timetabling
- transport scheduling
- and many more
/*Important Dates*/
Paper Submission: 20 December 2013
Decision Notification: 15 March 2014
Camera-Ready Submission: 15 April 2014
/*Paper submission*/
Please follow the IEEE CEC/WCCI 2014 Submission Web Site. Please select the corresponding special session name ("Evolutionary Computation in Combinatorial Optimisation") as the "main research topic" in submission. Special session papers are included as regular conference papers.
/*Organizers*/
Rong Qu
School of Computer Science
University of Nottingham, Nottingham, NG8 1BB, UK
Email: rxq@cs.nott.ac.uk
A. Sima Uyar
Computer Engineering Department
Istanbul Technical University, Istanbul, Turkey
Email: etaner@itu.edu.tr
Michel Toulouse
Department of computer science
Oklahoma State University, Oklahoma, USA
Email: michel.toulouse@cirrelt.ca
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] Travel Grants + Early Registration: NSF Workshop on Self-Organizing Particle Systems (with SODA'14)
Travel grant deadline:
Nov 22, 2013
Early registration (and hotel) deadline:
December 2, 2013
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from the
theory and practice of self-organizing physical and biological systems in
order to report on recent advances in this area and to identify directions
for interdisciplinary research that may help shape the future of the field.
The one-day meeting will consist of several invited talks and discussion
sessions around four major research areas, namely
- amorphous computing,
- self-organizing robotic systems,
- self-organizing biological systems, and
- self-assembling DNA
Invited speakers:
Bernard Chazelle (Princeton U.) Nikolaus Correll (U. Colorado Boulder)
Eric Klavins (U. of Washington) John Reif (Duke University)
Andrea Richa (Arizona State U.) Rebecca Schulman (Johns Hopkins U.)
Erik Winfree (Caltech) Mark Yim (U. Pennsylvania)
Organizers:
Andrea W. Richa Arizona State University, USA
Christian Scheideler University of Paderborn, Germany
For more information, including the workshop program, please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities.
Application deadline: November 22, 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/
*
**********************************************************
Nov 22, 2013
Early registration (and hotel) deadline:
December 2, 2013
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from the
theory and practice of self-organizing physical and biological systems in
order to report on recent advances in this area and to identify directions
for interdisciplinary research that may help shape the future of the field.
The one-day meeting will consist of several invited talks and discussion
sessions around four major research areas, namely
- amorphous computing,
- self-organizing robotic systems,
- self-organizing biological systems, and
- self-assembling DNA
Invited speakers:
Bernard Chazelle (Princeton U.) Nikolaus Correll (U. Colorado Boulder)
Eric Klavins (U. of Washington) John Reif (Duke University)
Andrea Richa (Arizona State U.) Rebecca Schulman (Johns Hopkins U.)
Erik Winfree (Caltech) Mark Yim (U. Pennsylvania)
Organizers:
Andrea W. Richa Arizona State University, USA
Christian Scheideler University of Paderborn, Germany
For more information, including the workshop program, please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities.
Application deadline: November 22, 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/
*
**********************************************************
Monday, November 18, 2013
Optimization Faculty Positions at the University of Wisconsin-Madison
The Wisconsin Institute for Discovery (WID) at the University of Wisconsin-Madison (www.wid.wisc.edu) invites applications for faculty openings in Optimization and its Applications. The WID optimization theme (www.wid.wisc.edu/research/optimization) aims to develop and apply optimization technology to systems-level problems emerging in science and engineering applications in an interdisciplinary, integrative, and collaborative fashion. Collaborations with domain scientists will be a focus. Our interests encompass (but are not limited to): (i) Development of core optimization technology and large scale computational methodology; (ii) Planning techniques within application domains that exploit unfolding understanding of the physical system; (iii) Applications of simulation and stochastic optimization (iv) Use of optimization and statistical methods to understand and predict systems phenomena, even when competition exists between entities; (v) Sparse optimization and image reconstruction leveraging compressed sensing frameworks, optimization algorithms, and powerful computational platforms.
Multiple opportunities are available at the Assistant, Associate or Full Professor level. Successful candidates will occupy a new state-of-the-art and centrally located WID research facility specifically designed to spark and support cross-disciplinary collaborations. WID is the public half of an exciting public-private pair of Institutes that will promote basic research and facilitate the translation of new discoveries to practice.
The candidate will be appointed to the department of the University that most appropriately matches experience and interests. The candidate will be expected to develop a vigorous, independent research program; attract and maintain extramural funding for their research program; teach undergraduate and/or graduate courses; develop new course(s) in their area of expertise as appropriate; supervise graduate and postgraduate research; participate in faculty governance activities in the department, college and/or University; and actively engage with the national and international scientific community.
Application process
To ensure full consideration, applications must be received by January 31, 2014. Applicants must submit a cover letter, curriculum vitae, teaching statement, and a statement of current and future research plans related to optimization and its applications. The full application, submitted as separate PDFs, should not exceed 10 pages and must be submitted through the application website: http://apply.interfolio.com/23871. In addition, three reference letters from persons knowledgeable with the applicant's research, leadership and/or teaching abilities must be separately supplied through the application website. A criminal background check is required prior to employment.If you have questions, please email Herman Stampfli at hstampfli@wisc.edu .
Required degree and area of specialization
Ph.D. in a field relevant to Optimization and its Applications.Minimum number of years and type of relevant work experience
Post-doctoral research experience and teaching experience preferred but not required. Senior applicants must have demonstrated excellence in research, teaching, and service, and must possess experience and scholarly credentials suitable for appointment with tenure at the University of Wisconsin-Madison.Additional Information
The University of Wisconsin-Madison is a world-class academic institution with an international reputation for basic, applied and cross-disciplinary research. It attracts scholars and students at all levels from around the world. Nationally, UW-Madison ranks fourth among all U.S. universities for research and development expenditures, exceeding $950 million annually. The University has a deep culture of collaborative interdisciplinary research, reflected recently by major grants such as the $150 million DOE Great Lakes Bioenergy Research Center award (2007) and the $50 million NIH Translational Medicine award (2007). Interdisciplinary and translational centers that are positioning UW at the forefront of collaborative research include the Microbial Sciences Building (2007), the School of Medicine and Public Health's Interdisciplinary Research Complex (2008), and the Wisconsin Institutes for Discovery (2010).Jim Luedtke, Assistant Professor
Secretary/Treasurer, INFORMS Optimization Society
Dept. of Industrial and Systems Engineering
University of Wisconsin-Madison
3236 Mechanical Engineering Building
1513 University Avenue, Madison, WI 53706
[DMANET] Call for nominations for EATCS Fellows 2014
The EATCS Fellows Programme was established by the Association to recognise outstanding EATCS Members for their scientific achievements in the field of Theoretical Computer Science. The Fellow status is conferred by the EATCS Fellows-Selection Committee upon a person having a track record of intellectual and organisational leadership within the EATCS community. Fellows are expected to be "model citizens" of the TCS community, helping to develop the standing of TCS beyond the frontiers of the community.
In order to be considered by the EATCS Fellows-Selection Committee, candidates must be nominated by at least four EATCS Members. Please verify your membership at http://www.eatcs.org/.
The EATCS Fellows-Selection Committee consists of
- Rocco De Nicola (IMT Lucca, Italy)
- Paul Goldberg (Oxford, UK)
- Anca Muscholl (Bordeaux, France, chair)
- Dorothea Wagner (Karlsruhe, Germany)
- Roger Wattenhofer (ETH Zurich, CH)
INSTRUCTIONS:
A nomination should consist of answers to the questions below. It can be co-signed by several EATCS members. At least two nomination letters per candidate are recommended. If you are supporting the nomination from within the candidate's field of expertise, it is expected that you will be specific about the individual's technical contributions.
To be considered, nominations for 2014 must be received by December 31, 2013.
1. Name of candidate; candidate's current affiliation and position candidate's email address, postal address and phone number; nominator(s) relationship to the candidate;
2. Short summary of candidate's accomplishments (citation - 25 words or less);
3. Candidate's accomplishments: identify the most important contributions that qualify the candidate for the rank of EATCS Fellow according to the following two categories:
A) Technical achievements;
B) Outstanding service to the TCS community.
Please limit your comments to at most three pages.
4. Nominator(s): name(s), affiliation(s), email and postal address(es), phone number(s).
Submit by email to the EATCS Secretary (secretary@eatcs.org). The subject line of the email should read "EATCS Fellow Nomination - <surname of candidate>".
**********************************************************
*
* 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/
*
**********************************************************
In order to be considered by the EATCS Fellows-Selection Committee, candidates must be nominated by at least four EATCS Members. Please verify your membership at http://www.eatcs.org/.
The EATCS Fellows-Selection Committee consists of
- Rocco De Nicola (IMT Lucca, Italy)
- Paul Goldberg (Oxford, UK)
- Anca Muscholl (Bordeaux, France, chair)
- Dorothea Wagner (Karlsruhe, Germany)
- Roger Wattenhofer (ETH Zurich, CH)
INSTRUCTIONS:
A nomination should consist of answers to the questions below. It can be co-signed by several EATCS members. At least two nomination letters per candidate are recommended. If you are supporting the nomination from within the candidate's field of expertise, it is expected that you will be specific about the individual's technical contributions.
To be considered, nominations for 2014 must be received by December 31, 2013.
1. Name of candidate; candidate's current affiliation and position candidate's email address, postal address and phone number; nominator(s) relationship to the candidate;
2. Short summary of candidate's accomplishments (citation - 25 words or less);
3. Candidate's accomplishments: identify the most important contributions that qualify the candidate for the rank of EATCS Fellow according to the following two categories:
A) Technical achievements;
B) Outstanding service to the TCS community.
Please limit your comments to at most three pages.
4. Nominator(s): name(s), affiliation(s), email and postal address(es), phone number(s).
Submit by email to the EATCS Secretary (secretary@eatcs.org). The subject line of the email should read "EATCS Fellow Nomination - <surname of candidate>".
**********************************************************
*
* 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/
*
**********************************************************
Sunday, November 17, 2013
Postdoctoral Fellowships at Caltech CMI
Caltech's Center for the Mathematics of Information (CMI, http://www.cmi.caltech.edu/index.shtml) announces openings in the CMI Postdoctoral Fellowship Program, starting in fall 2014. The CMI is dedicated to fundamental mathematical research with an eye to the roles of information and computation throughout science and engineering. Areas of interest include algorithms, complexity, algorithmic game theory, applied combinatorics, applied probability, statistics, machine learning, information and coding theory, control, optimization, networked systems, geometry processing, multi-resolution methods, and molecular programming.
Please apply and have three reference letters sent directly as instructed at https://applications.caltech.edu/job/cmi . All candidate materials are due by Friday, December 20, 2013 and reference letters are due by Monday, December 23, 2013.
Positions are contingent upon completion of the PhD. Caltech is an affirmative action/equal opportunity employer; women, minorities, veterans, and disabled persons are encouraged to apply.
Please apply and have three reference letters sent directly as instructed at https://applications.caltech.edu/job/cmi . All candidate materials are due by Friday, December 20, 2013 and reference letters are due by Monday, December 23, 2013.
Positions are contingent upon completion of the PhD. Caltech is an affirmative action/equal opportunity employer; women, minorities, veterans, and disabled persons are encouraged to apply.
Saturday, November 16, 2013
[DMANET] IV EURO WG CBBM Conference: 2nd Call for Papers
======================================================
| IV EURO WG Conference on Operational Research in |
| Computational Biology, Bioinformatics and Medicine |
======================================================
Second Call for Abstracts
The organizers of the 4th EURO Working Group Conference on Operational
Research in Computational Biology, Bioinformatics and Medicine have a
pleasure to invite you to take part in this conference to be held in
Poznan, Poland, June 26-28, 2014.
ABSTRACT SUBMISSION IS OPEN!
Visit the conference site to submit your abstract:
http://cbbm2014.cs.put.poznan.pl.
Aims and Scope of the conference
The objective of EURO CBBM is to bring together researchers developing and
using computational methods to solve problems in computational biology,
bioinformatics and medicine. The conference intends to be an effective
forum for the exchange of ideas and discussion of current research issues
and future trends in the above area.
Topics include, but are not limited to:
-biomolecular sequence analysis,
-comparative genomics,
-metabolic network modeling and analysis,
-modeling and prediction of gene patterns,
-microarray informatics,
-protein and RNA structure prediction,
-protein interactions,
-genetic networks,
-analysis of genetic variations,
-systems biology,
-gene classification,
-docking and drug design,
-phylogenetics
-and others
Confirmed Invited Speakers
prof. Marek Figlerowicz (Inst.of Bioorganic Chemistry, PAS, Poland)
prof. Giuseppe Lancia (University of Udine, Italy)
prof. Eric Westhof (Centre National de la Recherche Scientifique, France)
Conference site
The conference will be hosted in the 130-year-old neo-renaissance
Biedrusko Palace (Poznan-Biedrusko, Poland).
Abstract submission
Abstracts must be written in English and contain no more than 600
characters (no formulae or mathematical notations are allowed). Each
attendee is allowed to present one paper at the conference. To submit an
abstract, use the abstract submission system of EURO-Online available from
the conference website http://cbbm2014.cs.put.poznan.pl.
Important dates
Deadline for abstract submission: 15/02/2014
Notification of acceptance: 01/03/2014
Deadline for early registration: 15/03/2014
Special issue
Selected conference papers can be submitted for peer-reviewed publication
in the Special Issue of RAIRO - Operations Research or Foundations of
Computing and Decision Sciences.
Program Committee Organizing Committee
- Jacek Blazewicz (co-chair) - Piotr Lukasiak (co-chair)
- Metin Turkay (co-chair) - Marta Szachniuk (co-chair)
- Paola Bertolazzi - Marcin Borowski
- Giovanni Felici - Chandra Sekhar Pedamallu
- Piotr Formanowicz - Tomasz Ratajczak
- Jon Garibaldi - Aleksandra Swiercz
- Marta Kasprzak - Pawel Wojciechowski
- Piotr Lukasiak - Tomasz Zok
- Ceyda Oguz
- Marta Szachniuk
- Gerhard Wilhelm Weber
Contact
For all questions please contact: cbbm2014@cs.put.poznan.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/
*
**********************************************************
| IV EURO WG Conference on Operational Research in |
| Computational Biology, Bioinformatics and Medicine |
======================================================
Second Call for Abstracts
The organizers of the 4th EURO Working Group Conference on Operational
Research in Computational Biology, Bioinformatics and Medicine have a
pleasure to invite you to take part in this conference to be held in
Poznan, Poland, June 26-28, 2014.
ABSTRACT SUBMISSION IS OPEN!
Visit the conference site to submit your abstract:
http://cbbm2014.cs.put.poznan.pl.
Aims and Scope of the conference
The objective of EURO CBBM is to bring together researchers developing and
using computational methods to solve problems in computational biology,
bioinformatics and medicine. The conference intends to be an effective
forum for the exchange of ideas and discussion of current research issues
and future trends in the above area.
Topics include, but are not limited to:
-biomolecular sequence analysis,
-comparative genomics,
-metabolic network modeling and analysis,
-modeling and prediction of gene patterns,
-microarray informatics,
-protein and RNA structure prediction,
-protein interactions,
-genetic networks,
-analysis of genetic variations,
-systems biology,
-gene classification,
-docking and drug design,
-phylogenetics
-and others
Confirmed Invited Speakers
prof. Marek Figlerowicz (Inst.of Bioorganic Chemistry, PAS, Poland)
prof. Giuseppe Lancia (University of Udine, Italy)
prof. Eric Westhof (Centre National de la Recherche Scientifique, France)
Conference site
The conference will be hosted in the 130-year-old neo-renaissance
Biedrusko Palace (Poznan-Biedrusko, Poland).
Abstract submission
Abstracts must be written in English and contain no more than 600
characters (no formulae or mathematical notations are allowed). Each
attendee is allowed to present one paper at the conference. To submit an
abstract, use the abstract submission system of EURO-Online available from
the conference website http://cbbm2014.cs.put.poznan.pl.
Important dates
Deadline for abstract submission: 15/02/2014
Notification of acceptance: 01/03/2014
Deadline for early registration: 15/03/2014
Special issue
Selected conference papers can be submitted for peer-reviewed publication
in the Special Issue of RAIRO - Operations Research or Foundations of
Computing and Decision Sciences.
Program Committee Organizing Committee
- Jacek Blazewicz (co-chair) - Piotr Lukasiak (co-chair)
- Metin Turkay (co-chair) - Marta Szachniuk (co-chair)
- Paola Bertolazzi - Marcin Borowski
- Giovanni Felici - Chandra Sekhar Pedamallu
- Piotr Formanowicz - Tomasz Ratajczak
- Jon Garibaldi - Aleksandra Swiercz
- Marta Kasprzak - Pawel Wojciechowski
- Piotr Lukasiak - Tomasz Zok
- Ceyda Oguz
- Marta Szachniuk
- Gerhard Wilhelm Weber
Contact
For all questions please contact: cbbm2014@cs.put.poznan.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/
*
**********************************************************
Friday, November 15, 2013
[DMANET] PhD student position at KIT (parallel algorithm engineering)
You love algorithms, their analysis and efficient implementation? You
are about to graduate with an excellent Master's degree and are looking
for a PhD position? Then please read on:
are about to graduate with an excellent Master's degree and are looking
for a PhD position? Then please read on:
The group "Theoretical Computer Science / Parallel Computing" at the
Department of Informatics of Karlsruhe Institute of Technology (Germany)
is inviting applications for the position of a
PhD Student / Research Assistant (m/f) (pay grade 13 TV-L)
starting in February 2014 or later. This full-time position has
currently funding for three years. An initial restriction to a one-year
contract may be necessary.
Working Area:
In the focus of this position are research projects in parallel
algorithm engineering. The research group is primarily concerned with
the development of practical sequential and parallel algorithms for
problems from graph theory, network science, and combinatorial
scientific computing. Examples are the analysis of large static and
dynamic networks and the acceleration of scientific simulations by
combinatorial methods.
Further responsibilities as part of the position include the supervision
of bachelor and master students and possibly TA duties. That is why at
least basic knowledge of German is desirable.
Requirements:
- Very good university degree (Master or equivalent) in computer science
or a related field
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis and/or relevant courses);
knowledge in combinatorial algorithms and linear algebra is particularly
desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming is a plus, but no requirement
KIT offers excellent conditions for undergraduate, graduate, and PhD
students. Its computer science department is one of the largest in
Germany. KIT is pursuing a gender equality policy. We would therefore
particularly encourage qualified women to apply. If qualified,
handicapped applicants will be preferred.
Please send your application documents (cover letter, CV, copies of
certificates and the contact information of two references) to the
address below. To receive full consideration, submit the documents by
December 8, 2013 to:
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics
Juniorprof. Dr. Henning Meyerhenke
Am Fasanengarten 5
D-76131 Karlsruhe
Germany
Email: meyerhenke@kit.edu
**********************************************************
*
* 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: Diagrams 2014 (workshop proposals due in one week)
Dear colleague, apologies if you receive multiple copies of this
message. Please note that workshop proposals for Diagrams 2014 are due
in one week's time.
-----------------------------------------
Call for Papers: Diagrams 2014
Eighth International Conference on the Theory and Application of Diagrams
http://www.diagrams-conference.org/2014
diagrams2014@diagrams-conference.org
28th July to 1st August
Swinburne University, Melbourne, Australia
* CALL FOR PAPERS *
Diagrams is an international interdisciplinary conference series,
covering all aspects of research on the theory and application of
diagrams. In 2014 it will be held at Swinburne University, Melbourne,
Australia, from the 28th of July 2014 to the 1st of August 2014.
Diagrams 2014 will be co-located with the IEEE Symposium on Visual
Languages and Human-Centric Computing.
Diagrams is the only conference series that provides a united forum
for all areas that are concerned with the study of diagrams, including
architecture, artificial intelligence, biology, cartography, cognitive
science, computer science, education, graphic design, history of
science, human-computer interaction, linguistics, logic, mathematics,
philosophy, psychology, and software modelling. The conference attracts
a large number of researchers from almost all these related fields,
positioning Diagrams as the major international event in the area.
Diagrams 2014 will include presentations of refereed papers, posters,
tutorials, workshop sessions, and a graduate symposium. We invite
submissions that focus on any aspect of diagrams research, as follows.
- long research papers (15 pages)
- short research papers (7 pages)
- posters (3 pages)
- tutorial proposals (2 pages; see the conference web page for full details)
- workshop proposals (2 pages; see the conference web page for full details)
- graduate symposium submissions (3 pages; see the conference web page
for full details)
All submissions will be fully peer reviewed. The proceedings, which will
include accepted long and short papers and posters, will be published by
Springer in their Lecture Notes in Computer Science series,
http://www.springer.com/lncs.
Full details on the preparation of submissions can be found on the
conference
web site http://www.diagrams-conference.org/2014/submission-instructions
Conference topics include, but are not limited to:
- applications of diagrams
- computational models of reasoning with, and interpretation of, diagrams
- design of diagrammatic notations
- diagram understanding by humans or machines
- diagram aesthetics and layout
- educational uses of diagrams
- evaluation of diagrammatic notations
- graphical communication and literacy
- heterogeneous notations involving diagrams
- history of diagrammatic notations
- information visualization using diagrams
- nature of diagrams and diagramming
- novel technologies for diagram use
- psychological issues pertaining to perception, comprehension or
production of diagrams
- software to support the use of diagrams
- usability and human-computer interaction issues concerning diagrams
* Submission Dates *
Abstract submissions: 13th December 2013
Paper submissions: 20th December 2013
Workshop proposal submissions: 22nd November 2013
Poster submission: 20th December 2013
Tutorial proposal submissions: 10th January 2014
Graduate symposium submissions: 18th April 2014
Conference dates: 28th of July 2014 to the 1st of August 2014
* Organising Committee *
General Chair: Tim Dwyer (Monash University)
Program Chairs: Aidan Delaney (University of Brighton),
Helen Purchase (University of Glasgow)
Workshops Chair: Karsten Klein (University of Sydney)
Tutorials Chair: Michael Wybrow (Monash University)
Graduate Symposium Chair: Stephanie Schwartz (Millersville University)
Treasurer: Cagatay Goncu (Monash University)
Publicity Chair: Jim Burton (University of Brighton)
* Program Committee *
Lisa Best, University of New Brunswick
Peter Rodgers, University of Kent
Sandra Carberry, University of Delaware
Sun-Joo Shin, Yale University
Ashok Goel, Georgia Institute of Technology
Emmanuel Manalo, Waseda University
Barbara Tversky, Columbia and Stanford
Beryl Plimmer, University of Auckland
Gem Stapleton, University of Brighton
Jacques Fleuriot, University of Edinburgh
Mark Minas, Universität der Bundeswehr München
Paolo Bottoni, University of Rome
Max Egenhofer, University of Maine
Ian Oliver, Nokia Research Center
Ryo Takemura, Nihon University
Hari Narayanan, Auburn University
Kim Marriott, Monash University
Richard Cox, University of Edinburgh
Yuri Uesaka, University of Tokyo
Lopamudra Choudhury, Jadavpur University
John Howse, University of Brighton
Gerard Allwein, US Navy Research Lab
Nik Swoboda, Universidad Politécnica de Madrid
Jim Davies, Carleton University
James Corter, Columbia University
Frank Ruskey, University of Victoria
Jean Flower, Autodesk
Alan Blackwell, Cambridge University
Michael Wybrow, Monash University
Nathaniel Miller, University of Northern Colorado
Luis Pineda Cortes, Universidad Nacional Autónoma de México
Mateja Jamnik, University of Cambridge
Frithjof Dau, SAP
Peter Cheng, University of Sussex
Mary Hegarty, University of California, Santa Barbara
Stephanie Elzer-Schwartz, Millersville University
Dave Barker-Plummer, Stanford University
Phil Cox, Dalhousie University
John Lee, University of Edinburgh
Atsushi Shimojima, Doshisha University
B. Chandrasekaran, Ohio State University
Apart from submissions to the main Diagrams 2014 conference we are also
soliciting proposals for:
- half-day or full-day workshops
http://www.diagrams-conference.org/2014/workshops
- one or two hour tutorials
http://www.diagrams-conference.org/2014/tutorials
- the graduate student symposium
http://www.diagrams-conference.org/2014/graduate-symposium
--
Dr Jim Burton
Senior Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************
message. Please note that workshop proposals for Diagrams 2014 are due
in one week's time.
-----------------------------------------
Call for Papers: Diagrams 2014
Eighth International Conference on the Theory and Application of Diagrams
http://www.diagrams-conference.org/2014
diagrams2014@diagrams-conference.org
28th July to 1st August
Swinburne University, Melbourne, Australia
* CALL FOR PAPERS *
Diagrams is an international interdisciplinary conference series,
covering all aspects of research on the theory and application of
diagrams. In 2014 it will be held at Swinburne University, Melbourne,
Australia, from the 28th of July 2014 to the 1st of August 2014.
Diagrams 2014 will be co-located with the IEEE Symposium on Visual
Languages and Human-Centric Computing.
Diagrams is the only conference series that provides a united forum
for all areas that are concerned with the study of diagrams, including
architecture, artificial intelligence, biology, cartography, cognitive
science, computer science, education, graphic design, history of
science, human-computer interaction, linguistics, logic, mathematics,
philosophy, psychology, and software modelling. The conference attracts
a large number of researchers from almost all these related fields,
positioning Diagrams as the major international event in the area.
Diagrams 2014 will include presentations of refereed papers, posters,
tutorials, workshop sessions, and a graduate symposium. We invite
submissions that focus on any aspect of diagrams research, as follows.
- long research papers (15 pages)
- short research papers (7 pages)
- posters (3 pages)
- tutorial proposals (2 pages; see the conference web page for full details)
- workshop proposals (2 pages; see the conference web page for full details)
- graduate symposium submissions (3 pages; see the conference web page
for full details)
All submissions will be fully peer reviewed. The proceedings, which will
include accepted long and short papers and posters, will be published by
Springer in their Lecture Notes in Computer Science series,
http://www.springer.com/lncs.
Full details on the preparation of submissions can be found on the
conference
web site http://www.diagrams-conference.org/2014/submission-instructions
Conference topics include, but are not limited to:
- applications of diagrams
- computational models of reasoning with, and interpretation of, diagrams
- design of diagrammatic notations
- diagram understanding by humans or machines
- diagram aesthetics and layout
- educational uses of diagrams
- evaluation of diagrammatic notations
- graphical communication and literacy
- heterogeneous notations involving diagrams
- history of diagrammatic notations
- information visualization using diagrams
- nature of diagrams and diagramming
- novel technologies for diagram use
- psychological issues pertaining to perception, comprehension or
production of diagrams
- software to support the use of diagrams
- usability and human-computer interaction issues concerning diagrams
* Submission Dates *
Abstract submissions: 13th December 2013
Paper submissions: 20th December 2013
Workshop proposal submissions: 22nd November 2013
Poster submission: 20th December 2013
Tutorial proposal submissions: 10th January 2014
Graduate symposium submissions: 18th April 2014
Conference dates: 28th of July 2014 to the 1st of August 2014
* Organising Committee *
General Chair: Tim Dwyer (Monash University)
Program Chairs: Aidan Delaney (University of Brighton),
Helen Purchase (University of Glasgow)
Workshops Chair: Karsten Klein (University of Sydney)
Tutorials Chair: Michael Wybrow (Monash University)
Graduate Symposium Chair: Stephanie Schwartz (Millersville University)
Treasurer: Cagatay Goncu (Monash University)
Publicity Chair: Jim Burton (University of Brighton)
* Program Committee *
Lisa Best, University of New Brunswick
Peter Rodgers, University of Kent
Sandra Carberry, University of Delaware
Sun-Joo Shin, Yale University
Ashok Goel, Georgia Institute of Technology
Emmanuel Manalo, Waseda University
Barbara Tversky, Columbia and Stanford
Beryl Plimmer, University of Auckland
Gem Stapleton, University of Brighton
Jacques Fleuriot, University of Edinburgh
Mark Minas, Universität der Bundeswehr München
Paolo Bottoni, University of Rome
Max Egenhofer, University of Maine
Ian Oliver, Nokia Research Center
Ryo Takemura, Nihon University
Hari Narayanan, Auburn University
Kim Marriott, Monash University
Richard Cox, University of Edinburgh
Yuri Uesaka, University of Tokyo
Lopamudra Choudhury, Jadavpur University
John Howse, University of Brighton
Gerard Allwein, US Navy Research Lab
Nik Swoboda, Universidad Politécnica de Madrid
Jim Davies, Carleton University
James Corter, Columbia University
Frank Ruskey, University of Victoria
Jean Flower, Autodesk
Alan Blackwell, Cambridge University
Michael Wybrow, Monash University
Nathaniel Miller, University of Northern Colorado
Luis Pineda Cortes, Universidad Nacional Autónoma de México
Mateja Jamnik, University of Cambridge
Frithjof Dau, SAP
Peter Cheng, University of Sussex
Mary Hegarty, University of California, Santa Barbara
Stephanie Elzer-Schwartz, Millersville University
Dave Barker-Plummer, Stanford University
Phil Cox, Dalhousie University
John Lee, University of Edinburgh
Atsushi Shimojima, Doshisha University
B. Chandrasekaran, Ohio State University
Apart from submissions to the main Diagrams 2014 conference we are also
soliciting proposals for:
- half-day or full-day workshops
http://www.diagrams-conference.org/2014/workshops
- one or two hour tutorials
http://www.diagrams-conference.org/2014/tutorials
- the graduate student symposium
http://www.diagrams-conference.org/2014/graduate-symposium
--
Dr Jim Burton
Senior Lecturer in Computing
School of Computing, Engineering and Mathematics
University of Brighton
___________________________________________________________
This email has been scanned by MessageLabs' Email Security
System on behalf of the University of Brighton.
For more information see http://www.brighton.ac.uk/is/spam/
___________________________________________________________
**********************************************************
*
* 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] Postdoc positions in algorithms and complexity at MPI, Germany
M A X P L A N C K I N S T I T U T E
for
I N F O R M A T I C S
seeks several
POSTDOCS
for the Algorithms and Complexity Department
directed by Kurt Mehlhorn
We are looking for applicants from all areas of algorithmics, including
related areas like computer algebra, complexity theory, and discrete
mathematics. We are also explicitly looking for people interested in
computational geometry and topology, algorithm engineering and the
design and implementation of algorithm libraries.
The Max-Planck-Institute for Informatics is located on the campus
of the Universitaet des Saarlandes in Saarbruecken, Germany. Currently,
around 40 researchers from several nationalities work in the Algorithms
and Complexity Department. Our working language is English. The group
collaborates with several of the major research institutions in Europe
and the U.S. and has high international visibility. There is generous
travel support available for all group members. Postdoctoral fellowships
are available for one or two years.
Applications from disabled applicants are appreciated. Our institute
supports the principle of equal opportunity for men and women, and is
therefore interested in applications from women.
Applications must be sent by email as a single PDF file to
d1-office <at> mpi-inf.mpg.de by January 5, 2014.
They must include
* a curriculum vitae,
* list of publications,
* the names of three references with their e-mail addresses,
* a research plan (1 page is enough),
* intended period of stay, and
* your two most "interesting" papers (preferably just URLs).
**********************************************************
*
* 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/
*
**********************************************************
for
I N F O R M A T I C S
seeks several
POSTDOCS
for the Algorithms and Complexity Department
directed by Kurt Mehlhorn
We are looking for applicants from all areas of algorithmics, including
related areas like computer algebra, complexity theory, and discrete
mathematics. We are also explicitly looking for people interested in
computational geometry and topology, algorithm engineering and the
design and implementation of algorithm libraries.
The Max-Planck-Institute for Informatics is located on the campus
of the Universitaet des Saarlandes in Saarbruecken, Germany. Currently,
around 40 researchers from several nationalities work in the Algorithms
and Complexity Department. Our working language is English. The group
collaborates with several of the major research institutions in Europe
and the U.S. and has high international visibility. There is generous
travel support available for all group members. Postdoctoral fellowships
are available for one or two years.
Applications from disabled applicants are appreciated. Our institute
supports the principle of equal opportunity for men and women, and is
therefore interested in applications from women.
Applications must be sent by email as a single PDF file to
d1-office <at> mpi-inf.mpg.de by January 5, 2014.
They must include
* a curriculum vitae,
* list of publications,
* the names of three references with their e-mail addresses,
* a research plan (1 page is enough),
* intended period of stay, and
* your two most "interesting" papers (preferably just URLs).
**********************************************************
*
* 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] 3 post-doc positions in Computer Science @GSSI L'Aquila - Italy
3 Post Doctoral positions in Computer Science at Gran Sasso Science Institute in L'Aquila (Italy) - http://www.gssi.infn.it
Deadline December 8, 2013
The Gran Sasso Science Institute (GSSI), a recently established international PhD school and a Center for advanced studies in physics, mathematics, computer science and social sciences offers 16 postdoctoral research positions; among these 3 are dedicated to Computer Science and more specifically to themes that are strongly connected to the pillars of the PhD program in Computer Science:
- Foundations of networks.
- Software systems and services.
- Specifications and analysis of concurrent reactive systems
The annual gross salary is EURO 40K, positions are for two years and may be extended to a third year.
Candidates must have earned their doctoral degree not earlier than January 1, 2007. Selected candidates are expected to start their appointments not later than November 1st, 2014.
Online application forms can be found on the GSSI web portal
http://www.gssi.infn.it.
The full text of the call can be downloaded at
http://www.gssi.infn.it/images/bandi2013/bando_RG.pdf
For further information you can contact Rocco De Nicola (rocco.denicola@imtlucca.it), the coordinator of the PhD program in Computer Science at GSSI.
Best regards,
Michele Flammini
-----------
Department of Information Engineering, Computer Science, and Mathematics
University of L'Aquila
Italy
email michele.flammini@univaq.it
**********************************************************
*
* 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/
*
**********************************************************
Deadline December 8, 2013
The Gran Sasso Science Institute (GSSI), a recently established international PhD school and a Center for advanced studies in physics, mathematics, computer science and social sciences offers 16 postdoctoral research positions; among these 3 are dedicated to Computer Science and more specifically to themes that are strongly connected to the pillars of the PhD program in Computer Science:
- Foundations of networks.
- Software systems and services.
- Specifications and analysis of concurrent reactive systems
The annual gross salary is EURO 40K, positions are for two years and may be extended to a third year.
Candidates must have earned their doctoral degree not earlier than January 1, 2007. Selected candidates are expected to start their appointments not later than November 1st, 2014.
Online application forms can be found on the GSSI web portal
http://www.gssi.infn.it.
The full text of the call can be downloaded at
http://www.gssi.infn.it/images/bandi2013/bando_RG.pdf
For further information you can contact Rocco De Nicola (rocco.denicola@imtlucca.it), the coordinator of the PhD program in Computer Science at GSSI.
Best regards,
Michele Flammini
-----------
Department of Information Engineering, Computer Science, and Mathematics
University of L'Aquila
Italy
email michele.flammini@univaq.it
**********************************************************
*
* 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
