Thursday, March 31, 2011

[DMANET] Ottawa-Carleton Discrete Math Days : 13-14 May : Ottawa, Canada

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

Discrete Mathematics Days 2011
13-14 May 2011

http://web5.uottawa.ca/www5/mnewman/dmd11/

University of Ottawa and Carleton University
Ottawa, Canada

Sponsored by The Fields Institute

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


The joint Ottawa-Carleton Discrete Mathematics Days 2011 will be
held May 13-14, 2011, at the University of Ottawa.


The invited speakers are:
Ed Bender, University of California at San Diego
Jim Geelen, University of Waterloo
William Martin, Worcester Polytechnic Institute
Wendy Myrvold, University of Victoria
Leonard Soicher, Queen Mary University of London


We will be accepting 25-minute contributed talks in any area of
discrete mathematics. Titles and abstracts (text or LaTex only
please) should be sent to Jason Gao (zgao at math.carleton.ca)
and Mike Newman (mnewman at uottawa.ca) by April 13.

We may be able to offer partial travel support to graduate
students and postdocs. Applications should be sent to Jason Gao
(zgao at math.carleton.ca) and Mike Newman (mnewman at
uottawa.ca) by April 13.


For more details visit http://web5.uottawa.ca/www5/mnewman/dmd11/


We look forward to seeing you in Ottawa!

Jason Gao
Mike Newman
(organizers)
**********************************************************
*
* 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] ipco announcement

IPCO 2011: Registartion is now open

The 15th Conference on Integer Programming and Combinatorial Optimization
(IPCO XV) will be held June 15-17, 2011 in Yorktown Heights, New York, USA.

The list of accepted papers and the program can be found at the conference
website: http://ipco2011.uai.cl

Early registration ends May 15, 2011.

Mathematical Optimization Society members and students receive a discounted
rate for the conference.

--
IPCO 2011 organization committee
*ipco2011help@gmail.com*

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

------------------------------------------------------------------
CALL FOR PAPERS

11TH WORKSHOP ON ALGORITHMIC APPROACHES FOR TRANSPORTATION
MODELING, OPTIMIZATION, AND SYSTEMS (ATMOS)

September 8, 2011
Saarbruecken, GERMANY

http://algo2011.mpi-inf.mpg.de/index.php?id=17

------------------------------------------------------------------
SCOPE
-----

The ATMOS 2011 workshop will be held in connection with ALGO 2011,
hosted by Max Planck Institut fuer Informatik, which will take place
in Saarbruecken, on September 8, 2011.

Since 2000, the series of ATMOS workshops brings together researchers
and practitioners who are interested in all aspects of algorithmic
methods and models for transportation optimization and provides a
forum for the exchange and dissemination of new ideas and techniques.

Transportation networks give rise to very complex and large-scale
network optimization problems requiring innovative solution techniques
and ideas from mathematical optimization, theoretical computer
science, and operations research. Applicable tools and concepts
include those from graph and network algorithms, combinatorial
optimization, approximation and online algorithms, stochastic and
robust optimization.

The scope of the workshop comprises all modes of transportation.

------------------------------------------------------------------
INVITED SPEAKER
---------------
Carlo Mannino, Universita di Roma "La Sapienza"

------------------------------------------------------------------
IMPORTANT DATES
---------------
SUBMISSION DEADLINE: June 24, 2011, 23:59 GMT
NOTIFICATION OF AUTHORS: July 29, 2011
CAMERA READY SUBMISSION: August 26, 2011
WORKSHOP DATE: September 8, 2011

------------------------------------------------------------------
TOPICS
------
We invite papers for presentation at the workshop on optimization
problems for passenger and freight transport, including -- but not
limited to:

* Infrastructure Planning
* Vehicle Scheduling
* Crew and Duty Scheduling
* Rostering
* Routing in Road Networks
* Novel Applications of Route Planning Techniques
* Demand Forecasting
* Design of Tariff Systems
* Delay Management
* Mobile Applications
* Humanitarian Logistics
* Simulation Tools
* Line Planning
* Timetable Generation
* Routing and Platform Assignment

Of particular interest are: the successful integration of several
(sub)problems or planning stages, algorithms operating in an
online/realtime or stochastic setting, and heuristic approaches
(including approximation algorithms) for real-world instances.

------------------------------------------------------------------
SUBMISSIONS
-----------
Authors are invited to submit an extended abstract or full paper of
at most 12 pages. The paper should contain a succinct statement of
the issues and of their motivation, a summary of the main results,
and a brief explanation of their significance, accessible to
non-specialist readers. Proofs omitted due to space constraints can
be put into an appendix to be read by the program committee members
at their discretion. Papers must be submitted electronically at
http://www.easychair.org/conferences/?conf=atmos2011. The submission
must be received by 23:59 (GMT) on June 24, 2011. Each accepted
paper must be presented at the workshop by one of the authors.

------------------------------------------------------------------
PROCEEDINGS
-----------
The proceedings will be published on the Dagstuhl OpenAccess Series
in Informatics (OASIcs) publication service.

------------------------------------------------------------------
PROGRAM COMMITTEE
-----------------
* Alberto Caprara, Universita di Bologna, ITALY (Co-Chair)
* Francesco Corman, University of Leuven, BELGIUM
* Friedrich Eisenbrand, EPFL, SWITCHERLAND
* Christoph Helmberg, TU Chemnitz, GERMANY
* Spyros Kontogiannis, University of Ioannina, GREECE (Co-Chair)
* Gabor Maroti, Erasmus University Rotterdam, NETHERLANDS
* Elise Miller-Hooks, University of Maryland, USA
* Dario Pacciarelli, Universita degli Studi "Roma Tre", ITALY
* Martin Skutella, TU Berlin, GERMANY
* Sebastian Stiller, TU Berlin, GERMANY
* Peter Widmayer, ETHZ, SWITCHERLAND

------------------------------------------------------------------
STEERING COMMITTEE
------------------

* Alberto Marchetti-Spaccamela Universita di Roma "La Sapienza", ITALY
* Rolf Mohring Technische Universitet Berlin, GERMANY
* Dorothea Wagner Karlsruhe Institute of Technology (KIT), GERMANY
* Christos Zaroliagis University of Patras, GREECE

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

* Alberto Caprara, Universita di Bologna, ITALY
* Spyros Kontogiannis, University of Ioannina, GREECE

------------------------------------------------------------------
SPONSORSHIPS
------------

ATMOS 2011 will be hosted by the Max Planck Institut fuer Informatik,
and is jointly organized by the University of Ioannina and the
Universita di Bologna.

It is also co-sponsored by the following organizations:

* European Association for Theoretical Computer Science (EATCS)
* Research Academic Computer Technology Institute (CTI)

------------------------------------------------------------------
LAST MODIFIED: March 30, 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/
*
**********************************************************

[DMANET] WCO'2011 CFP

4th Workshop on Computational Optimization (WCO 2011)
Szczecin, Poland, 19-21 September, 2011

satellite workshop of 6th International Symposium Advances in Artificial
Intelligence and Applications
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE AND
INFORMATION SYSTEMS
FedCSIS - 2011

http://fedcsis.org/

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

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

* unconstrained and constrained optimization
* combinatorial optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial systems
etc)
* hybrid optimization algorithms involving natural computing techniques
and other global and local optimization methods
* optimization methods for learning processes and data mining
* computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc

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

Important dates:

31.05.2011 (May 31, 2011) – Full paper submission

