[fm-announcements] RV'11 San Francisco - Call for Participation

                        CALL FOR PARTICIPATION

     2nd International Conference on Runtime Verification (RV)
                      September 27 - 30, 2011
                     San Francisco, California
                   at the Historic Fairmont Hotel

                  http://rv2011.eecs.berkeley.edu

        ** Early registration deadline: September 4, 2011 **


The 2011 Runtime Verication conference is a forum for researchers and
industrial practitioners for presenting theories and tools for
monitoring and analysis of software or hardware system executions, as
well as a forum for presenting applications of such tools to practical
problems.  The field is often referred to under different names, such
as runtime verification, runtime monitoring, runtime checking, runtime
reflection, runtime analysis, dynamic analysis, runtime symbolic
analysis, trace analysis, log file analysis, etc.  RV can be used for
many purposes, such as security or safety policy monitoring,
debugging, testing, verification, validation, profiling, fault
protection, behavior modification (e.g., recovery), etc.  A running
system can be abstractly regarded as a generator of execution traces,
i.e., sequences of relevant states or events. Traces can be processed
in various ways, e.g., checked against formal specifications, analyzed
with special algorithms, visualized, etc.

RV 2011 is conducted over 4 days.  The first day offers 4 tutorials.
The remaining three days offer 6 invited talks, and presentation of 28
regular papers, short papers and tool demonstrations.


INVITED SPEAKERS:

Dawson Engler, Stanford University
   Title: "Making finite verification of raw C code easier than writing a test case"

Cormac Flanagan, University of California, Santa Cruz
   Title: "Efficient and Precise Dynamic Detection of Destructive Races"

Wolfgang Grieskamp, Google
   Title: "Utilizing Protocol Contracts for Verifying Services in the Cloud"

Sharad Malik, Princeton University
   Title: "Runtime Verification: A Computer Architecture Perspective"

Vern Paxson, University of California, Berkeley
   Title: "Approaches and Challenges for Detecting Network Attacks in Real-Time"

Steven P. Reiss, Brown University
   Title: "What is My Program Doing?  Program Dynamics in Programmer's Terms"


TUTORIALS:

- Internal versus External DSLs for Trace Analysis
  by: Howard Barringer and Klaus Havelund

- Runtime Monitoring of Time-sensitive Systems
  by: Borzoo Bonakdarpour and Sebastian Fischmeister

- Teaching Runtime Verification
  by: Martin Leucker

- Predicting Concurrency Failures in Generalized Traces of x86 Executables
  by: Chao Wang and Malay Ganai

VENUE:

The accommodation and conference venue is the Historic Fairmont Hotel,
San Francisco, California, USA.  A special rate has been secured for a
limited number of rooms at this gorgeous venue.  The hotel reservation
cut-off date is September 6, 2011.  Please see the conference website
for further details:

   http://rv2011.eecs.berkeley.edu/Book_Hotel.html


REGISTRATION:

The registration is open at:

   http://rv2011.eecs.berkeley.edu/Registration.html

- Early registration fee, before or on 4 September: $575
- Late registration fee, after 4 September: $725

- Tutorial registration fee is $200 before or on September 4 and $300 after that


STUDENTS:

RV 2011 is providing a discount of $150 on the registration fee to
students.


ORGANIZATION:

Program Chairs:
- Sarfraz Khurshid, University of Texas at Austin, USA
- Koushik Sen, University of California, Berkeley, USA

Local organization chairs:
- Jacob Burnim, University of California, Berkeley, USA
- Nicholas Jalbert, University of California, Berkeley, USA

RV Steering Committee:
- Howard Barringer, University of Manchester, UK
- Klaus Havelund, NASA/JPL, USA
- Gerard Holzmann, NASA/JPL, USA
- Insup Lee, University of Pennsylvania, USA
- Grigore Rosu, University of Illinois at Urbana-Champaign, USA
- Oleg Sokolsky, University of Pennsylvania, USA


SPONSORS:

RV 2011 is sponsored by:
- Microsoft Research
- The ARTIST Network of Excellence on Embedded Systems Design
- Intel
- Google
- The Penn Research in Embedded Computing and Integrated Systems
- Laboratory for Reliable Software at the Jet Propulsion Laboratory

We look forward to welcoming you at the 2nd International Conference
on Runtime Verification.

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

[DMANET] CMCS 2012: First call for papers

[- Apologies for multiple copies -]

------------------------------------------------------------------------------
CMCS 2012 call for papers
------------------------------------------------------------------------------

The 11th International Workshop on Coalgebraic Methods in Computer Science
31 March - 1 April 2012, Tallinn, Estonia
(co-located with ETAPS 2012)
www.coalg.org/cmcs12

*** Proceedings to be published in Springer LNCS ***

Aims and scope
--------------

In more than a decade of research, it has been established that a wide
variety of state-based dynamical systems, like transition systems,
automata (including weighted and probabilistic variants), Markov
chains, and game-based systems, can be treated uniformly as
coalgebras. Coalgebra has developed into a field of its own interest
presenting a deep mathematical foundation, a growing field of
applications, and interactions with various other fields such as
reactive and interactive system theory, object-oriented and concurrent
programming, formal system specification, modal and description
logics, artificial intelligence, dynamical systems, control systems,
category theory, algebra, analysis, etc. The aim of the CMCS workshop
series is to bring together researchers with a common interest in the
theory of coalgebras, their logics, and their applications.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantical models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).

Keynote Speaker
---------------

Samson Abramsky, Oxford University, UK

Invited Speakers
----------------

Marcello Bonsague, Leiden University, The Netherlands
Pawel Sobocinski, University of Southampton, UK

Submissions
-----------

Submission is electronic via the easychair system at

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

following the submission guidelines below. We solicit two types of
contributions:

(a) Regular papers to be evaluated by the PC for publication in the
proceedings:

They must have a length no greater than 20 pages, formatted in LNCS
style (http://www.springer.de/comp/lncs/authors.html). They must
contain original contributions, be clearly written, and include
appropriate reference to and comparison with related work.

(b) Short contributions:

These will not be published in the proceedings but will be bundled in
a technical report. They should be no more than two pages in LNCS
format and may describe work in progress, summarise work submitted to
a conference or workshop elsewhere, or in some other way appeal to
the CMCS audience.

Proceedings Publication
-----------------------

The proceedings of CMCS 2012 will be published in Springer Lecture
Notes in Computer Science. The final proceedings will be published
post-conference and feature revised versions of the accepted regular
papers. Preliminary proceedings will be made available at the
conference in electronic form.

Depending on the number and quality of submissions, we will consider
publishing extended and revised papers as a journal special issue,
subject to the usual reviewing procedure. Previous special issues of
CMCS have appeared in high-ranking journals including Information and
Computation and Theoretical Computer Science.

Important dates
---------------
* 10 January 2012: strict submission deadline regular papers
* 13 February 2012: notification regular papers
* 15 February 2012: deadline early registration
* 20 February 2012: final version
* 27 February 2012: strict submission deadline short contributions
* 6 March 2010: notification short contributions
* 31 March - 1 April 2012: the workshop

Programme Committee
-------------------

Luis Barbosa, University of Minho, Braga, Portugal
Filippo Bonchi, LIP ENS-Lyon, France
Josee Desharnais, Université Laval, Canada
Mai Gehrke, Radboud University Nijmegen, The Netherlands
H. Peter Gumm, University of Marburg, Germany
Ichiro Hasuo, University of Tokyo, Japan
Patricia Johann, University of Strathclyde, Glasgow, Scotland, UK
Ekaterina Komendantskaya, University of Dundee, Scotland, UK
Dexter Kozen, Cornell University, Ithaca, NY, USA
Dorel Lucanu, Alexandru Ioan Cuza University, Iasi, Romania
Stefan Milius, Technical University of Braunschweig, Germany
Larry Moss, Indiana University, Bloomington, USA
Prakash Panangaden, McGill University, Montreal, Canada
Dirk Pattinson, Imperial College London, UK (co-chair)
Dusko Pavlovic, Royal Holloway, London, UK
Daniela Petrisan, University of Leicester, UK
Grigore Rosu, University of Illinois at Urbana-Champaign, USA
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Luigi Santocanale, University of Provence, Marseille, France
Lutz Schröder, DFKI GmbH, Bremn, Germany (co-chair)
Alexandra Silva, CWI, Amsterdam, The Netherlands
Ana Sokolova, University of Salzburg, Austria
Sam Staton, University of Cambridge, UK
Yde Venema, University of Amsterdam, The Netherlands

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

Jiri Adamek, Technical University of Braunschweig, Germany
Corina Cirstea, University of Southampton, UK
H. Peter Gumm (chair), University of Marburg, Germany
Bart Jacobs, Radboud University Nijmegen, The Netherlands
Alexander Kurz, University of Leicester, UK
Marina Lenisa, University of Udine, Italy
Ugo Montanari, University of Pisa, Italy
Larry Moss, Indiana University, Bloomington, USA
Dirk Pattinson, Imperial College London, UK
John Power, University of Bath, UK
Horst Reichel, Technical University of Dresden, Germany
Jan Rutten, CWI and Radboud University Nijmegen, The Netherlands
Lutz Schröder, DFKI GmbH and University of Bremen, Germany
.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Open Position at the RCIS/JAIST

[sorry for multiple copies]

Open Position for one post doctoral researcher at RCIS/JAIST

At the Research Center for Integrated Science [1] at the
Japanese Advanced Institute of Science and Technology [2]
a post doctoral researcher position is open starting from October.

Fields of research:
Mathematical Logic, in particular Semantic/Proof-theoretic methods in
Nonclassical logics (including substructural logics, intermediate and
many-valued logics) and related fields

Application:
Application should comprise a curriculum vitae, a short statement
on research interests, preferrably a recommendation letter, per email
to
ono@jaist.ac.jp, preining@jaist.ac.jp (both)

Deadline for application:
17 September 2011

Inquiries should be sent to the above adresses, too.

ONO Hiroakira
PREINING Norbert

[1] http://www.jaist.ac.jp/rcis/en
[2] http://www.jaist.ac.jp/
------------------------------------------------------------------------
Norbert Preining preining@{jaist.ac.jp, logic.at, debian.org}
JAIST, Japan TeX Live & Debian Developer
DSA: 0x09C5B094 fp: 14DF 2E6C 0307 BE6D AD76 A9C0 D2BF 4AA3 09C5 B094
------------------------------------------------------------------------

[DMANET] Final Call for Participation: AMMA 2011 (Second Conference on Auctions, Market Mechanisms and their Applications

Final Call for Participation:

The Second Conference on Auctions, Market Mechanisms and their Applications (AMMA 2011)

http://www.ammaconference.org

August 22-23, CUNY Graduate Center (Manhattan), New York City, USA

The biennial AMMA conference is a forum for advances in the theory and
practice of auctions and market mechanisms. The goal of the conference
is to bring together researchers from computer science, economics, and
business schools as well as industry, with common interests in issues
that arise in all stages of deploying market mechanisms. In addition to
more traditional academic papers, the conference will focus on
experiences from the real world such as case studies and new applications.

AMMA 2011 features two invited talks by

** Peter Cramton, University of Maryland
"Medicare Auctions: A Case Study of Government Market Design."

** Jeremy A. Smith, SecondMarket, Inc.
"Dutch auction. English auction. Manhattan auction?"

The technical program features 22 technical papers and case studies on
topics such as school choice, markets for housing, energy, and
advertising, prediction markets, and the theory of market design:
http://www.ammaconference.org/techprog.shtml

We look forward to seeing you in New York!

AMMA Steering Committee

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] Open position: research associate at University of Portsmouth

The Portsmouth Business School and the Department of Mathematics of the
University of Portsmouth (UK) have an open position as research
associate. As part of a large European Project, the position focus is on
designing and implementing dynamic multi-criteria decision support
models in a security context.
The position is to be filled immediately until November 2012.
Deadline for application 26.08.2011

Application form and instructions can be found online:
http://www.port.ac.uk/vacancies/research/vacancytitle,138662,en.html

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

[DMANET] Postdoc position in Braunschweig (Computational Geometry / Algorithm Engineering)

The Algorithms Group in the Department of Computer Science at
Braunschweig University of Technology, Germany, has a vacancy
(provided final clearance of funds) for a computer scientist or
mathematician, starting in October or November (exact date
negotiable).

We are looking for

a scientific employee / postdoctoral research associate
(TV-L13 -- about 2800 Euros gross per month).

The position will be for one year, with possible renewal for a second
year. There is also the option to fill it with an exceptionally well
qualified PhD student for two years.

Project "Kunst!" combines methods from computational geometry,
mathematical programming, and algorithm engineering in an exciting
way. The goal is to solve problems from the art gallery family
(almost) exactly, and to design efficient algorithms with efficient
implementations. It is based on the following paper (which should
provide some clues on what the project will be about):

Baumgartner, Fekete, Kroeller, Schmidt:
Exact Solutions and Bounds for General Art Gallery Problems,
Proc. ALENEX 2010. http://pro.perror.de/bfks-esbgagp-10.pdf

We are looking for applicants with an above-average Ph.D. in
mathematics or computer science, who have a solid knowledge in
optimization and algorithms, an interest in and a capability for a
wide range of scientific work (from developing ideas all the way to
their practical realization), an open mind for the other activities of
our department, and a healthy team spirit.

Some topics that may arise during the project are the following. We do
not expect that applicants will know all of these; being proficient in
several areas will be an important asset.
- Computational geometry, esp. the art gallery problem and its variants.
- Linear and integer programming.
- Parallel/multicore algorithms.
- Modelling and abstraction of real-world problems.
- Implementing geometric algorithms (i.e., CGAL).
- Implementing linear-programming-based algorithms (CPLEX/SoPlex).

Proficiency in English is a must. Implementing algorithms in C++ will
be a part of the project, so familarity with C++ development is
required.

There are no teaching obligations, but researchers will have the
opportunity to interact with students in the context of their
projects.

We are offering an opportunity to participate in exciting
interdisciplinary projects that span all the way from basic research
in algorithms to its practical and technical application. As a member
of our group, you will be part of a motivated team that maintains
various interdisciplinary and international contacts and activities.
Among applicants with equal qualifications, handicapped persons will
be given a preference. The Braunschweig University of Technology is an
equal- opportunity employer and encourages women to apply.

Please send your detailed application by

September 5, 2011

with the usual documents to:

Dr. Alexander Kroeller
Technische Universitaet Braunschweig
Institut fuer Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany

fax: +49 531 391 3109

Electronic applications are preferred - even more if they come in a
single PDF file. If there are questions, please contact Alexander
Kroeller via mail (a.kroeller "at" tu-bs.de) or phone
(+49 531 391 3112).

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

2nd International Symposium on Combinatorial Optimization (ISCO 2012)

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
April 19-21, 2012

Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012

Athens University of Economics and Business,
Athens, Greece

http://isco12.cs.aueb.gr/
(preliminary version)

ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.

Spring School

ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.

Invited Speakers

Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna

Important Dates

Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012

Submission - Publication

Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

The submission deadline is Thursday December 1, 2011. Simultaneous
submissions to other conferences with published proceedings or journals are
not allowed. Paper submission and reviewing will be handled only via
Easychair. More information about the submission procedure will be available
in due time.

There will be two types of submissions:

a) Regular papers
They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors in a 30 min talk. The authors will have
to prepare their camera-ready version two weeks after the end of ISCO 2012.

