[NPA] CFP: International Journal "Network Protocols and Algorithms"

********************* Call for Papers *********************

Network Protocols and Algorithms

ISSN 1943-3581

http://www.macrothink.org/journal/index.php/npa/

Network Protocols and Algorithms is a free-access online international journal, peer-reviewed and published by Macrothink Institute. It publishes papers focused on the design, development, manage, optimize or monitoring any type of network protocol, communication system, algorithm for communication and any protocol and algorithm to communicate network devices.

The scope of the journal include, but are not limited to, the following topic areas:

- Synchronization Protocols and Algorithms
- Security Protocols and Algorithms
- QoS Protocols and Algorithms
- Ad-Hoc and Sensor Networks Protocols and Algorithms
- Content Delivery Networks Protocols and Algorithms
- P2P Protocols and Algorithms
- Cluster-Based Protocols and Algorithms
- Real-Time Protocols and Algorithms
- Wireless Protocols and Algorithms
- MAC Protocols and Algorithms for Wired Networks
- Mobile wireless internet protocols and algorithms
- Delay Tolerant protocols and algorithms
- Mesh network protocols and algorithms
- Protocols and algorithms for Voice over IP delivery
- Cognitive Radio Network Protocols and Algorithms
- Monitoring and management protocols and algorithms
- optical networking protocols and algorithms
- Scalable Network Protocols and Algorithms
- Protocols and algorithms for Green Computing and Resource Allocation
- Routing Protocols and Algorithms
- Tree-based Protocols and Algorithms
- Distributed/Decentralized Algorithms for Networks
- Fault tolerant Protocols and Algorithms
- Protocols and algorithms for Mobile and Dynamic Networks
- Cross-Layer Collaborative Protocols and Algorithms
- Formal methods and cryptographic algorithms for communication
- Power Efficient and Energy Saving Network Protocols and Algorithms
- Multimedia Network Protocols and Algorithms
- Network Protocols and Algorithms for Context-Aware and Semantic Networks
- Localized Network Protocols and Algorithms
- Transport Layer Protocols
- Smart Grids protocols and algorithms

Network Protocols and Algorithms has linked its papers to references by DOI (Digital Object Identifier) numbers.

Network Protocols and Algorithms appears in the next search engines: Google Scholar, Bing, Yahoo and Ask.

Network Protocols and Algorithms is added and indexed in Index Copernicus, ProQuest, EBSCO, Ulrichsweb.com, Directory of Open Access Journals (DOAJ), Open J-Gate, Gale, Socolar, io-port Database, NewJour - Electronic Journals and Newsletters, Public Knowledge Project metadata harvester, Ovid LinkSolver, Genamics JournalSeek and PublicationsList.org. It is also requested to be included in other major Indexing Databases.

You are welcome to submit a paper or forward this call for papers to any people working in Network Protocols and Algorithms that may be interested in submitting a paper.

The topics suggested by the journal can be discussed in term of concepts, state of the art, standards, implementations, running experiments and applications. Proposals and deployments are also welcome.

Submission Information:
Only original and unpublished research papers will be considered in this journal. Manuscripts must be writen in English. All submissions will be reviewed based on technical merit and relevance. Instructions for authors and submissions can be found in http://www.macrothink.org/journal/index.php/npa/about/submissions

Jaime Lloret Mauri
Editor in Chief of the International Journal of Network Protocols and Algorithms
Department of Communications
Polytechnic University of Valencia, Spain

[DMANET] WALCOM 2012 First Call For Papers

First Call for Papers

Workshop on Algorithms and Computation 2012 (WALCOM 2012)

http://www.buet.ac.bd/cse/walcom2012/

The International Workshop on Algorithms and Computation (WALCOM) is
intended to provide an international forum for researchers working in
the areas of algorithms and computation. WALCOM 2012 will be held
during February 15-17, 2012 at Dhaka, Bangladesh.

SCOPE

The range of topics within the scope of the workshop of algorithms and
computation includes (but is not limited to):

Approximation Algorithms
Combinatorial Algorithms
Combinatorial Optimization
Computational Biology
Computational Geometry
Data Structures
Graph Algorithms
Graph Drawing
Parallel and Distributed Algorithms
Parameterized Complexity
Network Optimization
Online Algorithms
Randomized Algorithms
String Algorithms

CALL FOR PAPERS

Authors are invited to submit papers (extended abstracts) describing
original research of theoretical or practical significance to algorithms
and computation. Papers should not exceed 12 pages for long papers and 6
pages for short papers in LNCS style.Papers must be labeled as either
long or short and prepared using LaTex2e. If the authors feel that more
details are essential to substantiate the main claim of the paper, they
may include a clearly marked appendix that will be read at the
discretion of the program committee. Only electronic submission will be
allowed. Submitted papers must describe work not previously published.
They must not be submitted simultaneously to another conference with
refereed proceedings or to a journal.

PROCEEDINGS

Accepted submissions will be published in the conference proceedings,
which will be included in the Springer-Verlag series Lecture Notes in
Computer Science.

SPECIAL ISSUES OF JOURNALS

Journal of Graph Algorithms and Applications (JGAA) and Discrete
Mathematics, Algorithms and Applications (DMAA) will publish special
issues on WALCOM 2012.

VENUE

The workshop will be held in Bangladesh University of Engineering and
Technology (BUET), Dhaka. The workshop will be organized by the
Bangladesh Academy of Sciences and the Department of Computer Science
and Engineering, BUET.

SUBMISSION DEADLINE

Paper Submission: September 10, 2011
Notification of Acceptance/Rejection: October 25, 2011
Cameraready version due: November 5, 2011
Workshop : February 15- 17, 2012

INVITED SPEAKERS

Kazuo Iwama (Kyoto University, Japan)
Peter Widmayer (ETH, Zurich, Switzerland)
Sue Whitesides (University of Victoria, Canada)

CONTACT ADDRESS

Dr. Md. Saidur Rahman
Dept. of Computer Science and Engineering
Bangladesh University of Engineering and Technology (BUET)
Dhaka-1000, Bangladesh
E-mail: saidurrahman@cse.buet.ac.bd

&

Dr. Shin-ichi Nakano
Department of Computer Science
Faculty of Engineering
Gunma University
Japan
Email: nakano@cs.gunma-u.ac.jp

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

[DMANET] Special Issue of DAM for LAGOS 2011 - CALL FOR PAPERS