30.06.2011 (June 12, 2011) – Notification of acceptance

30.07.2011 (July 30, 2011) – Camera-ready version of the accepted paper

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

Submission and Publication


* Authors should submit draft papers (as Postscript, PDF of MSWord file)
* The total length of a paper should not exceed 8 pages (IEEE style). IEEE
style templates are available at http://fedcsis.org/?q=node/22.
* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.
* Accepted and Presented paper will be published in the Conference
Proceedings and included in the IEEE Xplore® database (pending) and indexed
in the DBLP.
* Extended versions of selected papers presented during the conference will
be published as Special Issue(s) of journal(s) to be announced later.
====================


Organizing Committee

Stefka Fidanova, Bulgaria
Josef Tvrdik, Czech Republic
Daniela Zaharie, Romania


--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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/
*
**********************************************************

Wednesday, March 30, 2011

[DMANET] Open Academic Position in Dependable Systems and Formal Methods at ENSTA ParisTech

Apologies if you receive multiple copies of this message

-------------------------------------------------------------------------------------
Open academic position at ENSTA ParisTech (Paris, France)
-------------------------------------------------------------------------------------

The departement of Electronic and Computer Science of ENSTA ParisTech
is seeking candidates for one faculty position (associate professor)
in System Safety and Reliability.
More details are given at:
http://uei.ensta.fr/fiche_ens_cherch_Surete_en.pdf

The departement of Electronic and Computer Science of ENSTA ParisTech
is developping methods and tools in the area of System Safety and
Reliability.

The research activity is focused on the formal verification of
embedded systems taking into account heterogeneity of them like
software/hardware interaction or software/physical environment
interactions. The applicants must have a PhD degree in Computer
Science and they must have some knowledge but not limited in abstract
interpretation, model checking, test generation, type systems, system
modelling.

The application form can be downloaded at
http://uei.ensta.fr/assets/divers/form_candid.rtf

IMPORTANT DATES

The application form must be sent by mail to Bruno Monsuer
(bruno.monsuez@ensta-paristech.fr) before:
May 1st 2011

For further information contact Bruno Monsuez, head of
the departement of Electronic and Computer Science of ENSTA ParisTech:
bruno.monsuez@ensta-paristech.fr

Best regards


---------
Alexandre Chapoutot -- Associate Professor
Address:
ENSTA ParisTech
Unité d'Electronique et d'Informatique
32 boulevard Victor 75739 Paris cedex 15
Phone: +33 1 45 52 49 62
Fax: +33 1 45 52 83 27
Mail: alexandre.chapoutot@ensta-paristech.fr
Web: http://www.ensta.fr/~chapoutot/index.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] 1 year academic position at Université Libre de Bruxelles (ULB, Brussels)

(English translation follows)

---

La Faculté des Sciences de l'Université Libre de Bruxelles (ULB)
annonce la vacance d'un poste académique à temps plein d'une durée de 1
an au Département de Mathématique à partir du 1er octobre 2011.

Il est attendu des candidats qu'ils dispensent un enseignement de
qualité et qu'ils mènent des recherches de haut niveau. Des recherches
dans le domaine de mathématiques discrètes constituent un atout. Les
candidats doivent également être en possession d'une thèse de doctorat
dans un domaine des mathématiques, et avoir publié des articles de
recherche de niveau international. Le candidat renforcera par ses
recherches l'une des équipes de recherche du Département de
Mathématique.

Le (la) titulaire de ce poste enseignera en français à tous les niveaux
en mathématiques pour un total d'environ 120 heures de cours par an (il
est possible que l'intéressé(e) soit amené(e) à encadrer des séances
d'exercice).

La date limite du dépôt des candidatures est fixée au 30/4/2011.

Pour plus d'information, voir :

http://www.ulb.ac.be/facs/sciences/math/

---

The Faculty of Sciences of Université Libre de Bruxelles (ULB,
Brussels) invites applications for a 1 year full-time academic position
within the Department of Mathematics, beginning October 1st 2011.

The successful candidate should be proficient both in teaching and in
research. Publications in Discrete Mathematics are a plus. Candidates
should hold a PhD degree in Mathematics, and have a record of
international-level research publications. The successful candidate
will reinforce one of the research teams of the Department of
Mathematics.

He or she will teach mathematics classes (possibly also exercises), in
french, at all levels, for a total of around 120 lecture hours.

The closing date for applications is April 30th, 2011.

For more information, see :

http://www.ulb.ac.be/facs/sciences/math/

---

Samuel Fiorini
Assistant Professor
Department of Mathematics
Université Libre de Bruxelles
Tel. : +32 2 650 58 88
Fax. : +32 2 650 58 67
URL : http://homepages.ulb.ac.be/~sfiorini
**********************************************************
*
* 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, March 29, 2011

[DMANET] IWOCA papers due April 3

The University of Victoria will be hosting the IWOCA 2011
conference June 20-22, 2011.

Note that the paper submission deadline is this Sunday April 3.
----------------------------------------------------------------
Call for Papers: IWOCA 2011,
22nd International Workshop On Combinatorial Algorithms,
Victoria BC, Canada, June 20-22, 2011.

The series of IWOCA conferences grew out of a 17-year history of AWOCA
meetings (Australasian Workshop on Combinatorial Algorithms). Previous
AWOCA and IWOCA meetings have been held in Australia, Indonesia, Korea,
Japan and the Czech Republic. The 2011 meeting in Victoria, BC, Canada
is the first time that IWOCA will be held in North America.

The topics of the workshop include (but are not restricted to):
- Algorithms and Data Structures,
- Applications (including Bioinformatics, Networking, etc.),
- Combinatorics on Words and Strings,
- Combinatorial Optimization,
- Combinatorial Enumeration,
- Decompositions and Combinatorial Designs,
- Complexity Theory (Structural and Computational),
- Computational Biology,
- Discrete and Computational Geometry (including Graph Drawing),
- Databases (Security, Compression and Information Retrieval), and
- Graph Theory and Combinatorics.

The conference proceedings with invited papers and accepted contributed
papers will be published after the conference as a volume of the
Springer-Verlag Lecture Notes in Computer Science.

The paper submission deadline is April 3, 2011.
The poster submission deadline is May 22, 2011.

For more information about the conference and procedures for submitting
a paper, please see the conference web pages:
http://www.iwoca.org/iwoca2011

A more detailed call for papers which is suitable for posting is available
at:
http://webhome.cs.uvic.ca/~wendym/IWOCA/cfp/cfp.pdf

Some problems from previous conferences:
http://www.iwoca.org/main_iwocaproblems.php

**********************************************************
*
* 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] Polynomial Optimization: Doctoral Student Fellowship, Konstanz

The Department of Mathematics and Statistics at the University of Konstanz, Germany, offers a

Doctoral student fellowship
- salary TV-L E 13/2 -
for 3 years starting in June 2011.

The aim of the thesis is to progress in the THEORY of Polynomial Optimization by solving fundamental questions arising in PRACTICE. The student should therefore have a strong background in algebra and geometry and be able and willing to implement optimization problems using systems for symbolic and numeric computation.

Polynomial Optimization Problems are optimization problems with a polynomial goal function and polynomial inequality constraints. In recent years, methods from Real Algebraic Geometry (sums of squares) and Functional Analysis (truncated moment problem) have been refined in a way that allows to translate a Polynomial Optimization Problem into an equivalent or at least approximating Semidefinite Program.

There is a teaching load of two hours per week attached to the position. Teaching can be done in German or English.

