We apologize if you receive multiple copies of this message.
**************************************************************************
Call for Prize Nomination
Prize for Innovation in Distributed Computing
Awarded by the Colloquium on Structural Information and
Communication Complexity (SIROCCO)
**************************************************************************
The Prize for Innovation In Distributed Computing was established to
recognize individuals whose research contributions expanded the collective
investigative horizon in SIROCCO's area of interest. That is, they formulated
new problems, or identified new research areas, that were at the time of
their introduction unorthodox and outside the mainstream, but later attracted
the interest of SIROCCO's community.
This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of the
SIROCCO conference.
(SIROCCO 2013 is going to be held on July 1–3, 2013, Ischia, Italy; papers
submission deadline is April 21st).
The prize is presented at the annual meeting of the SIROCCO conference, but
may not necessarily be awarded every year.
Passed prize winners are Nicola Santoro, Jean-Claude Bermond, David Peleg,
and Roger Wattenhofer.
Eligibility
The following conditions must be met by the nominees to be eligible for the
prize.
(1) The original innovative contribution was introduced by the nominee(s) for
the first time in a publication at least five years before the nomination
deadline, and the publication must have appeared in a conference proceedings
or a scientific journal.
(2) At least one paper (co)authored by the nominee(s), either the original
paper, or a paper directly related to the innovative contribution, must have
appeared in SIROCCO proceedings.
Past SIROCCO papers and authors can be found at indexing sites, e.g. Google
Scholar or
http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.
Selection process
The prize winners are selected by the Award Committee composed of the current
Steering Committee (SC) Chair of the SIROCCO conference, the PC chairs,
including co-chairs, of the three SIROCCO conferences immediately preceding
the nominations deadline, plus one additional member of the Advisory Board,
selected by the Steering Committee for the current year.
In 2013, the Award Committee consists of: Shay Kutten (Technion)- chair Guy
Even (Tel Aviv University) David Peleg (Weizmann) Boaz Patt-Shamir (Tel Aviv
University) Masafumi Yamashita (Kyushu University)
A call for nomination is disseminated every year in the main mailing lists of
the Distributed Computing community, at least four months prior to the date
of that year's SIROCCO meeting.
Nominations can be made by any member of the scientific community. Each
nomination must identify the person(s) being nominated, and justify the
nomination by a short text including:
(a) a brief description of the innovative contribution in Distributed
Computing to be recognized by the award, and an explanation of its
originality and significance,
(b) the paper(s) of the nominee(s) that establish their eligibility as
described in the Eligibility section above items (1) and (2).
Nominations for 2013 should be sent to the Steering Committee chair of
SIROCCO: kutten@ie.technion.ac.il by April 23rd, 2013. Please write SIROCCO
Prize Nomination in the subject line.
Kind Regards,
Gennaro Cordasco
Seconda Universita' degli Studi di Napoli
Viale Ellittico, 81100 Caserta ITALY
e-mail: gennaro.cordasco[@]unina2.it
https://sites.google.com/site/cordasco/
Thursday, March 7, 2013
PODS 2013 - Accepted Papers
Dear colleagues,
It is my pleasure to announce the list of accepted papers for the
32nd SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS 2013)
June 24-26, 2013, New York, USA.
The PODS program will also feature a keynote by Diego Calvanese
of the Free University of Bozen-Bolzano, and two invited tutorials, one by
Piotr Indyk of MIT, and another one by Pablo Barcelo of Universidad de Chile.
Wenfei Fan
PODS 2013 PC Chair
http://www.sigmod.org/2013/
===========================================
Serge Abiteboul and Victor Vianu. Collaborative Data-Driven Workflows:
Think Global, Act Local
Azza Abouzied, Dana Angluin, Christos Papadimitriou, Joseph Hellerstein
and Avi Silberschatz. Learning and Verifying Quantified Boolean Queries by
Example
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi
and Wuzhou Zhang. Nearest Neighbor Searching Under Uncertainty II
Tom Ameloot, Jan Van den Bussche and Emmanuel Waller. On the expressive
power of update primitives
Guillaume Bagan, Angela Bonifati and Benoit Groz. A Trichotomy for Regular
Simple Path Queries on Graphs
Pablo Barceló, Miguel Romero and Moshe Vardi. Semantic Acyclicity on Graph
Databases
Paul Beame, Paraschos Koutris and Dan Suciu. Counting Communication Steps
for Parallel Query Processing
Meghyn Bienvenu, Balder Ten Cate, Carsten Lutz and Frank Wolter.
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and
MMSNP
Mikolaj Bojanczyk, Luc Segoufin and Szymon Toruńczyk. Verification of
database-driven systems via amalgamation
Hubie Chen and Moritz Mueller. The Fine Classification of Conjunctive
Queries and Parameterized Logarithmic Space Complexity
Ronald Fagin, Benny Kimelfeld, Frederick Reiss and Stijn Vansummeren.
Spanners: A Formal Framework for Information Extraction
Diego Figueira. On XPath with transitive axes and data tests
Amelie Gheerbrant, Leonid Libkin and Cristina Sirangelo. When is Naive
Evaluation Possible?
Georg Gottlob. Deciding Monotone Duality and Identifying Frequent Item
Sets in Quadratic Logspace
Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch
and Marco Montali. Verification of Relational Data-Centric Dynamic Systems
with External Services
André Hernich, Clemens Kupke, Thomas Lukasiewicz and Georg Gottlob.
Well-Founded Semantics for Extended Datalog and Ontological Reasoning
Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on
classes of structures with bounded expansion
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas
Tsichlas and Jeonghun Yoon. I/O-Efficient Planar Range Skyline and
Attrition Priority Queues
Benny Kimelfeld and Phokion Kolaitis. The Complexity of Mining Maximal
Frequent Subgraphs
Leonid Libkin, Juan L. Reutter and Domagoj Vrgoc. TriAL for RDF: Adapting
Graph Query Languages for RDF Data
Jerzy Marcinkowski and Tomasz Gogacz. On the BDD/FC Conjecture
Sebastian Rudolph and Markus Krötzsch. Flag & Check: Data Access with
Monadically Defined Queries
Jef Wijsen. Charting the Tractability Frontier of Certain Conjunctive
Query Answering
Limsoon Wong. A Dichotomy in the Intensional Expressive Power of Nested
Relational Calculi augmented with Aggregate Functions and a Powerset
Operator
It is my pleasure to announce the list of accepted papers for the
32nd SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS 2013)
June 24-26, 2013, New York, USA.
The PODS program will also feature a keynote by Diego Calvanese
of the Free University of Bozen-Bolzano, and two invited tutorials, one by
Piotr Indyk of MIT, and another one by Pablo Barcelo of Universidad de Chile.
Wenfei Fan
PODS 2013 PC Chair
http://www.sigmod.org/2013/
===========================================
Serge Abiteboul and Victor Vianu. Collaborative Data-Driven Workflows:
Think Global, Act Local
Azza Abouzied, Dana Angluin, Christos Papadimitriou, Joseph Hellerstein
and Avi Silberschatz. Learning and Verifying Quantified Boolean Queries by
Example
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi
and Wuzhou Zhang. Nearest Neighbor Searching Under Uncertainty II
Tom Ameloot, Jan Van den Bussche and Emmanuel Waller. On the expressive
power of update primitives
Guillaume Bagan, Angela Bonifati and Benoit Groz. A Trichotomy for Regular
Simple Path Queries on Graphs
Pablo Barceló, Miguel Romero and Moshe Vardi. Semantic Acyclicity on Graph
Databases
Paul Beame, Paraschos Koutris and Dan Suciu. Counting Communication Steps
for Parallel Query Processing
Meghyn Bienvenu, Balder Ten Cate, Carsten Lutz and Frank Wolter.
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and
MMSNP
Mikolaj Bojanczyk, Luc Segoufin and Szymon Toruńczyk. Verification of
database-driven systems via amalgamation
Hubie Chen and Moritz Mueller. The Fine Classification of Conjunctive
Queries and Parameterized Logarithmic Space Complexity
Ronald Fagin, Benny Kimelfeld, Frederick Reiss and Stijn Vansummeren.
Spanners: A Formal Framework for Information Extraction
Diego Figueira. On XPath with transitive axes and data tests
Amelie Gheerbrant, Leonid Libkin and Cristina Sirangelo. When is Naive
Evaluation Possible?
Georg Gottlob. Deciding Monotone Duality and Identifying Frequent Item
Sets in Quadratic Logspace
Babak Bagheri Hariri, Diego Calvanese, Giuseppe De Giacomo, Alin Deutsch
and Marco Montali. Verification of Relational Data-Centric Dynamic Systems
with External Services
André Hernich, Clemens Kupke, Thomas Lukasiewicz and Georg Gottlob.
Well-Founded Semantics for Extended Datalog and Ontological Reasoning
Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on
classes of structures with bounded expansion
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis, Kostas
Tsichlas and Jeonghun Yoon. I/O-Efficient Planar Range Skyline and
Attrition Priority Queues
Benny Kimelfeld and Phokion Kolaitis. The Complexity of Mining Maximal
Frequent Subgraphs
Leonid Libkin, Juan L. Reutter and Domagoj Vrgoc. TriAL for RDF: Adapting
Graph Query Languages for RDF Data
Jerzy Marcinkowski and Tomasz Gogacz. On the BDD/FC Conjecture
Sebastian Rudolph and Markus Krötzsch. Flag & Check: Data Access with
Monadically Defined Queries
Jef Wijsen. Charting the Tractability Frontier of Certain Conjunctive
Query Answering
Limsoon Wong. A Dichotomy in the Intensional Expressive Power of Nested
Relational Calculi augmented with Aggregate Functions and a Powerset
Operator
Wednesday, March 6, 2013
[DMANET] Reminder: Workshop "Young Women in Discrete Mathematics", June 7-9, 2013
Dear all,
this is a short reminder of the workshop "Young Women in Discrete
Mathematics".
"YOUNG WOMEN IN DISCRETE MATHEMATICS"
http://www.or.uni-bonn.de/youngwomen
Date: Friday, June 7, noon -- Sunday, June 9, noon, 2013
Place: Research Institute for Discrete Mathematics, University of Bonn,
Germany
Description:
The aim of the workshop is to provide a platform for young female
researchers in Discrete Mathematics and applications for scientific
discussion and exchange of ideas.
Plenary speaker will be Prof. Angelika Steger from ETH Zuerich.
Applications:
We invite advanced master students, PhD students and postdocs to apply
for participation.
An abstract for a contributed talk is requested.
Applications should be sent by email to suhl@or.uni-bonn.de including a
CV and a list of publications.
Deadline for applications is *March 15, 2013*. Notifications will be
sent out shortly after the deadline.
Accommodation will be provided. Financial support for travel can be granted.
For further information please visit
http://www.or.uni-bonn.de/youngwomen
or contact
Ulrike Suhl suhl@or.uni-bonn.de
Research Institute for Discrete Mathematics
Lennéstr. 2, 53113 Bonn, Germany
Tel.: +49-228-738751
**********************************************************
*
* 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/
*
**********************************************************
this is a short reminder of the workshop "Young Women in Discrete
Mathematics".
"YOUNG WOMEN IN DISCRETE MATHEMATICS"
http://www.or.uni-bonn.de/youngwomen
Date: Friday, June 7, noon -- Sunday, June 9, noon, 2013
Place: Research Institute for Discrete Mathematics, University of Bonn,
Germany
Description:
The aim of the workshop is to provide a platform for young female
researchers in Discrete Mathematics and applications for scientific
discussion and exchange of ideas.
Plenary speaker will be Prof. Angelika Steger from ETH Zuerich.
Applications:
We invite advanced master students, PhD students and postdocs to apply
for participation.
An abstract for a contributed talk is requested.
Applications should be sent by email to suhl@or.uni-bonn.de including a
CV and a list of publications.
Deadline for applications is *March 15, 2013*. Notifications will be
sent out shortly after the deadline.
Accommodation will be provided. Financial support for travel can be granted.
For further information please visit
http://www.or.uni-bonn.de/youngwomen
or contact
Ulrike Suhl suhl@or.uni-bonn.de
Research Institute for Discrete Mathematics
Lennéstr. 2, 53113 Bonn, Germany
Tel.: +49-228-738751
**********************************************************
*
* 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] ALEA 2013 - Second Call for Papers
* Our apologies if you receive multiple copies of this announcement *
********************************************
ALEA 2013
********************************************
Artificial Life and Evolutionary Algorithms
(ALEA is a thematic track of EPIA 2013)
http://www.epia2013.uac.pt/
September 9-13, 2013
Azores - Portugal
Submission deadline:
March 15, 2013
ALEA is dedicated to the theory and applications of Artificial Life and
Evolutionary Algorithms. It has been a track of the biennial
international EPIA conferences since 2003, aiming to bring together
researchers and practitioners from different backgrounds and domains,
and providing a pleasant venue for the fruitful discussion of current
developments and applications.
--> This year ALEA will take place in the Azores,
beautiful portuguese islands in the Mid-Atlantic:
http://en.wikipedia.org/wiki/Azores
http://www.google.com/images?q=azores
ALEA invites contributions in all aspects related to Artificial Life and
Evolutionary Algorithms, ranging from theoretical work to innovative
applications. Topics of interest include, but are not limited to:
- Artificial Chemistries
- Artificial Immune Systems
- Classifier Systems
- Complex Networks
- Emergent Behaviours
- Evolution and Learning Dynamics
- Evolutionary Algorithms
- Evolutionary Optimization
- Evolutionary Robotics
- Genetic Programming
- Hybrid Approaches
- Multi-objective Optimization
- Origins of Life
- Parallel Evolutionary Algorithms
- Self-organizing Systems
- Swarm Intelligence
Submissions must be original and not published elsewhere. Please note
that ALEA only accepts full papers (not short 6-page papers or 4-page
demonstrations). Papers should not exceed 12 pages in length and must be
formatted according to Springer's LNCS instructions for authors. Papers
must be submitted in PDF and will not be accepted in any other format.
Papers that exceed 12 pages or do not follow the LNCS guidelines risk
being rejected automatically without a review. More information and
templates of the LNCS format is available on this Springer website:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0
The submissions will be peer reviewed by at least three members of the
Programme Committee. The reviewing process is double blind, so authors
should remove names and affiliations from the submitted papers, and must
take reasonable care not to indirectly disclose their identity.
References to own work can be included in the paper, but should be
referred to in the third person.
The authors of accepted papers will have to improve their paper on the
basis of the recommendations from the reviewers and will be asked to
send a camera ready version of their manuscripts. Even though the
submissions can be made in PDF (preferable) or PS, we encourage authors
to prepare their papers in TEX or LATEX because these are more
convenient source formats for the camera ready final version. At least
one author of each accepted work must register for the conference and
present the work.
Accepted papers will be presented orally or as posters. The best
accepted papers will appear in the proceedings published by Springer in
the Lecture Notes in Artificial Intelligence (LNAI), a subseries of
LNCS. The remaining accepted papers will be published in a local
edition, both in hard-copy, CD-ROM and on the web.
Important Dates:
- Paper submission: March 15
- Acceptance notifications: April 30
- Camera-ready papers: May 31
- ALEA 2013: September 9-13
Programme chairs:
- Leonardo Vanneschi
ISEGI, Universidade Nova de Lisboa, Portugal
lvanneschi@isegi.unl.pt
- Sara Silva
INESC-ID Lisboa, Portugal
sara@kdbio.inesc-id.pt
- Francisco B. Pereira
Instituto Superior de Engenharia de Coimbra, Portugal
xico@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/
*
**********************************************************
********************************************
ALEA 2013
********************************************
Artificial Life and Evolutionary Algorithms
(ALEA is a thematic track of EPIA 2013)
http://www.epia2013.uac.pt/
September 9-13, 2013
Azores - Portugal
Submission deadline:
March 15, 2013
ALEA is dedicated to the theory and applications of Artificial Life and
Evolutionary Algorithms. It has been a track of the biennial
international EPIA conferences since 2003, aiming to bring together
researchers and practitioners from different backgrounds and domains,
and providing a pleasant venue for the fruitful discussion of current
developments and applications.
--> This year ALEA will take place in the Azores,
beautiful portuguese islands in the Mid-Atlantic:
http://en.wikipedia.org/wiki/Azores
http://www.google.com/images?q=azores
ALEA invites contributions in all aspects related to Artificial Life and
Evolutionary Algorithms, ranging from theoretical work to innovative
applications. Topics of interest include, but are not limited to:
- Artificial Chemistries
- Artificial Immune Systems
- Classifier Systems
- Complex Networks
- Emergent Behaviours
- Evolution and Learning Dynamics
- Evolutionary Algorithms
- Evolutionary Optimization
- Evolutionary Robotics
- Genetic Programming
- Hybrid Approaches
- Multi-objective Optimization
- Origins of Life
- Parallel Evolutionary Algorithms
- Self-organizing Systems
- Swarm Intelligence
Submissions must be original and not published elsewhere. Please note
that ALEA only accepts full papers (not short 6-page papers or 4-page
demonstrations). Papers should not exceed 12 pages in length and must be
formatted according to Springer's LNCS instructions for authors. Papers
must be submitted in PDF and will not be accepted in any other format.
Papers that exceed 12 pages or do not follow the LNCS guidelines risk
being rejected automatically without a review. More information and
templates of the LNCS format is available on this Springer website:
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0
The submissions will be peer reviewed by at least three members of the
Programme Committee. The reviewing process is double blind, so authors
should remove names and affiliations from the submitted papers, and must
take reasonable care not to indirectly disclose their identity.
References to own work can be included in the paper, but should be
referred to in the third person.
The authors of accepted papers will have to improve their paper on the
basis of the recommendations from the reviewers and will be asked to
send a camera ready version of their manuscripts. Even though the
submissions can be made in PDF (preferable) or PS, we encourage authors
to prepare their papers in TEX or LATEX because these are more
convenient source formats for the camera ready final version. At least
one author of each accepted work must register for the conference and
present the work.
Accepted papers will be presented orally or as posters. The best
accepted papers will appear in the proceedings published by Springer in
the Lecture Notes in Artificial Intelligence (LNAI), a subseries of
LNCS. The remaining accepted papers will be published in a local
edition, both in hard-copy, CD-ROM and on the web.
Important Dates:
- Paper submission: March 15
- Acceptance notifications: April 30
- Camera-ready papers: May 31
- ALEA 2013: September 9-13
Programme chairs:
- Leonardo Vanneschi
ISEGI, Universidade Nova de Lisboa, Portugal
lvanneschi@isegi.unl.pt
- Sara Silva
INESC-ID Lisboa, Portugal
sara@kdbio.inesc-id.pt
- Francisco B. Pereira
Instituto Superior de Engenharia de Coimbra, Portugal
xico@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/
*
**********************************************************
Tuesday, March 5, 2013
[DMANET] KTP Research Associate at University of Nottingham and Webroster
Knowledge Transfer Partnership Research Associate (Fixed-term)
http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI1202x1
Closing Date: Thursday, 7th March 2013
School of Computer Science, University of Nottingham, and Webroster Ltd, UK
£22,000 - £24,000 per annum, depending on skills & experience.
Applicants are invited to apply for the above role which is a Knowledge Transfer Partnership (KTP) between the School of Computer Science and Webroster Ltd. This project will focus on improving homecare workforce utilisation by developing an adaptable software optimisation engine to tackle workforce management scenarios that include both rostering and routing. A software developer is required to join our team to develop web-based optimisation software for Webroster Ltd.
This is an exciting opportunity for a graduate in Computer Science or related discipline to work in a dynamic commercial environment, with the benefit of access to academic research, supervision, support and advice. A comprehensive and tailored training and development package will enable the person appointed to meet the professional demands of the project and their personal aspirations.
The successful candidate will design and implement various software modules working in collaboration with other developers at the company while also interacting with the academic team at the University of Nottingham.
Candidates should have a good BSc degree or equivalent in Computer Science or closely related discipline, however graduates from different disciplines with a Masters degree in computer science or similar are also welcome to apply. Knowledge and experience with programming tools such as C#, Visual Basic, Java, JavaScript, ASP.NET or similar are essential along with experience with relational database design and SQL. Candidates should also have experience of full development lifecycle from specifications through to testing, flexible problem solving skills to develop creative solutions to changes in a dynamic business and excellent communication skills to deal with a variety of people at different levels.
This post will be offered on a fixed-term contract for a period of two years.
Knowledge Transfer Partnerships is a government funded technology transfer initiative that supports partnerships between business and universities, placing graduates on challenging, high profile projects. Further information is available at: http://www.ktponline.org.uk.
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI1202x1
Closing Date: Thursday, 7th March 2013
School of Computer Science, University of Nottingham, and Webroster Ltd, UK
£22,000 - £24,000 per annum, depending on skills & experience.
Applicants are invited to apply for the above role which is a Knowledge Transfer Partnership (KTP) between the School of Computer Science and Webroster Ltd. This project will focus on improving homecare workforce utilisation by developing an adaptable software optimisation engine to tackle workforce management scenarios that include both rostering and routing. A software developer is required to join our team to develop web-based optimisation software for Webroster Ltd.
This is an exciting opportunity for a graduate in Computer Science or related discipline to work in a dynamic commercial environment, with the benefit of access to academic research, supervision, support and advice. A comprehensive and tailored training and development package will enable the person appointed to meet the professional demands of the project and their personal aspirations.
The successful candidate will design and implement various software modules working in collaboration with other developers at the company while also interacting with the academic team at the University of Nottingham.
Candidates should have a good BSc degree or equivalent in Computer Science or closely related discipline, however graduates from different disciplines with a Masters degree in computer science or similar are also welcome to apply. Knowledge and experience with programming tools such as C#, Visual Basic, Java, JavaScript, ASP.NET or similar are essential along with experience with relational database design and SQL. Candidates should also have experience of full development lifecycle from specifications through to testing, flexible problem solving skills to develop creative solutions to changes in a dynamic business and excellent communication skills to deal with a variety of people at different levels.
This post will be offered on a fixed-term contract for a period of two years.
Knowledge Transfer Partnerships is a government funded technology transfer initiative that supports partnerships between business and universities, placing graduates on challenging, high profile projects. Further information is available at: http://www.ktponline.org.uk.
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] A joint Italian-Israeli post doc program on advanced algorithms in computer science
Leonardo Fibonacci fellowships - a joint postdoctoral program of I-CORE
Algo, CNR and ENEA
----------------------------------------------------------------------------
---------------------------------------------------------------------
I-CORE Algo - the Israeli Center of Research Excellence in algorithms,
CNR - the National Research Council of Italy and ENEA - the Italian National
agency for new technologies,
Energy and sustainable economic development are seeking excellent candidates
for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation in
science and technology
between Italy and Israel, under the auspices of the Italian-Israeli
Agreement on Industrial,
Scientific and Technological Cooperation. CNR and ENEA participate in the
program to help open
new paths towards excellence for young researchers, some of whom will
eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian mathematician
Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.I-CORE Algo
is part of the I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council of
Higher Education in order to
reinforce Israel's intellectual capacities and promote synergy among
Israel's leading research centers.
The members of the center are some of Israel's most exceptional computer
scientists, from The Blavatnik School
of Computer Science in Tel Aviv University, The Rachel and Selim Benin
School of Computer Science and Engineering
in The Hebrew University of Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS
Researches of any nationality can apply to the program,
given that they obtained their PhD (Dottorato di Ricerca)
from an institution in Italy no longer than 2 years before
the date of the application, or will obtain it within 3 months
after the application. EU nationals can apply independently of
where they have obtained their degree, within the same temporal frame.
Equal opportunity is a principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis,
by publications, if any, by previous research experience and by any previous
awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement
(or tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and will
contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged,
after consideration, within the same program or other programs of the I-CORE
center.
The Leonardo Fibonacci fellows will perform their postdoctoral research in
one of the I-CORE in Algorithms institutions.
Salaries and benefits are competitive and assistance with visas and housing
will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in Algorithms
and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the Committee
every three months.
RESEARCH SCOPE
The topics of research in I-CORE in Algorithms include (but are not limited
to):
all variety of algorithms (optimization, online, streaming, approximation,
randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum
computing, networking and distributed
computing, databases, machine learning and computer vision.
The selected candidates will be able to choose which of the center members
will be their advisor.
APPLICATION PROCEDURE
To apply, please send the attached form (as .pdf) by e-mail to both
saritc@post.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email their
letters (as pdf files)
to the email addresses above, with the subject line "<candidate_name>:
recommendation".
(It is the applicant's responsibility to ensure that the letters are sent;
letters will not be solicited directly.)
The deadline is 15th April 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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/
*
**********************************************************
Algo, CNR and ENEA
----------------------------------------------------------------------------
---------------------------------------------------------------------
I-CORE Algo - the Israeli Center of Research Excellence in algorithms,
CNR - the National Research Council of Italy and ENEA - the Italian National
agency for new technologies,
Energy and sustainable economic development are seeking excellent candidates
for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation in
science and technology
between Italy and Israel, under the auspices of the Italian-Israeli
Agreement on Industrial,
Scientific and Technological Cooperation. CNR and ENEA participate in the
program to help open
new paths towards excellence for young researchers, some of whom will
eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian mathematician
Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.I-CORE Algo
is part of the I-CORE program,
initiated by the Government of Israel and adopted by Israel's Council of
Higher Education in order to
reinforce Israel's intellectual capacities and promote synergy among
Israel's leading research centers.
The members of the center are some of Israel's most exceptional computer
scientists, from The Blavatnik School
of Computer Science in Tel Aviv University, The Rachel and Selim Benin
School of Computer Science and Engineering
in The Hebrew University of Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS
Researches of any nationality can apply to the program,
given that they obtained their PhD (Dottorato di Ricerca)
from an institution in Italy no longer than 2 years before
the date of the application, or will obtain it within 3 months
after the application. EU nationals can apply independently of
where they have obtained their degree, within the same temporal frame.
Equal opportunity is a principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis,
by publications, if any, by previous research experience and by any previous
awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement
(or tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and will
contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged,
after consideration, within the same program or other programs of the I-CORE
center.
The Leonardo Fibonacci fellows will perform their postdoctoral research in
one of the I-CORE in Algorithms institutions.
Salaries and benefits are competitive and assistance with visas and housing
will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in Algorithms
and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the Committee
every three months.
RESEARCH SCOPE
The topics of research in I-CORE in Algorithms include (but are not limited
to):
all variety of algorithms (optimization, online, streaming, approximation,
randomized, geometric and more),
cryptography, security and privacy, algorithmic game theory, quantum
computing, networking and distributed
computing, databases, machine learning and computer vision.
The selected candidates will be able to choose which of the center members
will be their advisor.
APPLICATION PROCEDURE
To apply, please send the attached form (as .pdf) by e-mail to both
saritc@post.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email their
letters (as pdf files)
to the email addresses above, with the subject line "<candidate_name>:
recommendation".
(It is the applicant's responsibility to ensure that the letters are sent;
letters will not be solicited directly.)
The deadline is 15th April 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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, March 4, 2013
[DMANET] Summerschool in Budapest, 2013
The Mathematical Institute of Eotvos University Budapest (Hungary) is
organizing a two-week long summer school in mathematics for
undergraduate students between June 24 and July 5, 2013. The main
topics are Combinatorics, Graph Theory, Network Optimization,
Discrete Geometry, and Algorithms but other branches of mathematics
will also be discussed.
There will be 11 mini courses, 3 x 90 minutes each and two plenary lectures.
Plenary speakers are Laszlo Lovasz and Jozsef Pelikan.
For details, see:
http://bolyai.cs.elte.hu/summerschool/
Andras Frank,
Institute of Mathematics, Eotvos University Budapest
frank@cs.elte.hu
**********************************************************
*
* 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/
*
**********************************************************
organizing a two-week long summer school in mathematics for
undergraduate students between June 24 and July 5, 2013. The main
topics are Combinatorics, Graph Theory, Network Optimization,
Discrete Geometry, and Algorithms but other branches of mathematics
will also be discussed.
There will be 11 mini courses, 3 x 90 minutes each and two plenary lectures.
Plenary speakers are Laszlo Lovasz and Jozsef Pelikan.
For details, see:
http://bolyai.cs.elte.hu/summerschool/
Andras Frank,
Institute of Mathematics, Eotvos University Budapest
frank@cs.elte.hu
**********************************************************
*
* 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] SLSP 2013: submission deadline extended
----------------------------------------------------------------------------------------------------
SUBMISSION DEADLINE EXTENDED: March 15 !!!
----------------------------------------------------------------------------------------------------
SUBMISSION DEADLINE EXTENDED: March 15 !!!
----------------------------------------------------------------------------------------------------
*********************************************************************
1st INTERNATIONAL CONFERENCE ON STATISTICAL LANGUAGE AND SPEECH PROCESSING
SLSP 2013
Tarragona, Spain
July 29-31, 2013
Organised by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Research Institute for Information and Language Processing (RIILP)
University of Wolverhampton
http://grammars.grlmc.com/SLSP2013/
*********************************************************************
AIMS:
SLSP is the first event in a series to host and promote research on the wide spectrum of statistical methods that are currently in use in computational language or speech processing. It aims at attracting contributions from both fields. Though there exist large, well-known conferences including papers in any of these fields, SLSP is a more focused meeting where synergies between areas and people will hopefully happen. SLSP will reserve significant space for young scholars at the beginning of their careers.
VENUE:
SLSP 2013 will take place in Tarragona, 100 km. to the south of Barcelona.
SCOPE:
The conference invites submissions discussing the employment of statistical methods (including machine learning) within language and speech processing. The list below is indicative and not exhaustive:
- phonology, morphology
- syntax, semantics
- discourse, dialogue, pragmatics
- statistical models for natural language processing
- supervised, unsupervised and semi-supervised machine learning methods applied to natural language, including speech
- statistical methods, including biologically-inspired methods
- similarity
- alignment
- language resources
- part-of-speech tagging
- parsing
- semantic role labelling
- natural language generation
- anaphora and coreference resolution
- speech recognition
- speaker identification/verification
- speech transcription
- text-to-speech synthesis
- machine translation
- translation technology
- text summarisation
- information retrieval
- text categorisation
- information extraction
- term extraction
- spelling correction
- text and web mining
- opinion mining and sentiment analysis
- spoken dialogue systems
- author identification, plagiarism and spam filtering
STRUCTURE:
SLSP 2013 will consist of:
‐ invited talks
‐ invited tutorials
‐ peer-reviewed contributions
INVITED SPEAKERS:
Yoshua Bengio (Montréal), tutorial Learning Deep Representations
Christof Monz (Amsterdam), Challenges and Opportunities of Multilingual Information Access
Tanja Schultz (Karlsruhe Tech), Multilingual Speech Processing with a special emphasis on Rapid Language Adaptation
PROGRAMME COMMITTEE:
Carlos Martín-Vide (Tarragona, Co-Chair)
Ruslan Mitkov (Wolverhampton, Co-Chair)
Jerome Bellegarda (Apple Inc., Cupertino)
Robert C. Berwick (MIT)
Laurent Besacier (LIG, Grenoble)
Bill Byrne (Cambridge)
Jen-Tzung Chien (National Chiao Tung U, Hsinchu)
Kenneth Church (IBM Research)
Koby Crammer (Technion)
Renato De Mori (McGill & Avignon)
Thierry Dutoit (U Mons)
Marcello Federico (Bruno Kessler Foundation, Trento)
Katherine Forbes-Riley (Pittsburgh)
Sadaoki Furui (Tokyo Tech)
Yuqing Gao (IBM Thomas J. Watson)
Ralp Grishman (New York U)
Dilek Hakkani-Tür (Microsoft Research, Mountain View)
Adam Kilgarriff (Lexical Computing Ltd., Brighton)
Dietrich Klakow (Saarbrücken)
Philipp Koehn (Edinburgh)
Mikko Kurimo (Aalto)
Lori Lamel (CNRS-LIMSI, Orsay)
Philippe Langlais (Montréal)
Haizhou Li (Institute for Infocomm Research, Singapore)
Qun Liu (Dublin City)
Daniel Marcu (SDL)
Manuel Montes-y-Gómez (INAOEP, Puebla)
Masaaki Nagata (NTT, Kyoto)
Joakim Nivre (Uppsala)
Kemal Oflazer (Carnegie Mellon Qatar, Doha)
Miles Osborne (Edinburgh)
Manny Rayner (Geneva)
Giuseppe Riccardi (U Trento)
José A. Rodríguez Fonollosa (Technical U Catalonia, Barcelona)
Paolo Rosso (Technical U Valencia)
Mark Steedman (Edinburgh)
Tomek Strzalkowski (Albany)
Gökhan Tür (Microsoft Research, Redmond)
Stephan Vogel (Qatar Computing Research Institute, Doha)
Kuansan Wang (Microsoft Research, Redmond)
Dekai Wu (HKUST, Hong Kong)
Min Zhang (Institute for Infocomm Research, Singapore)
Yunxin Zhao (U Missouri, Columbia)
ORGANISING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Carlos Martín-Vide (Tarragona, Co-Chair)
Ruslan Mitkov (Wolverhampton, Co-Chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit papers presenting original and unpublished research. Papers should not exceed 12 single‐spaced pages (including eventual appendices) and should be formatted according to the standard format for Springer Verlag's LNAI series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions are to be uploaded to:
https://www.easychair.org/conferences/?conf=slsp2013
PUBLICATIONS:
A volume of proceedings published by Springer in the LNAI topical subseries of the LNCS series will be available by the time of the conference.
A special issue of a major journal will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions will be by invitation.
REGISTRATION:
The period for registration is open from November 30, 2012 to July 29, 2013. The registration form can be found at:
http://grammars.grlmc.com/SLSP2013/Registration
DEADLINES:
Paper submission: March 15, 2013 (23:59h, CET) – EXTENDED –
Notification of paper acceptance or rejection: April 15, 2013
Final version of the paper for the LNAI proceedings: April 22, 2013
Early registration: April 24, 2013
Late registration: July 19, 2013
Submission to the post-conference journal special issue: October 31, 2013
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
SLSP 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Diputació de Tarragona
Universitat Rovira i Virgili
University of Wolverhampton
**********************************************************
*
* 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] Keccak & SHA-3 Day - March 27, 2013 - Brussels, Belgium
One-day colloquium on Keccak and SHA-3
March 27, 2013
Université Libre de Bruxelles
Brussels - Belgium
http://www.ulb.ac.be/di/scsi/sha3/
Speakers:
Elena Andreeva (KU Leuven, Belgium)
Anne Canteaut (INRIA, France)
Joan Daemen (STMicroelectronics, Belgium)
Itai Dinur (Weizmann Institute, Israël)
Orr Dunkelman (University of Haifa, Israël)
Maria Naya-Plasencia (INRIA, France)
Michaël Peeters (NXP Semiconductors, Belgium)
Vincent Rijmen (KU Leuven, Belgium)
Gilles Van Assche (STMicroelectronics, Belgium)
Christian Wenzel-Benner (ITK Engineering AG , Germany)
Program: http://www.ulb.ac.be/di/scsi/sha3/program
Contact : Olivier Markowitch (olivier.markowitch@ulb.ac.be, http://www.ulb.ac.be/di/scsi/markowitch)
**********************************************************
*
* 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/
*
**********************************************************
March 27, 2013
Université Libre de Bruxelles
Brussels - Belgium
http://www.ulb.ac.be/di/scsi/sha3/
Speakers:
Elena Andreeva (KU Leuven, Belgium)
Anne Canteaut (INRIA, France)
Joan Daemen (STMicroelectronics, Belgium)
Itai Dinur (Weizmann Institute, Israël)
Orr Dunkelman (University of Haifa, Israël)
Maria Naya-Plasencia (INRIA, France)
Michaël Peeters (NXP Semiconductors, Belgium)
Vincent Rijmen (KU Leuven, Belgium)
Gilles Van Assche (STMicroelectronics, Belgium)
Christian Wenzel-Benner (ITK Engineering AG , Germany)
Program: http://www.ulb.ac.be/di/scsi/sha3/program
Contact : Olivier Markowitch (olivier.markowitch@ulb.ac.be, http://www.ulb.ac.be/di/scsi/markowitch)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: 13th Haifa Workshop on Graph Theory, Combinatorics, and Algorithms: CALL for contributed talks (deadline April 4)
The Caesarea Rothschild Institute at the University of Haifa announces its:
13th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics, and Algorithms
Sunday-Tuesday, May 19-21, 2013
and *** CALL FOR PAPERS *** for contributed talks
------------------------------------------------------------------------
INVITED SPEAKERS: (alphabetically ordered)
Nikhil Bansal (Eindhoven University of Technology, Nederland)
Daniel Marx (Hungarian Academy of Sciences, Hungary)
Liam Roditty (Bar-Ilan University, Israel)
Hadas Shachnai (Technion, Israel)
Annegret Wagler (Universite Blaise Pascal, France)
Shmuel Zaks (Technion, Israel)
------------------------------------------------------------------------
CALL FOR PAPERS:
Submissions for contributed talks are invited for this year's workshop.
The workshop emphasizes the diversity of the use of combinatorial
algorithms and graph theory in application areas. Examples of such
areas of interest include:
- Randomized Algorithms - Networking
- Graph Algorithms - Internet Congestion and Patterns
- Computational Biology - Applied Combinatorics
- Web Applications - Geometric Graphs and Computation
- Optimization - Graph Theoretic Models
Please submit abstracts (1-2 pages) to <HaifaGraphWorkshop2013@gmail.com>
by April 4, 2011. The workshop is non-archival and has no proceedings;
accepted abstracts will be available online. Papers that have been
accepted to recent international conferences are particularly welcome,
and should be so indicated in the submission.
IMPORTANT DATES:
Submission: April 4; Notification: April 15; Workshop: May 19-21, 2013
REGISTRATION:
The registration site will open shortly after Pesach.
Please visit: http://www.cri.haifa.ac.il
WORKSHOP COMMITTEE:
Martin Charles Golumbic (chair) (University of Haifa and CRI-Haifa)
Haim Kaplan (Tel Aviv University)
Eran London (Hadassah College)
Gila Morgenstern (program co-chair) (CRI-Haifa)
Seffi Naor (Technion)
David Peleg (Weizmann Institute)
Oren Weimann (program co-chair) (University of Haifa)
Raphael Yuster (University of Haifa)
Shira Zuker (Sapir Colledge)
**********************************************************
*
* 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/
*
**********************************************************
13th Haifa Workshop on Interdisciplinary Applications of
Graph Theory, Combinatorics, and Algorithms
Sunday-Tuesday, May 19-21, 2013
and *** CALL FOR PAPERS *** for contributed talks
------------------------------------------------------------------------
INVITED SPEAKERS: (alphabetically ordered)
Nikhil Bansal (Eindhoven University of Technology, Nederland)
Daniel Marx (Hungarian Academy of Sciences, Hungary)
Liam Roditty (Bar-Ilan University, Israel)
Hadas Shachnai (Technion, Israel)
Annegret Wagler (Universite Blaise Pascal, France)
Shmuel Zaks (Technion, Israel)
------------------------------------------------------------------------
CALL FOR PAPERS:
Submissions for contributed talks are invited for this year's workshop.
The workshop emphasizes the diversity of the use of combinatorial
algorithms and graph theory in application areas. Examples of such
areas of interest include:
- Randomized Algorithms - Networking
- Graph Algorithms - Internet Congestion and Patterns
- Computational Biology - Applied Combinatorics
- Web Applications - Geometric Graphs and Computation
- Optimization - Graph Theoretic Models
Please submit abstracts (1-2 pages) to <HaifaGraphWorkshop2013@gmail.com>
by April 4, 2011. The workshop is non-archival and has no proceedings;
accepted abstracts will be available online. Papers that have been
accepted to recent international conferences are particularly welcome,
and should be so indicated in the submission.
IMPORTANT DATES:
Submission: April 4; Notification: April 15; Workshop: May 19-21, 2013
REGISTRATION:
The registration site will open shortly after Pesach.
Please visit: http://www.cri.haifa.ac.il
WORKSHOP COMMITTEE:
Martin Charles Golumbic (chair) (University of Haifa and CRI-Haifa)
Haim Kaplan (Tel Aviv University)
Eran London (Hadassah College)
Gila Morgenstern (program co-chair) (CRI-Haifa)
Seffi Naor (Technion)
David Peleg (Weizmann Institute)
Oren Weimann (program co-chair) (University of Haifa)
Raphael Yuster (University of Haifa)
Shira Zuker (Sapir Colledge)
**********************************************************
*
* 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, March 3, 2013
[DMANET] CFP: IEEE GLOBECOM 2013 AD HOC AND SENSOR NETWORKING SYMPOSIUM
CALL FOR PAPERS
IEEE GLOBECOM 2013 AD HOC AND SENSOR NETWORKING SYMPOSIUM
Symposium Co-Chairs
Mohamed Younis, University of Maryland Baltimore County, USA
younis@cs.umbc.edu
Yu Cheng, Illinois Institute of Technology, USA
cheng@iit.edu
Falko Dressler, University of Innsbruck, Austria
falko.dressler@uibk.ac.at
Xu Li, Huawei Technologies, Canada
easylix@yahoo.ca
Scope and Topics of Interest
Recent advancements in wireless technologies have enabled networked
solutions for many unconventional civil and military applications. In
recent years, ad-hoc networks have been attracting increased attention from
the research and engineering communities, motivated by applications like
digital battlefield, asset tracking, air-borne safety, situational
awareness, and border protection. Similarly, advances in micro-electro-
mechanical devices and large-scale integration have enabled the realization
of miniaturized sensor nodes that can probe their surroundings and transmit
their measurements using on-board wireless transceivers. Large-scale
networks of miniaturized sensor nodes may also enable new applications such
as target tracking, security surveillance, elder care, and forest
monitoring. Both ad hoc and sensor networks are characterized by their
dynamic nature, which requires them to be adaptive to changes in the
application environment, task objectives, and topological changes, among
others. The last few years have witnessed the development of many
innovative solutions for ad-hoc and sensor networks that are maturing to
the level of commercialization and standardization. Yet, numerous
challenges remain for the implementation of practical solutions that
operate robustly, securely, and efficiently. The Ad Hoc and Sensor
Networking Symposium of GLOBECOM'2013 opts to foster a forum for sharing
ideas and recent results among researchers and practitioners working on
state-of-the-art solutions related to ad-hoc and sensor networks. We are
soliciting papers that describe original and unpublished contributions.
Topics of interest include, but are not limited to:
* New and unconventional applications of ad hoc and sensor networks
* Novel architectures and operation models
* Wireless sensor and actor networks
* Wireless multimedia and 3-D sensor networks
* Underwater and underground sensor networks
* Body Area Sensor Networks
* Cognitive radio networks in multi-hop environments
* Wireless mesh and community networks
* Wireless PANs and LANs
* Pervasive and wearable computing
* RFID systems
* Delay-tolerant ad hoc networks
* Self-organization and autonomic networking
* Vehicular networks
* Co-existence issues of hybrid networks
* Wireless, ad hoc, and sensor devices
* Ultra wide band technology for ad hoc and sensor networks
* MAC protocols for ad hoc and sensor networks
* Frequency and channel allocation algorithms
* New standards for ad hoc and sensor networks
* Energy saving and power control protocols for ad-hoc and sensor networks
* Energy scavenging technologies
* Service discovery in ad-hoc and sensor networks
* Location and context aware services
* Scheduling and resource management algorithms
* Deployment and coverage analysis of sensor networks
* Localization algorithms and ranging technologies
* Routing and multicasting protocols
* Topology control and management
* In-network processing and data storage
* Fault-tolerance and traffic reliability issues
* Cross-layer design and optimization
* Mobility management and modeling
* Synchronization and coordination techniques in ad hoc and sensor networks
* Security for ad hoc and sensor networks
* Integrated simulation and measurement based evaluation
* Experimental prototypes and testbeds
* New simulation languages, programming abstractions, and tools for ad hoc
and sensor networks
Submission Guidelines
Prospective authors are invited to submit original technical papers by the
deadline of 15 March 2013 for publication in the IEEE Globecom 2013
Conference Proceedings and for presentation at the conference. Submissions
will be accepted through EDAS. All submissions must be written in English
and be at most six (6) printed pages in length, including figures. For full
details, please visit the following website:
http://www.ieee-globecom.org/2013/submguide.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
IEEE GLOBECOM 2013 AD HOC AND SENSOR NETWORKING SYMPOSIUM
Symposium Co-Chairs
Mohamed Younis, University of Maryland Baltimore County, USA
younis@cs.umbc.edu
Yu Cheng, Illinois Institute of Technology, USA
cheng@iit.edu
Falko Dressler, University of Innsbruck, Austria
falko.dressler@uibk.ac.at
Xu Li, Huawei Technologies, Canada
easylix@yahoo.ca
Scope and Topics of Interest
Recent advancements in wireless technologies have enabled networked
solutions for many unconventional civil and military applications. In
recent years, ad-hoc networks have been attracting increased attention from
the research and engineering communities, motivated by applications like
digital battlefield, asset tracking, air-borne safety, situational
awareness, and border protection. Similarly, advances in micro-electro-
mechanical devices and large-scale integration have enabled the realization
of miniaturized sensor nodes that can probe their surroundings and transmit
their measurements using on-board wireless transceivers. Large-scale
networks of miniaturized sensor nodes may also enable new applications such
as target tracking, security surveillance, elder care, and forest
monitoring. Both ad hoc and sensor networks are characterized by their
dynamic nature, which requires them to be adaptive to changes in the
application environment, task objectives, and topological changes, among
others. The last few years have witnessed the development of many
innovative solutions for ad-hoc and sensor networks that are maturing to
the level of commercialization and standardization. Yet, numerous
challenges remain for the implementation of practical solutions that
operate robustly, securely, and efficiently. The Ad Hoc and Sensor
Networking Symposium of GLOBECOM'2013 opts to foster a forum for sharing
ideas and recent results among researchers and practitioners working on
state-of-the-art solutions related to ad-hoc and sensor networks. We are
soliciting papers that describe original and unpublished contributions.
Topics of interest include, but are not limited to:
* New and unconventional applications of ad hoc and sensor networks
* Novel architectures and operation models
* Wireless sensor and actor networks
* Wireless multimedia and 3-D sensor networks
* Underwater and underground sensor networks
* Body Area Sensor Networks
* Cognitive radio networks in multi-hop environments
* Wireless mesh and community networks
* Wireless PANs and LANs
* Pervasive and wearable computing
* RFID systems
* Delay-tolerant ad hoc networks
* Self-organization and autonomic networking
* Vehicular networks
* Co-existence issues of hybrid networks
* Wireless, ad hoc, and sensor devices
* Ultra wide band technology for ad hoc and sensor networks
* MAC protocols for ad hoc and sensor networks
* Frequency and channel allocation algorithms
* New standards for ad hoc and sensor networks
* Energy saving and power control protocols for ad-hoc and sensor networks
* Energy scavenging technologies
* Service discovery in ad-hoc and sensor networks
* Location and context aware services
* Scheduling and resource management algorithms
* Deployment and coverage analysis of sensor networks
* Localization algorithms and ranging technologies
* Routing and multicasting protocols
* Topology control and management
* In-network processing and data storage
* Fault-tolerance and traffic reliability issues
* Cross-layer design and optimization
* Mobility management and modeling
* Synchronization and coordination techniques in ad hoc and sensor networks
* Security for ad hoc and sensor networks
* Integrated simulation and measurement based evaluation
* Experimental prototypes and testbeds
* New simulation languages, programming abstractions, and tools for ad hoc
and sensor networks
Submission Guidelines
Prospective authors are invited to submit original technical papers by the
deadline of 15 March 2013 for publication in the IEEE Globecom 2013
Conference Proceedings and for presentation at the conference. Submissions
will be accepted through EDAS. All submissions must be written in English
and be at most six (6) printed pages in length, including figures. For full
details, please visit the following website:
http://www.ieee-globecom.org/2013/submguide.html
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: IEEE TETC SI on Cyber-Physical Systems
Call for Papers:
Special Issue of
IEEE Transactions on Emerging Topics in Computing (TETC)
on Cyber-Physical Systems (CPS)
IEEE Transactions on Emerging Topics in Computing (TETC) is seeking original manuscripts for Special Issue on Cyber-Physical Systems (CPS),
scheduled to be published in the January – June 2013 issue. The
coordination and tight link between computational, virtual and physical
resources will drive the potential of having a pervasive effect in the
citizens everyday life, satisfying various needs and also creating new
opportunities for the introduction of services that will enhance the
quality of life of the society as a whole. Research advances in
cyber-physical systems promise to transform our world with systems that
will far exceed those of today in terms of: effectiveness, adaptability, autonomicity, energy efficiency, precision, reliability, safety,
usability, scalability, stability and user-centric applicability.
Moreover, recently the Sensor Web concept came into foreground, aiming
at combining distributed sensing with the ubiquitous connectivity and
accessibility of the web, therefore facilitating the close interaction
of digital world with physical world.
Cyber-physical systems find direct applicability in a wide range of areas and disciplines, including for instance (but not limited to): a)
Smart Grid technologies: that aim at facilitating a reliable and
efficient delivery of electricity to consumers using digital
communications and security technologies, and intelligent monitoring and control of the delivery network and electricity consumption b) Wireless sensing, monitoring and networking: to enable distributed monitoring
systems of numerous smart sensors and actuators, mobile devices, RFIDs,
(ground, aerial, aquatic) robots etc., which revolutionize a variety of
application areas with unprecedented density, fidelity, and scalability
of environment instrumentation; c) Vehicular cyber-physical and
intelligent transportation systems: that integrate computing,
communication, and storage capabilities with monitoring and control of
vehicles in the physical world to deal with the grand challenges of
safe, green, and efficient transportation; d) Smart Living technologies: smart city (e.g. increasing security, comfort and convenience, green
energy), intelligent park and space, healthcare systems. Ambient
intelligence, context-awareness, data mining, embedded system and
software, evolutionary computation, modeling environments and human
behavior, social networks, big data, security, privacy and trust,
ubiquitous computing and other technologies and methodologies applied in CPS are also welcome.
Towards merging the information-centric character and node-centric
physical world connectivity, well-defined analytical models,
methodologies and experimental validations are required of how to build
such systems capable of coping with the entire chain of operations and
orchestrating the various parts together in a flexible, efficient and
economic way.
Topics of interest include, but are not limited to the following:
Architectural framework for distributed CPS
Resource Management in large scale CPS
Evaluations and field trials of CPS and solutions Security, privacy, scalability, and reliability issues
Design and cross-layer optimizations
Vehicular CPS and intelligent transportation systems
Scalable monitoring applications with sensors, actuators, smart phones, robots, and other wireless mobile devices
Smart Living and Smart grid technologies
Modeling and fault tolerance
Submitted articles must not have been previously published or currently submitted for journal publication elsewhere. As an author, you are responsible
for understanding and adhering to our submission guidelines. You can
access them by clicking on the following web link: http://www.computer.org/mc/tpds/author.htm. Please thoroughly read these before submitting your manuscript. Please submit your paper to Manuscript Central at https://mc.manuscriptcentral.com/tetc-cs.
Please note the following important dates:
Manuscript Submission Deadline: March 18, 2013
Notification of Initial Decision: April 26, 2013
Minor Revisions due (if needed): May 17, 2013
Notification of Final Decision: June 12, 2013
Final Manuscripts Due: June 19, 2013
Publication Date: September 2013
Co-guest Editors:
Song Guo, The University of Aizu (coordinator)
Hannes Frey, University of Koblenz-Landau
Nei Kato, Tohoku University
Yunhao Liu, Tsinghua University
Publicity Co-Chairs:
Jaime Lloret, University of Valencia
Jiming Chen, Zhejiang University
Xu Li, Huawei Technologies Canada
**********************************************************
*
* 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 Pilsen
POSTDOCTORAL RESEARCH POSITIONS
University of West Bohemia, Pilsen
----------------------------------
Two postdoctoral positions in the area of Discrete Mathematics are
available at the University of West Bohemia in Pilsen, Czech Republic.
Deadline for applications is March 31, 2013, and the expected starting
date is May 2, 2013, with contracts for up to 25 months.
Research will be directed by Zdenek Ryjacek and by Tomas Kaiser,
respectively.
The calls can be found at:
https://nexliz.zcu.cz/sites/default/files/docs/VR/201303/Academician%E2%80%93research_assistant_%28postdoc%29-%28NEXLIZ-FAV-5%29.pdf
(the position supervised by Zdenek Ryjacek, ryjacek@kma.zcu.cz) and
https://nexliz.zcu.cz/sites/default/files/docs/VR/201303/Academician%E2%80%93research_assistant_%28postdoc%29-%28NEXLIZ-FAV-2%29.pdf
(the position supervised by Tomas Kaiser, kaisert@kma.zcu.cz).
For further details, see
https://nexliz.zcu.cz/en/node/24
or contact directly the supervisors at
Tomas Kaiser <kaisert@kma.zcu.cz>
Zdenek Ryjacek <ryjacek@kma.zcu.cz>
--
----------------------------------------------------------------------
Zdenek Ryjacek
Department of Mathematics
University of West Bohemia
Univerzitni 8
306 14 Pilsen, Czech Republic
e-mail: ryjacek@kma.zcu.cz
http://www.kma.zcu.cz/Ryjacek
----------------------------------------------------------------------
**********************************************************
*
* 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/
*
**********************************************************
University of West Bohemia, Pilsen
----------------------------------
Two postdoctoral positions in the area of Discrete Mathematics are
available at the University of West Bohemia in Pilsen, Czech Republic.
Deadline for applications is March 31, 2013, and the expected starting
date is May 2, 2013, with contracts for up to 25 months.
Research will be directed by Zdenek Ryjacek and by Tomas Kaiser,
respectively.
The calls can be found at:
https://nexliz.zcu.cz/sites/default/files/docs/VR/201303/Academician%E2%80%93research_assistant_%28postdoc%29-%28NEXLIZ-FAV-5%29.pdf
(the position supervised by Zdenek Ryjacek, ryjacek@kma.zcu.cz) and
https://nexliz.zcu.cz/sites/default/files/docs/VR/201303/Academician%E2%80%93research_assistant_%28postdoc%29-%28NEXLIZ-FAV-2%29.pdf
(the position supervised by Tomas Kaiser, kaisert@kma.zcu.cz).
For further details, see
https://nexliz.zcu.cz/en/node/24
or contact directly the supervisors at
Tomas Kaiser <kaisert@kma.zcu.cz>
Zdenek Ryjacek <ryjacek@kma.zcu.cz>
--
----------------------------------------------------------------------
Zdenek Ryjacek
Department of Mathematics
University of West Bohemia
Univerzitni 8
306 14 Pilsen, Czech Republic
e-mail: ryjacek@kma.zcu.cz
http://www.kma.zcu.cz/Ryjacek
----------------------------------------------------------------------
**********************************************************
*
* 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] Extended Deadline: WiSARN 2013-Spring || May 20-23, 2013, Cambridge, Massachusetts, USA - (In conjunction with IEEE DCOSS'13)
Call for Papers
The 7th International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN 2013-Spring)
http://www.site.uottawa.ca/~zhuan045/WiSARN/WiSARN2013.html
To be held in conjunction with
The 9th IEEE International Conference on
Distributed Computing in Sensor Systems (DCOSS'13)
May 20-23, Cambridge, Massachusetts, USA.
Wireless sensor and actor networks (WSANs) are the confluence point
where the traditional fields of wireless sensor networks (WSNs),
robot networks and control theory meet. In WSAN, nodes collaborate
to accomplish distributed sensing and actuation tasks. Leveraged by
the control and mobility of actors, the networking process and
applications embrace a whole new set of possibilities. Actors may
deploy, repair and relocate sensors to improve coverage, build routes
and fix network partition to ensure data communication, change network
topology to shape routing patterns and balance energy consumption,
and respond to reported events in a timely and effective manner.
The benefits are limited only by imagination. As an emerging field,
WSANs are in need of new networking techniques, by which they can fully
exploit their particularities and potentials. WiSARN aims to bring
together state-of-the-art contributions on the design, specification
and implementation of architectures, algorithms and protocols for
current and future applications of WSAN. Original, unpublished
contributions are solicited in ALL aspects of WSANs, WSNs, robot
networks, and robotics and automation. Possible topics include,
but are not limited to:
* Autonomous sensor networks
* Emergent behavior in WSAN
* Modeling and simulation of WSAN
* WSAN architectural and operational models
* Autonomic and self-organizing coordination and communication
* Sensor-actor (robot) and actor-actor coordination
* Energy-efficient and real-time communication protocols
* Bandwidth-efficient and delay-tolerant communication protocols
* Distributed control and management in WSAN
* Neighborhood discovery and mobility management
* Communication protocols for swarms of mobile actors (robots)
* Map exploration and pattern formation of mobile robots
* Actor (robot) task assignment
* Biologically inspired communication
* Ecological systems
* Architectures and topology control
* Localization in WSAN
* Probabilistic integration in WSAN
* Quality of service, security and robustness issues
* Applications and prototypes
* Hybrid networks and wireless Internet
* Data management, gathering, aggregation and query processing
Papers must not exceed 6 single-spaced and two-column pages using
at least 10 point size type on 8.5 x 11 inches pages, and must be
formatted in strict accordance with the IEEE author guidelines.
Submissions are being considered with the understanding that they
describe original research, neither published nor under review
elsewhere. Accepted papers will be published in the IEEE Digital
Library after the conference and included in DCOSS 2013 proceedings.
Selected best papers will be invited to a special issue of
Ad Hoc & Sensor Wireless Networks: an international journal (SCIE).
Important dates
Paper submission (extended): March 10, 2013
Author notification: March 30, 2013
Camera ready: April 15, 2013
Workshop date: May 23, 2013
General Chair
Ivan Stojmenovic, University of Ottawa, Canada
Program Co-Chairs:
Shuhui Yang, Purdue University Calumet, USA.
Hannes Frey, University of Paderbon, Germany.
Publicity Co-Chairs:
Liang He, Singapore University of Technology and Design, Singapre.
Sandra Sendra, universidad Politecnica de Valencia, Spain.
Submission Chair:
Rafael Falcon, University of Ottawa, Canada.
Technical Program Committee:
Muhammad Anan, Purdue University Calumet
Cailian Chen, Shanghai Jiao Tong University, China
Xianghui Cao, Illinois Institute of Technology, USA
Xiao Chen, Texas State University, USA
Shibo He, Arizona State University, USA
Abdelmajid Khelil, Technische Universitat Darmstadt, Germany
Tae-Hoon Kim, Purdue University Calumet, USA
Feng Li, Indiana University Purdue University Indianapolis, USA
Xiaodong Lin, University of Ontario Institute of Technology, Canada
Mingming Lu, Central South University, China
Rongxing Lu, University of Waterloo, Canada
Jaime Lloret Mauri, Polytechnic University of Valencia, Spain
Enrico Natalizio, Universit� de Technologie de Compi�gne, France
Tahiry Razafindralambo, Inria, France
Sushmita Ruj, Indian Institute of Technology, India
Haojin Zhu, Shanghai Jiao Tong University, China
For further information, please refer to the above WiSARN 2013 website,
or contact the program co-chairs.
The 7th International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN 2013-Spring)
http://www.site.uottawa.ca/~zhuan045/WiSARN/WiSARN2013.html
To be held in conjunction with
The 9th IEEE International Conference on
Distributed Computing in Sensor Systems (DCOSS'13)
May 20-23, Cambridge, Massachusetts, USA.
Wireless sensor and actor networks (WSANs) are the confluence point
where the traditional fields of wireless sensor networks (WSNs),
robot networks and control theory meet. In WSAN, nodes collaborate
to accomplish distributed sensing and actuation tasks. Leveraged by
the control and mobility of actors, the networking process and
applications embrace a whole new set of possibilities. Actors may
deploy, repair and relocate sensors to improve coverage, build routes
and fix network partition to ensure data communication, change network
topology to shape routing patterns and balance energy consumption,
and respond to reported events in a timely and effective manner.
The benefits are limited only by imagination. As an emerging field,
WSANs are in need of new networking techniques, by which they can fully
exploit their particularities and potentials. WiSARN aims to bring
together state-of-the-art contributions on the design, specification
and implementation of architectures, algorithms and protocols for
current and future applications of WSAN. Original, unpublished
contributions are solicited in ALL aspects of WSANs, WSNs, robot
networks, and robotics and automation. Possible topics include,
but are not limited to:
* Autonomous sensor networks
* Emergent behavior in WSAN
* Modeling and simulation of WSAN
* WSAN architectural and operational models
* Autonomic and self-organizing coordination and communication
* Sensor-actor (robot) and actor-actor coordination
* Energy-efficient and real-time communication protocols
* Bandwidth-efficient and delay-tolerant communication protocols
* Distributed control and management in WSAN
* Neighborhood discovery and mobility management
* Communication protocols for swarms of mobile actors (robots)
* Map exploration and pattern formation of mobile robots
* Actor (robot) task assignment
* Biologically inspired communication
* Ecological systems
* Architectures and topology control
* Localization in WSAN
* Probabilistic integration in WSAN
* Quality of service, security and robustness issues
* Applications and prototypes
* Hybrid networks and wireless Internet
* Data management, gathering, aggregation and query processing
Papers must not exceed 6 single-spaced and two-column pages using
at least 10 point size type on 8.5 x 11 inches pages, and must be
formatted in strict accordance with the IEEE author guidelines.
Submissions are being considered with the understanding that they
describe original research, neither published nor under review
elsewhere. Accepted papers will be published in the IEEE Digital
Library after the conference and included in DCOSS 2013 proceedings.
Selected best papers will be invited to a special issue of
Ad Hoc & Sensor Wireless Networks: an international journal (SCIE).
Important dates
Paper submission (extended): March 10, 2013
Author notification: March 30, 2013
Camera ready: April 15, 2013
Workshop date: May 23, 2013
General Chair
Ivan Stojmenovic, University of Ottawa, Canada
Program Co-Chairs:
Shuhui Yang, Purdue University Calumet, USA.
Hannes Frey, University of Paderbon, Germany.
Publicity Co-Chairs:
Liang He, Singapore University of Technology and Design, Singapre.
Sandra Sendra, universidad Politecnica de Valencia, Spain.
Submission Chair:
Rafael Falcon, University of Ottawa, Canada.
Technical Program Committee:
Muhammad Anan, Purdue University Calumet
Cailian Chen, Shanghai Jiao Tong University, China
Xianghui Cao, Illinois Institute of Technology, USA
Xiao Chen, Texas State University, USA
Shibo He, Arizona State University, USA
Abdelmajid Khelil, Technische Universitat Darmstadt, Germany
Tae-Hoon Kim, Purdue University Calumet, USA
Feng Li, Indiana University Purdue University Indianapolis, USA
Xiaodong Lin, University of Ontario Institute of Technology, Canada
Mingming Lu, Central South University, China
Rongxing Lu, University of Waterloo, Canada
Jaime Lloret Mauri, Polytechnic University of Valencia, Spain
Enrico Natalizio, Universit� de Technologie de Compi�gne, France
Tahiry Razafindralambo, Inria, France
Sushmita Ruj, Indian Institute of Technology, India
Haojin Zhu, Shanghai Jiao Tong University, China
For further information, please refer to the above WiSARN 2013 website,
or contact the program co-chairs.
Friday, March 1, 2013
[DMANET] Deadline Extension: EURO XXVI-INFORMS Joint Conference 2013 || July 1 - 4, 2013 - Rome, Italy
Due to a large number of requests, the program committee has decided
to extend the deadline for submission of abstracts until Friday, March
14, 2013. Even, if you can enjoy a 2 week extension for preparing your
abstracts, we encourage you to submit your work as soon as possible to
avoid an heavy load of work for the program committee. Please find
below the 3rd CFP.
EURO-INFORMS 2013
Joint International Conference EURO XXVI
July 1-4, 2013, Rome, ITALY
Third CALL FOR PAPERS
*** Submission deadline is extended to Friday March 14, 2013 ***
http://euro2013.org
euro2013@ega.it
Following the success of previous EURO Conferences, we solicit your
submission and participation to the XXVI EURO-INFORMS Joint
International Conference: "All roads lead to OR" which will be held in
Rome on July 1-4, 2013. The Program Committee chaired by Marc Sevaux
(EURO) and David Simchi Levi (INFORMS) and the Organizing Committee
chaired by Paolo Dell'Olmo (AIRO), are preparing a high quality
scientific program and an exciting social program for the conference.
We are confident that the XXVI EURO-INFORMS Joint International
Conference will be an extraordinary opportunity for the OR community
to get together again in a unique location, and we are looking
forward to meeting you in Rome in 2013. Please visit the Conference
website (www.euro2013.org) for more information.
Submission Deadline: March 1, 2013
Notification of Authors: March 15, 2013
Deadline early registration (and inclusion in the program): April 15, 2013
Registration and Welcome Cocktail: June 30, 2013
Conference date: July 1-4, 2013
PLENARIES, KEYNOTES and TUTORIALS:
Plenaries:
----------
Hal VARIAN Google
George NEMHAUSER Combinatorial optimization and its applications
IFORS Distinguished Lecturer will be announced soon
Keynotes:
---------
Enrique BENAVENT: Arc routing problems, mainly exact methods
Ashish GOEL: Optimization for e-commerce and social networks
Adam LETCHFORD: Combinatorial optimization
Sanjay MEHROTRA: Optimization and healthcare
Linet OZDAMAR: OR for humanitarian logistics
Joel SOKOL: Industry and teaching
Tutorials:
----------
Dimitri BERTSIMAS: Portfolio optimization
Stéphane DAUZERE-PERES: Lot sizing problems
Zonghao GU: Software and integer programming
Hoai An LE THI: Difference of convex functions optimization
Gunther RAIDL: Stochastic search
Rakesh VOHRA: Game theory and discrete optimization
ABSTRACT SUBMISSION:
We invite all researchers, academicians, practitioners, as well as
students interested in any branch of Operational Research,
mathematical modeling or economic analysis to participate at the
conference and to present their research. Invited and contributed
papers will be organized in parallel sessions.
No participant can present more than one paper at the conference.
Abstract submission and registration are both online, via the
conference web page (www.euro2013.org).
Abstracts: max. 600 characters; submission deadline: March 14, 2013.
Researchers who want to organize a Stream (a collection of Sessions
around one topic) or a Session, or wish to contribute a paper within
an invited session are still welcome to contact the PC member of the
corresponding area. We invite submissions on - but not limited to Â
the following Main Areas:
- Artificial Intelligence, Fuzzy Systems
- Computing
- Continuous Optimization
- Control Theory & System Dynamics
- Data Science, Business Analytics, Data Mining
- Decision Analysis, Decision Support Systems, DEA and Performance Measurement
- Discrete Optimization, Geometry & Graphs
- Emerging Applications of OR
- Energy / Environment and Climate
- Financial Modeling, Risk Management, Managerial Accounting
- Game Theory, Mathematical Economics
- Location, Logistics, Transportation
- Metaheuristics
- Multiple Criteria Decision Making and Optimization
- OR Education, History, Ethics
- OR for Developing Countries, Humanitarian Applications
- OR in Health, Life Sciences & Sports
- OR in Industry and Software for OR
- OR in Natural Resources
- Production Management & Supply Chain Management
- Revenue Management
- Scheduling, Time Tabling & Project Management
- Service Systems
- Simulation, Stochastic Programming and Modeling
- Soft OR and Problem Structuring Methods
- Telecommunication, Networks and Social Networks
For closer information about the given Streams in these areas, please
see http://euro2013.org/?page_id=103.
PROGRAM COMMITTEE of EURO-INFORMS 2013:
- Marc Sevaux, France (Chair)
- David Simchi-Levi, USA (Chair)
- Sally Brailsford, UK (EURO VP1)
- Maria Antonia Carravilla, Portugal
- Marielle Christiansen, Norway
- Paolo Dell'Olmo, Italy
- Guillermo Gallego, USA
- Jérémie Gallien, UK
- Michel Gendreau, Canada
- Diego Klabjan, USA
- Ana Meca Martinez, Spain
- Rolf Möhring, Germany
- Mike Pinedo, USA
- Christian Prins, France
- Abraham Seidmann, USA
- Kenneth Sörensen, Belgium
- Ariela Sofer, USA
- Fabio Tardella, Italy
- Tamas Terlaky, USA
- Mike Trick, USA
- Steef van de Velde, The Netherlands
- Christos Vasilakis, UK
- Gerhard-Wilhelm Weber, Turkey (Advisor to EURO Conferences)
ORGANIZING COMMITTEE of EURO-INFORMS 2013:
- Paolo Dell'Olmo, University of Rome (Chair)
- Renato De Leone, University of Camerino
- Giovanni Felici, Italian National Research Council - IASI Rome
- Paola Festa, University of Naples
- Stefano Giordani, Tor Vergata - University of Rome II
- Francesca Guerriero, University of Calabria
- Silvano Martello, University of Bologna
- Gaia Nicosia, University of Rome III
- Laura Palagi, Sapienza - University of Rome
- Fabio Schoen, University of Florence
- Anna Sciomachen, University of Genova
- Roberto Tadei, University of Torino
- Walter Ukovich, University of Trieste
THE PROGRAMME IN BRIEF:
The Registration opens on June 30 (Sunday), 4 pm with Welcome
Reception from 6 pm to 10 pm in the Campus of Sapienza. The Conference
starts July 1 (Monday) with the Opening Session in the Aula Magna and
proceeds with the working sessions up to Thursday morning. In the
evening of July 2 (Tuesday) there will be a social event: Night @
Sapienza. The Conference Gala Dinner will be held in the evening of
July 3 (Wednesday). In the late morning of July 4, the Conference ends
with the Closing Session in the Aula Magna.
For the interesting Satellite Events which will be closely related to
EURO-INFORMS 2013, please see http://euro2013.org/?page_id=734.
REGISTRATION:
The following registration fees apply:
- Regular: 350 Euro (early); 470 Euro (late),
- Student: 190 Euro (early); 290 Euro (late),
- Accompanying persons: 80 Euro.
Early registration ends at April 15, 2013.
TRAVEL and ACCOMMODATION:
Rome receives more than 7 million tourists a year and since July is
high tourist season, to enjoy the conference in the most convenient
way, we strongly recommend to book as early as possible:
1. Accommodation in Rome through the Conference webpage.
2. Air tickets as early as possible.
The Conference Secretariat has reserved a large number of rooms in a
number of hotels in Rome, as close as possible to the conference site
(the Campus of Sapienza University of Rome, located in Rome central
area). Please keep in mind that in the Conference period Rome is very
busy with tourists and any delay in booking hotel rooms could be a
real problem. For more details, consult the conference site
www.euro2013.org, where all relevant information will be regularly
updated.
On further questions regarding travel and accommodation, please
contact via euro2013@ega.it.
COORGANIZING INSTITUTIONS:
EURO-INFORMS 2013 will be hosted by Sapienza Universita di Roma.
It is sponsored by the following organizations:
- The Italian Operations Research Society (AIRO),
- The Association of European Operational Research Societies (EURO),
- The Institute for Operations Research and Management Science (INFORMS).
For any further information please contact:
Studio Ega Srl - EURO-INFORMS Conference Secretariat
Viale Tiziano, 19 - 00196 Rome, Italy
E-mail: euro2013@ega.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
to extend the deadline for submission of abstracts until Friday, March
14, 2013. Even, if you can enjoy a 2 week extension for preparing your
abstracts, we encourage you to submit your work as soon as possible to
avoid an heavy load of work for the program committee. Please find
below the 3rd CFP.
EURO-INFORMS 2013
Joint International Conference EURO XXVI
July 1-4, 2013, Rome, ITALY
Third CALL FOR PAPERS
*** Submission deadline is extended to Friday March 14, 2013 ***
http://euro2013.org
euro2013@ega.it
Following the success of previous EURO Conferences, we solicit your
submission and participation to the XXVI EURO-INFORMS Joint
International Conference: "All roads lead to OR" which will be held in
Rome on July 1-4, 2013. The Program Committee chaired by Marc Sevaux
(EURO) and David Simchi Levi (INFORMS) and the Organizing Committee
chaired by Paolo Dell'Olmo (AIRO), are preparing a high quality
scientific program and an exciting social program for the conference.
We are confident that the XXVI EURO-INFORMS Joint International
Conference will be an extraordinary opportunity for the OR community
to get together again in a unique location, and we are looking
forward to meeting you in Rome in 2013. Please visit the Conference
website (www.euro2013.org) for more information.
Submission Deadline: March 1, 2013
Notification of Authors: March 15, 2013
Deadline early registration (and inclusion in the program): April 15, 2013
Registration and Welcome Cocktail: June 30, 2013
Conference date: July 1-4, 2013
PLENARIES, KEYNOTES and TUTORIALS:
Plenaries:
----------
Hal VARIAN Google
George NEMHAUSER Combinatorial optimization and its applications
IFORS Distinguished Lecturer will be announced soon
Keynotes:
---------
Enrique BENAVENT: Arc routing problems, mainly exact methods
Ashish GOEL: Optimization for e-commerce and social networks
Adam LETCHFORD: Combinatorial optimization
Sanjay MEHROTRA: Optimization and healthcare
Linet OZDAMAR: OR for humanitarian logistics
Joel SOKOL: Industry and teaching
Tutorials:
----------
Dimitri BERTSIMAS: Portfolio optimization
Stéphane DAUZERE-PERES: Lot sizing problems
Zonghao GU: Software and integer programming
Hoai An LE THI: Difference of convex functions optimization
Gunther RAIDL: Stochastic search
Rakesh VOHRA: Game theory and discrete optimization
ABSTRACT SUBMISSION:
We invite all researchers, academicians, practitioners, as well as
students interested in any branch of Operational Research,
mathematical modeling or economic analysis to participate at the
conference and to present their research. Invited and contributed
papers will be organized in parallel sessions.
No participant can present more than one paper at the conference.
Abstract submission and registration are both online, via the
conference web page (www.euro2013.org).
Abstracts: max. 600 characters; submission deadline: March 14, 2013.
Researchers who want to organize a Stream (a collection of Sessions
around one topic) or a Session, or wish to contribute a paper within
an invited session are still welcome to contact the PC member of the
corresponding area. We invite submissions on - but not limited to Â
the following Main Areas:
- Artificial Intelligence, Fuzzy Systems
- Computing
- Continuous Optimization
- Control Theory & System Dynamics
- Data Science, Business Analytics, Data Mining
- Decision Analysis, Decision Support Systems, DEA and Performance Measurement
- Discrete Optimization, Geometry & Graphs
- Emerging Applications of OR
- Energy / Environment and Climate
- Financial Modeling, Risk Management, Managerial Accounting
- Game Theory, Mathematical Economics
- Location, Logistics, Transportation
- Metaheuristics
- Multiple Criteria Decision Making and Optimization
- OR Education, History, Ethics
- OR for Developing Countries, Humanitarian Applications
- OR in Health, Life Sciences & Sports
- OR in Industry and Software for OR
- OR in Natural Resources
- Production Management & Supply Chain Management
- Revenue Management
- Scheduling, Time Tabling & Project Management
- Service Systems
- Simulation, Stochastic Programming and Modeling
- Soft OR and Problem Structuring Methods
- Telecommunication, Networks and Social Networks
For closer information about the given Streams in these areas, please
see http://euro2013.org/?page_id=103.
PROGRAM COMMITTEE of EURO-INFORMS 2013:
- Marc Sevaux, France (Chair)
- David Simchi-Levi, USA (Chair)
- Sally Brailsford, UK (EURO VP1)
- Maria Antonia Carravilla, Portugal
- Marielle Christiansen, Norway
- Paolo Dell'Olmo, Italy
- Guillermo Gallego, USA
- Jérémie Gallien, UK
- Michel Gendreau, Canada
- Diego Klabjan, USA
- Ana Meca Martinez, Spain
- Rolf Möhring, Germany
- Mike Pinedo, USA
- Christian Prins, France
- Abraham Seidmann, USA
- Kenneth Sörensen, Belgium
- Ariela Sofer, USA
- Fabio Tardella, Italy
- Tamas Terlaky, USA
- Mike Trick, USA
- Steef van de Velde, The Netherlands
- Christos Vasilakis, UK
- Gerhard-Wilhelm Weber, Turkey (Advisor to EURO Conferences)
ORGANIZING COMMITTEE of EURO-INFORMS 2013:
- Paolo Dell'Olmo, University of Rome (Chair)
- Renato De Leone, University of Camerino
- Giovanni Felici, Italian National Research Council - IASI Rome
- Paola Festa, University of Naples
- Stefano Giordani, Tor Vergata - University of Rome II
- Francesca Guerriero, University of Calabria
- Silvano Martello, University of Bologna
- Gaia Nicosia, University of Rome III
- Laura Palagi, Sapienza - University of Rome
- Fabio Schoen, University of Florence
- Anna Sciomachen, University of Genova
- Roberto Tadei, University of Torino
- Walter Ukovich, University of Trieste
THE PROGRAMME IN BRIEF:
The Registration opens on June 30 (Sunday), 4 pm with Welcome
Reception from 6 pm to 10 pm in the Campus of Sapienza. The Conference
starts July 1 (Monday) with the Opening Session in the Aula Magna and
proceeds with the working sessions up to Thursday morning. In the
evening of July 2 (Tuesday) there will be a social event: Night @
Sapienza. The Conference Gala Dinner will be held in the evening of
July 3 (Wednesday). In the late morning of July 4, the Conference ends
with the Closing Session in the Aula Magna.
For the interesting Satellite Events which will be closely related to
EURO-INFORMS 2013, please see http://euro2013.org/?page_id=734.
REGISTRATION:
The following registration fees apply:
- Regular: 350 Euro (early); 470 Euro (late),
- Student: 190 Euro (early); 290 Euro (late),
- Accompanying persons: 80 Euro.
Early registration ends at April 15, 2013.
TRAVEL and ACCOMMODATION:
Rome receives more than 7 million tourists a year and since July is
high tourist season, to enjoy the conference in the most convenient
way, we strongly recommend to book as early as possible:
1. Accommodation in Rome through the Conference webpage.
2. Air tickets as early as possible.
The Conference Secretariat has reserved a large number of rooms in a
number of hotels in Rome, as close as possible to the conference site
(the Campus of Sapienza University of Rome, located in Rome central
area). Please keep in mind that in the Conference period Rome is very
busy with tourists and any delay in booking hotel rooms could be a
real problem. For more details, consult the conference site
www.euro2013.org, where all relevant information will be regularly
updated.
On further questions regarding travel and accommodation, please
contact via euro2013@ega.it.
COORGANIZING INSTITUTIONS:
EURO-INFORMS 2013 will be hosted by Sapienza Universita di Roma.
It is sponsored by the following organizations:
- The Italian Operations Research Society (AIRO),
- The Association of European Operational Research Societies (EURO),
- The Institute for Operations Research and Management Science (INFORMS).
For any further information please contact:
Studio Ega Srl - EURO-INFORMS Conference Secretariat
Viale Tiziano, 19 - 00196 Rome, Italy
E-mail: euro2013@ega.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Optimization and Big Data (Workshop, Trek & Colloquium), Edinburgh, May 1-3, 2013 (headline speaker: Steve Wright)
Event Announcement:
Optimization and Big Data (Workshop, Trek & Colloquium)
Edinburgh, Scotland, May 1-3, 2013
Website + Registration:
http://www.maths.ed.ac.uk/~prichtar/Optimization_and_Big_Data
No registration fee thanks to EPSRC funding (Mathematics for Vast
Digital Resources + The Centre for Numerical Algorithms and
Intelligent Software)
May 1-2: Workshop (Fourteen 40-minute talks, 7 on each day)
Confirmed speakers:
Olivier Fercoq (Edinburgh)
Jacek Gondzio (Edinburgh)
Zaid Harchaoui (INRIA)
Desmond Higham (Strathclyde)
Martin Jaggi (Ecole Polytechnique)
Anatoli Juditsky (Joseph Fourier)
Imre Polik (SAS)
Shai Shalev-Shwartz (Jerusalem)
Martin Takac (Edinburgh)
Steve Wright (Wisconsin-Madison)
+ Poster Session (best poster wins an iPad mini - sponsored by SAS)
May 3:
Morning: Trek to Arthur's Seat (a 350m years old extinct volcano in
the city centre)
Afternoon: Colloquium Talk by Steve Wright, Best Poster Award
Ceremony, Networking Reception
-------------
Peter Richtarik
Lecturer / Assistant Professor
School of Mathematics
University of Edinburgh
6317 James Clerk Maxwell Building
King's Buildings
Mayfield Road
Edinburgh EH9 3JZ
Scotland, United Kingdom
Tel: +44(0)131 650 5049
Email: Peter.Richtarik@ed.ac.uk
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* 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/
*
**********************************************************
Optimization and Big Data (Workshop, Trek & Colloquium)
Edinburgh, Scotland, May 1-3, 2013
Website + Registration:
http://www.maths.ed.ac.uk/~prichtar/Optimization_and_Big_Data
No registration fee thanks to EPSRC funding (Mathematics for Vast
Digital Resources + The Centre for Numerical Algorithms and
Intelligent Software)
May 1-2: Workshop (Fourteen 40-minute talks, 7 on each day)
Confirmed speakers:
Olivier Fercoq (Edinburgh)
Jacek Gondzio (Edinburgh)
Zaid Harchaoui (INRIA)
Desmond Higham (Strathclyde)
Martin Jaggi (Ecole Polytechnique)
Anatoli Juditsky (Joseph Fourier)
Imre Polik (SAS)
Shai Shalev-Shwartz (Jerusalem)
Martin Takac (Edinburgh)
Steve Wright (Wisconsin-Madison)
+ Poster Session (best poster wins an iPad mini - sponsored by SAS)
May 3:
Morning: Trek to Arthur's Seat (a 350m years old extinct volcano in
the city centre)
Afternoon: Colloquium Talk by Steve Wright, Best Poster Award
Ceremony, Networking Reception
-------------
Peter Richtarik
Lecturer / Assistant Professor
School of Mathematics
University of Edinburgh
6317 James Clerk Maxwell Building
King's Buildings
Mayfield Road
Edinburgh EH9 3JZ
Scotland, United Kingdom
Tel: +44(0)131 650 5049
Email: Peter.Richtarik@ed.ac.uk
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* 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] LAST DAYS: ADHOC-NOW 2013 : Ad-Hoc, Mobile and Wireless Networks || Wroclaw, Poland
CALL FOR PAPERS
ADHOC-NOW 2013 : Ad-Hoc, Mobile and Wireless Networks
July 8 - 10, 2013, Wroclaw, Poland
=====================================================================
IMPORTANT DATES:
- When Jul 8 - Jul 10, 2013
- WhereWroclaw, Poland
- Submission Deadline Mar 3, 2013
- Notification Due Apr 14, 2013
- Final Version Due Apr 28, 2013
- Link http://www.adhocnow.org/
=====================================================================
CALL FOR PAPERS
Since its creation in 2002, the International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW) has become a well-established and well known event dedicated to
wireless and mobile computing. It serves as a forum for discussions on ongoing research and new contributions. The conference addresses both experimental and
theoretical research in the areas of ad hoc networks, sensor networks, mesh networks and vehicular networks. It focuses on all issues from link layer up to the
application layer. The twelfth edition of this series will take place in Wroclaw, Poland, from the 8th to the 10th of July, 2013.
We seek original contributions such as work in progress and experimental and theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless Networks. Submissions
must not be published or under review for another conference or journal. We are interested, but not limited to, research papers in any of the following areas:
-Access Control
-Ad Hoc Networks of Autonomous Intelligent Systems
-Algorithmic Issues
-Analytic Methods and Modeling for Performance Evaluation
-Ad Hoc Network Applications and Architectures
-Delay-Tolerant Networking
-Distributed Algorithms for Ad Hoc Networks
-Energy Efficiency
-Geometric Graphs
-Location Discovery and Management
-Mobility Handling and Utilization
-Wireless Mesh Networks
-Mobile Ad Hoc Computing Platforms
-Systems and Testbeds
-Mobile Social Networking
-Quality-of-Service
-Routing Protocols (Unicast, Multicast, etc.)
-Secure Services and Protocols
-Sensor Networks
-Self-Configuration
-Service Discovery
-Timing Synchronization
-Vehicular Networks
-Wireless Internet.
The conference proceedings will be published by Springer-Verlag, as part of the Lecture Notes in Computer Science (LNCS) series. Authors are invited to submit a draft
of a full paper of at most 12 pages in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and
relevance. Each accepted paper will be included in the conference proceedings, provided at least one author of the paper registers to present the paper at the
conference.
=====================================================================
PROGRAM COMMITTEE CHAIRS
- Jacek Cichon, Wroclaw University of Technology, Wroclaw, Poland (chair)
- Marek Klonowski, Wroclaw University of Technology, Wroclaw, Poland
- Evangelos Kranakis, Carleton University, Ottawa, Canada
- Jaime Lloret, Polytechnic University of Valencia, Valencia, Spain
- Sotiris Nikoletseas, Patras University, Patras, Greece
- Ivan Stojmenovic, University of Ottawa, Ottawa, Canada
ORGANIZING COMMITEE
Publicity:
Sandra Sendra, Polytechnic University of Valencia, Spain
Jakub Lemiesz, Wroclaw University of Technology, Poland
Registration & Local arrangements:
Rafal Kapelko, Wroclaw University of Technology
Proceedings:
Maciej Gebala, Wroclaw University of Technology
Webchairs:
Marcin Zawada, Wroclaw University of Technology;
Przemyslaw Kobylanski, Wroclaw University of Technology
=====================================================================
ADDITIONAL INFORMATION
- The list of members of the Program Committee will be published soon on the web page of the conference.
- Visit Wroclaw: see the page http://www.wroclaw-life.com/
**********************************************************
*
* 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/
*
**********************************************************
ADHOC-NOW 2013 : Ad-Hoc, Mobile and Wireless Networks
July 8 - 10, 2013, Wroclaw, Poland
=====================================================================
IMPORTANT DATES:
- When Jul 8 - Jul 10, 2013
- WhereWroclaw, Poland
- Submission Deadline Mar 3, 2013
- Notification Due Apr 14, 2013
- Final Version Due Apr 28, 2013
- Link http://www.adhocnow.org/
=====================================================================
CALL FOR PAPERS
Since its creation in 2002, the International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW) has become a well-established and well known event dedicated to
wireless and mobile computing. It serves as a forum for discussions on ongoing research and new contributions. The conference addresses both experimental and
theoretical research in the areas of ad hoc networks, sensor networks, mesh networks and vehicular networks. It focuses on all issues from link layer up to the
application layer. The twelfth edition of this series will take place in Wroclaw, Poland, from the 8th to the 10th of July, 2013.
We seek original contributions such as work in progress and experimental and theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless Networks. Submissions
must not be published or under review for another conference or journal. We are interested, but not limited to, research papers in any of the following areas:
-Access Control
-Ad Hoc Networks of Autonomous Intelligent Systems
-Algorithmic Issues
-Analytic Methods and Modeling for Performance Evaluation
-Ad Hoc Network Applications and Architectures
-Delay-Tolerant Networking
-Distributed Algorithms for Ad Hoc Networks
-Energy Efficiency
-Geometric Graphs
-Location Discovery and Management
-Mobility Handling and Utilization
-Wireless Mesh Networks
-Mobile Ad Hoc Computing Platforms
-Systems and Testbeds
-Mobile Social Networking
-Quality-of-Service
-Routing Protocols (Unicast, Multicast, etc.)
-Secure Services and Protocols
-Sensor Networks
-Self-Configuration
-Service Discovery
-Timing Synchronization
-Vehicular Networks
-Wireless Internet.
The conference proceedings will be published by Springer-Verlag, as part of the Lecture Notes in Computer Science (LNCS) series. Authors are invited to submit a draft
of a full paper of at most 12 pages in the LNCS style. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and
relevance. Each accepted paper will be included in the conference proceedings, provided at least one author of the paper registers to present the paper at the
conference.
=====================================================================
PROGRAM COMMITTEE CHAIRS
- Jacek Cichon, Wroclaw University of Technology, Wroclaw, Poland (chair)
- Marek Klonowski, Wroclaw University of Technology, Wroclaw, Poland
- Evangelos Kranakis, Carleton University, Ottawa, Canada
- Jaime Lloret, Polytechnic University of Valencia, Valencia, Spain
- Sotiris Nikoletseas, Patras University, Patras, Greece
- Ivan Stojmenovic, University of Ottawa, Ottawa, Canada
ORGANIZING COMMITEE
Publicity:
Sandra Sendra, Polytechnic University of Valencia, Spain
Jakub Lemiesz, Wroclaw University of Technology, Poland
Registration & Local arrangements:
Rafal Kapelko, Wroclaw University of Technology
Proceedings:
Maciej Gebala, Wroclaw University of Technology
Webchairs:
Marcin Zawada, Wroclaw University of Technology;
Przemyslaw Kobylanski, Wroclaw University of Technology
=====================================================================
ADDITIONAL INFORMATION
- The list of members of the Program Committee will be published soon on the web page of the conference.
- Visit Wroclaw: see the page http://www.wroclaw-life.com/
**********************************************************
*
* 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] Ph.D. Position at the University of Nantes, France
[Apologies for multiple copies]
We are looking for an excellent candidate for a Ph.D. position at the
Laboratory of Computer Science (LINA) of the University of Nantes,
France, starting from September 2013. The candidate will be part of the
TASC team at the LINA, one of the most leading research teams in the
field of Constraint Programming, producing among others the Choco
constraint solver.
*Title*: New parallel algorithms for Combinatorial Optimization
*Advisors*: Éric Monfroy and Florian Richoux
*Grant*: 3-year funding from the French Ministry of Research.
*Abstract*:
The evolution of computer architecture is leading us toward massively
multi-core computers for tomorrow, composed of thousands of computing
units. However nowadays, we do not know how to design algorithms able to
manage efficiently such a computing power. In particular, this is true
for combinatorial optimization algorithms, like algorithms solving
constraint-based problems. There exist several techniques for solving
constraint-based problems: Constraint Programming, Llinear Programming,
Boolean Satisfaction methods and Local Search methods to give an
non-exhaustive list. The latter is often among the most efficient
techniques to solve large size problems.
Nowadays and up to our knowledge, there exists only one algorithm
(Adaptive Search, a local search algorithm) showing very good
performances scaling to thousands of cores. However its parallel scheme
does not include inter-process cooperative communications. Moreover, the
rising of more and more complex algorithms leads to an number of
parameters which become intractable to manage by hand, and parallel
algorithms emphasize this trend.
In this context, this Ph.D. topic has two major objectives:
- To propose and implement local search methods scalable over thousands
of cores with cooperative and communicating processes. Beyond this
objective, there is another one: to define a portfolio approach,
having simultaneous processes of different nature (i.e., different
algorithms, or the same algorithm with different parameters) exploring
the search space.
- To develop and implement auto-tuning mechanisms for parallel local
search methods, i.e., mechanisms allowing to automatically manage
parameters (through machine learning techniques), and to include them
into local search methods developed during this thesis.
*Key words*: Constraint-based problems, parallel local search
algorithms, massively parallel architectures, auto-tuning, machine learning.
You can find the full Ph.D. topic at this address:
http://pagesperso.lina.univ-nantes.fr/~richoux-f/sujets/parallel_PhD-en.pdf
<http://pagesperso.lina.univ-nantes.fr/%7Erichoux-f/sujets/parallel_PhD-en.pdf>
**************************
*The salary *will be around *1420€ per month after taxe*, with benefits
such as health insurance and social coverage included. There are no
teaching duties, however the Ph.D.candidate will have the possibility to
teach (in French) at the University of Nantes. With teaching duties, the
salary will be around *1640€ per month after taxes*.
*Nantes* is the capital of the western French region Pays de la Loire.
It is the 6th largest city in France with 800.000 inhabitants, located
on the Loire River at 50km from the Atlantic Ocean. Nantes is one of the
most young and dynamic cities in France, and has been described in 2004
by the Times as "the most liveable city in Europe". The city is a hub in
Europe for IT innovations. This year, Nantes holds the title of European
Green Capital for its efforts to reduce air pollution and CO2 emissions,
for its high quality and well-managed public transport system and for
its biodiversity.
*The ideal candidate* should have a master degree or equivalent in
Computer Science or in Mathematics, and combine solid theoretical
background and strong programming skills (in particular C/C++).
Background knowledge and/or previous experience in the following areas,
though not mandatory, will be considered very favorably:
- For theoretical background: CSP, Meta-Heurisitics, Parameters
Auto-tuning, Machine Learning
- For software development: C++11, MPI or X10 programming.
If your are interested, please send your application in pdf as soon as
possible, with:
- a resume,
- a motivation letter,
- if possible, your Master grades,
- the name and contact of up to three references.
at the following addresses: eric.monfroy@univ-nantes.fr
<mailto:eric.monfroy@univ-nantes.fr> and florian.richoux@univ-nantes.fr
<mailto:florian.richoux@univ-nantes.fr>
Feel free to contact us for further information.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP Computational Optimization
[Please post - apologies for multiple copies.]
------------
Call for Papers
6th Workshop on Computational Optimization (WCO 2013)
Krakow, Poland, September 8 - 11, 2013
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2013
http://www.fedcsis.org/
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
* computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc
====================
Important dates:
12.05.2013 (May 12, 2013): Full paper submission
17.06.2013 (June 17, 2013): Notification of acceptance
8.07.2013 (July 8, 2013): Camera-ready version of the accepted paper
and registration
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) - we will announce later the
publisher.
====================
If you have any question do not hesitate to send a mail to wco2013@fedcsis.org .
Workshop co-chairs:
Stefka Fidanova, Bulgaria
Antonio Mucherino, France
Daniela Zaharie, Romania
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
------------
Call for Papers
6th Workshop on Computational Optimization (WCO 2013)
Krakow, Poland, September 8 - 11, 2013
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2013
http://www.fedcsis.org/
====================
We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:
* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
* computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, engineering etc
====================
Important dates:
12.05.2013 (May 12, 2013): Full paper submission
17.06.2013 (June 17, 2013): Notification of acceptance
8.07.2013 (July 8, 2013): Camera-ready version of the accepted paper
and registration
====================
Submission and Publication
* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 8 pages (IEEE style).
IEEE style templates are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and Presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) - we will announce later the
publisher.
====================
If you have any question do not hesitate to send a mail to wco2013@fedcsis.org .
Workshop co-chairs:
Stefka Fidanova, Bulgaria
Antonio Mucherino, France
Daniela Zaharie, Romania
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] FRICO 2013: 16th Workshop on Future Research in Combinatorial Optimization
****************************************************************
FRICO 2013
(16th Workshop on Future Research in Combinatorial Optimization)
August 21-24, 2013
RWTH Aachen University, Aachen, Germany.
****************************************************************
Registration deadline: April 28, 2013
FRICO 2013 is the 16th event in a sequence of successful meetings
and will take place from August 21-24, 2013 at RWTH Aachen University.
The workshop aims to bring together young researchers (Master students,
PhD students and PostDocs) and to encourage the exchange of new ideas.
The focus of the workshop is to present their own results as well as
work in progress from various areas of combinatorial optimization.
FRICO is intended to be a workshop in the original meaning of the word.
In particular, we encourage the submission and presentation of on-going
and future research (even work containing gaps and unsolved problems).
Besides plenty of time between sessions, there will be a social program
that allows participants to exchange ideas and have fruitful discussions.
Similar to last year's FRICO, we plan to have an industry day where
practitioners from the industry will highlight the application of
combinatorial optimization in practice.
To enable students and young researchers without major financial backing
to participate at FRICO, participation for young researchers is free of
charge. Participants will only have to cover their travel and
accommodation expenses.
More information about the workshop can be found on the website:
http://www.or.rwth-aachen.de/frico/
In order to register, please send an email with your name, your
affiliation and a preliminary title by April 28, 2013 to
frico2013@or.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/
*
**********************************************************
FRICO 2013
(16th Workshop on Future Research in Combinatorial Optimization)
August 21-24, 2013
RWTH Aachen University, Aachen, Germany.
****************************************************************
Registration deadline: April 28, 2013
FRICO 2013 is the 16th event in a sequence of successful meetings
and will take place from August 21-24, 2013 at RWTH Aachen University.
The workshop aims to bring together young researchers (Master students,
PhD students and PostDocs) and to encourage the exchange of new ideas.
The focus of the workshop is to present their own results as well as
work in progress from various areas of combinatorial optimization.
FRICO is intended to be a workshop in the original meaning of the word.
In particular, we encourage the submission and presentation of on-going
and future research (even work containing gaps and unsolved problems).
Besides plenty of time between sessions, there will be a social program
that allows participants to exchange ideas and have fruitful discussions.
Similar to last year's FRICO, we plan to have an industry day where
practitioners from the industry will highlight the application of
combinatorial optimization in practice.
To enable students and young researchers without major financial backing
to participate at FRICO, participation for young researchers is free of
charge. Participants will only have to cover their travel and
accommodation expenses.
More information about the workshop can be found on the website:
http://www.or.rwth-aachen.de/frico/
In order to register, please send an email with your name, your
affiliation and a preliminary title by April 28, 2013 to
frico2013@or.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/
*
**********************************************************
[DMANET] eBook Graph Theory
eBook "Graph Theory", by Reinhard Diestel, available in current format until 11 March only
On March 12, 2013, the inexpensive eBook edition of my book, Graph Theory, will have to move to another outlet, due to e-publisher Lulu's policy decision to discontinue Adobe-DRM support. I hope to have alternative channels in place by that time, but cannot say at this stage whether they'll be as cheap as currently at Lulu.
Until March 11, the eBook should continue to be available from Lulu, through the book's website,
http://diestel-graph-theory.com
It runs on PCs, Macs, iOS and Android devices.
The (printable) `professional edition' has changed from its earlier certificate-based protection to password-based protection, which is easier to use and should work on all platforms that can display PDF.
The free preview edition will be unaffected by these changes and remain available from the book's website.
RD, 1 March 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/
*
**********************************************************
On March 12, 2013, the inexpensive eBook edition of my book, Graph Theory, will have to move to another outlet, due to e-publisher Lulu's policy decision to discontinue Adobe-DRM support. I hope to have alternative channels in place by that time, but cannot say at this stage whether they'll be as cheap as currently at Lulu.
Until March 11, the eBook should continue to be available from Lulu, through the book's website,
http://diestel-graph-theory.com
It runs on PCs, Macs, iOS and Android devices.
The (printable) `professional edition' has changed from its earlier certificate-based protection to password-based protection, which is easier to use and should work on all platforms that can display PDF.
The free preview edition will be unaffected by these changes and remain available from the book's website.
RD, 1 March 2013
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] ESA 2013 - call for papers
ESA 2013 - call for papers
--------------------------------------------------------------------
CALL FOR PAPERS
ESA 2013
21st European Symposium on Algorithms
http://algo2013.inria.fr/esa.shtml
Sophia Antipolis, France
September 2-4, 2013
--------------------------------------------------------------------
GENERAL INFORMATION
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2013 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2013 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is part
of ALGO 2013.
--------------------------------------------------------------------
TOPICS
Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parameterized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms.
--------------------------------------------------------------------
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.
* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: use the LNCS style file
as given, but please do add page numbers, which can be done,
for example, by adding
\pagestyle{plain}
just before
\begin{document}
* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.
These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LNCS format) will be
rejected without consideration of their merits.
Papers should be submitted electronically via the EasyChair
submission system, accessible via
https://www.easychair.org/conferences/?conf=esa20130
and with the appropriate track selected. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2013, is not permitted. There will be a Best Student Paper
Award, as well as a Best Paper Award. The ESA proceedings will be
published in the Lecture Notes in Computer Science series by
Springer-Verlag. Each accepted paper will be allotted 12 pages in
the proceedings.
--------------------------------------------------------------------
IMPORTANT DATES
* Submission deadline: Monday, April 22, 2012, 20:00 GMT (22:00 CEST, 23:00 IDT)
* Notification: Monday, June 10, 2013
* Final version due: Sunday, June 23, 2013
* Symposium: September 2-4, 2013 (Sophia Antipolis, France)
--------------------------------------------------------------------
INVITED SPEAKERS
Claire Mathieu, CNRS, Ecole Normale Superieure, France and
Brown University, USA
Hannah Bast, University of Freiburg, Germany
--------------------------------------------------------------------
MORE INFORMATION
ESA 2013 will be co-located with IPEC (8th International Symposium
on Parameterized and Exact Computation, September 4-6), WABI (13th
Workshop on Algorithms in Bioinformatics, September 2-4), ATMOS
(13th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 5), WAOA (11th
Workshop on Approximation and Online Algorithms, September 5-6),
ALGOSENSORS (9th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 5-6), and MASSIVE (5th Workshop on Massive Data Algorithmics,
September 5).
--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK
* Sebastian Böcker, Friedrich-Schiller-Universität Jena, Germany
* Hans Bodlaender (chair), Utrecht University, the Netherlands
* Emanuele G. Fusco, Sapienza University of Rome, Italy
* MohammadTaghi Hajiaghayi, University of Maryland, USA
* Tobias Harks, Maastricht University, the Netherlands
* Iyad Kanj, DePaul University, USA
* Petteri Kaski, Aalto University, Finland
* Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
* Guy Kortsarz, Rutgers, USA
* Jan Kratochvil, Charles University, Czech Republic
* Nicole Megow, Technische Universität Berlin, Germany
* Sang-il Oum, KAIST, South Korea
* Konstantinos Panagiotou, University of Munich, Germany
* Andrzej Pelc, Université du Québec en Outaouais, Canada
* Jeff Phillips, University of Utah, USA
* Pascal Schweitzer, JAIST, Japan and ETH Zürich, Switzerland
* Sagi Snir, University of Haifa, Israel
* Kavitha Telikepalli, Tata Institute of Fundamental Research, India
* Denis Trystram, Grenoble Institute of Technology, France
* Ronald de Wolf, CWI and University of Amsterdam, the Netherlands
* Alexander Wolff, Universität Würzburg, Germany
* Norbert Zeh, Dalhousie University, Canada
--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK
* David Bader, Georgia Tech, USA
* Cathy McGeoch, Amherst College, USA
* Loukas Georgiadis, University of Ioannina, Greece
* Roberto Grossi, University of Pisa, Italy
* Giuseppe F. Italiano (Chair), University of Rome "Tor Vergata", Italy
* Jyrki Katajainen, University of Copenhagen, Denmark
* Marc van Kreveld, Utrecht University, The Netherlands
* Leo Liberti, LIX, Ecole Polytechnique, France
* Bernard Moret, EPFL, Switzerland
* Gabriel Moruz, University of Frankfurt, Germany
* Matthias Muller-Hannemann, Martin Luther University Halle-Wittenberg, Germany
* Kunihiko Sadakane, National Institute of Informatics, Japan
* Martin Skutella, Technische Universität Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology, Germany
* Renato Werneck, Microsoft Research, USA
--------------------------------------------------------------------
ORGANIZING COMMITTEE
* Frédéric Cazals
* Agnès Cortell (event manager)
* David Coudert
* Olivier Devillers
* Joanna Moulierac
* Monique Teillaud (chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
--------------------------------------------------------------------
CALL FOR PAPERS
ESA 2013
21st European Symposium on Algorithms
http://algo2013.inria.fr/esa.shtml
Sophia Antipolis, France
September 2-4, 2013
--------------------------------------------------------------------
GENERAL INFORMATION
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2013 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2013 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is part
of ALGO 2013.
--------------------------------------------------------------------
TOPICS
Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:
- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parameterized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms.
--------------------------------------------------------------------
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.
* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: use the LNCS style file
as given, but please do add page numbers, which can be done,
for example, by adding
\pagestyle{plain}
just before
\begin{document}
* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their
discretion.
These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LNCS format) will be
rejected without consideration of their merits.
Papers should be submitted electronically via the EasyChair
submission system, accessible via
https://www.easychair.org/conferences/?conf=esa20130
and with the appropriate track selected. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2013, is not permitted. There will be a Best Student Paper
Award, as well as a Best Paper Award. The ESA proceedings will be
published in the Lecture Notes in Computer Science series by
Springer-Verlag. Each accepted paper will be allotted 12 pages in
the proceedings.
--------------------------------------------------------------------
IMPORTANT DATES
* Submission deadline: Monday, April 22, 2012, 20:00 GMT (22:00 CEST, 23:00 IDT)
* Notification: Monday, June 10, 2013
* Final version due: Sunday, June 23, 2013
* Symposium: September 2-4, 2013 (Sophia Antipolis, France)
--------------------------------------------------------------------
INVITED SPEAKERS
Claire Mathieu, CNRS, Ecole Normale Superieure, France and
Brown University, USA
Hannah Bast, University of Freiburg, Germany
--------------------------------------------------------------------
MORE INFORMATION
ESA 2013 will be co-located with IPEC (8th International Symposium
on Parameterized and Exact Computation, September 4-6), WABI (13th
Workshop on Algorithms in Bioinformatics, September 2-4), ATMOS
(13th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 5), WAOA (11th
Workshop on Approximation and Online Algorithms, September 5-6),
ALGOSENSORS (9th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 5-6), and MASSIVE (5th Workshop on Massive Data Algorithmics,
September 5).
--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK
* Sebastian Böcker, Friedrich-Schiller-Universität Jena, Germany
* Hans Bodlaender (chair), Utrecht University, the Netherlands
* Emanuele G. Fusco, Sapienza University of Rome, Italy
* MohammadTaghi Hajiaghayi, University of Maryland, USA
* Tobias Harks, Maastricht University, the Netherlands
* Iyad Kanj, DePaul University, USA
* Petteri Kaski, Aalto University, Finland
* Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
* Guy Kortsarz, Rutgers, USA
* Jan Kratochvil, Charles University, Czech Republic
* Nicole Megow, Technische Universität Berlin, Germany
* Sang-il Oum, KAIST, South Korea
* Konstantinos Panagiotou, University of Munich, Germany
* Andrzej Pelc, Université du Québec en Outaouais, Canada
* Jeff Phillips, University of Utah, USA
* Pascal Schweitzer, JAIST, Japan and ETH Zürich, Switzerland
* Sagi Snir, University of Haifa, Israel
* Kavitha Telikepalli, Tata Institute of Fundamental Research, India
* Denis Trystram, Grenoble Institute of Technology, France
* Ronald de Wolf, CWI and University of Amsterdam, the Netherlands
* Alexander Wolff, Universität Würzburg, Germany
* Norbert Zeh, Dalhousie University, Canada
--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK
* David Bader, Georgia Tech, USA
* Cathy McGeoch, Amherst College, USA
* Loukas Georgiadis, University of Ioannina, Greece
* Roberto Grossi, University of Pisa, Italy
* Giuseppe F. Italiano (Chair), University of Rome "Tor Vergata", Italy
* Jyrki Katajainen, University of Copenhagen, Denmark
* Marc van Kreveld, Utrecht University, The Netherlands
* Leo Liberti, LIX, Ecole Polytechnique, France
* Bernard Moret, EPFL, Switzerland
* Gabriel Moruz, University of Frankfurt, Germany
* Matthias Muller-Hannemann, Martin Luther University Halle-Wittenberg, Germany
* Kunihiko Sadakane, National Institute of Informatics, Japan
* Martin Skutella, Technische Universität Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology, Germany
* Renato Werneck, Microsoft Research, USA
--------------------------------------------------------------------
ORGANIZING COMMITTEE
* Frédéric Cazals
* Agnès Cortell (event manager)
* David Coudert
* Olivier Devillers
* Joanna Moulierac
* Monique Teillaud (chair)
**********************************************************
*
* 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
