Tuesday, November 30, 2010

[DMANET] CFP: IEEE INFOCOM 2011 Workshop on Wireless Sensor, Actuator and Robot Networks (WiSARN)

------------------------------------------------------------------------
Call for Papers for the 3rd IEEE International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN 2011)
http://www.site.uottawa.ca/~xuli/WiSARN2011/

To be held in conjunction with the
The 30th IEEE International Conference on Computer Communications
(IEEE INFOCOM 2011)
April 10-15, 2011, Shanghai, China.

Wireless sensor and actor networks (WSAN) are the confluence point
where the traditional fields of wireless sensor networks (WSN),
robot networks and control theory meet. In WSAN, nodes collaborate
to accomplish distributed sensing and actuation tasks. Leveraged by
the control and mobility of actors, the networking process and
applications embrace a whole new set of possibilities. Actors may
deploy, repair and relocate sensors to improve coverage, build routes
and fix network partition to ensure data communication, change network
topology to shape routing patterns and balance energy consumption,
and respond to reported events in a timely and effective manner.
The benefits are limited only by imagination. As an emerging field,
WSAN are in need of new networking techniques, by which they can fully
exploit their particularities and potentials. WiSARN aims to bring
together state-of-the-art contributions on the design, specification
and implementation of architectures, algorithms and protocols for
current and future applications of WSAN.

Original, unpublished contributions are solicited in ALL aspects of
WSAN, WSN, robot networks, and robotics and automation. Possible topics
include, but are not limited to:
- Autonomous sensor networks
- Emergent behavior in WSAN
- Modeling and simulation of WSAN
- WSAN architectural and operational models
- Autonomic and self-organizing coordination and communication
- Sensor-actor (robot) and actor-actor coordination
- Energy-efficient and real-time communication protocols
- Bandwidth-efficient and delay-tolerant communication protocols
- Distributed control and management in WSAN
- Neighborhood discovery and mobility management
- Communication protocols for swarms of mobile actors (robots)
- Map exploration and pattern formation of mobile robots
- Actor (robot) task assignment
- Biologically inspired communication
- Ecological systems
- Architectures and topology control
- Localization in WSAN
- Probabilistic integration in WSAN
- Quality of service, security and robustness issues
- Applications and prototypes
- Hybrid networks and wireless Internet
- Data management, gathering, aggregation and query processing

Papers must not exceed 6 single-spaced and two-column pages using
at least 10 point size type on 8.5 x 11 inches pages, and must be
formated in strict accordance with the IEEE author guidelines.
Submissions are being considered with the understanding that they
describe original research, neither published nor under review
elsewhere. Accepted papers will be published in the IEEE Digital
Library after the conference and included in INFOCOM 2012 proceedings.
Selected best papers will be invited to a special issue of
Ad Hoc & Sensor Wireless Networks: an international journal (SCIE).


Important dates
Paper submission: Dec. 15, 2010
Author notification: Feb. 15, 2011
Camera ready: Mar. 15, 2011
Workshop date: Apr. 10, 2011

General Chair
Ivan Stojmenovic, University of Ottawa, Canada

Program Co-Chairs
Jiming Chen, Zhejiang University, China
Hannes Frey, Univerity of Paderburn, Germany
Xu Li, University of Ottawa, Canada

Submission Chair
Rafael Falcon, University of Ottawa, CA

Publicity Co-Chairs
Cailian Chen, Shanghai Jiaotong University, China
Mianxiong Dong, University of Aizu, Japan
Hangguan Shan, University of Waterloo, Canada


For further information, please refer to the above WiSARN 2011 website,
or contact the program co-chairs:
Dr. Jiming Chen at jmchen.zju@gmail.com
Dr. Hannes Frey at hannes.frey@uni-paderborn.de
Dr. Xu Li at easylix@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] Downey and Hirschfeldt: 'Algorithmic Randomness and Complexity'

BOOK ANNOUNCEMENT:

**********************************************************************
Rodney G. Downey and Denis R. Hirschfeldt: 'Algorithmic Randomness and
Complexity' (Springer, November 2010)

One of the most eagerly anticipated books for some years has finally been
published. It is the first book in the new CiE book series "Theory and
Applications of Computability". Please ensure your library orders this mammoth
work, a book destined to be a standard reference work in the field for many
years.

For ordering details see the Springer webpage:

http://www.springer.com/mathematics/numerical+and+computational+mathematics/book/978-0-387-95567-4

or Amazon:

http://www.amazon.com/Algorithmic-Randomness-Complexity-Applications-Computability/dp/0387955674

And for the Springer page for the series:

http://www.springer.com/series/8819

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

For a printable flyer for your notice board, giving information on the book
series see:

http://www.maths.leeds.ac.uk/cie/images/DH.flyer.pdf

There are further exciting book titles in the series on the way. And the
editors are looking for new proposals for books.

__________________________________________________________________________
ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk
CiE Conference Series http://www.illc.uva.nl/CiE
CiE 2011 http://cie2011.fmi.uni-sofia.bg
CiE 2012 http://www.cie2012.eu
CiE Membership Application Form http://www.cs.swan.ac.uk/acie
CiE on Twitter http://twitter.com/AssociationCiE
__________________________________________________________________________

**********************************************************
*
* 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] ICIAM 2011 e-Newsletter - November 2010

Dear friends,

There has been so much activity surrounding ICIAM 2011 (Vancouver, BC,
Canada from July 18 - 22, 2011) that it is difficult to know where to
start.

Most importantly, registration is now live
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=43&Itemid=48
> ! (www.iciam2011.com/goto/registration) Early bird rates
will be available until February 28, 2011 so register soon. We have also
negotiated excellent rates suitable for any budget at hotels and hostels
in Vancouver. For more information please visit
http://tinyurl.com/28vea4e.