Applications should be sent electronically to:
m.s@uni-konstanz.de
where m.s should be replaced by markus.schweighofer.

Applications received by April 18, 2011, will receive full consideration. However, later applications may be considered as well until the positions have been filled.

Binational doctoral studies with two thesis advisors are conceivable. At least one of the advisors should be Markus Schweighofer.

Links:

Polynomial Optimization:
http://homepages.cwi.nl/~monique/files/moment-ima-update-new.pdf

Konstanz
http://en.wikipedia.org/wiki/Konstanz

Universität Konstanz
http://www.uni-konstanz.de/

Research group
http://cms.uni-konstanz.de/math/schwerpunkt-reelle-geometrie-und-algebra/mitglieder/

Markus Schweighofer
http://www.math.uni-konstanz.de/~schweigh/index.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] CfP: GECCO 2011 Workshop on Bio-Inspired Solutions for Wireless Sensor Networks

************ Apologies for multiple copies received *************

Call for Papers
BIO-INSPIRED SOLUTIONS FOR WIRELESS SENSOR NETWORKS - BIS-WSN 2011
First International Workshop

http://albcom.lsi.upc.edu/bis-wsn-2011/

Dublin, Ireland
July 12/13, 2011


NOTE: This workshop is a satelite workhop of GECCO 2011
http://www.sigevo.org/gecco-2011/

*** Proceedings will be published in ACM Digital Library ***

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

Wireless sensor networks consist of spatially distributed autonomous
computing units that cooperatively monitor a variable property, for
example, environmental conditions such as temperature, sound, vibration,
pressure, motion or pollutants. They are being used in various
application areas, including industrial process monitoring and control,
machine health monitoring, environment and habitat monitoring,
healthcare applications, home automation, and traffic control.

Apart from begin equipped with different sensors, each node in a sensor
network is generally equipped with a very limited battery, a rather
small memory device, a small hard disk, a simple processing unit, and
a radio transceiver or another alternative device for wireless
communication. Some of the algorithmic issues that must be addressed in
sensor networks concern, for example, event detection, data gathering,
object tracking, base station initiated querying, power saving, etc.

The fact that a complex sensor network is composed of simple computing
units has an analogy with certain animal societies, whose individuals
are often very simple but together they result in a much more complex
and capable entity. Thus, from an algorithmic point of view, bio-
inspired solutions, such as swarm intelligence techniques, artificial
immune systems, or evelutionary algorithms may provide valuable
alternatives for solving problems in sensor networks. Genetic and
evolutionary algorithms, for example, may be used to solve large-scale
optimization problems occuring in sensor networks. On the other side,
self-organization may help in distributed controll and management tasks.


SCOPE AND TOPICS OF INTEREST

For this workshop we invite original, and so-far unpublished,
contributions from the following topic areas:

* All contributions must deal with algorithmic aspects in wireless
sensor networks
* Applications of genetic and evolutionary computation principles
* Use of swarm intelligence principles such as self-organization
* Other bio-inspired computing paradigms such as artificial
immune systems


PAPER SUBMISSION

Researchers are invited to submit papers of not more than 8 pages in
ACM style. Templates and formatting instructions can be found at
http://www.sigevo.org/gecco-2011/papers.html
Note: even though this webpage asks for anonymous submissions, this
does not hold for GECCO workshops. The author names SHOULD appear
on the submitted papers.

For submitting a paper, please send the corresponding PDF file by
email to bis-wsn-2011@lsi.upc.edu

The submitted papers must be original works. Simultaneous submission
to other conferences with published proceedings is not permitted.

Finally, note that for each accepted paper at least one of the authors
must register for the GECCO 2011 conference, which includes the
workshop as well as in the main conference.


PROCEEDINGS

Accepted papers will be published in the ACM Digital Library


IMPORTANT DATES

Submission of papers: April 7, 2011
Notification of acceptance: April 14, 2011
Camera-ready papers: April 26, 2011
Workshop: July 12/13, 2011


WORKSHOP CO-CHAIRS

Maria J. Blesa, Universitat Politecnica de Catalunya, Barcelona, Spain
Christian Blum, Universitat Politecnica de Catalunya, Barcelona, Spain


CONTACT INFORMATION

bis-wsn-2011@lsi.upc.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/
*
**********************************************************

[DMANET] CfP: GECCO 2011 Late Breaking Abstracts Workshop

2011 Genetic and Evolutionary Computation Conference (GECCO-2011)

July 12-16, 2011
Dublin, Ireland

*** LATE BREAKING ABSTRACT WORKSHOP ***
*** AWAITS YOUR LATEST BREAKING RESULTS ***
*** ***
*** SUBMISSION DEADLINE APRIL 12 2011 ***

Organized by ACM SIGEVO

http://www.sigevo.org/gecco-2011/call-lba.html


20th International Conference on Genetic Algorithms (ICGA)
and the 16th Annual Genetic Programming Conference (GP)

Late Breaking Abstracts Workshop

Two-page abstract papers describing late-breaking developments in the
field of genetic and evolutionary computation are being solicited for
presentation at the Late Breaking Abstracts Workshop at the 2011 Genetic
and Evolutionary Computation Conference (GECCO-2011) to be held 12-16 July,
2011, in Dublin, Ireland, and inclusion in a CD-ROM to be distributed to
all attendees of the conference and in the ACM Digital Library.

Topics include: genetic algorithms, genetic programming, evolution
strategies, evolutionary programming, real-world applications, learning
classifier systems and other genetics-based machine learning, evolvable
hardware, artificial life, adaptive behavior, ant colony optimization,
swarm intelligence, biological applications, evolutionary robotics,
coevolution, artificial immune systems, and more.


IMPORTANT DEADLINES

Submissions close: April 12, 2011
Camera Ready Files Deadline: April 26, 2011
Author registration Deadline: May 2, 2011


SELECTION PROCESS

Late-breaking abstract papers will be briefly examined for relevance and
minimum standards of acceptability, including adherence to formatting
requirements and the two-page limit, but will not be peer reviewed in
detail.

Acceptance decisions will be made as soon as possible after receipt of the
submission, until the 12 April 2011 deadline. Authors of accepted late-
breaking abstracts will individually retain copyright (and all other
rights) to their late-breaking abstracts. Accepted late breaking abstracts
with no authors registered by the deadline will not appear in the Late-
Breaking Papers section in the CD-ROM nor the ACM Digital Library.


CONFERENCE FLYER

http://www.sigevo.org/gecco-2011/docs/CFP-GECCO-2011.pdf


TUTORIALS & WORKSHOPS

GECCO 2011 offers a rich program including more than 30 tutorials and a
large number of workshops.


VENUE

GECCO-2011 will be hosted at the Burlington Hotel Dublin City, one of the
premier 4 star luxury hotels in Dublin. The hotel is located just a short
stroll from Dublin's City Centre.

For more information visit: http://www.sigevo.org/gecco-2011/lodging.html


CONTACT

For technical matters, contact Late Breaking Abstracts Workshop Chair
Christian Blum at cblum@lsi.upc.edu


GECCO is sponsored by the Association for Computing Machinery Special
Interest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

**********************************************************
*
* 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 workshop New Worlds of Computation 2011

CALL for COMMUNICATION and PARTICIPATION --- please distribute
**********************************************************************

2nd workshop New Worlds of Computation 2011 LIFO,
University of Orléans (France) Monday May 23rd, 2011