Special Issue of DAM for LAGOS 2011 - CALL FOR PAPERS

We are very happy to announce the call for papers for a special issue of
Discrete Applied Mathematics devoted to selected full papers from
Latin-American Algorithms, Graphs and Optimization Symposium 2011.

We invite all contributing authors from LAGOS 2011 to submit full-paper
versions of the extended abstracts accepted and presented at the
conference, as well as papers of general interest within the conference
themes.

Please note that, in the first case, the full papers must include
substantial enhancements with respect to the extended abstracts (including
proofs, further results, computational experience, etc.) and must comply
with the instructions for authors and quality requirements of Discrete
Applied Mathematics. The full papers will be subject to a new refereeing
process.

We extend this invitation to the LAGOS 2011 plenary and semi-plenary
speakers, who can submit papers related to their talks at the conference
or papers of general interest within the conference themes.

Finally, we extend this invitation to the algorithms, graphs and
optimization community, who can submit papers of general interest within
the conference themes.

The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify that the paper is a contribution for "Special Issue: LAGOS 2011".

The deadline for submission of full papers is October 31st, 2011.

Best regards,

Flavia Bonomo, Tom Liebling, Javier Marenco, Jayme Szwarcfiter, and Mario
Valencia-Pabon.

**********************************************************
*
* 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-doc at Ryerson University (Toronto)

Applications are invited for one postdoctoral fellow in Graph Theory in
the Department of Mathematics at Ryerson University
(http://math.ryerson.ca/) to begin on September 1, 2011. The research
will be led jointly by Drs. Anthony Bonato and Pawel Pralat (Ryerson
University). This position provides an opportunity to engage in research
in Mathematics, with a limited amount of teaching, and is suited for
talented mathematicians who have recently completed their Ph.D. The
salary is competitive, with funding provided for a year and with
potential for renewal for a second year.

The applicant should have a PhD in Mathematics or Computer Science. The
ideal candidate would have expertise in one or more of the areas of
complex networks (such as the web graph or on-line social networks),
random graphs, graph searching games (such as Cops and Robbers),
infinite graphs, or graph homomorphisms. The position is open to
candidates of any nationality and selection will be based upon the
candidate's research record and potential. Experience with computer
programming (such as C/C++, or Java) is a plus. As the applicant will
normally teach, some teaching experience is preferred.

Applicants should provide a cover letter, curriculum vitae, and at least
three letters of recommendation. At least one of these letters should
report on the candidate's teaching abilities.

Applicants should apply no later than July 4, 2011, and the position
will remain open until filled. Please note the position is advertised
pending budgetary approval.

Application material and reference letters will be submitted by e-mail
to abonato@ryerson.ca

We appreciate all replies to this advertisement, but only applicants
under consideration will be contacted. Ryerson University is strongly
committed to fostering diversity within our community. We welcome those
who would contribute to the further diversification of our faculty and
its scholarship including, but not limited to, women, visible
minorities, Aboriginal people, persons with disabilities, and persons of
any sexual orientation or gender identity.

Best regards,
-- Pawel Pralat
**********************************************************
*
* 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] DPM 2011 (deadline extended) --FIRM

Call For Papers DPM 2011

6th Data Privacy Management International Workshop
DPM 2011
Leuven, Belgium, September 15-16, 2011

http://dpm2011.dyndns.org/

**Submission deadline EXTENDED: June 24, 2011 [FIRM]**

The aim of this Data Privacy Management workshop is to discuss and
exchange the ideas related to privacy data management. We invite
papers from researchers and practitioners working in privacy,
security, trustworthy data systems and related areas to submit their
original papers in this workshop. The main topics, but not limited to,
include:

- Privacy Information Management
- Privacy Policy-based Infrastructures and Architectures
- Privacy-oriented Access Control Languages and Models
- Privacy in Trust Management
- Privacy Data Integration
- Privacy Risk Assessment and Assurance
- Privacy Services
- Privacy Policy Analysis
- Cryptography
- Cryptanalysis
- Query Execution over Privacy Sensitive Data
- Privacy Preserving Data Mining
- Hippocratic and Water-marking Databases
- Privacy for Integrity-based Computing
- Privacy Monitoring and Auditing
- Privacy in Social Networks
- Privacy in Ambient Intelligence (AmI) Applications
- Individual Privacy vs. Corporate/National Security
- Code-based Cryptology
- Privacy in computer networks
- Privacy and RFIDs
- Privacy in sensor networks

* Submissions Guidelines:

Papers should be up to 15 pages in English, excluding bibliography and
well-marked appendices. Papers must be submitted electronically via
easychair (http://www.easychair.org/conferences/?conf=dpm2011). Each
submitted paper will be refereed.

The paper selection will be based upon the relevance of the paper to
the main topics, on its originality, on its soundness, on its
scientific quality and on the potential to stimulate discussion during
the event. Submissions by PhD students as well as controversial ideas
are encouraged. Case studies (successful or not) are also encouraged.

Post-proceedings will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series. At least one author of each
accepted paper is required to register with the workshop and present
the paper. Selected papers will be considered for international
journal special issues.

* Important Dates:

- Paper Submission Deadline: June 24, 2011
- Paper Acceptance Notification: July 28, 2011
- Camera Ready: August 15, 2011
- Workshop Dates: 15 -- 16 September, 2011

* Committees:

General Chair

- Joaquin Garcia-Alfaro (TELECOM Bretagne)

Program Committee Chairs

- Nora Cuppens-Boulahia (TELECOM Bretagne)
- Guillermo Navarro-Arribas (Autonomous University of Barcelona)

Steering Committee:

- Josep Domingo-Ferrer (Rovira i Virgili University)
- Joaquin Garcia-Alfaro (TELECOM Bretagne)
- Guillermo Navarro-Arribas (UAB)
- Vicenc Torra (IIIA-CSIC)
**********************************************************
*
* 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] [Deadline Extended, June 24 (FIRM)] 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

Committees:

 General Chair:

 * Frederic Cuppens (TELECOM Bretagne, FR)

 Program Committee Chairs:

 * Sabrina De Capitani di Vimercati (UNIMI, IT)
 * Joaquin Garcia-Alfaro (TELECOM Bretagne, 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] Workshop -- Parameterized Complexity:: Not about Graphs!

===============================================================
Call For Participation:

PARAMETERIZED COMPLEXITY: NOT-ABOUT-GRAPHS!

