Monday, January 31, 2011

Second Call for Papers: MOL 12 Tokyo

--------------------- PLEASE POST ---------------------

Second Call for Papers

12th Meeting on Mathematics of Language

Tokyo, September 5–7, 2011

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

Invited Speakers

• Kit Fine, New York University
• Andreas Maletti, Universität Stuttgart

Background

MOL 12 is the 12th Meeting on the Mathematics of Language, to be held at the National Center of Sciences in Tokyo from September 5 through 7, 2011. MOL meetings are organized biennially by the Association for Mathematics of Language, which is a Special Interest Group of the Association for Computational Linguistics. Previous meetings were held at Bielefeld University (2009), UCLA (2007), the University of Edinburgh (2005), and Indiana University (2003).

Aims and Scope

MOL (Mathematics of Language) is a biennial conference devoted to the mathematical study of languages and linguistics. Contributions to all areas of this field are welcome. The topics within the scope of the conference include, but are by no means limited to:

• complexity and generative capacity of grammar formalisms
• formal analysis of linguistic theories and frameworks
• model-theoretic and proof-theoretic methods in linguistics
• mathematical foundations of statistical and stochastic approaches to language analysis
• formal models of language use and language change

Submission Guideline

We invite submission of original, unpublished papers suitable for 30-minute presentations. Papers should report original work which has not been presented at other conferences with published proceedings. Simultaneous submission to other conferences is allowed, provided that the authors indicate which other conferences the paper is submitted to. A paper is accepted on the condition that it will not be presented at any other venues.

Papers should not exceed 18 pages, including references and appendices (if any), and should be prepared in LaTeX using the Springer LNCS class files available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip.

Papers must be submitted electronically at http://www.easychair.org/conferences/?conf=mol12.

Submissions will be reviewed anonymously by at least three reviewers.

Proceedings

The proceedings will be published by the time of the conference in the FoLLI LNAI subline of the Springer Lecture Notes in Computer Science.

Important Dates

• Deadline for submission: March 22, 2011
• Notification to authors: May 16, 2011
• Deadline for camera-ready copies for the proceedings: June 1, 2011
• Conference: September 5-7, 2011

Program Committee

• Patrick Blackburn
• Alexander Clark
• Philippe de Groote
• Aravind Joshi
• Greg Kobele
• Andras Kornai
• Marcus Kracht (Chair)
• Natasha Kurtonina
• Michael Moortgat
• Larry Moss
• Gerald Penn
• Sylvain Pogodalla
• James Rogers
• Sylvain Salvati
• Hiroyuki Seki
• Ed Stabler
• Hans-Jörg Tiede

Organizing Committee

• Makoto Kanazawa (Chair)
• Ryo Yoshinaka

[DMANET] DEA2011-Call for papers

Dear colleagues,

We would like to invite you to the next conference dedicated to Data
Envelopment Analysis, DEA2011, to be held at the University of
Macedonia, Thessaloniki Greece, August 25-27, 2011.

Paper Submissions:

The deadline for abstract submission is March 31st, 2011. All submissions
should be done online at
http://www.easychair.org/conferences/?conf=dea2011

Theoretical and empirical papers on DEA, efficiency and productivity
analysis or related fields are welcome.

Special Issue:

There will be a Special issue of the Journal of Data Envelopment
Analysis (JDEA), devoted to papers presented at the conference. JDEA
is the official journal of the International Data Envelopment Analysis
Society.

There will also be a panel discussion on 'getting published'. Panelists
will include:

- Rajiv Banker (Editor Journal of Data Envelopment Analysis,
Associate Editor Journal of Productivity Analysis)

- Ali Emrouznejad ( Co- Editor Journal of Data Envelopment
Analysis, Guest Editor Journal of the Operational Research Society)

- Victor Podinovski (Co-Editor Journal of Productivity Analysis,
Guest Editor Journal of the Operational Research Society )

- Emmanuel Thanassoulis (Co-Editor Journal of Data Envelopment
Analysis, Associate Editor Journal of Productivity Analysis and
European Journal of Operational Research.)

Applied Research and Consultancy in DEA

The conference will include a panel session on applied DEA. Panelists
will include:

- Antreas D. Athanassopoulos, Professor, ALBA Graduate School,
Athens, Greece, (applications of DEA in banking and marketing)

- Dr Mike Graveney, Consultant Public Health Physician and
Primary Care R&D Lead for West Midlands (South) Comprehensive Local Research
Network, England (Health services delivery applications)

- Dr Nikolaos Maniadakis, Professor and Department Director,
Health Services Organisation & Management, National School of Public
Health, Athens, Greece (ex- CEO & President of University Hospital of
Heraklion and University Hospital of Patras, Greece), applications in
health technology assessment and economic evaluations and hospital efficiency)

- Joe Paradi, Executive Director and Professor Emeritus,
Centre for Management of Technology and Entrepreneurship, Chair holder in
Information Engineering, Department of Chemical Engineering and Applied
Chemistry, University of Toronto Canada (Applications in banking and
finance)

- Dr Maria Conceicao Portela, Lecturer Catholic University
of Porto, Portugal (Applications in health and education services).

- Emmanuel Thanassoulis, Professor in Management Sciences,
Aston Business School, Aston University, Birmingham, England, (Applications in
economic regulation, health and education services)

Further information:

You can find more information at www.DEAzone.com/DEA2011. All updates
will be available on this site, so please check it regularly. The site
contains information also on the venue city, Thessaloniki close to many
seaside resorts in Greece. Tours pre and post conference as well as social
events will also be available.

BIDS for future DEA conference:

We also highlight a call for BIDS for future DEA conferences. On behalf
of the Scientific Committee we solicit bids for the organisation of any
future DEA conferences (2012/2013/2014). The deadline for submissions
your bid is August 15th, 2011. The selection process of the bid is bound
by the rules governing the international DEA society (iDEAs). For any
further information, please contact a.emrouznejad@aston.ac.uk or
banker@temple.edu. The winning bid will be announced in Thessaloniki.

Please do accept our apologies for any inconvenience caused by cross
postings.

Contact:

DEA2011 organization committee: DEA2011@DEAzone.com


Kind regards,

Professor Emmanuel Thanassoulis

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

Sunday, January 30, 2011

[DMANET] Post-doc on approximability in Stockholm

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 2011/12 with
a possible extension to a second year.

http://www.kth.se/om/work-at-kth/vacancies/postdoctoral-position-in-np-hard-optimization-problems-1.74849?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, 2011.


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

Saturday, January 29, 2011

[DMANET] Call for Workshop Proposals-MSN 2011

Apologies if you receive multiple copies.

Call for Workshop Proposals
International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2011)
Beijing, China, December 16-18, 2011
http://conference.bupt.edu.cn/msn11/

Important Dates
-------------------
Proposal submission deadline: March 10th, 2011
Notification of acceptance: March 30th, 2011

+-------------------------------------------------------------+
MSN is one of the leading international conferences dedicated to
addressing challenges emerging from mobile, wireless and ad hoc
networking and computing. The conference will have many joint
plenary sessions (such as the keynote, panels, and welcoming reception).
MSN 2011 will hold multiple one or half day workshops of the conference
week in Beijing, co-located with the main conference.

We invite you to submit workshop proposals on any topic related
to mobile communications and wireless networking before March 10,
2011 to the Workshop Chairs. The ideal workshop proposal should
focus on a specific area, be of current interest, and be able to
attract a number of high-quality submissions. Proposals on
emerging topics guaranteed to generate significant interest
in the community will be selected. MSN 2011 will have some
returning and some new workshops.