http://www.univ-orleans.fr/lifo/evenements/NWC2011
**********************************************************************

Topics

The workshop New Worlds of Computation concentrates on models of
computation that fall out of the Turing context:

* Analog computation, Continuous computation, Hybrid systems,
* Computation on infinite structures (Ordinals, linear orders),
* Hypercomputation, Infinite time computation, Non-Euclidean
* spaces, Non-standard approaches, Optical collision, Abstract
* geometrical computation, Cellular automata, Collision based,
* quantum, DNA, membrane...

The classical Turing computability has been THE paradigm for
computation for more than half a century. In less than two decades,
various paradigms have been proposed (invented, discovered or
reframed) and communities have emerged: computable analysis, algebraic
models, Quantum computing, DNA, Cellular automaton... All of them fall
outside the classical context because they manipulate objects that are
just out of the classical scope (infinite objects or uncountably many
values) or continuous or infinite time. Unfortunately, there is no
miraculous generalized Church-Turing thesis (nor specialized analog
nor...).

The workshop aims at gathering researchers of a scattered but wide
off-Turing community in order to share points of view and bring forth
the common problematics. The audience aimed at is roughly the same as:

* Machines, Computations and Universality Unconventional
* Computation Computability in Europe Hypercomputation Research
* Network


Preliminary list of speakers

* Pablo Arrighi ? LIG, Grenoble (France) Françoise Chatelin ?
* CERFACS, University of Toulouse 1 (France) Rene Doursat ? École
* Polytechnique, Paris (France) Jean-Louis Giavitto ? IRCAM, Paris
* (France) Simon Perdrix ? LIG, Grenoble (France) Mike Stannett ?
* University of Sheffield (UK) Olivier Bournez ? LIX, École
* Polytechnique, Paris (France) Emmanuel Hainry ? LORIA, Nancy
* (France) Jonas Lefèvre ? LIX, École Polytechnique, Paris
* (France) Amaury Pouly ? ENS Lyon (France) Antoine Spicher ?
* LACL, Paris 12 (France)


Proceedings

* 1-2 page(s) abstract with references, local printing,
distributed at the workshop, and * there should be a special issue of
International Journal of Unconventional Computing.


Fares FREE

It includes: lunch, coffee break(s), proceedings.


Contact For communication and participation:

Maxime Senot <maxime.senot@univ-orleans.fr>

http://www.univ-orleans.fr/lifo/evenements/NWC2011
**********************************************************
*
* 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, March 28, 2011

[DMANET] ADHOC-NOW 2011: submission deadline Mar. 31, 2011

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

[DMANET] Call for 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/ <https://unccmail.uncc.edu/exchweb/bin/redir.asp?URL=http://conference.bupt.edu.cn/msn11/>

Important Dates
-------------------
Proposal submission deadline: April 10th, 2011
Notification of acceptance: April 18th, 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 April 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 April 10th, 2011
Notification of Acceptance April 18th, 2011

The final Call for Papers for the accepted workshop should be submitted by
May 1st, 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/
*
**********************************************************

[DMANET] CFP: Special Issue on Wireless Mobile Computing and Networking

Apologies if you receive multiple copies.


**********************************************************************
CALL FOR PAPERS
Tsinghua Science and Technology
Special Issue on Wireless Mobile Computing and Networking
http://www.elsevier.com/wps/product/agents/704058 <https://unccmail.uncc.edu/exchweb/bin/redir.asp?URL=http://www.elsevier.com/wps/product/agents/704058>
http://nrl.uncc.edu/cfp_SI_TST.htm <https://unccmail.uncc.edu/exchweb/bin/redir.asp?URL=http://nrl.uncc.edu/cfp_SI_TST.htm>

About Tsinghua Science and Technology: a comprehensive academic journal
sponsored by Tsinghua University is published bimonthly. This journal
aims at presenting the up-to-date scientific achievements with high
creativity and great significance in engineering fields especially in
computer and electronic engineering. It is indexed by Engineering Index
(Ei, USA), Chemical Abstracts (CA, USA), INSPEC, P - (Russia), SA,
Cambridge Abstract and other abstracting indexes.

This special issue is devoted to new research addressing the challenges
in the areas of mobile computing and wireless and mobile networking.
Recent convergence of information communications technology and computing
is creating new demands and opportunities for ubiquitous computing via
wireless and mobile equipment without technological restrictions. The
demanding networking environment of wireless communications and the
fast-growing number of mobile users impose several challenges in terms
of channel estimation, network protocol design, resource management,
systematic design, application development. The objective of this special
issue is to gather recent advances addressing networks, systems, algorithms,
and applications that support the symbiosis of mobile computers and wireless
networks. It aims to publish high quality, original, unpublished research
papers covering all issues in mobile computing and wireless and mobile
networking at the link layer and above.

Specific topics for this special issue include but are not limited to:
* Applications and middleware support
* Transport, network, and MAC protocols
* Energy efficiency
* Location discovery and location based service
* Cross-layer design and control
* Network resilience, fault-tolerance, and reliability
* Functional computation and data aggregation
* Modeling and performance analysis
* Scaling laws and fundamental limits
* Network coding
* Opportunistic and delay-tolerant networks
* Vehicular networks
* Cognitive radio networks
* Distributed sensing, actuation, control, and coordination
* Trust, security and privacy
* System design and testbeds
* Measurements from experimental systems
* Wireless sensor networks
* Mobile social networks
* Internet of things
* Mobility abd resource management
* Wireless LANs and mesh networks
* Distributed algorithms and network optimization

Papers submitted to this journal for possible publication must be original
and must not be under consideration for publication in any other journals.
Prospective authors should submit an electronic copy of their complete
manuscript, in PDF format, to the lead guest editor (yu.wang@uncc.edu) with
the email subject "Tsinghua Science and Technology Special Issue - Paper
Submission". Further information on the journal, including author guidelines,
are available at the journal homepage:
http://www.elsevier.com/wps/product/agents/704058 <https://unccmail.uncc.edu/exchweb/bin/redir.asp?URL=http://www.elsevier.com/wps/product/agents/704058>

Schedule
========
Manuscript Due: May 15, 2011
First Round of Reviews: June 15, 2011
Camera ready: July 1, 2011
Publication Date: September 2011

Guest Editors:
==============
Yu Wang, University of North Carolina at Charlotte, USA
Fan Li, Beijing Institute of Technology, China
Yanwei Wu, Minnesota State University, USA
Bin Xu, Tsinghua University, China
Teresa Dahlberg, University of North Carolina at Charlotte, 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/
*
**********************************************************

Summer program on CSPs

The following is an announcement of the summer thematic program on the
mathematics of constraint satisfaction that will be held at the Fields
Institute in Toronto this summer.  One of the threads of the program is on
approximability. There will also be a workshop associated with the program
on the approximability of CSPs, that will be held during Aug 12-16, 2011,
just preceding the RANDOM/APPROX conference in Princeton.

Please circulate the announcement to any individuals who might be interested
in participating in the program, summer school, and/or any of the workshops
(details on how to apply appear below; applications by *April 15, 2011* if
possible are encouraged).

-------------------------------------------------------------------------
Fields Institute Summer Thematic Program on the Mathematics of Constraint
Satisfaction
-------------------------------------------------------------------------

Program Organisers:

Venkatesan Guruswami, Carnegie Mellon University
Pavol Hell, Simon Fraser University
Matt Valeriote, McMaster University
Ross Willard, University of Waterloo

Program Website:
http://www.fields.utoronto.ca/programs/scientific/11-12/constraint/

