[DMANET] Assistant Professor Position in Transport Optimisation

### Assistant Professor in Transport Optimisation ###

At the Department of Transport an Assistant Professor position is available within the field of Transport Optimisation.

The Department of Transport at DTU is the largest transport research community in Denmark and among the largest university-based transport communities in the Nordic countries. The position is attached to the department's Section of Transport Optimisation and Transportation Engineering. The section employs internationally recognised scientists. The section performs research, teaching, innovation and is also to some extent involved in public sector consultancy.

The section's activities are closely related to (and inspired by) problems arising in real world transport and logistics planning. Therefore, the section also has a close cooperation with industry and other world leading universities. Also, the scientists in the section cooperate closely with the other research sections at the department.

### Responsibilities and tasks ###
The successful candidate should conduct research within transport optimisation at the highest international level and will also develop and pursue the dissemination of research results achieved in international peer-reviewed journals. The candidate will be teaching and must develop teaching materials at all levels in the field of transport optimisation. Furthermore, the candidate should actively participate in attracting and co-supervising BSc and MSc students and contribute to the development of the course curriculum.

### Relevant research field ###
The research areas of interest to the Section of Transport Optimisation and Transportation Engineering include but are not limited to:

- Distribution planning and scheduling within transport including allocation and utilisation of transport equipment and personnel
- Optimisation and planning within public transport systems
- Maritime logistics including port operations
- Multimodal transport systems and transport network design
- Intelligent Transport Systems (ITS) and real-time optimisation of transport systems including demand responsive transports

### Qualifications ###
The successful candidate must have:

-A PhD degree
-A strong interest and proven background in transport optimisation and operations research
-An interest in teaching
-Scientific programming skills
-Demonstrated ability and desire to publish in international ISI journals
-Critical analytical and problem-solving skills
-Fluency in English, both spoken and written

### Assessment ###
In the assessment of the candidates consideration will be given to

-experience in teaching and education
-scientific production and research potential at an international level
-the ability to promote and utilise research results
-an all-round experience basis, preferably including international experience
-the ability to contribute to development of the department's internal and external cooperation

### Salary and terms of employment ###
The appointment will be based on the collective agreement with the Confederation of Professional Associations. The allowance will be agreed with the relevant union. The period of employment is 3 years.

### Further information ###
Further information may be obtained from Head of Section, Associate Professor Allan Larsen, +45 4525 1502, ala@transport.dtu.dk or Associate Professor Stefan Røpke, +45 4525 1517, sr@transport.dtu.dk.

You can read more about the Department of Transport at www.transport.dtu.dk

### Application procedure ###
The deadline for submitting the online application is 1 May 2012. Please apply at http://www.transport.dtu.dk/English/About%20DTU%20Transport/Job%20forside/JobOversigt.aspx
fill in the application form and attach your application (in English), CV and a list of publications. Teaching materials and research publications to be considered in the assessment must be attached as well.

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

[DMANET] Research fellow in random graph theory at the University of Birmingham

The University of Birmingham invites applications for a Research fellow to work with Nikolaos Fountoulakis on an
EU-funded project on Random Graph Theory.

The post is available for a period of 1 year from 1st September 2012 or later by mutual agreement.

Applicants are expected to have a PhD in Combinatorics or Probability Theory (or about to complete a PhD).

Informal enquiries about this position are welcome and may be made to
Nikolaos Fountoulakis via email: n.fountoulakis at bham.ac.uk (http://web.mat.bham.ac.uk/N.Fountoulakis/)

Salary from £27,578 a year, in a range up to £35,938 a year, with potential progression to £38,140 a year.

Closing date: 25th April 2012, Reference: 43837

Further information about the Combinatorics group in Birmingham is available on http://web.mat.bham.ac.uk/D.Osthus/bham.html

Further information about the Department is available on http://www.mat.bham.ac.uk

Further details of the post, together with information on application procedures, can be found via: http://www.hr.bham.ac.uk/jobs
**********************************************************
*
* 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] CCCG 2012 : deadline reminder

CCCG 2012 submission deadline: May 7

24th Canadian Conference on Computational Geometry

August 8-10, 2012, Charlottetown, PEI.

Call for Papers:
http://2012.cccg.ca/CFP-CCCG-2012.pdf
----------------------------------------------------

The 24th Canadian Conference on Computational Geometry will be held in Charlottetown, Prince Edward Island, on August 8-10, 2012. There will be a reception on the evening of the 7th.

CCCG has a tradition of being welcoming to students. It is expected that this year registration fees will be reimbursed for most students and postdocs.
See http://2012.cccg.ca for details and updates.

SUBMISSION DETAILS

Submissions should not exceed six pages, must be submitted electronically, and must be prepared using LaTeX; the appropriate template is available from the conference website. Authors who feel that additional details are necessary should include a clearly marked appendix, which will be read at the discretion of the Program Committee. Each submission will be refereed by at least three members of the Program Committee.
Details on the submission procedure are outlined on the conference website. Six-page papers accepted at CCCG will appear in the printed proceedings of the conference. Electronic proceedings without page limits will be hosted at http://cccg.ca
Selected papers from the conference will be invited for submission to a special issue of the journal Computational Geometry: Theory and Applications.

IMPORTANT DATES in 2012

Submissions due: May 7
Notification of acceptance: June 4
Final versions due: June 15
Student applications for fee waivers: June 15
Early registration deadline: July 7
Conference: August 8-10 (reception on 7th)

**********************************************************
*
* 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] Postdoctoral Research Fellowships at University of Warwick, and Queen Mary, University of London, UK

Dear Colleagues,

Two postdoctoral research fellowships are available, one at the University
of Warwick and one at QMUL (Queen Mary, University of London), each for three years.
These positions are for "independent researchers" and are not attached to a particular
project. The general area is Discrete Mathematics, broadly interpreted. There are
more details at

http://www2.warwick.ac.uk/about/partnerships/queenmary/discrete-mathematics

The closing date is 11th May. Details of the application process are given
on the page mentioned above.

Regards
Mark Jerrum
**********************************************************
*
* 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] [AofA 2012] Call for participation

(Apologies for multiple postings)

The 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms will be held at the CRM in Montreal, Canada, on June 17--22, 2012.

http://luc.devroye.org/AofA2012.html

