[Apologies if you got multiple copies of this email]
SECOND CALL FOR PAPERS:
Special Issue on "HEURISTICS FOR RELIABLE AND EFFICIENT WIRELESS SENSOR
NETWORKS DEPLOYMENTS"
PDF: http://arco.unex.es/hrewsn
http://www.springer.com/mathematics/applications/journal/10732
Journal of Heuristics
Springer, ISSN: 1381-1231. Editor-in-Chief: Manuel Laguna.
Impact factor (2012): 1.471 (Q1, COMPUTER SCIENCE, THEORY & METHODS).
Aims and Scope:
==============
Wireless Sensor Networks are nowadays an extended engineering technology
for many markets due to the great amount of their possibilities in
collecting data from complex environments and processing them for
different purposes. Nevertheless, this interest is not enough to apply
this kind of networks as trustworthy solution for many real-world
environments, such as industrial processes and critical infrastructures,
where high reliability is required, together with other related key
aspects as energy, security and efficiency. Many companies could
overcome their reluctances if economic, reliable and easily deployed
solutions are provided in this field. In this scenario, the heuristics
and computational intelligence play an important role to solve many
involved optimization problems, doing necessary the research on advanced
solutions that result in a successful product. In this sense, there are
many challenges, trends and open possibilities in this area that deserve
to be known. In this special issue, we seek original, high quality
articles, clearly focused on theoretical or practical aspects of the
heuristics and mathematical optimization methods for obtaining reliable
and efficient wireless sensor networks, including but not limited to the
topics shown below.
Topics of Interest:
==================
The topics related to heuristics for reliable and efficient Wireless
Sensor Networks deployments that are relevant to this special issue
include but are not limited to:
* Energy minimization aspects: network lifetime and power savings.
* Efficient networks deployments.
* Heuristics and computational intelligence applied for solving
optimization problems.
* Multiobjective optimization problems.
* Fault tolerance and quality of service.
* Robust routing algorithms, network protocols and operating systems.
* Security and privacy aspects of the communications.
* Microprocessors, circuits, and embedded applications.
* Application cases, user studies and experiences.
Papers must be tailored to the problem of the wireless sensor networks
and explicitly consider heuristics and mathematical optimization
methods. The editors maintain the right to reject papers they deem to be
out of scope of this special issue. Only originally unpublished
contributions and invited articles will be considered for the issue.
Authors should submit their manuscripts through Editorial Manager
http://www.editorialmanager.com/heur/, selecting "SI - HREWSN" as the
article type.
Important Dates:
===============
Submission deadline: December 1st, 2013.
Acceptation notification: April 1st, 2014.
Final Papers: June 1st, 2014.
Guest Editors:
=============
Lead Editor:
Dr. Juan A. Gomez-Pulido
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
http://arco.unex.es/jangomez
E-mail: jangomez@unex.es
Editor#2:
Jose M. Lanza-Gutierrez
Dept. of Technologies of Computers and Communications, Univ. of
Extremadura, Spain
E-mail: jmlanza@unex.es
**********************************************************
*
* 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/
*
**********************************************************
Thursday, October 31, 2013
[DMANET] CMS 2014 - 1st Announcement and Call for papers
CMS 2014 - 11th International Conference on Computational Management Science
http://cms2014.fc.ul.pt
1st announcement and call for papers
The 11th International Conference on Computational Management Science will
be held May 29-31 2014, in the Faculty of Sciences at the University of
Lisbon, Portugal.
The CMS conference is an annual meeting associated with the journal of
Computational Management Science published by Springer. The aim of this
conference is to provide a forum for theoreticians and practitioners from
academia and industry to exchange knowledge, ideas and results in a broad
range of topics relevant to the theory and practice of computational
methods, models and empirical analysis for decision making in economics,
engineering, finance and management. These include the following topics:
- computational economics, finance and statistics;
- energy;
- scheduling;
- supply chains;
- design, analysis and applications of optimization algorithms;
- deterministic, dynamic, stochastic, robust and combinatorial optimization
models;
- solution algorithms;
- learning and forecasting such as neural networks and genetic algorithms;
- models and tools of knowledge acquisition, such as data mining;
- all other topics in management science with the emphasis on computational
paradigms.
This year the CMS conference will place particular emphasis on computational
methods and tools relevant for two important areas: Energy and Finance.
Participants are invited to submit a short abstract (approximately 300
words). Participants may, in addition, submit a short conference paper (2-6
pages) to be published in a volume of Lecture Notes on Computer Science, by
Springer. A selection from all presentations will also be considered for
publication as full papers in a special issue of Computational Management
Science.
Plenary speakers: Victor DeMiguel (London Business School), William
Pulleyblank (United States Military Academy), Daniel Ralph (University of
Cambridge), Rüdiger Schultz (Universität Duisburg-Essen).
A CMS Best Student Paper Prize will be awarded at the conference. Further
details will be provided later.
Submission deadline for abstracts and conference papers: February 14, 2014
Conference chairs:
Raquel J. Fonseca (University of Lisbon)
Daniel Kuhn (EPFL - École Polytechnique Fédéral de Lausanne)
João Telhada (University of Lisbon)
----------------------------------------------------------------------------
-------------------------------------------
Apologies for cross-posting and/or multiple copies. Appreciate if you can
distribute this announcement to your network.
----------------------------------------------------------------------------
-------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
http://cms2014.fc.ul.pt
1st announcement and call for papers
The 11th International Conference on Computational Management Science will
be held May 29-31 2014, in the Faculty of Sciences at the University of
Lisbon, Portugal.
The CMS conference is an annual meeting associated with the journal of
Computational Management Science published by Springer. The aim of this
conference is to provide a forum for theoreticians and practitioners from
academia and industry to exchange knowledge, ideas and results in a broad
range of topics relevant to the theory and practice of computational
methods, models and empirical analysis for decision making in economics,
engineering, finance and management. These include the following topics:
- computational economics, finance and statistics;
- energy;
- scheduling;
- supply chains;
- design, analysis and applications of optimization algorithms;
- deterministic, dynamic, stochastic, robust and combinatorial optimization
models;
- solution algorithms;
- learning and forecasting such as neural networks and genetic algorithms;
- models and tools of knowledge acquisition, such as data mining;
- all other topics in management science with the emphasis on computational
paradigms.
This year the CMS conference will place particular emphasis on computational
methods and tools relevant for two important areas: Energy and Finance.
Participants are invited to submit a short abstract (approximately 300
words). Participants may, in addition, submit a short conference paper (2-6
pages) to be published in a volume of Lecture Notes on Computer Science, by
Springer. A selection from all presentations will also be considered for
publication as full papers in a special issue of Computational Management
Science.
Plenary speakers: Victor DeMiguel (London Business School), William
Pulleyblank (United States Military Academy), Daniel Ralph (University of
Cambridge), Rüdiger Schultz (Universität Duisburg-Essen).
A CMS Best Student Paper Prize will be awarded at the conference. Further
details will be provided later.
Submission deadline for abstracts and conference papers: February 14, 2014
Conference chairs:
Raquel J. Fonseca (University of Lisbon)
Daniel Kuhn (EPFL - École Polytechnique Fédéral de Lausanne)
João Telhada (University of Lisbon)
----------------------------------------------------------------------------
-------------------------------------------
Apologies for cross-posting and/or multiple copies. Appreciate if you can
distribute this announcement to your network.
----------------------------------------------------------------------------
-------------------------------------------
**********************************************************
*
* 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] Special issue of Discrete Applied Mathematics dedicated to GROW 2013
Dear colleague,
We would like to invite you to submit a paper for publication in a special
issue of Discrete Applied Mathematics dedicated to the topics of the
recent workshop held in Santorini, Greece on October 9-11, 2013: Sixth
Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2013).
The workshop was the most recent in the series initiated twelve years ago
in Barcelona (Bellaterra) and continued in Prague in 2005, Eugene in 2007,
Bergen in 2019, and Daejeon in 2011. The first four meetings resulted in
publication of special issues DAM 160(6), DAM 145(2), DAM 157(12), and DAM
158(7). The special issue of DAM dedicated to the fifth workshop is about
to hit the presses and will appear in early 2014.
The authorship of papers submitted to this special issue is not limited to
the participants of the Santorini workshop; this invitation is being sent
to all those who were invited to the workshop. We hope to include other
recent results in these research areas, as well. As it was the case of the
previous issues, all submissions will be duly refereed with the usual high
standards.
The submission deadline is March 1, 2014.
Please submit your paper through the web page:
http://ees.elsevier.com/dam/
If you have used this system before, you can use your existing login name
and password for this submission; otherwise you will need to create an
account.
After logging in, the first thing you are asked to do is to select an
article type. Please be sure to select:
"SI:DAM_GROW 2013 Santorini"
from the list that appears for "Choose an article type". And then follow
the instructions on the following pages. Please do not forget to approve
the pdf file that is created at the end of your session.
We are looking forward to receiving your paper! Please end us a brief
message letting us know your intentions by mid January.
Best regards,
The Special Issue Editors:
Andrzej Proskurowski <andrzej@cs.uoregon.edu>
Dimitrios M. Thilikos <sedthilk@thilikos.info>
Pinar Heggernes <Pinar.Heggernes@ii.uib.no>
This announcement is also available at
http://grow2013.isoftcloud.gr/Special_issue_of_Discrete_Applied_Mathematics_for_GROW_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/
*
**********************************************************
We would like to invite you to submit a paper for publication in a special
issue of Discrete Applied Mathematics dedicated to the topics of the
recent workshop held in Santorini, Greece on October 9-11, 2013: Sixth
Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2013).
The workshop was the most recent in the series initiated twelve years ago
in Barcelona (Bellaterra) and continued in Prague in 2005, Eugene in 2007,
Bergen in 2019, and Daejeon in 2011. The first four meetings resulted in
publication of special issues DAM 160(6), DAM 145(2), DAM 157(12), and DAM
158(7). The special issue of DAM dedicated to the fifth workshop is about
to hit the presses and will appear in early 2014.
The authorship of papers submitted to this special issue is not limited to
the participants of the Santorini workshop; this invitation is being sent
to all those who were invited to the workshop. We hope to include other
recent results in these research areas, as well. As it was the case of the
previous issues, all submissions will be duly refereed with the usual high
standards.
The submission deadline is March 1, 2014.
Please submit your paper through the web page:
http://ees.elsevier.com/dam/
If you have used this system before, you can use your existing login name
and password for this submission; otherwise you will need to create an
account.
After logging in, the first thing you are asked to do is to select an
article type. Please be sure to select:
"SI:DAM_GROW 2013 Santorini"
from the list that appears for "Choose an article type". And then follow
the instructions on the following pages. Please do not forget to approve
the pdf file that is created at the end of your session.
We are looking forward to receiving your paper! Please end us a brief
message letting us know your intentions by mid January.
Best regards,
The Special Issue Editors:
Andrzej Proskurowski <andrzej@cs.uoregon.edu>
Dimitrios M. Thilikos <sedthilk@thilikos.info>
Pinar Heggernes <Pinar.Heggernes@ii.uib.no>
This announcement is also available at
http://grow2013.isoftcloud.gr/Special_issue_of_Discrete_Applied_Mathematics_for_GROW_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/
*
**********************************************************
Wednesday, October 30, 2013
[DMANET] Post-doctoral position in Extremal Combinatorics at Warwick
Vacancy: Research Fellow
Department of Mathematics
University of Warwick
Fixed term contract for 24 months
Salary £27,854 - £36,298 pa
For a project funded by the European Research Council (ERC), we are
seeking for a highly motivated post-doctoral researcher to work in
Extremal Combinatorics under supervision of Oleg Pikhurko.
While the main directions of the project will be asymptotic
extremal problems for graphs and k-uniform hypergraphs, a previous
experience in these areas is not required. More importantly, we will
be looking for the depth of applicant's research and his/her
proficiency in applying probabilistic, analytic, or algebraic methods
to discrete problems. In particular, a familiarity with regularity
lemmas or graph limits
will be an asset.
The starting date for this position is 1 October 2014 (negotiable).
Deadline for applying: 9 December 2013
The online application form and further information can be found at this URL:
https://atsv7.wcn.co.uk/search_engine/jobs.cgi?amNvZGU9MTM3ODIxMCZ2dF90ZW1wbGF0ZT0xNDU3Jm93bmVyPTUwNjI0NTImb3duZXJ0eXBlPWZhaXImYnJhbmRfaWQ9MCZ2YWNfeHRyYTUwNjI0NTIuNTJfNTA2MjQ1Mj0yMzk5NTQmcG9zdGluZ19jb2RlPTYzNSZyZXFzaWc9MTM4MjcwODA5NC1iZDBjZDg5OTc0ZTc0MjU1NWE2NzQ2Y2E2MzkxYzBiZDE5NWFiMTM4=&jcode=1378210&vt_template=1457&owner=5062452&ownertype=fair&brand_id=0&vac_xtra5062452.52_5062452=239954&posting_code=635&reqsig=1382708094-bd0cd89974e742555a6746ca6391c0bd195ab138
**********************************************************
*
* 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/
*
**********************************************************
Department of Mathematics
University of Warwick
Fixed term contract for 24 months
Salary £27,854 - £36,298 pa
For a project funded by the European Research Council (ERC), we are
seeking for a highly motivated post-doctoral researcher to work in
Extremal Combinatorics under supervision of Oleg Pikhurko.
While the main directions of the project will be asymptotic
extremal problems for graphs and k-uniform hypergraphs, a previous
experience in these areas is not required. More importantly, we will
be looking for the depth of applicant's research and his/her
proficiency in applying probabilistic, analytic, or algebraic methods
to discrete problems. In particular, a familiarity with regularity
lemmas or graph limits
will be an asset.
The starting date for this position is 1 October 2014 (negotiable).
Deadline for applying: 9 December 2013
The online application form and further information can be found at this URL:
https://atsv7.wcn.co.uk/search_engine/jobs.cgi?amNvZGU9MTM3ODIxMCZ2dF90ZW1wbGF0ZT0xNDU3Jm93bmVyPTUwNjI0NTImb3duZXJ0eXBlPWZhaXImYnJhbmRfaWQ9MCZ2YWNfeHRyYTUwNjI0NTIuNTJfNTA2MjQ1Mj0yMzk5NTQmcG9zdGluZ19jb2RlPTYzNSZyZXFzaWc9MTM4MjcwODA5NC1iZDBjZDg5OTc0ZTc0MjU1NWE2NzQ2Y2E2MzkxYzBiZDE5NWFiMTM4=&jcode=1378210&vt_template=1457&owner=5062452&ownertype=fair&brand_id=0&vac_xtra5062452.52_5062452=239954&posting_code=635&reqsig=1382708094-bd0cd89974e742555a6746ca6391c0bd195ab138
**********************************************************
*
* 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] CSR 2014: First Call for Papers
CSR-2014: First Call for Papers
The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers)
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 include:
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
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers)
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 include:
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/
*
**********************************************************
[DMANET] PhD Position at RWTH Aachen (Germany)
PhD Position at RWTH Aachen (Germany)
Position of Research Assistant
Project: Complex Simulation Systems for Decision Support
Our Profile:
The new research group Advanced Analytics is part of the Research Area
Operations Research and Management at the School of Business and Economics.
We aim to combine methods of data analytics, simulation and optimization to
support decisions under uncertainty and complexity.
Your Profile:
* We expect applicants to have a degree (master or equivalent) in business
information systems, engineering sciences, computer sciences, or applied
mathematics.
* The candidate should be fluent in English and - ideally - German.
Candidates that apply for this position shall meet the following criteria
* Previous experience with simulation modelling, especially discrete
event-based simulations, stochastic simulations, multi-agent simulations.
* Some expertise in object-oriented programming.
* Acquaintance with concepts of data mining and operations research in
general and revenue management in particular.
* Awareness of emerging trends and developments in relevant technology.
* Capability of highly original work together with an enquiring mind with
well-developed analytical and investigative skills.
* Good written and oral communication skills, ability to promote ideas by
logical argument and capable of presenting the results of a project in a
clear and effective manner.
* Sound time and resource management skills.
* Self-motivated, with the drive and initiative to carry out projects
according to plan.
* Enjoyment in working and communicating as part of a team.
Your Duties:
You will be part of a new research group and are therefore expected to
contribute to the building and establishment of the team both in
organizational and functional terms. As we are in the course of establishing
an interdisciplinary Business Analytics Lab, your input to this effort will
be welcome, too.
* You will be working in a research project combining methods of data
analysis and simulation modeling to further research on the validation and
calibration of complex simulation systems for decision support.
* This position comes with a teaching load of 2 hours per week.
The position is for a fixed term of 2 years and is to be filled as soon as
possible. An extension up to a year will be considered at a later date. This
is a full-time position. It is also available as part-time employment per
request.
* The successful candidate has the opportunity to pursue a doctoral degree.
* The salary is based on the German public service salary scale (TV-L).
RWTH Aachen University is certified as a "Family-Friendly University". We
particularly welcome and encourage applications from women, disabled persons
and ethnic minority groups, recognizing they are underrepresented across
RWTH Aachen University. The principles of fair and open competition apply
and appointments will be made on merit.
Find more information here:
http://www.zhv.rwth-aachen.de/mainzhv.php?scriptid=job¶m=vorschau&nr=130
18&typ=engl
Please do not hesitate to contact us if you have any questions.
Best regards,
Catherine Cleophas (catherine.cleophas@rwth-aachen.de)
**********************************************************
*
* 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/
*
**********************************************************
Position of Research Assistant
Project: Complex Simulation Systems for Decision Support
Our Profile:
The new research group Advanced Analytics is part of the Research Area
Operations Research and Management at the School of Business and Economics.
We aim to combine methods of data analytics, simulation and optimization to
support decisions under uncertainty and complexity.
Your Profile:
* We expect applicants to have a degree (master or equivalent) in business
information systems, engineering sciences, computer sciences, or applied
mathematics.
* The candidate should be fluent in English and - ideally - German.
Candidates that apply for this position shall meet the following criteria
* Previous experience with simulation modelling, especially discrete
event-based simulations, stochastic simulations, multi-agent simulations.
* Some expertise in object-oriented programming.
* Acquaintance with concepts of data mining and operations research in
general and revenue management in particular.
* Awareness of emerging trends and developments in relevant technology.
* Capability of highly original work together with an enquiring mind with
well-developed analytical and investigative skills.
* Good written and oral communication skills, ability to promote ideas by
logical argument and capable of presenting the results of a project in a
clear and effective manner.
* Sound time and resource management skills.
* Self-motivated, with the drive and initiative to carry out projects
according to plan.
* Enjoyment in working and communicating as part of a team.
Your Duties:
You will be part of a new research group and are therefore expected to
contribute to the building and establishment of the team both in
organizational and functional terms. As we are in the course of establishing
an interdisciplinary Business Analytics Lab, your input to this effort will
be welcome, too.
* You will be working in a research project combining methods of data
analysis and simulation modeling to further research on the validation and
calibration of complex simulation systems for decision support.
* This position comes with a teaching load of 2 hours per week.
The position is for a fixed term of 2 years and is to be filled as soon as
possible. An extension up to a year will be considered at a later date. This
is a full-time position. It is also available as part-time employment per
request.
* The successful candidate has the opportunity to pursue a doctoral degree.
* The salary is based on the German public service salary scale (TV-L).
RWTH Aachen University is certified as a "Family-Friendly University". We
particularly welcome and encourage applications from women, disabled persons
and ethnic minority groups, recognizing they are underrepresented across
RWTH Aachen University. The principles of fair and open competition apply
and appointments will be made on merit.
Find more information here:
http://www.zhv.rwth-aachen.de/mainzhv.php?scriptid=job¶m=vorschau&nr=130
18&typ=engl
Please do not hesitate to contact us if you have any questions.
Best regards,
Catherine Cleophas (catherine.cleophas@rwth-aachen.de)
**********************************************************
*
* 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, October 29, 2013
2 PhD / postdoc positions in stochastic model checking, U Twente
The Formal Methods & Tool Group has at University of Twente
two PhD or Postdoc positions available in stochastic model checking
POSITION 1: smart railroad maintenance via stochastic model checking (ArRangeer)
Goal of the ArRangeer project is to develop smart railroad maintenance techniques through stochastic modeling, analysis and optimization. In particular, our aim is to extend the widely used fault tree formalism with maintenance models. The scientific core is the extension and refinement of stochastic model checking and stochastic decisions techniques to maintenance planning problems.
We will extensively cooperate with the RWTH Aachen University, and maintenance engineers from ProRail, Movares and NedTrain. Key project deliverables are efficient analysis algorithms and a workable tool to be used in the ProRail context.
For more information in this project, see http://fmt.cs.utwente.nl/vacancies/ or contact m.i.a.stoelinga@utwente.nl or j.p.katoen@utwente.nl
(EU FP7 project TREsPASS)
Goal of the TREsPASS project is to develop an attack navigator to predict, prioritize and prevent information security attacks. We will use a model-based and quantitative approach. In particular, we will develop methods and techniques to expose which attack opportunities are possible; which of them are most urgent; and which countermeasures are most effective.
Scientific core of our work is the extension, refinement, and tailoring of stochastic model checking and stochastic decision-theory techniques to quantify risks on attacks, attack scenarios and the effectiveness of countermeasures. Key project deliverables are efficient analysis algorithms and their implementation in a workable tool.
For more information in this project, see http://fmt.cs.utwente.nl/vacancies/ or contact m.i.a.stoelinga@utwente.nl or j.c.vandepol@utwente.nl
During the whole project, we will extensively cooperate with the TREsPASS partners, most notably with Aalborg University Denmark, Technical University Denmark, University of Luxemburg, and the industrial partners Cybernetica and Consult Hyperion.
- We are looking for a candidates with a strong background in mathematics or theoretical computer science, and the will to apply this expertise in practical case studies.
- The projects are supervised by Dr Marielle Stoelinga (both), Prof.dr. Jaco van de Pol (TREsPASS) and Prof.dr.Joost-Pieter Katoen (ArRangeer)
- PhD student/Postdoc: Full status as an employee at the University of Twente, including pension and health care benefits.
- Gross salary PhD student: ranging from EUR 2083 (1st year) to EUR 2664 (4th year) per month, plus holiday allowance (8%) and end-of-year bonus (8.3%).
- Gross salary Postdoc: starting from EUR 2919 plus holiday allowance (8%) and end-of-year bonus (8.3%)
We are looking forward to your application (deadline December 1) via the following links:
http://ssl1.peoplexs.com/Peoplexs22/CandidatesPortalNoLogin/Vacancy.cfm?PortalID=2537&VacatureID=613409&BedrijfID=55061100
for ArRangeer.
Dr Marielle Stoelinga
Associate Professor of Risk Management for ICT
University of Twente
[DMANET] PhD thesis on computational geometry and structural bioinformatics
Contact: Therese Malliavin <terez@pasteur.fr>
Title: Computational geometry for the determination of biomolecular structures
Subject:
During the last decades, structural biology allowed to incredibly
improve the information on the biological objects, from single
biomolecules to molecular assemblies, and to get a better description
of the physics underlying the interactions between molecules.
Somehow, structural biology can be considered as the description
of the geometric properties of biomolecules, as biomolecular
structures are determined from the measurements of angles and
distances between molecule atoms. These parameter values can
be determined by: Nuclear Magnetic Resonance (NMR), fluorescence/FRET,
mass spectrometry coupled to cross-linking or analysis of protein
sequence alignment. Up to now, one of the most used method to
optimize the protein conformation given these geometric restraints,
was based on the repeated use of simulated annealing (SA) algorithm,
followed by extensive statistics. As the SA algorithm does not
provide a guarantee of global minimality of the function, and
is quite sensitive to the sparsity and to the lack of redundancy
in the distance restraints, we propose in this PhD thesis to explore the
efficiency of another class of methods, derived from operations research
and computational geometry, where a branch-and-pruning algorithm permits
in principle the full exploration of the whole solution space. This
algorithm already gave promising results on small examples of biomolecules,
and the purpose of the project would be to extend them to real-life
systems including: protein structures determination from NMR
distance restraints, homology models or positioning of protein
domains within molecular assemblies using cross-linking restraints.
The PhD thesis will be realized in the frame of a collaboration between the
UnitÈ de Bioinformatique Structurale (CNRS/Institut Pasteur, France) and
the Department of Applied Mathematics (University of Campinas, Brazil).
Required skills
Knowledge of the basic features of the protein structure
Knowledge of algorithmics
Knowledge of at least one programming language among: C++, python
Will to work in an inter-disciplinary team with interactions
with biologists and applied mathematicians
Required level:
Master in bioinformatics including courses on structural bioinformatics,
computer science or applied mathematics
Working language: english, french
Contact: Therese Malliavin
Unite de Bioinformatique Structurale
Institut Pasteur and CNRS, Paris
France
terez@pasteur.fr
Doctoral school: IViV, the student should be able to register at the University
before starting the PhD.
Salary paid by Institut Pasteur
Salary: 1450Euros/month, but the income taxes have to be paid on it
(other charges are already removed).
Work permit required from foreigners outside of the Schlengen space.
Application deadline: December, 1st, 2013
The following documents are required from the applicant:
motivation letter, CV, details of undergraduate and master studies
with marks, master dissertation or any paper the student might have
already written.
Funding is only for three years, starting as soon as the application if
accepted.
**********************************************************
*
* 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/
*
**********************************************************
Title: Computational geometry for the determination of biomolecular structures
Subject:
During the last decades, structural biology allowed to incredibly
improve the information on the biological objects, from single
biomolecules to molecular assemblies, and to get a better description
of the physics underlying the interactions between molecules.
Somehow, structural biology can be considered as the description
of the geometric properties of biomolecules, as biomolecular
structures are determined from the measurements of angles and
distances between molecule atoms. These parameter values can
be determined by: Nuclear Magnetic Resonance (NMR), fluorescence/FRET,
mass spectrometry coupled to cross-linking or analysis of protein
sequence alignment. Up to now, one of the most used method to
optimize the protein conformation given these geometric restraints,
was based on the repeated use of simulated annealing (SA) algorithm,
followed by extensive statistics. As the SA algorithm does not
provide a guarantee of global minimality of the function, and
is quite sensitive to the sparsity and to the lack of redundancy
in the distance restraints, we propose in this PhD thesis to explore the
efficiency of another class of methods, derived from operations research
and computational geometry, where a branch-and-pruning algorithm permits
in principle the full exploration of the whole solution space. This
algorithm already gave promising results on small examples of biomolecules,
and the purpose of the project would be to extend them to real-life
systems including: protein structures determination from NMR
distance restraints, homology models or positioning of protein
domains within molecular assemblies using cross-linking restraints.
The PhD thesis will be realized in the frame of a collaboration between the
UnitÈ de Bioinformatique Structurale (CNRS/Institut Pasteur, France) and
the Department of Applied Mathematics (University of Campinas, Brazil).
Required skills
Knowledge of the basic features of the protein structure
Knowledge of algorithmics
Knowledge of at least one programming language among: C++, python
Will to work in an inter-disciplinary team with interactions
with biologists and applied mathematicians
Required level:
Master in bioinformatics including courses on structural bioinformatics,
computer science or applied mathematics
Working language: english, french
Contact: Therese Malliavin
Unite de Bioinformatique Structurale
Institut Pasteur and CNRS, Paris
France
terez@pasteur.fr
Doctoral school: IViV, the student should be able to register at the University
before starting the PhD.
Salary paid by Institut Pasteur
Salary: 1450Euros/month, but the income taxes have to be paid on it
(other charges are already removed).
Work permit required from foreigners outside of the Schlengen space.
Application deadline: December, 1st, 2013
The following documents are required from the applicant:
motivation letter, CV, details of undergraduate and master studies
with marks, master dissertation or any paper the student might have
already written.
Funding is only for three years, starting as soon as the application if
accepted.
**********************************************************
*
* 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/
*
**********************************************************
Post docs at the Technion
As in previous years, the Technion offers some post doc fellowships,
starting October 2014. This is a competition between candidates. In order
for a candidate to participate, the request must be submitted by the
intended host (who also must participate in the funding). The eventual
submission to the Technion includes a CV, 3 letters of support, a
statement of research and a letter detailing the intended cooperation
between the host and the post doc.
In addition for grants to post docs from anywhere, there are several
grants for citizens if India, and citizens of China only. The deadline for
this kind of fellowships is rather soon. The deadline for the other
fellowships is late November this year.
The subjects of the post doc are any. However, I would be glad to consider
hosting excellent post docs in distributed computing. Strong letters of
support and strong results already obtained (and possibly published) will
make a successful submission rather likely and, I believe, worthwhile.
Please do not hesitate to ask questions.
Shay
starting October 2014. This is a competition between candidates. In order
for a candidate to participate, the request must be submitted by the
intended host (who also must participate in the funding). The eventual
submission to the Technion includes a CV, 3 letters of support, a
statement of research and a letter detailing the intended cooperation
between the host and the post doc.
In addition for grants to post docs from anywhere, there are several
grants for citizens if India, and citizens of China only. The deadline for
this kind of fellowships is rather soon. The deadline for the other
fellowships is late November this year.
The subjects of the post doc are any. However, I would be glad to consider
hosting excellent post docs in distributed computing. Strong letters of
support and strong results already obtained (and possibly published) will
make a successful submission rather likely and, I believe, worthwhile.
Please do not hesitate to ask questions.
Shay
[DMANET] POSTDOCTORAL GRANT POSITION - Matheuristics
CALL FOR 1 POSTDOCTORAL GRANT POSITION
INESC PORTO is accepting applications to award 1 Postdoctoral Grant to
work in the project "Smart Manufacturing and Logistics (
NORTE-07-0124-FEDER-000057)" in the area of Optimization.
Academic Qualifications: PhD in Electric Engineering, Computer Science
Engineering, Industrial Management Engineering or similar.
Minimum Profile required: Experience and knowledge in Operational
Research, Optimization algorithms, and complete domain of programming
languages C/C++.
Preference factors: Previous participation in projects related with this
area. Good scientic level, namely with publications within this domain
or similar. Experience in using Gurobi, CPLEX or XPRESS.
Reference: AE2013-0124 (SmartManufacturing - UESP)
Project Name: SmartManufacturing
Reference Monthly Value: €1495,00
Application Period: 2013-11-06 to 2013-11-22
Further details in:
http://www2.inescporto.pt/ip-en/work-with-us/bolsas-inescporto/concurso-para-a-atribuicao-de-1-bolsa-de-pos-doutoramento-para-trabalhar-no-projeto-smart-manufacturing-and-logistics?set_language=en&cl=en
**********************************************************
*
* 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/
*
**********************************************************
INESC PORTO is accepting applications to award 1 Postdoctoral Grant to
work in the project "Smart Manufacturing and Logistics (
NORTE-07-0124-FEDER-000057)" in the area of Optimization.
Academic Qualifications: PhD in Electric Engineering, Computer Science
Engineering, Industrial Management Engineering or similar.
Minimum Profile required: Experience and knowledge in Operational
Research, Optimization algorithms, and complete domain of programming
languages C/C++.
Preference factors: Previous participation in projects related with this
area. Good scientic level, namely with publications within this domain
or similar. Experience in using Gurobi, CPLEX or XPRESS.
Reference: AE2013-0124 (SmartManufacturing - UESP)
Project Name: SmartManufacturing
Reference Monthly Value: €1495,00
Application Period: 2013-11-06 to 2013-11-22
Further details in:
http://www2.inescporto.pt/ip-en/work-with-us/bolsas-inescporto/concurso-para-a-atribuicao-de-1-bolsa-de-pos-doutoramento-para-trabalhar-no-projeto-smart-manufacturing-and-logistics?set_language=en&cl=en
**********************************************************
*
* 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/
*
**********************************************************
Monday, October 28, 2013
[DMANET] Book "Data Exchange, Integration, and Streams", edited by Phokion G. Kolaitis, Maurizio Lenzerini, and Nicole Schweikardt, published open access (Dagstuhl Follow-Ups, Vol.5)
= Book Announcement =
Title: Data Exchange, Integration, and Streams
Editors: Phokion G. Kolaitis, Maurizio Lenzerini, and Nicole Schweikardt
Series: DFU (Dagstuhl Follow-Ups)
Volume: 5
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing
Publication Date: October, 2013
ISBN: 978-3-939897-61-3
== Open Access ==
Accessible online and free of charge at
http://www.dagstuhl.de/dagpub/978-3-939897-61-3
You may also check the DBLP entry at
http://www.dblp.org/db/conf/dagstuhl/dfu5.html
== About the book ==
Data exchange, integration, and streams concern three different, yet
inter-related facets of information integration that have been investigated in
depth in the recent years. Data exchange and integration deal with the execution
of information integration, but they adopt distinctly different approaches. Data
exchange is the problem of transforming data residing in different sources into
data structured under a target schema; in particular, it entails the
materialization of data, after the data have been extracted from the sources and
re-structured into the unified format. In contrast, data integration can be
described as symbolic or virtual integration: users are provided with the
capability to pose queries and obtain answers via the unified format interface,
while the data remain in the sources and no materialization of the restructured
data is required.In the basic data stream model, the input data consists of one
or several streams of data items that can be read sequentially. This scenario is
relevant for a large number of applications where massive amounts of data need
to be processed. Typically, algorithms have to work with one or a few passes
over the data and a memory buffer of size significantly smaller than the input size.
This volume is based on GI-Dagstuhl Seminar 10452 on "Data Exchange,
Integration, and Streams" (DEIS'10) held in November 2010 at Schloss Dagstuhl –
Leibniz-Zentrum für Informatik, Germany; see http://www.dagstuhl.de/10452.
== Table of contents ==
1. The Chase Procedure and its Applications in Data Exchange – Adrian Onet
2. Algorithms for Core Computation in Data Exchange – Vadim Savenkov
3. The Inverse of a Schema Mapping – Jorge Pérez
4. Reasoning about Schema Mappings – Emanuel Sallinger
5. Query Processing in Data Integration – Paolo Guagliardo and Piotr Wieczorek
6. Semantics for Non-Monotone Queries in Data Exchange and Data Integration –
André Hernich
7. Peer Data Management – Armin Roth and Sebastian Skritek
8. Management of Inconsistencies in Data Integration – Ekaterini Ioannou and
Slawek Staworko
9. Algorithmic Techniques for Processing Data Streams – Elena Ikonomovska and
Mariano Zelke
10. Data Stream Management Systems – Sandra Geisler
See also:
* Frontmatter incl. table of contents and preface:
http://dx.doi.org/10.4230/DFU.Vol5.10452.i
* CompleteVolume-PDF (7 MB):
http://drops.dagstuhl.de/opus/volltexte/dfu-complete/dfu-vol005-complete.pdf
== About the Dagstuhl Follow-Ups Series ==
The Dagstuhl Follow-Ups (DFU) series is a publication series which
offers a frame for the publication of peer-reviewed paper collections
based on Dagstuhl Seminars. DFU volumes are published according to the
principle of OpenAccess, i.e., they are available online and free of
charge.
See also:
* http://www.dagstuhl.de/dfu
* http://drops.dagstuhl.de/dfu
--
Dr. Marc Herbstritt
Scientific Staff | \\\/ Dagstuhl Publishing
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
http://www.dagstuhl.de/herbstritt
**********************************************************
*
* 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/project position at TU Chemnitz in Discrete and Algorithmic Mathematics
At the Department of Mathematics of Technische Universitaet Chemnitz a
PhD position is available in the Algorithmic and Discrete Mathematics
group in the project
"Operational Train Timetabling for Energy Efficient Schedules"
within the joint BMBF-project "Energy Efficient Mobility" (E-Motion)
starting as soon as possible (from 01.11.2013 onwards) at the level
Wissenschaftlicher Mitarbeiter/Wissenschaftliche Mitarbeiterin
(75%, Entgeltgruppe 13 TV-L)
The position is subject to the usual regulations according to Saxonian
law. The official German announcement is available on
https://www.tu-chemnitz.de/verwaltung/personal/stellen/221033_4_NR.php
Applicants should have completed their studies at least at master level
in a program with strong mathematical background in convex and discrete
optimization.
The project focuses on the scientific development, investigation and
algorithmic implementation of mathematical models for energy efficient
train timetabling. Starting point are time discretized network models of
train rides decoupled by Langrangian relaxation. The project aims at
exploring possibilities for dynamic discretization techniques and for
reducing energetic peak loads. The topic is intended for advancing the
scientific qualification of the applicant towards a PhD or beyond.
Applications should refer to the official announcement and should be
directed electronically or by standard mail before 08.11.2013 (but
applications will be considered as long as the position is still free) to
Prof. Dr. Christoph Helmberg
Technische Universitaet Chemnitz
Fakultaet fuer Mathematik
Reichenhainer Str. 39/41
09126 Chemnitz
Phone: 0371 531 34122
Email: helmberg@mathematik.tu-chemnitz.de
**********************************************************
*
* 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/
*
**********************************************************
PhD position is available in the Algorithmic and Discrete Mathematics
group in the project
"Operational Train Timetabling for Energy Efficient Schedules"
within the joint BMBF-project "Energy Efficient Mobility" (E-Motion)
starting as soon as possible (from 01.11.2013 onwards) at the level
Wissenschaftlicher Mitarbeiter/Wissenschaftliche Mitarbeiterin
(75%, Entgeltgruppe 13 TV-L)
The position is subject to the usual regulations according to Saxonian
law. The official German announcement is available on
https://www.tu-chemnitz.de/verwaltung/personal/stellen/221033_4_NR.php
Applicants should have completed their studies at least at master level
in a program with strong mathematical background in convex and discrete
optimization.
The project focuses on the scientific development, investigation and
algorithmic implementation of mathematical models for energy efficient
train timetabling. Starting point are time discretized network models of
train rides decoupled by Langrangian relaxation. The project aims at
exploring possibilities for dynamic discretization techniques and for
reducing energetic peak loads. The topic is intended for advancing the
scientific qualification of the applicant towards a PhD or beyond.
Applications should refer to the official announcement and should be
directed electronically or by standard mail before 08.11.2013 (but
applications will be considered as long as the position is still free) to
Prof. Dr. Christoph Helmberg
Technische Universitaet Chemnitz
Fakultaet fuer Mathematik
Reichenhainer Str. 39/41
09126 Chemnitz
Phone: 0371 531 34122
Email: helmberg@mathematik.tu-chemnitz.de
**********************************************************
*
* 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] PD position algorithmic game theory (Paderborn University)
In the faculty of Electrical Engineering, Computer Science and
Mathematics, the Department of Computer Science is searching for a new
member of the scientific staff within subproject A3 of the Collaborative
Research Centre (CRC) 901 „On-The-Fly Computing" (http://sfb901.upb.de).
There will be offered a position as a
Mathematics, the Department of Computer Science is searching for a new
member of the scientific staff within subproject A3 of the Collaborative
Research Centre (CRC) 901 „On-The-Fly Computing" (http://sfb901.upb.de).
There will be offered a position as a
Research Assistant (the Salary is according to TV-L 13)
This is a full-time position, which is to be filled as soon as possible
and is for a fixed term of one year. An extension is possible. The
option of undertaking a PhD is provided and will be explicitly supported.
Your duties and responsibilities:
Subproject A3 investigates the interaction in markets of electronic
services. The focus of our research is the mathematical modeling, the
development of algorithms, and the theoretical and experimental analysis
of market mechanisms and reputation systems.
Your profile:
• A qualified candidate is interested in applied interdisciplinary
research and has a Master's or equivalent degree in a relevant
scientific or technical subject, such as computer science, computational
engineering, mathematics, or business informatics.
• You have sufficient knowledge in theoretical computer science and in
areas like algorithmic game theory, multi-agent systems, complexity
theory, distributed and parallel algorithms.
Applications from women are particularly welcome and, in case of equal
qualifications and experiences, will receive preferential treatment
according to the North Rhine-Westphalian Equal Opportunities Act (LGG),
unless there are preponderant reasons to give preference to another
applicant. Part-time employment is, in principle, possible.
Applications from disabled people with appropriate suitability are
explicitly welcome. This also applies to people with equal opportunities
in accordance with the German social law SGB IX.
Please send your application with the usual documents under the
reference number 1726 by 31.12.2013 to:
Universität Paderborn
Management of the CRC 901
For the attention of Dr. Ulf-Peter Schroeder
Institut für Informatik
Fürstenallee 11
33102 Paderborn
Informal inquiries can be made to Professor Alexander Skopalik
(Skopalik@mail.upb.de)
**********************************************************
*
* 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/
*
**********************************************************
[cav2010] PhD position in LIAFA, Paris, France: Software Model-checking
Please distribute (apologies for multiple postings):
===============================
A PhD position in LIAFA
==================
Contact: Tayssir TOUILI (touili@liafa.univ-paris-diderot.fr)
A PhD position is available in the "Verification" team in LIAFA, Paris.
The subject of the thesis is about Software verification.
The PhD student is expected to investigate and develop novel techniques, algorithms and tools for
the analysis of software.
How to apply:
==========
The position is available immediately. Candidates must have a master in computer science.
The candidate must send a CV, university grades, recommendation letters, and a motivation letter to Tayssir TOUILI (touili@liafa.univ-paris-diderot.fr)
===============================
A PhD position in LIAFA
==================
Contact: Tayssir TOUILI (touili@liafa.univ-paris-diderot.fr)
A PhD position is available in the "Verification" team in LIAFA, Paris.
The subject of the thesis is about Software verification.
The PhD student is expected to investigate and develop novel techniques, algorithms and tools for
the analysis of software.
How to apply:
==========
The position is available immediately. Candidates must have a master in computer science.
The candidate must send a CV, university grades, recommendation letters, and a motivation letter to Tayssir TOUILI (touili@liafa.univ-paris-diderot.fr)
[DMANET] PhD internships in Warsaw
The Warsaw Center for Mathematics and Computer Science has several
open positions for visiting PhD students. The length of an internship
is expected to be one semester (Oct - Jan or Feb - Jun) but can be
extended to three. The deadline for applications is November 15th. You
will find more information here: http://wcmcs.edu.pl/phd-internships
open positions for visiting PhD students. The length of an internship
is expected to be one semester (Oct - Jan or Feb - Jun) but can be
extended to three. The deadline for applications is November 15th. You
will find more information here: http://wcmcs.edu.pl/phd-internships
Please note that:
* the graph theory and algorithms community at the University of
Warsaw is large and growing,
* there is a broad spectrum of graduate courses (taught in English) to
choose from (http://bit.ly/10aJ3zI),
* the monthly allowance is ample given the cost of living in Warsaw
(http://bit.ly/16VtFxH),
* calls for visiting PhD positions are expected twice a year until 2017,
* along with calls for postdoctoral (http://www.wcmcs.edu.pl/node/41)
and experienced researchers (http://www.wcmcs.edu.pl/node/64).
Please do not hesitate to contact us if you have any questions.
Best regards,
Marcin Kamiński (mjk@mimuw.edu.pl)
Łukasz Kowalik (kowalik@mimuw.edu.pl)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, October 27, 2013
Relational & Algebraic Methods (RAMiCS 2014) Deadlines extended!
14th International Conference on
Relational and Algebraic Methods in Computer Science
RAMiCS 2014
FINAL CALL FOR PAPERS, with DEADLINE EXTENSION
27 April to 1 May 2014, Marienstatt im Westerwald, Germany
URL: http://mathcs.chapman.edu/ramics2014
PDF: http://mathcs.chapman.edu/ramics2014/RAMiCS14-CFP.pdf
Invited Speakers
----------------
* C.A.R. Hoare (Microsoft Research Cambridge)
* Alexander Kurz (University of Leicester)
* Jose Oliveira (Universidade do Minho)
Important Dates
---------------
Title and abstract submission: November 1 2013 (anywhere on Earth)
Submission of full papers: November 9 2013 (anywhere on Earth)
Notification: December 16 2013
Final versions due (firm deadline): January 17 2014
Conference April 27 - May 1 2014
Scope
-----
We invite submissions in the general area of Relational and Algebraic Methods
in Computer Science. Special focus will lie on formal methods for software
engineering, logics of programs and links with neighbouring disciplines.
Particular topics of interest for the conference cover,
but are not limited to:
* Algebraic approaches to
• specification, development, verification, and analysis of programs
and algorithms
• computational logic, in particular logics of programs, modal and
dynamic logics, interval and temporal logics
• semantics of programming languages
* Applications in fields such as
• relational formal methods such as B or Z, tabular methods
• information systems
• graph theory and combinatorial optimisation
• games, automata and language theory
• spatio-temporal reasoning, knowledge acquisition
• preference and scaling methods, computational social choice,
social software
* Theoretical foundations and supporting tools, including
• mechanised and automated reasoning, decision procedures
• process algebras, fixed point calculi, idempotent semirings,
quantales, allegories
• dynamic algebras, cylindric algebras and their applications in computing
History
-------
Since 1994, the RelMiCS meetings on Relational Methods in Computer Science
have been a main forum for researchers who use the calculus of relations
and similar algebraic formalisms as methodological and conceptual tools.
The AKA workshop series on Applications of Kleene algebra started with a
Dagstuhl seminar in 2001 and was co-organised with the RelMiCS conference
until 2009. Since 2011, joint RAMiCS conferences continue to encompass
the scope of both RelMiCS and AKA.
The predecessors of this conference were held in Dagstuhl (January 1994),
Parati (September 1995), Hammamet (January 1997), Warsaw (September 1998),
Québec (January 2000), Dagstuhl (February 2001), Oisterwijk (October 2001),
Malente (April 2003), St. Catherines (January 2005), Manchester
(September 2006), Frauenwörth (April 2008), Doha (November 2009),
Rotterdam (June 2011), and Cambridge UK (September 2012).
Student Program
---------------
The conference will be accompanied by a PhD training program. Details will
be published in due time in a special call and on the conference website.
Proceedings and Submission
--------------------------
All papers will be formally reviewed. The proceedings will be published
in the Springer series Lecture Notes in Computer Science, ready at
the conference. Submissions must be in English, in Postscript or PDF
format, and provide sufficient information to judge their merits.
They must be unpublished and not submitted for publication elsewhere.
They should not exceed 16 pages in Springer LNCS style (accepted
papers must be produced with LaTeX). Additional material may be
provided by a clearly marked appendix or a reference to a manuscript
on a website. This may be considered at the discretion of the PC.
Deviation from these requirements may cause immediate rejection.
One author of each accepted paper is expected to present the paper
at the conference.
Submission is via EasyChair at the following address:
https://www.easychair.org/conferences/?conf=ramics2014
Formatting instructions and the LNCS styled files can be obtained via:
http://springer.de/comp/lncs/authors.html
As for the earlier conferences of this series, it is also intended to
publish a selection of the best papers in revised and extended form in
a special issue of the Journal of Logic and Algebraic Programming (JLAP).
Programme Committee
-------------------
Rudolf Berghammer (Kiel, Germany)
Jules Desharnais (Laval U., Canada)
Harrie de Swart (Rotterdam, Netherlands)
Marc Frappier (Sherbrooke, Canada)
Hitoshi Furusawa (Kagoshima, Japan)
Timothy G. Griffin (Cambridge, UK)
Walter Guttmann (Canterbury, New Zealand)
Robin Hirsch (London, UK)
Peter Höfner (NICTA, Australia; Publicity chair)
Ali Jaoua (Doha, Qatar)
Peter Jipsen (Chapman U., USA; PC co-chair)
Wolfram Kahl (McMaster U., Canada; PC co-chair)
Tadeusz Litak (Erlangen, Germany)
Larissa Meinicke (U. Queensland, Australia)
Szabolcs Mikulas (London, UK)
Bernhard Möller (Augsburg, Germany)
Martin E. Müller (St. Augustin, Germany; General chair)
José Oliveira (U. Minho, Portugal)
Ewa Orłowska (Warsaw, Poland)
Matthew Parkinson (Microsoft Research, UK)
Damien Pous (CNRS, France)
Ingrid Rewitzky (Stellenbosch, South Africa)
Holger Schlingloff (Berlin, Germany)
Gunther Schmidt (Munich, Germany)
Renate Schmidt (Manchester, UK)
Georg Struth (Sheffield, UK)
George Theodorakopoulos (Cardiff, UK)
Michael Winter (Brock U., Canada)
Steering Committee
------------------
Rudolf Berghammer (Kiel, Germany)
Jules Desharnais (Laval U., Canada)
Harrie de Swart (Rotterdam, Netherlands)
Ali Jaoua (Doha, Qatar)
Bernhard Möller (Augsburg, Germany)
Ewa Orłowska (Warsaw, Poland)
Gunther Schmidt (Munich, Germany)
Renate Schmidt (Manchester, UK)
Michael Winter (Brock U., Canada)
Organising Committee
--------------------
Martin E. Müller, Sankt Augustin, Germany: Conference Chair, Local Organiser
Peter Höfner, NICTA, Australia: Publicity
Peter Jipsen, Chapman U., USA: PC Co-Chair
Wolfram Kahl, McMaster U., Canada: PC Co-Chair
________________________________
The information in this e-mail may be confidential and subject to legal professional privilege and/or copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.
Relational and Algebraic Methods in Computer Science
RAMiCS 2014
FINAL CALL FOR PAPERS, with DEADLINE EXTENSION
27 April to 1 May 2014, Marienstatt im Westerwald, Germany
URL: http://mathcs.chapman.edu/ramics2014
PDF: http://mathcs.chapman.edu/ramics2014/RAMiCS14-CFP.pdf
Invited Speakers
----------------
* C.A.R. Hoare (Microsoft Research Cambridge)
* Alexander Kurz (University of Leicester)
* Jose Oliveira (Universidade do Minho)
Important Dates
---------------
Title and abstract submission: November 1 2013 (anywhere on Earth)
Submission of full papers: November 9 2013 (anywhere on Earth)
Notification: December 16 2013
Final versions due (firm deadline): January 17 2014
Conference April 27 - May 1 2014
Scope
-----
We invite submissions in the general area of Relational and Algebraic Methods
in Computer Science. Special focus will lie on formal methods for software
engineering, logics of programs and links with neighbouring disciplines.
Particular topics of interest for the conference cover,
but are not limited to:
* Algebraic approaches to
• specification, development, verification, and analysis of programs
and algorithms
• computational logic, in particular logics of programs, modal and
dynamic logics, interval and temporal logics
• semantics of programming languages
* Applications in fields such as
• relational formal methods such as B or Z, tabular methods
• information systems
• graph theory and combinatorial optimisation
• games, automata and language theory
• spatio-temporal reasoning, knowledge acquisition
• preference and scaling methods, computational social choice,
social software
* Theoretical foundations and supporting tools, including
• mechanised and automated reasoning, decision procedures
• process algebras, fixed point calculi, idempotent semirings,
quantales, allegories
• dynamic algebras, cylindric algebras and their applications in computing
History
-------
Since 1994, the RelMiCS meetings on Relational Methods in Computer Science
have been a main forum for researchers who use the calculus of relations
and similar algebraic formalisms as methodological and conceptual tools.
The AKA workshop series on Applications of Kleene algebra started with a
Dagstuhl seminar in 2001 and was co-organised with the RelMiCS conference
until 2009. Since 2011, joint RAMiCS conferences continue to encompass
the scope of both RelMiCS and AKA.
The predecessors of this conference were held in Dagstuhl (January 1994),
Parati (September 1995), Hammamet (January 1997), Warsaw (September 1998),
Québec (January 2000), Dagstuhl (February 2001), Oisterwijk (October 2001),
Malente (April 2003), St. Catherines (January 2005), Manchester
(September 2006), Frauenwörth (April 2008), Doha (November 2009),
Rotterdam (June 2011), and Cambridge UK (September 2012).
Student Program
---------------
The conference will be accompanied by a PhD training program. Details will
be published in due time in a special call and on the conference website.
Proceedings and Submission
--------------------------
All papers will be formally reviewed. The proceedings will be published
in the Springer series Lecture Notes in Computer Science, ready at
the conference. Submissions must be in English, in Postscript or PDF
format, and provide sufficient information to judge their merits.
They must be unpublished and not submitted for publication elsewhere.
They should not exceed 16 pages in Springer LNCS style (accepted
papers must be produced with LaTeX). Additional material may be
provided by a clearly marked appendix or a reference to a manuscript
on a website. This may be considered at the discretion of the PC.
Deviation from these requirements may cause immediate rejection.
One author of each accepted paper is expected to present the paper
at the conference.
Submission is via EasyChair at the following address:
https://www.easychair.org/conferences/?conf=ramics2014
Formatting instructions and the LNCS styled files can be obtained via:
http://springer.de/comp/lncs/authors.html
As for the earlier conferences of this series, it is also intended to
publish a selection of the best papers in revised and extended form in
a special issue of the Journal of Logic and Algebraic Programming (JLAP).
Programme Committee
-------------------
Rudolf Berghammer (Kiel, Germany)
Jules Desharnais (Laval U., Canada)
Harrie de Swart (Rotterdam, Netherlands)
Marc Frappier (Sherbrooke, Canada)
Hitoshi Furusawa (Kagoshima, Japan)
Timothy G. Griffin (Cambridge, UK)
Walter Guttmann (Canterbury, New Zealand)
Robin Hirsch (London, UK)
Peter Höfner (NICTA, Australia; Publicity chair)
Ali Jaoua (Doha, Qatar)
Peter Jipsen (Chapman U., USA; PC co-chair)
Wolfram Kahl (McMaster U., Canada; PC co-chair)
Tadeusz Litak (Erlangen, Germany)
Larissa Meinicke (U. Queensland, Australia)
Szabolcs Mikulas (London, UK)
Bernhard Möller (Augsburg, Germany)
Martin E. Müller (St. Augustin, Germany; General chair)
José Oliveira (U. Minho, Portugal)
Ewa Orłowska (Warsaw, Poland)
Matthew Parkinson (Microsoft Research, UK)
Damien Pous (CNRS, France)
Ingrid Rewitzky (Stellenbosch, South Africa)
Holger Schlingloff (Berlin, Germany)
Gunther Schmidt (Munich, Germany)
Renate Schmidt (Manchester, UK)
Georg Struth (Sheffield, UK)
George Theodorakopoulos (Cardiff, UK)
Michael Winter (Brock U., Canada)
Steering Committee
------------------
Rudolf Berghammer (Kiel, Germany)
Jules Desharnais (Laval U., Canada)
Harrie de Swart (Rotterdam, Netherlands)
Ali Jaoua (Doha, Qatar)
Bernhard Möller (Augsburg, Germany)
Ewa Orłowska (Warsaw, Poland)
Gunther Schmidt (Munich, Germany)
Renate Schmidt (Manchester, UK)
Michael Winter (Brock U., Canada)
Organising Committee
--------------------
Martin E. Müller, Sankt Augustin, Germany: Conference Chair, Local Organiser
Peter Höfner, NICTA, Australia: Publicity
Peter Jipsen, Chapman U., USA: PC Co-Chair
Wolfram Kahl, McMaster U., Canada: PC Co-Chair
________________________________
The information in this e-mail may be confidential and subject to legal professional privilege and/or copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.
[DMANET] Evomusart 2014. Submission deadline extended to Nov 11
----------------------------------------------------------------------------
Please distribute
(Apologies for cross posting)
----------------------------------------------------------------------------
----------------------------------------------------------------------------
NEWS: Submission deadline extended to Nov 11
----------------------------------------------------------------------------
CALL FOR PAPERS
evomusart 2014
http://www.evostar.org/cfpEvoMUSART.html
3rd International Conference on Evolutionary and Biologically Inspired
Music, Sound, Art and Design
April 2014, GRANADA, Spain
Part of evo* 2014
evo*: http://www.evostar.org
----------------------------------------------------------------------------
New this year: Special track on Artificial Neural Networks applied to
Music, Sound, Art and Design
----------------------------------------------------------------------------
LEONARDO Special Section
----------------------------------------------------------------------------
Authors of selected papers will be invited to submit expanded versions
of their work for a planned special section on Evolutionary Art of the
MIT Press journal "Leonardo".
----------------------------------------------------------------------------
----------------------------------------------------------------------------
Following the success of previous events and the importance of the
field of evolutionary and biologically inspired (artificial neural
network, swarm, alife) music, sound, art and
design, evomusart has become an evo* conference with independent
proceedings since 2012. Thus, evomusart 2014 is the twelfth European
Event and the third International Conference on Evolutionary and
Biologically Inspired Music, Sound, Art and Design.
The use of biologically inspired techniques for the development of
artistic systems is a recent, exciting and significant area of
research. There is a growing interest in the application of these
techniques in fields such as: visual art and music generation,
analysis, and interpretation; sound synthesis; architecture; video;
poetry; design; and other creative tasks.
The main goal of evomusart 2014 is to bring together researchers who
are using biologically inspired computer techniques for artistic
tasks, providing the opportunity to promote, present and discuss
ongoing work in the area.
The event will be held in April, 2014 in Granada, Andalusia, Spain, as
part of the evo* event.
----------------------------------------------------------------------------
Publication Details
----------------------------------------------------------------------------
Submissions will be rigorously reviewed for scientific and artistic
merit. Accepted papers will be presented orally or as posters at the
event and included in the evomusart proceedings, published by Springer
Verlag in a dedicated volume of the Lecture Notes in Computer Science
series. The acceptance rate at evomusart 2013 was 30.5% for papers
accepted for oral presentation, or 44.4% for oral and poster
presentation combined. The evomusart 2013 submissions received on
average 3.4 reviews each.
New this year: submitters are strongly encouraged to provide in all
papers a link for download of media demonstrating their results,
whether music, images, video, or other media types. Links should be
anonymised for double-blind review, e.g. using a URL shortening
service.
----------------------------------------------------------------------------
Topics of interest
----------------------------------------------------------------------------
Submissions should concern the use of biologically inspired computer
techniques -- e.g. Evolutionary Computation, Artificial Life,
Artificial Neural Networks, Swarm Intelligence, other artificial
intelligence techniques -- in the generation, analysis and
interpretation of art, music, design, architecture and other artistic
fields. Topics of interest include, but are not limited to:
-- Generation
- Biologically Inspired Design and Art -- Systems that create
drawings, images, animations, sculptures, poetry, text, designs,
webpages, buildings, etc.;
- Biologically Inspired Sound and Music -- Systems that create
musical pieces, sounds, instruments, voices, sound effects, sound
analysis, etc.;
- Robotic-Based Evolutionary Art and Music;
- Other related artificial intelligence or generative techniques in
the fields of Computer Music, Computer Art, etc.;
-- Theory
- Computational Aesthetics, Experimental Aesthetics; Emotional
Response, Surprise, Novelty;
- Representation techniques;
- Surveys of the current state-of-the-art in the area; identification
of weaknesses and strengths; comparative analysis and classification;
- Validation methodologies;
- Studies on the applicability of these techniques to related areas;
- New models designed to promote the creative potential of
biologically inspired computation;
-- Computer Aided Creativity and computational creativity
- Systems in which biologically inspired computation is used to
promote the creativity of a human user;
- New ways of integrating the user in the evolutionary cycle;
- Analysis and evaluation of: the artistic potential of biologically
inspired art and music; the artistic processes inherent to these
approaches; the resulting artefacts;
- Collaborative distributed artificial art environments;
-- Automation
- Techniques for automatic fitness assignment;
- Systems in which an analysis or interpretation of the artworks is
used in conjunction with biologically inspired techniques to produce
novel objects;
- Systems that resort to biologically inspired computation to perform
the analysis of image, music, sound, sculpture, or some other types of
artistic object.
----------------------------------------------------------------------------
Important Dates (to be confirmed)
----------------------------------------------------------------------------
Submission: November 11 2013
Notification to authors: December 2013
Camera-ready deadline: January 2014
Evo*: April 2014
----------------------------------------------------------------------------
Additional information and submission details
----------------------------------------------------------------------------
Submit your manuscript, at most 12 A4 pages long, in Springer LNCS
format (instructions downloadable from
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) no later
than November 1, 2013 (date to be confirmed).
Submission link: http://myreview.csregistry.org/evomusart14
page limit: 12 pages
The reviewing process will be double-blind; please omit information
about the authors in the submitted paper.
----------------------------------------------------------------------------
Programme committee
----------------------------------------------------------------------------
Adrian Carballal,University of A Coruna,Spain
Alain Lioret,Paris 8 University,France
Alan Dorin,Monash University,Australia
Alejandro Pazos,University of A Coruna,Spain
Alice Eldridge,Monash University,Australia
Amilcar Cardoso,University of Coimbra,Portugal
Amy K. Hoover,University of Central Florida,USA
Andrew Brown,Griffith University,Australia
Andrew Gildfind,Google, Inc.,Australia
Andrew Horner,University of Science & Technology,Hong Kong
Anna Ursyn,University of Northern Colorado,USA
Antonino Santos,University of A Coruna,Spain
Antonios Liapis,IT University of Copenhagen ,Denmark
Arne Eigenfeldt,Simon Fraser University,Canada
Artemis Sanchez Moroni,Renato Archer Research Center,Brazil
Benjamin Schroeder,Ohio State University,USA
Benjamin Smith,Indianapolis University, Purdue University,Indianapolis,USA
Bill Manaris,College of Charleston,USA
Brian Ross,Brock University,Canada
Carlos Grilo,Instituto Politécnico de Leiria,Portugal
Christian Jacob,University of Calgary,Canada
Colin Johnson,University of Kent,UK
Dan Ashlock,University of Guelph,Canada
Dan Costelloe,Independent Researcher (Solace One Ltd),Ireland
Dan Ventura,Brigham Young University,USA
Daniel Bisig,University of Zurich,Switzerland
Daniel Jones,Goldsmiths College, University of London,UK
Daniel Silva,University of Coimbra,Portugal
Douglas Repetto,Columbia University,USA
Eduardo Miranda,University of Plymouth,UK
Eelco den Heijer,Vrije Universiteit Amsterdam,Netherlands
Eleonora Bilotta ,University of Calabria,Italy
Francois Pachet,Sony CSL Paris,France
Gary Greenfield,University of Richmond,USA
Gary Nelson,Oerlin College,USA
Hans Dehlinger,Independent Artist,Germany
Hernán Kerlleñevich,National University of Quilmes,Argentina
J. E. Rowe,University of Birmingham,UK
Jane Prophet,Independent Artist,UK
Jate Reed,Imperial College,UK
John Collomosse,University of Surrey,UK
Jon McCormack,Monash University,Australia
Jonathan Byrne,University College Dublin,Ireland
Jonathan Eisenmann,Ohio State University,USA
José Fornari,NICS/Unicamp,Brazil
Kate Reed,Imperial College,UK
Marcelo Freitas Caetano,IRCAM,France
Marcos Nadal,University of Illes Balears,Spain
Matthew Lewis,Ohio State University,USA
Mauro Annunziato,Plancton Art Studio,Italy
Maximos Kaliakatsos-Papakostas,University of Patras,Greece
Michael O'Neill,University College Dublin,Ireland
Nicolas Monmarché,University of Tours,France
Pablo Gervás,Universidad Complutense de Madrid,Spain
Palle Dahlstedt,Göteborg University,Sweden
Patrick Janssen,National University of Singapure,Singapure
Paulo Urbano,Universidade de Lisboa,Portugal
Pedro Abreu,University of Coimbra,Portugal
Pedro Cruz,University of Coimbra,Portugal
Penousal Machado,University of Coimbra,Portugal
Peter Bentley,University College London ,UK
Peter Cariani,University of Binghamton,USA
Philip Galanter,Texas A&M College of Architecture,USA
Philippe Pasquier,Simon Fraser University,Canada
Rafael Ramirez,Pompeu Fabra University,Spain
Roger Malina,International Society for the Arts, Sciences and Technology,USA
Roisin Loughran,University of Limerick,Ireland
Ruli Manurung,University of Indonesia,Indonesia
Scott Draves,Independent Artist,USA
Somnuk Phon-Amnuaisuk,Brunei Institute of Technology,Malaysia
Stephen Todd,IBM,UK
Takashi Ikegami,Tokyo Institute of Technology,Japan
Tim Blackwell,Goldsmiths College, University of London,UK
Troy Innocent,Monash University,Australia
Usman Haque,Haque Design + Research Ltd,UK/Pakistan
Vic Ciesielski,RMIT,Australia
Yang Li,University of Science and Technology Beijing,China
----------------------------------------------------------------------------
Conference chairs
----------------------------------------------------------------------------
Juan Romero
University of A Coruna, Spain
jj(at)udc.es
James McDermott
University College Dublin, Ireland
jmmcd(at)jmmcd.net
Publication chair
Joao Correia, University of Coimbra
jncor(at)dei.uc.pt
**********************************************************
*
* 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/
*
**********************************************************
Please distribute
(Apologies for cross posting)
----------------------------------------------------------------------------
----------------------------------------------------------------------------
NEWS: Submission deadline extended to Nov 11
----------------------------------------------------------------------------
CALL FOR PAPERS
evomusart 2014
http://www.evostar.org/cfpEvoMUSART.html
3rd International Conference on Evolutionary and Biologically Inspired
Music, Sound, Art and Design
April 2014, GRANADA, Spain
Part of evo* 2014
evo*: http://www.evostar.org
----------------------------------------------------------------------------
New this year: Special track on Artificial Neural Networks applied to
Music, Sound, Art and Design
----------------------------------------------------------------------------
LEONARDO Special Section
----------------------------------------------------------------------------
Authors of selected papers will be invited to submit expanded versions
of their work for a planned special section on Evolutionary Art of the
MIT Press journal "Leonardo".
----------------------------------------------------------------------------
----------------------------------------------------------------------------
Following the success of previous events and the importance of the
field of evolutionary and biologically inspired (artificial neural
network, swarm, alife) music, sound, art and
design, evomusart has become an evo* conference with independent
proceedings since 2012. Thus, evomusart 2014 is the twelfth European
Event and the third International Conference on Evolutionary and
Biologically Inspired Music, Sound, Art and Design.
The use of biologically inspired techniques for the development of
artistic systems is a recent, exciting and significant area of
research. There is a growing interest in the application of these
techniques in fields such as: visual art and music generation,
analysis, and interpretation; sound synthesis; architecture; video;
poetry; design; and other creative tasks.
The main goal of evomusart 2014 is to bring together researchers who
are using biologically inspired computer techniques for artistic
tasks, providing the opportunity to promote, present and discuss
ongoing work in the area.
The event will be held in April, 2014 in Granada, Andalusia, Spain, as
part of the evo* event.
----------------------------------------------------------------------------
Publication Details
----------------------------------------------------------------------------
Submissions will be rigorously reviewed for scientific and artistic
merit. Accepted papers will be presented orally or as posters at the
event and included in the evomusart proceedings, published by Springer
Verlag in a dedicated volume of the Lecture Notes in Computer Science
series. The acceptance rate at evomusart 2013 was 30.5% for papers
accepted for oral presentation, or 44.4% for oral and poster
presentation combined. The evomusart 2013 submissions received on
average 3.4 reviews each.
New this year: submitters are strongly encouraged to provide in all
papers a link for download of media demonstrating their results,
whether music, images, video, or other media types. Links should be
anonymised for double-blind review, e.g. using a URL shortening
service.
----------------------------------------------------------------------------
Topics of interest
----------------------------------------------------------------------------
Submissions should concern the use of biologically inspired computer
techniques -- e.g. Evolutionary Computation, Artificial Life,
Artificial Neural Networks, Swarm Intelligence, other artificial
intelligence techniques -- in the generation, analysis and
interpretation of art, music, design, architecture and other artistic
fields. Topics of interest include, but are not limited to:
-- Generation
- Biologically Inspired Design and Art -- Systems that create
drawings, images, animations, sculptures, poetry, text, designs,
webpages, buildings, etc.;
- Biologically Inspired Sound and Music -- Systems that create
musical pieces, sounds, instruments, voices, sound effects, sound
analysis, etc.;
- Robotic-Based Evolutionary Art and Music;
- Other related artificial intelligence or generative techniques in
the fields of Computer Music, Computer Art, etc.;
-- Theory
- Computational Aesthetics, Experimental Aesthetics; Emotional
Response, Surprise, Novelty;
- Representation techniques;
- Surveys of the current state-of-the-art in the area; identification
of weaknesses and strengths; comparative analysis and classification;
- Validation methodologies;
- Studies on the applicability of these techniques to related areas;
- New models designed to promote the creative potential of
biologically inspired computation;
-- Computer Aided Creativity and computational creativity
- Systems in which biologically inspired computation is used to
promote the creativity of a human user;
- New ways of integrating the user in the evolutionary cycle;
- Analysis and evaluation of: the artistic potential of biologically
inspired art and music; the artistic processes inherent to these
approaches; the resulting artefacts;
- Collaborative distributed artificial art environments;
-- Automation
- Techniques for automatic fitness assignment;
- Systems in which an analysis or interpretation of the artworks is
used in conjunction with biologically inspired techniques to produce
novel objects;
- Systems that resort to biologically inspired computation to perform
the analysis of image, music, sound, sculpture, or some other types of
artistic object.
----------------------------------------------------------------------------
Important Dates (to be confirmed)
----------------------------------------------------------------------------
Submission: November 11 2013
Notification to authors: December 2013
Camera-ready deadline: January 2014
Evo*: April 2014
----------------------------------------------------------------------------
Additional information and submission details
----------------------------------------------------------------------------
Submit your manuscript, at most 12 A4 pages long, in Springer LNCS
format (instructions downloadable from
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) no later
than November 1, 2013 (date to be confirmed).
Submission link: http://myreview.csregistry.org/evomusart14
page limit: 12 pages
The reviewing process will be double-blind; please omit information
about the authors in the submitted paper.
----------------------------------------------------------------------------
Programme committee
----------------------------------------------------------------------------
Adrian Carballal,University of A Coruna,Spain
Alain Lioret,Paris 8 University,France
Alan Dorin,Monash University,Australia
Alejandro Pazos,University of A Coruna,Spain
Alice Eldridge,Monash University,Australia
Amilcar Cardoso,University of Coimbra,Portugal
Amy K. Hoover,University of Central Florida,USA
Andrew Brown,Griffith University,Australia
Andrew Gildfind,Google, Inc.,Australia
Andrew Horner,University of Science & Technology,Hong Kong
Anna Ursyn,University of Northern Colorado,USA
Antonino Santos,University of A Coruna,Spain
Antonios Liapis,IT University of Copenhagen ,Denmark
Arne Eigenfeldt,Simon Fraser University,Canada
Artemis Sanchez Moroni,Renato Archer Research Center,Brazil
Benjamin Schroeder,Ohio State University,USA
Benjamin Smith,Indianapolis University, Purdue University,Indianapolis,USA
Bill Manaris,College of Charleston,USA
Brian Ross,Brock University,Canada
Carlos Grilo,Instituto Politécnico de Leiria,Portugal
Christian Jacob,University of Calgary,Canada
Colin Johnson,University of Kent,UK
Dan Ashlock,University of Guelph,Canada
Dan Costelloe,Independent Researcher (Solace One Ltd),Ireland
Dan Ventura,Brigham Young University,USA
Daniel Bisig,University of Zurich,Switzerland
Daniel Jones,Goldsmiths College, University of London,UK
Daniel Silva,University of Coimbra,Portugal
Douglas Repetto,Columbia University,USA
Eduardo Miranda,University of Plymouth,UK
Eelco den Heijer,Vrije Universiteit Amsterdam,Netherlands
Eleonora Bilotta ,University of Calabria,Italy
Francois Pachet,Sony CSL Paris,France
Gary Greenfield,University of Richmond,USA
Gary Nelson,Oerlin College,USA
Hans Dehlinger,Independent Artist,Germany
Hernán Kerlleñevich,National University of Quilmes,Argentina
J. E. Rowe,University of Birmingham,UK
Jane Prophet,Independent Artist,UK
Jate Reed,Imperial College,UK
John Collomosse,University of Surrey,UK
Jon McCormack,Monash University,Australia
Jonathan Byrne,University College Dublin,Ireland
Jonathan Eisenmann,Ohio State University,USA
José Fornari,NICS/Unicamp,Brazil
Kate Reed,Imperial College,UK
Marcelo Freitas Caetano,IRCAM,France
Marcos Nadal,University of Illes Balears,Spain
Matthew Lewis,Ohio State University,USA
Mauro Annunziato,Plancton Art Studio,Italy
Maximos Kaliakatsos-Papakostas,University of Patras,Greece
Michael O'Neill,University College Dublin,Ireland
Nicolas Monmarché,University of Tours,France
Pablo Gervás,Universidad Complutense de Madrid,Spain
Palle Dahlstedt,Göteborg University,Sweden
Patrick Janssen,National University of Singapure,Singapure
Paulo Urbano,Universidade de Lisboa,Portugal
Pedro Abreu,University of Coimbra,Portugal
Pedro Cruz,University of Coimbra,Portugal
Penousal Machado,University of Coimbra,Portugal
Peter Bentley,University College London ,UK
Peter Cariani,University of Binghamton,USA
Philip Galanter,Texas A&M College of Architecture,USA
Philippe Pasquier,Simon Fraser University,Canada
Rafael Ramirez,Pompeu Fabra University,Spain
Roger Malina,International Society for the Arts, Sciences and Technology,USA
Roisin Loughran,University of Limerick,Ireland
Ruli Manurung,University of Indonesia,Indonesia
Scott Draves,Independent Artist,USA
Somnuk Phon-Amnuaisuk,Brunei Institute of Technology,Malaysia
Stephen Todd,IBM,UK
Takashi Ikegami,Tokyo Institute of Technology,Japan
Tim Blackwell,Goldsmiths College, University of London,UK
Troy Innocent,Monash University,Australia
Usman Haque,Haque Design + Research Ltd,UK/Pakistan
Vic Ciesielski,RMIT,Australia
Yang Li,University of Science and Technology Beijing,China
----------------------------------------------------------------------------
Conference chairs
----------------------------------------------------------------------------
Juan Romero
University of A Coruna, Spain
jj(at)udc.es
James McDermott
University College Dublin, Ireland
jmmcd(at)jmmcd.net
Publication chair
Joao Correia, University of Coimbra
jncor(at)dei.uc.pt
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Call for Book Chapter Proposals: Simulation-Optimization Approaches
----------------------------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------------------------
CALL FOR BOOK CHAPTER PROPOSALS
Getting into Practice : Simulation-Optimization Approaches
The use of simulation‐optimization approaches in logistics, industrial, and
aeronautical operations
Springer Handbook
Miguel Mujica, Idalia Flores, and Daniel Guimarans (Eds.)
----------------------------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------------------------
Upcoming Deadline: 1st December 2013 - intention to prepare a manuscript
Contact us: m.mujica.mota@hva.nl<mailto:m.mujica.mota@hva.nl>, idalia@unam.mx<mailto:idalia@unam.mx>, daniel.guimarans@nicta.com.au<mailto:daniel.guimarans@nicta.com.au>
Simulation is a well‐known approach that can have different abstraction levels and can integrate different elements of a studied system. It consists in the development of a representation of a system (logistics one, manufacturing, operative, etc.) using modelling formalisms, off‐the‐shelf software programs, or programming languages. It is commonly used at industrial level to obtain a better understanding of the studied system. With the use of the model different experiments may be carried out in order to test different research questions, such as the performance of new configurations, identify bottlenecks in the current system, and inefficiencies that are perceived as an increase in operative costs. Unfortunately, the experiments alone cannot ensure the optimal configurations for the objective pursued (allocation of resources, minimizing operative costs, increase throughput etc.). On the other hand, optimization techniques are very‐well‐accepted techniques which consist in the representation of the problem under study taking into account only the key variables, dependencies, and restrictions of a problem. The main argument against them is that the abstraction process often leaves out of the scope some key elements that participate and affect the performance of a system, giving as a result a potential optimal solution that sometimes results difficult or impossible to implement in the real system.
The book will present techniques, case studies, and methodologies that combine the use of simulation approaches with optimization techniques for facing problems in manufacturing, logistics, or aeronautical problems, which aim at overcoming the shortcomings of both approaches through the combination of them. The book will present detailed techniques and research studies that cope with common industrial problems in several fields, which range from manufacturing to aviation problems, where the common denominator is the combination of simulation's flexibility with optimization techniques' robustness.
The benefit to the reader will be a comprehensive guide to tackle similar problems in industrial environments. The problems presented will serve only as an example, but methodologies used by the scientific community will be of high value in order to cope with complex problems.
------------------------------------------------------------------------------------------
Topics of Interest
------------------------------------------------------------------------------------------
+ Supply Chain
+ Manufacturing
+ Transportation
+ Aeronautical Operations (Terminal, Side, Services)
+ Facility Location
+ Routing Problems
+ Simulation‐Optimization Methodologies
+ Urban logistics
+ Ports and Sea Transport
We strongly welcome other topic suggestions dealing with convergence of the two approaches into an integrated methodology beyond the topics suggested above.
------------------------------------------------------------------------------------------
Schedule & Deadlines
------------------------------------------------------------------------------------------
- 1st December 2013
Notification for intending to contribute with a book chapter to help us in planning the review process (authors, preliminary title, and brief abstract of max. 250 words)
- 31st January 2014
1st manuscript version (also authors who did not notify us their intention to contribute are invited to submit)
- 1st March 2014
Review comments for 1st manuscript version and notification of acceptance
- 8th July 2014
Submission of the 2nd version of accepted book chapters
- 30th July 2014
Feedback from the editors if all criteria are met (e.g. page count, correct template, review comments addressed, appropriate English language, etc.)
- 15th September 2014
Final manuscripts to be sent to Springer. Thereafter manuscripts cannot be updated (strict deadline)
------------------------------------------------------------------------------------------
Manuscript Preparation
------------------------------------------------------------------------------------------
- Please prepare your manuscript according the following guidelines:
http://www.springer.com/authors/book+authors?SGWID=0‐154102‐12‐417900‐0
- Send the following files as one .zip file to one of the editors:
+ Authors short bios (collected in one word file)
+ Picture of each author
+ Original manuscript in word, LaTeX, or any other word processing format
+ PDF version of the manuscript
- Make sure that the following conditions are met for the final version of the chapter:
+ The submissions need proper English language editing. Please ensure that your final submission is proof read and written in proper English language
+ The submissions follow the Springer template
+ Each submission has to be structured according the following 'template':
* Introduction and problem discussion
* Literature state of the art/Literature Review
* Methodology & Approach
* ... other content of the chapter ...
* Viewpoint on Convergence (min. 1/2 page, or add to the Conclusions section)
* Conclusions
------------------------------------------------------------------------------------------
Editors:
Dr. Miguel Mújica Mota, Amsterdam University of Applied Sciences, Netherlands. m.mujica.mota@hva.nl<mailto:m.mujica.mota@hva.nl>
Dr. Idalia Flores de la Mota, National Autonomous University of Mexico, Mexico. idalia@unam.mx<mailto:idalia@unam.mx>
Dr. Daniel Guimarans Serrano, National ICT Australia, Australia. daniel.guimarans@nicta.com.au<mailto:daniel.guimarans@nicta.com.au>
Daniel Guimarans
Researcher
NICTA l Lvl 5, 13 Garden Street l Eveleigh NSW 2015 l
Australia
Locked Bag 9013 l Alexandria NSW 2015
T + 61 2 9376 2073
Twitter http://twitter.com/NICTA
www.nicta.com.au<http://www.nicta.com.au/> | daniel.guimarans@nicta.com.au<mailto:firstname.lastname@nicta.com.au>
Research Excellence in ICT
Wealth Creation for Australia
**********************************************************
*
* 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/
*
**********************************************************
[Mycolleagues] NSF Workshop on Self-Organizing Particle Systems (with SODA)
Registration is now open at http://sops2014.cs.upb.de/registration.html
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
======================================================
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
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women, and under-represented minorities. Application deadline: November 17, 2013
[DMANET] 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 time-limited 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.
**********************************************************
*
* 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 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 time-limited 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.
**********************************************************
*
* 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 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.
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 Nordström (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.
**********************************************************
*
* 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