Overview:

During July and August 2011, the Fields Institute will host a thematic
program on the Mathematics of Constraint Satisfaction. The program will
include a 5-day summer school, three focused workshops, the Coxeter
Lectures, regular weekly seminars, and extended periods of time for
in-residence researchers and students for intensive study. The program will
bring together researchers from various communities within pure mathematics
and theoretical computer science.

Outline of Scientific Activities:

The main activities of the program will be concentrated around a series of
three workshops, a summer school, and the Coxeter Lectures. The summer
school will take place during the last week of June, 2011 and the three
workshops will be held at regular intervals throughout the summer.  The
Coxeter Lectures will be given by Moshe Vardi (Rice) on July 11-13, 2011.

Participation in the Program:

All scientific events are open to the mathematical sciences community, but
visitors are requested to indicate their interest in participating in some
or all of the planned events by filling out the information form found on
the program website. The information form can also be used to request office
space or funding. Fields scientific programs are devoted to research in the
mathematical sciences, and enhanced graduate and post-doctoral training
opportunities. Part of the mandate of the Institute is to broaden and
enlarge the community, and to encourage the participation of women and
members of visible minority groups in our scientific programs.

Deadlines:

Requests for support or office space may be submitted at any time by filling
out the application form found on the program website, but interested
participants are urged to apply by *April 15, 2011* if possible.

Additional Information:

For additional information on the program, please send an email to
thematic@fields.utoronto.ca . To receive updates on the program please
subscribe to our mailing list at www.fields.utoronto.ca/maillist .

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

Details of Scientific Activities:

June 26-30, 2011 Fields Summer School

Each day of the summer school will consist of four 90 minute
lectures plus time set aside for school participants and instructors to meet
to discuss questions and problems related to the lectures.  Lecture notes
and problem sets will be prepared in advance and posted on the program
website. A primary goal of the summer school is to provide the participants
with a thorough and intense introduction to the main themes of the summer
program.

The four threads of the summer school, along with the lecturers are:

* An Introduction to the CSP: Andrei Krokhin (Durham University)
* Graph Theory and Combinatorics: Jaroslav Nesetril (Charles University)
* Universal Algebra: Ross Willard (University of Waterloo)
* Approximability of CSPs: Venkatesan Guruswami and Ryan O'Donnell (Carnegie
Mellon)

July 11-13, 2011 The Coxeter Lectures

A series of three lectures given by Moshe Y. Vardi, Rice University

July 11- 15, 2011 Workshop on Graph Homomorphisms
Organized by:
   Pavol Hell (Simon Fraser University),
   Claude Tardif (Royal Military College, Kingston),
   Xuding Zhu (Zhejiang Normal University)

This workshop will focus on all aspects of graph homomorphisms, from those
directly related to constraint satisfaction problems, such as minimum cost
and list homomorphisms, versions of projectivity, and polymorphisms, to
those related to basic graph theoretic notions such as colourings,
tree-width and tree-depth, and those related to notions from category
theory, such as adjoint functors, to those related to statistical physics
such as counting homomorphisms, and study of connection matrices. The goal
is to bring together the main players in all aspects of graph homomorphisms,
and share views of new trends and techniques.

Confirmed Speakers:

Zdenek Dvorak, Jan Foniok, Hossein Hajiabolhassan, Hamed Hatami, Pavol Hell,
Daniel Kral, Jan Kratochvil, Benoit Larose, Jarik Nesetril, Patrice Ossona
de Mendez, Arash Rafiey, Mark Siggers, Claude Tardif, Peter Winkler, Xuding Zhu


August 2 - 6, 2011 Workshop on Algebra and CSPs
Organized by:
   Libor Barto (Charles University and McMaster University),
   Andrei Krokhin (Durham University),
   Ross Willard (University of Waterloo)

The main goal of this workshop is to highlight the recent advances on the
CSP Dichotomy Conjecture arising from the algebraic approach. It will focus
on the various algebraic notions and results that have been developed in the
attempts to resolve this conjecture and connected problems and will also
include presentations on related algebraic topics, such as Maltsev
Conditions and Tame Congruence Theory. The workshop may also include
presentations on CSPs over infinite templates, quantified CSPs, and
connections with logic, finite model theory, and complexity.

Confirmed Speakers:

Manuel Bodirsky, Andrei Bulatov, Victor Dalmau, Martin Dyer, Peter Jeavons,
Vladimir Kolmogorov, Marcin Kozik, Gabor Kun, Benoit Larose, Miklos Maroti,
Barnaby Martin, Ralph McKenzie, Michael Pinsker

August 12 - 16, 2011 Workshop on Approximability of CSPs
Organized by:
   Andrei Bulatov (Simon Fraser University),
   Johan Hastad (KTH, Stockholm),
   Prasad Raghavendra (Georgia Tech).

The workshop will focus on the recent advances in our understanding of the
approximation threshold of various CSPs, based on progress in both
algorithmic techniques and methods to show tight non approximability
results. The power of various convex programming relaxations for CSPs, the
construction of gap instances highlighting limitations of such relaxations,
and the connections of these to the complexity of approximating CSPs will be
a prominent theme of the workshop. The Unique Games conjecture and results
revolving around it will naturally be a centerpiece of the workshop. This
workshop is expected to have a more interdisciplinary focus. In particular
one of its aims is to foster a cross fertilization of ideas between the
algebraic approach to characterize the tractability of CSPs and the analytic
approach to characterize the approximability of CSPs, and draw parallels
between the algebraic dichotomy conjecture and the Unique Games conjecture
that would hopefully shed some light on both these prominent conjectures.

Confirmed Speakers:

Per Austrin, Boaz Barak, Irit Dinur, Subhash Khot, Andrei Krokhin,
Konstantin Makarychev, Yury Makarychev, Dana Moshkovitz, Elchanan Mossel,
Rishi Saket, David Steurer, Mario Szegedy, Yi Wu.

Affiliated Activity

During the week of June 20, 2011, the annual Logic in Computer Science
(LICS) meeting will be held at Fields and on the campus of the University of
Toronto.





[DMANET] postdoc position at SENSEable City Lab, MIT

I would like to bring vacancies in the SENSEable City Lab to your
attention. We are seeking postdoctoral fellows who have research
experience in network science and massive datasets. If you know of
anyone who might be interested, I'd be grateful if you could pass the
job announcement below along.

Thanks a million,
Dominik


* Postdoctoral positions at the SENSEable City Lab, MIT

The SENSEable City Laboratory at the Massachusetts Institute of
Technology is seeking exceptional candidates to fill several
postdoctoral positions. The focus of the research will be on complex
systems at the urban/regional scale. SENSEable City Lab researchers
come from various disciplines, including architecture, urban planning,
physics, mathematics, engineering, computer science, and the arts. The
lab emphasizes the importance of human behavior and emotion in the
study of pervasive technologies in the urban environment. Research
projects are developed and achieved through a team-based,
multidisciplinary approach. A wide variety of disciplinary backgrounds
will be considered, but experience in handling massive data sets and
network science is a must.

If you are interested, please send a cover letter, CV, links or copies
of relevant publications, and two letters of reference to
senseable-applicants@mit.edu.


** Responsibilities and Qualifications

The responsibilities include:

1) Perform basic or applied research;
2) Extend existing theories and methods;
3) Prepare and write research papers targeted for top tier
conferences and journals;
4) Contribute to the functioning of the lab including supervising
students and liaising with other researchers in the community;


