Tuesday, January 31, 2012

Permanent Position at IBM TJ Watson Research Center (Algorithms group)

Permanent Position at IBM TJ Watson Research Center (Algorithms group)
Deadline: February 19, 2012
Web: https://jobs3.netmedia1.com/cp/job_summary.jsp?job_id=RES-0362481

We invite applications for a permanent research staff position in the
Algorithms group (http://researcher.ibm.com/researcher/view_pic.php?id=
134)
at IBM TJ Watson Research Center. We do basic research in optimization,
approximation and online algorithms and other areas of theoretical comput
er
science and apply our theoretical ideas to industrial problems. Applicant
s
must have a Ph.D. (or obtain the degree by the time of employment) in
Computer Science or in a closely related field. Complete details are
available at https://jobs3.netmedia1.com/cp/job_summary.jsp?job_id=RES-
0362481

IBM is committed to creating a diverse environment and is proud to be an
equal opportunity employer. All qualified applicants will receive
consideration for employment without regard to race, color, religion,
gender, gender identity or expression, sexual orientation, national origi
n,
genetics, disability, age, or veteran status.

[DMANET] [IEEE AOC 2012] Call for Papers

--------------------------------------------------------------------------------
CALL FOR PAPERS
Sixth IEEE WoWMoM Workshop on
Autonomic and Opportunistic Communications (AOC 2012)
June 25, 2012 - San Francisco, California, USA
http://cnd.iit.cnr.it/aoc2012/

jointly supported by the

SCAMPI project
funded by the FP7-ICT Programme under the
Future Internet Research and Experimentation (FIRE) initiative
http://www.ict-scampi.eu/

and

RECOGNITION project
funded by the FP7-ICT Programme under the
Future and Emerging Technologies (FET) initiative
http://www.recognition-project.eu/


Fast Track on Computer Communication Journal
http://www.elsevier.com/locate/comcom


**** Submission Deadline --- February 17, 2012 ****
--------------------------------------------------------------------------------


The diffusion of lightweight, powerful portable devices, also enriched with a
variety of sensing capabilities, is enabling new ways for users' communication,
and laying the foundation for realizing the ubiquitous networking idea. Acting
either as the main communication mode or as complement to existing mobile
network infrastructures, opportunistic networking can leverage the mobility of
end users and enhance their communication capabilities. The opportunistic
exploitation of extemporary contacts among the users of the network paves the
way to a number of applications but also poses new and challenging problems to
the networking research community. The AOC 2012 workshop aims at serving as a
meeting point for people working in the area and a forum for exchanging ideas,
discussing solutions, and sharing experiences among researchers, professionals,
and application developers, both from industry and academia. As with the
previous five editions of the AOC workshop series, the scope of this year's
workshop will remain on general issues related to opportunistic networking and
computing. Yet, AOC 2012 will have a primary interest in new directions of
opportunistic communications, such as service composition techniques, scenarios
of co-existence with infrastructure networks, and insights to their operation
coming from other disciplines such as game theory and cognitive psychology. The
workshop will solicit original papers addressing theoretical and practical
aspects of autonomic and opportunistic communications but also papers describing
prototype implementations and deployments.


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

* Routing, transport, and reliability issues
* Techniques for data dissemination and replication
* Applications and middleware support, mobile social networking applications
* Mobility models and statistical analysis of mobility traces
* Context and social awareness mechanisms and algorithms
* Co-existence of opportunistic networks with infrastructure mobile wireless
networks
* Service composition in autonomic and opportunistic networks
* Cognition-driven information processing and decision making
* Performance modelling, scaling laws, and fundamental limits for autonomic
and opportunistic communications
* Game-theoretic insights to the operation of autonomic and opportunistic
networks
* Participatory and urban sensing in autonomic and opportunistic networks
* Trust, security, and reputation
* Autonomic and opportunistic communication testbeds and prototypes,
measurement data from real experiments
* Socio-economic models for autonomic and opportunistic communications

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 6 pages,
single spacing, double column, and must strictly adhere to the template
format. Guidelines on paper submission and formatting are available at
http://cnd.iit.cnr.it/aoc2012/.

Accepted papers will appear in the symposium proceedings published by IEEE. At
least one author of each accepted paper is required to register and present
his/her work at the workshop. There will be no separate registration for
workshop, but one single registration will cover both conference and workshops
participation.

Extended versions of workshop selected papers will be considered for possible
fast track publication on the Computer Communications Journal (Elsevier).


IMPORTANT DATES
---------------
Full papers due: February 17, 2012
Notification: April 4, 2012
Workshop: June 25, 2012


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

WORKSHOP Chairs
Merkouris Karaliopoulos, University of Athens, Greece
Chiara Boldrini, IIT-CNR, Italy

STEERING Committee
Marco Conti, IIT-CNR, Italy
Silvia Giordano, SUPSI, Switzerland
Ioannis Stavrakakis, University of Athens, Greece

PUBLICITY Chairs
Fabio Pezzoni, IIT-CNR, Italy
Pushpendra Singh, IIIT Delhi, India


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

Gergely Acs, BUTE, Hungary
Eleonora Borgia, IIT-CNR, Italy
Jian-Nong Cao, Hong Kong Polytechnic University, HK
Vania Conan, Thales, France
Serge Fdida, UPMC, Paris VI, France
Laura Galluccio, University of Catania, Italy
Nidhi Hegde, Technicolor, France
Tristan Henderson, University of St. Andrews, UK
Gunnar Karlsson, KTH, Sweden
Mohan Kumar, University of Texas at Arlington, USA
Kyunghan Lee, North Carolina State University, USA
Franck Legendre, ETH Zurich, Switzerland
Daniele Miorandi, Create-net, Italy
Refik Molva, Eurecom, France
Valtteri Niemi, Nokia, Switzerland
Katia Obraczka, University of California, Santa Cruz, USA
Konstantinos Oikonomou, Ionian University, Greece
Joerg Ott, HUT, Finland
Elena Pagani, Universita' degli Studi di Milano, Italy
Andrea Passarella, IIT-CNR, Italy
Daniele Puccinelli, SUPSI, Switzerland
Christian Rohner, Uppsala University, Sweden
Fabrizio Sestini, EU Commission
Abdullatif Shikfa, Alcatel Lucent Bell Labs, France
Thrasyvoulos Spyropoulos, EURECOM, France
Roger Whitaker, Cardiff University, UK
Hongyi Wu, University of Louisiana at Lafayette, USA
Eiko Yoneki, University of Cambridge, UK
Franco Zambonelli, University of Modena-Reggio, Italy
Xiaolan Zhang, Fordham University, USA

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

Monday, January 30, 2012

Postdoctoral Researcher in Forecasting & Time Series Data Mininig

==============================================
Postdoctoral Researcher
in the
Lancaster Centre for Forecasting

Lancaster University Management School
Department of Management Science
www.lums.lancs.ac.uk/forecasting
==============================================

Salary: £25,251 to £35,938
Closing Date: Monday 12 March 2012
Interview Date: Monday 26 March 2012
Reference: A363

Applications are invited for a two-year post-doctoral position to commence early in 2012, funded by the Lanacster Research Centre for Forecasting.

