Thursday, February 16, 2012

[DMANET] Ph.D. positions in algorithms for wireless networks at Reykjavik University

Two Ph.D. fellowships: "Design of Ad-Hoc Wireless Networks"
School of Computer Science, Reykjavik University

Applications are invited for two Ph.D. fellowships at the School of
Computer Science (SCS), Reykjavik University. The positions are part
of a three-year research project funded by a grant-of-excellence by
the Icelandic Research Fund, under the direction of Magnús M.
Halldórsson.

See http://www.ru.is/~mmh/Ad-Phds.htm for further details.

Aim of the project

The aim of this project is to elucidate fundamental properties of
wireless networks, broadly construed. Our focus is on general provable
properties that hold for arbitrary configurations and are independent
of situation-specific characteristics. We explore realistic models of
interference, with the aim of bridging some of the gap between
theoretical and applied research. We will also investigate practical
protocols to disseminate information in general networks.

Some of the aspects of the projects include:
• Spectrum management, including game theory and spectrum auctions,
and cognitive radio.
• Analysis of increasingly realistic models of wireless communication,
including shadowing and obstacles, mobility, and network coding.
• Installation of a comprehensive wireless testbed, and the
implementation of empirical confirmation studies.
• Resolution of fundamental open questions on wireless scheduling and
capacity, and the design of communication primitives.
• Creating and evaluating protocols for information dissemination in
combined wired and wireless networks.
• Devising practical systems and implementing applications for general networks.

The mode of operation of the project is three-pronged:
• Designing and implementing systems and kernel primitives.
• Conducting empirical studies in a wireless testbed, along with
simulations studies.
• Designing and analyzing algorithms with provable performance bounds.


Research environment

The research group consists of faculty members from three schools at
Reykjavik University and collaborators at TU Aachen and ETH Zurich.
The group includes Ýmir Vigfússon, Henning Úlfarsson and Pradipta
Mitra (SCS), Eyjólfur Ásgeirsson (School of Science and Engineering)
and Sverrir Ólafsson (School of Business and School of Science and
Engineering). The project director is Magnús M. Halldórsson (SCS). Our
primary collaborators are Berthold Vöcking (TU Aachen) and Roger
Wattenhofer (ETH Zurich); we also collaborate with other world-class
researchers in Europe, N-America, and Asia. The research group website
is http://alnet.ru.is/sinr.html.

The successful candidates will benefit from, and contribute to, the
research environment at the Icelandic Centre of Excellence in
Theoretical Computer Science (ICE-TCS). ICE-TCS has currently 14
permanent members, five postdoctoral researchers and three Ph.D.
students. For more information about ICE-TCS, its members and its
activities, seehttp://www.icetcs.ru.is/.

Qualification requirements

Applicants for the Ph.D. fellowships should have a MSc degree in
Computer Science, or closely related fields, and have a solid
background in the analysis of algorithms and a good understanding of
networking. One of the studentships is expected to be
systems-oriented, for which an experience with systems design and
implementation is essential. The other will be focused on algorithmic
analysis, for which mathematical competence is crucial.

Remuneration

Each Ph.D position provides a stipend of 250,000 ISK (roughly 1600€)
per month before taxes, for three years, starting as early as possible
and no later than September 2012.

Application details

By Friday, 29 February 2012, interested applicants should send their
CV, including a list of publications where applicable, as a PDF
document to mmh@ru.is, together with a transcript of their academic
record, a 1-2 page statement outlining their suitability for the
project and the names of two referees who can comment on the research
potential of the candidate.

We will start reviewing applications as soon as they arrive, and will
continue to accept applications until the positions are filled.
However, we strongly encourage interested applicants to send in their
applications as soon as possible.

About the School of Computer Science at Reykjavik University