The ideal candidate will have a recent Ph.D., a background in physics,
computational biology, statistics, computer science or related areas
and experience in computational modeling, data mining and
analysis. Candidates with a strong analytical background and interest
in interdisciplinary research as evident from published research will
be also given particular attention. Experience or interest in one of
the following fields is a plus, but not necessarily a requirement:
esthetic sense, human-computer interaction, GIS, data fusion, data
visualization, signal processing, human mobility, and transportation.


http://senseable.mit.edu/MIT-senseable-research-opportunities-complex-systems.pdf


--
Dominik Dahlem ----------------
SENSEable City Laboratory | MIT
www: http://senseable.mit.edu
tel: 1-617-324-5560 -----------
**********************************************************
*
* 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] IMACS'2011 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.

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 - April 15, 2011
Notification of acceptance of talks - May 01, 2011
Submission of full papers - June 010, 2011
Notification of acceptance of papers - July 20, 2011
Submission of accommodation forms - July 25, 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/index.html

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

__
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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, March 27, 2011

[DMANET] WAW 2011 - registration

Hi everyone,

The registration deadline for WAW 2011 is March 31. (Note that there is
no registration fee but we do need to know how many people plan to
attend.) There are 70 people already registered.

http://waw2011.math.wvu.edu/index.php?page=registration

Best regards,
-- Pawel
**********************************************************
*
* 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, March 26, 2011

[DMANET] Call for papers: Special Issue of TCS on ``Theory and Applications of Graph Searching Problems''

TCS: Call for papers on Graph Searching


CALL FOR PAPERS


THEORETICAL COMPUTER SCIENCE

Special Issue on ``Theory and Applications of Graph Searching Problems''

Manuscripts are solicited for a special issue in the journal "Theoretical Computer
Science" (TCS) on "Theory and Applications of Graph Searching Problems". This special
issue will be dedicated to the 60th birthday of Lefteris M. Kirousis.

Graph searching is often referred to, in a more playful language, as a pursuit-evasion
game. This is a kind of game where one part is a set of evaders, that hide in a graph
representing a network, and the other part is a number pursuers, that move
systematically in the graph. The game may vary significantly according to the
capabilities of the evaders and the pursuers. The objective of the game is to capture
the evaders in an optimal way, where the notion of optimality itself admits several
interpretations. The area of Graph Searching has become a very active research area in
theoretical computer science and discrete mathematics, with impact and applications in
various domains.

With this Special Issue, we wish to foster research in the area by exposing new
results and directions for further research. The purpose of the issue is to put
together various recent results related to Graph Searching both from the applied and
the theoretical point of view. Potential topics include (but are not limited to) the
following:

* Graph Searching and Logic
* Graph Parameters Related to Graph Searching
* Graph searching and Robotics
* Conquest and Expansion Games
* Database Theory and Robber and Marshals Games
* Probabilistic Techniques in Graph Searching
* Monotonicity and Connectivity in Graph Searching
* New Variants of Graph Searching
* Graph Searching and Distributed Computing
* Graph Searching and Network Security


Submissions should be made in PDF format using the standard TCS submission system
at http://ees.elsevier.com/tcs/ (doing author login). To ensure that all manuscripts
are correctly identified for inclusion into the special issue you are editing, it
is important that authors select SI TCS-A: Graph Searching (Thilikos) when they
reach the "Article Type" step in the submission process.

Submissions must be received before July 31, 2011.

Papers will be refereed according to the standards of TCS.

We will do our best to have the refereeing procedure timely finished. Please contact
the guest editors for additional information.

Guest Editors

Fedor V. Fomin (University of Bergen)

Pierre Fraigniaud (CNRS and University Paris Diderot)

Stephan Kreutzer (University of Oxford)

Dimitrios M. Thilikos (National and Kapodistrian University of Athens)

-----------
This call can is available at: http://users.uoa.gr/~sedthilk/TCS-graph-searching.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/
*
**********************************************************

Friday, March 25, 2011

[DMANET] MFCS'11 Call for papers

We apologize for possible multiple copies of this call for papers
being delivered due to its submission to several mailing lists.

                        CALL FOR PAPERS

The series of MFCS symposia, organized alternately in the Czech
Republic, Poland and Slovakia since 1972, has a long and
well-established tradition. The MFCS symposia encourage high-quality
research in all branches of theoretical computer science. Their broad
scope provides an opportunity to bring together researchers who do not
usually meet at specialized conferences. Quality papers presenting
original research on theoretical aspects of computer science are
solicited.

Principal topics of interest include (but are not limited to):

Algorithmic game theory, algorithmic learning theory, algorithms and
data structures (incl. sequential, parallel, distributed,
approximation, graph, network, on-line, optimization), automata,
grammars and formal languages, bioinformatics, complexity (structural
and computational), computational geometry, computer-assisted
reasoning, concurrency theory, cryptography and security, databases
and knowledge-based systems, formal specifications and program
development, foundations of computing, logic in computer science,
mobile computing, models of computation, networks (incl. wireless,
sensor, ad-hoc), parallel and distributed computing, quantum
computing, semantics and verification of programs, theoretical issues
in artificial intelligence.

Invited Speakers:

 * Jörg Flum, Albert-Ludwigs-Universität Freiburg
 * Mai Gehrke, Radboud Universiteit Nijmegen
 * Daniel Kirsten, Humboldt-Universität zu Berlin
 * Prasad Raghavendra, Georgia Tech
 * Paul Wollan, Sapienza University of Rome

Submission of abstracts        April 15, 2011
Notification                           May 30, 2011
Conference                  August 22-26, 2011

Submissions to MFCS must not exceed 12 pages (in Springer-Verlag's
Lecture Notes style). If the authors believe that more details are
essential to substantiate the main claims, they may include a clearly
marked appendix that will be read at the discretion of the program
committee. Simultaneous submissions of papers to any other conference
with published proceedings or submitting previously published papers
is not allowed. Only electronic submissions in the PDF format are
accepted. Detailed information about the submission procedure will be
available on the conference web page in due time. The proceedings will
be published in the new ARCoSS subline of Lecture Notes in Computer
Science by Springer-Verlag.

The conference is organized by the Polish Mathematical Society and the
Faculty of Mathematics, Informatics and Mechanics at the University of
Warsaw. For further information, please consult the conference web
page mfcs.mimuw.edu.pl.
**********************************************************
*
* 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, March 24, 2011

GA - Graph algorithms and Applications

FIRST CALL FOR PAPERS

"GA - Graph algorithms and Applications"

Satellite workshop co-located with the 38th International
Colloquium on Automata, Languages and Programming (ICALP 2011)

Sunday, July 3rd, 2011
Institute of Theoretical Computer Science, ETH Zurich, Switzerland
--------------------------------------------------------------------

GA aims to provide a forum for researchers to discuss the most
recent trends and results in graph algorithms and their
applications. One goal is to show how theoretical advances,
engineering principles and thorough experimental evaluations can help
developers build efficient, robust, and scalable applications for
domain-specific scenarios. Another goal is to extract, formalize,
and model new algorithmic graph problems from modern real-world
applications, exploring directions for future research.

The workshop is in honor of Giorgio Ausiello in the occasion of his
70th birthday.

--------------------------------------------------------------------
SCOPE

Submitted papers should consider any aspects of graph algorithms and
their applications, including but not restricted to:

