Monday, October 10, 2011

PhD scholarship available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES (MDS)
http://www3.math.tu-berlin.de/MDS/

funded by the German Research Foundation (DFG) at the three Berlin
Universities will offer a

SCHOLARSHIP

for Ph.D. Studies starting January 1, 2012 or later.

The MDS program covers topics at the interface between algorithms,
combinatorics, geometry, probability, and optimization. The MDS faculty
consists of Susanne Albers, Helmut Alt, Stefan Felsner, Martin Groetschel,
Martin Grohe, Rolf Moehring, Guenter Rote, Martin Skutella, Tibor Szabo,
and Guenter Ziegler.

The scholarships are 1468 EUR (tax-free) per month - according to DFG
rules. They are usually granted as 2-year fellowships, extendible by a
third year.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools, regular predoc programs, etc. -
all this in a very lively Berlin discrete mathematics context, which
also includes the DFG Research Center MATHEON (http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for
the "Phase II" part of BERLIN MATHEMATICAL SCHOOL
(http://www.math-berlin.de), the joint international graduate program of
the three major Berlin universities - which has a lot to offer! Students
of the MDS program may apply to be members of the BERLIN MATHEMATICAL
SCHOOL.

Applicants for Ph.D. scholarships are expected to have a
Diploma/Master's degree or equivalent, usually in Mathematics or
Computer Science. Applications for scholarships starting in 2012
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Dr. Martin Skutella, Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 5-2
TU Berlin
D-10623 Berlin, Germany

email: martin.skutella@tu-berlin.de
http://www.math.tu-berlin.de/?79791
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Please send your application before November 15, 2011.
Applications by email are welcome. If you have applied to BERLIN
MATHEMATICAL SCHOOL Phase II, then please just inform us about this -
there is no need to submit your materials again.

[DMANET] PhD scholarship available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES (MDS)
http://www3.math.tu-berlin.de/MDS/

funded by the German Research Foundation (DFG) at the three Berlin
Universities will offer a

SCHOLARSHIP

for Ph.D. Studies starting January 1, 2012 or later.

The MDS program covers topics at the interface between algorithms,
combinatorics, geometry, probability, and optimization. The MDS faculty
consists of Susanne Albers, Helmut Alt, Stefan Felsner, Martin Groetschel,
Martin Grohe, Rolf Moehring, Guenter Rote, Martin Skutella, Tibor Szabo,
and Guenter Ziegler.

The scholarships are 1468 EUR (tax-free) per month - according to DFG
rules. They are usually granted as 2-year fellowships, extendible by a
third year.

The MDS course program consists of the Monday Afternoon Colloquium
lectures, block courses, summer schools, regular predoc programs, etc. -
all this in a very lively Berlin discrete mathematics context, which
also includes the DFG Research Center MATHEON (http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for
the "Phase II" part of BERLIN MATHEMATICAL SCHOOL
(http://www.math-berlin.de), the joint international graduate program of
the three major Berlin universities - which has a lot to offer! Students
of the MDS program may apply to be members of the BERLIN MATHEMATICAL
SCHOOL.

Applicants for Ph.D. scholarships are expected to have a
Diploma/Master's degree or equivalent, usually in Mathematics or
Computer Science. Applications for scholarships starting in 2012
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Dr. Martin Skutella, Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 5-2
TU Berlin
D-10623 Berlin, Germany

email: martin.skutella@tu-berlin.de
http://www.math.tu-berlin.de/?79791
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Please send your application before November 15, 2011.
Applications by email are welcome. If you have applied to BERLIN
MATHEMATICAL SCHOOL Phase II, then please just inform us about this -
there is no need to submit your materials again.
**********************************************************
*
* 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 IEEE SECON 2012 (Deadline - December 8, 2011)

Dear colleagues,

Please find below a Call for Papers for the 9th Annual IEEE
Communications Society Conference on Sensor, Mesh and Ad Hoc
Communications and Networks (IEEE SECON 2012), to be held in Seoul,
Korea, on June 18-21, 2012. We apologize if you receive duplicate copies
of this announcement.

----

[Please accept our apologies if you receive multiple copies of this Call
for Participation (CFP).]

***********************************************************************************
CALL FOR PAPERS
IEEE SECON 2012

9th Annual IEEE Communications Society Conference on
Sensor, Mesh and Ad Hoc Communications and Networks
http://www.ieee-secon.org/
June 18-21, 2012 -- Seoul, Korea

***********************************************************************************
IMPORTANT DATES

Abstract Registration: 23:59 EST on December 1, 2011
Paper Submission Deadline: 23:59 EST on December 8, 2011
Acceptance Notification: March 19, 2012
Camera Ready: April 16, 2012

SCOPE

The ninth annual IEEE SECON conference will provide a unique forum to
exchange innovative research ideas, recent results, and share
experiences among researchers and practitioners in the field of sensor,
mesh, and ad hoc networks and systems. IEEE SECON grew out of the IEEE
INFOCOM conference in 2004, in order to create an event that focused on
the important and exciting topics of Sensor, Mesh and Ad Hoc
Communications Networks.

Papers describing original, previously unpublished research work,
experimental efforts, practical experiences, and industrial and
commercial developments in all aspects of sensor, ad hoc, and mesh
communications and networking are solicited. Within this domain,
particular topics of interest include, but are not limited to:

* Vehicular Networks, Underwater Networks, Urban Sensing, and other
Emerging Areas
* Disruption Tolerant Networks
* Measurements and Experimental Research
* Security and Trustworthiness
* Survivability, Network Management and Fault Tolerance
* Modeling, Algorithms, and Performance Evaluation
* Hardware and Software Platforms, Middleware
* MAC, Network, Transport, Application Protocols and Cross-Layer Design
* Network Coding, MIMO, White Space, Cooperative and Cognitive
Communications
* Applications of mesh, senor, and ad-hoc communications in diverse
domains such as Smart Grids, Green Networking, Environment Monitoring,
Context Sensing and Awareness, Social Networking, Mobile Peer-to-Peer
Systems, Contact Networking

PAPER SUBMISSION AND PUBLICATION

Papers should neither have been published elsewhere nor currently under
review by another conference or journal. All papers for IEEE SECON 2012
must be submitted electronically via the EDAS system:
http://edas.info/newPaper.php?c=11259.

Papers must be no longer than 9 pages and in font size no smaller than
10 points. Accepted papers will appear in the conference proceeding
published by IEEE. Detailed paper submission guidelines will be posted
in the SECON submission site.

IEEE prohibits discrimination. For more information on their
discrimination policy visithttp://www.ieee.org/nondiscrimination.

***********************************************************************************
EXECUTIVE COMMITTEE

General Chairs
Young-Bae Ko (Ajou University, Korea)
Sung-Ju Lee (HP Labs, USA)

Technical Program Chairs
Suman Banerjee (University of Wisconsin, USA)
Theodoros Salonidis (Technicolor, France)

Web Chair
Eric Rozner (AT&T Labs Research, USA)

Publicity Chairs
Sangheon Pack (Korea University, Korea)
Ramya Raghavendra (IBM Watson Research, USA)
Aline Viana (INRIA, France)

Local Arrangements Chairs
Sungrae Cho (Choonang University, Korea)
Yun Won Chung (Soongsil University, Korea)

Panels Chairs
Sunghyun Choi (Seoul National University, Korea)
Xin Liu (UC Davis, USA)

Workshops Chairs
Kangwon Lee (IBM Watson Research, USA)
Kyung-Joon Park (DGIST, Korea)

Demo Chairs
Uichin Lee (KAIST, Korea)
Konstantinos Pelechirinis (University of Pittsburgh, USA)

Poster Chairs
Young-June Choi (Ajou University, Korea)
Ignacio Solis (PARC, USA)

Publications Chair
Yaling Yang (Virginia Tech, USA)

Social Media Chair
Changhee Joo (UNIST, Korea)

Steering Committee
Fred Bauer (Chair, Cisco, USA)
Hamid Aghvami (King's College London, UK)
Mischa Dohler (CTTC, Spain)
Harvey Freeman (HAF Consulting, USA)
Sung-Ju Lee (HP Labs, USA)
Prasant Mohapatra (UC Davis, USA)
Krishna Sivalingam (University of Maryland Baltimore County, 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] COIN-OR INFORMS CUP -- call for submissions and nominations

COIN-OR INFORMS CUP
INFORMS Annual Meeting 2011

Announcing the seventh annual "COIN-OR INFORMS Cup" competition. Submissions
and nominations are now open for valuable contributions to COIN-OR and projects
that use COIN-OR software.

Rules:
o A submission or nomination must contain:
1. A synopsis of an effective use of COIN-OR or valuable contribution to COIN-OR (or both!).
2. An explanation of its significance.
o The winner must accept the prize in person at the 2010 INFORMS meeting---so we can all celebrate appropriately (see "Celebration" below).
o Submission deadline (EXTENDED): Monday, October 24, 2011.
o Self-nomination is welcomed.
o We especially encourage nominations of effective use of COIN-OR that the
community may not know about.

Submissions will be judged by a committee of members of the COIN-OR Foundation,
Inc.

Celebration: The COIN-OR INFORMS Cup will be awarded during the INFORMS Annual
meeting in Charlotte, NC. All entrants and their supporters are welcome to join
in the celebration and regale (rile) the prize winners. The celebration sponsor
will be IBM.

o Day: Sunday, November 13th 2011
o Time: 8:00 PM
o Location: TBD

The winning entry will be posted on the COIN-OR Website.

Please e-mail your submissions to coin-cup@coin-or.org

Enter, come, possibly win, and raise your cup with us!

--
Pietro Belotti Dept. of Mathematical Sciences
Clemson University
email: pbelott@clemson.edu
phone: 864-656-6765
web: myweb.clemson.edu/~pbelott
**********************************************************
*
* 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 at CEU

Open rank position in Mathematics

Vacancy summary:
The Department of Mathematics at the Central European University
invites applications for a full-time position in the field of network
science. The successful candidate should have a demonstrated potential
for high-level research and publication, and a research record in
network science, i.e. the application of mathematical ideas to the
analysis of real networks.
Level:
Open Rank
Position for:
Faculty
Unit:
Department of Mathematics and its Applications
Full-time

Starting date: 2012

Application deadline: The search committee will start reviewing
applications on 1 November, 2011, until the position is filled

The Department of Mathematics at the Central European University
invites applications for a full-time position in the field of network
science. The successful candidate should have a demonstrated potential
for high-level research and publication, and a research record in
network science, i.e. the application of mathematical ideas to the
analysis of real networks.

The candidate is also expected to participate in teaching and research
in the Center for Network Science at the Central European University,
and to direct, in collaboration with other CEU faculty, student
research in the area of network science. A strong funding record from
EU or other sources, and a willingness/experience in EU wide
collaborations will be considered an advantage.

Duties and responsibilities:

Teaching graduate courses in mathematics and network science, and
supervising MA and PhD theses. The yearly teaching load is 12 credits
(1 credit equals 12 classroom hours). The successful candidates will
be expected to maintain an active research agenda and regularly
publish in major professional journals.

Qualifications:

PhD in mathematics, physics, computer science, and related areas, with
advanced training in mathematical approaches to networks and a
demonstrated excellent potential for research and teaching in the
field.

Compensation:

An internationally competitive salary is offered commensurate with experience.

How to apply:
Applicants need to submit: their CV, list of publications, a sample
paper, a short statement about their research plans, and the names and
addresses of at least three referees. Please send your complete
application to positions@ceu.hu including job code in subject line:
2011/050 Deadline: The search committee will start reviewing
applications on 1 November, 2011, until the position is filled CEU is
an equal opportunity employer.
positions@ceu.hu
**********************************************************
*
* 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, October 9, 2011

[DMANET] 2nd CfP: AICT 2012 || May 27 - June 1, 2012 - Stuttgart, Germany

INVITATION:

=================
Please, consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish
original scientific results to AICT 2012.
The submission deadline is set to January 5, 2012.
In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org
=================


============== AICT 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

AICT 2012, The Eighth Advanced International Conference on Telecommunications
May 27 - June 1, 2012 - Stuttgart, Germany

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

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

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

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

Submission deadline: January 5, 2012

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


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


Signal processing, protocols and standardization

Standardization (IEEE 802.17, Policy Models, Etc.); IEEE 802.11 engineering; Telecommunications protocol engineering;
Future networks: protocol and standards; Standardization (IEEE 802.15, IEEE 802.16); Communication theory, signal
processing, modulation; Modulation, coding and synchronization; Propagation, antennas and channel characterization; Signal
separation and Interference rejection; Critical infrastructure protection

Ad hoc, autonomic and sensor networks

Autonomic home networking; Sensor, mesh, and Ad hoc networks; Programmable networks; Active networks; Self-organization
and network reconfiguration; Partial and intermittent resources and services; Unicast and multicast routing; Radio
resource sharing in wireless networks; Energy-efficient communications; Vehicular Ad hoc networks; Underwater sensor
networks; Emerging sensor technologies; Intelligent video surveilance; Multi-sensor surveillance;

Wireless technologies

3G And 4G Mobile communications services; Evolution from 2G To 2.5G, 3G and beyond; Wireless multimedia and networks and
systems; Cellular and Ad hoc networks; Mobile broadband technologies; Mobile software (agents); Wireless access (WPAN,
WLAN, WLL); Wireless communications antennas and propagation and transmission technologies; Vertical, horizontal and
diagonalhandover; Broadband wireless technology (HSDPA, HSUPA, LTE, Wimax, Wiran); Cross-layer modeling and design;
Heterogeneity and diversity; Ultra-wideband communications (UWB); Wireless hacking;

Management, operation and control networks

Monitoring telecommunicaitons systems; Network management contingency challenges; Real-time traffic and QoS; Performance
and QoS, traffic engineering (MPLS, Diffserv, Intserv, Etc.); Telecommunications management and control of heterogeneous
networks; Mobility control and mobility engineering; Mobile video surveillance; Mobility and QoS management;
Communications networks security; Information security; IPR and network security;

Core technologies and access technologies and networks

Wireless-fiber convergence; Metro/Access networks; Broadband access networks and services; Next Generation Networks and
technologies; Future Internet; Inteligent & Smart networks; Grid, Cluster and Internet computing; Designing and management
of optical networks; Performance of optical networks; Future technologies in optical communications; PLC (Homeplug, OPERA,
UPA, CEPCA, IEEE, HD-PLC Alliance);

Future applications and services

Service-oriented architectures; E-Learning and mobile learning on telecommunications; SOHO (Small Offices/Home Offices;
Emerging telecommunications software tools; Object and component technologies in telecommunication software; Platforms for
Web Services-based applications and services; Web Services communications, applications, and performance; Applications in
telemedicine; Security and trust in future services applications;

Optical Technologies

Optical internetworking architectures; Novel architectures for optical routers and switches; Optical packet / burst
switching; Optical multi-wavelength label switching; Optical network performance modeling; Optical network control and
management; Measurement, monitoring and supervision techniques; Security and privacy in optical networks; Optical access
networks designs and protocols; High speed optical LANs and gigabit Ethernet; Energy efficiency in optical networks;
Inter-working between optical and wireless networks; Optical Grids, optical networking for cloud computing; Optical
integrated circuits and novel transmission methods; Standards for optical internetworking; Optical networks for future
Internet design; Multi-domain routing protocols for IP over optical networks; Control and management protocols for IP over
optical networks; Next-generation IP networking and Optical Internet; Development prospect for Optical Internet; Optical
transmission systems and technologies; Optical access systems and technologies; Optical devices

Cognitive radio

Cognitive radio technologies and opportunistic spectrum utilization; Spectrum sensing technologies; Dynamic spectrum
access; Information theory and performance limits of dynamic spectrum access; Distributed algorithms for spectrum
detection and cooperative spectrum sensing; Inter- and Intra- standards interoperability; Cross-layer algorithms based on
spectrum sensing techniques; Advanced signal processing techniques for cognitive radio; Physical-layer design of software
radio and cognitive radio transceivers; Interference and coexistence analysis; Radio resource allocation; Decision making;
Game theory; Cognitive radio with reinforcement learning; SWR and CR management; Cognitive radio sensing in the large and
feature detection; Spectrum and performance management in cognitive radio networks; Cognitive radio applications; Future
Internet with cognitive technologies; Flexible and opportunistic wireless access; Multimedia communications through
cognitive networks; Regulatory policies on spectrum sharing for future broadband networks; Cognitive radio standards;
Cognitive radio architecture for equipments; Enabling SDR technology for cognitive radio; Hardware reconfigurability;
Testbbeds

Teletraffic modeling and management

Traffic and performance measurements; Traffic characterization and modeling; Trends and patterns; Scaling phenomena;
Packet and flow level models; Traffic control and QosS; Queuing theory and queuing networks; Performance evaluation;
Scheduling and admission control; Reservation and priority mechanisms; Overload control; Broadcast and multicast traffic
control; Analytical and numerical analysis; Network design and optimization of wired and wireless networks; Mobility and
resource management; Traffic monitoring and management; Traffic engineering in multi-technology networks; Internet traffic
engineering; Traffic grooming; Simulation methodology for communications networks; Simulation models and tools;

E-Learning and telecommunications

Architecture of learning technology systems; Advanced uses of multimedia and hypermedia; Integrated learning and
educational environments; National and international projects on e-learning and telecommunications; Remote and wireless
teaching technologies; Navigational aspects for learning; e-Learning industry and universities programs; Anytime/anywhere
e-learning and wearable network devices; Tutoring e-learning applications and services; Cost models for e-learning on
telecommunications; Satellite technologies for e-learning; Teaching e-learning methodologies and technologies; Adaptive
e-learning and intelligent applications/tools; Agent technology; Training e-learning teachers; Practical uses of authoring
tools; Application of metadata and virtual reality; Collaborative learning/groupware; Intelligent tutoring systems;
Internet based systems; Application of instructional design theories; Evaluation of learning technology systems; Standards
related activities;

----------------------------------
Technical Program Committee: http://www.iaria.org/conferences2012/AICT12.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/
*
**********************************************************

Graduate and Postdoctoral Fellowships in Risk Analytics and High Performance Computing (HPC)

=======================================================
Graduate and Postdoctoral Fellowships in Risk Analytics
and High Performance Computing (HPC)
=======================================================

Applications are invited for Postdoctoral Fellowships
(renewable) and funded graduate studies positions in
Risk Analytics and High Performance Computing
(HPC) under the supervision of Dr. Andrew Rau-Chaplin from
Faculty of Computer Science at Dalhousie University.

The research focuses on two intertwined themes, namely, the
design of 1) scenario-based catastrophic risk models and 2)
analytical systems for the management and analysis of
portfolios of catastrophic risk. Candidates with one or more of
the following research interests are encouraged to apply: 1)
Catastrophe Modeling for Wind, Earthquake or Flood Risk, or 2)
Mathematical Modeling, Simulation, and Optimization, or 3) High
Performance Computing - Applications for Clusters and Clouds

*****Qualifications*****
Successful candidates for the Post Doctoral postions will
hold a recent Ph.D. in Computer Science, Mathematics,
Statistics, Engineering, or a related science.
They will have experience working on modeling,
stochastic simulation, optimization, or HPC oriented projects,
and strong algorithm design, implementation, and evaluation
skills. We are seeking individuals who can bring strong
technical skills and enthusiasm to an area of research ripe for
innovation and who will be able to integrate well into a larger
team. Knowledge of reinsurance or risk analytics is not
required. Of key importance is a candidate's willingness and
ability to come up the learning curve quickly in areas she or
he has not been previously exposed to.

*****Industrial Connection*****
These positions are made possible in large part by FlagstoneRe,
a global reinsurance company that focuses on specialty and
property catastrophe reinsurance. The postdoctoral fellows will
work closely with the supervisor (Dr. Rau-Chaplin), and members
of FlagstoneRe's research, analytics, and HPC teams. Flagstone
Re values highly motivated individuals with strong team spirit
and high research standards who can balance theoretical
concerns and practical issues.

*****Timeline and Application Procedures*****
These positions are open immediately. The initial contract is
one year with possible extension. Applicants should send a full
Curriculum Vitae, letters from two referees and a cover letter
highlighting their prior achievements and a brief summary of
their statement of their interest and experience in this area.
Electronic submissions are encouraged. Applicants are strongly
encouraged to contact Andrew Rau-Chaplin as early as possible
to express interest and to ask any questions. Applications will
be considered until the positions are filled.

Dr. Andrew Rau-Chaplin (arc [at] cs.dal.ca) Faculty of Computer
Science Dalhousie University www.cs.dal.ca/~arc

Saturday, October 8, 2011

LATA 2012: submission deadline extended

*********************************************************************
6th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA
THEORY AND APPLICATIONS

LATA 2012

A Coruña, Spain

March 5‐9, 2012

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


*** SUBMISSION DEADLINE EXTENDED TO OCTOBER 12 (23:59h, CET) ***


AIMS:

LATA is a yearly conference in theoretical computer science and its applications. Following the tradition
of the International Schools in Formal Languages and Applications developed at Rovira i Virgili University
in Tarragona since 2002, LATA 2012 will reserve significant room for young scholars at the beginning of
their career. It will aim at attracting contributions from both classical theory fields and application areas
(bioinformatics, systems biology, language technology, artificial intelligence, etc.).

VENUE:

LATA 2012 will take place in A Coruña, at the northwest of Spain. The venue will be the Faculty of
Computer Science, University of A Coruña.

SCOPE:

Topics of either theoretical or applied interest include, but are not limited to:

‐ algebraic language theory
‐ algorithms for semi‐structured data mining
‐ algorithms on automata and words
‐ automata and logic
‐ automata for system analysis and programme verification
‐ automata, concurrency and Petri nets
‐ automatic structures
‐ cellular automata
‐ combinatorics on words
‐ computability
‐ computational complexity
‐ computational linguistics
‐ data and image compression
‐ decidability questions on words and languages
‐ descriptional complexity
‐ DNA and other models of bio‐inspired computing
‐ document engineering
‐ foundations of finite state technology
‐ foundations of XML
‐ fuzzy and rough languages
‐ grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.)
‐ grammars and automata architectures
‐ grammatical inference and algorithmic learning
‐ graphs and graph transformation
‐ language varieties and semigroups
‐ language‐based cryptography
‐ language‐theoretic foundations of artificial intelligence and artificial life
‐ parallel and regulated rewriting
‐ parsing
‐ pattern recognition
‐ patterns and codes
‐ power series
‐ quantum, chemical and optical computing
‐ semantics
‐ string and combinatorial issues in computational biology and bioinformatics
‐ string processing algorithms
‐ symbolic dynamics
‐ symbolic neural networks
‐ term rewriting
‐ transducers
‐ trees, tree languages and tree automata
‐ weighted automata

