Wednesday, April 30, 2014

Full professor opening at Warwick

Dear colleagues,

I would like to draw your attention to a full professor opening at the
Department of Computer Science of the University of Warwick. The call
is open for candidates from all areas of computer science including
theoretical computer science, which also falls in the research areas
covered by the university interdisciplinary Centre for Discrete
Mathematics and its Applications (DIMAP). Further details on the
opening can be found via the following link:

http://www2.warwick.ac.uk/fac/sci/dcs/news/?newsItem=094d434545460b4f0145711f55fa5d18

Best regards,

Dan Kral

[DMANET] Full professor opening at Warwick

Dear colleagues,

I would like to draw your attention to a full professor opening at the
Department of Computer Science of the University of Warwick. The call
is open for candidates from all areas of computer science including
those related to theoretical computer science and discrete
mathematics, which fall in the research areas of the university
interdisciplinary Centre for Discrete Mathematics and its Applications
(DIMAP). Further details can be found via the following link:

http://www2.warwick.ac.uk/fac/sci/dcs/news/?newsItem=094d434545460b4f0145711f55fa5d18

Best regards,

Dan Kral
**********************************************************
*
* 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] Engineering, Doctoral and Post-Doctoral positions in Bordeaux

RealOpt is a joint team between INRIA and the University of Bordeaux, doing research in mathematical optimization with a focus on decomposition and extended formulation approaches. Current academic and industrial projects concern large scale planning problems, accounting for stochastic events, and online re-optimization. Partners include both large groups (EDF, Saint-Gobain, Thales) and local firms (Exeo, Ertus). To contribute to these projects, the team is recruiting on Engineering, Doctoral and Post-Doctoral positions.

Please forward this announcement to any potential candidates (French or English speaking), with a strong background in mathematical programming methods and numerical validation, inviting them to contact us for further details.

Francois Vanderbeck
fv@math.u-bordeaux1.fr
Institut of Mathematics (IMB), University of Bordeaux
Team ReAlOpt, INRIA-Bordeaux-Sud-Ouest
https://realopt.bordeaux.inria.fr


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

[DMANET] Post doctoral researcher in network analysis and modelling, University of Reading, UK

As a part of EPSRC funded Horizon Hub, we have a 9 months fixed term
position for a post-doctoral researcher in social network analysis and
modelling. The position is based in the Centre for the mathematics of
human behaviour (CMoHB, https://www.reading.ac.uk/cmohb/ ), Department
of Mathematics and Statistics, University of Reading and will be
focused on analysis and modelling of dynamics and mood on social
networks, based on two small human studies and a large online social
network dataset.
Deadline for applications: May 22, 2014.

Contact information
-----------------------
For further inquiries please contact:
Dr. Danica Greetham (d.v.greetham@reading.ac.uk)


For more information about this vacancy please check
http://www.jobs.ac.uk/job/AIQ564/post-doctoral-research-assistant-in-social-network-analysis-and-modelling/
**********************************************************
*
* 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] 1st Greifswald Phylogenetics Meeting

Attention! Only few slots still available! Due to various requests, even though the deadline for registration and abstract submission has already passed, we will fill additional slots on a first-come, first-serve basis. So if you are interested to attend our meeting or if you know someone who might be, please spread the word!!!


I herewith want to announce the 1st Greifswald Phylogenetics Meeting,
which will be held in Greifswald (north eastern Germany) from the 14th
till the 16th of July 2014.

Registration is now open and the deadline (both for registration as well as for abstract submission) has been postponed due to various requests. There are still a few free slots, so please register asap!

Our conference poster can be found here: http://stubber.math-inf.uni-greifswald.de/~spillner/gpm-2014/poster-gpm-2014.pdf Feel free to print it and forward it to anybody who might be interested! For more details, please visit the conference website:
http://stubber.math-inf.uni-greifswald.de/~spillner/gpm-2014/gpm-2014.html


This meeting will have a particular focus on mathematical (e.g. graph
theoretical, combinatorial, probabilistic and algebraic) aspects of
evolutionary tree or network reconstruction, but it will also bring
together scientists from different disciplines in order to provide the
opportunity of close collaboration.

Scope:

Phylogenetics is an interdisciplinary research area that aims at
reconstructing the evolutionary history of biological systems such
as, for example, collections of species, populations or groups of
bio-molecules. To achieve this, biologists work closely together with
mathematicians and computer scientists. The conference will provide
researchers from all three involved disciplines an opportunity to present
their recent work and exchange ideas.

Location: Greifswald is a beautiful little town located directly at
the Baltic Sea in close proximity to the famous islands Rügen and
Usedom. Greifswald university was founded in 1496 and has therefore a
long tradition and history. Being a former Hanse town, Greifswald is
famous for its historic market square, its cathedral and the museum
harbor. Other famous towns like Stralsund with the Oceaneum or the
world cultural heritage city of Wismar are nearby, as well as the
city of Rostock with its newly established Darwineum. The region is a
holiday region but not too crowded by tourists. In July the weather is
most likely to be great and we hope that if you can come to our meeting,
you will find the time to stay longer and enjoy this unique area. There
is a direct and regular train connection to and from Berlin, and the
nearest international airports are Hamburg and Berlin.

Please note that the meeting starts early on the 14th with one of our
highlight talks and ends in the evening of the 16th with another highlight
talk - so if possible, please plan your stay from the 13th till the 17th
of July.

The registration fee is 150 Euros (100 Euros for students).

Organizers: Mareike Fischer, Andreas Spillner, Martin Haase

Invited speakers: Olaf Bininda-Emonds, Mike Steel, Vince Moulton, Allen Rodrigo

For more details, visit our website
http://stubber.math-inf.uni-greifswald.de/~spillner/gpm-2014/gpm-2014.html
or contact Mareike Fischer: email@mareikefischer.de


Mareike Fischer <email@mareikefischer.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] Don't miss the ACM PODC Workshop on Software-Defined Networking

CALL FOR CONTRIBUTIONS:

PODC Workshop on Distributed Software-Defined Networks (DSDN)

http://www.podc.org/podc2014/dsdn14/

July 15, 2014
Paris, France

NEWS

-          Confirmed Invited Speakers: Nate Foster (Cornell University,
USA), Marco Canini (UC Louvain, Belgium), Yehuda Afek (TAU, Israel)


OVERVIEW

The Workshop on Distributed Software-Defined Networks (DSDN) is a forum to
discuss new algorithmic and distributed computing challenges offered by the
emerging field of
Software Defined Networking (SDN). SDN abstracts the cumbersome task of
computer network management to a distinct control plane with a standard
programming interface.
Distributed implementations of the control plane give rise to new and
interesting concurrency scenarios to be addressed by the distributed
computing community.

DETAILS

The workshop is going to take place on 15 July in Paris, France, co-located
with PODC 2014.

The program will combine peer-reviewed presentations (around 30min) with
invited talks (between 30 and 60 min), both from researchers in the field of
distributed
computing as well as from researchers in the field of networking. As such,
the goal of the DSDN workshop is to provide a forum where the distributed
computing and
networking communities can meet and learn from their respective fields.

SUBMISSIONS

Submissions (in PDF) are done by email to
petr.kuznetsov@telecom-paristech.fr and stefan.schmid@tu-berlin.de, and
should briefly (in 1-2 pages)  describe the content of
the presentation. The abstracts will appear on the DSDN website, but will
not be included in the PODC proceedings.

The presentations can report on and summarize previous work, present early
new results or put forward new and outrageous ideas.

SCHEDULE

• Submission deadline: May 30, 2014
• Notification: June 10, 2014



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

[DMANET] PhD position (E13 TV-G-U) at Goethe University Frankfurt

Applications are invited for a PHD position in discrete mathemathics (3 years). Starting date is 01.10.2014 at the Institute of Mathematics of Goethe University Frankfurt, Germany.

The applicant (m/w) will be based in the group of Amin Coja-Oghlan / Yury Person. The research will be conducted in some of the following areas:

• extremal and probabilistic combinatorics
• Ramsey theory
• random graphs

The position comes with a teaching load of 4 hours/week. Applicants are required to have very good German language skills. The applicant will help advising bachelor/master theses and might be involved in some administrative tasks (such as workshop organization, writing scientific reports/proposals).