Sequential, parallel, randomized, parameterized, and distributed
graph and network algorithms, I/O and cache-efficient graph
algorithms, on-line and incremental graph algorithms,
approximation algorithms for graph problems, game theoretical
concepts, graph algorithms in computational geometry, graph
algorithms in bioinformatics, graph drawing algorithms, graph
models of the Web and social networks.

We are seeking for papers presenting theoretical results and/or
computational studies. Position and survey papers as well as
papers formalizing novel interesting open problems on the workshop
topics are also welcome.

--------------------------------------------------------------------
SUBMISSION GUIDELINES

Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix. Papers must be formatted
in LaTeX. Contributions should be submitted electronically in pdf
format via the EasyChair submission system, accessible at:
http://www.easychair.org/conferences/?conf=ga20110

There will be no proceedings, but a selection of the papers accepted
for presentation at the workshop will be invited for a special issue
of Theoretical Computer Science. Indeed, because of the lack of a
proceedings, submission of work that is intended for publication
elsewhere is welcome. Such submissions should include details of
the other submission.

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

o Submission deadline: Saturday, April 30, 2011
o Notification: Friday, May 20, 2011
o Workshop: Sunday July 3rd, 2011 (ETH Zurich, Switzerland)

--------------------------------------------------------------------
PLENARY SPEAKERS

o Giuseppe F. Italiano, U. Rome "Tor Vergata"
o Kurt Mehlhorn, MPII, Saarbruecken

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

o Gianfranco Bilardi. U. Padova
o Pierluigi Crescenzi, U. Firenze
o Camil Demetrescu (co-chair), Sapienza U. Rome
o Josep Diaz, UPC Barcelona
o Giuseppe Di Battista, U. Roma III
o Giorgio Gambosi, U. Rome "Tor Vergata"
o Ludek Kucera, Charles U.
o Jan van Leeuwen, Utrecht U.
o Stefano Leonardi (co-chair), Sapienza U. Rome
o Fabrizio Luccio, U. Pisa
o Alberto Marchetti-Spaccamela (co-chair), Sapienza U. Rome
o Jaroslav Nesetril, Charles U.
o Maurice Nivat, U. Paris VII
o Vangelis Paschos, U. Paris-Dauphine
o Franco Preparata, Brown U.
o Paul Spirakis, RACTI and U. Patras
o Leen Stougie, Free U. Amsterdam and CWI
o Peter Widmayer, ETH Zurich

--------------------------------------------------------------------
LOCAL ARRANGEMENTS COMMITTEE (ICALP conference chairs)

o Michael Hoffmann, ETH Zurich
o Juraj Hromkovic, ETH Zurich
o Ueli Maurer, ETH Zurich
o Angelika Steger, ETH Zurich
o Emo Welzl, ETH Zurich
o Peter Widmayer, ETH Zurich

Third Workshop on Massive Data Algorithmics (MASSIVE 2011)

1st Call for Papers:

Third Workshop on Massive Data Algorithmics (MASSIVE 2011)

June 16, 2011
Paris, France

In connection with SoCG'11 and organized by
Center for Massive Data Algorithmics (MADALGO)

Webpage:http://www.madalgo.au.dk/massive2011

Aim and Scope

Tremendous advances in our ability to acquire, store and process data,
as well as the pervasive use of computers in general, have resulted in
a spectacular increase in the amount of data being collected. This
availability of high-quality data has led to major advances in both
science and industry. In general, society is becoming increasingly
data driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data means
that in general focus on algorithm efficiency is increasing. However,
the large size of the data, and/or the small size of many modern
computing devices, also means that issues such as memory hierarchy
architecture often play a crucial role in algorithm efficiency. Thus
the availability of massive data also means many new challenges for
algorithm designers.

The aim of the workshop on massive data algorithmcs is to provide a
forum for researchers from both academia and industry interested in
algorithms for massive dataset problems. The scope of the workshop
includes both fundamental algorithmic problems involving massive data,
as well as algorithms for more specialized problems in, e.g.,
graphics, databases, statistics and bioinformatics. Topics of interest
include, but are not limited to:

- I/O-efficient algorithms
- Cache-oblivious algorithms
- Memory hierarchy efficient algorithms
- Streaming algorithms
- Sublinear algorithms
- Parallel algorithms for massive data problem
- Engineering massive data algorithms

Paper submission

We invite submissions of extended abstracts (at most 10 pages not
counting references) of original research. Extended abstract should be
submitted through the EasyChair website by Wednesday April 27. Authors
will be notified about acceptance by Monday May 9, and final versions
will be due on May 30. Accepted extended abstracts will be collected
in a booklet, which will be distributed at the workshop. There will be
no formal proceedings, so work presented at the workshop can also be
(or have been) presented at other conferences. An author of each
accepted abstract is expected to give a presentation of the abstract
at the workshop.

Program committee

Pankaj Agarwal (Duke)
Lars Arge (Aarhus and MADALGO)
Mark de Berg (Eindhoven)
Guy E. Blelloch (CMU)
Gerth Stølting Brodal (Aarhus and MADALGO)
Ken Clarkson (IBM Almaden)
Graham Cormode (AT&T Research)
Erik Demaine (MIT)
Sudipto Guha (U. Penn)
Sariel Har-Peled (UIUC)
John Iacono (NYU)
Piotr Indyk (MIT)
Riko Jacob (TU Munich)
Christian S. Jensen (Aarhus and MADALGO)
Ravi Kumar (Yahoo! Research)
Ulrich Meyer (Frankfurt and MADALGO)
Ian Munro (Waterloo)
S. Muthu Muthukrishnan (Google)
Mihai P&#259;tra&#351;cu (AT&T Research)
Ronitt Rubinfeld (MIT and Tel Aviv University)
Peter Sanders (KIT)
Suresh Venkatasubramanian (Utah)
Jeffrey Scott Vitter (Kansas)
Norbert Zeh (Dalhousie)

Chair: Ulrich Meyer (Frankfurt and MADALGO)

Organizing committee

Else Magård (Aarhus and MADALGO)
Gerth Stølting Brodal (Aarhus and MADALGO)
Lars Arge (Aarhus and MADALGO)
Ulrich Meyer (Frankfurt and MADALGO)

Important dates

Call for Papers: February 2011
Paper submission deadline: Wednesday April 27
Notification of acceptance: Monday May 9
Early registration deadline: May 16
Final version due: May 30
Symposium: June 16, 2011

Participation

The workshop will take place on June 16, 2011 in Paris, France,
immediately following the 27th Annual Symposium on Computational
Geometry (SoCG). Participants should register through the on-line
registration which will soon be opened on the workshop webpage under
http://www.madalgo.au.dk/massive2011 . All researchers and industry
people interested in massive data algorithmics are encouraged to
attend the workshop.

[DMANET] Extended Deadline EVOLVE 2011, May 25-27 2011, Bourglinster Castle, Luxembourg

Apologies for cross-postings.

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

E V O L V E

A bridge between Probability, Set Oriented Numerics and
Evolutionary Computation

http://evolve.uni.lu

May 25-27 (Wednesday-Friday), 2011
Bourglinster Castle, Luxembourg

Workshop organized by
University of Luxembourg, CINVESTAV and INRIA

EXTENDED SUBMISSION DEADLINE: April 5, 2011

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

Deadline Extension !!!

Due to the addition of specific sessions and given the multiple extension
requests, the deadline has been extended to the 5th of April, 2011.
Submitted abstracts should be from two to maximum four pages long.