Website: www.cdu.edu.au/parameterized-nag
The wiki: www.fpt.wikidot.com

August, 2011  Charles Darwin University (CDU), Northern Territory, AUSTRALIA
===============================================================

DESCRIPTION
To date, much of the work in parameterized algorithmics has been
focused in the area of graph algorithms. However, computational
complexity is an issue that arises everywhere.

The focus of the workshop is on reporting new advances regarding the
parameterized computational complexity of problems in algebra, number
theory, analysis, topology, game theory, geometry - anything that
takes the field into new and unexplored directions of relevance. It is
also focused on identifying and promoting the key unsolved problems in
these new directions.

Following the workshop, there will be a publication outcome to be
published by CDU Press. We expect the discussions and presentations to
be rich with possibilities for further development of entire research
areas, and programmatic themes that can be developed into future
research proposals. Please let us know if you would like to give a
presentation.

There will be a website devoted to open problems, progress on which we
would like to see reported at the workshop, and that will in any case
serve to collect and publicize key open problems to promote these new
directions of parameterized complexity research.

DATES: Weekend of 5-8 August 2011 for Darwin Workshop plus extra days
9-13 August for a Problem-Solving (and touring) Session. The weekend
Workshop starts at 6 pm on Friday evening, August 5, and ends at noon
on Monday, August 8 at Charles Darwin University in Darwin (Casuarina
campus).

For those who wish to stay on after, following the workshop will be
several days of problem-solving "Barbados-style," possibly on
flip-charts out in the bush. We will depart Darwin on the morning of
August 9 on a bus or van to visit areas of interest, such as Katherine
Gorge. Distances are vast, so we will arrange lodging (although we may
ask for a donation).  Families are welcome. We will work, but also
enjoy the serenity and excitement of the Northern Territory. We will
return to Darwin on Saturday August 13.

Remember, that Australia is a day ahead, so if you are leaving Darwin
on Sunday, you will arrive in US or Europe on Sunday, "time starts
here".

===============================================================
Please register at www.cdu.edu.au/parameterized-nag and send the
registration form to
Anita Pettit, Administration Leader anita.pettit@CDU.edu.au
School of Engineering and Information Technology
T. +61 8 8946 6457 | F. +61 8 8946 6680 |
CHARLES DARWIN UNIVERSITY
Darwin, Northern Territory 0909 AUSTRALIA
CRICOS Provider No. 00300K

Please do not hesitate to contact in case you have any questions.
Frances Rosamond <Frances.Rosamond@CDU.edu.au>
Yiannis Koutis < i.koutis@gmail.com >
Michael Fellows <Michael.Fellows@CDU.edu.au>
===============================================================
**********************************************************
*
* 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] Pre-doctoral position in safe vehicle routing @ University of Antwerp

At the University of Antwerp (Belgium), there is a vacant position for a
pre-doctoral researcher in operations research (vehicle routing) at the
Faculty of Applied Economics. The ideal candidate has a good background in
operations research (www.scienceofbetter.org) and mathematics, including
good programming skills and a good command of the English language.
The position is meant to conduct research on *vehicle routing problems* in
which *safety considerations* are important. The work, which involves the
implementation and testing of heuristic optimization strategies, will be
carried out in close collaboration with Kenneth Sorensen and Johan
Springael. The candidate is expected to enroll the university's Ph.D.
program and to obtain a Ph.D. at the end of the project. A short project
description can be found below. We offer a four-year position (with annual
evaluation), a net monthly grant of over 1900 euro, and a stimulating
working environment in a lively cosmopolitan city.

For more information, please contact Kenneth Sorensen at
kenneth.sorensen@ua.ac.be . Applications should be sent by email, and should
include [1] a detailed CV including description of background in operations
research as well as programming skills, [2] complete transcripts of bachelor
and master degrees, [3] a motivation letter and [4] (if available) results
on TOEFL/GMAT/GRE tests.

*We are looking to hire a PhD student on short notice. Please apply as soon
as possible.*

*Short project description*

Vehicle routing is one of the most important topics in Operations Research
and supply chain management. The aim of vehicle routing is to determine the
order in which to visit a set of customers in such a way that the total
distribution cost is minimized. In many situations, however, safety issues
arise in the context of vehicle routing problems, especially when multiple
transport modes can be used. This is especially the case in the chemical
industry, in which safety is an extremely important issue and many different
modes of transport are available (road, rail, waterway, sea, pipeline), each
having their own characteristics in terms of safety.

The aim of this research is to study vehicle routing problems in which
safety issues are important. These vehicle routing problems will be modeled
and adequate solution procedures (mostly metaheurisitics) will be developed.
The research will focus on real-life problems.
**********************************************************
*
* 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/
*
**********************************************************

ADFOCS 2011 announcement

[please forward to potentially interested students and postdocs]
*****************************************************************
12th Max-Planck Summer School
Advanced Course on the Foundations of Computer Science

ADFOCS 2011 will be held in the week before ALGO'11:

August 29 - September 2, 2011
Saarbruecken, Germany

http://www.mpi-inf.mpg.de/conference/adfocs
*****************************************************************

DEADLINES
------------
Grant applications: June 30
Early registration: July 15
Late registration: August 15

ABOUT ADFOCS
------------
ADFOCS is an international summer school held annually at the Max Planck
Institute of Informatics (MPII). It is organized as part of the
activities of the MPII, in particular the International Max-Planck
Research School (IMPRS), MPII's graduate program. The purpose of this
summer school is to introduce young researchers to topics which are the
focus of current research in theoretical computer science. We bring
together three leading researchers in the field and international
participants at the graduate level and above.

PROGRAM
-------
Our invited speakers give three 90-minute lectures with subsequent
exercise and discussion sessions. The topics and lecturers are:

* Designing Approximation Algorithms using Semidefinite Programming
Sanjeev Arora, Princeton University

* Additive Integrality Gaps and Discrepancy Theory
Friedrich Eisenbrand, EPFL

* Algorithmic Mechanism Design: Fundamental Techniques and Future Challenges
Robert Kleinberg, Cornell University

LOCATION and TRAVEL INFORMATION
-----------------------------
ADFOCS will be held at the Max Planck Institute for Informatics in
Saarbruecken, Germany. Saarbruecken is the capital of one of Germany's
16 federal states, the Saarland. It is conveniently located in the
center of Europe, on the border of Germany with France, between
Luxembourg, the Saar-Mosel valley, Frankfurt, and Strasbourg. Being
located on several main train and road routes, Saarbruecken is easily
reachable from Frankfurt, Stuttgart, Paris, or Luxembourg. Saarbruecken
also has its own international airport.