Applicants should have an excellent degree in mathematics, computer science or in a related discipline (diploma or master's degree), with advanced knowledge of discrete mathematics and/or probabiltity theory. Applications should include a detailed CV, a list of courses and grades and a copy of master thesis.

Prospective candidates should send their applications by 27.05.2014 to Prof. Dr. Amin Coja-Oghlan, acoghlan@math.uni-frankfurt.de.

For futher details and the official announcement see https://www2.uni-frankfurt.de/48794916/fb12
**********************************************************
*
* 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, April 29, 2014

[DMANET] CFP: ALGOSENSORS 2014 - 10th Int. Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics

--Apologies for cross-postings--

CALL FOR PAPERS

ALGOSENSORS 2014

10th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics

September 11-12, 2014, Wrocław, Poland; to be held in conjunction with

ALGO/ESA 2014

https://sites.google.com/site/algosensors2014/

SCOPE AND TOPICS: The ALGOSENSORS symposium aims to bring together
research contributions related to diverse algorithmic aspects of sensor
networks, wireless networks as well as distributed robotics, both from a
theoretical and an experimental perspective. Starting from 2013 we have
a new track on wireless networks and distributed robotics.

This year ALGOSENSORS has three tracks:
- Sensor Network Algorithms
- Wireless Networks and Distributed Robotics
- Experiments
Each paper will be initially submitted to a single track. But all papers
will be handled by the the same program committee. The program committee
will make sure that papers are reviewed by the PC members in the
expertise area.

Topics include, but are not limited to:

Computational Models
Complexity and Computability
Approximation/Randomized Algorithms
Communication Protocols
Deployment, Topology Control
Infrastructure Discovery
Routing, Data Propagation
Data Aggregation, Data Fusion
Localization
Tracking
Energy Management
Power Saving Schemes
Resource Efficiency
Game Theoretic Aspects
Fault Tolerance, Dependability
Self-stabilization, Self-* Properties
Error/Erasure Correcting Codes
Cryptography, Security and Trust
Mobile Sensor Networks
Autonomous Mobile Robots
Sensor-Actuator Networks
Dynamic Networks
Swarm Computing
Pattern Formation
Obstacle Avoidance
Algorithms for RFID
Performance Evaluation
Systems and Testbeds
Experimental Analysis
Medium Access Control
Time Synchronization
Virtual Infrastructures
Cyber Physical Systems

PROGRAM COMMITTEE

Jie Gao, Stony Brook University, USA (General chair)
Alon Efrat, University of Arizona, USA (Track co-chair, Sensor Networks
Algorithms)
Sandor Fekete, University of Technology, Braunschweig, Germany (Track
co-chair, Wireless Networks and Distributed Robotics)
Yanyong Zhang, Rutgers University, USA (Track co-chair, Experiments)

Algorithms Track

Chris Gniady, University of Arizona, USA
Guy Grebla, Columbia University, USA
Loukas Lazos, University of Arizona, USA
Miao Jin, University of Louisiana, USA
Thienne Johnson, University of Arizona, USA
Valentin Polishchuk, Linköping University, Sweden
Andrea Richa, Arizona State University, USA
Rik Sarkar, University of Edinburgh, UK
Michael Segal, Ben-Gurion University of the Negev, Israel
Guoliang Xue, Arizona State University, USA

Robotics Track

Aaron Becker, Harvard University, USA
Thomas Erlebach, University of Leicester, UK
Michael Hemmer, TU Braunschweig, Germany
Alejandro López-Ortiz, University of Waterloo, Canada
James McLurkin, Rice University, USA
Friedhelm Meyer auf der Heide, University of Paderborn, Germany
Joe Mitchell, Stony Brook University, USA
Nicola Santoro, Carleton University, Canada
Christiane Schmidt, TU Braunschweig, Germany
Jukka Suomela, Aalto University, Finland

Systems Track

James Gross, KTH, Sweden
Yuan He, Tsinghua University, P.R.China
Tommaso Melodia, University of Buffalo, USA
Hui Pan, Hong Kong University of Science and Technology, Hong Kong
Dario Pompili, Rutgers University, USA
Aaron Striegel, University of Notre Dame, USA
Niki Trigoni, Univ. of Oxford, UK
Guiling Wang, New Jersey Institute of Technology, USA
Kai Xing, University of Science and Technology of China, P.R. China
Rong Zheng, McMaster University, Canada
Marco Zuniga, TU Delft, Netherlands

STEERING COMMITTEE

Josep Diaz, U.P. Catalunya
Magnus M. Halldorsson, Reykjavik U., Iceland
Bhaskar Krishnamachari, U. of Southern California, USA
P.R. Kumar, Texas A&M U., USA
Sotiris Nikoletseas, U. of Patras and CTI, Greece (Chair)
Jose Rolim, U. of Geneva
Paul Spirakis, U. of Patras and CTI, Greece
Adam Wolisz, T.U. Berlin, Germany


IMPORTANT DATES:

Paper submission: June 14, 2014

Notification: July 14, 2014

Camera-ready for pre-proceedings: August 10, 2014

Symposium: September 11-12, 2014


PROCEEDINGS:
Accepted papers will be published in full text in hardcopy
post-proceedings, in the Lecture Notes in Computer Science (LNCS) Series
of Springer Verlag.


TCS JOURNAL SPECIAL ISSUE: As in previous years, selected high-quality
papers will be considered for publication in a Special Issue of the
Theoretical Computer Science (TCS) Journal.


HOW TO SUBMIT: Full papers are to be submitted electronically using the
EasyChair server.
Original research papers must contain results that have not previously
appeared and have not been concurrently submitted to a journal or
conference with published proceedings. Each paper should select a track
to submit to. Since there can be a lot of overlap of the three tracks,
the selection of a track is a suggestion and all papers will be handled
by the single PC to ensure that each paper is handled by PC members of
the expertise area. Authors need to ensure that for each accepted paper
at least one author will register and attend the symposium. Submissions
are limited to twelve (12) single-column pages on letter/A4-size paper
(using at least 11 point font, 1 inch margins, standard line spacing,
preferably formatted in the LNCS style). This includes figures, but
excludes references and an optional appendix (to be read at the program
committee's discretion).

--
Constantinos Marios Angelopoulos, Ph.D.

University of Geneva
Centre Universitaire d'Informatique
Battelle Bat. A, 7 rte de Drize
CH-1227 Carouge - Switzerland

Phone: (+41)0223790121
Skype: aggeloko
WEB: http://tcs.unige.ch/doku.php/user/angelopo
**********************************************************
*
* 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/
*
**********************************************************

ATMOS 2014 - Call for papers

FIRST CALL FOR PAPERS

14th WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELLING, OPTIMIZATION, AND SYSTEMS (ATMOS 2014)

(Part of ALGO 2014, a collection of conferences and workshops, major
European meeting of researchers in algorithms and related fields)

September 11, 2014, Wroclaw, Poland

http://algo2014.ii.uni.wroc.pl/atmos/

----------------------------------------------------------------------
SCOPE
-----

ATMOS is an annual workshop bringing together researchers and
practitioners who are interested in all aspects of algorithmic methods
and models for transportation optimization.

The workshop provides a forum for the exchange and dissemination of
new ideas and techniques from mathematical optimization, theoretical
computer science, and operations research. Applicable tools and
concepts include those from graph and network algorithms,
combinatorial optimization, approximation and online algorithms,
stochastic and robust optimization.

The scope of the workshop comprises all modes of transportation.

----------------------------------------------------------------------
INVITED SPEAKER
---------------

* Renato Werneck, Microsoft Research Silicon Valley, USA

----------------------------------------------------------------------
IMPORTANT DATES
---------------

Submission deadline: June 22, 2014
Notification to authors: July 22, 2014
Camera ready submission: August 3, 2014
Workshop date: September 11, 2014

----------------------------------------------------------------------
TOPICS
------

We invite authors to present work that advances optimization methods
and algorithms to facilitate planning and operational management of
freight and passenger transportation and traffic. The workshop
welcomes but is not limited to papers addressing the following
challenges:

* Demand Forecasting
* Models for User Behavior
* Design of Pricing Systems
* Infrastructure Planning
* Multi-modal Transport Optimization
* Mobile Applications for Transport
* Congestion Modeling and Reduction
* Line Planning
* Timetable Generation
* Routing and Platform Assignment
* Vehicle Scheduling
* Route Planning
* Crew and Duty Scheduling
* Rostering
* Delay Management
* Routing in Road Networks
* Traffic Guidance

The workshop welcomes but is not limited to papers applying and
advancing the following techniques: Graph and Network Algorithms,
Combinatorial Optimization, Mathematical Programming, Approximation
Algorithms, Methods for the Integration of Planning Stages, Stochastic
and Robust Optimization, Online and Real-time Algorithms, Algorithmic
Game Theory, Heuristics for Real-world Instances, Simulation Tools.

----------------------------------------------------------------------
SUBMISSIONS
-----------

Authors are invited to submit an extended abstract or full paper of at
most 12 pages. Submissions must be formatted in LaTeX, using the OASIcs
style (http://drops.dagstuhl.de/styles/oasics/oasics-authors.tgz). The
paper should contain a succinct statement of the issues and of their
motivation, a summary of the main results, and a brief explanation of
their significance, accessible to non-specialist readers. Proofs
omitted due to space constraints can be put into an appendix to be
read by the program committee members at their discretion. Papers must
be submitted electronically at
https://www.easychair.org/conferences/?conf=atmos2014
The submission must be received by June 22, 2014. Each accepted paper
must be presented at the workshop by one of the authors.

----------------------------------------------------------------------
PROCEEDINGS
-----------

The proceedings will be published online and as open-access in the
Dagstuhl Open Access Series in Informatics (OASIcs).

----------------------------------------------------------------------
PROGRAM COMMITTEE
-----------------

Alberto Ceselli, University of Milano, Italy
Stefan Funke (co-chair), University of Stuttgart, Germany
Marco Lübbecke, RWTH Aachen, Germany
Juan Antonio Mesa, University of Sevilla, Spain
Matúš Mihalák (co-chair), ETH Zurich, Switzerland
Matthias Müller-Hannemann, University of Halle, Germany
Christian Reitwiessner, TomTom NV, Germany
Marie Schmidt, University Göttingen, Germany
Gabriele Di Stefano, University of L'Aquila, Italy
Sabine Storandt, University of Freiburg, Germany
Renato Werneck, Microsoft Research, USA
Peter Widmayer, ETH Zurich, Switzerland

----------------------------------------------------------------------
STEERING COMMITTEE
------------------

* Alberto Marchetti-Spaccamela, Sapienza University of Rome, Italy
* Rolf Möhring, TU Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology (KIT), Germany
* Christos Zaroliagis, University of Patras, Greece

[DMANET] ATMOS 2014 - Call for papers

FIRST CALL FOR PAPERS

14th WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION MODELLING,
OPTIMIZATION, AND SYSTEMS (ATMOS 2014)

(Part of ALGO 2014, a collection of conferences and workshops, a major
European meeting of researchers in algorithms and related fields)

September 11, 2014, Wroclaw, Poland

http://algo2014.ii.uni.wroc.pl/atmos/

----------------------------------------------------------------------
SCOPE
-----

ATMOS is an annual workshop bringing together researchers and
practitioners who are interested in all aspects of algorithmic methods
and models for transportation optimization.

The workshop provides a forum for the exchange and dissemination of
new ideas and techniques from mathematical optimization, theoretical
computer science, and operations research. Applicable tools and
concepts include those from graph and network algorithms,
combinatorial optimization, approximation and online algorithms,
stochastic and robust optimization.

The scope of the workshop comprises all modes of transportation.

----------------------------------------------------------------------
INVITED SPEAKER
---------------

* Renato Werneck, Microsoft Research Silicon Valley, USA

----------------------------------------------------------------------
IMPORTANT DATES
---------------

Submission deadline: June 22, 2014
Notification to authors: July 22, 2014
Camera ready submission: August 3, 2014
Workshop date: September 11, 2014

----------------------------------------------------------------------
TOPICS
------

We invite authors to present work that advances optimization methods
and algorithms to facilitate planning and operational management of
freight and passenger transportation and traffic. The workshop
welcomes but is not limited to papers addressing the following
challenges:

* Demand Forecasting
* Models for User Behavior
* Design of Pricing Systems
* Infrastructure Planning
* Multi-modal Transport Optimization
* Mobile Applications for Transport
* Congestion Modeling and Reduction
* Line Planning
* Timetable Generation
* Routing and Platform Assignment
* Vehicle Scheduling
* Route Planning
* Crew and Duty Scheduling
* Rostering
* Delay Management
* Routing in Road Networks
* Traffic Guidance

The workshop welcomes but is not limited to papers applying and
advancing the following techniques: Graph and Network Algorithms,
Combinatorial Optimization, Mathematical Programming, Approximation
Algorithms, Methods for the Integration of Planning Stages, Stochastic
and Robust Optimization, Online and Real-time Algorithms, Algorithmic
Game Theory, Heuristics for Real-world Instances, Simulation Tools.

----------------------------------------------------------------------
SUBMISSIONS
-----------

Authors are invited to submit an extended abstract or full paper of at
most 12 pages. Submissions must be formatted in LaTeX, using the OASIcs
style (http://drops.dagstuhl.de/styles/oasics/oasics-authors.tgz). The
paper should contain a succinct statement of the issues and of their
motivation, a summary of the main results, and a brief explanation of
their significance, accessible to non-specialist readers. Proofs
omitted due to space constraints can be put into an appendix to be
read by the program committee members at their discretion. Papers must
be submitted electronically at
https://www.easychair.org/conferences/?conf=atmos2014
The submission must be received by June 22, 2014. Each accepted paper
must be presented at the workshop by one of the authors.

----------------------------------------------------------------------
PROCEEDINGS
-----------

The proceedings will be published online and as open-access in the
Dagstuhl Open Access Series in Informatics (OASIcs).

----------------------------------------------------------------------
PROGRAM COMMITTEE
-----------------

Alberto Ceselli, University of Milano, Italy
Stefan Funke (co-chair), University of Stuttgart, Germany
Marco Lübbecke, RWTH Aachen, Germany
Juan Antonio Mesa, University of Sevilla, Spain
Matúš Mihalák (co-chair), ETH Zurich, Switzerland
Matthias Müller-Hannemann, University of Halle, Germany
Christian Reitwiessner, TomTom NV, Germany
Marie Schmidt, University Göttingen, Germany
Gabriele Di Stefano, University of L'Aquila, Italy
Sabine Storandt, University of Freiburg, Germany
Renato Werneck, Microsoft Research, USA
Peter Widmayer, ETH Zurich, Switzerland

----------------------------------------------------------------------
STEERING COMMITTEE
------------------

* Alberto Marchetti-Spaccamela, Sapienza University of Rome, Italy
* Rolf Möhring, TU Berlin, Germany
* Dorothea Wagner, Karlsruhe Institute of Technology (KIT), Germany
* Christos Zaroliagis, University of Patras, Greece
**********************************************************
*
* 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: PPSN workshop on Semantic Methods in Genetic Programming: Deadline May 31st

------------------------------------------------------------------
Semantic Methods in Genetic Programming
A workshop at 13th International Conference on
Parallel Problem Solving from Nature
September 13-17, 2014, Ljubljana, Slovenia, Jožef Stefan Institute
http://www.cs.put.poznan.pl/kkrawiec/smgp2014/
------------------------------------------------------------------

Call for Papers

There's *just over one month left* (31 May 2014) to get your extended
abstracts (max 2 pages) ready for the Semantic Methods in Genetic
Programming Workshop to be held at PPSN in September.

In the last few years a rising topic in GP has been the use of semantic
methods. The aim of this is to provide a way of exploring the
input-output behaviour of programs, which is ultimately what matters for
problem solving. This contrasts with much previous work in GP, where
operators transform the program code and the effect on program behaviour
is indirect. This new approach has produced substantially better results
on a number of problems, both benchmark problems and real-world
applications in areas such as pharmacy; and, has been grounded in a body
of theory, which also informs algorithm design.

The main goal of the workshop is to foster discussions rather than
present finished work. In tradition with the PPSN workshops, the
extended abstracts are not published in the conference proceedings.
However, the organisers will make both abstracts and slides available
online on the workshop webpage. The workshop is associated with a
Special Issue of Genetic Programming and Evolvable Machines Journal by
Springer, and provides an opportunity to have an open discussion and
receive feedback in preparation for submission to that special issue.

Scope: All aspects of research related to semantic aspects in GP will be
considered, including:
- analysis and design of GP algorithms involving phenotypes/behaviours
of programs,
- design of problem-specific semantic-aware representations and operators,
- the use of formal semantic-related methods in GP.

This is an ideal opportunity to get some feedback on work in progress,
which you might be considering to submit to the Special Issue of Genetic
Programming & Evolvable Machines on Semantic Methods in GP. Please note
the submission deadline of 19 December 2014 for journal articles.

More details at:
http://www.cs.put.poznan.pl/kkrawiec/smgp2014/
http://ppsn2014.ijs.si/?show=workshops
http://ncra.ucd.ie/GENP_SemanticMethodsinGP.pdf


**********************************************************
*
* 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: 9th International Conference on Risks and Security of Internet and Systems (CRiSIS 2014), DEADLINE: June 2nd, 2014, LNCS series

[Apologies if you receive multiple copies of this message]

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

Call for Papers

9th International Conference on Risks and Security of Internet
and Systems (CRiSIS 2014)

Trento, Italy, August 27-29, 2014

http://titan.disi.unitn.it/crisis2014/

******* SUBMISSION DEADLINE: June 2nd, 2014 *******

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

The topics addressed by CRiSIS range from the analysis of risks,
attacks to networks and system survivability, passing through
security models, security mechanisms and privacy enhancing
technologies. Prospective authors are invited to submit research
results as well as practical experiment or deployment reports.
Industrial papers about applications and case studies, such as
telemedicine, banking, e-government and critical infrastructure,
are also welcome. The list of topics includes but is not limited
to:

- Analysis and management of risk
- Attacks and defences
- Attack data acquisition and network monitoring
- Cryptography, Biometrics, Watermarking
- Dependability and fault tolerance of Internet applications
- Distributed systems security
- Embedded system security
- Empirical methods for security and risk evaluation
- Hardware-based security and Physical security
- Intrusion detection and Prevention systems
- Organizational, ethical and legal issues
- Privacy protection and anonymization
- Risk-aware access and usage control
- Security and risk assessment
- Security and risks metrics
- Security and dependability of operating systems
- Security and safety of critical infrastructures
- Security and privacy of peer-to-peer system
- Security and privacy of wireless networks
- Security models and security policies
- Security of new generation networks, security of VoIP and multimedia
- Security of e-commerce, electronic voting and database systems
- Security of social networks
- Smartphone security and privacy
- Traceability, metrology and forensics
- Trust management
- Use of smartcards and personal devices for Internet applications
- Web and cloud security


---------------------------
Paper Submission
---------------------------

Submitted papers must not substantially overlap with papers that
have been published or that are simultaneously submitted to a
journal or a conference with proceedings. Papers must be written
in English and must be submitted electronically in PDF format.
Maximum paper length will be 16 printed pages for full papers or
6 pages for short papers, in LNCS style.

Authors of accepted papers must guarantee that their papers will be
presented at the conference. All papers selected for presentation at the
conference will be included in the proceedings published by Springer.

All paper submissions will be handled through the Easy Chair conference
management system. Follow the instructions given here:
https://www.easychair.org/conferences/?conf=crisis2014


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

- Submission deadline: June 2nd '14
- Notification to Authors: July 1st '14
- Camera Ready: July 21st '14
- Conference: August 27-29th '14


---------------------------
Committee
---------------------------

General Chair
---------------------------
Bruno Crispo, University of Trento, Italy

PC Chairs
---------------------------
Javier Lopez, University of Malaga, Spain
Indrajit Ray, Colorado State University, USA

Publicity Chairs
---------------------------
Joaquin Garcia-Alfaro, TELECOM SudParis, France
Muhammad Rizwan Asghar, CREATE-NET, Italy

TPC Members
---------------------------
Marco Carvalho, Florida Institute of Technology, USA
Yu Chen, Binghamton University, SUNY, USA
Jason Crampton, Royal Holloway, University of London
Jorge Cuellar, SIEMENS AG, Germany
Rinku Dewri, University of Denver, USA
Frederic Cuppens, TELECOM Bretagne, France
Nora Cuppens-Boulahia, TELECOM Bretagne, France
Sabrina De Capitani Di Vimercati, Universita degli Studi di Milano
Juan Estevez-Tapiador, University Carlos III of Madrid, Spain
Roberto Di Pietro, Universita di Roma Tre, Italy
Rose Gamble, University of Tulsa, USA
Dimitris Gritzalis, AUEB, Greece
Stefanos Gritzalis, University of the Aegean, Greece
Mina Guirguis, Texas State University, USA
Igor Kotenko, SPIIRAS, Russia
Sokratis Katsikas, University of Piraeus, Greece
Jorge Lopez, INDRA, Spain
Fabio Martinelli, CNR, Italy
Refik Molva, EURECOM, France
Martin Olivier, University of Pretoria, South Africa
Xinming Ou, Kansas State University, USA
Brajendra Panda, University of Arkansas, USA
Guenther Pernul, Regensburg University, Germany
Joachim Posegga, University of Passau, Germany
Kai Rannenberg, Goethe University Frankfurt, Germany
Craig Rieger, Idaho National Laboratory, USA
Michael Rusinowitch, INRIA, France
Pierangela Samarati, Universita€ degli Studi di Milano, Italy
Sejun Song, University of Missouri-Kansas City, USA
Miguel Soriano, UPC, Spain
Alex Sprintson, Texas A&M University, USA
Ketil Stoelen, SINTEF, Norway
Jianying Zhou, I2R, Singapore
Jose M. Fernandez, École Polytechnique de Montréal, 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] Final Call: PSD 2014 (PRIVACY IN STATISTICAL DATABASES), DEADLINE APPROACHING (May 11), LNCS proceedings, Eivissa, Balearic Islands, September 2014

[Apologies if you receive multiple copies of this message]


PRIVACY IN STATISTICAL DATABASES 2014 (PSD 2014)
================================================

***FINAL CALL FOR PAPERS: HARD SUBMISSION DEADLINE MAY 11, 2014***

Eivissa, Balearic Islands, Sep. 17-19, 2014

http://unescoprivacychair.urv.cat/psd2014

1. AIMS AND GOALS
-----------------

Privacy in statistical databases is about finding tradeoffs to the
tension between the increasing societal and economical demand for
accurate information and the legal and ethical obligation to protect
the privacy of individuals and enterprises which are the respondents
providing the statistical data. In the case of statistical databases,
the motivation for respondent privacy is one of survival: statistical
agencies or survey institutes cannot expect to collect accurate
information from individual or corporate respondents unless these feel
the privacy of their responses is guaranteed.

Beyond respondent privacy, there are two additional privacy dimensions
to be considered: privacy for the data owners (organizations owning or
gathering the data, who would not like to share the data they have
collected at great expense) and privacy for the users (those who
submit queries to the database and would like their analyses to stay
private).

"Privacy in Statistical Databases 2014" (PSD 2014) is a conference
sponsored and organized by the UNESCO Chair in Data Privacy
(http://unescoprivacychair.urv.cat) with proceedings published by
Springer-Verlag in Lecture Notes in Computer Science. It purpose is to
attract world-wide, high-level research in statistical database
privacy.

PSD 2014 is a successor to PSD 2012 (Palermo, Sep. 26-28, 2012,
http://unescoprivacychair.urv.cat/psd2012), PSD 2010 (Corfu, Sep.
22-24, 2010, http://unescoprivacychair.urv.cat/psd2010), PSD 2008
(Istanbul, Sep. 24-26, 2008,
http://unescoprivacychair.urv.cat/psd2008), PSD 2006 (Rome, Dec.
13-15, 2006, http://crises-deim.urv.cat/psd2006) and PSD 2004
(Barcelona, June 9-11, 2004, http://crises-deim.urv.cat/psd2004), all
with proceedings published by Springer in LNCS 7556, LNCS 6344, LNCS
5262, LNCS 4302 and LNCS 3050, respectively. Those six PSD conferences
follow a tradition of high-quality technical conferences on SDC which
started with "Statistical Data Protection-SDP'98", held in Lisbon in
1998 and with proceedings published by OPOCE, and continued with the
AMRADS project SDC Workshop, held in Luxemburg in 2001 and with
proceedings published in Springer LNCS 2316.

Like the aforementioned preceding conferences, PSD 2014 originates in
Europe, but wishes to stay a worldwide event in database privacy and
SDC. Thus, contributions and attendees from overseas are welcome.

2. ORGANIZATION
---------------

PROGRAM COMMITTEE

John Abowd (Cornell University, USA)
Elisa Bertino (CERIAS, Purdue University, USA)
Aleksandra Bujnowska (EUROSTAT, European Union)
Jordi Castro (Polytechnical University of Catalonia)
Lawrence Cox (NISS, USA)
Josep Domingo-Ferrer (Universitat Rovira i Virgili, Catalonia)
Joerg Drechsler (IAB, Germany)
Khaled El Emam (University of Ottawa, Canada)
Mark Elliot (Manchester University, UK)
Stephen Fienberg (Carnegie Mellon University, USA)
Luisa Franconi (ISTAT, Italy)
Sarah Giessing (Destatis, Germany)
Julia Hoeninger (Statistik Berlin, Germany)
Llorenç Huguet (Universitat de les Illes Balears, Balearic Islands)
Anco Hundepool (The Netherlands)
Alan Karr (NISS, USA)
Julia Lane (American Institutes for Research, USA)
Bradley Malin (Vanderbilt University, USA)
Josep M. Mateo-Sanz (Universitat Rovira i Virgili, Catalonia)
Gerome Miklau (University of Massachusetts-Amherst, USA)
Krish Muralidhar (University of Kentucky, USA)
Christine O'Keefe (CSIRO, Australia)
Yosef Rinott (Hebrew University, Israel)
Gerd Ronning (University of Tuebingen, Germany)
Juan José Salazar (University of La Laguna, Spain)
Pierangela Samarati (University of Milan, Italy)
David Sánchez (Universitat Rovira i Virgili, Catalonia)
Eric Schulte-Nordholt (Statistics Netherlands)
Natalie Shlomo (University of Southampton, UK)
Michelle Simard (Statistics Canada)
Aleksandra Slavkovic (Penn State University, USA)
Jordi Soria-Comas (TSS, Catalonia)
Tamir Tassa (The Open University, Israel)
Vicenc Torra (IIIA-CSIC, Catalonia)
Vassilios Verykios (Hellenic Open University, Greece)
William E. Winkler (Census Bureau, USA)
Peter-Paul de Wolf (Statistics Netherlands)
Laura Zayatz (Census Bureau, USA)


PROGRAM AND GENERAL CHAIR

Josep Domingo-Ferrer (UNESCO Chair in Data Privacy,
Universitat Rovira i Virgili, Catalonia)

ORGANIZATION COMMITTEE

Joaquin Garcia-Alfaro (Telecom SudParis, France)
Sara Hajian (Universitat Rovira i Virgili, Catalonia)
Jesus Manjon (Universitat Rovira i Virgili, Catalonia)
Tamar Molina (Universitat Rovira i Virgili, Catalonia)
Marilina Tur (Universitat de les Illes Balears, Balearic Islands)


3. TOPICS OF INTEREST
---------------------

Topics of interest include but are not limited to:

- New SDC methods for tabular data
- New SDC methods for microdata (including non-conventional microdata
types such as trajectories, graphics, etc.)
- Best SDC practices for tabular data
- Best SDC practices for microdata
- Balancing data quality and data confidentiality in SDC
- Differential privacy
- SDC transparency issues
- Onsite access centers - Remote access facilities - SDC software
- Estimating disclosure risk in SDC
- Record linkage methods
- Real-life disclosure scenarios in EU-member states and abroad
- Privacy preserving data mining (both cryptographic and non-cryptographic)
- Private information retrieval
- Privacy in web-based e-commerce
- Privacy in healthcare
- Privacy in official and corporate statistics
- Other data anonymization issues

4. SUBMISSIONS
--------------

Full papers containing either original technical contributions or
high-quality surveys on the above topics or on related topics are
sought.

A submission should be clearly marked either as an original paper or a
survey. Submissions should contain a cover letter indicating:

1) whether the submission is a survey or an original
contribution;

2) the title of the submission;

3) keywords classifying the paper topic;

4) the names and affiliations of authors;

5) the e-mail, telephone and facsimile numbers of the
contact author.

The submission itself should be sent as an attached PDF file.
Submission and their cover letters should be sent to psd2014@urv.cat

Camera-ready versions of accepted papers should be prepared using the
LaTeX2e style or the Word template of Springer Verlag Lecture Notes in
Computer Science. For LaTeX2e, a macro package llncs.zip and an
example file typeinst.zip can be downloaded from

http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0

For Microsoft Word, a template word.zip can be downloaded from the
same page above.

We encourage authors to use the above formats already for their
submissions.

LENGTH OF SUBMISSIONS.

Using the above format with 11 point font, the paper should be at most
12 pages excluding bibliography and appendices, and at most 16 pages
total.

Committee members are not required to read appendices; the paper
should be intelligible without them.

Submissions not meeting these guidelines risk rejection without
consideration of their merits.

5. PROCEEDINGS
--------------

Among PSD 2014 accepted papers, a selection will be made based on
quality and coverage and the selected papers will be published in the
Lecture Notes in Computer Science (LNCS) series by Springer. This
follows the tradition of PSD 2012 (LNCS 7556), PSD 2010 (LNCS 6344),
PSD 2008 (LNCS 5262), PSD 2006 (LNCS 4302), PSD 2004 (LNCS 3050) and
the AMRADS Workshop on SDC (LNCS 2316).

The remaining accepted papers will be published in a CD with an ISBN.
It is possible to submit a paper directly for the CD, which benefits
from a later submission deadline (see CD-only dates below).

The form of publication of an accepted paper will be clearly specified
in the acceptance message. Both the LNCS volume and the CD will be
*available at the conference*.

5. IMPORTANT DATES
------------------

Submission deadline: **MAY 11, 2014**
Acceptance notification: June 20, 2014
Proceedings version due: July 3, 2014
Conference: Sep. 17-19, 2014

CD-only submission deadline: July 5, 2014
CD-only acceptance notification: July 24, 2014
CD-only proceedings version due: Aug. 3, 2014

6. VENUE AND TRAVEL
-------------------

The conference will take place in downtown Eivissa-city,
in the Balearic island of Eivissa. The venue will be the building
owned by the Universitat de les Illes Balears in Eivissa-city.
Address:

Antic edifici de la Comandancia Militar

Carrer del Calvari, 1

E-07800 Eivissa

http://www.uib.cat/lauib/localitzacio/Seu-dEivissa-i-Formentera/

http://www.uib.cat/lauib/Estructura/Seus-universitaries/saee/instal/

Further venue, travel and accommodation information will be posted in
due course at http://unescoprivacychair.urv.cat/psd2014

A number of travel grants are made available by the UNESCO Chair in
Data Privacy, especially for authors and delegates from transition
countries. Information on grants is posted in the conference web site.

7. REGISTRATION
---------------

Registration information will be posted no later than June 2014
at http://unescoprivacychair.urv.cat/psd2014
**********************************************************
*
* 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] International Conference on Computational and Experimental Science and Engineering (ICCESEN 2014), Antalya, October 25-29, 2014

International Conference on Computational and Experimental Science and
Engineering (ICCESEN 2014)".
Kemer-Antalya-TURKEY, October 25-29, 2014
http://www.iccesen.org/

Dear Colleagues,

I am pleased to invite you to participate to the "International
Conference on Computational and Experimental Science and Engineering
(ICCESEN 2014)" which will take place at hotel Queen Elizabeth Elite
Suite Hotel & Spa (http://www.queenelizabeth.com.tr/) in the period of
25-29 October, 2014 in Kemer-Antalya (Turkey). The conference will
provide excellent international forum for sharing knowledge and
expertise of the student, researchers and also industry.

The topic of the conference are:

Stream 1. Physical Science and Technology
Stream 2. Mathematical science and applications
Stream 3. Energy and applications
Stream 4. Earth Science and Application
Stream 5. Engineering Science and application
Stream 6. Material Science and application

The publication of the papers:

Some selected papers will be submitted for publication in a variety of
different SCI indexed journal covers different topics:
> Annals of Nuclear Energy (ANE)
> Optimization Methods and Software (OMS)
> Indian Journal of Engineering & Materials Sciences
> Acta Physica Polonica A,
> Computer Modeling in Engineering & Sciences
> Bosnian Journal of Basic Medical Sciences
>European Journal of Science and Technology


Important Dates are):

Abstract Submission : June 15, 2014
Early Registration : June 15, 2014
Late Normal Registration : August 31, 2014
Notification of Accepted papers : August 15, 2014
Conference Date : October 25-29, 2014
Full text submission : November 15,
2014 (for presented papers)




Prof.Dr. Iskender AKKURT
Conference Chair

iskenderakkurt@iccesen.org
www.iccesen.org



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

Monday, April 28, 2014

[DMANET] IEEE SSCI Special Session on Optimization Methods in Bioinformatics and Bioengineering (OMBB)

Special Session on Optimization Methods in Bioinformatics and Bioengineering (OMBB)
2014 IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2014)
December 9-12, 2014, Orlando, Florida, USA
http://www.ucl.ac.uk/~ucberal/SS-OMBB-IEEE_SSCI_2014.html