NEWS!!! -------------------------------------------------------------------
Authors will be invited to submit extended versions of the abstracts,
subject to further review to be published in "EVOLVE - A bridge between
Probability, Set Oriented Numerics and Evolutionary Computation", in the
series Studies in Computational Intelligence, Springer (edited book on the
theoretical foundations of evolutionary computation, indexed by DBLP,
Ulrichs, SCOPUS, MathSciNet, Current Mathematical Publications,
Mathematical Reviews, Zentralblatt Math: MetaPress and Springerlink).
---------------------------------------------------------------------------


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

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

The EVOLVE 2011 workshop represents a follow-up of the Workshop on Evolutionary Algorithms - New Challenges in Theory and Practice, organized by the ALEA Working Group in Bordeaux, France, March 2010, with the support of the EA association.


Topics of interest (include but are not limited to)
***************************************

- bridge between probability, statistics and evolutionary algorithms

- performance guarantee factors for large scale / highly multi-modal
optimization problems

- performance guarantees measures for existing algorithms

- estimation of complete distribution laws

- Gibbs measures

- set oriented numerics

- robust methods for large scale, high dimensional problems

- theoretical tools, components that ensure the robustness in practice

- theoretical foundations

- mathematical objects and evolutionary programming

- robust / fast estimation of mathematical quantities

- particle methods, Markov Chain Monte Carlo methods

- spatial complexity of methods and its implications in practice

- robustness of parallel and distributed evolutionary optimization

- self-tuning and self-adaptive techniques based on theoretical analysis

- particular issues (e.g. landscape analysis, complex networks)

- swarm intelligence


Keynote speakers
*************

Enrique Alba University of Malaga, Spain
Carlos A. Coello Coello Department of Computer Science, CINVESTAV-IPN,
Mexico
Pierre Del Moral INRIA Bordeaux - Sud Ouest,
Bordeaux Mathematical Institute, France
Michael Dellnitz Institute for Mathematics,
University of Paderborn, Germany
Frederic Guinand University of Le Havre, France
Günter Rudolph Department of Computer Science,
TU Dortmund University, Germany
Marc Schoenauer INRIA Saclay - Île-de-France,
University Paris Sud, France
Franciszek Seredynski Institute of Computer Science, Polish Academy
of Sciences, Warsaw, Poland
El-Ghazali Talbi Polytech' Lille, University of Lille 1, France
Marco Tomassini Faculty of Business and Economics,
University of Lausanne, Switzerland
Massimiliano Vasile Space Advanced Research Team,
University of Strathclyde, Scotland


Submission
*********

We invite researchers working on both theoretical and practical aspects of evolutionary algorithms to submit an abstract of maximum two pages. The submissions have to be done exclusively through EasyChair, at the following address: http://www.easychair.org/conferences/?conf*evolve2011. All submissions must be in English.

The final submission must include the PDF file along with all the accompanying source files (LaTeX file, figures). An EasyChair account is mandatory - in case you do not have an EasyChair account, you can create one for free at EasyChair.

The final version of the abstract must be uploaded on EasyChair before the 5th of April 2011. Authors who cannot meet the specified deadline are invited to contact the EVOLVE organizers.


Publication
*********
Authors will be invited to submit full papers, that will be published subject to further review in "EVOLVE - A bridge between Probability, Set Oriented Numerics and Evolutionary Computation", in the series Studies in Computational Intelligence, Springer (edited book on the theoretical foundations of evolutionary computation, indexed by DBLP, Ulrichs, SCOPUS, MathSciNet, Current Mathematical Publications, Mathematical Reviews, Zentralblatt Math: MetaPress and Springerlink).

All the accepted abstracts will be presented orally at the workshop and will appear in proceedings that will be handed out at the event. In addition, all accepted authors will be invited to submit an extended version of their work also to a journal special issue (to be announced).

Important dates
************
Submission deadline: April 5, 2011
Notification of acceptance: April 15, 2011
Registration deadline: April 25, 2011
Conference dates: May 25-27, 2011


Contacts
*******
EVOLVE 2011 is organized by Alexandru-Adrian Tantar, Emilia Tantar, Pascal Bouvry (University of Luxembourg), in collaboration with Oliver Schütze (CINVESTAV, Mexico), Pierre Del Moral and Pierrick Legrand (INRIA, France).

For questions or additional information please do not hesitate to contact us at Alexandru.Tantar@uni.lu or Emilia.Tantar@uni.lu.

___________________________________________________________________________

The call is also available online on the EVOLVE 2011 website at http://evolve.uni.lu/index.php/call-for-abstracts
___________________________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************

Wednesday, March 23, 2011

[DMANET] Chair and two lectureships in Computer Science, University of Sheffield, UK

Dear all,

The Department of Computer Science, University of Sheffield, is
advertising for three new academic posts, open to any area of computer
science. These are at professorial level, and lecturer/senior lecturer
level (permanent positions roughly equivalent to Assistant Professor
in the US system).

Details are at:
http://www.jobs.ac.uk/job/ACJ920/chair-in-computer-science/
http://www.jobs.ac.uk/job/ACJ936/lecturer-senior-lecturer-in-computer-science-2-posts/

The application deadlines are on April 22nd.

Best wishes,
James Marshall

---
James A. R. Marshall
Department of Computer Science
University of Sheffield
http://staffwww.dcs.shef.ac.uk/people/J.Marshall


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

Theory conference, May 7 - 8, UC Berkeley

Theory of Computation as a Lens on the Sciences
University of California, Berkeley, May 7-8, 2011

Registration for this conference will begin on Thursday, March 31 at
http://www.eecs.berkeley.edu/IPRO/lensconference2011 . There is no charge for registration. We hope you will be able to attend.

The conference will explore the theme that many processes in the physical, biological, engineering, and social sciences involve information processing at a fundamental level and can be studied through computational models. A conference held in Berkeley in May, 2002 helped crystallize this theme as a promising direction of research, and this second conference will highlight the impact of the computational lens on areas such as quantum information science, statistical physics, social networks, economics and game theory, genetics, molecular biology, evolutionary biology, cognitive science, mathematics, statistics and machine learning.

------

Featured Speakers:

Professor Leslie Valiant, Harvard University
Evolution as a Form of Learning

Professor Ehud Kalai, Northwestern University
Robustness and Complexity in Games

Professor Christos Papadimitriou, UC Berkeley
Algorithms, Games, and the Internet

Professor Michael Kearns, University of Pennsylvania
<Analysis of Social Networks>

Professor Mark Newman, University of Michigan
Structure and Dynamics of Networks in the Real World

Professor Michael Jordan, UC Berkeley
On Joint Inference of Phylogeny and Alignment

Professor David Haussler, UC Santa Cruz
Cancer Genomics

Professor Andrea Montanari, Stanford
<Statistical Physics and Computation>

Professor Daniel Fisher, Stanford
<Dynamics of Evolutionary Processes>

Dr. Jonathan Oppenheim, University of Cambridge
Computer Science as a Lens on Quantum Theory

Professor Umesh Vazirani, UC Berkeley
How Does Quantum Mechanics Scale?

Professor Lior Pachter, UC Berkeley
A Computational Approach to Discovery in Biology

Professor Tandy Warnow, UT, Austin
Ultra-Large Phylogenetic Estimation

Professor Sebastien Roch, UCLA
Large Phylogenies from Short Sequences: Recent Theoretical Insights

If you have questions, please contact Heather Levien, assistant to Professor Richard Karp, heather@eecs.berkeley.edu, (510) 642-3497.