STRUCTURE:

LATA 2012 will consist of:

‐ 3 invited talks
‐ 2 invited tutorials
‐ peer‐reviewed contributions

INVITED SPEAKERS:

Eugene Asarin (Paris 7), Measuring Information in Timed Languages
Bernard Boigelot (Liège), Automata-based Symbolic Representation of Polyhedra
Gilles Dowek (INRIA), tutorial Around the Physical Church Thesis: Cellular Automata, Graphs, Formal Languages and Quantum Theory
Rodney Downey (Wellington), tutorial 20 Years of Parameterized Complexity
Jack Lutz (Iowa State), to be announced

PROGRAMME COMMITTEE:

Eric Allender (Rutgers)
Miguel Á. Alonso (A Coruña)
Amihood Amir (Bar‐Ilan)
Dana Angluin (Yale)
Franz Baader (Dresden)
Patricia Bouyer (Cachan)
John Case (Delaware)
Volker Diekert (Stuttgart)
Paul Gastin (Cachan)
Reiko Heckel (Leicester)
Sanjay Jain (Singapore)
Janusz Kacprzyk (Warsaw)
Victor Khomenko (Newcastle)
Bakhadyr Khoussainov (Auckland)
Claude Kirchner (Paris)
Maciej Koutny (Newcastle)
Gregory Kucherov (Marne‐la‐Vallée)
Salvador Lucas (Valencia)
Sebastian Maneth (Sydney)
Carlos Martín‐Vide (Tarragona, chair)
Giancarlo Mauri (Milano Bicocca)
Aart Middeldorp (Innsbruck)
Faron Moller (Swansea)
Angelo Montanari (Udine)
Joachim Niehren (Lille)
Mitsunori Ogihara (Miami)
Enno Ohlebusch (Ulm)
Dominique Perrin (Marne‐la‐Vallée)
Alberto Policriti (Udine)
Alexander Rabinovich (Tel Aviv)
Mathieu Raffinot (Paris)
Jörg Rothe (Düsseldorf)
Olivier H. Roux (Nantes)
Yasubumi Sakakibara (Keio)
Eljas Soisalon‐Soininen (Aalto)
Frank Stephan (Singapore)
Jens Stoye (Bielefeld)
Howard Straubing (Boston)
Masayuki Takeda (Kyushu)
Wolfgang Thomas (Aachen)
Sophie Tison (Lille)
Jacobo Torán (Ulm)
Tayssir Touili (Paris)
Esko Ukkonen (Helsinki)
Frits Vaandrager (Nijmegen)
Manuel Vilares (Vigo)
Todd Wareham (Newfoundland)
Pierre Wolper (Liège)
Hans Zantema (Eindhoven)
Thomas Zeugmann (Sapporo)

