Theory Announcements: June 2011

Thursday, June 30, 2011

[DMANET] CALL FOR PAPERS [Deadline extended: September 30, 2011]: Special Issue of THEORETICAL COMPUTER SCIENCE on ``Theory and Applications of Graph Searching Problems''

CALL FOR PAPERS [***Deadline extension: September 30, 2011***]

THEORETICAL COMPUTER SCIENCE

Special Issue on ``Theory and Applications of Graph Searching Problems''

Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on
"Theory and Applications of Graph Searching Problems". This special issue will be dedicated to
the 60th birthday of Lefteris M. Kirousis.

Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of
game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a
number pursuers, that move systematically in the graph. The game may vary significantly according to the
capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal
way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has
become a very active research area in theoretical computer science and discrete mathematics, with impact
and applications in various domains.

With this Special Issue, we wish to foster research in the area by exposing new results and directions for further
research. The purpose of the issue is to put together various recent results related to Graph Searching both from
the applied and the theoretical point of view. Potential topics include (but are not limited to) the following:

Rendezvous Games,
Graph exploration and Gatherings
Graph Searching and Logic
Graph Parameters Related to Graph Searching
Graph searching and Robotics
Conquest and Expansion Games
Database Theory and Robber and Marshals Games
Probabilistic Techniques in Graph Searching
Monotonicity and Connectivity in Graph Searching
New Variants of Graph Searching
Graph Searching and Distributed Computing
Graph Searching and Network Security

Submissions should be made in PDF format using the standard TCS submission system
at http://ees.elsevier.com/tcs/ In the beginning of the submission,
please choose as an Article Type: "SI TCS-A: Graph Searching (Thilikos)".

Submissions must be received before September 30, 2011. Papers will be refereed according to the standards of TCS.
We promise to do our best to have the refereeing procedure timely finished. Please contact the guest editors
for additional information.

Guest Editors

Fedor V. Fomin (University of Bergen)
Pierre Fraigniaud (CNRS and University Paris Diderot)
Stephan Kreutzer (University of Oxford)
Dimitrios M. Thilikos (National and Kapodistrian University of Athens)
**********************************************************
*
* 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] Fwd: [MobiWac 2011] Call for Posters and Demos (Extended Deadline: July 7th)

** We apologize if you receive multiple copies of this message **

==================================================================
The 9th ACM* International Symposium on Mobility Management
and Wireless Access (MobiWac 2011)
www.mobiwac.org

CALL FOR POSTERS AND DEMOS
==================================================================

Poster and Demo submission deadline has been extended. Please note the
new dates:
Poster Submission Deadline: July 7th, 2011.
Demo Submission Deadline: July 7th, 2011.
==================================================================
The 9th ACM* International Symposium on Mobility Management and Wireless
Access (MobiWac 2011) will be held in conjunction with MSWiM 2011 (the
14th ACM International Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems) from October 31 to November 4, 2011 at Miami
Beach, FL, USA.

The poster and demo sessions in 9th ACM International Symposium on Mobility
Management and Wireless Access Protocols (MobiWac 2011) provides a forum for
showcasing ongoing research work and to obtain feedback from international
researchers. Researchers are encouraged to submit the preliminary results to
the poster session. We explicitly encourage submissions from students. Authors
are encouraged to submit posters and demos on all aspects of wireless and
mobile access technologies, with an emphasis on mobility management and
wireless access. Submitted posters must neither have been published elsewhere
nor currently be under review by another conference or journal.

For the demo session, we solicit demonstrations in novel systems, platforms and
applications in mobile and wireless access networking systems. We encourage
submissions from both industry and universities. We also encourage submission
of a demo that has already been described in the published literature in
sufficient details.

Accepted posters and demos will be included in the ACM MobiWac proceedings (up
to 4 pages for each poster and demo).

=========================
IMPORTANT DATES

Poster Submission Deadline: July 7th, 2011.
Demo Submission Deadline: July 7th, 2011.
Notification of Acceptance: July 21th, 2011.
Camera Ready Version Due: Aug 5th, 2011.
Speaker Author Registration deadline: Sep 6, 2011
Regular Early Registration deadline: Sep 20, 2011

=========================
TOPICS OF INTEREST include, but are not limited to:

- Wireless/Mobile Access Protocols
- Wireless/Mobile Web Access
- Wireless Internet and All-IP integration
- Next Generation Wireless systems
- Mobile Broadband Wireless Access
- Pervasive Communication and Computing
- Ubiquitous and mobile access
- Wireless Applications and testbeds
- Multi-Homing and Vertical Handoff
- Multi-Channel Multi-Radio MAC / network layer management
- Channels and resources allocation algorithms
- Energy and power management algorithms
- Multi-technology switching using Software Defined Radios
- Context-aware services and applications
- Context-aware protocols and protocol architectures
- Interactive applications
- Mobile database management
- Wireless Multimedia Protocols
- Mobile and Wireless Entertainment
- Mobile Info-services
- QoS management
- Mobility Control and Management
- Localization and tracking
- Mobile/Vehicular environment access
- Wireless ad hoc and sensor networks
- Security,Trust management and Privacy issues
- Fault Tolerance solutions
- Wireless Systems' Design
- Analysis/Simulation of wireless mobile systems
- Testbeds for experimental and simulation analysis

=========================
PAPER SUBMISSION AND PUBLICATION:

Submitted posters must be unpublished and must not be submitted for publication
elsewhere. All posters will be reviewed, and the accepted posters will be on
display during the conference. At least one of the authors of accepted posters
must attend the conference to present the poster. Posters should be submitted
as a single PDF of no more than 4 pages (including figures, tables and
references), double-column ACM style.

Demos should be submitted as a single PDF of no more than 4 pages (including
figures, tables and references), double-column ACM style. The paper title
should start with "Demo Abstract". Please describe what attendees will be able
to see or do during your demo (e.g. screenshots), and itemize any equipment or
facilities that you will require for your system demonstration.

FOR MORE INFORMATION about the conference, organizing committee,
submission instructions, and venue please see the conference
website (http://www.mobiwac.org/).

=========================
ORGANIZING COMMITTEE:

General Chair

Jose Rolim, University of Geneva, Switzerland

Program Co-Chairs

Jun Luo, Nanyang Technological University, Singapore
Sotiris Nikoletseas, U. of Patras and CTI, Greece

Posters/Demo Chair

Vinay Kolar, Carnegie Mellon University, Qatar

Web Chair

Dimitra Patroumpa, U. of Patras and CTI, Greece

Publicity Chairs

Constantinos Marios Angelopoulos, U. of Patras and CTI, Greece
Mo Li, Nanyang Technological University, Singapore

Publications Chair

Liu Xiang, Nanyang Technological University, Singapore

Steering Committee Co-Chairs

Azzedine Boukerche, U. of Ottawa, Canada
Albert Zomaya, University of Sydney, Australia

=========================
[*ACM sponsorship: approval pending]
**********************************************************
*
* 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, June 28, 2011

[DMANET] PhD Studentship -REINS Project, UK

PhD Studentship - REINS Project
Faculty of Arts, Computing, Engineering and Sciences
Duration: 3 years
Bursary £13,590 per annum

Applications are invited for an EPSRC 3 year fully funded PhD studentship working on the REINS project to begin on 1st September 2011 or as soon as possible after that date.

The REINS research group, based at Sheffield Hallam University in cooperation with King's College, London, is researching and designing a haptic communicational interface between a human agent and a mobile robotic guide. Expertise from design, engineering, robotics and communication will be brought to bear on the interface design. This interface ('reins') will facilitate joint navigation and inspection of space under low visibility conditions.

The aim of the PhD studentship is to contribute to the trial, evaluation and possible re-design of the initial interface prototypes.

Candidates should have a good honours degree and/or a postgraduate qualification in a relevant subject (e.g. computing, engineering, psychology, communication studies, design and technology) with a good understanding of interest in one or more of the following areas:

- Human-machine interaction
- User-orientated design
- Communication

Suitable candidates must be able to work successfully in a technical engineering environment as part of a multi-disciplinary project team as well as being able to work with outside agencies (including South Yorkshire Fire and Rescue and Guide Dogs for the Blind).

Funding
This project is fully funded at EPSRC rates:

- EU Fee i.e. 2011/12 £3710 any applicants classed as overseas fee payers should bear in mind that they are responsible for paying the difference between the EU fee and the Overseas fee.

- Bursary rate 2011/12: £13,590

Applications

Applications must be made using the Sheffield Hallam University Postgraduate Application Form which can be found at www.shu.ac.uk/study/form.html<http://www.shu.ac.uk/study/form.html>. CVs will NOT be accepted. The deadline for applications is 27th June 2011. Interviews will be held the week commencing 11th July 2011. All applications should be sent to Charlotte.Lester@shu.ac.uk<mailto:Charlotte.Lester@shu.ac.uk>

Supervision
The project will be supervised by Dr Jacques Penders and Dr Peter Jones of Sheffield Hallam University.

Further Information
For an informal discussion regarding this Studentship please contact Jacques Penders at J.Penders@shu.ac.uk<mailto:J.Penders@shu.ac.uk>. Applications sent to this address will not be accepted.

Closing Date 04/07/2011

**********************************************************
*
* 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] MFCS call for participation