b) Short papers
They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings and they will be given a 15 min slot for
presentation in the conference.

Special Issues
Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.

Program Committee

Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens

Organizing Committee

Christos Amanatidis, AUEB
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens

________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105

[DMANET] 2nd International Symposium on Combinatorial Optimization (ISCO 2012)

2nd International Symposium on Combinatorial Optimization (ISCO 2012)
April 19-21, 2012

Spring School
"Mathematical Programming and Design of Approximation Algorithms"
April 17-18, 2012

Athens University of Economics and Business,
Athens, Greece

http://isco12.cs.aueb.gr/
(preliminary version)

ISCO is a new biannual symposium with its first issue held in Hammamet,
Tunisia in March 2010. The symposium aims to bring together researchers from
all the communities related to combinatorial optimization, including
algorithms and complexity, mathematical programming and operations research.
It is intended to be a forum for presenting original research in these areas
and especially in their intersections. Quality papers on all aspects of
combinatorial optimization, from mathematical foundations and theory of
algorithms to computational studies and practical applications, are
solicited.

Spring School

ISCO 2012 will be preceded by a spring school on "Mathematical Programming
and Design of Approximation Algorithms". David Shmoys and David Williamson
will give 16 hours of lectures on April 17-18, 2012.

Invited Speakers

Giorgio Ausiello, Università di Roma "La Sapienza"
Christos Papadimitriou, UC Berkeley
George Nemhauser, Georgia Tech
Paolo Toth, Università di Bologna

Important Dates

Submissions deadline: December 1, 2011
Notification of authors: January 30, 2012
Early registration deadline: February 24, 2012
Spring School: April 17-18, 2012
Conference: April 19-21, 2012
Camera ready version: May 4, 2012

Submission - Publication

Papers presenting original unpublished results in all areas of combinatorial
optimization and its applications are welcome. Topics of interest include,
but are not limited to:
• Approximation algorithms
• Branch-and-bound algorithms
• Branch-and-cut-and-price algorithms
• Computational biology
• Computational complexity
• Computational geometry
• Constraint Programming
• Cutting plane algorithms
• Exact and parameterized algorithms
• Graph and network algorithms
• Interior point methods
• Linear and nonlinear integer programming
• Local search algorithms
• Metaheuristics
• On-line algorithms
• Polyhedral combinatorics
• Randomized algorithms
• Scheduling algorithms

The submission deadline is Thursday December 1, 2011. Simultaneous
submissions to other conferences with published proceedings or journals are
not allowed. Paper submission and reviewing will be handled only via
Easychair. More information about the submission procedure will be available
in due time.

There will be two types of submissions:

a) Regular papers
They should be of at most 12 pages, including front matter and bibliography,
in LNCS style (see http://www.springer.de/comp/lncs/authors.html). Proofs
omitted due to space constraints should be included in a clearly marked
appendix which will be taken into account by the program committee members
and the reviewers, but it will not be published in the proceedings.
Accepted regular papers will be published by Springer-Verlag in the Lecture
Notes in Computer Science (LNCS) series in a post-conference proceedings
volume. For a paper to be included in this volume, it should be presented at
the conference by one of the authors in a 30 min talk. The authors will have
to prepare their camera-ready version two weeks after the end of ISCO 2012.

b) Short papers
They should be of at most 4 pages (including front matter and bibliography)
with no optional appendix. Accepted short papers will be included in a
volume of local proceedings and they will be given a 15 min slot for
presentation in the conference.

Special Issues
Selected papers presented at the conference will be invited to special
issues devoted to the event that will be published in international
journals.

Program Committee