**SCOPE**
Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics. (see http://aofa.cs.purdue.edu)

**KEYNOTE SPEAKERS**
Michael Drmota (TU Vienna, Austria)
Svante Janson (Uppsala, Sweden)
Amin Coja-Oghlan (Warwick, UK)
Claire Mathieu (Brown, USA)
Avi Wigderson (IAS, USA)

**REGISTRATION**
The fees amount to CAD $170 and the registration can be done online at either of the following webpages:

https://www.crm.umontreal.ca/act/form/inscr_algo12_en.shtml
https://www.crm.umontreal.ca/act/form/inscr_algo12_fr.shtml

**ORGANIZATION**
Nicolas Broutin, Inria, France
Luc Devroye, McGill, Canada

**PROGRAM COMMITTEE**
Frédérique Bassino, Paris 13, France
Jit Bose, Carleton, Canada
Nicolas Broutin (co-chair), Inria, France
Philippe Chassaing, Nancy, France
Julien Clément, Caen, France
Luc Devroye (co-chair), McGill, Canada
Uriel Feige, Weizmann, Israel
Alan Frieze, Carnegie-Mellon, USA
Bernhard Gittenberger, TU Vienna, Austria
Hsien-Kuei Hwang, Academia Sinica, Taiwan
Philippe Jacquet, Inria, France
Colin McDiarmid, Oxford, UK
Mike Molloy, Toronto, Canada
Ralph Neininger, Frankfurt, Germany
Marc Noy, Barcelona, Spain
Daniel Panario, Carleton, Canada
Alois Panholzer, TU Vienna, Austria
Bruno Salvy, Inria, France
Mohit Singh, McGill, Canada
Brigitte Vallée, Caen, France
Mark Ward, Purdue, USA

**STEERING COMMITTEE**
Brigitte Chauvin (Versailles, France)
Luc Devroye (McGill, Canada)
Michael Drmota (TU Vienna, Austria)
Daniel Panario (Carleton, Canada)
Robert Sedgewick (Princeton, USA)
Wojciech Szpankowski (Purdue, USA)
Brigitte Vallée (Caen, France)

**SPONSORS**
CRM, Inria, NSERC
**********************************************************
*
* 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 Papera - Automated Theory Exploration (ATx)

[Apologies if you receive multiple copies of this announcement]
*** Deadline extended to 17th April 2012 ***
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
CALL FOR PAPERS:

ATX-2012
IJCAR Workshop on Automated Theory Exploration
(June 30-July 1)
http://dream.inf.ed.ac.uk/events/atx2012

GENERAL INFORMATION

This Workshop on Automated Theory Exploration will be held in June/July in Manchester, UK.
It is associated with the 6th International Conference on Automated Reasoning (IJCAR) and
follows on from two series of workshops: Automated Theory Engineering and Automatheo.

SCOPE

Theory exploration means the development of mathematical axioms, definitions, conjectures,
theorems, examples and inference procedures as needed to cover the essential concepts
and analysis tasks of mathematical and other application domains. The automation and
mechanisation of these capabilities are much sought after in areas such as software
verification, the analysis of computer systems, formalised mathematics and indeed
mathematical research.

The aim of the workshop is to bring together researchers with interests in any aspects
of this area, including domain-specific formalisations, tool and theory development,
and general-purpose frameworks for the structuring of theories and their maintenance.

TOPICS

Theory exploration is relevant to the design of systems, programs, APIs, protocols,
algorithms, design patterns, specification languages, programming languages and
beyond. It involves technology such as ITP systems, ATP systems, SAT/SMT solvers,
model checkers and decision procedures.

Specific topics of the workshop include, but are not limited to:

o mechanised reasoning for modelling and analysis
o automation applied to formal specification and verification
o domain specific models, languages and solvers
o theorem proving technology for theory exploration
o integration of theories and tools
o the formalisation and automation of mathematics
o case studies/experiences
o automated identification of key concepts and results
o supporting collaborative theory exploration

INVITED SPEAKERS

o Robert L. Constable, Cornell University.
o TBA

SUBMISSIONS

We invite submissions in 3 forms:

o Research papers, up to 10 pages;
o System/tool descriptions, up to 5 pages;
o Extended abstracts, up to 3 pages.

Research and tool papers must be unpublished and not submitted for publication
elsewhere. Extended abstracts are intended to discuss ideas and work in progress.
All papers will be reviewed by the programme committee.

Submissions must be in PDF using the LaTeX EasyChair-format
http://www.easychair.org/easychair.zip . One author of each accepted submission
is expected to present the paper at the workshop. Associated systems demos are
encouraged, where appropriate.

Please upload your submission at: https://www.easychair.org/conferences/?conf=atx2012

Accepted research and tool papers will be published as CEUR Workshop Proceedings.

If quality and quantity of the submissions warrants this, we plan to publish a special issue
of a recognized journal on the topic of the workshop.

IMPORTANT DATES:

Submission: 17 April 2012 (*Extended Deadline*)
Notification: 8 May, 2012
Final version: 5 June, 2012
Workshop: 30 June & 1 July, 2012

PROGRAM COMMITTEE

o Jacques Fleuriot (University of Edinburgh, UK)
o Timothy Griffin (University of Cambridge, UK)
o Peter Höfner (NICTA, Australia)
o Joe Hurd (Galois, USA)
o Temur Kutsia (RISC, Austria)
o Roy McCasland (University of Edinburgh, UK)
o Annabelle McIver (Macquarie University, Australia)
o Stephan Merz (INRIA, France)
o Petros Papapanagiotou (University of Edinburgh, UK)
o Alan Smaill (University of Edinburgh, UK)
o David Stanovsky (Charles University, Czech Republic)
o Georg Struth (University of Sheffield, UK)
o Josef Urban (Radboud University, Netherlands)

WORKSHOP ORGANISERS

o Alan Smaill
o Annabelle McIver
o Peter Höfner
o Jacques Fleuriot

The information in this e-mail may be confidential and subject to legal professional privilege and/or copyright. National ICT Australia Limited accepts no liability for any damage caused by this email or its attachments.

[DMANET] CFP: IEEE TPDS Special Issue on Trsut, Security and Privacy

Call for Papers for
IEEE Transactions on Parallel and Distributed Systems
Special Issue on Trust, Security and Privacy in Parallel and Distributed
Systems

In modern computing paradigms, most computing systems, e.g. cluster
computing, grid computing, cloud computing, the Internet, telecommunication
networks, Cyber-Physical Systems (CPS), and Machine-to-Machine
communication networks (M2M), are parallel and distributed systems. While
providing improved expandability, manageability, efficiency and
reliability, parallel and distributed systems increase their security
weaknesses to an unprecedented scale. As the system devices are widely
connected, their vulnerabilities are shared by the entire system. Because
tasks are allocated to, and information is exchanged among the system
devices that may belong to different users, trust, security and privacy
issues have yet to be resolved. The purpose of the proposed Special Issue
of IEEE Transactions on Parallel and Distributed Systems is to publish
recent advances in trust, security and privacy for emerging parallel and
distributed systems, with emphasis on the following aspects, but certainly
not limited to:

(1) Trust: policy semantics, metrics and models; trusted computing
platform; trusted network computing; trusted operating systems; trusted
software and applications; trust in cloud computing/CPS/M2M/social
networks; trust in e-commerce and e-government; trust in mobile and
wireless communications; risk and reputation management; survivable
computer systems/networks; and trust management.

(2) Security related issues: computer security; network security; database
security; Web applications security; security policy, model and
architecture; authentication, authorization and accounting; security in
cloud computing/CPS/M2M/social networks; security in mobile and wireless
communications; security in parallel and distributed systems; and
miscellaneous security issues.

(3) Privacy related issues: privacy in Web-based applications and services;
privacy in database systems; privacy in e-commerce and e-government;
privacy in network deployment and management; privacy in cloud computing/
CPS/M2M/social networks; privacy in mobile and wireless communications;
privacy in parallel and distributed systems; and miscellaneous privacy
issues.

Submission Guidelines

Submitted articles must not have been previously published or currently
under review 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/portal/web/peerreviewjournals/author .
Please thoroughly read these before submitting your manuscript. Please
submit your paper to Manuscript Central at
https://mc.manuscriptcentral.com/tpds-cs .

Deadlines

Manuscript Submission Deadline:   September 16, 2012
Notification of Initial Decision: November 18, 2012
Minor Revisions due (if needed):  December 15, 2012
Notification of Final Decision:   January 26, 2013
Final Manuscripts Due:            February 03, 2013
Publication Date:                 September 2013

Guest Editors

Xu Li, Inria Lille - Nord Europe, France (xu.li@inria.fr)
Patrick McDaniel, Pennsylvania State University, USA (mcdaniel@cse.psu.edu)
Radha Poovendran, University of Washington, USA (RP3@UW.edu)
Guojun Wang, Central South University, China (csgjwang@gmail.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] Symposium on Discrete Mathematics, August 17-18, 2012 at TU Berlin

SYMPOSIUM ON DISCRETE MATHEMATICS 2012
www3.math.tu-berlin.de/dm/symposium2012.html

Call for Participation:

The Symposium on Discrete Mathematics, the biannual meeting of "Fachgruppe Diskrete Mathematik" of DMV (German Mathematical Society), will take place on August 17-18, 2012 at TU Berlin. The program consists of invited one-hour lectures by:

* Sylvia Boyd (University of Ottawa)
* Michel X. Goemans (MIT)
* Michael Krivelevich (Tel Aviv University)
* Angelika Steger (ETH Zürich)
* Günter M. Ziegler (FU Berlin)

Moreover, there will be 30-minute talks by selected junior scientists (to be announced later) but no contributed talks by other participants.

On the occassion of the symposium, the Richard-Rado-Preis 2012 for a dissertation in Discrete Mathematics will be awarded. The prize is funded by a donation of Springer-Verlag.

The symposium will be held two days before ISMP 2012 (www.ismp2012.org), which will also take place at TU Berlin.

The registration fee for the Symposium on Discrete Mathematics is 20 Euro (to be paid on-site). If you would like to participate, please register by sending the following form by email to sdm2012@math.tu-berlin.de

==================================
Herewith I register for the Symposium on
Discrete Mathematics 2012 at TU Berlin.

Last name:
First name:
Affiliation:

I am interested in attending the conference
dinner on Friday night (about 40 Euro per
person): yes/no
==================================
**********************************************************
*
* 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 2012 - call for papers

--------------------------------------------------------------------
--------------------------------------------------------------------
CALL FOR PAPERS

ESA 2012
20th European Symposium on Algorithms

http://algo12.fri.uni-lj.si/?file=esa

Ljubljana, Slovenia
September 10-12, 2012

--------------------------------------------------------------------
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 2012 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 2012 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2012.

--------------------------------------------------------------------
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 the conference website, using
the link of the appropriate track. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2012, 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: Sunday, April 22, 2012, 20:00 GMT (22:00 CEST,
23:00 IDT)
* Notification: Sunday, June 17, 2012
* Final version due: Tuesday, July 1, 2012
* Symposium: September 10-12, 2012 (Ljubljana, Slovenia)

--------------------------------------------------------------------
INVITED SPEAKERS

Yossi Matias, Google and Tel-Aviv University

Jiri Sgall, Charles University in Prague

--------------------------------------------------------------------
MORE INFORMATION

ESA 2012 will be co-located with IPEC (7th International Symposium
on Exact and Parameterized Computing, September 13-14), WABI (12th
Workshop on Algorithms in Bioinformatics, September 10-12), ATMOS
(12th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 13), WAOA (10th
Workshop on Approximation and Online Algorithms, September 13-14),
ALGOSENSORS (8th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 13-14), and MASSIVE (4th Workshop on Massive Data
Algorithmics,
September 13).

--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK

o Leah Epstein (chair), University of Haifa, Israel
o Matthias Englert, University of Warwick, United Kingdom
o Gregory Gutin, University of London, United Kingdom
o Pinar Heggernes, University of Bergen, Norway
o Martin Hoefer, RWTH Aachen University, Germany
o Jochen Koenemann, University of Waterloo, Canada
o Petr Kolman, Charles University, Czech Republic
o Kim Skak Larsen, University of Southern Denmark, Denmark
o Asaf Levin, The Technion, Israel
o Alejandro Lopez-Ortiz, University of Waterloo, Canada
o Krzysztof Onak, Carnegie Mellon University, USA
o Dror Rawitz, Tel-Aviv University, Israel
o Guenter Rote, Freie Universitaet Berlin, Germany
o Andreas Schulz, Massachusetts Institute of Technology (MIT), USA
o Ola Svensson, EPFL Lausanne, Switzerland
o Marc Uetz, University of Twente, The Netherlands
o Carola Wenk, University of Texas at San Antonio, USA
o Peter Widmayer, ETH Zurich, Switzerland
o Christian Wulff-Nilsen, University of Southern Denmark, Denmark
o Raphael Yuster, University of Haifa, Israel

--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK

o Paolo Ferragina (chair), University of Pisa, Italy
o Susanne Albers, Humboldt University, Berlin, Germany
o Alexandr Andoni, Microsoft Research Silicon Valley, USA
o Ioannis Z. Emiris, National Kapodistrian University of Athens,
Greece
o Irene Finocchi, Sapienza University of Rome, Italy
o Johannes Fischer, Karlsruhe Institute of Technology, Germany
o Michael T. Goodrich, University of California, Irvine, USA
o Herman Haverkort, Eindhoven University of Technology, The
Netherlands
o Vahab Mirrokni, Google Research, USA
o Gonzalo Navarro, University of Chile, Chile
o Rina Panigrahy, Microsoft Research Silicon Valley, USA
o Rajeev Raman, University of Leicester, United Kingdom
o Jens Stoye, Bielefeld University, Germany
o Oren Weimann, University of Haifa, Israel
o Ke Yi, Hong Kong University of Science and Technology, China

--------------------------------------------------------------------
ORGANIZING COMMITTEE

o Andrej Brodnik (chair)
o Borut Robic (co-chair)
o Uros Cibej
o Gasper Fele-Zorz
o Matevz Jekovec
o Jure Mihelic

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

**********************************************************
*
* 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/
*
**********************************************************

CFP - The 6th International Symposium on Intelligent Distributed Computing

****************************************************************************************
The 6th International Symposium on Intelligent Distributed Computing

IDC 2012

http://idc2012.deis.unical.it

September 24-26, 2012

Calabria, Italy
****************************************************************************************

----------
HIGHLIGHTS
----------

Invited Speakers
----------------
Belur V. Dasarathy (Ph. D, FIEEE, Editor-in-Chief of Information Fusion):
"Information Fusion as Aid for Qualitative Enhancement of Intelligence
Extraction
in Multi-Source Environments - A Panoramic View of Architectures, Algorithms
and Applications"

Andrea Omicini (Professor of Computer Science, University of Bologna):
"Nature-inspired Coordination for Complex Distributed Systems"

Tutorials
---------
Programming Workflow Systems through WADE, Giovanni Caire (Telecom Italia,
Turin)

Programming Wireless Sensor Networks through MAPS, Giancarlo Fortino
(University of Calabria, Italy)

---------
THE TOPIC
---------

Intelligent computing covers a hybrid palette of methods and techniques derived
from classical artificial intelligence, computational intelligence, multi-agent
systems a.o. Distributed computing studies systems that contain loosely-coupled
components running on different networked computers and that communicate and
coordinate their actions by message transfer. The emergent field of intelligent
distributed computing is expected to pose special challenges of adaptation and
fruitful combination of results of both areas with a great impact on
the development
of new generation intelligent distributed information systems. The aim of this
symposium is to bring together researchers involved in intelligent distributed
computing to allow cross-fertilization and synergy of ideas and to enable
advancement of researches in the field.

The symposium welcomes submissions of original papers concerning all aspects of
intelligent distributed computing ranging from concepts and
theoretical developments
to advanced technologies and innovative applications. Papers acceptance and
publication will be judged based on their relevance to the symposium
theme, clarity
of presentation, originality and accuracy of results and proposed solutions.

Topics include, but are not limited to:

Intelligent Distributed Architecture
------------------------------------
Hybrid systems involving software agents and human actors
Intelligent integration of data and processes
Intelligent cloud infrastructures
Agent-based Wireless Sensor Networks
Multi-Agent Systems
Distributed frameworks and middleware for the Internet of Things

Organisation and Management
---------------------------
Autonomic and adaptive distributed computing
Intelligent service composition and orchestration
Self-organising and adaptive distributed systems
Emerging behaviours in complex distributed systems

Intelligent Distributed Knowledge Representation and Processing
---------------------------------------------------------------
Information extraction and retrieval in distributed environments
Knowledge integration and fusion from distributed sources
Data mining and knowledge discovery in distributed environments
Semantic and knowledge grids
Ontologies and meta-data for describing heterogeneous resources and services
Distributed fusion of sensor data streams

Networked intelligence
----------------------
E-service and Web intelligence
Intelligence in mobile and ubiquitous computing
Intelligence in Peer-to-Peer systems
Intelligence in Distributed Multimedia Systems
Trust and Reputation

Intelligent Distributed Applications
------------------------------------
Distributed problem solving and decision making
Intelligent applications in e-business/e-commerce, e-learning,
e-health, e-science,
e-government, crisis management
Modelling and simulation of intelligent distributed systems
Agent-oriented methodologies for distributed application development

---------------
IMPORTANT DATES
---------------
Full paper submission: April 30, 2012 - Extended Deadline (firm)
Notification of acceptance: May 30, 2012
Final (camera ready) paper due: June 15, 2012
Symposium: September 24-26, 2012

------------
ORGANIZATION
------------

Steering Committee
------------------
Janusz Kacprzyk, Polish Academy of Sciences, Poland
Costin Badica, University of Craiova, Romania
Michele Malgeri, University of Catania, Italy
George A. Papadopoulos, University of Cyprus, Cyprus
Marcin Paprzycki, Polish Academy of Sciences, Poland
Frances Brazier, Delft University of Technology, The Netherlands
Kees Nieuwenhuis, D-CIS Lab / Thales Research & Technology, The Netherlands
Giancarlo Fortino, University of Calabria, Italy
Mohammad Essaaidi, Abdelmalek Essaadi University in Tetuan, Morocco

General Chair
-------------
Giancarlo Fortino, University of Calabria, Italy

Program Committee Chairs
------------------------
Giancarlo Fortino, University of Calabria, Italy
Michele Malgeri, University of Catania, Italy
Rainer Unland, University of Duisburg-Essen, Germany

Program Committee
-----------------
http://idc2012.deis.unical.it/committees.html

Organized by
------------
Department of Electronics, Informatics and Systems (DEIS)
Software Engineering Department, Faculty of Automation, Computers
and Electronics, University of Craiova, Romania

Organizing Committee
--------------------
Giancarlo Fortino, University of Calabria, Italy
Costin Badica, University of Craiova, Romania

Local Organizing Committee
--------------------------
Giancarlo Fortino, University of Calabria, Italy
Stefano Galzarano, University of Calabria, Italy
Antonio Guerrieri, University of Calabria, Italy
Raffaele Gravina, University of Calabria, Italy

------
PAPERS
------

Paper Submission
----------------
Submission page: https://www.easychair.org/conferences/?conf=idc20120

Paper Publication
-----------------
All accepted papers will be included in the Symposium Proceedings,
which will be
published by Springer as part of their series Studies in Computational
Intelligence.
Papers should have at most 10 pages length and must be formatted according to
Springer format for multi-authored works. Latex2e macro packages
(preferred) can
be also downloaded from here:
http://www.springer.com/authors/book+authors?SGWID=0-154102-12-417900-0

Special Issue
-------------
As in previous editions of IDC, we plan to organize special issues in
well-known
international Journals and invite selected and revised papers presented at the
conference in the organized special issues.

---------------
JOINT WORKSHOPS
---------------

Fourth International Workshop on Multi-Agent Systems Technology and
Semantics (MASTS 2012)
http://aimas.cs.pub.ro/masts2012/

First International Workshop on Agents for Cloud (A4C 2012)
http://parsec.unina2.it/a4c

ISSAC 2012 Call for Participation

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

ISSAC 2012
Call for Participation

International Symposium on Symbolic and Algebraic Computation
Grenoble, France, July 22-25, 2012
http://www.issac-conference.org/2012/

Organized in cooperation with ACM SIGSAM

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

The International Symposium on Symbolic and Algebraic Computation
(ISSAC) is the premier conference for research in symbolic computation
and computer algebra. ISSAC 2012 is the 37th meeting in the series,
started in 1966 and held annually since 1981, in North America, Europe
and Asia. The conference presents a range of invited speakers,
tutorials, poster sessions, software demonstrations and vendor
exhibits with a centerpiece of contributed research papers.

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

CALL FOR PARTICIPATION

You can now register online to ISSAC 2012; we encourage you to
register while early registration fees apply. See

http://www.issac-conference.org/2012/registration.html

For information about traveling and accommodation, please see

http://www.issac-conference.org/2012/local.html

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

SATELLITE WORKSHOPS

Two satellite workshops will be organized at the same site,
just after the conference:

* MaGiX workshop (July 26-27): language and graphical user interface
design for computer algebra systems. See

http://magix.lix.polytechnique.fr/magix/magixaissac/magixaissac.en.tm

Please register if you want to participate:

http://www.lix.polytechnique.fr/~lecerf/magixaissac-registration.php

* CaCoS workshop (July 26): Categorical Computer Science. See

http://www-ljk.imag.fr/membres/Dominique.Duval/CACOS12/cacos12.html

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

PROGRAM

* Accepted papers

http://www.issac-conference.org/2012/papers.html

* Invited talks

Frits Beukers
Hypergeometric functions: computational aspects

Marie-Francoise Roy
Complexity of deciding connectivity in semi-algebraic sets:
recent results and future research directions

Volker Strassen
Asymptotic spectrum and matrix multiplication

For more information, see

http://www.issac-conference.org/2012/invited.html

* Tutorials

Viktor Levandovskyy
Elements of Computer-Algebraic Analysis

Pascal Koiran
Upper bounds on real roots and lower bounds for the permanent

Seth Sullivant
Algebraic Statistics

For more information, see

http://www.issac-conference.org/2012/tutorials.html

Joris van der Hoeven, General Chair

student travel awards and conference information for CCC'12

The 2012 IEEE Conference on Computational Complexity (CCC'12) will take place in Porto, Portugal, June 26-29, with a welcome reception on the evening of June 25. The preliminary program, registration server, and information about local arrangements are accessible from the conference web site at computationalcomplexity.org. Early registration ends May 20.

For the first time, the conference is able to offer travel support for students from US institutions, through a grant from NSF. Applications, including a brief statement from the advisor, are due April 17. Please check out the conference web site at computationalcomplexity.org for further details.

-- CCC 2012

MASSIVE 2012 CFP

Fourth Workshop on Massive Data Algorithmics (MASSIVE 2012)

September 13, 2012

Ljubljana, Slovenia

In connection with ALGO'12 and organized by
Center for Massive Data Algorithmics (MADALGO)

Webpage: http://www.madalgo.au.dk/massive2012

Aim and Scope

Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in
a spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly
data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means
that in general focus on algorithm efficiency is increasing. However,
the large size of the data, and/or the small size of many modern
computing devices, also means that issues such as memory hierarchy
architecture often play a crucial role in algorithm efficiency. Thus
the availability of massive data also means many new challenges for
algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a
forum for researchers from both academia and industry interested in
algorithms for massive dataset problems. The scope of the workshop
includes both fundamental algorithmic problems involving massive data,
as well as algorithms for more specialized problems in, e.g.,
graphics, databases, statistics and bioinformatics. Topics of interest
include, but are not limited to:

- I/O-efficient algorithms
- Cache-oblivious algorithms
- Memory hierarchy efficient algorithms
- Streaming algorithms
- Sublinear algorithms
- Parallel algorithms for massive data problem
- Engineering massive data algorithms

Paper submission

We invite submissions of extended abstracts (at most 10 pages not
counting references) of original research. Extended abstract should be
submitted through the EasyChair website by July 14th. Authors
will be notified about acceptance by August 6th, and final versions
will be due on August 27th. Accepted extended abstracts will be collected
in a booklet, which will be distributed at the workshop. There will be
no formal proceedings, so work presented at the workshop can also be
(or have been) presented at other conferences. An author of each
accepted abstract is expected to give a presentation of the abstract
at the workshop.

Program committee

Alexandr Andoni (Microsoft Silicon Valley)
Gerth S. Brodal (Aarhus and MADALGO)
Raphaël Clifford (Bristol)
Pooya Davoodi (NYU Polytechnic)
Martin Farach-Colton (Rutgers and Tokutek)
Jeremy T. Fineman (Georgetown)
Irene Finocchi (Rome)
Michael T. Goodrich (UC Irvine)
John Iacono (NYU Polytechnic)
Christian Jensen, (Aarhus and MADALGO)
Gad M. Landau (Haifa)
Charles E. Leiserson (MIT)
Alejandro López-Ortiz (Waterloo)
Yakov Nekrich (University of Chile)
Rasmus Pach (Copenhagen)
Srinivasa Rao Satti (Seoul)
Ronitt Rubinfeld (MIT and Tel Aviv)
Christian Sohler (Dortmund)
Yufei Tao (CUHK/KAIST)
Elad Verbin (Aarhus and MADALGO)
Sung-Eui Yoon (KAIST)
Hamid Zarrabi-Zadeh (Sharif)


Chair: John Iacono (NYU Polytechnic)

Organizing committee

Gerth Stølting Brodal (Aarhus and MADALGO)
Lars Arge (Aarhus and MADALGO)
John Iacono (NYU Polytechnic)
Else Magård (Aarhus and MADALGO)
Matie Bach Søgaard (Aarhus and MADALGO)

Important dates

Paper submission deadline: July 14
Notification of acceptance: August 6
Final version due: August 27
Symposium: September 13

Participation

The workshop will take place on September 13, 2011 in Ljubljana, Slovenia,
as part of ALGO immediately following the European Symposium on Algorithms. Participants should register through the on-line registration which will soon be linked from the workshop webpage under http://www.madalgo.au.dk/massive2012 . All researchers and industry people interested in massive data algorithmics are encouraged to attend the workshop.

ESA 2012 - call for papers

--------------------------------------------------------------------
CALL FOR PAPERS

ESA 2012
20th European Symposium on Algorithms

http://algo12.fri.uni-lj.si/?file=esa

Ljubljana, Slovenia
September 10-12, 2012

--------------------------------------------------------------------
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 2012 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 2012 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2012.

--------------------------------------------------------------------
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 the conference website, using
the link of the appropriate track. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2012, 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: Sunday, April 22, 2012, 20:00 GMT (22:00 CEST, 23:00 IDT)
* Notification: Sunday, June 17, 2012
* Final version due: Tuesday, July 1, 2012
* Symposium: September 10-12, 2012 (Ljubljana, Slovenia)

--------------------------------------------------------------------
INVITED SPEAKERS

Yossi Matias, Google and Tel-Aviv University

Jiri Sgall, Charles University in Prague

--------------------------------------------------------------------
MORE INFORMATION

ESA 2012 will be co-located with IPEC (7th International Symposium
on Exact and Parameterized Computing, September 13-14), WABI (12th
Workshop on Algorithms in Bioinformatics, September 10-12), ATMOS
(12th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 13), WAOA (10th
Workshop on Approximation and Online Algorithms, September 13-14),
ALGOSENSORS (8th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 13-14), and MASSIVE (4th Workshop on Massive Data Algorithmics,
September 13).

--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK

o Leah Epstein (chair), University of Haifa, Israel
o Matthias Englert, University of Warwick, United Kingdom
o Gregory Gutin, University of London, United Kingdom
o Pinar Heggernes, University of Bergen, Norway
o Martin Hoefer, RWTH Aachen University, Germany
o Jochen Koenemann, University of Waterloo, Canada
o Petr Kolman, Charles University, Czech Republic
o Kim Skak Larsen, University of Southern Denmark, Denmark
o Asaf Levin, The Technion, Israel
o Alejandro Lopez-Ortiz, University of Waterloo, Canada
o Krzysztof Onak, Carnegie Mellon University, USA
o Dror Rawitz, Tel-Aviv University, Israel
o Guenter Rote, Freie Universitaet Berlin, Germany
o Andreas Schulz, Massachusetts Institute of Technology (MIT), USA
o Ola Svensson, EPFL Lausanne, Switzerland
o Marc Uetz, University of Twente, The Netherlands
o Carola Wenk, University of Texas at San Antonio, USA
o Peter Widmayer, ETH Zurich, Switzerland
o Christian Wulff-Nilsen, University of Southern Denmark, Denmark
o Raphael Yuster, University of Haifa, Israel

--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK

o Paolo Ferragina (chair), University of Pisa, Italy
o Susanne Albers, Humboldt University, Berlin, Germany
o Alexandr Andoni, Microsoft Research Silicon Valley, USA
o Ioannis Z. Emiris, National Kapodistrian University of Athens, Greece
o Irene Finocchi, Sapienza University of Rome, Italy
o Johannes Fischer, Karlsruhe Institute of Technology, Germany
o Michael T. Goodrich, University of California, Irvine, USA
o Herman Haverkort, Eindhoven University of Technology, The Netherlands
o Vahab Mirrokni, Google Research, USA
o Gonzalo Navarro, University of Chile, Chile
o Rina Panigrahy, Microsoft Research Silicon Valley, USA
o Rajeev Raman, University of Leicester, United Kingdom
o Jens Stoye, Bielefeld University, Germany
o Oren Weimann, University of Haifa, Israel
o Ke Yi, Hong Kong University of Science and Technology, China

--------------------------------------------------------------------
ORGANIZING COMMITTEE

o Andrej Brodnik (chair)
o Borut Robic (co-chair)
o Uros Cibej
o Gasper Fele-Zorz
o Matevz Jekovec
o Jure Mihelic

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

Final CFP: TCS 2012

Call for Papers:

The 7th IFIP Conference on Theoretical Computer Science 2012
September 26 - 28, Amsterdam, The Netherlands

===== General Info =====

The conference Theoretical Computer Science, which is held every two
years, either in conjunction or in the framework of the IFIP World
Computing Congress, is the meeting place of the TC1 community where
new results of computation theory are presented and more broadly experts
in theoretical computer science meet to share insights and ask questions
about the future directions of the field.

TCS Website: http://tcs.project.cwi.nl

TCS 2012 is associated with The Alan Turing Year 2012
(http://www.mathcomp.leeds.ac.uk/turing2012).

Previous conferences of this series were held in Sendai (2000), Montreal
(2002), Toulouse (2004), Santiago (2006), Milano (2008), Brisbane (2010).

===== Venue =====

TCS 2012 will be held at the Centrum Wiskunde & Informatica (CWI),
Amsterdam (http://www.cwi.nl), The Netherlands.

===== Invited Speakers =====

Rajeev Alur
Yuri Gurevich
Jiri Wiedermann

===== Submissions =====

The scope of this conference includes but is not limited to:

Algorithms
Complexity
Models of Computation
Logic
Semantics
Specification
Verification

All submissions will be peer-reviewed and judged on the basis of
originality, contribution to the field, technical and presentation
quality, and relevance to the conference. All papers must be written
in English.

Papers must not exceed 15 pages in the LNCS format. See
http://www.springer.de/comp/lncs/authors.html for details.

Submission will be handled through EasyChair. You may use the
following link to reach the submission page for TCS '12:

https://www.easychair.org/conferences/?conf=tcs2012

===== Proceedings =====

Accepted papers will be published in the Lecture Notes of Computer
Science series.

===== Important Dates =====

Paper submission: May 1
Notification: June 25
Camera ready version: July 16
TCS Conference: September 26-28

===== Organisation =====

General chair:

Jos Baeten (http://www.cwi.nl/people/630)

PC co-chairs:

Tom Ball (http://research.microsoft.com/en-us/people/tball/) and
Frank de Boer (http://homepages.cwi.nl/~frb/)

PC committee:

Ahmed Bouajjani
Ana Cavalcanti
Peter Grünwald
Joseph Kiniry
Peter Mueller
David Naumann
Susanne Graf
Juraj Hromkovic
Martin Kutrib
Aart Middeldorp
Jan Juerjens
Ugo Montanari
Catuscia Palamidessi
Jeff Shallit
Jan Rutten
Davide Sangiorgi
Igor Walukiewicz
Jim Woodcock

Final CfP (Ext.): ESSLLI 2012 Student Session

[apologies for multiple postings]

** PLEASE DISTRIBUTE TO STUDENTS **

Final Call for Papers
ESSLLI 2012 STUDENT SESSION

Held during
The 24th European Summer School
in Logic, Language and Information

Opole, Poland, August 6-17, 2012

EXTENDED DEADLINE: APRIL 30, 2012
http://loriweb.org/ESSLLI2012StuS/

ABOUT:

The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation.

Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience.

ESSLLI 2012 will feature a wide range of foundational and advanced courses and workshops in all areas of Logic, Language, and Computation. Consult the main ESSLLI website (link below) for further information.

SPRINGER PRIZES FOR BEST PAPER AND BEST POSTER

In 2012, Springer has again continued its generous support for the Student Session by offering € 1000 in prizes. These include a a € 500 for Best Paper and € 500 for Best Poster. The prizes are awarded best on the reviews of the submission as well as the oral presentation.

INSTRUCTIONS FOR AUTHORS:

Authors must be students, i.e., may not have received the Ph.D. degree before August 2012. All submissions must be in PDF format and be submitted to the conference EasyChair website. Submissions may be singly or jointly authored. No one may submit more than one singly and one jointly authored paper.

There are two types of papers. Long papers of up to 8 pages will be considered for both oral presentation and the poster session. Short papers of up to 4 pages will be considered as submissions for the poster session.
We strive for posters getting the longest possible exposure during ESSLLI 2012.

Submissions must be anonymous, without any identifying information ready for blind peer review, and must be must be received by April 30, 2012.

More detailed guidelines regarding submission can be found on the Student Session website: http://loriweb.org/ESSLLI2012StuS/
Links to previous years' proceedings are also available there.

IMPORTANT DATES:
Submission of papers: April 30
Notification deadline: June 10 (in time to make early registration for ESSLLI with reduced fee)
Submission of camera-ready papers: July 1
Conference dates: August 6-17

PROCEEDINGS
All accepted papers will be available in online proceedings.
A Springer volume in the LNCS series with the best papers of 2008-2009 have been published, and a similar volume for 2010-2011 is in preparation. We aspire to a forthcoming volume for 2012-2013.

FURTHER INFORMATION:
Please direct inquiries about submission procedures or other matters relating to the Student Session to esslli2012stus@loriweb.org.

For general inquiries about ESSLLI 2012, please consult the main ESSLLI 2012 page, http://esslli2012.pl/.

Kind regards,
The ESSLLI 2012 Students Session Organization Committee,

Rasmus K. Rendsvig (Roskilde University) (chair)
Anders Johannsen (University of Copenhagen)
Dominik Klein (Tilburg University)
Margot Colinet (Université de Paris 7)
Matthijs Westera (Universiteit van Amsterdam)
Maxim Haddad (University of Osnabrück)
Niels Beuck (Hamburg University)

Second Call: Logic, Algebra, and Truth Degrees 2012

Logic, Algebra and Truth Degrees 2012
http://www.jaist.ac.jp/rcis/latd12/

Second Call for Papers

=== Deadline for contributed talks: 22 April 2012 ===
=== Application for grants available ===

The third official meeting of the EUSFLAT Working Group on Mathematical
Fuzzy Logic [1] will be held on 10-14 September 2012 in Kanazawa, Japan.
The conference is organized by Research Center for Integrated Science [2],
Japan Advanced Institute of Science and Technology [3].

Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which
studies the notion of comparative truth. The assumption that 'truth comes
in degrees' has proved to be very useful in many, both theoretical and
applied, areas of Mathematics, Computer Science and Philosophy.

The main goal of this meeting is to foster collaboration between
researchers in the area of Mathematical Fuzzy Logic, and to promote
communication and cooperation with members of neighbouring fields.

The featured topics include, but are not limited to, the following:
. Proof systems for fuzzy logics: Hilbert, Gentzen, natural deduction,
tableaux, resolution, computational complexity, etc.
. Algebraic semantics: residuated lattices, MTL-algebras, BL-algebras,
MV-algebras, Abstract Algebraic Logic, functional representation, etc.
. Game-theory: Giles games, Rényi-Ulam games, evaluation games, etc.
. First-order fuzzy logics: axiomatizations, arithmetical hierarchy,
model theory, etc.
. Higher-order fuzzy logical systems: type theories, Fuzzy Class Theory,
and formal fuzzy mathematics.
. Philosophical issues: connections with vagueness and uncertainty.
. Applied fuzzy logical calculi: foundations of logical programming,
logic-based reasoning about similarity, description logics, etc.

We also welcome contributions on any relevant aspects of related logical
systems (such as substructural and quantum logics, and many-valued logics
in general).

Conference Web Site:
http://www.jaist.ac.jp/rcis/latd12/

Important dates:
. 22 April 2012: deadline for submissions
. 3 June 2012: notifications sent
. 10-14 September 2012: conference

Programme Committee:
. Stefano Aguzzoli (University of Milano, Italy)
. Matthias Baaz (Vienna University of Technology, Austria)
. Petr Cintula (Academy of Sciences, Czech Republic)
. Carles Noguera (CSIC, Spain)
. Hiroakira Ono (JAIST, Japan), Chair
. James Raftery (University of KwaZulu-Natal, South Africa)
. Constantine Tsinakis (Vanderbilt University, USA)

Invited Speakers:
. Rostislav Horčík (Academy of Sciences, Czech Republic)
. Emil Jeřábek (Academy of Sciences, Czech Republic)
. Daniele Mundici (University of Florence, Italy)
. Greg Restall (University of Melbourne, Australia)
. Luca Spada (University of Salerno, Italy)

Tutorial:
. Felix Bou (University of Barcelona, Spain)

If you are interested in presenting a paper, please submit a 2–4 pages
abstract at
http://www.easychair.org/conferences/?conf=latd2012
Your submission will be confirmed automatically on the e-mail address
you provide. The accepted abstracts will be available on-line
after the final decision of the program committee. If you have any
problems to submit an abstract, please contact us at mail to:
latd2012@jaist.ac.jp

The deadline for contributions is 22 April 2012. The notification of
acceptance/rejection will be sent until 3 June 2012.

Registration:
Registration has not started by now, but we appreciate your email
informing us on your participation plans. Registration fee is likewise
not determined by now.

Grants:
There is a limited amount of grants available for participants. Please
contact us as soon as possible including the following information:
- name, affilitation
- amount of money needed
- title of your contribution (no grant without presentation)
- reason/explanation of need for grant

Conference dates:
The scientific program will start Monday morning (10 September) and finish
Friday noon (14 September). Wednesday afternoon we plan an excursion.

Venue:
The conference will be held in the city of Kanazawa [4,5,6], located in the
Ishikawa prefecture of Japan on the Japan Sea.
The venue is the Ishikawa Prefectural Museum of Art [7] in the center
of Kanazawa.

Local Organizing Committee:
. Norbert Preining (JAIST, Japan), Chair
. Katsuhiko Sano (JAIST, Japan)
. Kazushige Terui (Kyoto University, Japan)
. Shunsuke Yatabe (AIST, Japan)

For further information please contact: latd2012@jaist.ac.jp

[1] http://www.mathfuzzlog.org/
[2] http://www.jaist.ac.jp/rcis/en/
[3] http://www.jaist.ac.jp/
[4] http://en.wikipedia.org/wiki/Kanazawa,_Ishikawa
[5] http://www.kanazawa-tourism.com/
[6] http://wikitravel.org/en/Kanazawa
[7] http://www.ishibi.pref.ishikawa.jp/index_j.html

[DMANET] Research Fellows (Supply Chain Optimisation & Automated Planning and Scheduling)

=============================
2 RESEARCH FELLOW POSITIONS
=============================

SUPPLY CHAIN OPTIMISATION & AUTOMATED PLANNING AND SCHEDULING

The University of Melbourne is seeking two outstanding Research Fellows to conduct leading edge research in supply chain optimisation and automated planning for mine scheduling.

The positions will be located in the Department of Computing and Information Systems within the Melbourne School of Engineering.

Salary $100,355-$115,715 AUD p.a. (Senior Research Fellow) or $81,925-$97,283 (Research Fellow) plus 9% superannuation; Employment type: Full-time Fixed Term

The successful candidates will conduct leading-edge research and development in the area of optimisation for mine scheduling. The work is part of an ARC funded project, "Making the Pilbara Blend: Agile Mine Scheduling through Contingent Planning". As part of the team you would be involved in discovering more agile contingent planning techniques for solving new classes of scheduling and planning problems. The overarching responsibility of this position will be the development of optimisation techniques for synthesising more robust plans for short term production scheduling of iron ore in distributed, multi-mine pit settings.

The role of the Supply Chain Optimisation Fellow will involve computational approaches to optimising supply chain management, such as constraint solving techniques, combinatorial optimisation and/or network flow techniques, especially those for distributed multi-agent problems.

The role of the Automated Planning and Scheduling Fellow will involve planning languages such as those based on the situation calculus, classical planning techniques and/or model-checking techniques, especially those for distributed multi-agent problems.

This project tackles a challenging problem faced in mine scheduling. An increased need for consistent quality has occurred at the same time as the complexity of modern day mining operations has increased, across multiple mine sites with variable ore grades and increasing infrastructure constraints. There is a pressing need for more agile mining techniques that maximise net present value (NPV) while accommodating the complexities and uncertainties inherent in modern day mining operations.

The goal of this project is to bring together automated planning techniques with constraint programming to address this paradigm shift. The research tackles plan synthesis for the multi-commodity, multi-mine site supply chain problem and promises to lead to improved techniques for collaborative planning and solving hard constraint problems. The theoretical significance of this project derives from the fundamental challenge posed by the problem underlying dynamic scheduling. On the one hand, optimisation must take into account nondeterminism - the uncertain outcomes of actions inherent in the problem - and on the other must lead to feasible plans for each mine site - while continuing to solve the necessary constraints for the overall supply chain schedule during the course of continuing (non-terminating) execution.

The project will develop agile scheduling techniques of great economic importance. Carefully planned scheduling has the potential to reduce the need for new infrastructure, minimising environmental impacts and maximising regeneration after mining. More details can be found at http://www.agentlab.unimelb.edu.au/mining.html

RESEARCH GROUP

Optimisation group of NICTA: http://www.nicta.com.au/research/optimisation

Intelligent Agent Laboratory (Agentlab): http://www.agentlab.unimelb.edu.au/

G12 Constraint Programming Platform: http://www.nicta.com.au/research/projects/constraint_programming_platform

APPLICATION PROCEDURE

http://www.jobs.unimelb.edu.au

Research Fellow in Supply Chain Optimisation: position number 0028933 (closing 3 June 2012)

Research Fellow in Automated Planning and Scheduling: position number 0028932 (closing 3 June 2012)

Contact: For more information, please contact Adrian Pearce, adrianrp@unimelb.edu.au

Adrian
---
Adrian Pearce
Department of Computing and Information Systems,
The University of Melbourne, Melbourne VIC 3010
Phone: +61 3 8344 1399 adrianrp@unimelb.edu.au
http://www.csse.unimelb.edu.au/~adrian/

**********************************************************
*
* 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] Cycles in Graphs, Vanderbilt, May/June 2012

International Conference on Cycles in Graphs
in conjunction with the 27th Annual Shanks Lectures

Vanderbilt University, Nashville, TN, USA
Wednesday May 30, 2012 - Saturday, June 2, 2012

<http://www.math.vanderbilt.edu/~shanks2012/>

CALL FOR PARTICIPATION AND ADDITIONAL PRESENTATIONS

The conference will focus on recent developments on cycles in graphs
and related structures (such as directed graphs, hypergraphs and
matroids). Plenary speakers are

Daniela Kühn, University of Birmingham, UK (Shanks Lecturer)
Alan Frieze, Carnegie Mellon University
Penny Haxell, University of Waterloo, Canada
Deryk Osthus, University of Birmingham, UK
Kenta Ozeki, National Institute of Informatics, Japan
Paul Seymour, Princeton University
Xingxing Yu, Georgia Institute of Technology

We have also arranged a program of 20-minute talks in two parallel
sessions. A limited number of times are still available. If you are
interested in speaking, please email the organizers at shanks2012 at
vanderbilt.edu before April 20 and describe your proposed topic.
Everyone is welcome to attend the conference, and we encourage you to
register by April 20 to get early registration rates. A limited amount of
financial support is available for participants, and requests received by
April 20 will receive priority consideration.
Please see the website for more details. We hope to see you in
Nashville!

**********************************************************
*
* 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/
*
**********************************************************