A workshop proposal should be no more than 3 pages, containing at least:
* A draft call for papers (as complete as possible)
* The workshop deadlines (internal and external)
* Names and affiliations of main organizers and tentative
composition of the committees
* Motivation and rationale for the workshop
* Expected number of submissions and participants
* Prior history of this workshop, if any
(including # submissions, # accepted papers and # attendees)
* If the workshop was co-located with another conference, please include
details and a brief description why MSN 2011 is more appropriate.

Email proposals in PDF (ONLY) to workshop co-chairs, including
"MSN 2010 Workshops" in the subject line.

Important workshop dates:
------------------------
Workshop proposals due March 10th, 2011
Notification of Acceptance March 30th, 2011

The final Call for Papers for the accepted workshop should be submitted
by April 10th, 2011 (Workshop Final Call for Papers due).

We look forward to your submissions,


Workshop Co-Chairs:
Jie Li
University of Tsukuba, Japan
lijie@cs.tsukuba.ac.jp

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

Friday, January 28, 2011

MGS 2011

MIDLANDS GRADUATE SCHOOL
in the Foundations of Computing Science

University of Nottingham, 11-15 April 2011
http://www.cs.nott.ac.uk/~vxc/mgs/mgs.html

The Midlands Graduate School (MGS) in the Foundations of Computing
Science is a collaboration between researchers at the Universities of
Birmingham, Leicester, Nottingham and Sheffield. It was established in
1999. The MGS has two main goals: to provide PhD students with a sound
basis for research in the mathematical and practical foundations of
computing and to give PhD students the opportunity to make contact with
established researchers in the field and their peers who are at a
similar stage in their research careers.
This year, the MGS is at the University of Nottingham. It will start on
11 April and finish on 15 April.

This year the school offers the following courses.

Core courses:
"Functional Programming" by Henrik Nilsson
"Category Theory" by Thorsten Altenkirch
"Typed Lambda Calculi" by Andrzej Murawski

Advanced courses:
"Coalgebra" by Paul Blain Levy
"Game Semantics and Applications" by Dan Razvan Ghica
"Game Theory, Topology and Proof Theory for Functional Programming"
by Martín Escardó
"Process Calculi for Protocol Verification" by Eike Ritter
"Mechanized Theorem Proving" by Georg Struth

In addition there will be an invited course given by Professor Andrew M
Pitts.

We invite graduate students in computer science and related fields to
participate. Applicants from industry who want to strengthen their
theoretical background are also welcome. The deadline for registration
is 18 March 2011. More details and information on how to register are on
the school web page.

--
Venanzio Capretta
School of Computer Science
University of Nottingham, UK
http://www.cs.nott.ac.uk/~vxc/

[DMANET] IMACS conference CFP

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the 8th IMACS Conference on Monte Carlo Methods, August 29 â€" September 2, 2011, Borovets, Bulgaria.

The topics of the conference cover both, theoretical developments and application fields.
Stochastic metaheuristics are kind of Monte Carlo Methods for combinatorial and continues optimization. The Stochastic metaheusristic trend of the conference focuses on new theoretical and applied advances in the field of search and optimization. It aims to provide a forum for researchers and developers to exchange the latest experiences and ideas on stochastic metaheuristic methods to cross-fertilize domains like numerical methods, algorithms, software
implementations, computational science, and complex applications.

Works matching this general statement are welcomed, not only in the
mentioned topics but also in other related fields.

The abstracts of all accepted talks will be published in a booklet of abstracts. All participants will obtain their copies of this booklet at registration. The abstract (up to 1 page stating clearly the originality of the results) are to be written in standard LaTeX. It is assumed that one participant will present not more than one talk.

The papers of all talks will be published after a standard referring procedure in the journal
Monte Carlo Methods and Applications or Springer Lecture Notes in Computer Sciences.

Deadlines:
Submission of registration forms and abstracts - May 1, 2011
Notification of acceptance of talks - May 20, 2011
Submission of full papers - September 30, 2011
Notification of acceptance of papers - December 1, 2011
Submission of accommodation forms - May 31, 2011

Information about abstract and paper preparation, accommodation, transportation, registration form and conference location you can find at the conference web page http://parallel.bas.bg/dpa/IMACS_MCM_2011/Important_dates.html

Metaheuristic session organizers
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg), Institute of Information and Communication Technologies (former Institute for Parallel Processing), Bulgarian Academy of Sciences

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

Thursday, January 27, 2011

[DMANET] BCTCS 2011: Call for Participation

Please pass this message to students and colleagues in your departments.

Kind regards,

Achim Jung and Paul Levy.

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

27th British Colloquium for Theoretical Computer Science (BCTCS)


18th to 21st April 2011
University of Birmingham
http://events.cs.bham.ac.uk/BCTCS2011

SCOPE

The purpose of the BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers. The
conference will consist of invited keynote presentations by
distinguished researchers and a number of contributed talks.


LOCATION AND SCHEDULE

BCTCS 2011 will be held at the University of Birmingham, a short train ride
away from the central "New Street Station" which has direct connections from
much of the UK.
Accommodation will be provided by the Etap Hotel in the city centre with easy
access to eateries and other amenities.

The event will start on Monday afternoon and will end with a lunch on
Thursday (the day before Good Friday).


INVITED SPEAKERS

BCTCS 2011 will include invited lectures by the following
distinguished speakers:

* David S. Johnson (AT&T Labs)
* Cliff Jones (Newcastle)
* Prakash Panangaden (McGill)
* Peter Selinger (Dalhousie)
* Nigel Smart (Bristol)
* Carsten Witt (Technical University of Denmark)


CONTRIBUTED TALKS

Participants at the colloquium are encouraged to present a contributed
talk. If you wish to present a contributed talk, please give the title
when you register for the Colloquium. You will be asked to provide an
abstract, using a provided LaTeX template, at a later stage.
The abstracts of accepted contributed talks will be published in the
Bulletin of the European Association for Theoretical Computer Science.


STUDENT GRANTS

The BCTCS steering committee have submitted an application to EPSRC which will,
if successful, provide funding to support the participation of up to 45
graduate students at BCTCS. The grants are intended to cover registration
including accomodation and meals, but not travel. Those enrolled as Ph.D.
students may apply for these grants on the registration form.

While we await a decision from EPSRC we recommend that you register now, as it
will be easy to refund to the card you use for registration if you are awarded
a grant.

REGISTRATION

The registration fee is GBP 290, which includes accommodation (nights of the
18th, 19th, and 20th) and one evening meal. Registration is via the Colloquium
website.

Registration closes on 4 APRIL 2011.

ORGANISATION AND FURTHER INFORMATION

The conference is being organised by Achim Jung, Paul Levy, and Sarah Collins
of the School of Computer Science, University of Birmingham.

More information about the meeting including updates are available
from the conference webpages at: http://events.cs.bham.ac.uk/BCTCS2011

Queries can be sent to: bctcs2011@cs.bham.ac.uk.

We hope to see you there!

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

BCTCS 2011: Call for Participation

Please pass this message to students and colleagues in your departments.

Kind regards,

Achim Jung and Paul Levy.
=======================================================================

27th British Colloquium for Theoretical Computer Science (BCTCS)


18th to 21st April 2011
University of Birmingham
http://events.cs.bham.ac.uk/BCTCS2011

SCOPE

The purpose of the BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers. The
conference will consist of invited keynote presentations by
distinguished researchers and a number of contributed talks.


LOCATION AND SCHEDULE

BCTCS 2011 will be held at the University of Birmingham, a short train ride
away from the central "New Street Station" which has direct connections from
much of the UK.
Accommodation will be provided by the Etap Hotel in the city centre with
easy access to eateries and other amenities.

The event will start on Monday afternoon and will end with a lunch on
Thursday (the day before Good Friday).


INVITED SPEAKERS

BCTCS 2011 will include invited lectures by the following
distinguished speakers:

* David S. Johnson (AT&T Labs)
* Cliff Jones (Newcastle)
* Prakash Panangaden (McGill)
* Peter Selinger (Dalhousie)
* Nigel Smart (Bristol)
* Carsten Witt (Technical University of Denmark)


CONTRIBUTED TALKS

Participants at the colloquium are encouraged to present a contributed
talk. If you wish to present a contributed talk, please give the title
when you register for the Colloquium. You will be asked to provide an
abstract, using a provided LaTeX template, at a later stage.
The abstracts of accepted contributed talks will be published in the
Bulletin of the European Association for Theoretical Computer Science.


STUDENT GRANTS

The BCTCS steering committee have submitted an application to EPSRC which
will, if successful, provide funding to support the participation of up to
45 graduate students at BCTCS. The grants are intended to cover registration
including accomodation and meals, but not travel. Those enrolled as Ph.D.
students may apply for these grants on the registration form.

While we await a decision from EPSRC we recommend that you register now,
as it will be easy to refund to the card you use for registration if you
are awarded a grant.

REGISTRATION

The registration fee is GBP 290, which includes accommodation (nights of the
18th, 19th, and 20th) and one evening meal. Registration is via the
Colloquium website.

Registration closes on 4 APRIL 2011.

ORGANISATION AND FURTHER INFORMATION

The conference is being organised by Achim Jung, Paul Levy, and Sarah
Collins of the School of Computer Science, University of Birmingham.

More information about the meeting including updates are available
from the conference webpages at: http://events.cs.bham.ac.uk/BCTCS2011

Queries can be sent to: bctcs2011@cs.bham.ac.uk.

We hope to see you there!

PSI'11: Deadline extended

--- Extended deadline: February 15, 2011, 23:59h (Western American time)
--- Abstract Submission: February 7, 2011


<our apologies for cross-posting>