Mourad Baïou, Université Blaise Pascal, Clermont-Ferrand
Evripidis Bampis, Université Pierre et Marie Curie
Francisco Barahona, IBM T. J. Watson, New York
Walid Ben-Ameur, TELECOM SudParis
Jaroslaw Byrka, University of Wrocław
William Cook, Georgia Tech
Gerard Cornuéjols, CMU
Federico Della Croce, Politecnico di Torino
Josep Diaz, Universitat Politecnica de Catalunya
Bruno Escoffier, Université Paris Dauphine
Satoru Fujishige, Kyoto University
Eric Gourdin, Orange Labs, Paris
Luis Gouveia, University of Lisbon
Anupam Gupta, CMU
Mohamed Haouari, INSAT, Tunis
Brahim Hnich, Izmir University of Economics
Klaus Jansen, Christian-Albrechts-Universität, Kiel
Stavros Kolliopoulos, NKUA, Athens
Jochen Könemann, University of Waterloo
Andrea Lodi, Università di Bologna
Nelson Maculan, Universidade Federal do Rio de Janeiro
A. Ridha Mahjoub, Université Paris Dauphine (co-chair)
Alberto Marchetti-Spaccamela, Università di Roma "La Sapienza"
Vangelis Markakis, AUEB, Athens
Tom McCormick, University of British Columbia
Ioannis Milis, AUEB, Athens (co-chair)
Jérôme Monnot, Université Paris Dauphine
Vangelis Paschos, Université Paris Dauphine
Gerhard Reinelt, Universität Heidelberg
Giovanni Rinaldi, IASI-CNR, Roma
Amin Saberi, Stanford University
François Vanderbeck, Université Bordeaux 1
Peter Widmayer, ETH, Zürich
Gerhard Woeginger, Eindhoven University of Technology
Hande Yaman, Bilkent University, Ankara
Vassilis Zissimopoulos, NKUA, Athens

Organizing Committee

Christos Amanatidis, AUEB
Katerina Kinta, Université Paris Dauphine
Anna Klouvatou, RC-AUEB, Athens
Giorgio Lucarelli, Université Paris Dauphine
A. Ridha Mahjoub, Université Paris Dauphine
Vangelis Markakis, AUEB, Athens
Ioannis Milis, AUEB, Athens
Vangelis Paschos, Université Paris Dauphine
Georgios Zois, AUEB, Athens

________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105

**********************************************************
*
* 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: ICONS 2012 || February 29 - March 5, 2012 - Reunion Island

INVITATION:

=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results.
The submission deadline is set to October 5, 2011.
A video of the 2011 event is available on the conference front page:
http://www.iaria.org/conferences2012/ICONS12.html
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================

============== ICONS 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICONS 2012: The Seventh International Conference on Systems
February 29 - March 5, 2012 - Reunion Island

General page: http://www.iaria.org/conferences2012/ICONS12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPICONS12.html

- regular papers
- short papers (work in progress)
- posters
- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitICONS12.html

Submission deadline: October 5, 2011

Sponsored by IARIA, www.iaria.org

Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Please note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

ICONS 2012 Topics (topics and submission details: see CfP on the site)

Systems' Theory and Practice
Systems design methodologies and techniques; Formal methods to specify systems? behavior; Online and offline systems; Open and closed systems; Centralized and distributed systems; Proactive and reactive systems; System robustness; Systems scalability; Fault-tolerant systems; Feedback systems; High-speed systems; Delay tolerant systems; Real-time systems

Systems engineering
Systems requirements; Systems modeling; Systems development lifecycle; System-of-systems; Systems ergonomics; Subsystem interactions; Systems decomposition; Systems integration

System Instrumentation
Metering embedded sensors; Composing multi-scale measurements; Monitoring instrumentation; Smart sensor-based systems; Calibration and self-calibration systems; Instrumentation for prediction systems

Embedded systems and systems-on-the-chip
Real-time embedded systems Programming embedded systems; Controlling embedded systems; High speed embedded systems; Designing methodologies for embedded systems; Performance on embedded systems; Updating embedded systems; Wireless/wired design of systems-on-the-chip; Testing embedded systems; Technologies for systems processors; Migration to single-chip systems; Micro/nano structures and systems

Target-oriented systems [emulation, simulation, prediction, etc.]
Information systems; Real-time systems; Software systems; Hardware systems; Emulation systems; Simulation systems Prediction systems

Specialized systems [sensor-based, mobile, multimedia, biometrics, etc.]
Sensor-based systems; Biometrics systems; Mobile and fixed systems; Ubiquitous systems; Nano-technology-based systems; Multimedia systems

Validation systems
Diagnosis assistance systems; Test systems; Validation systems; Performance measurement systems; Maintenance systems

Security and protection systems
Security systems; Vulnerability detecting systems; Intrusion detection systems Intrusion avoidance systems; Presence detection systems; Monitoring systems; Management systems; Alert systems; Defense systems; Emergency systems

Advanced systems [expert, tutoring, self-adapting, interactive, etc.]
Expert systems; Tutoring systems; Highly interactive systems; Anticipative systems; On-demand systems; GRID systems; Autonomic systems; Autonomous systems; Self-adapting systems; Adjustable autonomic systems; High performance computing systems; Mission critical systems

Application-oriented systems [content, eHealth, radar, financial, vehicular, etc.]
Web-cashing systems; Content-distributed systems; Accounting and billing systems; E-Health systems; E-Commerce systems; Radar systems; Navigation systems; Systems for measuring physical quantities; Earthquake detection and ranking systems; Financial systems; Robotics systems; Vehicular systems; Entertainment systems; Gaming systems; Speech recognition system

Safety in industrial systems
Fundamentals on system safety; Safety of software systems and software engineering; Safety requirements; Safety for critical systems; Engineering for system robustness and reliability; Control of mission critical systems; Safety-oriented system design; Human tasks and error models; Hazard analysis; Cost and effectiveness of system safety; Verification and validation of safety; Safety tools; Evaluation of safety data, and mitigation and prevention strategies; Safety control and management; System Safety Implementation Guidelines and Standards; Transferring safety knowledge; Metrics for Risk Assessment; Contingency Planning and Occurrence Reporting; Preparedness Activities; Industry specific safety systems (Medical devices, Aerospace, Chemical industry, Nuclear power plants, Public health, Biological Safety)

Complex systems
Theory of complex systems; Ontologies for complex systems; Chaos and complexity; Design and integrate complex systems; Complexity and simulation; Simulation and datamining; Artificial intelligence and soft computing in complex systems; Multi-agent based simulation; Systems of systems; Intelligent agent architectures; Evolutionary programming; Uncertainty reduction and classification; Monitoring and managing complex systems; Case studies of complex systems [vehicular, avionic, health, emergency, sensing, etc.]; Industrial systems [robotics, production, accounting and billing, e-commerce, etc.]

Committee: http://www.iaria.org/conferences2012/ComICONS12.html

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

PhD POSITIONS: PhD Student Positions in Future Vehicular Systems: Algorithms and Networking

http://www.chalmers.se/cse/EN/news/vacancies/positions/phd-student-position-in6577

 

Computer Science and Engineering

 