REGISTRATION
------------
The registration fee is EUR 120 for *early registration before July 15*
and EUR 170 after that date. The fee covers lunches and social events.
It does not include accommodation, but we can help you with your
reservations. Per-night prices, including taxes and breakfast, typically
range from EUR 20 (youth hostel, double room) to about EUR 60 (hotel,
single room). A limited number of grants for graduate students or young
researchers are available, for application please send a CV and a letter
of recommendation before *June 30*.
Please note that grants roughly cover your registration and
accommodation fees, but will not be sufficient to cover your travel costs.

CONTACT
-------
The homepage of ADFOCS, providing forms for registration and hotel
reservation can be found at

http://www.mpi-inf.mpg.de/conference/adfocs

If you have further questions, please do not hesitate to contact the
ADFOCS team by sending an email to adfocs at mpi-inf.mpg.de

Organizers: Anke van Zuylen and Christine Rizkallah, MPII Saarbruecken

[DMANET] ADFOCS 2011 -- Call for Participation

[please forward to potentially interested students and postdocs]
*****************************************************************
12th Max-Planck Summer School
Advanced Course on the Foundations of Computer Science

ADFOCS 2011 will be held in the week before ALGO'11:

August 29 - September 2, 2011
Saarbruecken, Germany

http://www.mpi-inf.mpg.de/conference/adfocs
*****************************************************************

DEADLINES:
Grant applications: June 30
Early registration: July 15
Late registration: August 15

ABOUT ADFOCS
------------
ADFOCS is an international summer school held annually at the Max Planck
Institute of Informatics (MPII). It is organized as part of the
activities of the MPII, in particular the International Max-Planck
Research School (IMPRS), MPII's graduate program. The purpose of this
summer school is to introduce young researchers to topics which are the
focus of current research in theoretical computer science. We bring
together three leading researchers in the field and international
participants at the graduate level and above.

PROGRAM
-------
Our invited speakers give three 90-minute lectures with subsequent
exercise and discussion sessions. The topics and lecturers are:

* Designing Approximation Algorithms using Semidefinite Programming
Sanjeev Arora, Princeton University

* Additive Integrality Gaps and Discrepancy Theory
Friedrich Eisenbrand, EPFL

* Algorithmic Mechanism Design: Fundamental Techniques and Future
Challenges
Robert Kleinberg, Cornell University

LOCATION and TRAVEL INFORMATION
-----------------------------
ADFOCS will be held at the Max Planck Institute for Informatics in
Saarbruecken, Germany. Saarbruecken is the capital of one of Germany's
16 federal states, the Saarland. It is conveniently located in the
center of Europe, on the border of Germany with France, between
Luxembourg, the Saar-Mosel valley, Frankfurt, and Strasbourg. Being
located on several main train and road routes, Saarbruecken is easily
reachable from Frankfurt, Stuttgart, Paris, or Luxembourg. Saarbruecken
also has its own international airport.

REGISTRATION
------------
The registration fee is EUR 120 for *early registration before July 15*
and EUR 170 after that date. The fee covers lunches and social events.
It does not include accommodation, but we can help you with your
reservations. Per-night prices, including taxes and breakfast, typically
range from EUR 20 (youth hostel, double room) to about EUR 60 (hotel,
single room). A limited number of grants for graduate students or young
researchers are available, for application please send a CV and a letter
of recommendation before *June 30*.
Please note that grants roughly cover your registration and
accommodation fees, but will not be sufficient to cover your travel costs.

CONTACT
-------
The homepage of ADFOCS, providing forms for registration and hotel
reservation can be found at

http://www.mpi-inf.mpg.de/conference/adfocs

If you have further questions, please do not hesitate to contact the
ADFOCS team by sending an email to adfocs at mpi-inf.mpg.de

Organizers: Anke van Zuylen and Christine Rizkallah, MPII Saarbruecken
**********************************************************
*
* 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] WINE'11: first CfP

WINE 2011, the 7th Workshop on Internet & Network Economics.

December 11-14, 2011, Singapore.

Over the past decade, there has been a growing interaction between
researchers in theoretical computer science, networking and security,
economics, mathematics, sociology, and management sciences devoted to
the analysis of problems arising from the Internet and the World Wide
Web. The Workshop on Internet & Network Economics (WINE) is an
interdisciplinary forum for the exchange of ideas and results arising
from these various fields. The seventh WINE will take place in
December, 2011 in Singapore.

All submissions will be peer-reviewed and evaluated on the basis of
the quality of their contribution, originality, soundness, and
significance. Industrial applications and position papers presenting
novel ideas, issues, challenges and directions are also welcome.
Submissions are invited in the following topics but not limited to:

* Algorithmic game theory
* Algorithmic mechanism design
* Auction algorithms and analysis
* Computational advertising
* Computational aspects of equilibria
* Computational social choice
* Convergence and learning in games
* Coalitions, coordination and collective action
* Economics aspects of security and privacy
* Economics aspects of distributed and network computing
* Information and attention economics
* Network games
* Price differentiation and price dynamics
* Social networks.

Submission Format

Authors are invited to submit extended abstracts presenting original
research on any of the research fields related to WINE'11. No
simultaneous submission to other publication outlets (either a
conference or a journal) is allowed.

An extended abstract submitted to WINE'11 should start with the title
of the paper, each author's name, affiliation and e-mail address,
followed by a one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition of the main
ideas and techniques used to achieve these results, including
motivation and a clear comparison with related work. The extended
abstract should not exceed 12 single-spaced pages (full papers) or 6
pages (short papers) using reasonable margins and at least 10-point
font (excluding references and title page). If the authors believe
that more details are essential to substantiate the claims of the
paper, they may include a clearly marked appendix (with no space
limit) that will be read at the discretion of the Program Committee.
It is strongly recommended that submissions adhere to the specified
format and length. Submissions that are clearly too long may be
rejected immediately. The proceedings of the conference will be
published by Springer-Verlag in the Lecture Notes in Computer Science
series, and will be available for distribution at the conference.
Submissions are strongly encouraged, though not required, to follow
the LNCS format.

Submission of Working Papers