You should have the potential to develop academic and applied research of international standard; research interest and expertise should include the areas of time series forecasting, and / or time series data mining, either with methods of statistics, econometrics, machine learning or computational intelligence (e.g. artificial Neural Networks, etc), preferably in the context of management science, operational research or operations management. You should have, or almost have, excellent Masters and PhD degrees in management, engineering or computer science (or in a related subject area), with initial publications in preparation for leading scholarly journals. Corporate experience from applied research and consultancy projects is particularly valued. You will also have excellent verbal/written communication skills, a strong quantitative background, and basic computer programming experience (in C#, Matlab, or R etc.).

You would be expected to work approximately two days per week for the forecasting centre under the supervision of Dr Sven F Crone and Prof Robert Fildes, and to engage in joint research with the team in the remainder. You will work with academic colleagues and students whilst developing their research agenda. In addition to all aspects of academic research you will support the Forecasting Centre by engaging in applied forecasting research projects with companies, liaising with external clients, providing support in executive education courses and supporting the above activities through marketing and administration.

If you are selected to go through to the next stage of recruitment you will be asked to provide a complete research proposal in the area of forecasting or data mining on time series data according to the guidelines provided online which can be found at: www.lums.lancs.ac.uk/departments/ManSci/Research/

Enquiries on the research topics should be directed to either: Professor Robert Fildes (Tel: +44 1524 593879) or Dr. Sven F. Crone, Directors, Lancaster Centre for Forecasting, Tel. +44 (0)1524 592991 - Email: r.fildes@lancaster.ac.uk or s.crone@lancaster.ac.uk

Apply Online

Further details:
Job Description http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A262%20JD.pdf
Person Specification http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A363%20PS.pdf
Further Info http://hr-jobs.lancs.ac.uk/Upload/vacancies/files/898/A363%20Additional%20Info.pdf

[DMANET] Invitation to the stream on process industries at EURO XXV conference

Dear Colleague,

You are contacted because you are subscribed to the DMANET mailing list.

Call for Papers (Presentations):

Stream "Emerging Aspects of Production Planning in Continuous Process Industries: Theory, Optimization, and Practice"

25th EURO Conference (EURO XXV),
July 8-11 of 2012, Vilnius, Lithuania

We are organizing a stream of sessions devoted to Emerging Aspects of Production Planning in Continuous Process Industries:
Theory, Optimization, and Practice for the 25th European Conference on Operational Research (EURO XXV) which will be held in Vilnius, Lithuania on 8-11 July, 2012.
The website of the conference is: http://www.euro-2012.lt

Process industries comprise a great variety of economically important products, including, among others, petroleum refinery produces, metals, glass, fiberglass, roofing, ceramic tiles, cement, chemical agents, dyes, paints, drugs, polymers, plastics, fertilizers, paper, soap, food, and beverages.
As demonstrated by the amount of recent contributions to process industry research, this field has gained a remarkable momentum in the last three decades. Since late 1970s, process industries have been facing extended product ranges, reduced delivery times, increased international competition, market saturation, downward price pressures, environmental concerns, rising raw materials and energy costs. Thus, companies in this industrial sector have to constantly improve operational efficiency and profitability to stay in business. This shift also requires well-coordinated round-the-clock operations supported by advanced logistic and information systems to optimize the costs throughout the network.
This stream aims at looking into classification, modeling, solution techniques and implementation, pertaining process industries. Both academics and practitioners are invited to organize, chair and contribute to conference sessions in the stream to initiate a broad discussion, exchange of ideas and active dialogue within the research community on the subject.
If you would like to organize one session consisting of 3-4 talks, please, let us know the title of your session and we will include your session in the abstract submission system. It enables you to conveniently invite people to your session and handle the submissions. By accepting this invitation you agree to be in charge of your session and chair it.

Otherwise, if you just want to contribute and trust on the stream's organizer, then get directly in touch with either the stream organizer or the relevant session chair. You can also submit your contribution to the following general sessions making use of the provided code. Later on, your abstract will be reallocated depending on the final number of accepted contributions.

PLEASE, REMEMBER: Abstracts must be written in English and contain no more than 600 characters (no formulas or mathematical notations are allowed). Each attendee is allowed to present ONE paper at the conference.

Session name and chair: Code:
Modeling Approaches and Solution Algorithms 2bd1eb7b

Professor Christoph Schwindt
Institute of Management and Economics,
Clausthal University of Technology, Germany
Email: christoph.schwindt@tu-clausthal.de

Applications and Decision Support Systems b865fb87

Professor Jim Everett
Centre for Exploration Targeting,
University of Western Australia, Australia
Email: jim.everett@uwa.edu.au

To submit your abstract, the author guidelines can be found at:
http://www.euro-2012.lt/abstract-submission1

Important Dates

Deadline for abstract submission: February 29, 2012
Notification of acceptance: March 31, 2012
Deadline for early registration: April 22, 2012
Deadline for author registration: May 1, 2012
Conference: July 8-11, 2012

Stream Organizer:
Dr. Krystsina Bakhrankova (Krystsina.Bakhrankova@sintef.no), SINTEF Technology and Society,
Applied Economics, Trondheim, Norway
______________________________________________________

Med vennlig hilsen / Best regards
Dr. Krystsina Bakhrankova
Forsker / Research Scientist

SINTEF Teknologi og samfunn / SINTEF Technology and Society
Anvendt økonomi / Department of Applied Economics

Box 4760 Sluppen
NO-7465 Trondheim, Norway

S. P. Andersens veg 5
NO-7031 Trondheim, Norway

Phone: +47 73 59 37 98 (office)
       +47 94 88 23 11 (mobile)

**********************************************************
*
* 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] 2nd CfP EVOLVE 2012 Int. Conf. Aug. 7-9, 2012, Mexico City

Apologies for crosspostings.

=======================================================================
EVOLVE 2012
EVOLVE -- A Bridge Between Probability, Set Oriented Numerics,
and Evolutionary Computation

August 07-09, 2012, Mexico City, Mexico

http://evolve.cinvestav.mx
========================================================================


Scope of the EVOLVE
===================
The massive use and large applicability spectrum of evolutionary
algorithms for real-life applications determined the need of
establishing solid theoretical grounds. Only to offer a few examples,
one may consider mathematical objects that are sometimes difficult and/or
costly to calculate. At the same time, acknowledged new results show that
evolutionary computation can provide in some cases good and fast
estimators of these quantities. Similarly, the handling of large
quantities of data may require the use of distributed environments where
the probability of failure and the stability of the algorithms may need to
be addressed. What is more, common practice confirms in many cases that
theory based results have the advantage of ensuring performance guarantee
factors for evolutionary algorithms in areas as diverse as optimization,
bio-informatics or robotics.

The aim of the EVOLVE is to build a bridge between probability,
statistics, set oriented numerics and evolutionary computing, as to identify
new common and challenging research aspects. The conference is also intended
to foster a growing interest for robust and efficient methods with a sound
theoretical background. EVOLVE is intended to unify theory-inspired
methods and cutting-edge techniques ensuring performance guarantee factors.
By gathering researchers with different backgrounds, ranging from computer
science to mathematics, statistics and physics, to name just a few, a
unified view and vocabulary can emerge where the theoretical advancements may
echo in different domains.

Summarizing, the EVOLVE focuses on challenging aspects arising at the
passage from theory to new paradigms and aims to provide a unified view
while raising questions related to reliability, performance guarantees and
modeling.