CALL FOR PARTICIPATION

MFCS 2011
36th International Symposium on Mathematical Foundations of Computer Science
August 22-26 2011
Warsaw, Poland
http://mfcs.mimuw.edu.pl

Invited Lectures
* Nearest Neighbor Search in High-Dimensional Spaces by Alexandr Andoni
* Invariantization of listings by Jörg Flum
* Duality and recognition by Mai Gehrke
* Some Variants of the Star Height Problem by Daniel Kirsten
* Generic techniques to round SDP relaxations by Prasad Raghavendra
* New Proofs in Graph Minors by Paul Wollan
http://mfcs.mimuw.edu.pl/invited-speakers

Accepted Papers:
http://mfcs.mimuw.edu.pl/papers-accepted

As a special event, Young Research Forum is organized in parallel with
MFCS. The aim of the forum is to provide a platform for young
researchers (excellent master students, PhD students, PostDocs) to
present and discuss preliminary results or ongoing work in the field
of theoretical computer science.

Early registration ends July 31. To register for MFCS and YRF or for
any further information, please go to http://mfcs.mimuw.edu.pl

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

[DMANET] Last Call: Postdoctoral Position in Algorithmic Engineering at University of Warsaw

Postdoctoral Position in Algorithmic Engineering at University of Warsaw

A postdoctoral position in the area of algorithmic engineering is
available in the Department of Mathematics, Informatics and Mechanics
at University of Warsaw under the guidance of Prof. Piotr Sankowski.
Although algorithmic engineering is the main area of interest, all
candidates with strong qualifications in algorithmic research are
encouraged to apply and will be carefully considered.

Applicants should have a PhD degree or being close to completing it.
Knowledge of Polish language is not necessary, but a good knowledge of
English is required. Salary is competitive at the European level. The
position is supported by the PAAl project (ERC Starting Grant 259515 :
Practical Approximation Algorithms).

The goal of PAAl project is the development and study of practical
approximation algorithms. We will base our study on theoretical models
that can describe requirements for algorithms that make them
practically efficient. We plan to develop an efficient and useful
programming library of approximation algorithms. The project is
executed in cooperation with Prof. Stefano Leonardi from Sapienza
University of Rome. A more detailed information about the project can
be found at http://paal.mimuw.edu.pl.

Successful candidates can start after July 2011 (negotiable). Funding
is available for up to 4 years and different durations are possible.
Travel support is available for all research members and no teaching
duty is required.

Applications (including curriculum vitae, list of publications,
research plan, names of references with their e-mail addresses, and
intended period of stay) should be sent, by email if possible, by July
1st, 2011 to:

Prof. Piotr Sankowski
Institute of Informatics
University of Warsaw
ul. Banacha 2
02-097 Warsaw
Poland

Email: sank@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] Postdoc position

Université Libre de Bruxelles, Brussels, Belgium
Post-Doc position