To accommodate the publishing traditions of different fields, we allow
the authors to submit working papers that they intend to publish in
journals that do not accept papers previously published in conference
proceedings. These submissions will be reviewed together with the
regular submission using the same acceptance criteria, but only a
one-page abstract will appear in the proceedings with a URL that
points to the full paper and that will be reliable for at least two
years. Open access is preferred although the paper can be hosted by a
publisher who takes copyright and limits access, as long as there is a
link to the location. At the submission stage, such papers should be
formatted in the same way as the regular submissions (in particular,
they can be submitted as long or short papers), but the title page
should state clearly that the submission is a working paper.

Important Dates

* Submission deadline (regular papers): July 31, 2011.
* Submission deadline (short papers): August 7, 2011.
* Notification: September 15, 2011.
* Camera-ready copy is due on September 28, 2011.

For more information and submission instructions, see the conferemce homepage:
http://web.spms.ntu.edu.sg/~wine11/
**********************************************************
*
* 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] Lectureship in Computer Science at Durham University

A full-time Lectureship in Computer Science is available at the School
of Engineering and Computing Sciences, Durham University, UK.

The applicant's research interests should fall broadly within one of the
general research areas covered by the two Research and Teaching Groups
in Computer Science, namely Algorithms and Complexity and Innovative
Computing. The post-holder will be expected to undertake research in an
aspect of Computer Science within these areas, to teach on undergraduate
and postgraduate courses within Computer Science; and to undertake
administrative duties associated with a position of Lecturer, as
designated by the Head of School.

Candidates will need to provide evidence that they are able to deliver
internationally excellent original research and that they can teach at
the highest level on the School's undergraduate and postgraduate
programmes.
It is expected that candidates will be able to demonstrate that they
have the ability to attract research funding in their own specialised
area of study.

The salary will be in the range GBP 29972 - 44016.
The Closing Date is 28 June 2011.

Please note that interviews for this post are scheduled to take place
mid - late July 2011.

More information can be found on the website
http://ig5.i-grasp.com/fe/tpl_durham01.asp?newms=jj&id=68571
Formal applications should be made on-line via the same website.

Informal enquiries can be made to
Prof Roger Crouch (r.s.crouch@durham.ac.uk), Head of School,
Dr Andrei Krokhin (andrei.krokhin@durham.ac.uk), Head of the Algorithms
and Complexity research group, or
Dr Nick Holliman (n.s.holliman), Head of Innovative Computing research
group.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Special Issue of the ACM Journal on Experimental Algorithmics on Multicore Algorithms

ACM Journal on Experimental Algorithmics

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

Special Issue on Multicore Algorithms

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

CALL FOR PAPERS

DEADLINE: September 1, 2011

Authors are invited to submit papers for a special Issue of the ACM Journal
on Experimental Algorithms (ACM JEA) on multicore algorithms.

The recent switch to multi-core processors brought a dramatic change that
affects a large spectrum of systems from embedded and general-purpose to
high-end computing systems. Parallelism is forcing major changes in software
development. The aim of this issue is to discuss the challenges that
parallelism brings to the design and implementation of Algorithms and Data
Structures. Original submissions are sought that address implementation and
performance issues of multicore algorithms and data structures for any
multicore processor, for example, Intel Nehalem and Single-Chip Cloud; and
NVIDIA and AMD GPUs. An experimental study typically includes an
implementation, a series of experiments designed to understand the behavior
of the algorithm(s) under study, and a critical discussion of the
experiments and their results. Whenever possible, experiments should include
test data from previously published studies to enable critical comparisons,
although the development of new test suites is also encouraged. Studies of
an algorithm in a specific application context of general interest are
welcome, as are contributions in the development and understanding of
experimental methodologies.

The ACM JEA is a high-quality, refereed, paperless, archival journal devoted
to the study of discrete algorithms and data structures through a
combination of experimentation and classical analysis and design techniques.

The ACM JEA was established to address the following issues:

- The empirical study of combinatorial algorithms is a rapidly growing
research area, with no proper outlet for publication.

- Communication among researchers in this area must include more than a
summary of results or a discussion of methods; the actual programs and data
used are of critical importance.

- Many published algorithms and data structures have never been implemented
by anyone and are at risk of remaining theoretical ``curiosities''. To bring
such algorithms and data structures into the practical realm often requires
considerable sophistication; researchers need to be encouraged to turn their
talents in that direction.

- Most researchers find that they must program their own version of this or
that well-known algorithm or data structure, because repositories for these
are not available.

- The two preceding reasons also explain why practitioners only rarely use
state-of-the-art algorithms and data structures; a repository of routines,
most with well documented behavior on realistic test cases, will encourage
practitioners to use more recent results.

Therefore, the ACM JEA has two principal aims: 1) To stimulate research in
algorithms based upon implementation and experimentation; in particular, to
encourage testing, evaluation and reuse of complex theoretical algorithms
and data structures; and 2) To distribute programs and test-beds throughout
the research community and to provide a repository of useful programs and
packages to both researchers and practitioners.

Information about ACM JEA, including instructions for manuscript
preparation, is available on the journal website: <http://jea.acm.org>
http://jea.acm.org .

Please submit your manuscript electronically via the submission website, and
indicate "Special Issue on Multicore Algorithms" on the cover page and in
the notes section of the submission form. Manuscripts must conform to the
JEA style available at <http://jea.acm.org/authors.html>
http://jea.acm.org/authors.html

Expanded versions of previously published conference research papers are
welcome as long as they contain at least 30% new material; authors should
clearly state in a footnote on the first page how the manuscript differs
from the conference paper. Papers simultaneously submitted elsewhere may be
returned without review.

Please contact the guest editors with any questions regarding the special
issue.

Guest Editors:

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

David A. Bader, Georgia Institute of Technology
<http://www.cc.gatech.edu/~bader/> www.cc.gatech.edu/~bader/

Philippas Tsigas, Chalmers University of Technology
<http://www.cse.chalmers.se/~tsigas/> www.cse.chalmers.se/~tsigas/

Schedule:

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

Submission Deadline: 1 September 2011

Publication is expected before the end of 2012.

The call for papers, further information, and updates are available at:

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

[qest-announce] First Call for Participation CONCUR/QEST/TGC 2011

[We apologise for multiple copies.]

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

AACHEN CONCURRENCY AND DEPENDABILITY WEEK

CONCUR: 22th Int. Conference on Concurrency Theory

QEST: 8th Int. Conference on Quantitative Evaluation of SysTems