All contributed minisymposia taking place at the Congress have been
confirmed. You can find the list on the ICIAM website
(http://tinyurl.com/25jdeux).

I would like to draw your attention to a number of travel subsidies
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=33&Itemid=35
> (http://tinyurl.com/3y29h5c) available to young US
researchers, Canadian mathematical sciences students and participants
from developing nations. We encourage you to review these subsidies to
investigate your eligibility. In addition, Canada does require visas or
permits from individuals from many countries and the turnaround times
vary. Please visit this page
<http://www.cic.gc.ca/english/visit/index.asp> (http://tinyurl.com/67uxjc)
on the Government of Canada website for complete information.

To compliment your time in Vancouver, we have worked with a local
company to create a series of excursions
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=44&Itemid=49
> (http://tinyurl.com/2ezw5dv) for ICIAM delegates between
July 16 and 23rd. These include trips to Whistler and Victoria, tours of
the city and surrounding mountains, kayaking outings, museums and float
plan adventures. Do not miss out on these amazing opportunities.

Don't forget that the deadline for abstract submissions for minisymposia
and contributed speakers is December 15, 2010!

Quick ICIAM 2011 links:

* List of invited speakers
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=12&Itemid=26
> (http://tinyurl.com/2ck224g) (including abstracts)

* List of thematic minisymposia
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=27&Itemid=29
> (http://tinyurl.com/2ez4zr7) (including abstracts) from
over 20 areas of applied & industrial mathematics

* Information on embedded & satellite meetings
<http://www.iciam2011.com/index.php?option=com_content&view=article&i
d=6&Itemid=4
> (http://tinyurl.com/23586jf)


For the latest ICIAM 2011 deadlines, announcements and reminders, sign
up for e-lerts
<http://www.iciam2011.com/index.php?option=com_wrapper&view=wrapper&I
temid=10
> (http://tinyurl.com/2d3cy7k) (or follow ICIAM 2011 on Twitter
@ICIAM2011. Don't forget to visit www.iciam2011.com.

I would like to close by expressing our sadness at the passing of Prof.
Jerrold Marsden, co-Chair of the Scientific Program Committee for ICIAM
2011 and a member of the Steering Committee, who lost his battle with
cancer on September 21, 2010. Jerry's influence and imprint will be
strongly felt in the structure and scientific content of the Congress
and his enthusiasm and knowledge will be deeply missed by his colleagues
at ICIAM 2011.

We look forward to seeing you in Vancouver!

Arvind Gupta

President, ICIAM 2011

CEO & Scientific Director, MITACS
**********************************************************
*
* 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] Ph.D. positions at MPI, Germany (deadline Dec 15)

*The International Max Planck Research School for Computer Science in
Saarbrücken*

The International Max Planck Research School for Computer Science
(IMPRS-CS) is a graduate school jointly run by the Max Planck
Institute for Informatics (MPI-INF), the Max Planck Institute for
Software Systems (MPI-SWS), and the Computer Science Department at
Saarland University.
MPI-INF and MPI-SWS are among 80 institutes (MPIs) of the Max Planck
Society. The MPIs are Germany's prime research facilities with
world-class, foundational research in the fields of medicine, biology,
chemistry, physics, technology, and the humanities. Since 1948, MPI
researchers have won 17 Nobel prizes, which testifies to the quality and
innovation of MPI research programs.

The IMPRS-CS (International Max Planck Research School for Computer
Science) offers a PhD program upon successful completion of which
students receive a Doctorate Degree in Computer Science from Saarland
University. The PhD program is supplemented by a Master's program for
students entering the school with a Bachelor's degree.

During the two to three years period of the PhD program, the
candidates carry out their scientific research within the two
participating MPIs or in one of the research groups of the Computer
Science faculty members at Saarland University.

The Master's program comprises a 1.5-year (three semesters) teaching
program with lectures and seminars. This serves as preparation and
qualification for the PhD program. The Master's program includes a
thesis project and is completed with a Master of Computer Science degree.

The IMPRS-CS awards the students financial support in the form of a
scholarship for their participation in the Master's and PhD programs.

*PhD scholarships:*
Any student with an excellent Master's or Diploma Degree in Computer
Science or Computer Engineering may apply for our PhD program.

*Master's scholarships:*
Any student with a Bachelor's degree in Computer Science or Computer
Engineering is eligible to apply for our Master's program.

The IMPRS-CS holds a funding agreement with Microsoft Research
Cambridge (MSRC), which contributes 15 PhD fellowships in research
areas related to MSRC. Recipients of these fellowships have the
opportunity for internships at MSRC and other collaboration with a
world-leading industrial research lab.

Further information, including instructions on how to apply and the
respective application deadlines, can be found at:

http://www.imprs-cs.de
http://www.mpi-inf.mpg.de
http://www.mpi-sws.mpg.de
http://www.cs-uni-saarland.de

You are also welcome to contact imprs@mpi-sb.mpg.de for more information.

Kindly forward this information to interested students and colleagues at
your university or research institute in your home country.

*We are looking forward to your applications!*

Gerhard Weikum and Jennifer Gerling
(Spokesperson and Coordinator of the IMPRS-CS)

**********************************************************
*
* 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 in algorithms and complexity at MPI, Germany

M A X P L A N C K I N S T I T U T E
for
I N F O R M A T I C S

Seeks several

POSTDOCS

For the Algorithms and Complexity Department

directed by Kurt Mehlhorn

We are looking for applicants from all areas of algorithmics, including
related areas like computer algebra, complexity theory and discrete
mathematics. We are also explicitly looking for people interested in
algorithm engineering and the design and implementation of algorithm
libraries.

The Max-Planck-Institute for Computer Science is located on the campus
of the Universitaet des Saarlandes in Saarbruecken, Germany. Currently,
around 40 researchers from several nationalities work in the Algorithms
and Complexity Department. Our working language is English. The group
collaborates with several of the major research institutions in Europe
and the U.S. and has high international visibility. There is generous
travel support available for all group members. Postdoctoral
fellowships are available for one or two years. Stipends are 2.300 Euro
per month, taxfree. Other conditions are possible in some special cases,
subject to case-by-case review.

Applications from disabled applicants are appreciated. Our institute
supports the principle of equal opportunity for men and women, and is
therefore interested in applications from women.

Applications (including curriculum vitae, list of publications, a
research plan (1 page is enough), names of references with their e-mail
addresses, intended period of stay, and your two most "interesting"
papers (preferably just URLs)) must be sent by email in PDF format to
Christina Fries (chfries@mpi-inf.mpg.de) by January 30, 2011. In
addition, written applications may be sent to

Kurt Mehlhorn
Max-Planck-Institut für Informatik
Campus E1 4
D-66123 Saarbrücken
Germany

For further information, also on other offers, please refer to
http://www.mpi-inf.mpg.de/departments/ag1/offers.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] PhD Student Positions at ETH Zurich, Switzerland

We are looking for PhD students in Distributed Algorithms. Details can be
found here:
http://internet5.refline.ch/845721/1284/++publications++/1/index.html

Best regards,

Roger Wattenhofer


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

[DMANET] PhD scholarships available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities offers

several SCHOLARSHIPs

for Ph.D. Studies starting January 15th, 2011 or later.

The scholarships are 1350 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 2011
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, deputy 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/~skutella/
Tel.: +49 - 30 - 314-78654 / -28641
Fax: +49 - 30 - 314-25191

Please send your application before December 31st, 2010.
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/
*
**********************************************************
**********************************************************
*
* 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, November 29, 2010

[DMANET] last call for submissions

Dear Colleague

The deadline for submissions to the 12th Annual Congress of the French
Operations Research and Decision Aid Society (ROADEF) is approaching
http://roadef2011.emse.fr/index.en.php

for regular submissions: November 30, 2010
for submissions to invited sessions: December 8, 2010

Note that we have already more than 350 submissions and the following
Keynote speakers:

Pr Goerge Nemhauser
http://www2.isye.gatech.edu/~gnemhaus/

Pr Roman Slowinski
http://idss.cs.put.poznan.pl/site/rslowinski.html

Pr David Simchi-Levi
http://cee.mit.edu/simchi-levi

Pr Dominique de Werra
http://personnes.epfl.ch/dominique.dewerra

The official languages of congress are: French and English

Do not hesitate to submit your contributions (abstract of 2 pages maximum)
via the site:
https://www.easychair.org/account/signin.cgi?timeout=1;conf=roadef2011
http://roadef2011.emse.fr/soumission.en.php

Best regards
Alexandre Dolgui
Xavier Delorme
Organizing Committee Co-Chairs


____________________________________________________________________

Alexandre Dolgui, Dr.Hab., Ph.D.
Professor
Director of the Centre for Industrial Engineering and Computer Science
Ecole des Mines de Saint-Etienne
/National Institute of Science and Technology@Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

Annual Meeting of the French Operational Research Society ROADEF 2011
http://roadef2011.emse.fr/index.en.php

Deadline for submissions (abstract, 2 pages): November 16, 2010
_____________________________________________________________________
**********************************************************
*
* 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, November 28, 2010

[DMANET] CSR 2011 Call for Papers Deadline Approaching -- December 06

Dear Colleagues,

Just a quick reminder that the deadline for the
6th International Computer Science Symposium in Russia (CSR 2011)
is next Monday (December 06).

Web: http://logic.pdmi.ras.ru/csr2011/
Email: csr2011@logic.pdmi.ras.ru
Paper submission: http://www.easychair.org/conferences/?conf=csr2011

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

Saturday, November 27, 2010

[DMANET] 16th Estonian Winter School in Computer Science, Call for Partic.

[Lecturers: Boyen, Gore, Hofmann, Jacobs, Sadeghi.
Place/time: Palmse, Estonia, 27 Feb-4 March 2011.
Deadline for application and submission of abstracts for student
talks: ** 14 Jan 2011 **.]


CALL for PARTICIPATION

16th Estonian Winter School in Computer Science, EWSCS '11

Palmse, Estonia, 27 Feb-4 March 2011

http://cs.ioc.ee/ewscs/2011/


BACKGROUND AND OBJECTIVES

EWSCS is a series of regional-scope international winter schools held
annually in Estonia. EWSCS are organized by Institute of Cybernetics,
a research institute of Tallinn University of Technology.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordic
graduate students in computer science (but also interested students
from elsewhere) to frontline research topics usually not covered
within the regular curricula. The working language of the schools is
English.

EWSCS '11 is the sixteenth event of the series.


PROGRAMME

The schools' scientific programme consists of short courses by
renowned specialists and a student session.

Courses of EWSCS '11

* Xavier Boyen (Universite de Liege, Belgium):
Lattice-based cryptology

* Rajeev Gore (Australian National University, Canberra, Australia):
Automated reasoning in modal, tense and temporal logics

* Martin Hofmann (Ludwig-Maximilians-Universitaet Muenchen, Germany):
Amortized resource analysis

* Bart Jacobs (Radboud Universiteit Nijmegen, The Netherlands):
Introduction to coalgebra

* Ahmad-Reza Sadeghi (Technische Universitaet Darmstadt and
Fraunhofer-Institut f�r Sichere Informationstechnologie, Germany):
Trusted and trustworthy computing: are we ready for clouds?

The purpose of the student session is to give students an opportunity
to present their work (typically, thesis work) and get
feedback. Registrants are invited to propose short talks (20 min) on
topics of theoretical computer science, broadly understood. The
selection will be based on abstracts of 150-400 words.

The social programme consists of an excursion and a conference dinner.


VENUE

Palmse is a small settlement 80 kms to the east from Tallinn in the
county of Laeaene-Viru. It is renowned for a large manor that
used to belong to the von Pahlen family, today hosting the visitors'
center of the Lahemaa National Park, a museum, and a hotel.

Tallinn, Estonia's capital, is famous for its picturesque medieval Old
Town, a UNESCO World Heritage site. In 2011, Tallinn, along with Turku
in Finland, is the cultural capital of Europe. There are direct
flights to Tallinn Lennart Meri airport from Amsterdam, Brussels,
Copenhagen, Dublin, Duesseldorf Weeze, Edinburgh, Frankfurt,
Gothenburg, Helsinki, Kiev, London Gatwick, Luton and Stansted, Milan
Bergamo and Malpensa, Moscow, Munich, Oslo Gardermoen and Rygge,
Prague, Riga, Stockholm Arlanda and Skavsta, St Petersburg, Warsaw and
Vilnius, ferries from Stockholm and Helsinki. From Vilnius, Riga, St
Petersburg the Lux Express coach services are the practical travel
option.


APPLICATION AND COST

The deadline for application and submission of student talk abstracts
is 14 January 2011. All applicants will be notified of admission to
the school and acceptance of their talks by 28 January 2011.

Admitted applicants are entitled and expected to attend the courses
and student session of the school. They will also receive a binder
with the course material and access to additional materials on the
school website.

The participation fee is 320 EUR and includes full board accommodation
at Palmse, transportation from Tallinn to Palmse, the excursion and
conference dinner (by contributing towards the associated expense).

We may be able to reduce the fee for a small number of participants.
To apply for fee reduction, please fill in the online fee reduction
request form.


PROGRAMME COMMITTEE / ORGANISING COMMITTEE

* Tarmo Uustalu (Institute of Cybernetics) (chair)
* Monika Perkmann (Institute of Cybernetics) (secretary)
* Helger Lipmaa (Cybernetica AS)
* Peeter Laud (Cybernetica AS)
* Varmo Vene (University of Tartu)
* Sven Laur (University of Tartu)


SPONSORS

* Tiger University Plus programme
of the Estonian Information Technology Foundation
* Estonian Centre of Excellence in Computer Science, EXCS,
funded by the European Regional Development Fund


FURTHER INFORMATION

Details on the application procedure and cost, submission of student
talk abstrats are available from the school webpage,
http://cs.ioc.ee/ewscs/2011/. Questions should be sent to
ewscs11(at)cs.ioc.ee.

Thursday, November 25, 2010

[DMANET] Professorship (W3) in Hamburg (TUHH) (apologies for bad link in earlier post)

The Technical University of Hamburg-Harburg is expanding its maths section and has created three new chairs, one of them in Discrete Mathematics:

http://www.tu-harburg.de/tuhh/aktuelles/stellenausschreibungen/p-10-07.html

I have been assured that they are looking for the strongest candidate, regardless of field. In particular, the attribute "computer-oriented" included in the advertisement should not discourage otherwise strong candidates who feel they might fall short of this expectation.

While the Technical University is not the same as the University of Hamburg, the graph theory group at the University of Hamburg hopes that the successful candidate will be able and willing to foster close links between the two.

For candidates whose native language is not German it may be possible to negotiate conditions that will allow them to delay the point in time from which they are expected to teach in German.

Reinhard Diestel

**********************************************************
*
* 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, November 24, 2010

[DMANET] Professorship (W3) in Hamburg (TUHH)

The Technical University of Hamburg-Harburg is expanding its maths
section and has created three new chairs, one of them in Discrete
Mathematics:

http://www.math.uni-hamburg.de/home/diestel/papers/others/extInfGT.pdf

I have been assured that they are looking for the strongest candidate,
regardless of field. In particular, the attribute "computer-oriented"
included in the advertisement should not discourage otherwise strong
candidates who feel they might fall short of this expectation.

While the Technical University is not the same as the University of
Hamburg, the graph theory group at the University of Hamburg hopes that
the successful candidate will be able and willing to foster close links
between the two.

For candidates whose native language is not German it may be possible to
negotiate conditions that will allow them to delay the point in time
from which they are expected to teach in German.

Reinhard Diestel

**********************************************************
*
* 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] BOOK ANNOUNCEMENT: Exact Exponential Algorithms

Exact Exponential Algorithms
by Fedor V. Fomin and Dieter Kratsch

Springer, 2010, 204 p.

http://dx.doi.org/10.1007/978-3-642-16533-7

Description:

Today most computer scientists believe that NP-hard problems cannot be
solved by polynomial-time algorithms. From the polynomial-time
perspective, all NP-complete problems are equivalent but their
exponential-time properties vary widely. Why do some NP-hard problems
appear to be easier than others? Are there algorithmic techniques for
solving hard problems that are significantly faster than the
exhaustive, brute-force methods? The algorithms that address these
questions are known as exact exponential algorithms.

The history of exact exponential algorithms for NP-hard problems dates
back to the 1960s. The two classical examples are Bellman, Held and
Karp's dynamic programming algorithm for the traveling salesman
problem and Ryser's inclusion–exclusion formula for the permanent of a
matrix. The design and analysis of exact algorithms leads to a better
understanding of hard problems and initiates interesting new
combinatorial and algorithmic challenges. The last decade has
witnessed a rapid development of the area, with many new algorithmic
techniques discovered. This has transformed exact algorithms into a
very active research field. This book provides an introduction to the
area and explains the most common algorithmic techniques, and the text
is supported throughout with exercises and detailed notes for further
reading.

The book is intended for advanced students and researchers in computer
science, operations research, optimization and combinatorics.

Fedor Fomin
http://www.ii.uib.no/~fomin/
**********************************************************
*
* 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] ICDCN 2011 - 6 days left before early registration closes

Our apologies if you receive multiple copies.

CALL FOR PARTICIPATION
12TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING & NETWORKING
(ICDCN 2011)
January 2 . 5, 2011, Bangalore, India
Early Registration: November 30, 2010 (EST, USA).
http://www.icdcn.org

We cordially invite you to look at the summary information below
about the highlights on tutorials and keynotes (the technical program is
available at the URL: http://www.icdcn.org) and to join us at the
Conference in wonderful Bangalore in January 2011 (note that early
registration deadline is upcoming: November 30, 2010).

Organized by Infosys Technologies, Bangalore, and IIIT-Bangalore, the
12th International Conference on Distributed Computing and Networking
(ICDCN 2011) will be held in Bangalore, India, during January 2-5, 2011.
Over the years, ICDCN has become a leading forum for disseminating the
latest research results in distributed computing and networking.
The conference will have a full day of 4 tutorials and 3 workshops
on January 2, followed by the main conference on January 3-5.
The main conference will have an industry track consisting of
well-renowned
invited speakers from industry and a panel discussion. Here are the
highlights:

Tutorial #1: The GPGPU Phenomenon: Understanding its Scope, Applicability,

and its Limitations
Tutorial #2: Cognitive Radio Networks and Dynamic Spectrum Access

Tutorial #3: Localized Algorithms and Their Applications in Ad Hoc
Wireless and Sensor Networks
Tutorial #4: Reasoning with MAD Distributed Systems

Workshop #1: IWNMA 2011: International Workshop on Network Modeling
and Analysis
Workshop #2: SIPS 2011: Workshop on Smart Infrastructure as Cyber-Physical

Systems
Workshop #3: SESA 2011: Workshop on Sensor Enabled Situational Awareness.

This year.s conference will be inaugurated by Kris Gopalakrishnan,
Chief Executive Officer and Managing Director, Infosys Technologies.
The keynote speakers are:

- Prof. Hagit Attiya, Technion, Department of Computer Science, Israel
Institute of Technology

- Prof. Jon Crowcroft, Marconi Professor of Networked Systems in the
Computer Laboratory, the University of Cambridge

- Dr. Chandrakant Patel, HP Fellow and Director of the Sustainable
Information Technology Laboratory at Hewlett Packard Laboratories

- Dr. Dipankar Raychaudhuri, Professor-II, Electrical & Computer
Engineering and Director, WINLAB (Wireless Information Network Lab)
at Rutgers University.

Further details are available at: http://www.icdcn.org

Early Registration: November 30, 2010 (EST, USA).
Registration fee covers all tutorials and workshops and main conference.
We look forward to seeing you in Bangalore.


Steering Com. Co-Chairs
Sukumar Ghosh University of Iowa, USA
Sajal K. Das UTA & NSF, USA

General Co-Chairs
Sanjoy Paul Infosys Technologies, India
Lorenzo Alvisi U. Texas at Austin, USA

Program Co-Chairs
Marcos Aguilera Microsoft Research, USA
Haifeng Yu National U. Singapore
Vikram Srinivasan Alcatel Lucent, India
Nitin Vaidya U. Illinois at Urbana-Champaign, USA
Romit Roy Choudhury Duke University, USA

Keynote Co-Chairs
Sajal K. Das UTA & NSF, USA
Prasad Jayanti Dartmouth College, USA

Tutorial Co-Chairs
Vijay Garg U. Texas at Austin, USA
Samir Das Stony Brook University, USA

Workshop Co-Chairs
Krishna Kant Intel and NSF, USA
Jiannong Cao, Hong Kong Poly. U., Hong Kong

Ph.D Forum Co-Chairs
Mainak Chatterjee, University of Central Florida, USA
Sriram Pemmaraju, University of Iowa, Iowa City, USA

Industry Chair
Ajay Bakre NetApp, India

Finance Chair
Santonu Sarkar Infosys Technologies, India

Local Arrangements
Srinivas Padmanabhuni
Amitabha Das Infosys Technologies, India
Debabrata Das IIIT, India
**********************************************************
*
* 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, November 23, 2010

[DMANET] TAMC 2011 Second Call for Papers

SECOND CALL FOR PAPERS

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

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

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

AIM AND SCOPE

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

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

SUBMISSION GUIDELINE

Submission is through EasyChair:

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

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

PROCEEDINGS

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

JOURNAL SPECIAL ISSUES

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

PLENARY SPEAKERS

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

PROGRAM COMMITTEE

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

STEERING COMMITTEE

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

IMPORTANT DATES

Submission Deadline Jan. 10, '11
Notification of Acceptance Feb. 18, '11
Final Version Due Mar. 7, '11
Early Registration Deadline Mar. 28, '11

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

[DMANET] re-launch of the Internet Mathematics journal

Dear colleagues,

We would like to draw your attention to the re-launch of the Internet
Mathematics journal, the leading reference for fast-breaking research in
the field of complex networks.

In the renewed journal, the scope is broadening:
-- high-quality papers from all areas of complex networks will be
accepted, such as those on the web graph, Internet graph, online social
networks, wireless networks, and biological networks.
-- In addition to more mathematically oriented papers, the journal will
accept experimental and empirical works reporting on important new
discoveries.

Internet Mathematics is a highly cited journal known for outstanding
quality of the board and efficient peer-review process.

Please find the open letter of Anthony Bonato and Fan Chung Graham,
Editors-in-Chief (link below)

http://www.internetmathematics.org/letter.htm


We are looking forward to your contributions!


Kind regards, Nelly Litvak (managing editor)

________________________________________________

Nelly Litvak, Dep. Appl. Math., Faculty of EEMCS University of Twente
P.O. Box 217, 7500 AE Enschede The Netherlands

Tel: +31(53)4893388 Fax: +31(53)4893069
**********************************************************
*
* 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] Research fellowship in Graph Theory

UNIVERSITY OF BIRMINGHAM
School of Mathematics
College of Engineering and Physical Sciences

Research fellow in Graph Theory.

Starting salary 27,319 a year, in a range up to 35,646 a year, with potential
progression to 37,839 a year.

Post is available for a period of up to 3 years from 1st March 2011 or later by
mutual agreement.

The University invites applications for a Research fellow to work with Dr
Daniela Kuhn on an ERC-funded project in Extremal and Probabilistic Graph
Theory.

Applicants will be expected to hold a first degree in an area of Mathematics
and normally hold a PhD degree in Combinatorics or equivalent qualifications.
Applicants should also possess a proven research track record in Graph Theory.

Informal enquiries about this position may be made to Dr Daniela Kuhn
(kuehn@maths.bham.ac.uk, http://web.mat.bham.ac.uk/D.Kuehn/)

Further information about the School of Mathematics is available on
http://www.mat.bham.ac.uk

Please quote ref: 43624 Closing date: 14th January 2011

To download the details and submit an electronic application online visit:
www.hr.bham.ac.uk/jobs

Valuing excellence; sustaining investment


**********************************************************
*
* 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] The Second Nordic Workshop on, System and Network Optimization for Wireless (SNOW)

=========================================================
Our apologies if you receive multiple copies of this CFP
=========================================================

The Second Nordic Workshop on
System and Network Optimization for Wireless:
-----------------------------------------------
SNOW
-----------------------------------------------
24-26 March 2011, Sälen, Sweden
-----------------------------------------------
webpage: http://snow.itn.liu.se

Call for submission of abstracts

Important Dates:
------------------------------------------------
Abstract Submission: Jan. 5, 2011
Acceptance Notification: Jan. 12, 2011
Registration Deadline: Jan. 25, 2011
------------------------------------------------
Workshop Dates: Mar. 24-26, 2011
================================================

The Second Nordic Workshop on System and Network Optimization for
Wireless (SNOW) aims at bringing together Researchers and Students from
the Academia working in wireless networking, primarily in the Nordic
region.
This year, the Nordic SNOW Workshop aims to have a special focus on
broadband cellular access (HSPA, LTE/LTE-A, etc) and emerging wireless
networking paradigms such as collaborative and heterogeneous networking.
We further welcome presentations within a broad range of wireless
networking cross-layer optimization, from fundamental communication
performance analysis to considerations for multimedia QoS.
Our goal is to have a single track meeting with lively scientific
discussions and exchange of views, and to accommodate a wide variety of
backgrounds and research attitudes. The program will be organized in
such a way to promote networking activities between the participants,
including daily social outdoors activities like skiing.

We therefore invite for review submissions of up to 1-page abstracts of
technical presentations targeting, but not limited to the following topics:
- Asymptotic system properties (capacity, connectivity, coverage, delay)
- Cellular systems, 3G/4G, LTE-advanced, WMAN, WRAN, and other emerging
broadband wireless networks
- Inter-networking and integration of wireless heterogeneous and
multi-tier networks
- Performance engineering in HSPA, WLAN, MESH, LTE, and other cellular
or multitier technologies
- Wireless network planning, capacity analysis, and topology control
- Cognitive Radios and cooperative/opportunistic communications
- Self-organizing wireless networks
- Game theoretic models, pricing and incentives
- Resource management, mobility management, and admission control
- Energy efficiency and green communications
- Delay tolerant wireless networks
- Scalability and manageability of network architectures
- Automated planning and resource allocation in 3G HSPA (and beyond)
networks

Abstracts must be submitted electronically through the Nordic SNOW
workshop web page: http://snow.itn.liu.se/AbstractSubSnow.html

The workshop keynote presentations will be soon announced on the
workshop web page.

Organizing committee:
---------------------

-General co-chairs:
Di Yuan, Linköping University, Sweden
Matti Latva-aho, CWC-University of Oulu, Finland

-Advisory board:
Anthony Ephremides, University of Maryland, USA
Ryuji Kohno, Yokohama National University, Japan
Behnaam Aazhang, Rice University, USA

-Technical program committee:
co-chair: Lars K. Rasmussen, KTH, Sweden
co-chair: Marian Codrenu, CWC-University of Oulu, Finland
Raffaele Bruno, IIT - CNR, Italy
Azadeh Faridi, Pompeu Fabra, Barcelona, Spain
Carlo Fischione, KTH, Sweden
Bernard Fleury, Aalborg University, Denmark
Viktoria Fodor, KTH, Sweden
Scott Fowler, Linköping University, Sweden
Markku Juntti, CWC-University of Oulu, Finland
Kimmo Kansanen, NTNU, Trondheim, Norway
Eleutherios Karipidis, Linköping University, Sweden
Visa Koivunen, Helsinki University of Technology, Finland
Lavy Libman, University of Sydney, Australia
Tobias Oechtering, KTH, Sweden
Anna Pantelidou, CWC, University of Oulu, Finland
Michal Pioro, Lund University, Sweden
Carlos Pomalaza-Ráez, Purdue University, USA
Joyce Wu, Ranplan, UK
Iana Siomina, Ericsson research, Sweden
Tommy Svensson, Chalmers University of Technology, Sweden
Ragnar Thobaben, KTH, Sweden
Apostolos Traganitis, FORTH and University of Crete, Greece
Elisabeth Uhlemann, Halmstad University, Sweden
Jie Zhang, Sheffield University, UK
Michele Zorzi, University of Padova, Italy

-Local arrangements:
Vangelis Angelakis, Linköping University, Sweden

Registration and Costs:
-----------------------
Registration of accepted presenters and workshop attendants will be done
online through the workshop webpage. No registration fee will be
charged. Participants will have to support their own lodging and
transportation costs.

Venue and transportation:
-------------------------
The 2nd Nordic SNOW workshop will take place at the Swedish ski resort
of Stöten in Sälen. Stöten has direct access to 27 individual slopes,
served by 15 ski lifts and provides snow guarantee up to the last week
of April: http://www.stoten.se/

A limited number of single and double rooms have been block booked (in a
package of 4 nights from 23 to 27 of March) at the Stöten Hotel and at
2- bedroom apartments in Stöten Mitt.
We strongly urge the participants to prefer the apartments in line with
the networking spirit of the workshop.
-- For details visit: http://snow.itn.liu.se

Travel information
------------------
Stöten is mainly reachable through the town of Mora in Sälen.
From Mora, there is a 1.5 hrs drive by bus, or car rental. We shall
arrange to have 2 busses at two fixed times (to be announced) from Mora
on Wednesday March 23rd.
* Flying to Mora:
Operated by Nextjet: http://www.nextjet.se/
On Wednesday 23 March there are two direct flights from Stockholm's
Arlanda Airport (ARN) to Mora (MXX).
* By Train to Mora:
Operated by SJ: http://www.sj.se
There are train departures to Mora from the Stockholm central train
station every 45', with a trip duration ranging approximately 3:30 – 4 hrs.

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

[DMANET] PhD Position in Combinatorial Algorithms

The Information Theory research group at Aalto University,
Helsinki, Finland, led by Professor Patric Ostergard
(http://users.tkk.fi/u/pat/), has an open

PhD Position in Combinatorial Algorithms

The Information Theory group at Aalto University does research on a wide
variety of topics within discrete mathematics, including coding theory,
combinatorial algorithms, and design theory. In particular, studies on
classification of basic combinatorial structures have been pursued
(P. Kaski & P.R.J. Ostergard, Classification Algorithms
for Codes and Designs, Springer, Berlin, 2006). Members of the
research group have twice---in 2005 and 2009---been awarded the prize for
the best dissertation of the year at the university.

The main topic of the research work within the open position will be
algorithms for various combinatorial packing, covering, and tiling
problems. The applicant should have an excellent
Master's degree in mathematics or computer science, excellent
programming skills (C), and documented knowledge (and perhaps even
some research, but this is not necessary) in some of the fields
listed above, or in discrete mathematics and algorithms more generally.

The position will be filled for the period 1.2.2011 (or later)--31.12.2013.
The position is fully paid, with a starting salary of 2000--2600 EUR per
month before taxes. Minor participation in teaching duties is assumed.

Any inquiries should be sent by email to patric.ostergard@tkk.fi
The application with

-a CV and (if applicable) a list of publications,
-copies of relevant study transcripts and diplomas,
-one or two letters of reference, and
-a short English text as well as a C program written
by the applicant

should be sent by regular mail---as soon as possible,
but no later than December 31, 2010---to

Prof. Patric Ostergard
Dept. of Communications and Networking
Aalto University
P.O. Box 13000
00076 Aalto
Finland

---

Patric Ostergard
Professor

Dept. of Communications and Networking
Aalto University
P.O. Box 13000, 00076 Aalto, FINLAND
Tel: +358 9 4702 2341
Fax: +358 9 4702 2474
Email: patric.ostergard@tkk.fi
**********************************************************
*
* 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, November 22, 2010

[DMANET] [Submission Opened] CFP WiSARN 2011 in conjunction with IEEE INFOCOM 2011

[Our sincere apologies if you receive multiple copies of this announcement.]

------------------------------------------------------------------------
Call for Papers for the 3rd IEEE International Workshop on
Wireless Sensor, Actuator and Robot Networks (WiSARN 2011)
http://www.site.uottawa.ca/~xuli/WiSARN2011/

To be held in conjunction with the
The 30th IEEE International Conference on Computer Communications
(IEEE INFOCOM 2011)
April 10-15, 2011, Shanghai, China.

Wireless sensor and actor networks (WSAN) are the confluence point
where the traditional fields of wireless sensor networks (WSN),
robot networks and control theory meet. In WSAN, nodes collaborate
to accomplish distributed sensing and actuation tasks. Leveraged by
the control and mobility of actors, the networking process and
applications embrace a whole new set of possibilities. Actors may
deploy, repair and relocate sensors to improve coverage, build routes
and fix network partition to ensure data communication, change network
topology to shape routing patterns and balance energy consumption,
and respond to reported events in a timely and effective manner.
The benefits are limited only by imagination. As an emerging field,
WSAN are in need of new networking techniques, by which they can fully
exploit their particularities and potentials. WiSARN aims to bring
together state-of-the-art contributions on the design, specification
and implementation of architectures, algorithms and protocols for
current and future applications of WSAN.

Original, unpublished contributions are solicited in ALL aspects of
WSAN, WSN, robot networks, and robotics and automation. Possible topics
include, but are not limited to:
* Autonomous sensor networks
* Emergent behavior in WSAN
* Modeling and simulation of WSAN
* WSAN architectural and operational models
* Autonomic and self-organizing coordination and communication
* Sensor-actor (robot) and actor-actor coordination
* Energy-efficient and real-time communication protocols
* Bandwidth-efficient and delay-tolerant communication protocols
* Distributed control and management in WSAN
* Neighborhood discovery and mobility management
* Communication protocols for swarms of mobile actors (robots)
* Map exploration and pattern formation of mobile robots
* Actor (robot) task assignment
* Biologically inspired communication
* Ecological systems
* Architectures and topology control
* Localization in WSAN
* Probabilistic integration in WSAN
* Quality of service, security and robustness issues
* Applications and prototypes
* Hybrid networks and wireless Internet
* Data management, gathering, aggregation and query processing

Papers must not exceed 6 single-spaced and two-column pages using
at least 10 point size type on 8.5 x 11 inches pages, and must be
formated in strict accordance with the IEEE author guidelines.
Submissions are being considered with the understanding that they
describe original research, neither published nor under review
elsewhere. Accepted papers will be published in the IEEE Digital
Library after the conference and included in INFOCOM 2012 proceedings.
Selected best papers will be invited to a special issue of
Ad Hoc & Sensor Wireless Networks: an international journal (SCIE).


Important dates
Paper submission: Dec. 15, 2010
Author notification: Feb. 15, 2011
Camera ready: Mar. 15, 2011
Workshop date: Apr. 10, 2011

General Chair
Ivan Stojmenovic, University of Ottawa, Canada

Program Co-Chairs
Jiming Chen, Zhejiang University, China
Hannes Frey, Univerity of Paderburn, Germany
Xu Li, University of Ottawa, Canada

Submission Chair
Rafael Falcon, University of Ottawa, CA

Publicity Co-Chairs
Cailian Chen, Shanghai Jiaotong University, China
Mianxiong Dong, University of Aizu, Japan
Hangguan Shan, University of Waterloo, Canada


For further information, please refer to the above WiSARN 2011 website,
or contact the program co-chairs:
Dr. Jiming Chen at jmchen.zju@gmail.com
Dr. Hannes Frey at hannes.frey@uni-paderborn.de
Dr. Xu Li at easylix@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] CFP: Special issue of International Journal of Swarm Intelligence Research

********************* CALL FOR PAPERS *********************

SUBMISSION DUE DATE: February 15, 2011

SPECIAL ISSUE ON: Scatter Search and Path Relinking Methods

International Journal of Swarm Intelligence Research (IJSIR)

Guest Editor: Mahamed G. H. Omran


INTRODUCTION:

Scatter search (SS) is an evolutionary, population-based approach that has
been proposed in the late 1970s. SS combines diversification and
intensification methods to find good solutions for difficult optimization
problems. Path relinking (PR) is a generalized form of SS where paths are
generated between and beyond good solutions in neighborhood space, rather
than in Euclidean space. SS and PR have been successfully applied to a wide
range of optimization problems (e.g. single and multi-objective routing,
scheduling, nonlinear optimization, optimization in graphs, neural network
training, simulation optimization, unconstrained function optimization, etc.).

One difference between SS/PR and other evolutionary and swarm-based
approaches is that SS and PR place greater emphasis on strategic designs to
combine solutions in contrast to the strong emphasis on randomization in other
methods. Another difference is the focus on incorporating adaptive memory
strategies, which derives from the SS/PR association with tabu search. These
differences have resulted in producing proposals that are useful for
exploiting structure and for equipping a method to learn from the search
history.


OBJECTIVE OF THE SPECIAL ISSUE:

The main goals of this special issue are to familiarize the swarm
intelligence community with the concepts of SS and PR and to allow researchers
to consider ways that SS and PR may provide useful contributions to the swarm
perspective.


RECOMMENDED TOPICS:
Topics to be discussed in this special issue include (but are not limited
to) the following:

- Using concepts from SS and PR within a swarm-based method
(e.g. PSO, ACO, etc.)
- Using concepts from swarm-based approaches in SS/PR methods.
- Comparing the performance of SS/PR and swarm-based methods when
applied to some optimization problems.
- Real-world, complex or novel applications of SS and PR.
- Proposing new SS/PR variants.
- Developing swarm-based approaches that utilize strategic designs
in place of randomization


SUBMISSION PROCEDURE:
Researchers and practitioners are invited to submit papers for this
special theme issue on scatter search and path relinking methods on or
before November 15, 2010. All submissions must be original and may not be
under review by another publication. INTERESTED AUTHORS SHOULD CONSULT
THE JOURNAL'S GUIDELINES FOR MANUSCRIPT SUBMISSIONS at
http://www.igi-global.com/development/author_info/guidelines submission.pdf.
All submitted papers will be reviewed on a double-blind, peer review basis.
Papers must follow APA style for reference citations.


ABOUT International Journal of Swarm Intelligence Research (IJSIR):
The mission of the IJSIR is to become a leading international and well-
referred journal in swarm intelligence, nature-inspired optimization
algorithms, and their applications. This journal publishes original and
previously unpublished articles including research papers, survey papers,
and application papers, to serve as a platform for facilitating and enhancing
the information shared among researchers in swarm intelligence research areas
ranging from algorithm developments to real-world applications

This journal is an official publication of the Information Resources
Management Association
www.igi-global.com/IJSIR

Editor-in-Chief: Yuhui Shi
Published: Quarterly (both in Print and Electronic form)


PUBLISHER:
The International Journal of Swarm Intelligence Research (IJSIR) is
published by IGI Global (formerly Idea Group Inc.), publisher of the
'Information Science Reference' (formerly Idea Group Reference) and
'Medical Information Science Reference' imprints. For additional information
regarding the publisher, please visit www.igi-global.com.

All submissions should be directed to the attention of:

Mahamed G.H. Omran
Guest Editor
International Journal of Swarm Intelligence Research
E-mail: omran.m@gust.edu.kw
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] IEEE/ACM DCOSS 2011, Paper submission due: Feb 4, 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

IEEE/ACM DCOSS 2011
The 7th IEEE International Conference on Distributed Computing in
Sensor Systems

http://www.dcoss.org

July 27-29, 2011, Barcelona, Spain
***********************************************************************


Distributed sensor systems have become a highly active research area
due to their potential for providing diverse new capabilities. Such
systems allow intelligent dense monitoring of physical environments.
The focus of this conference is on distributed computing issues in
largescale networked sensor systems (including algorithms, applications,
systematic design techniques and tools, and in-network signal and
information processing).

Authors are invited to submit original unpublished manuscripts that
demonstrate current research on computational aspects of distributed
sensor systems. Topics of interest include but are not limited to:


. Computation and programming models
. Energy models, minimization, awareness
. Distributed collaborative information processing
. Detection and tracking
. Theoretical performance analysis:complexity, correctness, scalability
. Abstractions for modular design
. Fault tolerance and security
. Languages, operating systems
. Task allocation, reprogramming and reconfiguration
. Dynamic resource management
. Scalable, heterogeneous architectures (node and system-level)
. Middleware interfaces, communication and processing primitives
. Design, simulation and optimization tools for deployment and operation
. Design automation and application synthesis techniques
. closed-loop control for sensing and actuation
. Case studies: lessons from real world deployments
. Network coding and compression

General Co-Chair
Ivan Stojmenovic, University of Ottawa, Canada
Mischa Dohler, Centre Tecnologic de Telecom. de Catalunya,Spain


Technical Program Chair
Adam Dunkels, Swedish Institute of Computer Science,Sweden


Program Vice Chairs
Algorithms and Performance Analysis:
Suman Nath, Microsoft, USA
Systems and Applications:
TBD
Signal Processing and Information Theory:
Michael Rabbat, McGill University, Canada


Workshop Chair
Sotiris Nikoletseas, University of Patras and CTI, Greece


Proceedings Chair
Rafael Falcon, University of Ottawa, Canada


Publicity Co-Chairs
Jiming Chen, Zhejiang University, China
Xu Li, INRIA Lille Nord Europe, France


Web Chair
Marcio Almeida, University of Ottawa, Canada


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

Saturday, November 20, 2010

[DMANET] CFP: Computer Communications (Elsevier) Special Issue on Wireless Sensor and Robot Networks

Computer Communications (Elsevier) Call for Papers
Special Issue on Wireless Sensor and Robot Networks: Algorithms and
Experiments

SCOPE
Wireless sensor and robot networks (WSRN) are the confluence point where
the two traditional fields of wireless sensor networks (WSN) and robot
networks meet, and nodes collaborate to accomplish distributed sensing and
actuation tasks. Leveraged by the control and mobility of robots, the
networking process and applications embrace a whole new set of possibilities.

The objective of this special issue is to bring together state-of-the-art
contributions on the design, specification, and implementation of architectures,
algorithms and protocols for current and future applications of WSRN. Original,
unpublished contributions are solicited in ALL aspects of WSRN and traditional
WSN, robot networks, as well as robotics and automation. Possible topics of
interest include, but are certainly not limited to the following:

* Autonomous sensor networks
* Emergent behavior in WSRN
* Distributed control and management in WSRN
* Modeling, simulation and experimentation of WSRN
* Autonomic and self-organizing communication and coordination
* Robot task assignment and mobility management
* Biologically inspired communication
* Data management, gathering, aggregation and query processing in WSRN
* Location service, neighborhood discovery and service discovery in WSRN
* Map exploration and pattern formation and flocking of mobile robots
* Localization and time synchronization in WSRN
* Energy efficiency, Quality of Service and robustness issues in WSRN
* Architectures, coverage and topology control in WSRN
* Probabilistic integration in WSRN
* Applications and prototypes of WSRN

PAPER SUBMISSION
* The submitted papers must be written in English and describe original
research which is not published nor currently under review by other
journals or conferences. Author guidelines for preparation of
manuscript can be found at http://www.ees.elsevier.com/comcom.

* The submission website for this journal is located at
http://ees.elsevier.com/comcom.
To ensure that all manuscripts are correctly identified for inclusion into
the Special Issue, the authors have to select "Special Issue: WSRN"
when they reach the "Article Type" step in the submission process.

IMPORTANT DATES
* Paper submission: Jan. 31, 2011
* Author notification: May. 15, 2011
* Expected publication: Fourth Quarter 2011

GUEST EDITORS
* Dr. Jiming Chen
Department of Control Science and Engineering, Zhejiang Univ., China,
Email: jmchen@iipc.zju.edu.cn
* Dr. Hannes Frey
Department of Computer Science, University of Paderborn, Germany
Email: hannes.frey@uni-paderborn.de
* Dr. Xu Li
Department of Electrical and Computer Engineering, U of Waterloo,
Canada
Email: easylix@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/
*
**********************************************************

Friday, November 19, 2010

[DMANET] Call for Papers: DIMAP Workshop on Combinatorics and Graph Theory

-------------------------------------------------------------------------
DIMAP Workshop on Combinatorics and Graph Theory
4-7 April, 2011, University of Warwick, UK
-------------------------------------------------------------------------
The recently established Centre for Discrete Mathematics and
its Applications (DIMAP) at the University of Warwick (UK)
is organizing a series of workshops on different emerging
research topics. From 4 to 7 April 2011, we will be holding
a workshop on

"Combinatorics and Graph Theory".

The idea is to bring together the best people in the field
to discuss the latest developments as well as future directions.
Keynote talks will be given by the following speakers:

- Reinhard Diestel,
- Michael Fellows,
- Jaroslav Nesetril,
- Carsten Thomassen.

In addition to these invited talks, there will be a limited number of
contributed talks organized in a single track. Discussion and
interaction between the participants will have a high priority.

The registration fee for the workshop is GBP 100. The fee should
cover coffee breaks and lunches on Monday-Thursday as well as
an excursion and social dinner on Tuesday evening.

Important dates:
- Submission deadline: January 15, 2011
- Notification of acceptance: February 1, 2011
- Registration deadline: February 15, 2011

Submission (via EasyChair) is now open on the following webpage:
http://www2.warwick.ac.uk/fac/cross_fac/dimap/events/wcgt2011

Information about travel, accommodation etc. can be found on
the same webpage.

For further information, please contact the organizing committee:

Vadim Lozin (V.Lozin@warwick.ac.uk)
Konrad Dabrowski (K.K.Dabrowski@warwick.ac.uk)
Bernard Ries (bernard.ries@dauphine.fr)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Thursday, November 18, 2010

Postdocs and other positions at MSR-NE

Microsoft Research New England has available postdoc positions in various
areas (including theoretical CS) for the next academic year. The deadline to
apply is December 1st. Please see http://research.microsoft.com/en-
us/jobs/fulltime/postdoc.aspx
for more details. Some candidates may also want
to apply to the joint MIT/MSR Schramm postdoctoral fellowship in probability
theory and discrete mathematics (same deadline, apply through MIT). We also
have summer internship positions as well for graduate students- email Irene
Money at msrnejob@microsoft.com for details on how to apply.

Please forward this information to your students/colleagues and/or any
departmental mailing lists.

Best,

Boaz Barak

[DMANET] 6th International Computer Science Symposium in Russia (CSR 2011): 2nd Call for Papers

We apologize for multiple copies.

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

Second Call for Papers

6th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2011)

June 14-18, 2011, St. Petersburg, Russia

http://logic.pdmi.ras.ru/csr2011/

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

CSR 2011 intends to reflect the broad scope of international cooperation in
computer science. It is the sixth conference in a series of regular events
started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007
in Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010),
CSR 2009 in Novosibirsk (see LNCS 5675), and CSR 2010 in Kazan (see
LNCS 6072).

IMPORTANT DATES

Deadline for submissions: December 6, 2010
Notification of acceptance: February 6, 2011
Conference dates: June 14-18, 2011

As usual, there will be YANDEX AWARDs for the best paper and
for the best student paper.

TOPICS
include, but are not limited to:

* algorithms and data structures
* combinatorial optimization
* constraint solving
* computational complexity
* cryptography
* combinatorics in computer science
* formal languages and automata
* computational models and concepts
* algorithms for concurrent and distributed systems, networks
* proof theory and applications of logic to computer science
* model checking
* automated reasoning
* deductive methods

OPENING LECTURE

Dima Grigoriev (Institut des Mathematiques de Lille, France)

INVITED SPEAKERS

Manindra Agrawal (Indian Institute of Technology Kanpur, India)
Andrei Bulatov (Simon Fraser University, Canada)
Jarkko Kari (University of Turku, Finland)
Alexander Shen (LIF Marseille, France)
Amir Shpilka (Technion, Israel)
Madhu Sudan (MIT & Microsoft Research, USA)
Sergey Yekhanin (Microsoft Research, USA)
The full list of invited speakers TBA.

PROGRAM COMMITTEE

Nikolai K. Vereshchagin (Moscow State University, Russia; Chair)
Farid Ablayev (Kazan State University, Russia)
Maxim Babenko (Moscow State University, Russia)
Olivier Carton (Universite Paris Diderot, France)
Bruno Durand (Universite de Provence, France)
Anna Frid (Sobolev Institute of Mathematics, Russia)
Valentine Kabanets (Simon Fraser University, Canada)
Juhani Karhumaki (University of Turku, Finland)
Michal Koucky (Institute of Mathematics, Czech Republic)
Meena Mahajan (Institute of Mathematical Sciences, India)
Yuri Matiyasevich (Steklov Institute of Mathematics at St. Petersburg, Russia)
Pierre McKenzie (Universite de Montreal, Canada)
Ilya Mironov (Microsoft Research, USA)
Ilan Newman (Haifa University, Israel)
Alexander Razborov (University of Chicago, USA and
Steklov Mathematical Institute, Russia)
Miklos Santha (Universite Paris-Sud, France)
Nitin Saxena (Hausdorff Center for Mathematics, Germany)
Valentin Shehtman (Institute for the Information Transmission Problems, Russia)
Alexander Sherstov (Microsoft Research, USA)
Thomas Thierauf (Aalen University, Germany)
Oleg Verbitsky (Institute for Applied Problems of
Mechanics and Mathematics, Ukraine)
Mikhail Volkov (Ural State University, Russia)
Igor Walukiewicz (Universite de Bordeaux, France)

ORGANIZERS

* Steklov Institute of Mathematics at St. Petersburg of
the Russian Academy of Sciences and
* St. Petersburg Academic University of the Russian Academy of Sciences

CONFERENCE CHAIR

Alexander S. Kulikov (Steklov Institute of Mathematics at
St. Petersburg, Russia)

SUBMISSIONS

Authors are invited to submit an extended abstract or a full paper of at most
12 pages, not including references, in the LNCS format (LaTeX, as pdf; final
version with source); instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Proofs and other material omitted due to space constraints are to be put into
a clearly marked appendix to be read at discretion of the referees. Papers
must present original (and not previously published) research. Simultaneous
submission to journals or to other conferences with published proceedings is
not allowed. The proceedings of the symposium will be published in Springer's
LNCS series.

Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2011

SATELLITE WORKSHOPS

* Workshop on post-quantum cryptography
* Second Workshop on Program Semantics, Specification and
Verification: Theory and Applications
* Workshop on Universal Algebra and Computer Science

Details: http://logic.pdmi.ras.ru/csr2011/workshops

FURTHER INFORMATION AND CONTACTS

Web: http://logic.pdmi.ras.ru/csr2011/
Email: csr2011@logic.pdmi.ras.ru
**********************************************************
*
* 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] LSSC'2011 conference

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in the
special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO LARGE-SCALE
PROBLEMS" at the 7th International Conference on Large Scale Scientific
Computation - LSSC'11, June 6 - 10, 2011, Sozopol, Bulgaria, with arrival:
June 5 and departure: noon June 10.