**************************************************************************
Final Call for Papers
ERSHOV INFORMATICS CONFERENCE (PSI'11)
27 June - 1 July, 2011, Novosibirsk, Akademgorodok, Russia
http://psi.nsc.ru

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

[AIMS AND SCOPE]

The Ershov Informatics Conference (the PSI Conference Series, the 8th
edition) is the premier international forum in Russia for research and
its applications in computer, software and information sciences. The
conference brings together academic and industrial researchers, developers
and users to present and discuss the most recent innovations, trends,
experiences and concerns in the conference area.

[ORGANIZERS]

- A.P. Ershov Institute of Informatics Systems, Siberian Branch of RAS
- Novosibirsk State University

[CONFERENCE CHAIR]

Alexander Marchuk
A.P. Ershov Institute of Informatics Systems &
Novosibirsk State University, Novosibirsk, Russia

[STEERING COMMITTEE]

Dines Bjorner
Technical University of Denmark, Denmark

Manfred Broy
Institut fuer Informatik, Technische Universitaet Muenchen, Germany

Victor Ivannikov
Institute for System Programming RAS, Moscow, Russia

Bertrand Meyer
ETH Zurich, Switzerland, and Eiffel Software, USA

Leonid Libkin
University of Edinburgh, UK

[HONORARY MEMBER]

Tony Hoare
Microsoft Research, Cambridge, UK

[PROGRAMME COMMITTEE CHAIRS]

Edmund Clarke
Carnegie Mellon University, Pittsburgh, USA

Irina Virbitskaite
A.P. Ershov Institute of Informatics Systems & Novosibirsk State
University, Novosibirsk, Russia

Andrei Voronkov
The University of Manchester, UK

[CONFERENCE SECRETARY]

Natalia Cheremnykh
A.P. Ershov Institute of Informatics Systems, Novosibirsk, Russia
6, Acad. Lavrentiev av.
630090 Novosibirsk, Russia
tel.: +7 383 3307352
fax: +7 383 3323494
e-mail: psi2011@iis.nsk.su, cher@iis.nsk.su

[CONFERENCE TOPICS]

1. Foundations of Program and System Development and Analysis

- specification, validation, and verification techniques,
- program analysis, transformation and synthesis,
- semantics, logic and formal models of programs,
- partial evaluation, mixed computation, abstract interpretation,
compiler construction,
- theorem proving and model checking,
- concurrency theory,
- modeling and analysis of real-time and hybrid systems,
- computer models and algorithms for bioinformatics.

2. Programming Methodology and Software Engineering

- object-oriented, aspect-oriented, component-based and generic
programming,
- programming by contract,
- program and system construction for parallel and distributed computing,
- constraint programming,
- multi-agent technology,
- system re-engineering and reuse,
- integrated programming environments,
- software architectures,
- software development and testing,
- model-driven system/software development,
- agile software development,
- software engineering methods and tools,
- program understanding and visualization.

3. Information Technologies

- data models,
- database and information systems,
- knowledge-based systems and knowledge engineering,
- bioinformatics engineering,
- ontologies and semantic Web,
- digital libraries, collections and archives, Web publishing,
- peer-to-peer data management.

In addition to papers in the above list of topics, papers both bridging
the gap between different directions and promoting mutual understanding of
researchers are welcome. Papers defining the general prospects in
computer, software and information sciences are also encouraged.

[CONFIRMED INVITED SPEAKERS]

Eike Best
Peter Buneman
Rupak Majumdar
Ugo Montanari
Joseph Sifakis

[SUBMISSIONS]

There are three categories of submissions:

- regular papers describing fully developed work and complete results
(12 pages / 30 minute talks);

- short papers reporting on interesting work in progress and/or
preliminary results (7 pages / 15 minute talks);

- system and experimental papers describing implementation or evaluation
of experimental systems and containing a link to a working system
(4 pages / 10 minute presentation).

Submissions should:

- contain original contributions that have not been published or submitted
to other conferences/journals in parallel with this conference;

- clearly state the problem being addressed, the goal of the work,
the results achieved, and the relation to other works;

- be in PS or PDF and formatted according to Springer LNCS Instructions
for authors: http://www.springeronline.com;

- be in English and in a form that can be immediately included in the
proceedings without major revision;

- be attached (if necessary) by an appendix that contains proofs etc.
However, the paper must be self-contained without the appendix in that
reviewers may not read the appendix;

- be sent electronically (as a PostScript or PDF file) through the
submissions link to the conference website:
http://www.easychair.org/conferences/?conf=psi11 not later than
February 15, 2011.

Submitted regular papers that are judged to have limited merit may be
accepted as short papers, with up to seven pages in the proceedings.
At the time of submission, authors should indicate if they wish to have
their submission considered as a short paper in the case it is not
accepted as a regular one.

At least one author of each accepted paper must register, attend the
conference and present the paper.

[CONFERENCE PROCEEDINGS]

A preliminary book of tutorial, invited and accepted contributions will be
handed out at the conference. The final versions of the invited, regular
and short papers presented at the conference will be published by
Springer-Verlag in the Lecture Notes in Computer Science series after the
conference. One can find the proceedings of the previous six conferences
in LNCS, Vol. 1181, 1755, 2244, 2890, 4378 and 5947, respectively.

[LOCATION]

The conference will be held in Akademgorodok which is located in a
picturesque place near the Ob lake, 30 km South from Novosibirsk, the
largest city of Siberia. Silence, beautiful landscape, and pure air are
the factors promoting scientific activity and creativity during the
conference.

[TRAVELLING]

You can fly to Novosibirsk via Moscow by Aeroflot, Transaero or S7.
Direct S7 flights will bring you from Frankfurt, Hannover, Seoul or
Beijing to Novosibirsk and back. Now you can buy electronic tickets on
Aeroflot, S7 and Transaero flights via the websites and pay by VISA and
other popular cards. All participants will be met at the Novosibirsk
airport and brought to Akademgorodok by a special transport.

[WEATHER]

The weather in Novosibirsk at the end of June is normally quite warm and
sunny with the temperatures in the range of 25-30 C.

[SATELLITE WORKSHOPS]

N.B. Three satellite workshops will be held in conjunction with PSI'11:

- Program Understanding,
- Educational Informatics,
- Science Intensive Applied Software.

[IMPORTANT DATES]

February 7, 2011: abstract submission

February 15, 2011: submission deadline

April 2, 2011: notification of acceptance

June 27 - July 1, 2011: the conference dates

September 1, 2011: camera ready papers due


See for more information http://psi.nsc.ru

[DMANET] Physics & Computation 2011 - Second Call for Papers & Posters

PHYSICS & COMPUTATION 2011
Co-located Workshop with Unconventional Computation 2011
June 6-10, Turku, Finland
UC2011 Main Site: http://www.math.utu.fi/projects/uc2011/

Papers and posters are solicited on the relationships between Physics and
Computation.

KEY DATES
Paper submission deadline: 28 Feb 2011
Paper authors notified: 1 Apr 2011
Final versions due: 18 Apr 2011
Poster submission deadline: 18 Apr 2011
Poster authors notified: 25 Apr 2011
Early registration ends: 2 May 2011

PUBLICATION
Accepted papers will be published in the first instance in electronic form
as a Workshop pre-proceedings. As in previous years, authors will be invited,
following the Workshop, to submit finalised versions of their work for
journal publication.

Submissions should be submitted electronically via EasyChair, in PDF format:

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

Papers should initially be no more than 12 sides in length (excluding
bibliography), and should be formatted for A4 paper.

TOPICS INCLUDE (but are not restricted to)
* analogue computation
* axiomatization of physics: completeness, decidability, reduction
* digital physics
* optical computation
* philosophy of physics and computation
* quantum computation (digital, analogue) and its applications (biology,
mathematics, etc.)
* quantum logics
* quantum randomness
* reaction-diffusion models of computation: including brain dynamics, BZ
computers
* relativity: spacetimes, computation, time travel, speedup
* theory of measurement: axiomatization, complexity
* wormhole computation

PROGRAMME COMMITTEE
Alastair Abbott (Auckland)
Andy Adamatzky (Bristol)
Hajnal Andréka (Budapest)
Olivier Bournez (Ecole Polytechnique)
Adán Cabello (Seville)
Cristian Calude (Auckland)
Shlomi Dolev (Ben Gurion)
Elham Kashefi (Edinburgh)
Viv Kendon (Leeds)
Giuseppe Longo (Paris)
Kenichi Morita (Hiroshima)
Ferdinand Peper (NiCT)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Mike Stay (Auckland/Google)
Susan Stepney (York)
Damien Woods (CalTech)
Paolo Zuliani (Carnegie Mellon)

ORGANISING COMMITTEE
Hajnal Andréka (Budapest)
Cristian Calude (Auckland)
Ion Petre (Turku)
Mike Stannett (Sheffield)
Susan Stepney (York)

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

The Fourth Israel CS Theory Day at the Open University

Hello,
The Fourth Israel CS Theory Day at the Open University will take place on
March 24th.
The speakers this year are Amihood Amir, Laci Babai, Irit Dinur, Adi
Shamir, Micha Sharir, and Raphy Yuster.
For details and pre-registration: http://www.openu.ac.il/theoryday2011/
Lehitraot!
The computer science division at the Open University

[DMANET] ISSAC 2011 - Call for Posters

Please distribute (apologies for multiple postings):
===================================================

ISSAC 2011
Call for Posters

International Symposium on Symbolic and Algebraic Computation
San Jose, California, June 8-11, 2011
http://www.issac-conference.org/2011/

Member of ACM Federated Computing Research Conference
http://acm.org/fcrc/

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

The International Symposium on Symbolic and Algebraic Computation
(ISSAC) is the premier conference for research in symbolic computation
and computer algebra. ISSAC 2011 is the 36th meeting in the series,
started in 1966 and held annually since 1981, in North America, Europe
and Asia. The conference presents a range of invited speakers,
tutorials, poster sessions, software demonstrations and vendor
exhibits with a centerpiece of contributed research papers.

ISSAC 2011 is affiliated with the 2011 International Workshop on
Symbolic Numeric Computation (SNC 2011) which will be held on June
7--9, 2011 as another member of the ACM FCRC.

The poster sessions at ISSAC offer a forum for researchers to present
early research results that are of interest but not yet completed. Also
posters reporting on recent work published or accepted or submitted
elsewhere are welcome. We invite authors to submit an extended abstract
in PDF format of no more than 2 pages. The abstracts will be reviewed
by the poster committee and relevant experts when needed. The review
criteria are: content, originality, style and relevance. The accepted
poster abstracts will be printed and distributed at the conference as
well as published in an upcoming issue of the ACM SIGSAM Communications
in Computer Algebra.


Important Dates

Abstract submission deadline: Friday, March 25
Notification of acceptance/rejection: Friday, April 08
Final version due: Friday, April 29


Submission Instructions

Abstracts must not exceed 2 pages in the style of Communications in
Computer Algebra (see http://www.sigsam.org/cca/ for LaTeX files) and
shall be submitted as PDF via EasyChair:

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


Conference Topics

All areas of computer algebra and symbolic computation are of
interest. See http://www.issac-conference.org/2011/ or the call
for papers for further information.


Poster Committee

Sharon Hutton (NCSU, USA)
Manuel Kauers (RISC, Austria; Chair)
Dan Roche (Waterloo, Canada)
Sonia Rueda (UP Madrid, Spain)

--
Jean-Guillaume Dumas.
____________________________________________________________________
Jean-Guillaume.Dumas@imag.fr Tél.: +33 476 514 866
Université Joseph Fourier, Grenoble I. Fax.: +33 476 631 263
Laboratoire Jean Kuntzmann, Mathématiques Appliquées et Informatique
51, avenue des Mathématiques. LJK/IMAG - BP53. 38041 Grenoble FRANCE
http://ljk.imag.fr/membres/Jean-Guillaume.Dumas
____________________________________________________________________

**********************************************************
*
* 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] JORS Special Issue on Systems to Build Systems - Final Call for Papers

[Please circulate to all those who might be interested, and accept our
apologies if you received multiple copies of this announcement]
****************************************************************
CALL FOR PAPERS

Journal of the Operational Research Society
Special Issue on Systems to Build Systems

Deadline: 1st of March, 2011

http://www.cs.nott.ac.uk/~exo/specialissue/JORS2011.html
****************************************************************
Guest editors:
Edmund K. Burke, ekb@cs.nott.ac.uk
Ender Ozcan, exo@cs.nott.ac.uk
Jonathan Thompson, ThompsonJM1@cardiff.ac.uk

DESCRIPTION:
The current state of the art in the development of decision support systems
and search methodologies is focused around the human design of bespoke
systems, which are specifically tailored to the problem solving environment
in hand. Although such systems are often highly successful and useful, their
development cost is often high due to the human (expert) resources required.
Hence, an ever more important goal is to develop intelligent systems which
are capable of automatically building (and/or selecting) other systems. Over
the past few years, there has been a growing interest in developing such
-systems to build systems- to accomplish this challenging task. The ultimate
aim is to raise the level of generality by providing a more broadly
applicable solution, as opposed to dealing with single problems. These types
of -systems to build systems- have the potential to significantly reduce the
resource cost that is often associated with developing tailored systems,
since the algorithm construction/selection part of the development process
is automated.

The main purpose of this special issue is to reveal the recent advances in
the field, including novel methodologies, their foundations, frameworks and
applications to real-world problems.

SCOPE:
Topics on the systems to build systems (e.g. hyper-heuristics) include (but
not limited to):
* new methodologies to build (and/or select) systems
* automated (computer aided) design of heuristics (e.g., by genetic
programming, grammatical evolution, and others)
* adaptive/self-tuning methodologies to build systems (e.g. evolutionary
algorithms, multi-meme algorithms, adaptive operator selection, dynamic
algorithm portfolios, reactive search, and others)
* machine learning techniques to support/build systems (e.g. learning
classifier systems, data mining, reinforcement learning, neural networks,
and others)
* fuzzy systems to build systems
* applications and new challenging domains, particularly real-world
problems
* foundational studies towards the understanding of systems to build
systems
* classifications of methodologies
* generality of the methodologies to build systems
* scalability issues
* issues in multi-objective, discrete and continuous methodologies to build
systems
* issues in comparison of systems to build systems over multiple problem
domains

SUBMISSIONS:
Papers should be submitted electronically via the Journal of the Operational
Research Society's online submission system at http://jors.msubmit.net/,
following the journal's instructions to authors at
http://www.palgrave-journals.com/jors/. Please indicate that your submission
is to the Special Issue on "Systems to Build Systems" (by selecting this
option as the article type). All papers submitted to the special issue will
go through the normal strict peer review process of the Journal of the
Operational Research Society to ensure the high quality of this volume.
- - - - - - - - - - - - -

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

Tuesday, January 25, 2011

[DMANET] ADHOC-NOW 2011 CFP: The 10th International Conference on Ad Hoc Networks and Wireless


  -----------------------------------------------------------------------
         Our apologies if you receive duplicates of this posting.
    Please feel free to distribute it to those who might be interested.
  -----------------------------------------------------------------------


  ************************************************************************
  *                           CALL FOR PAPERS                            *
  *                                                                      *
  *                           ADHOC-NOW 2011                             *
  *                                                                      *
  *  The 10th International Conference on Ad Hoc Networks and Wireless   *
  *       http://researchers.lille.inria.fr/~razafind/adhocnow2011       *
  *                                                                      *
  *                          July 18-20, 2011                            *
  *                         Paderborn, Germany                           *    
  *                                                                      *
  ************************************************************************

Since its creation in 2002, ADHOC-NOW has become a well-established and
well-known international conference dedicated to wireless and mobile
computing. It serves as a forum for interesting discussions on ongoing
research and new contributions. The conference addresses both experimental
and theoretical research in the areas of ad hoc networks, sensor networks,
mesh networks and vehicular networks. It focuses on all issues from link
layer up to the application layer. In 2011, ADHOC-NOW will for the first time
be organized in Germany, in the beautiful city of Paderborn.

We seek original contributions as work in progress, experimental and
theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless
Networks. Submissions must not be published or under review for another
conference or journal. We are interested, but not limited to, research papers
in any of the following areas:

* Access Control
* Ad Hoc Networks of Autonomous Intelligent Systems
* Algorithmic Issues
* Analytic Methods and Modeling for Performance Evaluation
* Ad Hoc Network Applications and Architectures
* Delay-Tolerant Networking
* Distributed and Localized Algorithms
* Energy Efficiency
* Geometric Graphs
* Location Discovery and Management
* Mobility Handling and Utilization
* Mobile Ad Hoc Computing Platforms, Systems and Testbeds
* Mobile Social Networking
* Quality-of-Service
* Routing Protocols (Unicast, Multicast, etc.)
* Secure Services and Protocols
* Sensor and Actuator Networks
* Self-Configuration
* Service Discovery
* Time Synchronization
* Vehicular Networks
* Wireless Mesh Networks
* Wireless Internet

The conference proceedings will be published by Springer-Verlag, as part of
the Lecture Notes in Computer Science (LNCS) series (pending). Each accepted
paper will be included in the conference proceedings, provided at least one
author of the paper registers to present the paper at the conference. High-
quality articles will be invited for a special issue of Ad Hoc & Sensor
Wireless Networks: An International Journal (AHSWN), SCIE-indexed.

Authors can upload either regular papers or short papers. Regular papers
should not exceed 14 pages (including a 150 word abstract, all figures,
tables and references) in Springer Verlag LNCS format. Short papers must be
limited to up to 4 pages in LNCS format. Acceptable formats for papers are PS
and PDF. All papers will be reviewed for technical merit.

Important dates
Paper Submission:       Feb. 24, 2011
Author Notification:    Apr. 29, 2011
Camera ready:          May  13, 2011


Program Co-Chairs
Hannes Frey (Univ. of Paderborn), DE
Xu Li (Univ. of Waterloo), CA

Publicity Co-Chairs
Jiming Chen (Zhejiang Univ.), CN
Nathalie Mitton (INRIA), FR
Yu Wang (UNC at Charlotte), US

Submission Co-Chairs
Cailian Chen (Shanghai Jiao Tong U), CN
Ivan Martinovic (Univ. Kaiserslautern), DE

Proceedings Chair
Stefan Ruehrup (OFFIS, Oldenburg), DE

Local Arrangement Chair
Holger Karl (Univ. of Paderborn), DE

Web Chair
Tahiry Razafindralambo (INRIA), FR

Steering Committee
Evangelos Kranakis (Carleton Univ.), CA
Michel Barbeau (Carleton Univ.), CA
S. S. Ravi (SUNY Albany), US
Ioanis Nikolaidis (Univ. of Alberta), CA
Violet Syrotiuk (Arizona State Univ.), US
Thomas Kunz (Carleton University), CA
Ivan Stojmenovic (Univ. of Ottawa), CA


[DMANET] TAMC2011 Final Call For Papers

FINAL CALL FOR PAPERS
DEADLINE FEB. 5, 2011, 23:59PM, EST

TAMC 2011
8th Annual Conference on Theory and Applications of Models of Computation
May 23 -- 25, 2011, Tokyo, Japan

EMAIL: tamc2011@easychair.org
http://www.tamc2011.com/

After six annual meetings in China ('04-'09) and one in Czech
Republic ('10), TAMC2011 will be held in Japan, at the University
of Electro-Communications, approximately 10 miles southwest of
the Shinjuku district in Tokyo.

AIM AND SCOPE

TAMC aims at bringing together a wide range of researchers with interests
in computational models and their applications. The main themes of the
conference are computability, complexity, and algorithms. The topics of
interest include (but are not limited to):

- algebraic computation,
- approximation algorithms,
- automata theory,
- biological computing,
- circuit complexity,
- computability,
- computational biology,
- computational complexity,
- computational game theory,
- computational logic,
- computational geometry,
- cryptography,
- data structures,
- distributed algorithms,
- graph algorithms,
- information and randomness,
- learning theory,
- natural computation,
- network algorithms,
- neural computational models,
- online algorithms,
- parallel algorithms,
- proof complexity,
- quantum computing,
- randomized algorithms,
- streaming algorithms.

SUBMISSION GUIDELINE

Submission is through EasyChair:

https://www.easychair.org/account/signin.cgi?conf=tamc2011.

A submission must be typeset with LaTeX using the Springer-Verlag Lecture
Notes style. Its length must be no more than ten pages. A clearly marked
appendix may be added, but it will be read at the discretion of PC.
Submission of papers accepted for publication in journals is not
permitted. Nor is simultaneous submission to other conferences with
published proceedings.

PROCEEDINGS

The conference proceedings will be published as a volume in Lecture Notes
in Computer Science.

JOURNAL SPECIAL ISSUES

A special issue of selected papers from TAMC2011 in Theoretical Computer
Science is being planned. Another TAMC special issue may be published in
Mathematical Structures in Computer Science.

PLENARY SPEAKERS

Tetsuo Asano (JAIST, Japan)
Richard Lipton (Georgia Tech., USA)

PROGRAM COMMITTEE

Olaf Beyersdorff (Hannover, Germany)
Cristian Calude (Auckland, New Zealand)
Amit Chakrabarti (Hanover, USA)
Danny Chen (Notre Dame, USA)
Zhi-Zhong Chen (Tokyo, Japan)
Marek Chrobak (Riverside, USA)
Pierluigi Crescenzi (Firenze, Italy)
William Gasarch (College Park, USA)
Tero Harju (Turku, Finland)
Miki Hermann (Palaisseau, France)
Sanjay Jain (Singapore, Singapore)
Ming-Yang Kao (Chicago, USA)
S Rao Kosaraju (Baltimore, USA)
Carlos Martin Vide (Tarragona, Spain)
Peter Bro Miltersen (Aarhus, Denmark)
Mitsunori Ogihara, chair (Miami, USA)
Ruediger Reischuk (Luebeck, Germany)
Christian Sohler (Dortmund, Germany)
Jun Tarui, co-chair (Tokyo, Japan)
Takeshi Tokuyama (Sendai, Japan)
Chee-Keng Yap (New York, USA)

STEERING COMMITTEE

Manindra Agrawal (Kanpur, India)
Jin-Yi Cai (Madison, USA)
S. Barry Cooper (Leeds, UK)
John Hopcroft (Ithaca, USA)
Angsheng Li (Beijing, China)

IMPORTANT DATES

Submission Deadline Feb. 5, '11, 23:59PM, EST (GMT -5:00)
Notification of Acceptance Mar. 4, '11
Final Version Due Mar. 9, '11
Early Registration Deadline Mar. 28, '11

**********************************************************
*
* 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 24, 2011

[DMANET] CFP: Second Conference on Auctions, Market Mechanisms and Their Applications (AMMA 2011)

Call for Papers: The Second Conference on Auctions, Market Mechanisms and their Applications (AMMA 2011)
August 22-23, New York City, USA

www.ammaconference.org

SCOPE

The conference seeks papers devoted to issues that arise in all stages
of deploying a market mechanism to solve a problem. This includes, but
is not limited to, theoretical and empirical examination of questions
such as:

* Is a market the right mechanism for the problem? What are the
externalities involved? What are the issues with central planning?

* How should novel markets be organized? What is the "right"
micro-structure for a given problem?

* What is the best way to provide incentives? Is (real) money necessary?

* Will the use of markets lead to the creation of artificial economies?
What can we say about these economies?

* What new problems arise because of the special nature of these markets
(e.g., from everyone wanting to use a cluster around the time of a
conference deadline)?

* What protocols need to be in place for agents to participate in such
markets (including everything from practical matters like integrating
bidding protocols into the system to theoretical questions like
incentive compatibility)?

* Is there a need for new mechanisms for specific applications (e.g.,
auctions used in sponsored search were never used in other settings)? If
so, what properties of applications warrant such mechanisms?

In addition to more traditional academic papers, we are also interested
in experiences from the real world (case studies and new applications).
Below are some sample application areas, though we welcome papers in all
areas of market design.

Sample areas include:

* Prediction markets
* Student-school matching
* Kidney exchanges
* Combinatorial auctions
* Content delivery networks
* Resource allocation in networks
* Sponsored search auctions
* Road pricing

PAPERS

In order to accommodate people from different disciplinary traditions,
papers may be submitted in two tracks:

1. An archival track: papers will be considered for both presentation
and publication in the conference proceedings. Papers submitted in the
archival track must conform to the layout specifications and page
limits. Proceedings will be published by Springer.

2. A non-archival track: working papers in any format will be considered
for oral presentation in the conference.

Authors can choose which track they are submitting to by using the
appropriate layout format. All papers should be submitted through the
conference website.

IMPORTANT DATES

Full Papers due: April 15, 2011
Notification of Acceptance: May 27, 2011
Camera-ready Manuscripts due: June 15, 2011
Conference Dates: August 22-23, 2011 (NYC)

SUBMISSION INSTRUCTIONS

Please visit the Submission page on the conference website for detailed
submission requirements and procedures.

STEERING COMMITTEE

Imrich Chlamtac, University of Trento and Create-Net
Boleslaw Szymanski, Rensselaer Polytechnic Institute
Peter Coles, Harvard Business School
Vincent Conitzer, Duke University
Sanmay Das, Rensselaer Polytechnic Institute
Sebastien Lahaie, Yahoo! Research
Michael Ostrovsky, Stanford GSB
David Pennock, Yahoo! Research


**********************************************************
*
* 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] approx random 2011

-----------------------------------------------------------------
Call for papers

APPROX 2011 and RANDOM 2011
Aug. 17-19, 2011
Princeton University
http://cui.unige.ch/tcs/random-approx/


The 14th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2011),
and the 15th International Workshop on Randomization and Computation
(RANDOM'2011)
will be held in 17-19 August 2011 at Princeton University.
APPROX'2011 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate
solutions to computationally difficult problems, while RANDOM'2011 focus
on applications of randomness to computational
and combinatorial problems. RANDOM'2011 is the fifteenth workshop in the
series; APPROX'2011 is the fourteenth 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

Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx11
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random11
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such
an account are available at the submission servers (you may also have an
old account from a previous conference submission).
The postscript must be received by 17:00pm (PDT) of April 15 for your
submission 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
NCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627 and as
Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 15, 2011
Notifications: June 8, 2011
Camera ready: June 17, 2011

PROGRAM COMMITTEES

APPROX

Julia Chuzoy, Toyota Technological Institute at Chicago
Naveen Garg, IIT Delhi
Michel Goemans, MIT
Fabrizio Grandoni, University of Roma - Tor Vergata
Anupam Gupta, Carnegie Mellon University
Prahalad Harsha, Tata Institute of Fundamental Research, Mumbai
Satoru Iwata, Research Institute for Mathematical Sciences, Kyoto
Philip Klein, Brown University
Robert Krauthgammer, The Weizmann Institute of Science
Kamesh Munagala, Duke University
Zeev Nutov, The Open University of Israel
R. Ravi, Carnegie Mellon University (chair)
Guido Scheaffer, Centrum Wiskunde& Informatica
Chaitanya Swamy, University of Waterloo
Kunal Talwar, Microsoft Research Silicon Valley
Gerhard Woeginger, Eindhoven University of Technology

RANDOM

Per Austrin, University of Toronto
Nayantara Bhatnagar, Hebrew University of Jerusalem
Amin Coja-Oghlan, University of Warwick
Josep Diaz, Universitat Politecnica Catalunya
Benjamin Doerr, MPI Saarbrucken
Devdatt Dubhashi, Chalmers University
Martin Dyer, University of Leeds
Tom Friedetzky, University of Durham
Leslie Goldberg, University of Liverpool (PC chair)
Mark Jerrum, Queen Mary, University of London
Elitza Maneva, University of Barcelona
Allan Sly, Microsoft Research
Eli Upfal, Brown University
Juan Vera, Tilburg University
Osamu Watanabe, Tokyo Institute of Technology
David Zuckerman, University of Texas at Austin


PROGRAM CHAIRS

R. Ravi, Carnegie Mellon University
Leslie Goldberg, University of Liverpool

WORKSHOP CHAIRS

Jose Rolim, University of Geneva
Klaus Jansen, University 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/
*
**********************************************************

[DMANET] Stellenausschreibung wiss. MitarbeiterIn Diskrete Optimierung, Universitaet Erlangen

Stellenausschreibung

Am Lehrstuhl fuer Wirtschaftsmathematik der Friedrich-Alexander-Universitaet
Erlangen-Nuernberg, geleitet von Prof. Dr. Alexander Martin, ist ab dem 1.
Maerz 2011 die Stelle einer/s

wissenschaftlichen Mitarbeiterin/Mitarbeiters (Entgeltgruppe TV-L 13)

im Rahmen eines von der EU im 7. Rahmenprogramm gefoerderten Projekts zu
besetzen. Aufgabenschwerpunkte liegen in der Erforschung von robusten
Algorithmen im Bereich des Air Traffic Management. Die Arbeit beinhaltet
eine Lehrverpflichtung von voraussichtlich einer Wochenstunde.
Die Bearbeitung des Projekts erfolgt in interdisziplinaerer Zusammenarbeit
mit dem Institut fuer Flugfuehrung (Abteilung Lotsenassistenz) des
Deutschen Zentrums fuer Luft- und Raumfahrt (DLR) in Braunschweig. Es besteht
demnach je nach Projektphase die Gelegenheit der Arbeit in Erlangen und
Braunschweig.

Die Stelle ist zunaechst auf die vorgesehene Laufzeit des Foerderprogramms
von 42 Monaten befristet.

Gesucht werden Bewerber/innen mit ueberdurchschnittlichem Studienabschluss
in (Wirtschafts-) Mathematik oder Informatik, mit guten Englischkenntnissen,
die in den genannten Forschungsgebieten arbeiten wollen und Interesse an der
Durchfuehrung von Praxisprojekten haben. Wuenschenswert sind Kenntnisse der
diskreten oder kombinatorischen Optimierung sowie Programmiererfahrung. Die
Moeglichkeit zur Promotion ist gegeben.

Bitte senden Sie Ihre Bewerbung mit den ueblichen Unterlagen (Lebenslauf,
Zeugnisse) bis zum

15. Februar 2011

an die folgende Adresse:

Lehrstuhl fuer Wirtschaftsmathematik

Universitaet Erlangen-Nuernberg
Am Weichselgarten 9
91058 Erlangen

oder vorzugsweise per e-Mail an Christina.Weber@math.uni-erlangen.de.

Wir bitten, Bewerbungsunterlagen nicht in Mappen oder Huellen und auch nur
als unbeglaubigte Kopien vorzulegen, da die Unterlagen nicht zurueckgesandt
werden; sie werden nach Abschluss des Auswahlverfahrens vernichtet.

Die Friedrich-Alexander Universitaet moechte den Anteil von Frauen in der
Wissenschaft erhoehen und bittet daher insbesondere Frauen um ihre Bewerbung.
Es wird darauf hingewiesen, dass die Bewerbung geeigneter Schwerbehinderter
erwuenscht ist.

Rueckfragen koennen an Dipl.-Math. Andrea Peter
(andrea.peter@math.uni-erlangen.de) gerichtet werden.
**********************************************************
*
* 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 22, 2011

[DMANET] dmanet@zpr.uni-koeln.de

********************************************************************
We apologize in advance if you receive multiple copies of this CFP.

Please disseminate CFP to your colleagues that might be interested.
********************************************************************

---------------------------------------------------------------------
2nd CALL FOR PAPERS
>>> Paper submission deadline extended till Friday, February 11 <<<

SAHNS 2011
The Third International Workshop on
Specialized Ad Hoc Networks and Systems
Minneapolis, USA, June 23, 2011
http://www.cs.wmich.edu/~alfuqaha/SAHNS2011/

In conjunction with the IEEE 31st International Conference
on Distributed Computing Systems (ICDCS 2011)
---------------------------------------------------------------------

1. SCOPE

The Workshop provides a forum for engineers and scientists in academia,
industry and government to present their latest research findings in
specialized ad hoc networks and systems.

As an alternative to one-size-fits-all general solutions in the area of
ad hoc networking and systems, we want to stimulate the
application-oriented divide-and-conquer approach to ad hoc network and
system research. The goal is to provide sound and efficient specialized
ad hoc networks and systems (SAHNS), suitable for building solutions
specific for well-defined classes of applications or even individual
applications.

We want to consider both specialized ad hoc networks and specialized ad
hoc systems. The latter can be built on top of specialized ad hoc
networks. Alternatively, they can be constructed independently of
specialized ad hoc networks, e.g., on top of general-purpose ad hoc
networks.

It should be emphasized that SAHNS is interested only in solutions
specific to specialized ad hoc networks and systems. The Workshop is not
interested in broad general-purpose solutions for all ad hoc networks
and systems, or in generic solutions for extremely broad subclasses of
ad hoc networks and systems. For example, the Workshop is not interested
in general-purpose solutions for all sensornets or all P2P systems but
is instead interested in specialized solutions for their
application-oriented subclasses.

One example of SAHNS targeted by this workshop are Incident Area
Networks (IANs), dedicated to single incidents or events. An IAN can be
pre-deployed for a planned event, such as a sporting or "nationally
significant" event, or can be dynamically deployed for an unplanned
incident, such as a local law enforcement situation or a natural
disaster. Another example are opportunistic resource utilization
networks (e.g., oppnets), in which the network reacts to a lack of
resources by finding and incorporating "helpers" that have needed
resources or services.

Areas and topics of particular interest include, but are not limited to:

a) Design issues for SAHNS:
o Novel network and system architectures
o Economically-based models and solutions (incl. incentive-based
techniques)
o Operating systems and middleware
o Customized network protocols (incl. cross-layer and Layer 2.5
protocols)
o Resource management solutions (incl. discovery and integration of
resources)
o Algorithms and models for localization and mobility management
o Privacy, security, and trust
o Reliability and dependability
o Novel hardware platforms