Topics:
- Theoretical foundations of evolutionary type algorithms
- Models in biology: branching processes, dynamic population models.
- Stochastic algorithms: simulated annealing, particle models, and
Markov chain Monte Carlo methods, adaptive Monte Carlo, quantum Monte Carlo
methods, MCMC methods, particle methods
- Risk analysis: rare events simulation, sensitivity measures
- Applications: bayesian statistics, large networks analysis, models in
fluid mechanics, financial mathematics, molecular chemistry,
bacteriology, epidemiology
- Set oriented numerics
- Stochastic optimization:
- landscape analysis
- self-tuning and self-adaptive techniques
- single-, multi- and many-objective optimization
- large scale, highly multi-modal or high-dimensional problems
- bio-inspired models : evolutionary programming, swarm intelligence


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

Vo Ba-Ngu, University of Melbourne, Australia

Jose Blanchet, Columbia University, New York, USA

Bernard Cazelles, Ecole Normale Superieure, Paris, France

Carlos A. Coello Coello, CINVESTAV-IPN, Mexico

Josselin Garnier, Universite Paris VII, Paris, France

Pedro Larranaga, Technical University of Madrid, Spain

Tony Lelievre, Ecole des Ponts ParisTech, France

Sylvie Meleard, Ecole Polytechnique, Palaiseau, France

Eric Moulines, Institut Telecom / Telecom ParisTech (ENST), Paris, France

Jian-Qiao Sun, University of California, Merced, USA

Conference Chairs
=================

Oliver Schuetze, CINVESTAV-IPN, Mexico

Alexandru-Adrian Tantar, University of Luxembourg, Luxembourg

Emilia Tantar, University of Luxembourg, Luxembourg

Pascal Bouvry, University of Luxembourg, Luxembourg

Pierre del Moral, INRIA Bordeaux-Sud Ouest, France

Pierrick Legrand, University of Bordeaux 2, France


Publication
===========

The EVOLVE 2012 will accept both full-length papers and extended
abstracts to be presented at the conference. Full length papers will
be published in the Advances in Intelligent and Soft Computing
book series of Springer.
Extended abstracts will be published on CD-ROM (provided with ISSN and
ISBN).
The postproceedings will include extended versions of the best
papers/abstracts presented at the EVOLVE 12 and will appear in the
Studies in Computational Intelligence book series of Springer.

!!! The submission site will open on February 1, 2012 !!!

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

March 09, 2012 Submission of full-length manuscripts

April 09, 2012 Notification of authors (full length manuscripts)

May 04, 2012 Camera ready papers due

May 04, 2012 Submission of abstracts

May 25, 2012 Notification of authors (abstracts)

August 07-09, 2012 Conference dates

Conference Location
===================

The EVOLVE 2012 will be hosted by the Computer Science Department of the
CINVESTAV-IPN which is located in the campus Zacatenco in Mexico City,
Mexico.

Further Information
===================

Details and up-to-date information can be found on the webpage of the
event

http://evolve.cinvestav.mx
**********************************************************
*
* 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/
*
**********************************************************

SWAT 2nd CfP

SECOND CALL FOR PAPERS

*****************************************************************
* *
* 13th Scandinavian Symposium and Workshops *
* on Algorithm Theory *
* *
* (SWAT 2012) *
* *
* Helsinki, Finland *
* July 4-6, 2012 *
* *
* http://swat2012.helsinki.fi/ *
* swat2012@helsinki.fi *
* *
*****************************************************************

*****************************************************************
* *
* Co-located with SWAT 2012 is the 23rd Annual Symposium *
* on Combinatorial Pattern Matching (CPM 2012) *
* Helsinki, Finland, July 3-5, 2012 *
* *
*****************************************************************


AIMS AND SCOPE

The symposium, which alternates with the Algorithms and Data
Structures Symposium (WADS), is a forum for researchers in the
area of design and analysis of algorithms and data structures.
We invite submissions of papers presenting original research on
algorithms and data structures in all areas, including but not
limited to approximation algorithms, parameterized algorithms,
computational biology, computational geometry, distributed
algorithms, external-memory algorithms, exponential algorithms,
graph algorithms, online algorithms, optimization algorithms,
randomized algorithms, streaming algorithms, string algorithms,
sublinear algorithms, and algorithmic game theory.

Contributors must submit their papers using the Easychair system
at << https://www.easychair.org/conferences/?conf=swat2012 >>.
Submissions must be of at most 12 pages using 11 point or larger
font and with reasonable line spacing and margins. Additionally,
a clearly marked appendix may be included; this appendix will
not be regarded as part of the submission and will be considered
only at the discretion of the program committee. Papers submitted
for review should represent original, previously unpublished
work. At the time the paper is submitted to the symposium, and
for the entire review period, the paper (or essentially the same
paper) must not be under review by any other conference with
published proceedings or by a scientific journal. At least one
author of every accepted paper is expected to register and
present the paper at the symposium. Symposium proceedings will
be published in the "Lecture Notes in Computer Science" (LNCS)
series of Springer.


IMPORTANT DATES

*****************************************************************
* *
* Paper submission deadline: February 24, 2012 *
* Notification of acceptance: April 9, 2012 *
* Symposium: July 4-6, 2012 *
* *
*****************************************************************


KEYNOTE SPEAKERS

Joseph S. B. Mitchell, Stony Brook University (SWAT)
Roger Wattenhofer, ETH Zürich (SWAT)
Ron Shamir, Tel Aviv University (CPM)
Gonzalo Navarro, University of Chile, Santiago (CPM)


PROGRAM COMMITTEE

Allan Borodin, University of Toronto
Marek Chrobak, University of California, Riverside
Amin Coja-Oghlan, University of Warwick
Michael Elkin, Ben-Gurion University of the Negev
David Eppstein, University of California, Irvine
Rolf Fagerberg, University of Southern Denmark
Fedor Fomin, University of Bergen (chair)
Dimitris Fotakis, National Technical University of Athens
Fabrizio Grandoni, Università di Roma "Tor Vergata"
Michel Habib, University Paris Diderot
John Iacono, Polytechnic Institute of New York University
Giuseppe F. Italiano, Università di Roma "Tor Vergata"
Petteri Kaski, Aalto University
Andrzej Lingas, Lund University
Daniel Lokshtanov, University of California, San Diego
Andrzej Pelc, Université du Québec en Outaouais
Sofya Raskhodnikova, Pennsylvania State University
Saket Saurabh, Institute of Mathematical Sciences
Christian Sohler, Technische Universität Dortmund
Kavitha Telikepalli, Tata Institute of Fundamental Research
Dimitrios M. Thilikos, National and Kapodistrian University of Athens
Virginia Vassilevska Williams, University of California, Berkeley, and St
anford
Peter Widmayer, ETH Zürich


ORGANIZING COMMITTEE

Petteri Kaski, Aalto University (contact person)
Matti Järvisalo, University of Helsinki
Mikko Koivisto, University of Helsinki
Valentin Polishchuk, University of Helsinki
Jukka Suomela, University of Helsinki
Pekka Orponen, Aalto University
Esko Ukkonen, University of Helsinki


STEERING COMMITTEE

Lars Arge, Aarhus University
Magnús M. Halldórsson, Reykjavík University
Andrzej Lingas, Lund University
Jan Arne Telle, University of Bergen
Esko Ukkonen, University of Helsinki