ORGANIZING COMMITTEE:

Miguel Á. Alonso (A Coruña, co‐chair)
Adrian Horia Dediu (Tarragona)
Carlos Gómez Rodríguez (A Coruña)
Jorge Graña (A Coruña)
Carlos Martín‐Vide (Tarragona, co‐chair)
Bianca Truthe (Magdeburg)
Jesús Vilares (A Coruña)
Florentina Lilica Voicu (Tarragona)

SUBMISSIONS:

Authors are invited to submit papers presenting original and unpublished research. Papers should not
exceed 12 single‐spaced pages (including eventual appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
http://www.springer.com/computer/lncs/lncs+authors?SGWID=0‐40209‐0‐0‐0). Submissions have to be
uploaded at:

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

PUBLICATIONS:

A volume of proceedings published by Springer in the LNCS series will be available by the time of the
conference.

A special issue of a major journal will be later published containing peer‐reviewed extended versions of
some of the papers contributed to the conference. Submissions to it will be by invitation.

REGISTRATION:

The period for registration will be open since July 16, 2011 until March 5, 2012. The registration form
can be found at the website of the conference: http://grammars.grlmc.com/LATA2012/

Early registration fees: 500 Euro
Early registration fees (PhD students): 400 Euro
Late registration fees: 540 Euro
Late registration fees (PhD students): 440 Euro
On‐site registration fees: 580 Euro
On‐site registration fees (PhD students): 480 Euro

At least one author per paper should register. Papers that do not have a registered author who paid the
fees by December 5, 2011 will be excluded from the proceedings.

Fees comprise access to all sessions, one copy of the proceedings volume, coffee breaks and lunches.
PhD students will need to prove their status on site.

PAYMENT:

Early (resp. late) registration fees must be paid by bank transfer before December 5, 2011 (resp.
February 24, 2012) to the conference series account at Uno‐e Bank (Julián Camarillo 4 C, 28037 Madrid,
Spain):

IBAN: ES3902270001820201823142 – Swift/BIC code: UNOEESM1 (account holder: Carlos Martin‐Vide –
LATA 2012; account holder's address: Av. Catalunya, 35, 43002 Tarragona, Spain).

Please write the participant's name in the subject of the bank form. Transfers should not involve any
expense for the conference. People claiming early registration will be requested to prove that they gave
the bank transfer order by the deadline.

On‐site registration fees can be paid only in cash. A receipt for payments will be provided on site.

Besides paying the registration fees, it is required to fill in the registration form at the website of the
conference.

IMPORTANT DATES:

Paper submission: October 12, 2011 (23:59h, CET)
Notification of paper acceptance or rejection: November 18, 2011
Final version of the paper for the LNCS proceedings: November 27, 2011
Early registration: December 5, 2011
Late registration: February 24, 2012
Starting of the conference: March 5, 2012
Submission to the post‐conference special issue: June 9, 2012

FURTHER INFORMATION:

florentinalilica.voicu@urv.cat

POSTAL ADDRESS:

LATA 2012
Research Group on Mathematical Linguistics
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34‐977‐559543
Fax: +34‐977‐558386

Friday, October 7, 2011

Internship Position at IBM Research, AI for Optimization group

A summer internship position is available for 2012 in the "AI for
Optimization" group at IBM Watson Research Center, Yorktown Heights,
New York. The internship will last for about 3 months and will be
scheduled between March and October, 2012.

Candidates should be exceptional Masters or PhD students in Computer
Science and related areas, and not have already received their PhD by
the internship start date.

The successful candidate is expected to have strong interest and some
experience in one or more of the following:

+ Developing novel technologies based on AI and OR to advance the
state of the art in combinatorial optimization (e.g., Heuristic
Search, Mixed Integer Programming (MIP), Linear Programming (LP))

+ Robust parallelization of search-based algorithms (e.g., using
parallel Branch&Bound; information exchange) exploiting novel
computing architectures such as BlueGene, multi-core end-user
machines, large compute! clusters, and the Cloud

+ Advancing simulation-based optimization approaches to solve real-
world problems and to improve optimization methods themselves by,
e.g., employing techniques from Machine Learning, Local Search, and
Genetic Algorithms for automated algorithm selection and parameter
tuning

+ Applications of Optimization to Analytics, Production Modeling,
Sustainability, Systems, and Databases

Due to strict time constraints, interested candidates should
*immediately contact us* with their CV as well as names and contact
information of at least two references.

Ashish Sabharwal [ashish.sabharwal@us.ibm.com]
Horst Samulowitz [samulowitz@us.ibm.com]
Meinolf Sellmann [meinolf@us.ibm.com]

[DMANET] Two Lectureships/Senior Lectureship in Management Science/Operational Research

The Department of Management Science at University of Strathclyde Business School wants to make appointments for two new posts:

- Lecturer/Senior Lecturer in Management Science/Operational Research (Job reference number: JA/140/2011)
- Lecturer in Management Science/Operational Research (2 years fixed term) (Job reference number: JA/141/2011)

We particularly welcome applications from candidates whose research pays attention to areas such as soft OR, operations management, project management, optimisation, simulation or decision analysis. We seek individuals who have strong methodological basis with the potential to make significant contributions to the international Management Science/Operational Research community as well as an ability to translate theory to practice through collaborative research with user groups.

The Department will provide a supportive environment, encouraging basic and applied research collaborations through mentoring and team working. We shall encourage involvement in Faculty and University-wide initiatives such as the Technology Innovation Centre, and to develop links with the wider OR community. It is anticipated that the candidate's research will be able to inform teaching for our postgraduate (MSc courses in OR and Business Analytics and Consultancy, MBA etc) and undergraduate students on full-time and distance learning programmes.

Prospective candidates are invited to contact Professor Fran Ackermann, Telephone +44 141 548 3610; email: contact-mansci@strath.ac.uk for an informal discussion about the post.

Applications should be lodged with Human Resources, University of Strathclyde, McCance Building, 16 Richmond Street, Glasgow, G1 1XQ by Thursday 27 October 2011. Formal interviews for the post will be held on 16/17 November 2011.

More details about the posts can be found at:

- Lecturer/Senior Lecturer in Management Science/Operational Research
http://www.mis.strath.ac.uk/Personnel/open/1402011.htm

- Lecturer in Management Science/Operational Research (2 years fixed term)
http://www.mis.strath.ac.uk/Personnel/open/1412011.htm

===============================
Dr. Kerem Akartunali
John Anderson Research Lecturer in Optimisation

Dept. of Management Science
University of Strathclyde
Graham Hills Building, Rm 873
40 George Street
Glasgow G1 1QE
United Kingdom

Tel (work): +44-141-548 4542
Tel (mobile): +44-776-869 5448
Web: http://personal.strath.ac.uk/kerem.akartunali/

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

Postdoc positions in Budapest (parameterized complexity & algorithms)

Postdoc positions are available at the Computer and Automation Research
Institute (Hungarian Academy of Sciences), Budapest, Hungary, supported
by the European Research Council (ERC) Starting Grant PARAMTIGHT:
"Parameterized complexity and the search for tight complexity results"
held by Dániel Marx. The goal of the project is to systematically push
the boundaries of algorithmic and hardess results, mostly in the
framework of parameterized complexity, with the aim of obtaining
tight results that give an optimal understanding of the complexity of a
problem.

The candidates should have a PhD degree in Computer Science or related
area; research experience at postdoctoral level is of advantage. A
successful candidate should have excellent knowledge of algorithms
and/or complexity, preferably in the setting of parameterized complexity
and fixed-parameter tractability. Strong background in graph theory,
combinatorics, constraint satisfaction, approximation, or kernelization
is of advantage.

The earliest starting date is January 2012. The review of applicants
will begin immediately and continue until the positions are filled.
Applications received by 1 November 2012 will receive full
consideration. Informal inquires by email are welcome.

[DMANET] Postdoc positions in Budapest (parameterized complexity & algorithms)

Postdoc positions are available at the Computer and Automation Research
Institute (Hungarian Academy of Sciences), Budapest, Hungary, supported
by the European Research Council (ERC) Starting Grant PARAMTIGHT:
"Parameterized complexity and the search for tight complexity results"
held by Dániel Marx. The goal of the project is to systematically push
the boundaries of algorithmic and hardess results, mostly in the
framework of parameterized complexity, with the aim of obtaining
tight results that give an optimal understanding of the complexity of a
problem.

The candidates should have a PhD degree in Computer Science or related
area; research experience at postdoctoral level is of advantage. A
successful candidate should have excellent knowledge of algorithms
and/or complexity, preferably in the setting of parameterized complexity
and fixed-parameter tractability. Strong background in graph theory,
combinatorics, constraint satisfaction, approximation, or kernelization
is of advantage.

The earliest starting date is January 2012. The review of applicants
will begin immediately and continue until the positions are filled.
Applications received by 1 November 2012 will receive full
consideration. Informal inquires by email are welcome.


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

MSc position in cryptography at the University of Warsaw

Faculty of Mathematics, Informatics and Mechanics of the University of
Warsaw is looking for an MSc student to work on the
project "Cryptographic Protocols Provably-Secure Against Physical
Attacks". The project is founded by the Foundation for Polish Science
"Welcome" programme operated within the Innovative Economy Operational
Programme 2007-2013.

The ideal candidate should be familiar with the probability theory,
computational complexity, algebra, and number theory. The knowledge
of cryptography and information theory is a plus, but is not a
prerequisite. Fluency in English is a must. The student can work
both on the theoretical aspects of the project, and on the practical
implementations.

duration: 2 years

Formal requirement: while participating in the project the student
should be enrolled to the MSc-level studies at some Polish university.

There is no strict application deadline but candidates applying by
20.11.2011 (noon) will be given preference.

More information about the project and the positions is available at:
http://crypto.mimuw.edu.pl/Welcome/

--
Stefan Dziembowski
www.dziembowski.net

Thursday, October 6, 2011

[DMANET] PMS2012- 13th International Conference on Project Management and Scheduling

[Apologize for multiple receptions of this email]

PMS 2012
13th International Workshop on Project Management and Scheduling
April 1-4, 2012
Leuven (Belgium)

PMS is an international workshop series initialized by the EURO PMS Working Group, devoted to project management and scheduling (http://www.cs.put.poznan.pl/pms/). The workshop is held every two years in different locations around Europe.
This workshop brings together researchers and practitioners from different disciplines of Computer Science, Operational Research, Optimization Engineering, Mathematical Programming and Industrial Engineering. Theoretical results and algorithmic developments in the fields of Project Management and Scheduling will be covered, including project management and scheduling practice and applications to real-life situations.

PMS 2012 (13th International Workshop on Project Management and Scheduling) is organized by the Research Center for Operations Management (http://www.econ.kuleuven.be/eng/tew/academic/prodbel/) of the Faculty of Business and Economics of the Katholieke Universiteit Leuven (Leuven, Belgium).

A Welcome Reception will be held on April 1, 2012.

The workshop itself will then be held on the three consecutive days from April 2, 2012 till April 4, 2012.

The workshop website is now available (https://www.econ.kuleuven.be/eng/tew/academic/prodbel/pms2012).

The workshop will consist of technical and selected presentations as well as invited presentations made by esteemed researchers working on Project Management and Scheduling.

Workshop venue

The workshop will be held in university buildings located in the center of the city of Leuven (Belgium)(http://www.leuven.be/en/) .

Topics

The workshop will cover the following but non exhaustive list of topics:

Project Management

* Network modeling,
* Project scheduling,
* Resource management,
* Due-date management,
* Project risk manbagement,
* Project scheduling under uncertainty,
* Proactive/reactive project scheduling,
* Multicriteria project scheduling,
* Applications,
* Software.
Machine Scheduling

* Shop scheduling,
* Scheduling with additional constraints,
* Machine assignment and scheduling,
* Flexible / robust scheduling,
* Grid scheduling,
* Multicriteria scheduling,
* Applications,
* Software.
Abstract submission
Extended abstracts of not more than 4 single-spaced A4 pages are allowed for submission. Templates and guidelines to authors will be made available on the PMS 2012 website. These 4-page submissions will be reviewed according to the standard reviewing process of international conferences. A selection of submissions will be presented during the workshop.
After the workshop venue, the authors will have the opportunity to submit full papers to a feature issue of an international journal, as for the previous editions of the workshop.

Accommodation

A list of hotels with on-line registration possibility will be made available on the PMS 2012 website.

On behalf of the Organizing Committee,


Erik Demeulemeester (Conference Chair)
Willy Herroelen


Em. Prof. Dr. Willy Herroelen
Research Center for Operations Management
Department of Decision Sciences & Information Management
Faculty of Business and Economics, Naamsestraat 69, B-3000 Leuven (Belgium)
Mobile Phone +32 476 55 24 74


**********************************************************
*
* 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 positions at LIAFA, Paris, France

The Algorithms and Complexity group of LIAFA (CNRS and University
Paris Diderot), Paris, France, is seeking excellent candidates for one
or more postdoctoral positions in classical and quantum computing.
Topics of interest include (but are not limited to): algorithms,
online algorithms, streaming algorithms, approximation algorithms,
communication complexity, cryptography, computational game theory,
quantum computing, computational applications of logic, randomness
in computing, privacy.

LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientfic Research) and University Paris Diderot - Paris 7.
For more information about LIAFA, please see http://www.liafa.jussieu.fr
,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.jussieu.fr/algocomp .
Further information may be obtained from any of the permanent
members of the group.

To apply please send a CV, a summary of research and names of
at least three references to algocomp-apply@liafa.jussieu.fr .
For a starting date of January 2012 applications should be received by
November 1st, 2011.
For a starting date of September 2012 applications should be received by
February 1st, 2012.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] EuroGP 2012 - second call for papers

* Apologies if you receive this multiple times *


***********************************
EuroGP 2012
(second call for papers)
***********************************

15th European Conference on Genetic Programming
11-13 April 2012, Malaga - Spain
www.evostar.org

Submission deadline:
November 30, 2011


EuroGP is the premier annual conference on Genetic Programming. EuroGP
is always a very enjoyable event, held together with the other main
european events on Evolutionary Computation (EvoBio, EvoCOP,
EvoApplications, EvoMusArt), collectively designated as EvoStar (Evo*).
EvoStar 2012 takes place in Malaga, Spain, the capital of the Costa del
Sol and one of the most cosmopolitan and open cities in Europe, widely
known for its superb weather, food, and hospitality. It offers an
excellent environment for participants to enjoy their visit, from the
academic and the social point of view.

EuroGP 2012 seeks high quality papers on topics strongly related to the
evolution of computer programs, including but not limited to:
* Theoretical developments
* Empirical studies of GP performance and behaviour
* Landscape analysis of GP
* Algorithms, representations and operators
* Applications of GP to real-life problems
* Evolutionary design
* Evolutionary robotics
* Tree-based GP
* Linear GP
* Graph-based GP
* Grammar-based GP
* Evolvable hardware
* Self-reproducing programs
* Multi-population GP
* Multi-objective GP
* Fast/Parallel GP (e.g., GPU implementation of GP)
* Probabilistic GP (e.g., combining ideas of estimation of
distribution algorithms and GP)
* Evolution of various classes of automata or machine (e.g.
cellular automata, finite state machines, pushdown automata, Turing
machines)
* Software Engineering and GP: using GP to evolve complete programs
(e.g., including variables, loops, recursion) and using SE methods
(e.g., software design) to improve GP
* Object-oriented GP
* Hybrid architectures including GP components
* Unconventional evolvable computation

The submissions will be peer reviewed by at least three members of the
program committee. The reviewing process will be double-blind, so please
omit information about the authors in the submitted paper. Accepted
papers will be presented orally or as posters at the conference and will
be published by Springer in the LNCS series.

The papers which receive the best reviews will be nominated for the Best
Paper Award. Authors of selected papers may be invited to submit
extended versions of their work to the Springer journal GPEM - Genetic
Programming and Evolvable Machines (http://www.springer.com/10710). Last
year, four best papers were selected for a special issue of GPEM to be
published in early 2012.

To celebrate the 10th anniversary of EvoBio, EuroGP encourages
submissions applying genetic programming to problems in computational
biology and new biologically inspired extensions of the genetic
programming framework for a special joint session of EuroGP with EvoBio.
These papers can be submitted either to EuroGP or EvoBio, and the
authors of the best ones will be invited to submit extended versions of
their work to a special issue of GPEM.

Submission link:
http://myreview.csregistry.org/eurogp12/
Page limit: 12 pages in Springer LNCS format.

Important Dates:
* Submission deadline: 30 November 2011
* Notification to authors: 14 January 2012
* Camera-ready deadline: 5 February 2012
* Conference: 11-13 April 2012

Program Chairs:

* Sara Silva, INESC-ID Lisboa, Portugal
http://kdbio.inesc-id.pt/~sara/
sara(at)kdbio.inesc-id.pt
* Alberto Moraglio, University of Birmingham, UK
http://www.cs.bham.ac.uk/~moraglia/
a.moraglio(at)cs.bham.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, October 4, 2011

MADALGO PhD student and Post Doc Positions (deadline November 1)

Center for Massive Data Algoithmics (MADALGO), is a basic research
center funded by the Danish National Research Foundation. The center is
located at the Department of Computer Science, Aarhus University,
Denmark, but also includes researchers at CSAIL, Massachusetts Institute
of Technology, the Max Planck Institute for Informatics and at Frankfurt
University. The center covers all areas of the design, analysis and
implementation of algorithms and data structures for processing massive
data (interpreted broadly to cover computations where data is large
compared to the computational resources), with focus on I/O-efficient,
cache-oblivious and streaming algorithms. See www.madalgo.au.dk for more
information.

Starting February 1 or later several positions are available at MADALGO
under the supervision of Professor Lars Arge (www.madalgo.au.dk/~large)
and Associate Professor Gerth S. Brodal (www.madalgo.au.dk/~brodal):

Several PhD student positions are available. The positions are
administered through the Aarhus Graduate School of Science
(science.au.dk/en/studies/phd-studies/) and include full tuition waiver
and a very competitive scholarship. Applications are welcomed from
students with at least three years of full-time study by February of
2011. Students with a strong background in the design and analysis of
algorithms will be preferred. Students with background in Geographic
Information Systems (GIS) are also very welcome to apply.

One or more MADALGO Postdoc positions at the level of Research Assistant
Professor of Computer Science may be available. Post Doc positions are
initially for one year, but they can be extended by mutual consent.
MADALGO welcomes Postdoctoral researchers with clearly demonstrated
experience and skills in the design and analysis of algorithms and data
structures. Researchers with experience with I/O-efficient,
cache-oblivious or streaming algorithms, as well as with implementation
of such algorithms (algorithm engineering experience), are preferred.
The responsibilities of MADALGO Postdocs include work on algorithms for
massive dataset problems in collaboration with center researchers, along
with modest teaching responsibilities.

Application deadline for both Phd student and postdoc positions is
November 1, 2011.
Application for PhD student positions should apply using the Aarhus
Graduate School of Science application system accessible from
www.madalgo.au.dk.
Applicants for Post Doc positions should apply by uploading a letter of
interest and a CV, as well as indicate at least two names of references
for recommendations, using the application form also available at
www.madalgo.au.dk.

For further information contact Center Director, Professor Lars Arge at
large@madalgo.au.dk.

EuroCG 2012, Call for Papers

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

Call for Papers

EuroCG 2012
28th European Workshop on Computational Geometry

March 19-21, 2012 - Assisi, Perugia, Italy

http://www.diei.unipg.it/eurocg2012
=======================================================================

The 28th European Workshop on Computational Geometry (EuroCG 2012) will be
held on March 19 - 21, 2012 in the historical center of Assisi, Italy (at
the so-called "Franciscan Cittadella"). EuroCG is an annual workshop that
combines a strong scientific tradition with a friendly and informal
atmosphere. The workshop is a forum where researchers can meet, discuss
their work, present their results, and establish scientific collaborations.

Topics of interest cover all aspects of computational geometry, including
the following:

* discrete and combinatorial geometry and topology
* design and analysis of geometric algorithms and data structures
* implementation and experimental evaluation of geometric algorithms
* numerical and algebraic issues arising from implementations
* analysis of geometric configurations
* geometric modeling, visualization and simulation
* combinatorial optimization
* graph drawing
* computer-aided design and manufacturing
* structural molecular biology
* geographic information systems
* robotics and virtual worlds

SUBMISSIONS AND PROCEEDINGS
---------------------------

We invite authors to submit extended abstracts (4 pages, two columns) of
original research. Submissions will be handled through EasyChair.

We remark that EuroCG does not have formally reviewed proceedings. A booklet
of abstracts, without ISBN number, is distributed at the conference for the
benefit of the community and must be regarded as a collection of preprints
rather than a formally reviewed selection of papers. Results presented at
EuroCG are expected to appear in other conferences with formal proceedings
and/or in journals. In order to guarantee that papers in the booklet are in
scope and meet some minimal standards, there will be a limited reviewing
process.


Selected papers from EuroCG 2012 will also be considered for a special issue
of the journal Computational Geometry: Theory and Applications.

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

* Submission Deadline : January, 9
* Acceptance Notification : January, 26
* Camera-ready version : February, 10
* Early Registration : February, 24

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

* Olivier Devillers, INRIA Sophia Antipolis.
* Jan Kratochvíl, Charles University Prague.
* Günter Rote, Freie Universität Berlin.

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

* Walter Didimo, U. Perugia (co-chair)
* Sándor Fekete, UT Braunschweig
* Michael Hoffmann, ETH Zürich
* Christian Knauer, U. Bayreuth
* Marc van Kreveld, U. Utrecht
* Stefan Langerman, U. Libre de Bruxelles
* Sylvain Lazard, INRIA Nancy
* Giuseppe Liotta, U. Perugia (co-chair)
* Henk Meijer, Roosevelt Academy
* Vera Sacristán, U. Politècnica de Catalunya

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

* Carla Binucci, U. Perugia
* Emilio Di Giacomo, U. Perugia
* Luca Grilli, U. Perugia
* Walter Didimo, U. Perugia
* Giuseppe Liotta, U. Perugia

[DMANET] Colloquium on Combinatorics 2011

******************************************
* *
* Colloquium on Combinatorics *
* Magdeburg *
* 11th and 12th of November 2011 *
* *
******************************************


If you are interested to attend the 30th Colloquium on Combinatorics
2011 in Magdeburg, Nov. 11 and 12., note that the deadline for
registration is October 14. More information, including
abstracts of the invited talks given by Daniel Kral, Peter Cameron,
Christine Bachoc and Ingo Schiermeyer, can be found on the webpage

www.math.uni-magdeburg.de/kolkom

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

Organizers:

Prof. Dr. Stefan Felsner
Institut fuer Mathematik
Technische Universitaet Berlin
10623 Berlin
felsner@math.tu-berlin.de

Prof. Dr. Alexander Pott
Fakultaet fuer Mathematik
Otto-von-Guericke-Universitaet Magdeburg
Postfach 4120
39016 Magdeburg
alexander.pott@ovgu.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/
*
**********************************************************

Monday, October 3, 2011

[DMANET] cfp GIPSy 2011: Games, Logics and Security, 25-27 Oct 2011, , Rennes, France

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


*** CALL FOR PAPER and PARTICIPATION ***


GIPSy 2011


Workshop on Games, Logics and Security (2nd edition)


Rennes, France

25-27 October 2011


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


Security and privacy problems in computer networks and mobile
applications often stem from the interaction between agents of the
network (which can be individuals as well as devices or softwares acting
autonomously). Modeling the interaction between agents is therefore
essential to address security problems appropriately. Game theory and
logic are the most prominent frameworks for the formal treatment of
interaction. They permit not only to model and represent this
interaction between agents, but they also lead to the development of
applicable algorithms and decision procedures. In the past two decades,
a number of logical frameworks and game-theoretic approaches have been
proposed to model and analyze computer networks from the security point
of view, sometimes resorting to non-classical logics (such as epistemic
or intuitionistic logics).

The main goal of this workshop is to gather researchers interested in
games, logic and security (in a broad sense), and to offer a privileged
forum to present their work and exchange ideas on these topics.


The following invited tutorials are scheduled:

Gilles Barthe, IMDEA Software Institute Research, Madrid
Probabilistic Reasoning about Differential Privacy

Anne Broadbent, Institute for Quantum Computing & Department of
Combinatorics and Optimization, University of Waterloo
Quantum Nonlocal Games and Cryptography

Jean-Pierre Hubaux, EPFL Lausanne
Designing Network Security and Privacy Mechanisms: How Game Theory Can Help

Mark Ryan, University of Birmingham
Verifying Real-Life Protocols: Theory and Two Cases

Moshe Vardi, Department of Computer Science, Rice University
The Rise and Fall of LTL
Also, a large audience talk from Moshe Vardi will be given at Uni on
An Logic Begat Computer Science: When Giants Roamed the Earth

Apart from the invited talks, participants have the opportunity to give
short talks (approximately 20 minutes). Selection will be made on the
basis of an extended abstract of at most 2 pages.

The registration is free but mandatory. Lunches are included in the
registration.

Important dates:
- Submission deadline: 9th October 2011
- Notification to authors: 11th October 2011
- Deadline for registration: 13th October 2011
- Workshop: 25th-27th October 2011

We will be able to cover part of travel and accommodation costs for a
limited number of participants (especially students). For information,
please contact us at gipsy2011@listes.irisa.fr by the 9th of October 2011.

Scientific committee:
- Guillaume Aucher (Université de Rennes 1 - INRIA)
- Nathalie Bertrand (INRIA Rennes)
- Sébastien Gambs (Université de Rennes 1 - INRIA)
- Guillaume Piolle (Supélec, Rennes)
- Sophie Pinchinat (Université de Rennes 1)

Local organization:
- Laurence Dinh
- Lydie Mabil
- Bastien Maubert

All important informations can be found at
http://www.irisa.fr/prive/Sophie.Pinchinat/GIPSy/gipsy11.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: Springer PPNA Special Issue on M2M Communications

Peer-to-Peer Networking and Applications (SCIE 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] CFP: ADHOC-NOW 2012, Belgrade, Serbia, July 9-11, 2012

Call for Papers
ADHOC-NOW 2012
The 11th International Conference on Ad Hoc Networks and Wireless
Belgrade, Serbia, July 9-11, 2012
http://www.adhocnow.com/

Since its creation in 2002, the International Conference on Ad Hoc
Networks and Wireless (ADHOC-NOW) has become a well-established and
well known event 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. The eleventh edition of this series will take
place in Belgrade, Serbia, from the 9th to the 11th of July, 2012.

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 Algorithms for Ad Hoc Networks
* Energy Efficiency
* Geometric Graphs
* Location Discovery and Management
* Mobility Handling and Utilization
* Wireless Mesh Networks
* Mobile Ad Hoc Computing Platforms
* Systems and Testbeds
* Mobile Social Networking
* Quality-of-Service
* Routing Protocols (Unicast, Multicast, etc.)
* Secure Services and Protocols
* Sensor Networks
* Self-Configuration
* Service Discovery
* Timing Synchronization
* Vehicular Networks
* Wireless Internet

IMPORTANT DATES
Paper Submission:    February 17, 2012
Author Notification:    March 30, 2012
Final Submission:    April 13, 2012

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 submission to a
special issue of Ad Hoc & Sensor Wireless Networks: An International
Journal (AHSWN), SCIE-indexed.

General Chair
Ivan Stojmenovic, Univ. of Ottawa, Canada, and Univ. of Novi Sad, Serbia

TPC Co-Chairs
Xiangyang Li, Illinois Institute of Technology, USA
Symeon Papavassiliou, National Technical Univ. of Athens, Greece

Publicity Co-Chair
Hannes Frey, University of Paderborn, Germany
Xu Li, INRIA Lille – Nord Europe, France
Márcio Almeida, University of Ottawa, Canada

Registration & Local arrangements
Mirjana Prljic, Impala, Belgrade, Serbia

Proceedings Co-Chairs
Rafael Falcon, University of Ottawa, Canada
Stefan Ruehrup, Telecommunications Research Center Vienna, Austria

Submission Chair
Sushmita Ruj, University of Ottawa, Canada

Webchair
Milos Stojmenovic, Singidunum University, Serbia
**********************************************************
*
* 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] Lectureship in Management Science, London School of Economics

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE
Department of Management
Lectureship in Management Science
Salary: £40,484 to £46,897 pa. incl.

The Department of Management invites applications from candidates with
proven research
ability in any area of Management Science, especially in the Management
Science Group's
areas of existing strengths in Operations Research and Decision Analysis.

You will have a Ph.D. in a relevant subject, and an established
track-record of research at a
level of international excellence, with publications in Management
Science, Operations
Research, Mathematical Programming, Mathematics of Operations Research, J.
Combinatorial Theory (B), or journals of similar quality in management
science or a related
field.

You will contribute to the department's activities, including research
and the teaching of
courses in Management Science and in Management more broadly.

The post will commence on 1 July 2012 or as soon as possible thereafter.

Information about the department can be found at
http://www2.lse.ac.uk/management, and the
group's faculty at
http://www2.lse.ac.uk/management/people/academic-groups.aspx.

Any candidate wishing to discuss the appointment informally is invited
to contact Professor
Richard Steinberg by email at r.j.steinberg@lse.ac.uk.

To apply for this post please go to www.lse.ac.uk/JobsatLSE and select
"Visit the ONLINE
RECRUITMENT SYSTEM web page". If you have any queries about applying on
the online
system, please email hr.jobs@lse.ac.uk or call 0207 107 5242 quoting
reference 1198291.

The closing date for the receipt of applications is 23:59 (UK time) on 2
November 2011.
Regrettably, we are unable to accept any applications that are received
after this date.

We value diversity and wish to promote equality at all levels

Please access the attached hyperlink for an important electronic communications disclaimer: http://lse.ac.uk/emailDisclaimer
**********************************************************
*
* 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, October 2, 2011

[DMANET] ANALCO 2012, January 16th, Kyoto, Japan: DEADLINE EXTENSION Oct.10, 2011

This message is to announce the *extension of the deadline* of the
meeting "Analytic Combinatorics and Algorithmics" (ANALCO 2012).
Submission of papers will remain open
until *Monday October 10th, 5:00 PM EDT*.

The meeting "Analytic Algorithmics and Combinatorics" (ANALCO12) will
be held on January 16, 2012, at The Westin Miyako, Kyoto, Japan.
ANALCO is co-located with the ACM-SIAM Symposium on Discrete
Algorithms (SODA12), and will take place the day preceding that
conference. ANALCO is also co-located with Algorithm Engineering and
Experimentation (ALENEX12) and will take place on the same day. Since
researchers in both fields are approaching the problem of learning
detailed information about the performance of particular algorithms,
we expect that interesting synergies will develop.

http://www.siam.org/meetings/analco12/

The aim of ANALCO is to provide a forum for the presentation of
original research in the analysis of algorithms and associated
combinatorial structures. We invite both papers that study properties
of fundamental combinatorial structures that arise in practical
computational applications (such as permutations, trees, strings,
tries, and graphs) and papers that address the precise analysis of
algorithms for processing such structures, including: average-case
analysis; analysis of moments, extrema, and distributions;
probabilistic analysis of randomized algorithms, and so
on. Submissions that present significant new information about classic
algorithms are welcome, as are new analyses of new algorithms that
present unique analytic challenges. We also invite submissions that
address tools and techniques for the analysis of algorithms and
combinatorial structures, both mathematical and computational.


The scientific program will include invited talks, contributed
research papers, and ample time for discussion and debate of topics in
this area.

Registrants from ALENEX and ANALCO will be cross-registered with the
other. Proceedings of ALENEX and ANALCO will be available online in
January 2012.

Authors are invited to submit 10-page extended abstracts by 5:00 PM
EDT, on Monday, ---> October 10, 2011 <---,
to the ANALCO12 submission server

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

Papers should be submitted in the form of an extended abstract, which
begins with the title of the paper, each author's name, affiliation,
and e-mail address, followed by a clear statement of the problem
considered, a succinct summary of the results obtained, a brief
discussion of the significance and novelty of the research, and a
clear comparison with related work. The remainder of the extended
abstract should provide sufficient detail to allow the program
committee to evaluate the validity, quality, and relevance of the
contribution. Submissions, excluding title page, bibliography and
appendix, should not exceed 10 pages in 11 point font. Supplementary
material may be included in the appendix.

A paper that has been reviewed and accepted for presentation at SODA
is not eligible for submission to ANALCO. We recognize, however that
some research projects spawn multiple papers that elaborate on
different aspects of the work and are willing to respond to inquiries
about SODA, ALENEX, and ANALCO papers that may overlap. Papers of
interest to both the ALENEX and the ANALCO communities are
particularly encouraged. Such papers may be submitted to either
meeting and will, as appropriate, be presented in a joint session.

ANALCO is supported by SIAM (Society for Industrial and Applied Mathematics).


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

[DMANET] CfP 2nd Workshop on Bio-inspir​​ed Approaches to Advanced Computing and Communicat​​ions (deadline extension)

apologies if you receive multiple copies of this CfP

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

2nd Workshop on Bio-inspired Approaches to Advanced Computing and
Communications as part of Bionetics 2011

December 5th - 7th, 2011 - York, England

http://bioadcom.org

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

CALL FOR PAPERS

The rapid developments in networking and resource integration domains
have resulted in the emergence of distributed computing models such as
Web Services and Cloud computing for solving very complex problems.
However, biology has developed effective solutions to hard engineering
challenges through millions of years of evolution. Several algorithms
and techniques widely used in Computer Science have been adapted from,
or inspired by, known biological phenomena. Computer scientists
applying biomimetics can learn by observing nature and adopting
biological approaches in the aforementioned distributed computing
models. The focus of this special track is on identifying the role
that bio-inspired computing can play in the progress of computing and
communications systems, in highlighting productive areas of research
and in pinpointing precise application areas. Manuscripts unfolding
mathematical models, algorithms, protocols, tools, evaluation methods,
and experimental studies of advanced computing and communications
techniques that are inspired by and derived from biological systems
are solicited for this workshop. This special track seeks
high-quality, original and unpublished papers addressing topics
relevant to the issues raised above, including:


* Biological fault tolerance, self-healing systems
* Bio-inspired mathematical methods
* Machine learning
* Computational intelligence
* Collaborative self-organizing systems
* Knowledge Management
* Databases and data mining
* Dependable, reliable computing
* Autonomic computing and networks
* Adaptive network design
* Computer architecture
* Bio-inspired kinematics
* Self-organizing systems
* Cellular automata
* Computational optimization, operations research
* Distributed data analysis and modeling
* DNA computation
* Hybrid and ensemble methods
* Knowledge discovery
* Evolution and self-healing of network architectures and protocols
* High performance computing for bio-inspired algorithms and systems
* Immune and self-healing network defense and information security
* Information theory for biological systems
* Bio-inspired routing and P2P algorithms
* Evolutionary algorithms, genetic algorithms and programming
* Simulation of bio-inspired systems
* Network and communication algorithms and protocols
* Parallel and distributed techniques for bio-inspired algorithms
* Parallel and distributed techniques of swarm intelligence
* Quantum algorithms, quantum inspired approaches
* Routing, resource discovery, and scheduling in distributed systems
* Self-healing networks
* Bio-inspired communications protocols
* Sensor networks
* Self-organizing satellite networks
* Application case studies including computer immunology, space
systems, finance, navigation, fluid mechanics, telecommunications


IMPORTANT DATES

Paper submission deadline (all extended): October 17, 2011
Notification: November 2, 2011
Camera ready due: November 14, 2011
Conference: December 5th - 7th


PAPER SUBMISSION

Authors should submit their papers online at
http://edas.info/newPaper.php?c=11079 AND through
http://assyst-online.org (both).

All accepted papers will be published by Springer in the ICST-LNCS series.

Papers should be written to follow the LNICST guidelines. The author's
kit, which includes these guidelines and templates, can be downloaded
from the following link:
ftp://ftp.springer.de/pub/tex/latex/lnicst/author


 TPC

 Co-Chairs
Michael Alexander, Microsoft, Austria
Sabu M Thampi, IIITM-K, India

TPC Members
Andreas Riener, University of Linz, Austria
Antoine Bagula, University of Cape Town, New Zeland
Antonio Ruiz-Martinez, University of Murcia, Spain
Arati Baliga, AT&T Security Research Center, USA
Binod Vaidya, University of Ottawa, Canada
Christian Doerr, Delft University of Technology, The Netherlands
Danda Rawat, Eastern Kentucky University, USA
Daniel Thalmann EPFL, Switzerland Demin Wang, Microsoft, USA
Eugenia Bernardino, Polytechnic Institute of Leiria, Portugal
Francesco Quaglia, University of Rome "La Sapienza", Italy
Gabriella Sanniti di Baja, CNR, Italy Giuseppe Mastronardi,
Polytechnic of Bari, Italy
Gregorio Martinez Perez, University of Murcia, Spain
Hadi Otrok, Khalifa University of Science, Technology & Research, UAE
Jorge Sa Silva, University of Coimbra, Portugal
Jukka Nurminen, Aalto University, Finland
Jun Bi, Tsinghua University, P.R. China
Kyriakos ManousakisTelcordia Technologies, USA
Kyunghan Lee, North Carolina State University, USA Lisimachos Kondi,
University of Ioannina, Greece
Long Gao, Hitachi America Ltd, USA
Lukas Kencl, Czech Technical University in Prague, Czech Republic
Maode Ma Nanyang Technological University, Singapure
Marco Parvis, Politecnico di Torino, Italy
Marco Roccetti University of Bologna, Italy
Masahiro Okamoto, Kyushu University, Japan
Matthias W?ehlisch Freie Universitaet Berlin, Germany
Michele Nappi, University of Salerno, Italy
Michele Nogueira, Federal University of Parana, Brazil
Mirco Musolesi, University of St. Andrews, United Kingdom
Murata Masayuki, Osaka University, Japan
Namje Park, Jeju National University, Korea
Namunu Maddage, University of Melbourne, Australia
Nidhal Bouaynaya, University of Arkansas at Little Rock, USA
Nilanjan Banerjee, University of Arkansas, Fayetteville, USA Pascal
Lorenz, University of Haute Alsace,
France Phan Cong-Vinh, NTT University, Vietnam
Shiguo Lian, France Telecom R&D Beijing, China Sherif Rashad,
Morehead State University, USA
Stefano Ferretti, University of Bologna, Italy
Tatsuhiro Tsuchiya, Osaka University, Japan
Theus Hossmann, ETH Zurich, Switzerland
Vishal Singh, NEC Labs, USA
Yong Man Ro, KAIST, Korea


GENERAL INFORMATION

This workshop will be held as part of the 6th International ICST
Conference on Bio-Inspired Models of Network, Information, and
Computing Systems, York, England.
**********************************************************
*
* 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, September 30, 2011

Second International Conference on Algorithmic Decision Theory

*********************************************
Second International Conference on Algorithmic Decision Theory

October 26 - 28, 2011
DIMACS, Rutgers University

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

The final program for the Second International Conference on
Algorithmic Decision Theory is now posted at http://adt2011.org/.
We look forward to having a very interesting conference.