b) Development issues for SAHNS:
o Development methodologies, models and tools
o Analytical and validation models
o Performance evaluation and modeling (incl. simulation tools)

c) Operation and management issues for SAHNS:
o Topology control and management
o Energy control and management
o Resource and service discovery and control
o QoS provisioning and management
o Data management, data aggregation, data dissemination, and
query processing
o Assuring survivability and reliability
o Controls for privacy, security, and trust management

d) Application issues for SAHNS:
o Best current and future applications for SAHNS
o Experience with SAHNS deployments and products
o Social and business impacts of SAHNS-based applications


2. PAPER SUBMISSION

Papers must be submitted in the PDF format, with numbered pages. They
should have no more than 6 pages following the IEEE Computer Society
proceedings format (8.5 by 11 inch sheets, double-column, 10 point or
larger font, single-spaced).

The following information must be provided on the first page:
o Paper title
o Full names, affiliations and email addresses of all authors
o An abstract (up to 150 words)
o Five to ten keywords/phrases
o A footnote with the indication of the corresponding author,
plus the complete address, phone and fax numbers of the
corresponding author

Papers should be submitted by emailing them to:
llilien@wmich.edu
Each received submission will be confirmed, usually within no more than
two workdays.


3. PAPER REVIEW AND PUBLISHING