The School of Computer Science at RU (http://en.ru.is/CS) has
approximately 440 students at the undergraduate, masters and doctorate
levels. The School is home to several strong research groups and the
main research areas are algorithmics, artificial intelligence,
combinatorics, concurrency theory, databases, human-computer
interaction, natural language processing, engineering software
systems, theoretical computer science and virtual environments.

The School of Computer Science at Reykjavik University has ties with
several leading foreign universities, facilitating collaboration, as
well as faculty and student exchanges. In particular, the School has a
joint M.Sc. degree in Computer Science with the University of
Camerino, Italy, and joint Ph.D. degree programs with KTH, Stockholm,
Sweden, and Eindhoven University of Technology, Holland.
Information about Ph.D. studies at the School of Computer Science is
available at http://en.ru.is/departments/school-of-computer-science/ph.d-studies/
**********************************************************
*
* 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/
*
**********************************************************

Announcement: 2nd International SAT/SMT Summer School

[ Apologies for multiple copies ]

-------------------------------------------------------------------------
CALL FOR PARTICIPATION AT THE

Second International SAT/SMT Summer School
Trento, Italy, June 12-15th, 2012
http://satsmtschool2012.fbk.eu/
-------------------------------------------------------------------------

NEWS:

Registration and grant application are now open! The full details are
available at the school website (http://satsmtschool2012.fbk.eu).

Grant application deadline: 15th March 2012
Registration deadline: 6th June 2012


ABOUT:

The SAT/SMT Summer School 2012 (2nd edition) aims at providing graduate
students and researchers from universities and industry with a
comprehensive overview of the research in SAT, SMT, and their
application. The lectures cover the foundational and practical aspects
of SAT and SMT solvers, as well as their application to verification,
planning, scheduling, and optimization problems.

This second edition follows the Summer School of 2011 organized by Vijay
Ganesh at MIT, and is co-located with the SAT 2012 conference. The
school will take place in Trento, Italy, from June 12th to June 15th
2012.

The program will feature four lectures per day, with the first two days
dedicated to SAT and SMT foundations, and the last two to applications
on various domains.

List of speakers:
- Armin Biere (Johannes Kepler University, Linz, Austria)
- Leonardo de Moura (Microsoft Research Redmond, USA)
- Bruno Dutertre (SRI International, USA)
- Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany)
- John Franco (University of Cincinnati, USA)
- Silvio Ghilardi (Università di Milano, Italy)
- Patrice Godefroid (Microsoft Research Redmond, USA)
- Holger Hoos (University of British Columbia, Vancouver, Canada)
- Tomi Janhunen (Aalto University, Finland)
- Pete Manolios (Northeastern University, USA)
- Joao Marques-Silva (University College Dublin, Ireland)
- Ken McMillan (Microsoft Research Redmond, USA)
- Jussi Rintanen (Austrialian National University, Australia)
- Fabio Somenzi (University of Colorado, Boulder, USA)
- Gunnar Stålmarck (Prover Technology and Gain Sweden AB, Sweden)
- Cesare Tinelli (University of Iowa, USA)

A more detailed program is available at the school website
(http://satsmtschool2012.fbk.eu).

The school organizers,
Alberto Griggio <griggio@fbk.eu> and
Stefano Tonetta <tonettas@fbk.eu>

[DMANET] GD 2012: Preliminary Call for Papers

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

Call for Papers

GD 2012
20th International Symposium on Graph Drawing

September 19-21, 2012 - Redmond, Washington, USA

http://www.gd2012.org/
===========================================================================


Graph Drawing is concerned with the visualization of graphs and networks.
It is motivated by those application domains where it is crucial to visually
analyze and interact with relational datasets. Examples of such application
domains include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
software engineering. Bridging the gap between theoretical advances and
system implementations is therefore a key factor of Graph Drawing.

The International Symposium on Graph Drawing is the main annual event in
this area. This year the conference celebrates its 20th anniversary. It
will take place on September 19-21, 2012, and will be hosted by Microsoft
Research in Redmond, Washington, USA. Researchers and practitioners working
on any aspect of graph drawing are invited to contribute papers and posters,
and participate in the graph drawing contest.


PAPERS
------

Submitted papers must describe original research of theoretical or practical
significance to graph drawing. This year, for the first time, the call for
papers is split into two distinct tracks. Each paper must be submitted in one
of the two tracks. Papers submitted to one track will not compete with papers
submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs


Track 2: Visualization systems and interfaces
---------------------------------------------

This track is mainly devoted to practical aspects of graph drawing, such as the
development of graph visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to) the following:
* Visualization of graphs and networks in application areas
(e.g., social sciences, biology, geography, software engineering, circuit
design, business intelligence)
* Software systems for graph visualization
* Interfaces for interacting with graphs
* Benchmarks and experimental analysis for graph visualization systems and
user interfaces
* Cognitive studies on graph drawing readability and user interaction

All papers must be submitted in the single-spaced LNCS style. Each submission
may be either long (up to 12 pages) or short (up to 6 pages). The claims of the
paper should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page limits,
the authors should include it in a clearly marked appendix, whose length is not
constrained.

POSTERS
-------

Submissions of posters on graph drawing and related areas are also solicited.
The poster session will provide a forum for the communication of late-breaking
research results (which may also appear elsewhere) to the graph drawing community.
Posters should be accompanied by an abstract (up to 2 pages in the single-spaced
LNCS style).

CONTEST
-------

Entertainment during the conference will be provided by the graph drawing game
contest. We call for submissions in this contest: Develop a game that is playable,
relevant to graph drawing, and fun. A team of experts will judge the relevance of
the game to graph drawing, while conference attendees, whom we invite to test and
play all games, will judge the fun factor. We will provide further details on the
conference Web site.

PUBLICATION AND AWARDS
----------------------

Accepted papers and abstracts of accepted posters will appear in the conference
proceedings, published by Springer in the series Lecture Notes in Computer Science.
Selected papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications. Best paper awards for each of the two tracks
will be given. Details will be provided on the conference Web site.

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

Paper submission deadline: June 8
Notification of paper acceptance: July 17
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 18
Symposium on Graph Drawing: September 19-21

All deadlines are 23:59 PDT and fixed. There will be no extensions.

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

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

Daniel Archambault, UCD, Dublin
Markus Chimani, Friedrich-Schiller-Univ., Jena
Sabine Cornelsen, University of Konstanz
Walter Didimo (co-chair), University of Perugia
David Eppstein, University of California, Irvine
Jean-Daniel Fekete, INRIA
Emden Gansner, AT&T
Seok-Hee Hong, University of Sydney
Michael Kaufmann, University of Tübingen
Stephen Kobourov, University of Arizona
Jan Kratochvil, Charles University of Prague
Marc van Kreveld, Utrecht University
Anna Lubiw, University of Waterloo
Guy Melançon, Université Bordeaux I
Yoshio Okamoto, JAIST
Maurizio Patrignani (co-chair), Roma Tre University
Nathalie Henry Riche, Microsoft Research
Ioannis G. Tollis, FORTH-ICS and Univ. of Crete
Christian Tominski, University of Rostock
Géza Tóth, Hungarian Academy of Sciences
Jarke J. van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg
Xiaoru Yuan, Peking University

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

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia


SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

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

GD 2012: Preliminary Call for Papers

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

Call for Papers

GD 2012
20th International Symposium on Graph Drawing

September 19-21, 2012 - Redmond, Washington, USA

http://www.gd2012.org/
===========================================================================


Graph Drawing is concerned with the visualization of graphs and networks.
It is motivated by those application domains where it is crucial to visually
analyze and interact with relational datasets. Examples of such application
domains include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
software engineering. Bridging the gap between theoretical advances and
system implementations is therefore a key factor of Graph Drawing.

The International Symposium on Graph Drawing is the main annual event in
this area. This year the conference celebrates its 20th anniversary. It
will take place on September 19-21, 2012, and will be hosted by Microsoft
Research in Redmond, Washington, USA. Researchers and practitioners working
on any aspect of graph drawing are invited to contribute papers and posters,
and participate in the graph drawing contest.


PAPERS
------

Submitted papers must describe original research of theoretical or practical
significance to graph drawing. This year, for the first time, the call for
papers is split into two distinct tracks. Each paper must be submitted in one
of the two tracks. Papers submitted to one track will not compete with papers
submitted to the other track.

Track 1: Combinatorial and algorithmic aspects
----------------------------------------------

This track is mainly devoted to fundamental graph drawing advances, such as
combinatorial aspects and algorithm design. The range of topics for this track
includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms
* Geometric graph theory
* Geometric computing
* Planarity and topological graph theory
* Optimization on graphs


Track 2: Visualization systems and interfaces
---------------------------------------------

This track is mainly devoted to practical aspects of graph drawing, such as the
development of graph visualization systems and interfaces in different
application areas. The range of topics for this track includes (but is not
limited to) the following:
* Visualization of graphs and networks in application areas
(e.g., social sciences, biology, geography, software engineering, circuit
design, business intelligence)
* Software systems for graph visualization
* Interfaces for interacting with graphs
* Benchmarks and experimental analysis for graph visualization systems and
user interfaces
* Cognitive studies on graph drawing readability and user interaction

All papers must be submitted in the single-spaced LNCS style. Each submission
may be either long (up to 12 pages) or short (up to 6 pages). The claims of the
paper should be fully substantiated, including full proofs or appropriate
experimental data. If this information does not fit within the page limits,
the authors should include it in a clearly marked appendix, whose length is not
constrained.

POSTERS
-------

Submissions of posters on graph drawing and related areas are also solicited.
The poster session will provide a forum for the communication of late-breaking
research results (which may also appear elsewhere) to the graph drawing community.
Posters should be accompanied by an abstract (up to 2 pages in the single-spaced
LNCS style).

CONTEST
-------

Entertainment during the conference will be provided by the graph drawing game
contest. We call for submissions in this contest: Develop a game that is playable,
relevant to graph drawing, and fun. A team of experts will judge the relevance of
the game to graph drawing, while conference attendees, whom we invite to test and
play all games, will judge the fun factor. We will provide further details on the
conference Web site.

PUBLICATION AND AWARDS
----------------------

Accepted papers and abstracts of accepted posters will appear in the conference
proceedings, published by Springer in the series Lecture Notes in Computer Science.
Selected papers will be invited for submission to a special issue of the Journal of
Graph Algorithms and Applications. Best paper awards for each of the two tracks
will be given. Details will be provided on the conference Web site.

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

Paper submission deadline: June 8
Notification of paper acceptance: July 17
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 18
Symposium on Graph Drawing: September 19-21

All deadlines are 23:59 PDT and fixed. There will be no extensions.

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

Prosenjit K. Bose, Carleton University
Ben Shneiderman, University of Maryland

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

Daniel Archambault, UCD, Dublin
Markus Chimani, Friedrich-Schiller-Univ., Jena
Sabine Cornelsen, University of Konstanz
Walter Didimo (co-chair), University of Perugia
David Eppstein, University of California, Irvine
Jean-Daniel Fekete, INRIA
Emden Gansner, AT&T
Seok-Hee Hong, University of Sydney
Michael Kaufmann, University of Tübingen
Stephen Kobourov, University of Arizona
Jan Kratochvil, Charles University of Prague
Marc van Kreveld, Utrecht University
Anna Lubiw, University of Waterloo
Guy Melançon, Université Bordeaux I
Yoshio Okamoto, JAIST
Maurizio Patrignani (co-chair), Roma Tre University
Nathalie Henry Riche, Microsoft Research
Ioannis G. Tollis, FORTH-ICS and Univ. of Crete
Christian Tominski, University of Rostock
Géza Tóth, Hungarian Academy of Sciences
Jarke J. van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg
Xiaoru Yuan, Peking University

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

Tim Dwyer, Microsoft Corp
Bongshin Lee, Microsoft Research
Lev Nachmanson (chair), Microsoft Research
Nathalie Henry Riche, Microsoft Research

CONTEST COMMITTEE
-----------------

Christian Duncan, Louisiana Tech University
Carsten Gutwenger (chair), TU Dortmund
Lev Nachmanson, Microsoft Research
Georg Sander, IBM, Frankfurt

PUBLICITY CHAIR
---------------

Emilio Di Giacomo, University of Perugia


SPONSORS
--------

Microsoft

TomSawyer Software

VIS4

yWorks

CFP: 8th Scandinavian Logic Symposium

8th SCANDINAVIAN LOGIC SYMPOSIUM 20-21 August 2012 at Roskilde University, DENMARK

First Announcement and Call for Papers

The 8th Scandinavian Logic Symposium will be held at Roskilde University, Trekroner, Denmark, 20-21 August 2012.

After a gap of fifteen years, the Scandinavian Logic Symposium is back. The
Symposium is the first major initiative of the newly revived Scandinavian Logic Society (SLS,
http://scandinavianlogic.org/) and will be held at Roskilde University (RUC), Denmark.

As with previous editions of this conference, the aim of the programme is to reflect current
activity in logic in our part of the world. So we hope that participants from Scandinavia, the Baltic
countries and Northwestern Russia will take the opportunity to contribute a talk and to meet
with fellow logicians from the area. But needless to say, we also extend a warm welcome to
logicians from further afield and plan to present a varied and interesting collection of invited and
contributed talks.

Related events:

A post-SLS tutorial day will be organized on August 22

Also note that Advances in Modal Logic (AiML) will be held on 22-25
August 2012, Copenhagen, Denmark. URL: http://hylocore.ruc.dk/aiml2012/ .

TOPICS

The scope of SLS 2012 is broad, ranging over the whole area of
mathematical and philosophical logic, and logical methods in computer science. Suitable topics
include (but are not limited to) Proof Theory and Constructivism, Model Theory (including Finite
Model Theory), Set Theory, Computability Theory, Categorical Logic, Logic and Provability,
Logic and Computer Science, Logic and Linguistics, Modal, Hybrid, Temporal and Description
Logic, Logics of Games, Dynamics and Interaction, and Philosophical Logic.

PREVIOUS SCANDINAVIAN LOGIC SYMPOSIA:

7th Scandinavian Logic Symposium: Uppsala in 1996
6th Scandinavian Logic Symposium: Telemark in 1982
5th Scandinavian Logic Symposium: Aalborg in 1979
4th Scandinavian Logic Symposium: Jyväskylä in 1976
3rd Scandinavian Logic Symposium: Uppsala in 1973
2nd Scandinavian Logic Symposium: Oslo in 1971
1st Scandinavian Logic Symposium: Åbo in 1968

The proceedings of several of these meetings have been published in book form.

INVITED SPEAKERS

To be announced

PROGRAM COMMITTEE

Co-chairs: Neil Jones (Copenhagen) and Erik Palmgren (Stockholm)

Members:
Torben Brauner (Roskilde)
Peter Dybjer (Chalmers)
Lars Kristiansen (Oslo)
Øystein Linnebo (Birkbeck)
Sara Negri (Helsinki)
Dag Normann (Oslo)
Asger Törnquist (Vienna)
Jouko Väänänen (Helsinki)

ORGANISING COMMITTEE

Patrick Blackburn (RUC), Klaus Frovin Jørgensen (RUC), Stig Andur Petersen (RUC)

SUBMISSIONS

Abstracts of talks should be submitted by May 1, 2012 using the EasyChair system

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

The abstracts may not exceed 3 pages (including bibliography) and should be in PDF format.

LOCATION

Roskilde University (RUC) is situated at Trekroner, a small town 20 minutes by train from
Central Copenhagen, and five minutes by train from Roskilde.

ACCOMMODATION

Most people who work at RUC and almost all the RUC students live in Copenhagen. Getting
to RUC is an easy train journey from the centre of Copenhagen. We anticipate that most
conference attendees will book hotels in central Copenhagen, where there are many hotels
in many price ranges. Hotel accommodation can also be found in Roskilde, though there the
options are more limited.

REGISTRATION

The conference website will be found at:

http://scandinavianlogic.weebly.com/

Details concerning registration will be posted there in due course.

Wednesday, February 15, 2012

[DMANET] COCOON 2012: Final call for papers

FINAL CALL FOR PAPERS: COCOON 2012

The 18th Annual International Computing and Combinatorics Conference
20-22 August 2012, Sydney, Australia.
http://cocoon.it.usyd.edu.au/
Contact: cocoon2012@it.usyd.edu.au

Original research papers in the areas of algorithms, theory of computation,
computational complexity, and combinatorics related to computing are
solicited. In addition to theoretical results, we are interested in submissions
that report on experimental and applied research of general algorithmic
interest. The conference proceedings will be published by Springer-Verlag
in the Lecture Notes in Computer Science series. Typical, but not exclusive,
topics of interest include:
- Algorithms and Data Structures
- Algorithmic Game Theory
- Approximation and online algorithms
- Automata, Languages, Logic, and Computability
- Combinatorics Related to Algorithms and Complexity
- Complexity Theory
- Computational Learning Theory and Knowledge Discovery
- Cryptography, Reliability and Security, and Database Theory
- Computational Biology and Bioinformatics
- Computational Algebra, Geometry, and Topology
- Graph Drawing and Information Visualization
- Graph Theory, Communication Networks, and Optimization
- Parallel and Distributed Computing

Paper Submission
Contributors are invited to submit a full paper with a maximum of 12 pages in
the Springer LNCS format including title, abstract and references. An appendix,
beyond the 12 pages, may be added and may be read at the reviewers'
discretion. Please format your paper in the Springer Lecture Notes style
according to the LNCS Author Instructions. Submitted papers must describe
work not previously published. They must not be submitted simultaneously to
another conference with refereed proceedings or to a journal. Only electronic
submission (pdf) will be allowed.

Publication
The conference proceedings will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series. After the conference, selected
papers will be published in special issues.

Awards
A best paper award and a best student paper award will be given. A paper is
eligible for the best student paper award if all authors are full-time
students at
the time of submission.

Student grants
There will be a number of student travel awards consisting in free
registration.
These awards will be granted on the merits of the applicants. Priority will be
given to students presenting a paper at the meeting.

Invited Speakers
Kamal Jain
Joseph Mitchell, Stony Brook

Important Dates
Submission deadline February 18, 2012 (by 11:59:59pm CST)
Notification of acceptance April 18, 2012
Final version due May 12, 2012
**********************************************************
*
* 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] Preliminary CFP: SustainIT 2012 - IFIP Conference on Sustainable Internet & ICT for Sustainability

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

PRELIMINARY CALL FOR PAPERS

SustainIT 2012

Second IFIP Conference on
Sustainable Internet and ICT for Sustainability

http://cnd.iit.cnr.it/sustainit2012/

October 4-5, 2012
Pisa, Tuscany, Italy

Sponsored by the IFIP TC6 WG 6.3, Performance of Communication Systems

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

******* SUBMISSION DEADLINE: APRIL 16, 2012 *******

SPECIAL ISSUE of Selected Papers in COMPUTER COMMUNICATIONS
BEST PAPER AWARD

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

In the last years, the increasing social awareness about the need for containing energy consumption within sustainable rates has caught the interest of both the industrial and academic communities. In this scenario, Internet - and more generally ICT - may play a twofold role, being both a significant energy consumer and a potential actor in steering a more clever usage of energy resources.

Both aspects of the problem raise interesting scientific challenges, and require a comprehensive effort and inter-disciplinary research at all levels of abstraction. The goal of this conference is to bring together people from different research areas, and provide a forum to exchange ideas, discuss solutions, and share experiences among researchers, professionals, and application developers both from industry and academia.

Original papers addressing both theoretical and practical aspects of energy-awareness for Internet-based systems, and the design of ICT solutions for eco-sustainability are solicited. Papers of interest should point out the expected long-term benefits to eco-sustainability.

Topics of interest include but are not limited to:

- Green Internet
- Power-aware Internet applications
- Energy-efficient network architecture and protocols
- Green wireless networking
- Energy-efficient network technologies
- Cross-layer optimization for green networking
- Standards and metrics for green communications
- Energy-efficient management of network resources
- Energy efficiency in data centers
- Energy efficiency, Quality of Service, and reliability
- Algorithms for reduced power, energy and heat
- ICT for energy efficiency in buildings
- ICT for sustainable smart cities
- ICT for sustainable transports and logistics
- ICT for green mobility
- ICT for energy efficiency in industrial environments
- ICT for smart grids
- Sustainability achievements due to ICT-based optimization
- Energy consumption measurements, models, and monitoring tools
- Measurement and evaluation of the Internet sustainability
- Test-bed and prototype implementations


EDITORIAL FOLLOW-UP
------------------------------------------------------------------------
The best paper presented at the conference will receive the Best Paper Award. Papers of particular merit will be considered for a SPECIAL ISSUE in the Elsevier Journal of COMPUTER COMMUNICATIONS.


PAPER SUBMISSION
------------------------------------------------------------------------
All submissions must describe original research, not published or currently under review for another workshop, conference, or journal.

Papers must be submitted electronically through EDAS. Detailed submission instructions will be made available at the conference website (http://cnd.iit.cnr.it/sustainit2012/).

*************************************************************************
Submission implies the willingness of, at least, one author to register and attend the conference to present the paper. The organizers reserve the right to exclude a paper from distribution after the conference if the paper is not presented at the conference.

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


TENTATIVE DATES
------------------------------------------------------------------------
- Manuscript submission deadline: April 16, 2012
- Acceptance/Reject notification: June 30, 2012
- Camera Ready Due: July 15, 2012


CONTACTS
------------------------------------------------------------------------
For further information, please visit the conference website (http://cnd.iit.cnr.it/sustainit2012/), or send an e-mail message to <giuseppe.anastasi@iet.unipi.it>


ORGANIZING COMMITTEE
------------------------------------------------------------------------
GENERAL CO-CHAIRS
Marco Conti, IIT-CNR, Italy
Jon Crowcroft, University of Cambridge, UK

PROGRAM CO-CHAIRS
Giuseppe Anastasi, University of Pisa, Italy
Ken Christensen, University of South Florida, USA

DEMO CHAIR
Giuseppe Lo Re, University of Palermo, Italy

Ph.D. FORUM CO-CHAIRS
Franco Davoli, University of Genova, Italy
Brunilde Sanso, Ecole Polytechnique de Montreal, Canada

FINANCE AND REGISTRATION CHAIR
Marco Ortolani, University of Palermo, Italy

PUBLICATION CHAIR
Emilio Ancillotti, IIT-CNR, Italy

PUBLICITY CHAIR
Valerio Arnaboldi, IIT-CNR, Italy
Xuefeng Liu, Honk Kong Polytechnic University, China

WEB MANAGER
Maria Bucci, IIT-CNR, Italy

TECHNICAL PROGRAM COMMITTEE
TBA

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

Valerio Arnaboldi - SustainIT2012 Publicity Chair

Institute for Informatics and Telematics (IIT)
Italian National Research Council (CNR)
Via G. Moruzzi, 1 - 56124 Pisa, Italy
phone: +39 050 315 2195
email: valerio.arnaboldi@iit.cnr.it
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

CFP: TCS 2012

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

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

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

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

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

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

===== Venue =====

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

===== Scope and Topics =====

Algorithms, Complexity and Models of Computation, Logic, Semantics,
Specification and Verification.

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

Rajeev Alur
Yuri Gurevich
Jiri Wiedermann

===== Proceedings =====

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

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

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

===== Organisation =====

General chair:

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

PC co-chairs:

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

PC committee:

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

[DMANET] Open faculty position - Mathematical Optimization - U of Cologne

The University of Cologne- the Mathematical Institute at the Faculty of
Mathematics and
Natural Sciences -- invites applications for a

W3-Professorship in Applied Mathematics

to be filled by April 1, 2013.

In the context of the ongoing coordinated development in applied
mathematics the
Mathematical Institute aims at enhancing its competence in the field of
mathematical
optimization. We are looking for a candidate with outstanding
achievements in a current area
of mathematical optimization and with international reputation. In
addition, applicants are
expected to display a proven openness for interdisciplinary research and
involvement in
cooperative projects. Experience in the acquisition and execution of
third-party funded projects
is desirable.

The successful candidate is expected to participate in the teaching and
administrative duties of
the Institute. Teaching includes courses in the area of optimization and
courses for science
and economics students. In addition, we expect an active commitment to
the programs in
business mathematics.

Applications from disabled persons are welcome. Disabled persons with
equal qualification will
be given priority. Applications from women are expressly welcome. Women
with comparable
qualifications will receive particular consideration, unless another
applicant displays
compelling reasons to prefer this person.

Please send your application (CV, list of publications, teaching
experience, academic
documents, letters of appointment) to the Dean Prof. K. Schneider,
Faculty of Mathematics
and Natural Sciences, University of Cologne, Albertus-Magnus-Platz,
D-50923 Cologne,
Germany. The deadline for application isMarch 31, 2012.

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

Open faculty position - Mathematical Optimization - U of Cologne

The University of Cologne- the Mathematical Institute at the Faculty of Mathematics and
Natural Sciences – invites applications for a

                      W3-Professorship in Applied Mathematics

to be filled by April 1, 2013.

In the context of the ongoing coordinated development in applied mathematics the
Mathematical Institute aims at enhancing its competence in the field of mathematical
optimization. We are looking for a candidate with outstanding achievements in a current area
of mathematical optimization and with international reputation. In addition, applicants are
expected to display a proven openness for interdisciplinary research and involvement in
cooperative projects. Experience in the acquisition and execution of third-party funded projects
is desirable.

The successful candidate is expected to participate in the teaching and administrative duties of
the Institute. Teaching includes courses in the area of optimization and courses for science
and economics students. In addition, we expect an active commitment to the programs in
business mathematics.

Applications from disabled persons are welcome. Disabled persons with equal qualification will
be given priority. Applications from women are expressly welcome. Women with comparable
qualifications will receive particular consideration, unless another applicant displays
compelling reasons to prefer this person.

Please send your application (CV, list of publications, teaching experience, academic
documents, letters of appointment) to the Dean Prof. K. Schneider, Faculty of Mathematics
and Natural Sciences, University of Cologne, Albertus-Magnus-Platz, D-50923 Cologne,
Germany. The deadline for application is March 31, 2012.
 
 

--  ---------------------------------------------------------------------------  Prof. Dr. Rainer Schrader  Institut fuer Informatik                | phone   : [+49] (221) 470-6030  Universitaet zu Koeln                  | fax     : [+49] (221) 470-5160  Weyertal 80                                  | e-mail :  schrader@zpr.uni-koeln.de  D - 50931 Koeln                           | url: http://www.zaik.uni-koeln.de/AFS  --------------------------------------------------------------------------  

[DMANET] CFP - APPROX RANDOM 2012

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


APPROX 2012 and RANDOM 2012

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012
16th Intl. Workshop on Randomization and Computation - RANDOM 2012

http://cui.unige.ch/tcs/random-approx/

Aug. 15-17, 2012

M.I.T.

Call for papers


SCOPE

15th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2012

16th Intl. Workshop on Randomization and Computation - RANDOM 2012

The 15th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2012) and the 16th.
International Workshop on Randomization and Computation (RANDOM'2012)
will be held on 15-17 August 2012 at M.I.T.
APPROX'2012 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2012 focus on
applications of randomness to computational and combinatorial problems.
RANDOM'2012 is the sixteenth workshop in the series; APPROX'2012 is the
fifteenth in the series.

TOPICS

Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:

APPROX

design and analysis of approximation
algorithms
hardness of approximation
small space, sub-linear time, and
streaming algorithms
embeddings and metric space methods
mathematical programming methods
combinatorial problems in graphs and
networks
game theory, markets, and economic
applications
geometric problems
packing, covering, and scheduling
approximate learning
other applications

RANDOM

design and analysis of randomized
algorithms
randomized complexity theory
pseudorandomness and derandomization
random combinatorial structures
random walks/Markov chains
expander graphs and randomness extractors
probabilistic proof systems
random projections and embeddings
error-correcting codes
average-case analysis
property testing
computational learning theory

SUBMISSIONS

Submissions must be received by 17:00pm (EDT) of April 20 at:
http://cui.unige.ch/tcs/random-approx/
in order to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract 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 abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.


PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 20, 2012
Notifications: June 8, 2012
Camera ready: June 18, 2012

PROGRAM COMMITTEES

Approx

Alexandr Andoni (Microsoft Research SVC)
Yossi Azar (Tel-Aviv University)
Shuchi Chawla (University of Wisconsin - Madison)
Anupam Gupta (Carnegie Mellon University, chair)
Sariel Har-Peled (University of Illinois at Urbana-Champaign)
Jochen Koenemann (University of Waterloo)
Amit Kumar (Indian Institute of Technology, Delhi)
Lap Chi Lau (The Chinese University of Hong Kong)
Konstantin Makarychev (IBM Watson)
Monaldo Mastrolilli (IDSIA)
Dana Moshkovitz (MIT)
Rene Sitters (Vrije Universiteit Amsterdam)
David Steurer (Microsoft Research and Cornell)
Kunal Talwar (Microsoft Research SVC)
Jan Vondrak (IBM Almaden)
Lisa Zhang (Alcatel-Lucent Bell Labs)

Random

Eli Ben-Sasson (Technion)
Andrej Bogdanov (Chinese University of Hong Kong)
Mark Braverman (Princeton)
Colin Cooper (King's College, London)
Tobias Friedrich (Saarland University / Max-Planck-Institut)
Tali Kaufman (Bar-Ilan University / Weizmann Institute of Science)
Raghu Meka (Institute for Advanced Study)
Jelani Nelson (Princeton)
Ilan Newman (University of Haifa)
Ryan O'Donnell (Carnegie Mellon University)
Konstantinos Panagiotou (Max-Planck-Institut)
Prasad Raghavendra (Georgia Tech)
Atri Rudra (University at Buffalo, SUNY)
Rocco Servedio (Columbia, chair)
Alistair Sinclair (UC Berkeley)
Emanuele Viola (Northeastern)


PROGRAM CHAIRS

APPROX
Anupam Gupta, Carnegie Mellon University


RANDOM
Rocco Servedio, Columbia University

WORKSHOP CHAIRS

Jose Rolim, U. of Geneva
Klaus Jansen, U. of Kiel

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/


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

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

DICE 2012 - Call for Presentations

===============================================================
CALL FOR ABSTRACTS/PRESENTATIONS
DICE 2012
3rd Workshop on Developments in Implicit Complexity
Tallinn (Estonia), March 31st and April 1st, 2012

(Affiliated with ETAPS 2012)

http://dice2012.cs.unibo.it/
===============================================================

SCOPE

The area of Implicit Computational Complexity (ICC) has grown out
from several proposals to use logic and formal methods to provide
languages for complexity-bounded computation (e.g. polytime or
logspace computation). It aims at studying computational
complexity without referring to external measuring conditions or
a particular machine model, but only by considering language
restrictions or logical principles implying complexity properties.
This workshop focuses on ICC methods related to programs (rather
than descriptive methods). In this approach one relates complexity
classes to restrictions on programming paradigms (functional
programs, lambda calculi, rewriting systems), such as ramified
recurrence, weak polymorphic types, linear logic and linear types,
and interpretative measures. The two main objectives of this area
are:
• to find natural implicit characterizations of various complexity
classes of functions, thereby illuminating their nature and
importance;
• to design methods suitable for static verification of program
complexity.

Therefore ICC is related on the one hand to the study of complexity
classes, and on the other hand to static program analysis. The
workshop will be open to contributions on various aspects of ICC
including (but not exclusively):
• types for controlling complexity,
• logical systems for implicit computational complexity,
• linear logic,
• semantics of complexity-bounded computation,
• rewriting and termination orderings,
• interpretation-based methods for implicit complexity,
• programming languages for complexity-bounded computation,
• certification of complexity properties of programs,
• application of implicit complexity to other programming paradigms
(e.g. imperative or object-oriented languages).

The first two DICE workshops were held in 2010 in Cyprus and in 2011
in Germany, both as part of ETAPS conferences. Before that, several
meetings on this topic had already been held with success in Paris
(WICC 2008), and Marseille (GEOCAL 2006 workshop on Implicit
computational complexity).
_______________________________________________________________

SUBMISSION

Extended abstracts for presentations of up to 3 pages.

The following deadlines are strict:

• Submission (extended abstracts): February 18th, 2012;
• Notification (extended abstracts): February 28th, 2012.

Abstracts must be submitted electronically, as pdf files, at the
following page:
https://www.easychair.org/conferences/?conf=dice2012.
_______________________________________________________________

PROGRAM COMMITTEE

• Guillaume Bonfante (Nancy)
• Ugo Dal Lago (Bologna, chair)
• Marco Gaboardi (Bologna and UPenn)
• Nao Hirokawa (JAIST)
• Martin Hofmann (Munchen)
• Olivier Laurent (ENS Lyon)
• Jean-Yves Moyen (Paris Nord)
• Isabel Oitavem (Lisboa)
• German Puebla (Madrid)
• Simona Ronchi Della Rocca (Torino)
_______________________________________________________________

Tuesday, February 14, 2012

[DMANET] CFP:: ICIA2012- Malaysia- Kuala Terengganu

Apologies in advance for multiple received copies of the CFP.

The International Conference on Informatics & Applications (ICIA2012)
University Sultan Zainal Abidin, Kuala Terengganu, Malaysia
June 3-5, 2012
http://www.sdiwc.net/icia2012/
========================================================================
The proposed conference on the above theme will be held at University
Sultan Zainal Abidin, Kuala Terengganu, Malaysia, From June 3-5, 2012
which aims to enable researchers build connections between different
digital applications.

The conference welcomes papers on the following (but not limited to)
research topics:

- Information Ethics
- Information Content Security
- Data Compression
- E-Technology
- E-Government
- E-Learning
- Cloud Computing
- Grid Computing
- Green Computing
- Access Controls
- Data Mining
- Social Search
- Computer Forensics
- Computer Security
- Peer-to-Peer Social Networks
- Information and Data Management
- Network Security
- Social Networks
- Real-Time Systems
- Internet Modeling
- Assurance of Service
- Image Processing
- Web Services Security
- Multimedia Computing
- Software Engineering
- Biometrics Technologies
- Wireless Communications
- Semantic Web, Ontologies
- Mobile Social Networks
- Distributed and Parallel Applications
- Embedded Systems and Software
- Critical Computing and Storage
- Critical Infrastructure Management
- Soft Computing Techniques
- Confidentiality Protection
- Mobile Networking, Mobility and Nomadicity
- Anti-cyberterrorism
- Ubiquitous Computing, Services and Applications
- Forensics, Recognition Technologies and Applications
- Fuzzy and Neural Network Systems
- Signal Processing, Pattern Recognition and Applications
- User Interfaces,Visualization and Modeling
- Mobile, Ad Hoc and Sensor Network Management
- Web Services Architecture, Modeling and Design
- Quality of Service, Scalability and Performance
- Self-Organizing Networks and Networked Systems
- Computational Intelligence
- Data Management in Mobile Peer-to-Peer Networks
- Data Stream Processing in Mobile/Sensor Networks
- Indexing and Query Processing for Moving Objects
- User Interfaces and Usability Issues form Mobile Applications
- Sensor Networks and Social Sensing
- XML-Based Languages
- Cryptography and Data Protection
- Information Propagation on Social Networks
- Resource and Knowledge Discovery Using Social Networks
- Computer Crime Prevention and Detection


Researchers are encouraged to submit their work electronically. All papers
will be fully refereed by a minimum of two specialized referees. Before
final acceptance, all referees comments must be considered.

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

Submission Date : Apr. 1, 2012
Notification of acceptance: Apr. 15, 2012
Camera Ready submission : May 2, 2012
Registration : May 2, 2012
Conference dates : June 3-5, 2012

**********************************************************
*
* 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 Q2SWinet 2012: Call for Papers

Please accept our apologies if you receive multiple copies of this CFP.

----------------------------------------------------------------------
CALL FOR PAPERS
The 8th ACM* Symposium on QoS and Security for Wireless Mobile Networks
(ACM Q2SWinet 2012)
October 21st-25th, 2012
Paphos, Cyprus
http://cnd.iit.cnr.it/q2swinet2012

Jointly held with the 15th ACM MSWiM 2012 Conference.

* ACM Pending upon Approval

**** Paper Registration Deadline --- May 30th, 2012 ****
----------------------------------------------------------------------

SCOPE AND OVERVIEW
--------------------------------
In recent years, wireless and mobile communication systems have become increasingly popular as an inexpensive and promising means for ubiquitous communications. In this scenario, the QoS provisioning and the management of network security have become crucial tasks to determine the success of future generation wireless mobile networks.This symposium calls for cutting-edge research achievements on the provisioning of QoS and Security in wireless and mobile networks. It also aims at increasing the synergy between academic and industry professionals working in this area.

Authors are encouraged to submit full papers presenting new research related to theory or practice of all aspects of Quality of Service and Security issues in mobile and wireless systems.

Topics of interest for ACM Q2SWinet 2012 include, but are not limited to:

+ Security in Wireless MANETs, VANETs, Sensor, Mesh and PCS Networks
+ Secure PHY, MAC and Routing Protocols
+ Secure Cooperation-Based Systems and Services
+ Security for Cognitive Radio Networks
+ Intrusion Detection in Wireless Ad hoc and Sensor Networks
+ Privacy, anonymity and authentication
+ Trust Establishment
+ Cooperation and Prevention of Non-cooperative Behavior
+ Incentive Aware Secure Protocol Design
+ QoS/QoE for Wireless Multimedia Networks and Systems
+ QoS/QoE for Wireless/Wired Hybrid Systems
+ QoS/QoE support and Mobility Management in Wireless Internet
+ QoS/QoE-Aware Routing for Wireless Networks
+ QoS/QoE Metrics
+ Wireless Network Survivability
+ Wireless Systems Reliability
+ Field operating tests, Performance Modeling and Simulation Techniques
+ Real-time and QoS-aware Wireless Networks

PAPER SUBMISSION AND PUBLICATION
--------------------------------
Papers should neither have been published elsewhere nor being currently under review by another conference or journal. Manuscripts are limited to 10 pages, single spacing, double column, and must strictly adhere to the ACM template format. Guidelines on paper submission and formatting are available at http://cnd.iit.cnr.it/q2swinet2012/.

Submission is managed electronically through EDAS: http://edas.info/N12037

At least one author of each accepted paper must be registered for the symposium, in order for that paper to appear in the ACM proceedings and to be scheduled for presentation. Furthermore, authors of accepted papers must guarantee that their paper will be presented at the Symposium.

IMPORTANT DATES
---------------
Paper registration: May 30th, 2012
Paper submission: June 5th, 2012
Notification: July 15th, 2012
Symposium: October 21st-25th, 2012


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

General Chair
Peter Mueller, IBM Zurich Research Laboratory, Switzerland

Program Committee Chairs
Jalel Ben-Othman, University of Paris 13, France
Raffaele Bruno, IIT, CNR, Italy

Program Committee (tentative)
Nael Abu-Ghazaleh, State University of New York at Binghamton, USA
Gergely Acs, INRIA, Rhone-Alpes, France
Emilio Ancillotti, IIT-CNR, Italy
Regina Araujo, Federal University of Sao Carlos, Brazil
Jalel Ben-othman, University of Versailles, France
Boldizsar Bencsath, Budapest University of Tech. and Economics, Hungary
Luciano Bononi, University of Bologna, Italy
Azzedine Boukerche, University of Ottawa, Canada
Roberto Cascella, INRIA, France
Llorenç Cerdra-Alabern, Universitat Politecnica de Catalunya, Spain
Matteo Cesana, Politecnico di Milano, Italy
Bruno Crispo, University of Trento, Italy
Roberto Di Pietro, Universita' di Roma Tre, Italy
Falko Dressler, University of Erlangen
Rosario Garroppo, University of Pisa, Italy
Fabrizio Granelli, University of Trento, Italy
Stefanos Gritzalis, University of the Aegean, Greece
Dimitrios Koutsonikolas, University at Buffalo, SUNY, USA
Albert Levi, Sabanci University, Turkey
Lynda Mokdad, Université de Paris 12, France
Peter Mueller, IBM Zurich Research Laboratory, Switzerland
Stefano Paris, University of Bergamo, Italy
Mahalingam Ramkumar, Mississippi State University, USA
Peter Reiher, UCLA, USA
Simon Pietro Romano, University of Napoli Federico II, Italy
Susana Sargento, University of Aveiro, Portugal
Ahmed Serhrouchni, ENST, France
Sabrina Sicari, University of Insubria, Italy
Vasilios Siris, Athens University of Economics and Business, Greece
Avinash Srinivasan, George Mason University, USA
Damla Turgut, University of Central Florida, USA
Giacomo Verticale, Politecnico di Milano, Italy
André Zuquete, University of Aveiro, Portugal
Albert Zomaya, The University of Sydney, Australia

Publicity Co-chairs
Victor Govindaswamy, University of Texas at Arlington, USA
Maddalena Nurchis, IIT, CNR, Italy

2nd CfP: ESSLLI 2012 Student Session


** APOLOGIES FOR MULTIPLE POSTINGS**

** PLEASE DISTRIBUTE TO STUDENTS **


Second Call for Papers
ESSLLI 2012 STUDENT SESSION

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

Opole, Poland, August 6-17, 2012

Deadline for submissions: March 20, 2012
http://loriweb.org/ESSLLI2012StuS/

ABOUT:

The Student Session of the 24th European Summer School in Logic, Language, and Information (ESSLLI) will take place in Opole, Poland on August 6-17, 2012. We invite submissions of original, unpublished work from students in any area at the intersection of Logic & Language, Language & Computation, or Logic & Computation. Submissions will be reviewed by several experts in the field, and accepted papers will be presented orally or as posters and will appear in the student session proceedings. This is an excellent opportunity to receive valuable feedback from expert readers and to present your work to a diverse audience.

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

SPRINGER PRIZES FOR BEST PAPER AND BEST POSTER

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

INSTRUCTIONS FOR AUTHORS:

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

There are two types of papers. Long papers of up to 8 pages will be considered for both oral presentation and the poster session. Short papers of up to 4 pages will be considered as submissions for the poster session.

Submissions must be anonymous, without any identifying information, and must be must be received by March 20, 2012.

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

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

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

Kind regards,
The ESSLLI 2012 Students Session Organization Committee,

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

2nd International Conference on Practice and Theory of Algorithms in (Computer) Systems - TAPAS 2012

Subject: Call for Papers TAPAS 2012 From: ICST News <no-reply@icst.org> Reply-To: ICST News <no-reply@icst.org> Content-Type: text/plain; charset="utf8"  ============================================================================ 2nd International Conference on Practice and Theory of Algorithms in  (Computer) Systems - TAPAS 2012 3-5 December 2012 Kibbutz Ein Gedi, Dead Sea, Israel (http://www.ein-gedi.co.il/en/)  http://tapasconference.org/2012/show/home ============================================================================  HIGHLIGHTS  - The event is endorsed by the European Alliance for Innovation, a  leading community-based organisation devoted to the advancement of  innovation in the field of ICT - All accepted papers will be published by Springer and made available  through SpringerLink Digital Library, one of the world's largest  scientific libraries - Proceedings will be submitted for indexing by Google Scholar, ISI, EI  Compendex, Scopus and many more  CALL FOR PAPERS  [Important dates]  Submission deadline: 20 July, 2012 (23:59 EDT) Author notification:  3 Sept, 2012 Camera-ready submission: 17 Sept, 2012 Conference dates: 3-5 December, 2012  [Scope]  In the light of continuously increasing interaction between  communication and computing, there arise a number of interesting, and  difficult algorithmic issues in diverse areas including  coverage,mobility, routing, cooperation, capacity planning, scheduling,  and power control.  The aim of TAPAS is to provide a forum for presentation of original  research in the design, implementation and evaluation of algorithms.  TAPAS is dedicated to the use, design and evaluation of algorithms for  combinatorial optimization problems (either efficient optimal or  efficient approximation algorithms) and to real-world applications,  engineering and experimental analysis of algorithms. It aims, in particular, at fostering the cooperation among researchers  in computer science, networking, discrete mathematics, mathematical  programming and operations research.  [Topics]  The conference will focus on the design, engineering, theoretical and  experimental performance analysis of algorithms for problems arising in  different areas of computation. We invite submissions that present  significant case studies in theoretical and experimental analysis and  evaluation of algorithms with specific areas including communications  networks, combinatorial optimization and approximation, parallel and  distributed computing, computer systems and architecture, economics, game theory, social networks and the world wide web. Novel uses of  discrete algorithms in all disciplines and the evaluation of algorithms  for realistic environments are particularly welcome.  Submitted papers will consider a succinct summary of the problem and of  the results obtained (emphasizing the significance and potential impact  of the research), and a clear comparison with related work, all  accessible to non-specialist readers. The remainder of the extended  abstract should provide sufficient detail to allow the program committee  to evaluate the validity, quality, and relevance of the contribution.  [Publications]  The proceedings will be published by Springer (Lecture Notes in Computer  Science).  [Paper submission]  The maximum length of the paper (excluding the optional appendix) is 12  pages. Proofs and any other material omitted due to space constraints must be  placed in an appendix to be read by the program committee members at  their discretion.  [Conference organising committees]  General Chair: Guy Even, Israel  Local Chair: Gabriel Scalosub, Israel  TPC Co-Chairs: Guy Even, Israel Dror Rawitz, Israel  Program Commitee Members: Hanna Bast, Germany Niv Buchbinder, Israel Matthias Englert, UK Pierre Fraigniaud, France Chien-Chung Huang, Germany Giuseppe Italiano, Italy Ilan Newman, Israel Liam Roditty, Israel Christian Scheideler, Germany Baruch Schieber, USA Tami Tamir, Israel Berthold Voecking, Germany Peter Widmayer, Switzerland Christos Zaroliagis, Greece Anke van Zuylen,  Germany  Publicity Chair: Moti Medina, Israel  Steering Committee: David Peleg, Weizmann Institute, Israel Paul Spirakis, University of Patras, Greece Imrich Chlamtac, University of Trento, Italy Pankaj Agarwal, Duke University, USA Alberto Marchetti-Spaccamela, Sapienza University of Rome, Italy Michael Segal, BGU, Israel Roger Wattenhofer, ETH, Switzerland  Conference Coordinator: Justina Senkus, EAI, Italy 
--

Justina Senkus
Community Development and Events Manager

European Alliance for Innovation

Phone: (+39) 0461 408400 - extension 664
Fax: (+39) 0461 421157
Skype: justina.senkus
http://eai.eu/