STACS 2012 call for participation

29th International Symposium on Theoretical Aspects of Computer Science

STACS 2012 - CALL FOR PARTICIPATION

Feb 29th – March 3rd, 2012
Paris, France

http://stacs2012.lip6.fr/

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

REGISTRATION
*******************
early registration before this Friday Feb 3rd 2012.
http://www.congres.upmc.fr/stacs2012/formulaire.html


PROGRAM
*************
https://sites.google.com/site/stacs2012/program

INVITED SPEAKERS
***********************

Martin Dietzfelbinger, Ilmenau, invited talk
Thomas Colcombet, Paris, invited talk
Shafi Goldwasser, MIT, invitated talk
R. Ravi, CMU, tutorial

PROGRAM COMMITTEE
***************************

Vikraman Arvind, Chennai
Manuel Bodirsky, Ecole Polytechnique
Hans Bodlaender, Utrecht
Felix Brandt, Munich
Véronique Bruyère, Mons
Didier Caucal, Marne-la-Vallée
Stéphane Demri, Cachan
Christoph Dürr, Paris (co-chair)
Robert Elsässer, Paderborn
Anupam Gupta, Pittsburgh
Lane A. Hemaspaandra, Rochester
Stephan Kreutzer, Berlin
Orna Kupferman, Jerusalem
Dietrich Kuske, Ilmenau
Seffi Naor, Technion
Monaldo Mastrolilli, Manno-Lugano
Michel de Rougemont, Paris
Michiel Smid, Ottawa
Iain Stewart, Durham
Heribert Vollmer, Hannover
Igor Walukiewicz, Bordeaux
Thomas Wilke, Kiel (co-chair)

[DMANET] STACS 2012 call for participation

29th International Symposium on Theoretical Aspects of Computer Science

STACS 2012 - CALL FOR PARTICIPATION

Feb 29th – March 3rd, 2012
Paris, France

http://stacs2012.lip6.fr/

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

REGISTRATION
*******************
early registration before this Friday Feb 3rd 2012.
http://www.congres.upmc.fr/stacs2012/formulaire.html


PROGRAM
*************
https://sites.google.com/site/stacs2012/program

INVITED SPEAKERS
***********************

Martin Dietzfelbinger, Ilmenau, invited talk
Thomas Colcombet, Paris, invited talk
Shafi Goldwasser, MIT, invitated talk
R. Ravi, CMU, tutorial

PROGRAM COMMITTEE
***************************

Vikraman Arvind, Chennai
Manuel Bodirsky, Ecole Polytechnique
Hans Bodlaender, Utrecht
Felix Brandt, Munich
Véronique Bruyère, Mons
Didier Caucal, Marne-la-Vallée
Stéphane Demri, Cachan
Christoph Dürr, Paris (co-chair)
Robert Elsässer, Paderborn
Anupam Gupta, Pittsburgh
Lane A. Hemaspaandra, Rochester
Stephan Kreutzer, Berlin
Orna Kupferman, Jerusalem
Dietrich Kuske, Ilmenau
Seffi Naor, Technion
Monaldo Mastrolilli, Manno-Lugano
Michel de Rougemont, Paris
Michiel Smid, Ottawa
Iain Stewart, Durham
Heribert Vollmer, Hannover
Igor Walukiewicz, Bordeaux
Thomas Wilke, Kiel (co-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/
*
**********************************************************

WADT 2012: First Call for Papers

(We apologize for multiples copies)

======================================================================
FIRST CALL FOR PAPERS

WADT 2012
21th International Workshop on Algebraic Development Techniques
http://maude.sip.ucm.es/wadt2012
June 7-10, 2012, Salamanca, Spain
======================================================================


AIMS AND SCOPE
The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems).
The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends.

TOPICS OF INTEREST
Typical, but not exclusive topics of interest are:
- Foundations of algebraic specification
- Other approaches to formal specification, including process calculi and models of concurrent, distributed and mobile computing
- Specification languages, methods, and environments
- Semantics of conceptual modelling methods and techniques
- Model-driven development
- Graph transformations, term rewriting and proof systems
- Integration of formal specification techniques
- Formal testing and quality assurance, validation, and verification

WORKSHOP FORMAT AND LOCATION
The workshop will take place over four days, Thursday to Sunday, at Colegio Mayor Arzobispo Fonseca in the center of Salamanca. Presentations will be selected on the basis of submitted abstracts. Three talks will be given by invited speakers.

INVITED SPEAKERS
Francisco Duran. Universidad de Malaga, Spain
Kim G. Larsen. Aalborg University, Denmark
To be announced

IMPORTANT DATES
Submission deadline for abstracts: April 2, 2012
Notification of acceptance: April 20, 2012
Final abstract due: May 18, 2012
Workshop in Salamanca: June 7-10, 2012

SUBMISSIONS
The scientific program of the workshop will include presentations of recent results and ongoing research. The presentations will be selected on the basis of the submitted abstracts according to originality, significance, and general interest.
The abstracts have to be submitted electronically according to the instructions published on the workshop homepage.

PROCEEDINGS
The final versions of the selected abstracts will be included in a flash drive for the workshop participants. After the workshop, selected authors will be invited to submit full papers for the refereed proceedings, which will be published as a volume of Lecture Notes in Computer Science (Springer).

SPONSORSHIP
The workshop takes place under the auspices of IFIP WG 1.3, and is sponsored by IFIP TC1, Universidad Complutense de Madrid, Universidad de Salamanca, Ministerio de Economia y Competitividad, and IMDEA Software.

WADT STEERING COMMITTEE
Michel Bidoit (France)
Andrea Corradini (Italy)
Jose Fiadeiro (UK)
Rolf Hennicker (Germany)
Hans-Jorg Kreowski (Germany)
Till Mossakowski (Germany) [chair]
Fernando Orejas (Spain)
Francesco Parisi-Presicce (Italy)
Grigore Rosu (United States)
Andrzej Tarlecki (Poland)

ORGANIZING COMMITTEE
Narciso Marti Oliet (Spain)
Miguel Palomino Tarjuelo (Spain)
Gustavo Santos Garcia (Spain)

CONTACT INFORMATION
Email: wadt2012 at fdi.ucm.es
Homepage: http://maude.sip.ucm.es/wadt2012

Sunday, January 29, 2012

Call for PRIZE NOMINATION and 2nd CfP SIROCCO 2012

--- Call for PRIZE nominations - Deadline February 28, 2012 ---

(Please note that the deadline for papers for the conference is
different; the prize will be given at the conference this year, in
Iceland!)

Prize for Innovation in Distributed Computing

Awarded by the Colloquium on Structural Information and Communication
Complexity
(SIROCCO)

The Prize for Innovation In Distributed Computing was established
to recognize individuals whose research contributions expanded the
collective investigative horizon in SIROCCO's area of interest. That is,
they formulated new problems, or identified new research areas, that were
at the time of their introduction unorthodox and outside the mainstream,
but later attracted the interest of SIROCCO's community.

This community is interested in the relationships between information and
efficiency in decentralized computing. The prize recognizes originality,
innovation, and creativity -- the qualities that reflect the spirit of
the SIROCCO conference.

The prize is presented at the annual meeting of the SIROCCO conference,
but may not necessarily be awarded every year.

Eligibility