PhD Student Positions in Future Vehicular Systems: Algorithms and Networking Reference number 2011/194 Application deadline 2011-09-30   The department of Computer Science and Engineering provides a strong, international, and dynamic research environment with about 70 faculty and 70 PhD students from about 30 countries. For more information, see www.chalmers.se/cse/EN/. The Distributed Computing and Systems research group www.cse.chalmers.se/research/group/dcs/ conducts research with high-impact internationally on the design and analysis of distributed algorithms and systems, fault tolerance (with emphasis on self-stabilization and game theory), runtime systems, and parallel algorithms and data structures for highly parallel, heterogeneous, many-core systems. The group is running a set of national and international projects in the area and participates on a recently started European Project on vehicular systems and their networks (KARYON).   Job description The research focuses on vehicular systems and networks with an emphasis on their algorithms and programming. The project’s context is on the algorithmic design of communication protocols for vehicular networks (VANETs), replication schemes for VANETs, algorithmic support for vehicle cooperation and reliable distributed assessment of global system state. This work involves both the system algorithmic design and proof of concept implementation. The employment is expected to start autumn 2011 (small deviations are negotiable). As a Ph.D. student you are employed by Chalmers and will receive a salary according to current salary agreements (starting salary at present: approx. 25000SEK before taxes). A maximum of 20% of your time will be devoted to other duties at the department, mainly teaching. The remaining time will be devoted to your own courses and research within the project and you are expected to obtain a Ph.D. within a maximum of 5 years.   Required qualifications Applicants shall have a Master’s Degree or corresponding (Sw. civilingenjörsexamen) in Computer Science, Computer Engineering, or in a related discipline. As for all PhD studies, a genuine interest and curiosity in the subject matter and excellent analytical and communication skills, orally as well as literally, are needed. Further, since the research work normally involves developing and testing analytical techniques, good programming skills are important. A successful candidate should have a profound interest in distributed algorithms and programming for wireless communication systems. It will be very useful if your application includes parts of your own work, such as theses and articles that you have authored or co-authored. Please notice also that it is highly recommended that you include or e-mail letters of recommendation; we typically get a large number of applications, and it is not feasible for us to request individual letters. You may apply even though you might not have completed your degree yet, but expect to do so before the position starts. Knowledge of Swedish is not a prerequisite for applying since English is our working language for research, and we publish internationally. Both Swedish and English are used in undergraduate courses. Half of our researchers and PhD students at the department come from more than 30 different countries.   Application procedure The application shall be written in English and include the following items: 1.     An application of a maximum of one A4 page containing your specific qualifications for the position 2.     Attested copies of education certificates, including grade reports and other documents 3.     Curriculum Vitae 4.     Letters of recommendation and name of reference persons (optional) The application shall be sent electronically as pdf or zipped documents. Please use the button at the foot of the page to reach the application form. If any material is not available electronically or cannot be transferred to pdf format, the material can be sent as a hard copy to Registrar. The applicants name and the reference number (2011/194) must be written on the first page of the application. Address: Registrar Chalmers University of Technology SE-412 96 Göteborg Sweden   Further information It will be very useful if your application includes parts of your own work such as theses and articles that you have authored or co-authored. Please notice also that it is highly recommended that you include or e-mail letters of recommendation; we typically get a large number of applications, and it is not feasible for us to request individual letters.   If you have questions, please feel free to contact us: Research level: Elad Michael Schiller e-mail: elad@chalmers.se Doctoral education level: Jan Jonsson e-mail: janjo@chalmers.se Division level: Peter Lundin e-mail: peter.lundin@chalmers.se   Union representatives ·       SACO: Jan Lindér ·       ST: Marie Wenander ·       SEKO: Johan Persson All reachable via Chalmers exchange: +46 31 772 10 00

 

 

 

[DMANET] Wiss. Mitarbeiter Algorithmische Spieltheorie, Universität Paderborn

Am Institut für Informatik der Universität Paderborn ist im Rahmen des SFB
"On-The-Fly Computing" ab sofort die Stelle einer wissenschaftlichen
Mitarbeiterin/
eines wissenschaftlichen Mitarbeiters (Entgeltgruppe 13 TV-L) mit
Arbeitsschwerpunkt
(Approximations-)Algorithmen / algorithmische Spieltheorie zu besetzen.

Die vollständige Stellenausschreibung (s.u.) findet sich auch auf der
Webseite
sfb901.uni-paderborn.de/stellenangebote.html. Für Nachfragen stehe ich
jederzeit
gerne zur Verfügung.

Patrick Briest

---------------------------------------
In der Fakultät für Elektrotechnik, Informatik und Mathematik wird am
Institut für
Informatik im Teilprojekt A3 des Sonderforschungsbereich 901 „On-The-Fly
Computing" (http://sfb901.upb.de) zum nächstmöglichen Termin eine/ein

wissenschaftliche Mitarbeiterin/wissenschaftlicher Mitarbeiter
(Entgeltgruppe 13 TV-L)

gesucht. Es handelt sich um eine zunächst auf ein Jahr zeitlich und
inhaltlich
befristete Tätigkeit im Rahmen des von der DFG geförderten Sonderforschungs-
bereichs im Umfang von 100 % der regelmäßigen Arbeitszeit. Eine
Verlängerung
der Tätigkeit auf bis zu 4 Jahren ist möglich. Die Möglichkeit zu einer
Promotion
ist gegeben und ein Promotionsvorhaben wird im Rahmen dieser Tätigkeit
ausdrücklich unterstützt.

Aufgabengebiet:

Ziel des Teilprojektes A3 ist die Entwicklung und theoretische Analyse
von Markt-
und Interaktionsformen für den Handel mit individualisierten
IT-Dienstleistungen.
Ein Schwerpunkt der Forschung sind algorithmische Aspekte der
Preisbildung und
-optimierung, sowie unterschiedlicher Allokationsverfahren (z.B.
kombinatorische
Auktionsmechanismen) in großen dynamischen Märkten. Eine interdisziplinäre
Zusammenarbeit mit Kollegen aus der Mikroökonomie und der empirischen
Wirtschaftsforschung wird ausdrücklich gewünscht.

Anforderungen:

• abgeschlossenes Hochschulstudium (Diplom oder Master) der Informatik,
Wirtschaftsinformatik oder einer verwandten Fachrichtung, insbesondere
auch der (Wirtschafts-)Mathematik
• fundierte Kenntnisse der theoretischen Informatik, etwa im Bereich der
Algorithmen & Komplexitätstheorie bzw. der (algorithmischen) Spieltheorie

Bewerbungen von Frauen sind ausdrücklich erwünscht und werden gem. LGG bei
gleicher Eignung, Befähigung und fachlicher Leistung bevorzugt
berücksichtigt,
sofern nicht in der Person eines Mitbewerbers liegende Gründe überwiegen.
Teilzeitbeschäftigung ist grundsätzlich möglich.
Die Bewerbung geeigneter Schwerbehinderter und Gleichgestellter im Sinne
des
Sozialgesetzbuches Neuntes Buch (SGB IX) ist erwünscht.
Auf Wunsch des Bewerbers/ der Bewerberin wird der Personalrat der
wissenschaftlichen und künstlerischen Beschäftigten (WPR) bei der
Einstellung
beteiligt.