Submission deadline: 15 June 2014
Submission site: http://ieee-cis.org/conferences/ssci2014/upload.php


Aim and Scope

Bioinformatics and Bioengineering (BB) are interdisciplinary scientific fields involving many branches of computer science, engineering, mathematics, and statistics. Bioinformatics is concerned with the development and application of computational methods for the modelling, retrieving and analysis of biological data, whilst Bioengineering is the application of engineering techniques to biology so as to create usable and economically viable products.

Bioinformatics and Bioengineering are relatively new fields in which challenges and issues can often be formulated as optimization problems subject to multiple conflicting objectives. Such multiobjective optimization problems span from traditional problems, such as the optimization of biochemical processes, protein structure alignment and prediction, to more modern problems, such as directed evolution, drug design, experimental design, and optimization of manufacturing processes, material and equipment.

The main aim of this special session, which is organized within the SSCI-MCDM'14 Symposium, is to bring together both experts and new-comers working on Optimization Methods in Bioinformatics and Bioengineering (OMBB) to discuss new and exciting issues in this area.


Topics of Interest

We encourage submission of papers describing new concepts, strategies and challenges in the area of Bioinformatics and Bioengineering (BB). In addition, we are interested in application papers discussing the power and applicability of these novel methods to real-world problems in BB. You are invited to submit papers that are unpublished original work for this special session at SSCI-MCDM'14.