The following conditions must be met by the nominees to be eligible for
the prize.

(1) The original innovative contribution was introduced by the nominee(s)
for the first time in a publication at least five years before the
nomination deadline, and the publication must have appeared in a
conference proceedings or a scientific journal.

(2) At least one paper (co)authored by the nominee(s), either the
original paper, or a paper directly related to the innovative
contribution, must have appeared in SIROCCO proceedings.

Past SIROCCO papers and authors can be found at indexing sites, e.g.
Google Scholar or
http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/index.html.

Selection process

The prize winners are selected by the Award Committee composed of the
current Steering Committee (SC) Chair of the SIROCCO conference,
the PC chairs, including co-chairs, of the three SIROCCO conferences
immediately preceding the nominations deadline, plus one additional
member of the Advisory Board, selected by the Steering Committee for the
current year.

In 2012, the Award Committee consists of:
Shay Kutten (Technion)- chair
Evangelos Kranakis (Carleton)
Boaz Patt-Shamir (Tel Aviv University)
Alexander A. Shvartsman (University of Connecticut)
Masafumi Yamashita (Kyushu University)

A call for nomination is disseminated every year in the main mailing
lists of the Distributed Computing community, at least four months prior
to the date of that year's SIROCCO meeting.

Nominations can be made by any member of the scientific community. Each
nomination must identify the person(s) being nominated, and justify the
nomination by a short text including:

(a) a brief description of the innovative contribution in Distributed
Computing to be recognized by the award, and an explanation of its
originality and significance,

(b) the paper(s) of the nominee(s) that establish their eligibility as
described in the Eligibility section above items (1) and (2).

Nominations for 2012 should be sent to the Steering Committee chair of
SIROCCO: kutten@ie.technion.ac.il by February 28, 2012. Please write
SIROCCO Prize Nomination in the subject line.

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

SIROCCO 2012

19th International Colloquium on Structural Information and
Communication Complexity
June 30 - July 2, Reykjavík, Iceland

http://sites.google.com/site/sirocco2012iceland/

Important dates
Submission deadline: Monday, 27 February, 2012 (23:59 EDT)
Author notification: 31 March, 2012
Camera-ready submission: 21 April, 2012
Conference dates: 30 June - 2 July, 2012

Theme
SIROCCO is devoted to the study of communication and knowledge
in multi-processor systems from both the qualitative and quantitative
viewpoints. Special emphasis is given to innovative approaches and
fundamental understanding, in addition to efforts to optimize current
designs.

Conference
SIROCCO has a tradition of interesting and productive
scientific meetings in a relaxed and pleasant atmosphere, attracting
leading researchers in a variety of fields in which communication and
knowledge play a significant role. This year, SIROCCO is held in
Reykjavík, Iceland.

Scope
Original papers are solicited from all areas of study of local
structural knowledge and global communication and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, communication complexity, fault tolerant graph theories, and
randomized/probabilistic issues in networks. Keeping up with the
tradition of SIROCCO, new areas are always welcome.

SIROCCO Award
The Prize for Innovation in Distributed Computing is awarded annually
in the SIROCCO conference to recognize individuals whose research
contributions had a major impact on the understanding of the
relationships between information and efficiency in decentralized
computing. Only authors of papers that were published in SIROCCO are
eligible to receive the award. More details are available in the
SIROCCO 2012 web site.

Invited talks
To be announced.

Submission
Full papers are to be submitted electronically using the EasyChair server.
The link is https://www.easychair.org/account/signin.cgi?conf=sirocco2012
Submission guidelines are available in the conference web page.

Authors are invited to submit their work in one of the three
acceptable formats: novel research contributions, position papers, and
surveys. Original research papers must contain results that have not
previously appeared and have not been concurrently submitted to a
journal or conference with published proceedings. In all cases, any
partial overlap with any published or concurrently submitted paper
must be clearly indicated.