Bewerbungen mit den üblichen Unterlagen werden unter Angabe des
Kennzeichens „SFB 901 – TP A3/1" bis zum 31.08.2011 erbeten an:

Universität Paderborn
Geschäftsführung des SFB 901
z.H. Herrn Dr. Ulf-Peter Schroeder
Institut für Informatik
Fürstenallee 11
33102 Paderborn
---------------------------------------
**********************************************************
*
* 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: ICN 2012 || February 29 - March 5, 2012 - Reunion Island

INVITATION:

=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results.
The submission deadline is set to October 5, 2011.
A video of the 2011 event is available on the conference front page:
http://www.iaria.org/conferences2012/ICN12.html
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================

============== ICN 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICN 2012: The Eleventh International Conference on Networks
February 29 - March 5, 2012 - Reunion Island

General page: http://www.iaria.org/conferences2012/ICN12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPICN12.html

- regular papers
- short papers (work in progress)
- posters
- ideas

Submission page: http://www.iaria.org/conferences2012/SubmitICN12.html

Submission deadline: October 5, 2011

Sponsored by IARIA, www.iaria.org

Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org

Please note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

ICN 2012 Topics (topics and submission details: see CfP on the site)

1. Communication theory
2. Communications switching and routing
3. Communications modeling
4. Communications security
5. Computer communications
6. Distributed communications
7. Signal processing in communications
8. Multimedia and multicast communications
9. Wireless communications (satellite, WLL, 4G, Ad Hoc, sensor networks)
10. Next generation networks [NGN] principles
11. Storage area networks [SAN]
12. Access and home networks
13. High-speed networks
14. Optical networks
15. Peer-to-peer and overlay networking
16. Mobile networking and systems
17. MPLS-VPN, IPSec-VPN networks
18. GRID networks
19. Broadband networks
20. Quality of service, service level agreement [QoS/SLA]
21. Reliability, availability, serviceabiliy [RAS]
22. Traffic engineering, metering, monitoring
23. Voice over IP services
24. Performance evaluation, tools, simulation
25. Network, control and service architectures
26. Network signalling, pricing and billing
27. Network middleware
28. Telecommunication networks architectures
29. On-demand networks, utility computing architectures
30. Applications and case studies
31. NGN protocol design and evaluation
32. NGN Standard Activities [ITU, TMF, 3GPP, IETF, etc.]
33. NGN Device Instrumentation
34. Network Management, scheduling and policy
35. NGN policy-based control
36. Networks policy-based management
37. Management of autonomic networks and systems
38. Vehicular Networks

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

[DMANET] New of "Graph Theory" section of the journal DMTCS

Announcing the formation of a new section on Graph Theory in
the open-access journal Discrete Mathematics and Theoretical Computer
Science (DMTCS).

DMTCS is a high standard peer-reviewed electronic journal devoted to
rapid publication of innovative research in the fields of Discrete
Mathematics and Theoretical Computer Science with an emphasis on the
intersection of the two. It is one of the earliest open-access journal
in the fields, and is listed by ISI.

The Graph Theory section covers research in all aspects of finite graphs
but with a slight preference to papers with results showing some
connection to computer science. We are very interested in high quality
submissions and aim to keep a very high standard for accepted papers.

I am proud to announce a strong board of section editors whose expertise
will warrant that papers will be judged competently.

Section editors
* Joergen Bang-Jensen, University of Southern Denmark, Denmark
* Maria Chudnovsky, Columbia University, USA
* Frederic Havet, CNRS, Sophia Antipolis, France
* Michael Henning, University of Johannesburg, South Africa
* Jing Huang, University of Victoria, Canada
* Tomas Kaiser, University of West Bohemia, Czech Republic
* Ken-ichi Kawarabayashi, NII, Tokyo, Japan
* Peter Keevash, Queen Mary University of London, England
* Jan Kratochvil, Charles University, Praha, Czech Republic
* Matthias Kriesell, University of Southern Denmark, Denmark
* Zsolt Tuza, Hungarian Academiy of Sciences, Hungary
* Anders Yeo, Royal Holloway, University of London, England

The Editor-in-Chief of DMTCS is Jens Gustedt, INRIA Nancy - Grand Est.

Jørgen Bang-Jensen,
Professor, Dr. Scient, Ph.D. IMADA University of Southern Denmark, Odense
phone +4565502335 mobile +4560112335
**********************************************************
*
* 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] GCB 2011 - Call for Participation

Dear Colleague,

the German Conference on Bioinformatics comes in 2011 to Weihenstephan,
the Life and Food Science Center of the Technische Universität München
and is entitled

BIOINFORMATICS FROM Genes and Sequences TO Medical Systems Biology

The preliminary program is now available at

www.gcb2011.de/program.html

The GCB 2011 will join distinguished prominent speakers and the national
and regional bioinformatics community. You will make the conference a
success, we will do our best.

GCB Juniors, a special section this year is dedicated to young
scientists, opening a chance for a first public presentation of fresh
and exciting results.

Please register at

https://ssl.dechema.de/en/gcb11_registration

and see you at GCB 2011!

H. Werner Mewes, Technische Universität München
Ralf Zimmer, Ludwig-Maximilians-Universität München
Chair of the GCB 2011

________________________________

Contact: karen.breitzler@helmholtz-muenchen.de
Web: www.gcb2011.de
Registration: https://ssl.dechema.de/en/gcb11_registration
**********************************************************
*
* 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] UMIT (Austria) postdoc position in applied mathematics

For a project funded by the Austrian Science Foundation (FWF), we are
seeking for a highly motivated postdoctoral researcher. This position is
available from Januar 2012.

The applicant must have the following essential skills:

- Strong analytical background in graph theory and preferably also in
information theory and inequalities. Also, profound knowledge and research
experience in quantitative graph theory would be ideal.

- Knowledge in quantitative graph theory should comprise structural
analysis of graphs, general graph measures, structural complexity,
topological descriptors, and information-theoretic methods.

- Programming skills in R/python/Java/C preferably in a Linux environment.

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

Moreover, good communication skills are also necessary. The successful
candidate should have a PhD in mathematics, computer science, or physics.

Interested applicants should e-mail curriculum vitae, publication list, a
cover letter expressing research interests and areas, and the contact
information of
two references to Matthias Dehmer (matthias.dehmer@umit.at).