The topics are, but not limited to, the following

* Optimization methods for BB problems
* Novel optimization problems in BB
* Emerging non-standard problem challenges in BB problems (e.g. missing objective values, resourcing issues, dynamic changes, many objectives, large-scale, mixed-typed variables, etc.)
* Closed-loop optimization in BB
* Interactive multiobjective optimization in BB
* Predictive fitness landscape design for BB problems
* Integrating user preferences into multiobjective optimization of BB problems
* Handling practicalities in BB problems, such as uncertainty, noise, constraints, fixed budget of evaluations, high computational costs, etc.
* Robustness in the optimization of BB problems
* Visualization techniques for complex BB problems
* Adaptation, learning, and anticipation in BB problems


Submission Instructions

We welcome original contributions describing ongoing projects or completed work.
The instructions for authors, and LaTeX and Word templates can be found at http://www.ieee-ssci.org/submission.html


Key Dates

Paper Submissions due: 15 June 2014
Notification of Acceptance: 5 September 2014
Camera-Ready Papers due: 5 October 2014


Organizers

Richard Allmendinger, University College London, UK
Anna Lavygina, Imperial College London, UK
Sanaz Mostaghim, Otto von Guericke University of Magdeburg, Germany


Program Committee

Allmendinger Richard, University College London, UK
Ashlock Daniel, University of Guelph, Canada
Blum Christian, University of the Basque Country, Spain
Branke Jürgen, University of Warwick, UK
Chandra Arjun, University of Oslo, Norway
Deb Kalyanmoy, Michigan State University, USA
Emmerich Michael, Leiden University, Netherlands
Handl Julia, University of Manchester, UK
Knowles Joshua, University of Manchester, UK
Langdon Bill, University College London, UK
Lavygina Anna, Imperial College London, UK
Li Xiaodong, RMIT University, Australia
Mostaghim Sanaz,Otto von Guericke University of Magdeburg, Germany
Rombo Simona, University of Palermo, Italy
Shukla Pradyumn Kumar, Karlsruhe Institute of Technology, Germany