Submissions are limited to 12 single-column pages on letter/A4-size
paper (using at least 11 point font, 1 inch margins, standard line
spacing). This includes figures, but excludes references and an
optional appendix (to be read at the program committee's discretion).

Publication
As in previous years, the proceedings of SIROCCO 2012 will be published by
Springer-Verlag as a volume of the LNCS series. Information for LNCS
Authors can found here.

Selected papers are planned to be invited to a special issue of the
journal Theoretical Computer Science.

Program Committee:
Dimitris Achlioptas, UCSC
James Aspnes, Yale U.
Nikhil Bansal, TU Eindhoven
Thomas Erlebach, Leicester U.
Guy Even, Tel-Aviv U. (co-chair)
Magnus M. Halldorsson, Reykjavik U. (co-chair)
Fabian Kuhn, USI
Stefano Leonardi, Sapienza U.
Toshimitsu Masuzawa, Osaka U.
Friedhelm Meyer auf der Heide, U. Paderborn
Sriram V. Pemmaraju, U Iowa
Harald Raecke, TU Munich
Ignasi Sau, LIRMM
Thomas Sauerwald, MPI Informatik
Christian Schindelhauer, U. Freiburg
Hadas Shachnai, Technion
Christian Sohler, TU Dortmund
Subhash Suri, UCSB
Philippas Tsigas, Chalmers University of Technology
Shmuel Zaks, Technion

Steering Committee:
Ralf Klasing,CNRS and University of Bordeaux, France
Shay Kutten, Technion, Israel (Chair)
Boaz Patt-Shamir, Tel-Aviv University, Israel
Alex Shvartsman, MIT and Univ. of Connecticut, USA
Masafumi Yamashita, Kyushu University, Japan

Local Arrangement Chair
Magnus M. Halldorsson, Reykjavik U., Iceland

Publicity Chair
Yvonne Anne Pignolet,  ABB Corporate Research

LATA 2012: call for participation

*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject*

 

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

 

6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS

 

LATA 2012

 

A Coruña, Spain

 

March 5-9, 2012

 

http://grammars.grlmc.com/LATA2012/

 

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

 

PROGRAMME

 

Monday, March 5:

 

15:00 - 16:00  Registration

 

16:00 - 16:10  Opening

 

16:10 - 17:10

Bernard Boigelot: Automata-based Symbolic Representations of Polyhedra - Invited Talk

 

17:10 - 17:40  Coffee Break

 

17:40 - 18:30

Eric Rowland and Jeffrey Shallit: k-Automatic Sets of Rational Numbers

 

Daniela Genova: Forbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems

 

Tuesday, March 6:

 

8:30 - 10:00

Gilles Dowek: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (I) - Invited Tutorial

 

10:00 - 10:15  Break

 

10:15 - 11:55

Oscar H. Ibarra and Nicholas Q. Tran: Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines

 

Tang Van Nguyen and Hitoshi Ohsaki: On Model Checking for Visibly Pushdown Automata

 

Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman: The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems

 

Alexander Krassovitskiy and Peter Leupold: Computing by Observing Insertion

 

11:55 - 12:25  Coffee Break

 

12:25 - 14:05

Alexei Miasnikov and Zoran Šunić: Cayley Graph Automatic Groups are not necessarily Cayley Graph Biautomatic

 

Julien Cervelle: Covering Space in the Besicovitch Topology

 

Adam Woryna: Automaton Ranks of some Self-similar Groups

 

Danny Dubé, Mario Latendresse, and Pascal Tesson: Conservative Groupoids Recognize only Regular Languages

 

14:05 - 16:00  Lunch

 

16:00 - 17:40

Max Rabkin: Ogden's Lemma for ET0L Languages

 

Daniel Reidenbach and Markus L. Schmid: Patterns with Bounded Treewidth

 

Mikhail Barash and Alexander Okhotin: Defining Contexts in Context-free Grammars

 

Laura Bozzelli: Strong Termination for Gap-order Constraint Abstractions of Counter Systems

 

17:40 - 17:50  Break

 

17:50 - 18:50

Eugene Asarin: Measuring Information in Timed Languages - Invited Talk

 

Wednesday, March 7:

 

8:30 - 10:00

Gilles Dowek: Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (II) - Invited Tutorial

 

10:00 - 10:15  Break

 

10:15 - 11:55

Dag Hovland: The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints

 

Jean-Marc Champarnaud, Hadrien Jeanne, and Ludovic Mignot: Approximate Regular Expressions and their Derivatives

 

Viliam Geffert, Bruno Guillon, and Giovanni Pighizzini: Two-way Automata Making Choices only at the Endmarkers

 

Holger Bock Axelsen: Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space

 

11:55 - 12:25  Coffee Break

 

12:25 - 14:05

Stefan Hetzl: Applying Tree Languages in Proof Theory

 

Siva Anantharaman, Christopher Bouchard, Paliath Narendran, and Michael Rusinowitch: Unification Modulo Chaining

 

Beate Bollig and Tobias Pröger: An Efficient Implicit OBDD-based Algorithm for Maximal Matchings

 

Travis Gagie, Paweł  Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, and Simon J. Puglisi: A Faster Grammar-based Self-index

 

14:05 - 16:00  Lunch

 

16:00 - 17:40

Tomoyuki Yamakami: One-way Reversible and Quantum Finite Automata with Advice

 

Gabriel Ciobanu and G. Michele Pinna: Catalytic Petri Nets are Turing Complete

 

Ville Salo and Ilkka Törmä: On Stable and Unstable Limit Sets of Finite Families of Cellular Automata

 

Alberto Dennunzio, Enrico Formenti, and Julien Provillard: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata

 

17:45   Visit of the city

 

Thursday, March 8:

 

8:30 - 10:00

Rod Downey: A Parameterized Complexity Tutorial (I) - Invited Tutorial

 

10:00 - 10:15  Break

 

10:15 - 11:55

Adam Roman: P-NP Threshold for Synchronizing Road Coloring

 

Arne Meier, Johannes Schmidt, Michael Thomas, and Heribert Vollmer: On the Parameterized Complexity of Default Logic and Autoepistemic Logic

 

Michal Forišek, Lucia Keller, and Monika Steinová: Advice Complexity of Online Coloring for Paths

 

Mateus de Oliveira Oliveira: Canonizable Partial Order Generators

 

11:55 - 12:25  Coffee Break

 

12:25 - 14:05

Mathilde Noual: Dynamics of Circuits and Intersecting Circuits

 

Norbert Hundeshagen and Friedrich Otto: Characterizing the Rational Functions by Restarting Transducers

 

Ahmet Kara, Thomas Schwentick, and Tony Tan: Feasible Automata for Two-variable Logic with Successor on Data Words

 

Miroslav Klimoš, Kim G. Larsen, Filip Štefaňák, and Jeppe Thaarup: Nash Equilibria in Concurrent Priced Games

 

14:05 - 16:00  Lunch

 

16:00 - 17:15

Ryo Yoshinaka: Integration of the Dual Approaches in the Distributional Learning of Context-free Grammars

 

Ziyuan Gao and Frank Stephan: Learnability of Co-r.e. Classes

 

Michael Geilke and Sandra Zilles: Polynomial-time Algorithms for Learning Typed Pattern Languages

 

17:15 - 17:30  Break

 

17:30 - 18:30

Jack H. Lutz: The Computer Science of DNA Nanotechnology - Invited Talk

 

Friday, March 9:

 

8:30 - 10:00

Rod Downey: A Parameterized Complexity Tutorial (II) - Invited Tutorial

 

10:00 - 10:15  Break

 

10:15 - 11:55

Philip Bille, Inge Li Gørtz, and Jesper Kristensen: Longest Common Extensions via Fingerprinting

 

Vikraman Arvind and Yadu Vasudev: Isomorphism Testing of Boolean Functions Computable by Constant-depth Circuits

 

Đurica Nikolić and Fausto Spoto: Automaton-based Array Initialization Analysis

 

Philip Bille and Morten Stöckel: Fast and Cache-oblivious Dynamic Programming with Local Dependencies

 

11:55   Closing

 

Post-doc on approximability in Stockho

The group on approximation of NP-hard optimization problem
at the Royal Institute of Technology in Stockholm, Sweden
is looking for a postdoc for the academic year 2012/13 with
a possible extension to a second year.

http://www.kth.se/om/work-at-kth/vacancies/postdoctoral-position-in-np-ha
rd-optimization-problems-1.284295?l=en_UK

For some information on the project please consult its web-page


http://www.csc.kth.se/tcs/projects/approx.php

or email research leader, Johan Håstad, at johanh@kth.se.

Deadline for applications is February 15, 2012. Given the late
announcement, late applications might, under some circumstance,
be accept. In such a case please contact Johan Håstad at
above email.

[DMANET] Data Mining in Agriculture

3rd Workshop on Data Mining in Agriculture (DMA'2012)
-----------------------------------------------------

--> co-hosted with ICDM'2012, July 20th, 2012, Berlin, Germany

Data mining, the art and science of intelligent analysis of (usually
large) data sets for meaningful (and previously unknown) insights, is
nowadays actively applied in a wide range of disciplines related to
agriculture. Due to the emerging importance of data mining techniques
and methodologies in the area of agriculture, this workshop aims to
bring together practitioners and researchers in this field. It creates a
community of people who are actively using data mining tools and
techniques and apply them to agriculture data.

The goal of this workshop is to provide a forum for identifying
important contributions and opportunities for research on data mining
and agriculture.

Details about the workshop can be found at: http://www.dma-workshop.de/

We invite original contributions related with both theoretical and
practical aspects of data mining and agriculture.
The list of topics includes, but is not limited to:

- Data Analysis for Site-Specific Management
- Data Mining on Sensor and Spatial Data from Agricultural Applications
- Analysis of Remote Sensor Data
- Feature Selection on Agricultural Data
- Evaluation of Data Mining Experiments
- Spatial Autocorrelation in Agricultural Data
- Information Extraction from Species Databases
- Data-Based Approaches to Tackling Plant Diseases

Workshop papers will be published in the workshop proceedings by IBaI
publishing. PostScript or PDF paper submissions should be formatted
according to Springer LNCS format, with a maximum of 10 pages. Author's
instructions along with LaTeX and Word macro files are available on the
web at Springer.
Papers will be submitted via an on-line reviewing system. The reviewing
system can be found at
http://www.data-mining-forum.de/cms-dma

Important Dates
---------------
Submission Deadline: April 13th, 2012
Notification Date: April 30th, 2012
Camera-Ready Date: May 12th, 2012
Workshop Date: July 20th, 2012
---------------

Workshop Chair:
Georg Ruß, Otto-von-Guericke-Universität Magdeburg, Germany

Organisational Chair:
Maria Patrunky, Universität Leipzig, Germany

Workshop Committee:
Alexander Brenning, University of Waterloo, Waterloo, Canada
Warwick Graco, Australian Taxation Office, Canberra, Australia
Ernesto W. De Luca, TU Berlin, Germany
Gonzalo Pajares Martinsanz, University Complutense of Madrid, Spain
Antonio Mucherino, IRISA, University of Rennes 1, Rennes, France
Allan Tucker, Brunel University, London, UK

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

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

Saturday, January 28, 2012

[DMANET] SWAT 2nd cfp

SWAT 2012
SECOND CALL FOR PAPERS

*****************************************************************
*
* 13th Scandinavian Symposium and Workshops
* on Algorithm Theory
*
* (SWAT 2012)
*
* Helsinki, Finland
* July 4-6, 2012
*
* http://swat2012.helsinki.fi/
* swat2012@helsinki.fi
*
*****************************************************************

*****************************************************************
* *
* Co-located with SWAT 2012 is the 23rd Annual Symposium *
* on Combinatorial Pattern Matching (CPM 2012) *
* Helsinki, Finland, July 3-5, 2012 *
* *
*****************************************************************


AIMS AND SCOPE

The symposium, which alternates with the Algorithms and Data
Structures Symposium (WADS), is a forum for researchers in the
area of design and analysis of algorithms and data structures.
We invite submissions of papers presenting original research on
algorithms and data structures in all areas, including but not
limited to approximation algorithms, parameterized algorithms,
computational biology, computational geometry, distributed
algorithms, external-memory algorithms, exponential algorithms,
graph algorithms, online algorithms, optimization algorithms,
randomized algorithms, streaming algorithms, string algorithms,
sublinear algorithms, and algorithmic game theory.

Contributors must submit their papers using the Easychair system
at << https://www.easychair.org/conferences/?conf=swat2012 >>.
Submissions must be of at most 12 pages using 11 point or larger
font and with reasonable line spacing and margins. Additionally,
a clearly marked appendix may be included; this appendix will
not be regarded as part of the submission and will be considered
only at the discretion of the program committee. Papers submitted
for review should represent original, previously unpublished
work. At the time the paper is submitted to the symposium, and
for the entire review period, the paper (or essentially the same
paper) must not be under review by any other conference with
published proceedings or by a scientific journal. At least one
author of every accepted paper is expected to register and
present the paper at the symposium. Symposium proceedings will
be published in the "Lecture Notes in Computer Science" (LNCS)
series of Springer.


IMPORTANT DATES

*****************************************************************
* *
* Paper submission deadline: February 24, 2012 *
* Notification of acceptance: April 9, 2012 *
* Symposium: July 4-6, 2012 *
* *
*****************************************************************


KEYNOTE SPEAKERS

Joseph S. B. Mitchell, Stony Brook University (SWAT)
Roger Wattenhofer, ETH Zürich (SWAT)
Ron Shamir, Tel Aviv University (CPM)
Gonzalo Navarro, University of Chile, Santiago (CPM)


PROGRAM COMMITTEE

Allan Borodin, University of Toronto
Marek Chrobak, University of California, Riverside
Amin Coja-Oghlan, University of Warwick
Michael Elkin, Ben-Gurion University of the Negev
David Eppstein, University of California, Irvine
Rolf Fagerberg, University of Southern Denmark
Fedor Fomin, University of Bergen (chair)
Dimitris Fotakis, National Technical University of Athens
Fabrizio Grandoni, Università di Roma "Tor Vergata"
Michel Habib, University Paris Diderot
John Iacono, Polytechnic Institute of New York University
Giuseppe F. Italiano, Università di Roma "Tor Vergata"
Petteri Kaski, Aalto University
Andrzej Lingas, Lund University
Daniel Lokshtanov, University of California, San Diego
Andrzej Pelc, Université du Québec en Outaouais
Sofya Raskhodnikova, Pennsylvania State University
Saket Saurabh, Institute of Mathematical Sciences
Christian Sohler, Technische Universität Dortmund
Kavitha Telikepalli, Tata Institute of Fundamental Research
Dimitrios M. Thilikos, National and Kapodistrian University of Athens
Virginia Vassilevska Williams, University of California, Berkeley, and Stanford
Peter Widmayer, ETH Zürich


ORGANIZING COMMITTEE

Petteri Kaski, Aalto University (contact person)
Matti Järvisalo, University of Helsinki
Mikko Koivisto, University of Helsinki
Valentin Polishchuk, University of Helsinki
Jukka Suomela, University of Helsinki
Pekka Orponen, Aalto University
Esko Ukkonen, University of Helsinki


STEERING COMMITTEE

Lars Arge, Aarhus University
Magnús M. Halldórsson, Reykjavík University
Andrzej Lingas, Lund University
Jan Arne Telle, University of Bergen
Esko Ukkonen, University of Helsinki
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CfP - WiNMee 2012 - DEADLINE EXTENDED to 15 February 2012

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

CALL FOR PAPERS

The 8th International Workshop on Wireless Network Measurements (WiNMee)
WiNMee 2012
To be held in conjunction with WiOpt 2012
May 18th, 2012, Paderborn, Germany
http://wi-opt.cs.upb.de/winmee/home.htm

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

IMPORTANT DATES
-------------------------------------------
Submission deadline: February 15, 2012
Notification of acceptance: March 9, 2012
Camera-ready paper due: March 30, 2012
Workshop date: May 18, 2012
-------------------------------------------


The rise in wireless technologies for both local and wide-area networking, such
as ZigBee, Wi-Fi, WiMAX, 3G and LTE, indicates that the Internet is becoming
increasingly wireless. Accurate measurements of practical wireless deployments
are vital for researchers to evaluate the real-world performance of proposed
solutions. In addition to better understanding of systems, experimental wireless
network measurements allow for better analytical and simulation models which are
often limited by simplified protocol and wireless channel models. As a
consequence, the need for experimental wireless network measurements has gained
wide recognition in the wireless networking research community. This workshop
continues the successful WiNMee series, begun at WiOpt in 2005, and is intended
to bring together researchers in the field of experimental wireless networking
and serve as a forum for discussing advances and challenges in experimental
wireless network measurements.

We seek novel papers that advance the understanding of wireless networks through
testbed measurements or field experiments. Topics of interest include, but are
not limited to the following:

- Experimentations and measurements of wireless networks:
* Experience and measurements from building, designing and/or operating
wireless networks (including location and energy consumption)
* Measurement and characterization of mobile network (e.g., traffic, usage
and mobility patterns)
* Experimental validation of network simulation and mobility models in
actual wireless environments
* Measurements-driven models and simulations of wireless networks
operations
* Measurements-based network management and troubleshooting
* Large-scale or federated test-bed measurements
* Home networking measurements
- Techniques for wireless networks measurements:
* Techniques for improving the repeatability of tests, simplifying
experiment setup and reconfiguration
* Techniques for validating the results obtained in wireless testbeds
* Techniques for measuring heterogeneous wireless networks
* Techniques for collecting, archiving, anonymising and sharing wireless
measurement data
* Techniques and experimental results on performance measurements of
cognitive radio systems
* Software tools for building and/or managing wireless test-beds
(e.g., wireless link emulation)
* Spectrum utilization measurements techniques in spectrum sharing and
cognitive radio networks

The workshop seeks novel, previously unpublished papers, which are not currently
under review by another conference or journal. All submissions should be written
in English with a maximum paper length of six printed pages (IEEE conference
double column format, 10pt) including figures without incurring additional page
charges (maximum 1 additional page with over-length page charge if accepted).
The submitted manuscript should include a brief abstract of up to 150 words. The
submission will be handled via EDAS (http://edas.info//N11509). Only PDF files
are acceptable. The accepted papers will be published in the conference
proceedings and will be available via the IEEE Xplore website.

KEYNOTE SPEAKERS:
- Prof. Douglas Leith, Hamilton Institute
- Dr. Nico Bayer, Telekom Innovation Labs


ORGANIZING COMMITTEE:

Workshop Chairs:
- Keivan Navaie (University of LEEDS, UK)
- Cigdem Sengul (Telekom Innovation Labs, Germany)
- Daniele Miorandi (CREATE-NET, Italy)


Publicity Chair:
- Emilio Ancillotti (CNR, Italy)


Web Chair:
- Karina Gomez (CREATE-NET, Italy)


Technical Program Committee:
- Andrzej Duda (Grenoble Institute of Technology)
- Aruna Seneviratne (University of New South Wales)
- Ashutosh Sabharwal (Rice University)
- Christoph Lindemann (University of Leipzig)
- Christoph Mecklenbräuker (Vienna University of Technology)
- Cigdem Sengul (TU-Berlin)
- Daniele Miorandi (Create-Net)
- David Malone (NUI Maynooth)
- Djamal-Eddine Meddour (Orange Labs)
- Emilio Ancillotti (Italian National Research Council)
- Erik Nordström (Princeton University)
- Fabrizio Granelli (University of Trento)
- Georgios Paschos (CERTH - ITI, Center for Research and Technology)
- Henrik Lundgren (Technicolor)
- Iacopo Carreras (Create-Net)
- Ivan Seskar (Rutgers University)
- Kapil Dandekar (Drexel University)
- Karina Gomez (Create-Net)
- Keivan Navaie (University of Leeds)
- Laura Feeney (Swedish Institute of Computer Science)
- Marcelo Dias de Amorim (UPMC Sorbonne Universités)
- Marwan Fayed (University of Stirling)
- Navid Nikaein (Eurecom)
- Patrick Marsch (Nokia Siemens Networks)
- Ramya Raghavendra (IBM Research)
- Timo Ojala (University of Oulu)
- Wei-jen Hsu (University of Florida)


For information: winmee12-chairs@create-net-ml.org

[DMANET] CFP IEEE iThings 2012, Besancon, France, September 11-14, 2012

[Please accept our apologies if you received multiple copies of this call]
[Please circulate this CFP among your colleagues and students.]

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

iThings 2011
The 2012 IEEE International Conference on Internet of Things
Besançon, France, September 11-14, 2012
http://ieee-iot.org/

in conjunction with
CPSCom 2012: The IEEE International Conference on Cyber, Physical, and
Social Computing
GreenCom 2012: The IEEE International Conference on Green Computing and
Communications
----------------------------------------------------------------------------


***************
1.Introduction
***************

TThe Internet of Things (iThings) is a network of Internet-enabled
objects and internet-based services, which aims at increasing the
ubiquity of the Internet by integrating every object/service for
interaction and leads to the highly distributed network of devices
/services communicating with human beings as well as things. Combining
with the infrastructures of the every heterogeneous networks including
Internet and mobile networks, these objects can communicate with humans,
and enable peoples to enjoy their intelligent services anytime, anywhere.

The 2012 IEEE International Conference on Internet of Things
(iThings'12) will provide a high-profile, leading-edge forum for
researchers, engineers, and practitioners to present state-of-art
advances and innovations in theoretical foundations, systems,
infrastructure, tools, testbeds, and applications for the Internet of
Things, as well as to identify emerging research topics and define the
future. iThings'12 is the next edition of the successful series,
previously held as iThings'11 (Dalian, China), IOTS 2010 (Hangzhou,
China), MINES 2009 (Hangzhou, China), and MINES 2008 (Chengdu, China).


**********
2. Topics
**********

The scope of interest includes, but not limited to:

Track 1. Architecture and Infrastructure
Track 2. System Design, Modeling and Evaluation
Track 3. Intelligent Data Processing and Ubiquitous Computing
Track 4. Networks and Communications
Track 5. Scalable distributed sensing and control
Track 6. Reliability, Security, Privacy and Trust
Track 7. Internet of nanothings and nanonetworks
Track 8. Applications, Educations, Business and Social Issues

*****************
3.Important Dates
*****************

Workshop Proposal Deadline: Feb 27, 2012
Paper Submission Deadline: May 15, 2012
Notification of Acceptance: Jun 30, 2012
Camera-Ready Paper Due: Jul 15, 2012

*************************
4.Submission Information
*************************

Authors are invited to submit original papers that MUST NOT have been
submitted to or published in any other workshop, conference, or journal.
Full Papers (up to 10 pages) and Short Papers (up to 4 pages) are
solicited. Detailed submission instructions could be found on the
conference website http://ieee-iot.org. All papers will be reviewed by
the Program Committee for significance, originality, accuracy, and clarity.


**************
5.Publications
**************

Each submission should be regarded as an undertaking that, if the paper
is accepted, at least one of the authors must attend the conference to
present the work in order for the paper to be included in the IEEE
Digital Library. Accepted papers will be published in the proceedings of
iThings 2011 by IEEE Computer Society (EI indexed). Extended versions of
selected papers will be considered for publication in several SCI-index
international journals (check the website for details)


**********************
7.Organizing Committee
**********************

Honorary chairs
Stephen Yau, Arizona State University, US
Ramon Puigjaner, Universitat de les Illes Balears, Spain

General Chairs
Julien Bourgeois, University of Franche-Comté, France
Josep Solé Pareta, Univ. Politecnica de Catalunya, Spain

Program Chairs
Igor Kotenko, SPIIRAS, Russia
Huansheng Ning, Beihang University, China
Françoise Sailhan, CNAM, France

Program Vice-Chairs
Cosimo Anglano, U. del Piemonte Orientale, Italy
Sasitharan Balasubramaniam, WIT, Ireland
Albert Cabellos-Aparicio, Univ. Poli. de Catalunya, Spain
Eugen Dedu, University of Franche-Comté, France
Lu Liu, University of Derby, UK
Etienne Rivière, University of Neuchatel, Switzerland
Nathalie Mitton, INRIA, France
Zheng Yan, XiDian Univ., China / Aalto Univ., Finland

Demo/Exhibition Chair
Benoit Piranda, University of Franche-Comté, France

Publicity Chair
Ruijun He, CRC Press and Taylor & Francis, China

Advisory chair
Mohammad S. Obaidat, Monmouth University, US

Workshop Chairs
Didier El Baz, LAAS/CNRS, France
Hakim Mabed, University of Franche-Comté, France

Steering Chairs
Zhikui Chen, Dalian University of Technology, China
Jianhua Ma (chair), Hosei University, Japan
Feng Xia, Dalian University of Technology, China
Laurence T. Yang (chair), St Francis Xavier University, Canada

Financial Chair
Dominique Dhoutaut, Univ. of Franche-Comté, France

Program Committee
See iThings 2012 website: http://ieee-iot.org

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