Contact:

Prof. Dr. Matthias Dehmer
UMIT, Hall in Tyrol, Austria

**********************************************************
*
* 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] New Trends in Mechanism Design, Sep 6 - 9, 2011, Copenhagen - Final call for participation

NEW TRENDS IN MECHANISM DESIGN

September 6-9, 2011
Copenhagen Business School
Denmark

Workshop and Summer School organized by
CFEM, cfem.au.dk
Center for Research in the Foundations of Electronic Markets

New Trends in Mechanism Design will bring together researchers from
economics and computer science working on the design and analysis of
economic mechanisms and on applications of such mechanism to solve
real-life economic problems for companies, organizations and governments.

Tutorials are given by Peter Cramton, Jason Hartline and Tim
Roughgarden. Keynote presentations are given by Rick Antle, Uri Feige,
Nicole Immorlica and Herve Moulin.

Scientific Organizers: Peter Bogetoft and Peter Bro Miltersen.

For a full program and registration details, please visit:
http://cfem.au.dk/newsevents/mechdesign.
Please register by August 15.

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

[DMANET] PhD Course "Advanced Randomized Topics in Computer Science"

Dear all,

Konstantinos Panagiotou, Thomas Sauerwald, Reto Spöhel and me (all MPI
Informatics, Saarbrücken) are teaching a block course (4 weeks,
September 12 to October 7, each week a different topic) on advanced
randomized topics in CS:

- Mastermind, Black-Box Complexity and Other Guessing Games (B. Doerr)
- The Power of Two Choices (R. Spöhel)
- Models for Complex Networks (K. Panagiotou)
- Randomized Rumor Spreading (T. Sauerwald)

The primary audience are PhD or Master students from Saarland
University, but participants from other places are equally welcome. A
strong theory background is mandatory. More details can be found at

http://www.mpi-inf.mpg.de/departments/d1/teaching/ws11/armcs/

If you have students who might be interested, please spread this rumor.

All the best
Benjamin Doerr
**********************************************************
*
* 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] Open position in algorithms project at University of Wuerzburg

The Chair for Computer Science I ("Efficient Algorithms and
Knowledge-Based Systems") at the University of Würzburg offers a 3-year
position for a

Research Assistant

in the project

Algorithms for Interactive Variable-Scale Maps

funded by the German Research Foundation (DFG).

Please find a detailed description at:

http://www1.informatik.uni-wuerzburg.de/en/news/single/artikel/neues-dfg/

Jan-Henrik Haunert
Chair for Computer Science I
University of Würzburg
Am Hubland
97074 Würzburg, Germany

tel.: +49 931 31 88668
http://www1.informatik.uni-wuerzburg.de/mitarbeiter/haunert_jan_henrik/
**********************************************************
*
* 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] Fully Funded Ph.D. Studentship in Logic and Graph Theory at the Technical University Berlin

The Logic and Semantics Research Group at the Institute for
Software Engineering and Theoretical Computer Science at
the Technical University, Berlin, Germany, is offering a fully
funded Ph.D. studentship in the area of logic or graph theory.

The closing date for applications is 28th August 2011.

See http://logic.las.tu-berlin.de for further information.

The research pursued in the group revolves around finite and
computational model theory, algorithmic and structural graph
theory, database theory, automata-theory and temporal and
modal logics in the context of verification.

Candidates must have a degree (master or diploma level) in
Computer Science or Mathematics and must have a strong
interest in theoretical computer science. Furthermore, candidates
should have good knowledge in at least one of the following
areas:
-- Structural or algorithmic graph theory, such as graph
decompositions, graph minor theory or matroid theory,
parametrized and general graph algorithms.
-- Logic, broadly construed, in particular areas such as finite
and computational model theory, automata theory, database
theory and verification

Good command of English is expected. Knowledge of German is not
required.

The position is fully funded. The successful candidate will be expected to participate in teaching for up to four hours a week during term time,
usually in form of tutorials and assistance with reading courses.

See http://logic.las.tu-berlin.de for further information on the application
procedure.

For further inquiries please contact

Stephan Kreutzer,
email: stephan.kreutzer@tu-berlin.de,
tel: +49 30 314 29088.
http://logic.las.tu-berlin.de/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Deadline Extension by August 12 --- CFP of IPCCC 2011

Apologies if you've received multiple copies of this email.

------------------------------------------------------
IEEE IPCCC 2011
The 30th IEEE International Performance, Computing,
and Communication Conference (IPCCC) 2011
http://www.ipccc.org/
November 17-19, 2011
Orlando, Florida, USA

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

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

FULL PAPERS: Full paper submissions may not exceeds 8 pages. The paper submission site in EDAS is http://edas.info/newPaper.php?c=10811. All papers will be reviewed by the Technical Program Committee. They will be judged with respect to their quality, originality, and relevance. Accepted papers will be published in the conference proceedings, conditional upon the author's advance registration and attendance at the conference.

POSTERS: We welcome submissions of poster applications in the form of a two-page extended abstract in PDF format. A subset of full paper submissions will also be invited to the IEEE IPCCC Poster Session. Accepted posters will be presented on the night of November 18 (Friday) and the extended abstracts will be included in the conference proceedings. Send Extended Abstracts to the Poster Chair, Dr. Fan Wu (fwu@cs.sjtu.edu.cn), by August 15, 2011.

WORKSHOPS AND PANELS: Proposals for panel sessions and workshops are welcome. Please contact the Workshop Chair (Tingting Chen, tingtingch@gmail.com ) for details.

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

ORGANIZING COMMITTEE
----------------------
General Chair:
Sheng Zhong, SUNY Buffalo, USA
Vice General Chairs:
Steven Ko, SUNY Buffalo, USA
Chengkai Li, University of Texas at Arlington, USA
Program Chairs:
Dejing Dou, University of Oregon, USA
Yu Wang, University of North Carolina at Charlotte, USA
Poster Chair:
Fan Wu, Shanghai Jiao Tong University, China
Publications Chair:
Song Fu, University of North Texas, USA
Workshop Chair:
Tingting Chen, Oklahoma State University
Publicity Chair:
Liehuang Zhu, Beijing Institute of Technology, China
Web Chair:
Neil Nelson, USA
Financial Chair:
Nasr Ullah, Freescale Semiconductor, USA
Registration Chair:
Jack Chen, Cisco, USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] FW: Heilbronn Research Fellows vacancies at University of Bristol, UK

Heilbronn Research Fellow

£33,734 - £44,016

Bristol, UK

The School of Mathematics invites applications for a Research Fellowship in association with the Heilbronn Institute for Mathematical Research.