TGC: 6th Int. Symposium on Trustworthy Global Computing

6 Tutorials + 9 Workshops

September 5 - September 10, 2011
Aachen, Germany
http://concur2011.rwth-aachen.de

First CALL FOR PARTICIPATION

Early Registration Opened!

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

-----------------------------------------------------------------------
-- REGISTRATION --
-----------------------------------------------------------------------

Online registration: http://concur2011.rwth-aachen.de/registration

Early registration deadline: July 31; Late registration deadline: August 25.

-----------------------------------------------------------------------
-- CONCUR/QEST 2011 INVITED SPEAKERS --
-----------------------------------------------------------------------

Parosh Aziz Abdulla (Uppsala University, Sweden)
Wil van der Aalst (Technical University Eindhoven, The Netherlands)
Ursula Goltz (Technical University Braunschweig, Germany)
Rachid Guerraoui (EPFL Lausanne, Switzerland)
Geoffrey Smith (Florida International University, USA)
Lothar Thiele (ETH Zurich, Switzerland)

-----------------------------------------------------------------------
-- QEST 2011 TUTORIAL SPEAKERS --
-----------------------------------------------------------------------

Peter Buchholz (University of Dortmund, Germany)
Krishnendu Chatterjee (IST Austria, Vienna, Austria)
Kousha Etessami (LFCS University of Edinburgh, UK)
Boris Köpf (IMDEA Software, Madrid, Spain)
Aad van Moorsel (Newcastle University, UK)
Verena Wolf (Saarland University, Germany)

-----------------------------------------------------------------------
-- Host City: Aachen, Germany --
-----------------------------------------------------------------------

Aachen is Germany's most westerly city and is situated directly on the
border with Belgium and the Netherlands. It was a royal residence of
the emperor Charlemagne, and it served as the principal coronation site
of Holy Roman emperors and of German kings from the Middle Ages to the
Reformation. The Aachen Cathedral is a UNESCO World Heritage site since
1978. The city has a flair and atmosphere of its own. The attractive
layout of the old city center, the important historic monuments, the
wells and baths over the hottest natural springs in Europe, the
cultural diversity and quality and the many recreational and leisure
activities make Aachen an exciting and pleasant place to visit and host
a conference.

Aachen is conveniently located in an extensive highway network with
regard to transport facilities in the direction of Brussels, Paris and
Antwerp. The international airports in Frankfurt, Cologne/Bonn,
Düsseldorf, Brussels, Eindhoven and Maastricht-Aachen (NL) together
with the international railway network ensure a good connectivity.
Every two hours, the high-speed train Thalys operates via Aachen
between Paris and Cologne and ICE trains run from Frankfurt to Brussels
via Aachen.

The AACHEN CONCURRENCY AND DEPENDABILITY WEEK is organized by the
Software Modeling and Verification Group, Dept. of Computer Science,
RWTH Aachen University and will take place in the Super C building in
the centre of the town.

-----------------------------------------------------------------------
-- Affiliated Workshops --
-----------------------------------------------------------------------

COMPMOD Computational Models for Cell Processes
EXPRESS Expressiveness in Concurrency
FOCLASA Foundations of Coordination Languages and Software
Architectures
GASICS Games for Design, Verification and Synthesis
LAM Logics, Agents, and Mobility
MLQA Models and Logics for Quantitative Analysis
SECCO Security Issues in Concurrency
SOS Structural Operational Semantics
YR-CONCUR Young Researchers on Concurrency Theory

-----------------------------------------------------------------------
-- Organization --
-----------------------------------------------------------------------

General Chair:
Joost-Pieter Katoen (RWTH Aachen University, Germany)

CONCUR PC Chairs:
Joost-Pieter Katoen (RWTH Aachen University, Germany)
Barbara König (University of Duisburg-Essen, Germany)

QEST PC Chairs:
Catuscia Palamidessi (INRIA and Ecole Polytechnique, France)
Alma Riska (EMC Corporation, USA)

TGC PC Chairs:
Roberto Bruni (University of Pisa, Italy)
Vladimiro Sassone (University of Southhampton, UK)

-----------------------------------------------------------------------
-- Contact --
-----------------------------------------------------------------------

See http://concur2011.rwth-aachen.de

For further questions, please contact acdw2011@cs.rwth-aachen.de

_______________________________________________
qest-announce mailing list
qest-announce@iti.illinois.edu
http://mailman.crhc.uiuc.edu/mailman/listinfo/qest-announce

[DMANET] Extended Deadline: ALGOSENSORS 2011

FINAL CALL FOR PAPERS

ALGOSENSORS 2011

7th International Symposium on Algorithms for Sensor Systems,
Wireless Ad Hoc Networks and Autonomous Mobile Entities

**** EXTENDED SUBMISSION DEADLINE: 27 June 2011 ****

September 8-9, 2011, Saarbruecken, Germany;
to be held in conjunction with ALGO/ESA 2011

http://www.algosensors.org/algosensors11/

BROADENED SCOPE. Starting from 2011, ALGOSENSORS broadens its thematic
scope, keeping its focus on sensor networks, but also including other
related types of ad hoc wireless networks, such as mobile networks, radio
networks and distributed systems of robots.

KEY FEATURES:

- 2 Tracks (NEW from 2011):

Track A: Sensor Networks

Track B: Ad hoc Wireless and Mobile Systems

- 2 days event duration

- Proceedings by Springer, Lecture Notes in Computer Science (LNCS)

- Special Issue on best papers by the Theoretical Computer Science (TCS)
Journal

PROGRAM COMMITTEE

Chair: Sotiris Nikoletseas, U. of Patras and CTI, Greece
Track A Chair: Pekka Orponen, Aalto U., Finland
Track B Chair: Thomas Erlebach, U. of Leicester, UK

STEERING COMMITTEE

Josep Diaz, U.P. Catalunya, Spain
Bhaskar Krishnamachari, U. of Southern California, USA
P.R. Kumar, U. of Illinois, Urbana-Champaign, USA
Jan van Leeuwen, U. of Utrecht, The Netherlands
Sotiris Nikoletseas, U. of Patras and CTI, Greece (Chair)
Jose Rolim, U. of Geneva, Switzerland
Paul Spirakis, U. of Patras and CTI, Greece

IMPORTANT DATES:

Paper submission: June 27, 2011 (EXTENDED!)
Notification: July 29, 2011
Camera-ready for pre-proceedings: August 15, 2011
Symposium: September 8-9, 2011
Camera-ready copy for post-proceedings: October 10, 2011

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. Submissions may be considered for a two-page brief
announcement in case not accepted as a full text; authors who wish their
paper to be considered for both full paper and brief announcement tracks
should indicate this fact on the front page.

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.

SCOPE AND TOPICS: Wireless ad-hoc sensor networks have recently become a
very active research subject due to their high potential of providing
diverse services to numerous important applications, including remote
monitoring and tracking in environmental applications and low maintenance
ambient intelligence in everyday life. The effective and efficient
realization of such large scale, complex ad-hoc networking environments
requires intensive, coordinated technical research and development
efforts, especially in power aware, scalable, robust wireless distributed
protocols, due to the unusual application requirements and the severe
resource constraints of the sensor devices. On the other hand, a solid
foundational background seems necessary for sensor networks to achieve
their full potential. It is a challenge for abstract modeling, algorithmic
design and analysis to achieve provably efficient, scalable and
fault-tolerant realizations of such huge, highly-dynamic, complex,
non-conventional networks. Features including the extremely large number
of sensor devices in the network, the severe power, computing and memory
limitations, their dense, random deployment and frequent failures, pose
new interesting abstract modeling, algorithmic design, analysis and
implementation challenges of great practical impact. ALGOSENSORS aims to
bring together research contributions related to diverse algorithmic and
complexity theoretic aspects of wireless sensor networks.

Starting from 2011, ALGOSENSORS broadens its thematic scope, keeping its
focus on sensor networks, but also including other related types of ad hoc
wireless networks, such as mobile networks, radio networks and distributed
systems of robots.

Contributions solicited cover the algorithmic issues in a variety of
topics including, but not limited to:

- Wireless Network Models
- Virtual Infrastructures
- Data Propagation and Routing
- Multicast and Broadcast
- Obstacle Avoidance
- Infrastructure Discovery
- Ad-hoc Deployment/Topology Control
- Fault Tolerance and Dependability
- Multi-hop Throughput Optimization
- Scheduling and Load Balancing
- Energy Management and Power Saving Schemes
- Dynamic Networks
- Adaptiveness and Self-organization
- Resource-efficient Distributed Computing
- Communication Protocols
- Medium Access Control
- Localization and Location Tracking
- Mobile Robotic Systems and Autonomous Agents
- Game Theoretic Aspects
- Cryptography, Security and Trust

HOW TO SUBMIT: Authors are invited to submit manuscripts reporting
original research in the topics related to the Symposium. The Track the
paper is submitted to should be clearly identified at the front page.
Authors should select a Track based on the type of network that is
studied in the paper or for which the results in the paper are most
relevant. The Program Committee reserves the right to move papers
between Tracks in order to ensure a fair evaluation. Simultaneous
submission to other conferences is not allowed. Papers should
not exceed twelve (12) pages of text using at least 11 point size type,
including references, figures, tables, etc., preferably formatted in the
LNCS style. Additional material may be added in a clearly marked Appendix
to be read at the discretion of the Program Committee Members. Authors
must submit their papers electronically via the website:
http://www.algosensors.org/algosensors11/submission.php. All papers
will be peer reviewed, and comments will be provided to the authors.
Authors need to ensure that for each accepted paper at least one
author will attend the symposium.

**********************************************************
*
* 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, June 17, midnight UTC-11] 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 17 [midnight UTC-11]**

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.

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 17, 2011 [midnight UTC-11]
* Acceptance Notification: July 28, 2011
* Camera Ready: August 15, 2011
* Workshop Dates: 15 - 16 September, 2011

Committees:

 General Chair:

 * Frederic Cuppens (TELECOM Bretagne, FR)

 Program Committee Chairs:

 * Sabrina De Capitani di Vimercati (UNIMI, IT)
 * Joaquin Garcia-Alfaro (TELECOM Bretagne, 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] SOFSEM 2012 - 3rd CALL for PAPERS - deadline extended

CALL for PAPERS

SOFSEM 2012

38th International Conference on Current Trends
in Theory and Practice of Computer Science
January 21-27, 2012
Orea Hotel HORAL (Spindleruv Mlyn)
Czech Republic
http://www.sofsem.cz/

Dear Sofsemists,
dear Colleagues and Friends,

It is our great pleasure to invite you to submit a paper for one of the four
SOFSEM 2012 tracks:

* FOUNDATIONS of COMPUTER SCIENCE
* SOFTWARE and WEB ENGINEERING
* CRYPTOGRAPHY, SECURITY and VERIFICATION
* ARTICIAL INTELLIGENCE;

with extended support for student papers in the traditional

* STUDENT RESEARCH FORUM.

All accepted papers for regular tracks (after registration and payment) will
be included in the conference proceedings published in the Lecture Notes in
Computer Science - LNCS - Series by Springer Verlag.
Student papers accepted for the SOFSEM Student Research Forum (after
registration and payment) will be published in SOFSEM 2012 local
proceedings.

We would especially like to attract your attention to the

SPECIAL EVENT: SESSION on TURING MACHINES.