Each paper will be peer-reviewed by at least two reviewers and their
comments will be provided to the authors.

If accepted, the paper will be published in the workshop proceedings by
the IEEE Computer Society Press, provided that at least one of its
authors registers for ICDCS (which includes SAHNS) by the early
registration deadline.

Information on indexing publications for the events of the IEEE Computer
Society is available at:
http://www.computer.org/portal/web/cscps/benefits#indexing

We plan a special issue of an international journal with extended
versions of the selected SAHNS papers.


4. IMPORTANT DEADLINES

Paper submission - Friday, February 11, 2011
Author notification - Friday, March 11, 2011
Final manuscript due - Monday, March 30, 2011


5. COMMITTEES

--------- Steering Committee ---------

Bharat Bhargava, Purdue University, USA
Torsten Braun, University of Bern, Switzerland
Ajay Gupta, Western Michigan University, USA
Leszek Lilien (Workshop Chair), Western Michigan University, USA
Thomas Plagemann, University of Oslo, Norway

--------- Organizing Committee ---------

U.S. Publicity Chair: Ala Al-Fuqaha, Western Michigan University, USA
International Publicity Chair: TBA
Publications Chair: James Yang, Western Michigan University, USA


6. FURTHER INFORMATION

For further information please visit the SAHNS 2011 web pages at:
http://www.cs.wmich.edu/~alfuqaha/SAHNS2011/
or contact Leszek T. Lilien, Workshop Chair (llilien@wmich.edu).