You will divide your time equally between your own research and the research programme of the Heilbronn Institute. We seek candidates with skills in areas of statistical data mining such as semi-supervised learning, recommender systems and information flow in graphs: however, your own data mining or statistical research need not be directly in such areas.

The Fellowship will be for three years, with a preferred start date of January 2012. Due to the nature of the Heilbronn Institute's work, you must satisfy vetting before appointment. UK Nationals will normally be able to meet this condition: other potential candidates should consult the Director about their eligibility before applying. Research expenses of at least £2,000 will also be available.

Enquiries about the fellowship may be addressed to Dr Oliver Johnson, School of Mathematics, telephone +44(0)117 928 8632, e-mail: assoc-director-himr@bristol.ac.uk and enquiries about the work of the Heilbronn Institute may also be addressed to the Director of the Institute, Professor Malcolm MacCallum, telephone +44(0)117 980 6303, e-mail: m.a.h.maccallum@bristol.ac.uk

Applications should include a statement of proposed research (not more than one side of A4). You should ask three referees to send references by the closing date to: Ms Chrystal Cherniwchan, School of Mathematics, University of Bristol, BS8 1TW or email: Chrystal.Cherniwchan@bristol.ac.uk. It is your own responsibility to ensure that the reference letters are received by the closing date (these may be sent by email also).

For further details and an application form please visit www.bristol.ac.uk/jobs Alternatively you can e-mail recruitment@bristol.ac.uk or telephone +44 (0) 117 954 6947, quoting the reference number 16520.

The closing date for applications is 9.00am, Thursday 1 September 2011.

Interview date: Friday 23 September 2011.

EXCELLENCE THROUGH DIVERSITY

**********************************************************
*
* 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: Springer's PPNA Special Issue on M2M Communications

Peer-to-Peer Networking and Applications (ISI indexed)
Special Issue Call for Papers
The Green, Reliability and Security of Machine-to-Machine Communications

Machine-to-machine communications is an emerging technology that
realizes a system of networks, wireless or wired, possibly distributed
across the world, for transmitting events captured by low-end machines
such as sensors and smart meters to high-end applications and/or
personal appliances, where the events are translated into meaningful
information. It embraces several major research fields including
wireless sensor networks, vehicular networks, smart grid and RFID, and
enables future ubiquitous computing environment. Unlike current
world-scale human-centric 3G wireless networks, M2M communication
network is characterized by the absence of direct human intervention and
the rapid increase in size and is therefore imposed with unique
requirements.

With ever-decreasing cost of deployment of M2M communication devices and
access to public wireless data networks, and thanks to its potential to
support a large number of ubiquitous characteristics and achieving
better cost efficiency, M2M communications has quickly become a market-
changing force for a wide variety of real-time monitoring applications,
such as remote e-healthcare, smart homes, utility management,
environmental monitoring and industrial automation. However, the
flourishing of M2M communications still hinges on fully understanding
and managing the existing GRS challenges: Green (i.e., energy
efficiency), Reliability and Security.

The objective of this special issue is to bring together state-
of-the-art contributions on the GRS aspects of M2M communications. It
aims to provide an environment conducive of cross-fertilization between
researchers from different areas spanning wireless sensor networks,
vehicular networks, smart grid and RFID, all relevant, in one way or
another to the advance and realization of M2M communication paradigm.
Original, unpublished contributions are solicited in ALL aspects of M2M
communications.

Possible topics of interest include, but are certainly not limited to
the following:
* GRS in wireless sensor, actuator and robot networks
* GRS in vehicular networks and intelligent transportation systems
* GRS in smart grid
* GRS in RFID technologies
* GRS in interworking for M2M communication
* GRS modeling for M2M communication
* GRS in emerging M2M applications

IMPORTANT DATES
* Paper submission deadline: November 15, 2011
* Notification to authors: March 1, 2012
* Revisions: April 15, 2012
* Data of Publication: 2012

PAPER SUBMISSION
Authors are encouraged to submit high-quality, original work that has
neither appeared in, nor under consideration by, other journals.
Springer offers authors, editors and reviewers of Peer-to-Peer
Networking and Applications a web-enabled online manuscript submission
and review system. Our online system offers authors the ability to track
the review process of their manuscript. This online system offers easy
and straightforward long-in and submission procedures, and supports a
wide range of submission file formats. Manuscripts should be submitted
to: http://PPNA.edmgr.com. Choose "The GRS of M2M Communications" as the
article type.

To avoid delays, authors of submissions that, in the opinion of the
editors, fall out of scope of this issue will be notified promptly.

GUEST EDITORS
Dr. Xu Li, INRIA Lille – Nord Europe, France
Dr. Xiaodong Lin, University of Ontario Institute of Technology, Canada
Dr. Nathalie Mitton, INRIA Lille – Nord Europe, France
Dr. Wenye Wang, North Carolina State 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/
*
**********************************************************

[DMANET] PhD position in Cologne (German)

Die Arbeitsgruppe Faigle/Schrader am Lehrstuhl Prof. Faigle des
Mathematischen Instituts/Instituts für Informatik der Universität zu
Köln, sucht zum 01.10.2011, befristet bis 31.07.2012, in Vollzeit (39,83
Wochenstunden), eine/n

wissenschaftliche/n Mitarbeiter/in (Entgeltgruppe 13 TV-L)

Wir suchen eine Hochschulabsolventin oder einen Hochschulabsolventen der
Mathematik oder Informatik.
Erwartet werden gute Kenntnisse der Algorithmik und der Mathematik des
Operations Research
(insbesondere diskrete Mathematik und Optimierung) und Interesse an
Fragestellungen der Mathematik und Informatik.

Aufgabe der Stelleninhaberin/ des Stelleninhabers ist die Unterstützung
der Arbeit der Arbeitsgruppe,
insbesondere der Betreuung der Studenten, das Abhalten von Übungen und
die Mitarbeit an Forschungsprojekten. Geboten wird eine intensive
wissenschaftliche Förderung und die Möglichkeit zur Promotion zum Dr.
rer. nat.
Bewerbungen von schwerbehinderten Menschen sind besonders willkommen.

Schwerbehinderte Menschen werden bei gleicher Eignung bevorzugt.
Bewerbungen von Frauen sind ausdrücklich erwünscht. Frauen werden bei
gleicher Eignung, Befähigung und fachlicher Leistung bevorzugt
berücksichtigt,
sofern nicht in der Person eines Mitbewerbers liegende Gründe überwiegen.

Ihre Bewerbungen senden Sie bitte bis zum 25.08.2011 an:
Annette Koenen
Arbeitsgruppe Faigle/Schrader
Universität zu Köln
Weyertal 80
D-50931 Köln
koenen@zpr.uni-koeln.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************