Applications are invited for a Post-Doc position in the Quality and Computer Security research Lab (http://qualsec.ulb.ac.be) of the Université Libre de Bruxelles.

The successful applicant will work on the design of cryptographic protocols and primitives (and preferably on protocols and schemes based on fast true random bit/number generators). This work will be realized in the framework of the research project Cryptasc (http://cryptasc.ulb.ac.be) which results of the collaboration of researchers in cryptography and computer security and researchers working in the field quantum information and communication.

Ideally the candidate should be able to start on or near the 1st of September 2011 until 31th August 2013.

Candidates shall hold a PhD degree in Computer Science or related field and should be fluent in English.

Applications must include:
a curriculum Vitae
a list of publications and copies of three selected publications
the copies of diplomas and certificates
two (or more) references

Contact: Applicants are kindly requested to send their application by email: olivier.markowitch@ulb.ac.be or by letter to:
Olivier Markowitch
Université Libre de Bruxelles
Computer Science Department
Boulevard du Triomphe CP212
1050 Brussels
Belgium

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

Sunday, June 26, 2011

[DMANET] IPCCC 2011 -- Call for Paper

IEEE IPCCC 2011
The 30th IEEE International Performance, Computing, And Communication Conference (IPCCC) 2011
http://www.ipccc.org/

November 17-19, 2011
Orlando, Florida, USA

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

The International Performance, Computing, and Communications Conference is a premier IEEE conference
presenting research in the performance of computer and communication systems. For the last 30 years,
IPCCC has been a research forum for academic, industrial, and government researchers. We encourage
submission of high-quality papers reporting original work in both theoretical and experimental research
areas. Topics of interest include, but are not limited to, the following:

**** Hot Topics For IPCCC 2011 ****
Mobile Ad Hoc, Sensor and Mesh Networks
Performance Evaluation and Modeling
Parallel and Distributed Systems
Wireless Communication and Networks
Network Protocols
Internet Services and Network Management
Ubiquitous Computing
Online Social Network Analysis
Network Data Mining
Network Information Assurance, and Security
Cache, Memory, and Disk Storage Systems
Performance Tools and Techniques
Fundamental Theory and Algorithms
Grid and Cloud Computing
Workload Characterization and its Impact on Architecture Design
Multi- and Single- core Processor Architecture
Embedded Systems

FULL PAPERS: Full paper submissions may not exceeds 8 pages. Please see the IEEE formatting instruction
for details: http://www.computer.org/CPS. All papers will be blind reviewed by the Technical
Program Committee. They will be judged with respect to their quality, originality, and relevance.
Accepted papers will be published in the conference proceedings, conditional upon the author's
advance registration and attendance at the conference.

POSTERS: We welcome submissions of poster applications in the form of a two-page extended abstract in
PDF format. A subset of full paper submissions will also be invited to the IEEE IPCCC Poster Session.
Accepted posters will be presented on the night of November 18 (Friday) and the extended abstracts will
be included in the conference proceedings.

WORKSHOPS AND PANELS: Proposals for panel sessions and workshops are welcome. Please contact the
Program Chairs for details.

IMPORTANT DATES:
-----------------
Workshop and Panel Proposal Due: July 15, 2011
Conference Paper Submissions Due: August 3, 2011
Paper Acceptance Notification: September 15, 2011
Camera Ready Manuscript Due: October 1, 2011

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

General Chair:

Sheng Zhong, SUNY Buffalo, USA

Vice General Chairs:

Steven Ko, SUNY Buffalo, USA

Chengkai Li, University of Texas at Arlington, USA

Program Chairs:

Dejing Dou, University of Oregon, USA

Yu Wang, University of North Carolina at Charlotte, USA

Poster Chair:

Fan Wu, Shanghai Jiao Tong University, China

Publications Chair:

Song Fu, University of North Texas, USA

Publicity Chair:

Liehuang Zhu, Beijing Institute of Technology, China

Web Chair:

Neil Nelson, USA

Financial Chair:

Nasr Ullah, Freescale Semiconductor, USA

Registration Chair:

Jack Chen, Cisco, USA
**********************************************************
*
* 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 or Postdoc Positions ComPoSe Berlin

**********************************************************
PhD or Postdoc Positions in Berlin

Two PhD or Postdoc positions are available in within
the Berlin branch of the Eurocores project

EuroGiga - ComPoSe (http://www.eurogiga-compose.eu/)
"Combinatorics of Point Sets and Arrangements of Objects"

The project assembles three research directions, each led by a senior researcher.
The areas and the responsible researchers are:
• Arrangements of Pseudolines, Stefan Felsner (Technische Universität Berlin)
• Enumeration of Polycubes, Günter Rote (Freie Universität Berlin)
• Tverberg Type Theorems, Günter M. Ziegler (Freie Universität Berlin)

Candidates will be expected to undertake research in at least one of
these topics. The positions are for three years, with a 3/4 Berlin
TVL-13 salary (approx. 20000 EUR net salary per annum). Review of applications
will commence end of June and continue until the positions are filled.
We are seeking excellent students or Postdocs with a Masters/Diploma degree resp. PhD
in mathematics, computer science or a closely related field. Solid background
in discrete geometry and combinatorics is required. Applications, including CV,
list of publications and a letter of recommendation should be sent to
Prof. Stefan Felsner
Inst. Mathematik, MA 6-1
Technische Universitaet Berlin
Strasse des 17. Juni 136
D-10623 Berlin, Germany
Email: felsner at math.tu-berlin.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/
*
**********************************************************

Friday, June 24, 2011

Workshop on Coding, Complexity and Sparsity

A workshop on Coding, Complexity and Sparsity will be held at Ann Arbor, August
1--4, 2011. It is organized by Anna Gilbert, S Muthukrishnan, Hung Ngo, Ely
Porat, Atri Rudra, Martin Strauss.

There has been a considerable amount of fruitful interaction between coding and
complexity theories, and a fledgling interaction between sparse representation
and coding theories. We believe that academic research will be far richer
exploring more of the connections between sparse representation and coding
theories, as well as, between sparse representation and complexity theories.
Could there be a general structural complexity theory of sparse representation
problems and could techniques from algorithmic coding theory help sparse
representation problems?

The plan is to get researchers from different areas together in a Dagstuhl-like
setting and explore the question. There will be tutorials, talks and time to
research.

Registration is free and the deadline is July 15th.

We have limited funding to (partially) support the participation of some graduate
students.

For more details on the workshop (including the tutorials, list of invited
speakers and how to apply for participation support), please go to the
workshop webpage:

http://www.math.lsa.umich.edu/conferences/coding/

[DMANET] [MobiWac 2011] Call for Posters and Demos (6 days remaining)

** We apologize if you receive multiple copies of this message **

==================================================================
The 9th ACM* International Symposium on Mobility Management
and Wireless Access (MobiWac 2011)
www.mobiwac.org

CALL FOR POSTERS AND DEMOS
==================================================================

Poster Submission Deadline: June 30th, 2011.
Demo Submission Deadline: June 30th, 2011.

The 9th ACM* International Symposium on Mobility Management and Wireless
Access (MobiWac 2011) will be held in conjunction with MSWiM 2011 (the
14th ACM International Symposium on Modeling, Analysis and Simulation of
Wireless and Mobile Systems) from October 31 to November 4, 2011 at Miami
Beach, FL, USA.

Accepted posters and demos will be included in the ACM MobiWac proceedings (up
to 4 pages for each poster and demo).

=========================
IMPORTANT DATES

Poster Submission Deadline: June 30th, 2011.
Demo Submission Deadline: June 30th, 2011.
Notification of Acceptance: July 15th, 2011.
Camera Ready Version Due: Aug 5th, 2011.
Speaker Author Registration deadline: Sep 6, 2011
Regular Early Registration deadline: Sep 20, 2011

=========================
TOPICS OF INTEREST include, but are not limited to:

=========================
PAPER SUBMISSION AND PUBLICATION:

FOR MORE INFORMATION about the conference, organizing committee,
submission instructions, and venue please see the conference
website (http://www.mobiwac.org/).

=========================
ORGANIZING COMMITTEE:

General Chair

Jose Rolim, University of Geneva, Switzerland

Program Co-Chairs

Jun Luo, Nanyang Technological University, Singapore
Sotiris Nikoletseas, U. of Patras and CTI, Greece

Posters/Demo Chair

Vinay Kolar, Carnegie Mellon University, Qatar

Web Chair

Dimitra Patroumpa, U. of Patras and CTI, Greece

Publicity Chairs

Constantinos Marios Angelopoulos, U. of Patras and CTI, Greece
Mo Li, Nanyang Technological University, Singapore

Publications Chair

Liu Xiang, Nanyang Technological University, Singapore

Steering Committee Co-Chairs

Azzedine Boukerche, U. of Ottawa, Canada
Albert Zomaya, University of Sydney, Australia

[DMANET] Postdoctoral positions in algorithms at Nanyang Technological University

Postdoctoral Positions Open

Postdoctoral positions (official title: "Research Fellows") are
available, starting immediately in the Division of Mathematical
Sciences, Nanyang Technological University, Singapore, with Prof.
Gopal Pandurangan. All recent Ph.D.s (or those close to finishing) who
work in theoretical computer science with a focus on one or more of
the following areas are encouraged to apply: randomized/probabilistic
algorithms, distributed algorithms/computing, approximation
algorithms, network algorithms, communication complexity, and other
related areas in algorithms. All candidates with publication record in
theory and algorithms (e.g., SODA, FOCS, STOC, PODC, SPAA, DISC) are
encouraged to apply.

Salaries are competitive and are determined according to the
successful applicants' accomplishments, experience and qualifications.
Funding is available for up to three years. Travel funding is
available.

The Mathematical Sciences Division at NTU has a vibrant research group
in theoretical computer science, with several faculty, visitors from
leading institutions, post-doctoral research fellows, and Ph.D.
students from all over the world.

The candidates should send their CV, a brief research statement, and
two letters of recommendation to Prof. Gopal Pandurangan
(gopalpandurangan@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] ATMOS 2011 - Deadline extented to July 1st

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

11th WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELING, OPTIMIZATION, AND SYSTEMS (ATMOS 2011)

September 8, 2011
Saarbruecken, GERMANY

http://atmos2011.mpi-inf.mpg.de/

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

The ATMOS 2011 workshop will be held in connection with ALGO 2011,
hosted by Max Planck Institut fuer Informatik, which will take place
in Saarbruecken, on September 8, 2011.

Since 2000, the series of ATMOS workshops brings together researchers
and practitioners who are interested in all aspects of algorithmic
methods and models for transportation optimization and provides a
forum for the exchange and dissemination of new ideas and techniques.

Transportation networks give rise to very complex and large-scale
network optimization problems requiring innovative solution techniques
and ideas 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
---------------
Carlo Mannino, Universita di Roma "La Sapienza", ITALY

------------------------------------------------------------------
IMPORTANT DATES
---------------
SUBMISSION DEADLINE: July 1st, 2011, 23:59 GMT
NOTIFICATION OF AUTHORS: July 29, 2011
CAMERA READY SUBMISSION: August 26, 2011
WORKSHOP DATE: September 8, 2011

------------------------------------------------------------------
TOPICS
------
We invite papers for presentation at the workshop on optimization
problems for passenger and freight transport, including -- but not
limited to:

* Infrastructure Planning
* Vehicle Scheduling
* Crew and Duty Scheduling
* Rostering
* Routing in Road Networks
* Novel Applications of Route Planning Techniques
* Demand Forecasting
* Design of Tariff Systems
* Delay Management
* Mobile Applications
* Humanitarian Logistics
* Simulation Tools
* Line Planning
* Timetable Generation
* Routing and Platform Assignment

Of particular interest are: the successful integration of several
(sub)problems or planning stages, algorithms operating in an
online/realtime or stochastic setting, and heuristic approaches
(including approximation algorithms) for real-world instances.

------------------------------------------------------------------
SUBMISSIONS
-----------
Authors are invited to submit an extended abstract or full paper of
at most 12 pages. 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
http://www.easychair.org/conferences/?conf=atmos2011. The submission
must be received by 23:59 (GMT) on July 1, 2011. Each accepted
paper must be presented at the workshop by one of the authors.

------------------------------------------------------------------
PROCEEDINGS
-----------
The proceedings will be published on the Dagstuhl OpenAccess Series
in Informatics (OASIcs) publication service.

------------------------------------------------------------------
PROGRAM COMMITTEE
-----------------
* Alberto Caprara, Universita di Bologna, ITALY (Co-Chair)
* Cynthia Barnhart, MIT, USA
* Francesco Corman, University of Leuven, BELGIUM
* Friedrich Eisenbrand, EPFL, SWITCHERLAND
* Christoph Helmberg, TU Chemnitz, GERMANY
* Spyros Kontogiannis, University of Ioannina, GREECE (Co-Chair)
* Gabor Maroti, Erasmus University Rotterdam, NETHERLANDS
* Elise Miller-Hooks, University of Maryland, USA
* Dario Pacciarelli, Universita degli Studi "Roma Tre", ITALY
* Martin Skutella, TU Berlin, GERMANY
* Sebastian Stiller, MIT, USA
* Peter Widmayer, ETHZ, SWITCHERLAND

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

* Alberto Marchetti-Spaccamela, Universita di Roma "La Sapienza", ITALY
* Rolf Mohring, TU Berlin, GERMANY
* Dorothea Wagner, Karlsruhe Institute of Technology (KIT), GERMANY
* Christos Zaroliagis, University of Patras, GREECE

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

* Alberto Caprara, Universita di Bologna, ITALY
* Spyros Kontogiannis, University of Ioannina, GREECE

------------------------------------------------------------------
SPONSORSHIPS
------------

ATMOS 2011 will be hosted by the Max Planck Institut fuer Informatik,
and is jointly organized by the University of Ioannina and the
Universita di Bologna.

The co-sponsorship of ATMOS 2011 by the following organizations is
highly appreciated:

* European Association for Theoretical Computer Science (EATCS)
* Research Academic Computer Technology Institute (CTI)

------------------------------------------------------------------
LAST MODIFIED: June 24th, 2011.

LA RICERCA C'È E SI VEDE:
5 per mille all'Università di Bologna - C.F.: 80007010376
http://www.unibo.it/Vademecum5permille.htm

Questa informativa è inserita in automatico dal sistema al fine esclusivo della realizzazione dei fini istituzionali dell'ente.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, June 23, 2011

Psotodoctoral position in algorithms at Nanyang Technological University

Postdoctoral positions (official title: "Research Fellows")
are available, starting immediately, in the Division of Mathematical
Sciences, Nanyang Technological University, Singapore, with Prof.
Gopal Pandurangan (http://www.ntu.edu.sg/home/gopal). All recent
Ph.D.s (or those close to finishing) who work in theoretical computer
science/algorithms with a focus on one or more of the following areas
are encouraged to apply: randomized/probabilistic algorithms,
distributed algorithms/computing, network algorithms, communication
complexity, and other related areas in algorithms. All candidates with
publication record in theory and algorithms (e.g., SODA, FOCS, STOC,
PODC, SPAA, DISC etc.) are encouraged to apply.

Salaries are competitive and are determined according to the
successful applicants' accomplishments, experience and qualifications.
Funding is available up to three years. Travel funding is available.

The candidates should send their CV, a brief research statement, and
two letters of recommendation to Prof. Gopal Pandurangan
(gopalpandurangan@gmail.com).

The Mathematical Sciences Division at NTU has a vibrant research group
in theoretical computer science and algorithms, with several faculty,
visitors from leading institutions, post-doctoral research fellows, and
Ph.D. students from all over the world.

[DMANET] CFP Pervasive Communication Security, Social Networking and Social Engineering

Call for Papers

Pervasive Communication Security, Social Networking and Social Engineering Workshop
In conjunction with The International Conference on Computing, Networking and Communications (ICNC 2012)
Maui, Hawaii, USA

January 30 - February 2, 2012
http://www.conf-icnc.org/

Contact Information

Narasimha Shashidhar, Sam Houston State University, Huntsville, TX, USA
karpoor@shsu.edu

Lei Chen, Sam Houston State University, Huntsville, TX, USA
chen@shsu.edu

Scope:

The future of communication relies on the ability of communication systems to blend into the user's environment with the goal of supporting social and collaborative communication and computation. To this end, providing confidentiality and integrity of communicated data are desired key security features in a pervasive communication system. Users need to be able to trust the communication systems and find out how trustworthy their peers are. As the communication and associated systems become more pervasive, these privacy issues are amplified. These security requirements result in many challenges in the research and development of pervasive systems. The aim of this workshop is to enable researches, scientists, and engineers in the community to exchange and share ideas and experience, and demonstrate latest research outcomes on all areas of security, trust and privacy in pervasive communication systems. This workshop solicits original work in various aspects of, but not limited to, the following topics:

· Decentralized, scalable social networking
· Privacy-aware, personally controlled social networking
· Availability and resilience
· Community based secure communication
· Data confidentiality and integrity
· Anonymity and Pseudonymity
· New approaches to trust and reputation
· New attack paradigms
· Social engineering, Spam and Phishing
· Context aware services and applications
· Scalable and efficient authentication and key management solutions
· Designing appropriate reputation systems for various situations
· Utilizing communities to build trust
· Managing privacy of personal information

Submission Guidelines

Please follow the author instructions at http://www.conf-icnc.org/author.htm
For submission: Workshop papers should be submitted via EDAS at the conference page:
http://edas.info/N10987. In addition, please send a pdf file of your paper to karpoor@shsu.edu

Important dates

Submission deadline July 31, 2011
Notification of acceptance Sept. 30, 2011
Submission of camera-ready version and Registration Oct. 20, 2011
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] [Last day! (firm)] 4th SETOP 2011, Co-located with ESORICS 2011, Springer LNCS proceedings

CALL FOR PAPERS -- SETOP 2011

4th International Workshop on Autonomous and Spontaneous Security
<http://setop2011.dyndns.org>

**Paper Submission [Extended] Deadline: June 24 [FIRM]**

15 -- 16 September, 2011, Leuven, Belgium,
Co-located with ESORICS 2011, Springer LNCS Proceedings

Scope:

Security and reliability have become a major concern for service
oriented applications as well as for communications systems and
networks. With the need for evolution, if not revolution, of current
network architectures and the Internet, autonomous and spontaneous
management will be a key feature of future networks and information
systems. In this context, security is an essential property. It must
be thought at the early stage of conception of these systems and
designed to be also autonomous and spontaneous.

Future networks and systems must be able to automatically configure
themselves with respect to their security policies. The security
policy specification must be dynamic and adapt itself to the changing
environment. Those networks and systems should interoperate securely
when their respective security policies are heterogeneous and possibly
conflicting. They must be able to autonomously evaluate the impact of
an intrusion in order to spontaneously select the appropriate and
relevant response when a given intrusion is detected. Autonomous and
spontaneous security is a major requirement of future networks and
systems. Of course, it is crucial to address this issue in different
wireless and mobile technologies available today such as RFID, Wifi,
Wimax, 3G, etc. Other technologies such as ad hoc and sensor networks,
which introduce new type of services, also share similar requirements
for an autonomous and spontaneous management of security.

Keynotes:

* Claudia Diaz (Katholieke Universiteit Leuven, BE),
* George Danezis (Microsoft Research, UK),
* Gildas Avoine (Universite catholique de Louvain, BE)

Topics:

The SETOP Workshop seeks submissions that present research results on
all aspects related to spontaneous and autonomous security.
Submissions by PhD students are encouraged. Topics of interest
include, but are not limited to the following:

* Security policy deployment
* Self evaluation of risk and impact
* Distributed intrusion detection
* Autonomous and spontaneous response
* Trust establishment
* Lightweight cryptography
* Selfish behavior and collaboration enforcement
* Security in autonomous networks
* Security in ad hoc networks
* Security in sensor/RFID networks
* Security of Next Generation Networks
* Security in Cloud Computing
* Security of Service Oriented Architecture
* Security of opportunistic networks
* Privacy policies
* Privacy-aware environments
* Privacy in self-organized networks
* Secure localization
* Context aware and ubiquitous computing
* Secure interoperability and negotiation
* Self-organization in secure routing
* Identity management
* Modeling and validation of security

Submission Guidelines:

Papers should be at most 15 pages (using 11-point font), excluding the
bibliography and well-marked appendices. Committee members are not
required to read the appendices, so the paper should be intelligible
without them. All submissions must be written in English. All papers
will be refereed. Accepted papers should be presented at the Workshop.
At least one author of each accepted paper must register to the
workshop, by the early date indicated by the organizers, and present
the paper.

Authors must submit their papers by the deadline indicated below,
using the EasyChair web site (use the link
http://www.easychair.org/conferences/?conf=setop2011) and following the
requirements stated there.

Proceedings will be published by Springer in the Lecture Notes in
Computer Science (LNCS) series. The submitted paper (in PDF format)
should follow the template indicated by Springer (see
http://www.springer.de/comp/lncs/authors.html). It must start with a
title, a short abstract, and a list of keywords.

It is expected that extended and revised version of the best papers from
the workshop will be considered for international journal special issues.

Submissions by PhD students as well as controversial ideas are
encouraged. Case studies (successful or not) are also encouraged.

Important dates:

* Papers [Extended] Deadline: June 24, 2011 [FIRM]
* Acceptance Notification: July 28, 2011
* Camera Ready: August 15, 2011
* Workshop Dates: 15 - 16 September, 2011
**********************************************************
*
* 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/
*
**********************************************************

Turing Centenary Research Competition - Call for Proposals

THE TURING CENTENARY RESEARCH PROJECT:
MIND, MECHANISM AND MATHEMATICS

Research Fellowship and Scholar Competition
http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408
Submission deadline - December 16, 2011

More than any other figure, Turing has left a coherent scientific agenda
related to many of the 'Big Questions' concerning the relationship between
the human mind, mechanism in nature, and the mathematics required to
clarify and answer these questions. The very breadth and fundamental
nature of Turing's impact makes the centenary celebration a hugely
opportune period in which to reassert the role of basic thinking in
relation to deep and intractable problems facing science.

'The Turing Centenary Research Project - Mind, Mechanism and Mathematics',
supported by a major grant from the John Templeton Foundation, arises from
the above-mentioned scientific agenda, and is aimed at researchers still
within ten years of receiving their Ph.D. The participants in the research
project will be the winners of the 'Mind, Mechanism and Mathematics'
competition, designed to provide significant funding support for eight
young researchers. Five of the winners will become JTF 'Turing Research
Fellows' with an award of £75,000 each; and awards of £45,000 will be for
JTF 'Turing Research Scholars' in the 16 to 25 age-group.

The competition is organised in conjunction with the Turing Centenary
Celebration, to be held June 22-25, 2012, at the Manchester City Hall and
the University of Manchester. The award winners will be duly honoured on
the June 23, 2012 centenary of Turing's birth.

Further details:

__________________________________________________________________________

Honorary Chairs: Rodney Brooks and Sir Roger Penrose

Submission deadline - December 16, 2011
Award Notification - March 31, 2012
Award Ceremony - Turing Centenary Day, June 23, 2012
Commencement of the research project - July 1, 2012

Proposals will be judged relative to four research themes:

Chair of the Judges: S Barry Cooper (Leeds)

The Judges for Research Theme 1 (The Mathematics of Emergence: The
Mysteries of Morphogenesis):

Luca Cardelli (Microsoft Research, Cambridge)
Stuart Kauffman (Vermont/Santa Fe)
Cris Moore (New Mexico/Santa Fe)

The Judges for Research Theme 2 (Possibility of Building a Brain:
Intelligent Machines, Practice and Theory):

Luciano Floridi (Oxford/Hertfordshire)
Barbara Grosz (Harvard)
Aaron Sloman (Birmingham)

The Judges for Research Theme 3 (Nature of Information: Complexity,
Randomness, Hiddenness of Information):

Eric Allender (Rutgers)
Rodney Downey (Wellington)
Manindra Agrawal (Kanpur)

The Judges for Research Theme 4 (How should we compute? New Models of
Logic and Computation):

Samson Abramsky (Oxford)
Gordon Plotkin (Edinburgh)
Robert I. Soare (Chicago)

Proposals should be made via the EasyChair submission page at:

http://www.easychair.org/conferences/?conf=turingresearch2012

For further details, see:

http://www.mathcomp.leeds.ac.uk/turing2012/give-page.php?408