--[CFP v.11.01.21e] --------------------------------------------------

**********************************************************
*
* 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] IEEE SmartGridComm Symposium on Cyber and Physical Security and Privacy

IEEE SmartGridComm Symposium on Cyber and Physical Security and Privacy
(Second IEEE International Conference on Smart Grid Communications)

Symposium Co-chairs

Prof. Sanjay Goel, University at Albany, SUNY (chair)
Dr. Stephen F. Bush, GE Global Research, New York
Prof. William H. Sanders, University of Illinois at Urbana-Champaign

Scope and Motivation

The emerging Smart Grid vision is of an interconnected power distribution
network that streamlines transmission, distribution, monitoring, and control
of electricity. This vision is being realized through the design and
implementation of an information network overlaying the traditional power
grid. On the distribution side, it is envisioned that a smart meter will be
connected to each household allowing the consumer to not only draw power,
but also supply surplus power to the grid. A distribution-side communication
network would allow for a more precise real-time estimation of anticipated
usage allowing for a more optimized demand-response driven control. The
smart grid vision also includes many technologies on the transmission side,
including those that provide wide area situational awareness of grid status.
All of these technologies must be woven together in a way that insures
end-to-end security and resiliency. Ensuring end-to-end grid security and
resiliency is one of the biggest challenges of the Smart Grid vision. Not
only is it necessary to ensure high-availability, real-time, communication
but also to ensure that communications are secure, private, and have
integrity. Given the size and time-scales involved, the new grid must also
be able to detect and respond to such problems and either recover
automatically or provide timely alerts to humans. This capability may
require that redundancy and diversity be built into the system in a manner
that ensures that critical IT functions not be compromised. Means to measure
and validate grid resilience also need to be developed. Also important are
policy issues that will govern privacy and usage of information. The scope
includes physical security of the grid communication infrastructure
including a risk analysis of the critical components as well as
incorporation of redundancy in the grid.