In memory of Alan Turing, whose 100th anniversary is celebrated in 2012,
SOSFEM 2012 will host a session on Turing machines.
The session will consist of invited and contributed talks on Turing machines
as the basic model of computability and complexity, and reporting new
developments related to models inspired by, for example, biology and
physics.
SOFSEM 2012 is among the official Centenary Events of The Alan Turing Year
(for more details see http://www.turingcentenary.eu/)

We hope that you find the SOFSEM 2012 tracks and topics - for details see

http://www.sofsem.cz/sofsem12/index.php?page=call

interesting,
and that by submitting your paper to the SOFSEM 2012 conference you will
help to contribute to yet another succesfull SOFSEM.

Important dates:
Abstracts deadline: June 22, 2011
Full papers deadline: June 29, 2011
Acceptance notification: September 21, 2011
Camera-ready papers: October 5, 2011
Early registration deadline: November 7, 2011
Conference: January 21-27, 2012

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

As usual at SOFSEM, a very distinguished feature of the SOFSEM 2012 will be
the higher number of Invited Speakers.
The list of SOFSEM 2012 invited speakers:

* Foundations of Computer Science Track:

- Yuri Gurevich (University of Michigan and Microsoft Research, USA)
What's an Algorithm?

- Giuseppe F. Italiano (University of Rome "Tor Vergata", Italy)
[Title to be announced]

SPECIAL EVENT: SESSION ON TURING MACHINES.
- Felipe Cucker (City University of Hong Kong, Hong Kong)
[Title to be announced]

- Peter van Emde Boas (University of Amsterdam, The Netherlands)
Turing Machines for Dummies

- Jiri Wiedermann (Institute of Computer Science, Academy of Sciences, Czech
Republic)
[Title to be announced]

* Software & Web Engineering Track:

- Paul De Bra (Eindhoven University of Technology, The Netherlands)
A Fully Generic Approach for Realizing the Adaptive Web

- Pavel Zezula (Masaryk University in Brno, Czech Republic)
Multi Feature Indexing Network (MUFIN) - Similarity Search Platform for many
Applications

* Cryptography, Security, and Verification Track:

- Orna Kupferman (Hebrew University in Jerusalem, Israel)
Recent Challenges and Ideas in Temporal Synthesis

- Krzysztof Pietrzak (Cryptology Research Group, CWI Amsterdam, The
Netherlands)
Efficient Cryptography from Hard Learning Problems

* Artificial Intelligence

- Kevin Warwick (University of Reading, United Kingdom )
Not Another Look at the Turing Test!

- Roberto Navigli (Sapienza University of Rome, Italy )
[Title to be announced]

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

Location, venue and leisure activities of SOFSEM 2012 are presented at:
http://www.sofsem.cz/sofsem12/index.php?page=location
http://www.sofsem.cz/sofsem12/index.php?page=leisure

As the SOFSEM 2012 organization will progress, the conference website will
be regularly updated to let you know about important news.

We are looking forward to your submissions.

Please do not hesitate to contact us in case you have any questions.

On behalf of all SOFSEM 2012 organizers,

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

[DMANET] Call For Abstracts: ALGORITHMIC ANALYSIS OF BIOLOGICAL DATA

ALGORITHMIC ANALYSIS OF BIOLOGICAL DATA

Satellite Workshop
of the 18th Symposium on String Processing and Information Retrieval (SPIRE)
http://spire2011.isti.cnr.it/

Pisa, Italy
Friday, October 21, 2011

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

This one-day Workshop intends to bring together scientists interested in the design and analysis of
efficient methods and algorithms for processing large-scale biological data. This includes primary
biosequence data (DNA, RNA, proteins) as well as data on protein-DNA or protein-protein interaction,
gene regulation, or all other kinds of 'omics'-data obtained through modern high-throughput genomic
technologies.
The emphasis is put on efficient algorithms and machine-learning methods for processing, storing,
mining and retrieving these data, based on sound formal models.

Authors interested to give a talk at the Workshop are invited to submit an abstract (up to one page) to
http://www.easychair.org/conferences/?conf=waabd11
Along with original research, submissions presenting work-in-progress or surveys are welcome.

Deadline for abstract submissions: July 15, 2011

Workshop participants will be invited to register through the registration procedure of SPIRE
accessible from the SPIRE website. There will be no additional Workshop participation fees for participants
registered for the SPIRE conference. A Workshop-only registration option will also be offered.

Workshop organizers (non-final list):
Concettina Guerra (University of Padova, Italy/Georgia Institute of Technology, USA)
Lucian Ilie (University of Western Ontario, Canada)
Gregory Kucherov (CNRS/Marne-la-Vallée, France)
Marco Pellegrini (Institute for Computational Mathematics, Pisa Italy)
Stéphane Vialette (CNRS/Marne-la-Vallée, France)

**********************************************************
*
* 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] ACM MOBIWAC 2011: Final CFP (2 days to the paper registration deadline)

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

---------------------------------------------------------------------------
"Due to many requests, the deadlines for paper registration and submission
have been extended"
--------------------------------------------------------------------------

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 MOBIWAC series of events are intended to provide an international
forum for the discussion and presentation of original ideas, recent
results and achievements by researchers, students, and systems developers
on issues and challenges related to mobility management and wireless
access protocols.

Authors are encouraged to submit both theoretical and practical results of
significance on all aspects of wireless and mobile access technologies,
with an emphasis on mobility management and wireless access. Authors are
invited to submit full papers describing original research. Submitted
papers must neither have been published elsewhere nor currently be under
review by another conference or journal.

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

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

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

Paper Submission, Publication and Important Dates:

High-quality original papers are solicited. Papers must be unpublished and
must not be submitted for publication elsewhere. All papers will be
reviewed by Technical Program Committee members and other experts active
in the field to ensure high quality and relevance to the Symposium. The
symposium will Have a single track for regular papers and in addition, a
separate interwoven track with short papers / posters. A paper should be
no more than 10 pages, double column, ACM style including tables and
figures. Only PDF format is accepted. All accepted papers will appear in
the Symposium proceedings published by ACM press.

- Paper registration due: June 17, 2011 (11:59PM EST)

- Submission Deadline: June 22, 2011 (11:59PM EST)

- Notification of Acceptance: July 25, 2011

- Camera Ready version due: August 10, 2011

- Speaker Author Registration deadline: September 6, 2011

- Regular Early Registration deadline: September 20, 2011

--
Constantinos Marios Angelopoulos

Phd student
Department of Computer Engineering & Informatics
University of Patras & CTI
**********************************************************
*
* 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-Doc LIP6-IBISC in Paris

* Post-Doc LIP6-IBISC in Paris *

We are seeking for a postdoctoral researcher for the research
project "Time vs. Optimality in Discrete Optimization" (TODO)
funded by the French Science Foundation (ANR).

The objective is the design of efficient algorithms for combinatorial
optimization problems satisfying both running time and precision
requirements.

[for more details on the project see http://todo.lamsade.dauphine.fr/]

* Required skills *:

- Strong analytical background in algorithms and complexity.

- Background in graph and/or scheduling problems.

- Demonstrated research track and the ability to achieve
research results independently.

The successful candidate should have a PhD in computer science,
or discrete mathematics.

Please send your application in a *single* PDF file containing an
academic CV, list of publications, letter of motivation, research
statement, the names of two references, and any other supporting
material no later than

June 25th, 2011

to

Evripidis Bampis (evripidis.bampis@lip6.fr)

and

Eric Angel (Eric.Angel@ibisc.fr)

The project will take place at the laboratory LIP6,
University Pierre et Marie Curie and at the laboratory
IBISC, University of Evry.

* Starting date *: September 2011.

* Duration *: 12 months.

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