The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies (former
Institute for Parallel Processing), Bulgarian Academy of Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Carlos Cotta from University of Malaga, Spain will be a key lecture of our
special sesssion.

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in Computer
Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2011
Notification of acceptance of the talks on the basis of the submitted
abstract
January 31, 2011
Deadline for submission of full papers
March 15, 2011
Notification of acceptance of full papers
April 30, 2011


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the results)
are to be written in standard LaTeX. The length of the contributed papers is
limited up to 8 pages. It is assumed that one participant will present not
more than one talk.

Send the abstracts and papers to special session organizers and conference
organizers, indicating the name of the special session. After sending the
abstract go to the conference web page and fill in the registration form
(personal data of the participants, minimum one per paper, and the name of
the special session).

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/Conferences/SciCom11.html

Special session organizers
Assoc. Prof. Stefka Fidanova
Assist. Prof. Gabriel Luque

--
Assoc. Prof. Stefka Fidanova
IPP-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, November 17, 2010

[DMANET] extended deadline

Dear Colleague

The deadline for submission to the 12th Annual Congress of the French
Operations Research and Decision Aid Society (ROADEF) is extended
http://roadef2011.emse.fr/index.en.php

for regular submissions: November 30, 2010
for submissions to invited sessions: December 8, 2010

Note that we have already more than 300 submissions and the following
Keynote speakers:

Pr Roman Slowinski
Rule-based Multicriteria Decision Aiding
http://idss.cs.put.poznan.pl/site/rslowinski.html

David Simchi-Levi
Creating Value in a Volatile World
http://cee.mit.edu/simchi-levi

Dominique de Werra
Graph coloring and applications
http://personnes.epfl.ch/dominique.dewerra

The official languages of congress are: French and English

Do not hesitate to submit your contributions (abstract of 2 pages maximum)
via the site:
https://www.easychair.org/account/signin.cgi?timeout=1;conf=roadef2011
http://roadef2011.emse.fr/soumission.en.php

Best regards
Alexandre Dolgui
Xavier Delorme
Organizing Committee Co-Chairs


____________________________________________________________________

Alexandre Dolgui, Dr.Hab., Ph.D.
Professor
Director of the Centre for Industrial Engineering and Computer Science
Ecole des Mines de Saint-Etienne
/National Institute of Science and Technology@Saint-Etienne/
158, Cours Fauriel, 42023 Saint-Etienne cedex 2, France
Fax: +33 (0)4.77.42.66.66
E-mail: dolgui@emse.fr
URL: www.emse.fr/~dolgui

New book:
Supply Chain Engineering: Useful Methods and Techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8

Annual Meeting of the French Operational Research Society ROADEF 2011
http://roadef2011.emse.fr/index.en.php

Deadline for submissions (abstract, 2 pages): November 16, 2010
_____________________________________________________________________
**********************************************************
*
* 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/
*
**********************************************************