Topics of Particular interest

The symposium aims to bring together researchers and practitioners in the
area of security to present and discuss the knotty issues involved in smart
grid security. The topics of interest include, but are not limited to the
following:

* Grid Resilience
o Mechanisms to isolate and/or recover from both physical and cyber faults
and attacks
o Metrics of resilience
* Smart Grid Security Risk Assessment and Management
* Communications and Device Security
o Authorization and Access Control
o End-to-end Encryption, Key Management, etc.
* Security of Devices
* Privacy and Misuse of User Data
* System Security, e.g.,
o Malware attacks (on the network and devices)
o Intrusion
o Denial-of-Service Attacks
o SCADA security
o Other network attacks
* Physical Security of the Grid Communication Infrastructure
o Building redundancy in the grid
o Meter tampering by customer or others

Submission Guidelines

Submission deadlines and format requirements are the same for all symposia,
see here Paper submission will be through EDAS, please check this page again
in March 2011 for a direct link.

Technical Program Committee (TPC) members

Bora Akyol, Pacific Northwest Labs, USA Brian M. Bowen, Columbia University,
USA Bruno Sinopoli, Carnegie Mellon University, USA David Bakken, Washington
State University Georgios Kalogridis, Toshiba Research Europe Ltd, UK John
Buford, Avaya Labs Research, USA Mostafa El-Said, Grand Valley State
University, USA Russ Housley, Vigil Security, US Sanjay Goel, University at
Albany, SUNY, USA Shalini Kishore, Lehigh University, USA Stephen F. Bush,
GE Global Research, USA William H Sanders, University of Illinois at
Urbana-Champaign, USA William T. Polk, NIST, USA Kevin Mills, NIST, USA Carl
Hauser, Washington State University, USA Dave Dalva Cisco Systems, USA
Stojan Denic, Toshiba Research Europe Ltd., UK Henrik Sandberg, KTH, Royal
Institute of Technology, Sweden Vincent Roca, INRIA Rhne-Alpes, France
Andrew Wright, N-Dimension Solutions, USA Le Xie, Texas A&M University, USA
Marianne Swanson, NIST, USA Bulent Yener, RPI, USA

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

Friday, January 21, 2011

[DMANET] Vienna Graduate School in Computational Scienc

Vienna Graduate School in Computational Science


The Vienna Graduate School in Computational Science is a newly founded
graduate school funded by the University of Vienna. The three-year PhD
program is run entirely in English and will start with an international
group of students in summer 2011. The doctoral school covers a wide areas
of fields from Physics (Prof. Dellago), Chemistry (Prof. Hofacker),
Bioinformatics (Prof. von Haeseler) to Mathematics (Prof. Scherzer) and
Computer Science (Prof. Henzinger). Every student will have two advisors
from two different fields.


A number of PhD student positions (3-year contract with an annual salary
of 25000 Euros) are available.The successful candidate should be
self-motivated with a master's degree (or equivalent) in one of the above
fields. We require very good English skills.

Applications should include
- CV
- Motivation Letter and preferred research areas
- Abstract of your master thesis (not obligatory)
- Transcript of grades of your undergraduate and master studies
- Two letters of recommendation
- Proposed starting date

Applications may be sent by February 15, 2011 by email in one printable
pdf file with files included in the above order to:

claudia.daniela.muellauer@univie.ac.at


**********************************************************
*
* 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] INOC 2011 - Call for Papers

*** Sorry for cross-posting ***

Dear Colleagues,

We are happy to announce that the International Network Optimization
Conference (INOC) 2011 will take place on the 13.-16. June 2011 in
Hamburg.

The international conference INOC 2011 is intended to be a forum for
researchers and practitioners working in the area of Network
Optimization.
We invite you to present and share your recent developments both in
theory and applications.

The list of topics on the conference includes

1. Network flows
2. Routing algorithms
3. Network design
4. Location
5. Airline management
6. Survivability
7. Sustainability
8. Uncertainty
9. Stochastic models
10. Vehicle routing
11. Graph theory
12. Exact approaches
13. Heuristic approaches
14. Queuing theory
15. Computational logistics

The registration and submission process are already open to interested
people. We are accepting short (up to 6 pages) and full papers (up to 15
pages), written in English and typeset using the LaTeX template provided
under the http://www.smartframe.de/inoc11web/inoc11_en_home.php
Submission section. Deadline for submission is 15. February 2011.

Papers will be peer-reviewed; acceptance of the contributions will be
based on originality of the work, suitability regarding the topics of the
conference, and overall quality of the submission. Accepted papers are
published in a proceeding (publisher and series will be announced soon).
In addition, selected papers are invited for publication in one of two
special issues to appear in Netnomics
http://www.springerlink.com/content/102537/
or Networks
http://eu.wiley.com/WileyCDA/WileyTitle/productCd-NET.html


We hope to welcome you soon in Hamburg!

Julia Pahl, Torsten Reiners, Stefan Voss,

INOC 2011 - Organizing team
**********************************************************
*
* 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] WAW2011 - call for papers

Hi,