Contact

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

Call for Nominations for Editor-in-Chief TALG

Reminder: Nominations are due on May 16, 2014 for the next editor-in-chief of the ACM Trans-
actions on Algorithms. ACM TALG (webpage: http://talg.acm.org/) publishes original research
of the highest quality dealing with algorithms. It is a peer-reviewed journal, appearing quarterly.
Speci c areas of computation covered by the journal are listed at http://talg.acm.org/Aims.html.

We are looking for a well-established person with a strong record of research achievements and
service, and with a vision for the future of the eld. The term of appointment is three years, to
begin late summer 2014, with the possibility of renewal for a second term. The editor-in-chief is
responsible for faithfully executing the editorial charter of the journal yet should be proactive in
adapting the journal and its charter to changes in the eld. A description of the duties of the EiC
and evaluation criteria can be found at http://www.acm.org/publications/policies/evaluation.

Professor Valerie King of the University of Victoria, Victoria, BC, Canada is Chair of the Search
Committee. All nominees, including self-nominees, should send a CV and a Vision Statement for
TALG (at least one page), with subject header \EiC nomination" to:
val@uvic.ca

The deadline for nominations is Friday, May 16, 2014 at 11:59 p.m. (PST).

Call for nominations: TALG Editor in Chief

ACM TALG Editor-in-Chief Search: Call for nominations

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

Nominations are now open for the next editor-in-chief of the ACM Transactions on Algorithms. ACM TALG (webpage: http://talg.acm.org/) publishes original research of the highest quality dealing with algorithms. It is a peer-reviewed journal, appearing quarterly. Specific areas of computation covered by the journal are listed at http://talg.acm.org/Aims.html.

We are looking for a well-established person with a strong record of research achievements and service, and with a vision for the future of the field. The term of appointment is three years, to begin late summer 2014, with the possibility of renewal for a second term. The editor-in-chief is responsible for faithfully executing the editorial charter of the journal yet should be proactive in adapting the journal and its charter to changes in the field. A description of the duties of the EiC and evaluation criteria can be found at http://www.acm.org/publications/policies/evaluation.

Professor Valerie King of the University of Victoria, Victoria, BC, Canada is Chair of the Search Committee. All nominees, including self-nominees, should send a CV and a Vision Statement for TALG (at least one page), with subject header “EiC nomination” to:

val@uvic.ca
The deadline for nominations is Friday, May 16, 2014 at 11:59 p.m. (PST).

G.M. Adelson-Velsky passed away

Dear colleagues,

With a great sorrow I am informing you that Georgii Maksimovich (Gera, Giora) Adelson-Velsky passed away yesterday, at age 92.

Gera was a legendary founder of two famous Soviet Computer Science schools: in algorithms and data structures and in chess programming, which both arose before the term of Computer Science.

His AVL-trees (joint with E.M. Landis) were one of the very first, precedental examples of a dynamic data structure. His entire approach to effective algorithms was based on the amortized analysis of their running time, which was realized in the West many years later. His fascinating teaching educated the authors of such famous works as the Four Russian algorithm, the sorting algorithm using no working memory, network flow algorithms, graph isomorphism theory and algorithms, bio-informatic algorithms, and others. His approach was so far ahead the current view to algorithms in the West that some algorithms of him and of his Soviet followers were hardly understood in the West at the time of their publication.

Gera, together with A.L. Brudno, originated the game programming theory in the USSR, simultaneously with the West. The Soviet Kaissa chess program project (lead by him jointly with V.L. Arlazarov and M.V.Donskoy) produced the first world champion among chess programs.
 
His students (formal and informal) were A. Arlazarov, Y. Dinitz (E. Dinic), M. Donksoy, I. Faradjev, A. Karzanov, M. Kronrod, A. Leman, P. Pevzner, B. Weisfeller, and others. 

G.M. Adelson-Velsky will remain in the history of Computer Science as one of its fathers.

Sincerely,

    Yefim Dinitz, a student of Gera since 1968
    Computer Science Dept.
    Ben-Gurion University in the Negev
    Israel

[DMANET] WG 2014 first call for participation

**********************************************
WG 2014 CALL FOR PARTICIPATION

40th International Workshop on Graph-Theoretic Concepts in Computer Science

June 25-27, Domaine de Chalès near Orléans, France

http://www.univ-orleans.fr/lifo/evenements/WG2014/
**********************************************

The WG 2014 conference is the 40th edition of the WG series. It will take place in the region of the wonderful castles at the Loire, near Orléans. The conference will be from the 25th to the 27th of June 2014, with participants expected to arrive in Orléans on the 24th of June.

SCIENTIFIC PROGRAM
**************************
The program, composed of 32 contributed and two invited talks is available at
http://www.univ-orleans.fr/lifo/evenements/WG2014/?rub=program

INVITED SPEAKERS
***************
- Reinhard Diestel (Universität Hamburg)
- Pierre Fraigniaud, (CNRS/Université Paris Diderot)

REGISTRATION
******************
Registration is now open:
http://www.univ-orleans.fr/lifo/evenements/WG2014/?rub=registration
The deadline for early registration is the 25th of May.

Looking forward to meeting you in Orléans,
The organizers
**********************************************************
*
* 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] ECAI-14 Workshop and Tutorial on Metalearning & Algorithm Selection

MetaSel - Meta-learning & Algorithm Selection
*********************************************
ECAI-2014 Workshop, Prague,
19 August 2014
http://metasel2014.inescporto.pt/

2nd Announcement & Call for Papers

Objectives
This ECAI-2014 workshop will provide a platform for discussing the
nature of algorithm selection which arises in many diverse domains,
such as machine learning, data mining, optimization and satisfiability
solving, among many others.

Algorithm Selection and configuration are increasingly relevant today.
Researchers and practitioners from all branches of science and
technology face a large choice of parameterized machine learning
algorithms, with little guidance as to which techniques to use.
Moreover, data mining challenges frequently remind us that algorithm
selection and configuration are crucial in order to achieve the best
performance, and drive industrial applications.

Meta-learning leverages knowledge of past algorithm applications to
select the best techniques for future applications, and offers
effective techniques that are superior to humans both in terms of the
end result and especially in the time required to achieve it. In this
workshop we will discuss different ways of exploiting meta-learning
techniques to identify the potentially best algorithm(s) for a new
task, based on meta-level information and prior experiments. We also
discuss the prerequisites for effective meta-learning systems such as
recent infrastructure such as OpenML.org.

Many problems of today require that solutions be elaborated in the
form of complex systems or workflows which include many different
processes or operations. Constructing such complex systems or
workflows requires extensive expertise, and could be greatly
facilitated by leveraging planning, meta-learning and intelligent
system design. This task is inherently interdisciplinary, as it builds
on expertise in various areas of AI.

The workshop will include invited talks, presentations of
peer-reviewed papers and panels. The invited talks will be by Lars
Kotthoff and Frank Hutter (to be confirmed).

The target audience of this workshop includes researchers (Ph.D.'s)
and research students interested to exchange their knowledge about:
- problems and solutions of algorithm selection and algorithm configuration
- how to use software and platforms to select algorithms in practice
- how to provide advice to end users about which algorithms to
select in diverse domains, including optimization, SAT etc. and
incorporate this knowledge in new platforms.

We specifically aim to attract researchers in diverse areas that have
encountered the problem of algorithm selection and thus promote
exchange of ideas and possible collaborations.

Topics
Algorithm Selection & Configuration
Planning to learn and construct workflows
Applications of workflow planning
Meta-learning and exploitation of meta-knowledge
Exploitation of ontologies of tasks and methods
Exploitation of benchmarks and experimentation
Representation of learning goals and states in learning
Control and coordination of learning processes
Meta-reasoning
Experimentation and evaluation of learning processes
Layered learning
Multi-task and transfer learning
Learning to learn
Intelligent design
Performance modeling
Process mining

Submissions and Review Process
Important dates:
Submission deadline: 25 May 2014
Notification: 23 June 2014

Full papers can consist of a maximum of 8 pages, extended abstracts up
to 2 pages, in the ECAI format. Each submission must be submitted
online via the Easychair submission interface.

Submissions can be updated at will before the submission deadline.
Electronic versions of accepted submissions will also be made publicly
available on the conference web site. The only accepted format for
submitted papers is PDF.

Submissions are possible either as a full paper or as an extended
abstract. Full papers should present more advanced work, covering
research or a case application. Extended abstracts may present
current, recently published or future research, and can cover a wider
scope. For instance, they may be position statements, offer a specific
scientific or business problem to be solved by machine learning (ML) /
data mining (DM) or describe ML / DM demo or
installation.

Each paper submission will be evaluated on the basis of relevance,
significance of contribution, technical quality, scholarship, and
quality of presentation, by at least two members of the program
committee. All accepted submissions will be included in the conference
proceedings. At least one author of each accepted full paper or
extended abstract is required to attend the workshop to present the
contribution.

A selection will be made of the best paper and runner ups, and these
will be presented in the plenary session. The remainder of accepted
submissions will be presented in the form of short talks and a poster
session. All accepted papers, including those presented as a poster,
will be published in the workshop proceedings (possibly as CEUR
Workshop Proceedings). The papers selected for plenary presentation
will be identified in the proceedings.

Organizers:
Pavel Brazdil, FEP, Univ. of Porto / Inesc Tec, Portugal, pbrazdil
at inescporto.pt
Carlos Soares, FEUP, Univ. of Porto / Inesc Tec, Portugal, csoares
at fe.up.pt
Joaquin Vanschoren, Eindhoven University of Technology (TU/e), Eindhoven,
The Netherlands, j.vanschoren at tue.nl
Lars Kotthoff, University College Cork, Cork, Ireland, larsko at 4c.ucc.ie

Program Committee:
Pavel Brazdil, LIAAD-INESC Porto L.A. / FEP, University of Porto, Portugal
André C. P. Carvalho, USP, Brasil
Claudia Diamantini, Università Politecnica delle Marche, Italy
Johannes Fuernkranz, TU Darmstadt, Germany
Christophe Giraud-Carrier, Brigham Young Univ., USA
Krzysztof Grabczewski, Nicolaus Copernicus University, Poland
Melanie Hilario, Switzerland
Frank Hutter, University of Freiburg, Germany
Christopher Jefferson, University of St Andrews, UK
Alexandros Kalousis, U Geneva, Switzerland
Jörg-Uwe Kietz, U.Zurich, Switzerland
Lars Kotthoff, University College Cork, Ireland
Yuri Malitsky, University College Cork, Ireland
Bernhard Pfahringer, U Waikato, New Zealand
Vid Podpecan, Jozef Stefan Institute, Slovenia
Ricardo Prudêncio, Univ. Federal de Pernambuco Recife (PE), Brasil
Carlos Soares, FEP, University of Porto, Portugal
Guido Tack, Monash University, Australia
Joaquin Vanschoren, U. Leiden / KU Leuven
Ricardo Vilalta, University of Houston, USA
Filip Zelezný, CVUT, Prague, R.Checa

Previous events
This workshop is closely related to the PlanLearn-2012, which took
place at ECAI-2012 and other predecessor workshops in this series.


Tutorial on Metalearning and Algorithm Selection at ECAI-2014
*************************************************************
18 August 2014
http://metasel.inescporto.pt/

Algorithm Selection and configuration are increasingly relevant today.
Researchers and practitioners from all branches of science and
technology face a large choice of parameterized algorithms, with
little

guidance as to which techniques to use. Moreover, data mining
challenges frequently remind us that algorithm selection and
configuration are crucial in order to achieve the best performance and
drive industrial applications.

Meta-learning leverages knowledge of past algorithm applications to
select the best techniques for future applications, and offers
effective techniques that are superior to humans both in terms of the
end result and especially in a limited time.
In this tutorial, we elucidate the nature of algorithm selection and
how it arises in many diverse domains, such as machine learning, data
mining, optimization and SAT solving. We show that it is possible to
use meta-learning techniques to identify the potentially best
algorithm(s) for a new task, based on meta-level information and prior
experiments. We also discuss the prerequisites for effective
meta-learning systems, and how recent infrastructures, such as
OpenML.org, allow us to build systems that effectively advice users on
which algorithms to apply.

The intended audience includes researchers (Ph.D.'s), research
students and practitioners interested to learn about, or consolidate
their knowledge about the state-of-the-art in algorithm selection and
algorithm configuration, how to use Data Mining software and platforms
to select algorithms in practice, how to provide advice to end users
about which algorithms to select in diverse domains, including
optimization, SAT etc. and incorporate this knowledge in new
platforms. The participants should bring their own laptops

**********************************************************
*
* 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] SPAA 2014 - Call for Participation

======================================================
SPAA 2014 Call for Participation
======================================================

26th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2014)
June 23-25, 2014 Charles University, Prague, Czech Republic
http://www.spaa-conference.org

Highlight: The two keynote speakers will be Bruce Maggs and Fabian Kuhn.

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

Registration is now open. The early registration deadline is May 23.

We are accepting applications for travel grants for students. These applications are due May 2.

Please visit the conference webpage for:
- list of accepted papers
- registration
- information on student travel grants
- information on local arrangements
**********************************************************
*
* 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 in Information Security at the University of Luxembourg

The University of Luxembourg seeks to hire an outstanding doctoral
researcher at its Interdisciplinary Centre for Security, Reliability
and Trust (http://wwwen.uni.lu/snt) (SnT).

The successful candidate will participate in the activities of the
SaToSS (http://satoss.uni.lu) research group led by Prof. Dr. Sjouke
Mauw. The SaToSS group is working on formalizing and applying formal
reasoning to real-world security problems and trust issues. The research
topics of the group include: security protocols, security modeling,
formal methods for security, socio-technical aspects of security, risk
management, privacy, verification, etc.

Your role
--------------
The position is within the national project Attack-Defense Trees:
Theory Meets Practice (ADT2P). ADT2P is a follow-up project of a
recently finalized project Attack
Trees (http://satoss.uni.lu/projects/atrees/). The main tasks of the
Ph.D. student will be to
- Develop techniques for efficient representation of large-scale
security models,
- Introduce algorithms for quantitative analysis of such models,
- Integrate the developed techniques with existing risk assessment
methods and tools,
- Implement the obtained results in a computer tool,
- Conduct case studies together with the project partners from
industry,
- Co-supervise master students.

Your Profile
----------------
The candidate is expected to have:
- A Master degree in computer science or mathematics,
- A proven interest in security,
- Background in formal methods,
- Excellent written and oral English skills.

We offer
-----------
The University offers a three year appointment (extension up to 4 years
in total is possible). The University offers highly competitive salaries
and is an equal opportunity employer. You will work in an exciting
international environment and will have the opportunity to participate
in the development of a newly created research center.

Application
---------------
Applications should be written in English and include the following
documents:
- Cover letter indicating the research area of interest and your
motivation,
- Curriculum Vitae (including your contact address, work experience,
list of publications),
- A research statement addressing the topic of the position (max 1
page),
- A short description of your Master work (max 1 page),
- Transcript of grades from all university-level courses taken,
- Contact information for 3 referees.

Applications should be submitted electronically via the on-line
recruitment portal of the University of Luxembourg at
http://emea3.mrted.ly/dehl

Deadline for applications: June 22, 2014.

Contact information
-----------------------
For further inquiries please contact:
Prof. Dr. Sjouke Mauw (sjouke.mauw@uni.lu) or
Dr. Rolando Trujillo Rasua (rolando.trujillo@uni.lu)

For more information about this vacancy please check
http://satoss.uni.lu/vacancies/phd2014.php


**********************************************************
*
* 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] YR-ICALP 2014: Deadline extended to May 4th

YR-ICALP 2014: 1st Young Researcher Workshop on Automata, Languages and Programming
(http://www.itu.dk/people/maca/YR-ICALP2014/)

Scope:

YR-ICALP 2014 is a satellite workshop of ICALP 2014 and will be held on Monday July 7, 2014, at the ICALP venue at the IT-University of Copenhagen. This workshop aims at providing a forum for PhD students to exchange their preliminary or established results within the scope of the ICALP conference, in order to receive feedback. Excellent master students are also encouraged to contribute.

Format: 

YR-ICALP 2014 will offer a blend of presentations and posters:
* Presentations are selected on the basis of an abstract of up to 3 pages (incl. references).
* Posters are selected on the basis of an abstract of 500 words.

No particular format is required for either kind of abstract. Submissions must state whether they are presentations or posters. The accepted abstracts for presentations will be made available at the workshop, but no formal proceedings are planned. It is thus also allowed (and encouraged) to send results that have already been published. Rejected submissions for presentations may be invited for the poster session.

Submission must be done through the following link:
https://www.easychair.org/conferences/?conf=yricalp2014

Important Dates:
Submission: 4 May 2014 (extended)
Notification: 13 May 2014
Workshop Day: 7 July 2014

Program Committee:
Troels Sørensen
Marco Carbone
Pierluigi Crescenzi​​

**********************************************************
*
* 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] School on Parameterized Algorithms and Complexity (application deadline approaching)

School on Parameterized Algorithms and Complexity

We would like to remind about the approaching deadline for application
(30 April 2014).

Application form: http://fptschool.mimuw.edu.pl/index.php/application

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

[DMANET] Associate professorship in algorithms at ITU Copenhagen

The IT University of Copenhagen invites applicants for an associate professorship in algorithms (tenured) with special emphasis on algorithm engineering.
The proposed starting date is January 1, 2015.

Candidates are expected to have expertise in design and analysis of algorithms, with focus on bridging the gap between theory and practice. A history of industry collaboration, dissemination activities, and of making developed algorithms available to software developers is an advantage.
Candidates should complement ITU's existing expertise within algorithms theory and big data algorithms, and be motivated by an interplay of theory and practice (motivated by problems of practical interest, while seeking to make use of theoretical insight). Possible areas of expertise include, but are not limited to: Algorithms for modern computer architectures, algorithms for data management, space-efficiency, scalable algorithms for analyzing string and graph data, experimental algorithms, and engineering of randomized algorithms.

More info: https://delta.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=173037&departmentId=3439&MediaId=5


**********************************************************
*
* 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] SSTiC 2014: May 10, 6th registration deadline

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

2014 TARRAGONA INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING

SSTiC 2014

Tarragona, Spain

July 7-11, 2014

Organized by
Rovira i Virgili University

http://grammars.grlmc.com/sstic2014/

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

--- May 10, 6th registration deadline ---

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

AIM:

SSTiC 2014 is the second edition in a series started in 2013. For the
previous event, see http://grammars.grlmc.com/SSTiC2013/

SSTiC 2014 will be a research training event mainly addressed to PhD
students and PhD holders in the first steps of their academic career. It
intends to update them about the most recent developments in the diverse
branches of computer science and its neighbouring areas. To that purpose,
renowned scholars will lecture and will be available for interaction with
the audience.

SSTiC 2014 will cover the whole spectrum of computer science through 6
keynote lectures and 23 six-hour courses dealing with some of the most
lively topics in the field. The organizers share the idea that outstanding
speakers will really attract the brightest students.

ADDRESSED TO:

Graduate students from around the world. There are no formal pre-requisites
in terms of the academic degree the attendee must hold. However, since there
will be several levels among the courses, reference may be made to specific
knowledge background in the description of some of them.

SSTiC 2014 is also appropriate for more senior people who want to keep
themselves updated on developments in their own field or in other branches
of computer science. They will surely find it fruitful to listen and discuss
with scholars who are main references in computing nowadays.

REGIME:

In addition to keynotes, 3 parallel sessions will be held during the whole
event. Participants will be able to freely choose the courses they will be
willing to attend as well as to move from one to another.

VENUE:

SSTiC 2014 will take place in Tarragona, located 90 kms. to the south of
Barcelona. The venue will be:

Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona

KEYNOTE SPEAKERS:

Larry S. Davis (U Maryland, College Park), A Historical Perspective of
Computer Vision Models for Object Recognition and Scene Analysis

David S. Johnson (Columbia U, New York), Open and Closed Problems in
NP-Completeness

George Karypis (U Minnesota, Twin Cities), Top-N Recommender Systems:
Revisiting Item Neighborhood Methods

Steffen Staab (U Koblenz), Explicit and Implicit Semantics: Two Sides of One
Coin

Philip Wadler (U Edinburgh), You and Your Research and The Elements of Style

Ronald R. Yager (Iona C, New Rochelle), Social Modeling

COURSES AND PROFESSORS:

Divyakant Agrawal (U California, Santa Barbara), [intermediate] Scalable
Data Management in Enterprise and Cloud Computing Infrastructures

Pierre Baldi (U California, Irvine), [intermediate] Big Data Informatics
Challenges and Opportunities in the Life Sciences

Rajkumar Buyya (U Melbourne), [intermediate] Cloud Computing

John M. Carroll (Pennsylvania State U, University Park), [introductory]
Usability Engineering and Scenario-based Design

Kwang-Ting (Tim) Cheng (U California, Santa Barbara),
[introductory/intermediate] Smartphones: Hardware Platform, Software
Development, and Emerging Apps

Amr El Abbadi (U California, Santa Barbara), [introductory] The Distributed
Foundations of Data Management in the Cloud

Richard M. Fujimoto (Georgia Tech, Atlanta), [introductory] Parallel and
Distributed Simulation

Mark Guzdial (Georgia Tech, Atlanta), [introductory] Computing Education
Research: What We Know about Learning and Teaching Computer Science

David S. Johnson (Columbia U, New York), [introductory] The Traveling
Salesman Problem in Theory and Practice

George Karypis (U Minnesota, Twin Cities), [intermediate] Programming
Models/Frameworks for Parallel & Distributed Computing

Aggelos K. Katsaggelos (Northwestern U, Evanston), [intermediate]
Optimization Techniques for Sparse/Low-rank Recovery Problems in Image
Processing and Machine Learning

Arie E. Kaufman (U Stony Brook), [intermediate/advanced] Visualization

Carl Lagoze (U Michigan, Ann Arbor), [introductory] Curation of Big Data

Dinesh Manocha (U North Carolina, Chapel Hill), [introductory/intermediate]
Robot Motion Planning

Bijan Parsia (U Manchester), [introductory] The Empirical Mindset in
Computer Science

Charles E. Perkins (FutureWei Technologies, Santa Clara), [intermediate]
Beyond LTE: the Evolution of 4G Networks and the Need for Higher Performance
Handover System Designs

Robert Sargent (Syracuse U), [introductory] Validation of Models

Mubarak Shah (U Central Florida, Orlando), [intermediate] Visual Crowd
Analysis

Steffen Staab (U Koblenz), [intermediate] Programming the Semantic Web

Mike Thelwall (U Wolverhampton), [introductory] Sentiment Strength Detection
for Twitter and the Social Web

Jeffrey D. Ullman (Stanford U), [introductory] MapReduce Algorithms

Nitin Vaidya (U Illinois, Urbana-Champaign), [introductory/intermediate]
Distributed Consensus: Theory and Applications

Philip Wadler (U Edinburgh), [intermediate] Topics in Lambda Calculus and
Life

ORGANIZING COMMITTEE:

Adrian Horia Dediu (Tarragona)
Carlos Martín-Vide (Tarragona, chair)
Florentina Lilica Voicu (Tarragona)

REGISTRATION:

It has to be done at

http://grammars.grlmc.com/sstic2014/registration.php

The selection of up to 8 courses requested in the registration template is
only tentative and non-binding. For the sake of organization, it will be
helpful to have an approximation of the respective demand for each course.

Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed when the capacity of the venue will be complete. It is very
convenient to register prior to the event.

FEES:

As far as possible, participants are expected to attend for the whole (or
most of the) week (full-time). Fees are a flat rate allowing one to
participate to all courses. They vary depending on the registration
deadline.

ACCOMMODATION:

Information about accommodation is available on the website of the School.

CERTIFICATE:

Participants will be delivered a certificate of attendance.

QUESTIONS AND FURTHER INFORMATION:

florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

SSTiC 2014
Lilica Voicu
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34 977 559 543
Fax: +34 977 558 386

ACKNOWLEDGEMENTS:

Departament d'Economia i Coneixement, Generalitat de Catalunya
Universitat Rovira i Virgili


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