I am happy to announce that we seek for an external support now. We hope
to provide a support for students and post-docs as well as authors of
the best papers. We have already received support from NSF, WVU,
Microsoft, Google, and Telefonica. We expect a few more institutions to
be involved.

The 8th Workshop on Algorithms and Models for the Web Graph (WAW 2011)
will take place at Emory University in Atlanta, GA, May 28-29, 2011.
This is an annual meeting, which is traditionally co-located with
another, related, conference. WAW 2011 will be co-located with the 15th
International Conference on Random Structures and Algorithms. (The RS&A
conference, organized biennially since 1983, brings together
probabilists, discrete mathematicians and theoretical computer
scientists working in probabilistic methods, random structures and
randomized algorithms.)

Here you can find more information on the event:

http://waw2011.math.wvu.edu/

The list of plenary speakers of WAW2011 includes:
- Fan Chung [University of California, San Diego]
- Colin Cooper [King's College]

The list of plenary speakers of RSA2011 includes:
- Bela Bollobas [University of Cambridge and University of Memphis]
- Jennifer Chayes [Microsoft]
- Fan Chung [University of California, San Diego]
- Jacob Fox [Massachusetts Institute of Technology]
- David Gamarnik [Massachusetts Institute of Techology]
- Jeff Kahn [Rutgers University]
- Subhash Khot [Courant Institute]
- Yoshi Kohayakawa [University of Sao Paulo]
- Eric Vigoda [Georgia Institute of Technology]
- Nick Wormald [University of Waterloo]

WAW 2011 invites original research papers on all aspects of algorithmic
and mathematical research in the areas pertaining to the World-Wide Web,
especially papers that espouse the view of complex data as networks.
Submissions are invited in, but not limited to, the following areas:
- Algorithms: graph algorithms, clustering, collaborative filtering, and
related computational models such as data streams, MapReduce/Hadoop.
- Analysis: structural properties, visualization, patterns, communities,
discovery.
- Data Models: graph models, evolution, trust and reputation networks.
- Topics: Web, social networks, recommender networks, citation networks,
Wikipedia, biological networks, blogs, p2p.
- Applications: web mining, social applications, web search and ranking.

Important Dates:
- Full paper submission: February 15, 2011
- Notification of acceptance: March 15, 2011
- Final version due: April 1, 2011

The papers must be formatted according to Springer LNCS style. The
maximum length of papers is at most 12 pages. The workshop proceedings
will be published as a Springer LNCS volume. Selected papers from the
workshop will be invited to a special issue of Internet Mathematics.

We are looking forward to seeing you in Atlanta,

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

[DMANET] CSDM 2011 conference announcement

---------------------------------------------------------------------------------------
SECOND INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS DESIGN & MANAGEMENT
(CSDM 2011)

December 7-9, 2011 - Cite Universitaire, Paris (France)

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

Website : http://www.csdm2011.csdm.fr/-Submission-.html

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

CALL FOR PAPERS # 2


The management of large-scale complex industrial systems has a
considerable strategic importance for an important number of
enterprises (most notably in Europe and North America).
This spawned the relatively new academic field of "system architecture
& engineering", producing a body of research that allows engineers to
manage the increasing complexity of the
technical systems they design. By its very nature, this field is at
the interface between industry and academia, and requires its
practitioners to be well versed in industrial
application-related as well as theoretical knowledge. The ambition of
the CSDM conference is to be the meeting point of reference for the
industrial and academic environments working in
the design and management of complex industrial systems.


IMPORTANT DATES

- Optional abstract pre-submission deadline: April 4, 2011
- Submission deadline: April 22, 2011
- Acceptance notice for industrial contributions: June 13, 2011
- Acceptance notice for academic contributions: June 30, 2011
- Final version submission deadline: August 31, 2011


SUBMISSION PROCEDURE

As the CSDM conference is both industrial and academic, there will be
different submission procedures according to the type of submitted
contributions. Industrial submissions are aimed
to present good practices in industry, shared experiences and case
studies: either a 12-pages PDF-formatted paper or a 15-slides
PowerPoint presentation is acceptable for selection purposes.
Scientific submissions are aimed to present innovative methodological,
technical or scientific results: a 12-pages PDF-formatted paper is
necessary for selection purposes. Subject to contribution
acceptance, inclusion on the Springer proceedings book requires a
12-pages paper formatted according to specific Springer style files.
More details can be found on the conference website.
Selected papers will be presented by their authors either on the
format of a 30 minute talk or as a poster during a special session.
This can be specified during the submission procedure.
More details can be found on the conference website.

PROCEEDINGS AND PUBLICATIONS

The conference proceedings will be published in a book edited by
SpringerVerlag (Science and Engineering). Selected papers will be
published in special issues appearing in international journals
covering the
conference topics.


CONFERENCE TOPICS

- Industrial domains
o Constructors and operators of transportation systems
o Defense and security
o Electronics and robotics
o Energy and environment
o Health and welfare services
o Media and communications
o Software and e-services

- Scientific and technical topics
o Systems fundamentals (algorithmics & complexity, control theory,
communications, mathematical programming, semantics, systemics,
information technology, signal processing)
o Systems architecture (needs capture, requirements development,
systems modelling, simuling,optimization, sizing and specification,
architectural frameworks)
o Systems engineering (design, industrialization, integration,
verification, validation, qualification, deployment, maintenance,
dismantling)
o Industrial projects (innovation management, systems project
management, agile methods, test oriented methods, project office)
o Systems metrics (architectural metrics, complexity measures, cost &
delay evaluation, key performance indicators, quality of service)
o Systems quality (analysis and covering of risks, availability,
maintenability, operability, reliability, security, safety and
usability analyses, tests)
o Systemic tools (configuration management, formal verification,
system behaviour analysis tools, modelling & simuling tools,test
management)

- Systems types
o Embedded systems (electronics, health, telecoms, transport, etc.)
o Transportation systems (aerospace, automobile, railways, ships, etc.)
o Software systems (Internet applications, networks, operating
systems, parallel and distributed systems, etc.)
o Information systems (command, control & communication systems,
enterprise information systems (BI, CRM, EII, ERP, SCM), industrial
information systems (SCADA, PLM, etc.), supervision systems, etc.)
o Systems of systems (air traffic management, management of financial
systems, network centric warfare, travel reservation systems, etc.)
o Artificial eco-systems (city planning & engineering, integrated hubs, etc.)


ORGANISING COMMITTEE

Chair :
- D. Krob (Ecole Polytechnique, France)

Members:
- M. Aiguier (Ecole Centrale Paris, France)
- P. Bourgine (Ecole Polytechnique, France)
- C. F?liot (Alstom Transport, France)
- I. Demeure (Telecoms Paritech, France)
- G. Fleury (Sup-lec, France)
- P. Foix (Thales, France)
- V. Giakoumakis (Universit- de Picardie, France)
- B. Petit (Innocherche, France)
- S. Peyronnet (Universit- Paris-Sud 11, France)
- A. Rauzy (Ecole Polytechnique, France)
- J.A. Sirat (EADS, France)


PROGRAM COMMITTEE

ACADEMIC PROGRAM COMMITTEE

Chair :
- O. Hammami (ENSTA Paritech, France)

Members:
- F. Arbab (Leiden University, Netherlands)
- J. Andersson (National Defense College, Sweden)
- D. Bienstock (Columbia University, United States)
- M. Broy (TU Munchen, Germany)
- D.D. Frey (MIT, United State)
- L.A. Kappelman (University of North Texas, United States)
- K. Larsen (Aalborg University, Denmark)
- J. Lee (IBM, United States)
- T. Lindquist (Arizona State University, United States)
- G.J. Muller (Buskerud University College, Norway)
- J. Printz (CNAM, France)
- B. Rumpe (RWTH Aachen, Germany)
- J. Rutten (CWI, Netherlands)
- R. Valerdi (MIT, United States)


INDUSTRIAL PROGRAM COMMITTEE

Chair:
- J.L. Voirin (Thales, France)

Members:
- E. Aslaksen (Sinclair Knight Merz, Australia)
- I. Bailey (Model Futures, Great Britain)
- Y. Caseau (Bouygues Telecom, France)
- H.G. Frischkorn (Verdand der Automobilindustrie, Germany)
- Y. Fujita (Technova Toyota, Japan)
- J.L. Garnier (Thales, France)
- G. Griessnig (AVL LIST, Austria)
- A. Mitschke (EADS, Germany)
- J.C. Roussel (EADS, France)
- B. Selic (Zeligsoft, Canada)
- J.D. Taft (CISCO, United States)
- D. Walden (Sysnovation, United States)
- Y. Wijnia (D-cision, Netherlands)
- N. Wolff (Auxis, United States)


MORE DETAILS

More information can be found on the conference website
http://www.csdm2011.csdm.fr.
For any question, please write an email to: contact@csdm.fr.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************