Theory Announcements

Thursday, February 3, 2011

[DMANET] Junior Professorship (W1) Bioinformatics for High Throughput Technologies at FSU Jena

* Junior Professorship (W1) "Bioinformatics for High Throughput
Technologies" *

The Institute of Computer Science at the Friedrich-Schiller University
Jena offers the following position, funded by the Carl-Zeiss-Stiftung

Junior Professorship (W1) "Bioinformatics for High Throughput Technologies".

The successful candidate's scientific expertise should complement the
Bioinformatics activities at the Friedrich-Schiller University Jena. The
candidate is expected to develop methods and computational tools for the
efficient analysis and visualization of high throughput data in life
sciences. Scientific links to algorithmic Bioinformatics, systems
biology, and other research activities at Jena are desired. Applicants
should demonstrate the ability to raise research funding and are
expected to collaborate in existing scientific cooperations of the
University.

The candidate is expected to offer courses for advanced students in the
scientific area of the Junior Professorship, and possibly a programming
course. The language of instruction is mainly German, but advanced
courses may be conducted in English. An appointment as junior professor
is time-limited to four years.

Appropriate performance in research, in teaching, and in raising
research funding allows for a prolongation up to six years. In the event
that the university subsequently decides to award tenure on the W2 or W3
professorial grades, the usual requirement to advertise all such
positions need not apply. The Junior Professorship comes with an
additional staff position.

An outstanding doctoral degree and scientific publication activities at
the international level. as well as educational skills are prerequisites
for this position.

As the University intends to increase its female academic staff, it
follows the principle of affirmative action and encourages applications
by qualified women scientists.

Physically challenged applicants with equal qualifications and
experience will be given priority over other applicants.

Applications including the usual documents (CV, List of publications,
record of teaching and fund raising, copies of testimonials, up to five
publications, outline of planed research activities in Jena) must be
sent by 2011-03-31 to

Dekan der Fakultaet fuer Mathematik und Informatik
Friedrich-Schiller-Universitaet Jena
07737 Jena
Germany

http://www.academics.de/jobs/juniorprofessur_w1_57199.html

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

Juniorprofessur (W1) "Bioinformatik fuer Hochdurchsatzverfahren"

Am Institut fuer Informatik der Friedrich-Schiller-Universitaet Jena ist,
gefoerdert durch die Carl-Zeiss-Stiftung, zum naechstmoeglichen Zeitpunkt eine

Juniorprofessur (W1) "Bioinformatik fuer Hochdurchsatzverfahren"

zu besetzen.

Gesucht wird eine Persoenlichkeit, deren fachliche Ausrichtung den Aufbau
des Forschungsschwerpunktes Bioinformatik an der Universitaet Jena
sinnvoll ergaenzt und informatische Methoden und Werkzeuge zur
effizienten Auswertung und Visualisierung von Daten aus
Hochdurchsatzverfahren in den Lebenswissenschaften entwickelt.

Wuenschenswert sind Bezuege zur Algorithmischen Bioinformatik und
Systembiologie sowie Anknuepfungspunkte zu bestehenden Jenaer
Forschungsaktivitaeten. Darueber hinaus wird erwartet, dass die zu
berufende Persoenlichkeit sich sowohl bei universitaetsweiten
Kooperationen als auch bei der kompetitiven Drittmitteleinwerbung
erfolgreich engagiert.

In der Lehre sollen Vorlesungen fuer fortgeschrittene Studierende zum
Themenbereich der Juniorprofessur angeboten werden; auch der Aufbau
eines entsprechenden Computer-Praktikums ist erwuenscht.

Das Dienstverhaeltnis ist zunaechst auf vier Jahre befristet. Bei einer
erfolgreichen Evaluation der Leistungen in Forschung, Lehre,
akademischer Selbstverwaltung und Drittmitteleinwerbung kann es um
weitere zwei Jahre verlaengert werden. Bei besonderer Eignung und
Vorhandensein einer entsprechenden Stelle ist eine anschliessende
Berufung auf eine Professur W2/W3 auch ohne Ausschreibung moeglich (Par. 78
ThuerHG). Die Juniorprofessur ist mit einer zusaetzlichen
Mitarbeiterstelle und eigenen laufenden Mitteln ausgestattet.

Einstellungsvoraussetzungen sind eine ueberdurchschnittlich
abgeschlossene Promotion und eine Publikationstaetigkeit auf
internationalem Niveau sowie die paedagogische Eignung.
Auslandserfahrungen sind wuenschenswert.

Die Friedrich-Schiller-Universitaet strebt eine Erhoehung des Anteils von
Frauen in Forschung und Lehre an; qualifizierte Wissenschaftlerinnen
werden nachdruecklich aufgefordert, sich zu bewerben.

Schwerbehinderte werden bei gleicher Eignung bevorzugt beruecksichtigt.

Bewerbungen mit den ueblichen Unterlagen (Lebenslauf, Publikationsliste,
Erfahrungen in Lehre und Drittmitteleinwerbung, Zeugniskopien, bis zu
fuenf ausgewaehlte Publikationen, Kurzdarstellung zukuenftiger
Forschungsaktivitaeten mit Anknuepfungspunkten in Jena) sind bis zum
*31.03.2011* einzureichen bei dem

Dekan der Fakultaet fuer Mathematik und Informatik
Friedrich-Schiller-Universitaet Jena
07737 Jena
Germany

http://www.academics.de/jobs/juniorprofessur_w1_57199.html

--
Prof. Dr. Sebastian Boecker, Lehrstuhl fuer Bioinformatik
Currently visiting: Biomathematics Research Centre
PB 4800, University of Canterbury, Christchurch, New Zealand
Office 616, Phone +64 3 3642987 ext 8876, Fax +64 3 3642587
http://bio.informatik.uni-jena.de/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Workshop on Universal Algebra and Computer Science

WUACS (Workshop on Universal Algebra and Computer Science): 12–13 June 2011, St Petersburg, Russia
http://logic.pdmi.ras.ru/csr2011/wuacs

A Satellite Workshop to CSR 2011 (6th International Conference Computer Science in Russia),
14–18 June 2011, St Petersburg, Russia, http://logic.pdmi.ras.ru/csr2011/

Links between universal algebra and theoretical computer science are numerous and studying them
has proved to be productive for both the theories. In fact, theoretical computer science provides
the most essential source of problems for modern universal algebra while algebraic methods and
techniques constitute a major ingredient of the toolbox of modern computer science.

A lucky coincidence is that a representative international conference on universal algebra,
see http://2oal.tcs.uj.edu.pl , will be held in Krakow, Poland, from June 6th to 10th, 2011,
that is, exactly before CSR 2011. This creates a very convenient opportunity to bring together
researchers with a common interest in universal algebra and its applications in computer science.

Submissions of interesting theoretical and applied results related to both fields are encouraged.
Topics include (but are not limited to):

* Applications of universal algebra in the constraint satisfaction problem
* Extensions of algebraic methods in soft and valued CSPs, and other related problems
* Infinite CSPs, and logic and algebraic methods for infinite CSPs
* Expressiveness and equivalence of logic formulas over algebras and relational structures
* Algorithms and complexity in universal algebra
* Algebraic models for automata and language theory

Survey talks, preliminary results, developments of published results, and work in progress are welcome.
Prospective speakers are invited to submit a 1–2 pages abstract which provides sufficient detail
to allow the program committee to assess the merits of the proposal. Abstracts should be submitted
to Mikhail.Volkov@usu.ru

Invited speakers:

* Marcel Jackson, La Trobe University, Bundoora, Australia
* Ralph McKenzie, Vanderbilt University, Nashville, USA

Organizers:

* Mikhail Volkov, Ural State University, Ekaterinburg, Russia
* Andrei Bulatov, Simon Fraser University, Canada

Important Dates:

* Submission: 15 March 2011
* Notification: 30 March 2011
* Workshop: 12–13 June 2011

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

[DMANET] Second Alpen-Adria workshop on Optimization

After very positive reactions following the first Alpen-Adria
workshop on Optimization, organized last may in Klagenfurt,
we now invite to the

Second Alpen-Adria workshop on Optimization,

Klagenfurt University, May 12 - 14, 2011.

The workshop is meant as a satellite to the SIAM conference
on Optimization (May 16- 16, Darmstadt).

For further details, please check:
http://www.wo2011.uni-klu.ac.at

In particular, please note that presentations will only be
considered if we receive your information by February 28.
As not too many slots for contributed talks are available
(and the talks are organized in a single track),
we will possibly have to select among the submissions.

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

Erice School on "Graph Theory, Algorithms and Applications"

PRELIMINARY ANNOUNCEMENT

School on "Graph Theory, Algorithms and Applications"
International School of Mathematics -- "Guido Stampacchia"
Centre "Ettore Majorana" for Scientific Culture
Erice, Sicily (Italy)
September 25 - October 3, 2011
http://www.graphalgorithms.it

LECTURERS:

* Prof. Giorgio Ausiello, "Sapienza" University of Rome
* Prof. Friedrich Eisenbrand, EPFL Lausanne
* Prof. Naveen Garg, Indian Institute of Technology
* Dr. Andrew Goldberg, Microsoft Research -- Silicon Valley
* Prof. Martine Labbe, Universite Libre de Bruxelles
* Prof. Kurt Mehlhorn, Max-Planck Institut fuer Informatik
* Dr. Giovanni Rinaldi, CNR Italy
* Prof. Maria Grazia Speranza, University of Brescia
* Prof. Robert E. Tarjan, Princeton University and HP
* Prof. Paolo Toth, University of Bologna
* Prof. Dorothea Wagner, Karlsruhe Institute of Technology

DIRECTORS OF THE SCHOOL:

Prof. Raffaele Cerulli, University of Salerno
Dr. Andrew Goldberg, Microsoft Research -- Silicon Valley
Prof. Giuseppe F. Italiano, University of Rome "Tor Vergata"
Prof. Kurt Mehlhorn, Max-Planck Institut fuer Informatik
Prof. Robert E. Tarjan, Princeton University and HP

DIRECTORS OF THE COURSE:
Prof. Franco Giannessi

LOCATION:

Erice is among the oldest cities in Sicily. The town is placed on the
homonymous mount Eryx, religious center of the Elimi, which is famous
for its temple where the Phoenicians worshipped Astarte, the Greeks
Aphrodite and the Romans Venus. Throughout history Erice was contended
by many different populations, and each of them left a palpable sense
of history. Erice is nowadays an enchanting wonderfully preserved
Mediaeval town offering the most breathtaking views in Sicily.

DETAILS:

More information is avalaible on the School Web Site at the following
URL http://www.graphalgorithms.it

--
Giuseppe F. Italiano
Dipartimento di Informatica, Sistemi e Produzione
Universita' di Roma "Tor Vergata"
via del Politecnico 1, 00133 Roma, Italy
Tel. +39-06-72597394, Fax +39-06-72597460
URL: http://www.disp.uniroma2.it/users/italiano
Skype: pinoitaliano62

Erice School on "Graph Theory, Algorithms and Applications"

PRELIMINARY ANNOUNCEMENT

LECTURERS:

DIRECTORS OF THE SCHOOL:

DIRECTORS OF THE COURSE:
Prof. Franco Giannessi

LOCATION:

DETAILS:

More information is avalaible on the School Web Site at the following
URL http://www.graphalgorithms.it

Wednesday, February 2, 2011

[DMANET] Postdoc in Theoretical Computer Science/Algorithms/Combinatorics at the University of Warwick

==============================================================================
Postdoctoral Researcher, University of Warwick
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job16052.html
==============================================================================

Applicants sought for a postdoctoral position in connection with
an EPSRC grant EP/G064679/1 "Advances in Sublinear Algorithms"
(PI: Prof Artur Czumaj).

We are looking for highly qualified candidates with a PhD degree (or
expecting to get one very soon) in combinatorics, discrete mathematics,
theoretical computer science, or related fields.
The main focus of the post is on the research in the broadly understood
area of design and mathematical analysis of sublinear algorithms,
including research in property testing and combinatorics, and
sublinear-time approximation algorithms for combinatorial and optimization
problems.

The position is affiliated with the Foundations of Computer Science
Research Group (http://www.dcs.warwick.ac.uk/research/focs/) at
the Department of Computer Science and the Centre for Discrete Mathematics
and its Applications DIMAP (http://go.warwick.ac.uk/dimap/) at the
University of Warwick.

The post is Fixed Term Contract for 20 months with likely possibility of
extension.

GBP 27,319 - GBP 35,646 pa (appointments are usually made on the first point
of the salary range)

Closing date for receipt of applications: Monday, February 28, 2011.

To apply, please follow the instructions on the official advert web page
https://secure.admin.warwick.ac.uk/webjobs/jobs/research/job26484.html.

For any further information, please contact
Artur Czumaj (http://www.dcs.warwick.ac.uk/~czumaj/).
**********************************************************
*
* 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] DNA 17 Call for Papers

DNA 17 Call for Papers
**********************
The Seventeenth International Conference on
DNA Computing and Molecular Programming
September 19-23, 2011
California Institute of Technology
Pasadena, California, USA

INTRODUCTION
************
The Meeting
-----------
Research in DNA computing and molecular programming draws together
mathematics, computer science, physics, chemistry, biology, and
nanotechnology to address the analysis, design, and synthesis of
information-based molecular systems. This annual meeting is the premier
forum where scientists with diverse backgrounds come together with the
common purpose of advancing the engineering and science of biology and
chemistry from the point of view of computer science, physics, and
mathematics. Continuing this tradition, the 17th International Conference
on DNA Computing and Molecular Programming (DNA17), under the auspices of
the International Society for Nanoscale Science, Computation and Engineering
(ISNSCE), will focus on the most recent experimental and theoretical results
that promise the greatest impact.

Solicitation for Papers
-----------------------
Papers and poster presentations are sought in all areas that relate to
biomolecular computing using DNA and/or other molecules, including but not
restricted to:
1) algorithms and models of computation for biomolecular systems;
2) control of molecular folding and self-assembly to construct
nanostructures;
3) demonstration of switches, gates, devices, and circuits;
4) molecular motors and molecular robotics;
5) computational processes in vitro8 and in vivo;
6) studies of fault-tolerance and error correction;
7) synthetic biology and in vitro evolution;
8) software tools for analysis, simulation, and design;
9) applications in engineering, physics, chemistry, biology, and medicine.

Dates and Deadlines
-------------------
Please note that the conference dates have been shifted from June to
September to be suitably staggered from the other ISNSCE-sponsored
conference, Foundations of Nanoscience: Self-Assembled Architectures and
Devices (FNANO). Please note that the new schedule demands that deadlines
will be *firmly enforced*. The May 2 submission deadline will not be
extended. Revised manuscripts submitted by the July 17 deadline will be the
final versions for the LNCS proceedings; there will be no additional
revisions possible after the conference.

INVITED SPEAKERS
****************
Vincent Danos, Computational Systems Biology, University of Edinburgh,
Edinburgh, UK
Yamuna Krishnan, Biochemistry, Biophysics, & Bioinformatics, National Centre
for Biological Sciences, Bangalore, India
Niles Lehman, Chemistry, Portland State University, Portland, Oregon, USA
Jack Lutz, Computer Science, Iowa State University, Ames, Iowa, USA
Hao Yan, Chemistry & Biochemistry, Arizona State University, Tempe,
Arizona, USA

IMPORTANT DATES
***************
Submission deadline (firm): May 2, 2011 before 10pm PST
Notification of acceptance: June 19, 2011
Revised manuscripts due: July 17, 2011
Conference: September 19-23, 2011
Accommodation deadline: July 10, 2011

RELATED EVENTS
**************
September 19, 2011 -- Tutorial Day: The first day of the meeting will
consist of tutorials covering important topics related to DNA computing and
molecular programming.

CONFERENCE WEBSITE
******************
For further information, please see http://dna17.caltech.edu.

INSTRUCTIONS FOR AUTHORS
************************
Electronic Submissions: All papers and abstracts should be submitted
electronically following the instructions and link at the conference web
page, http://dna17.caltech.edu. The submission site will open by April 2,
2011 and close on May 2, 2011 at 10pm Pasadena time (PST). Papers must be
submitted in PDF format. The use of LaTeX is strongly encouraged for Track
A submissions, as it will be required for the revised manuscript included in
the LNCS proceedings of accepted papers.

TRACKS
******
Authors may choose between three submission tracks.

Track A - Full Paper
--------------------
For authors who want their full papers to be published in the conference
proceedings. Submissions will be considered for oral presentation; those
that are not accepted for oral presentation will automatically be considered
for poster presentation. Submissions should conform to the following
guidelines:

* The total length of the paper should not exceed 15 pages and should be
formatted in LaTeX for the Springer-Verlag Lecture Notes in Computer
Science
(LNCS). Please follow the formatting instructions at
http://www.springer.de/comp/lncs/authors.html.

* Each paper should contain an abstract which briefly describes the primary
results and their importance.

* Selected papers will be published in the proceedings, available at the
conference and as part of the LNCS series. Submissions to Track A may not
be previously published or simultaneously submitted to another conference
or
journal for publication.

Track B - One-Page Abstract
---------------------------
Primarily for authors submitting experimental results who plan to submit to
a journal rather than publish in the conference proceedings. (Abstracts for
work recently submitted to or published in a journal will also be
considered.) Submissions will be considered for oral presentation; those
that are not accepted for oral presentation will automatically be considered
for poster presentation. Submissions should conform to the following
guidelines:

* The total length of the abstract should not exceed 1 page (11 point type,
single spaced, 1 inch margins).

* The one-page abstract should describe the primary results and their
importance.

* Authors must include a preliminary manuscript, a thesis chapter or some
other form of supporting documentation that can be used by the program
committee to evaluate the merit of the work for oral presentation. Only the
one-page abstract will appear in the proceedings. Track B papers
unaccompanied by adequate documentation will not be eligible for oral
presentation.

Track C - Poster Only
---------------------
For authors interested in presenting their work only in the poster session.
Submissions should conform to the following guidelines:

* The total length of the abstract should not exceed 1 page (11 point type,
single spaced, 1 inch margins).

* The one-page abstract should describe the primary results and their
importance.

STUDENT PAPER PRIZES
********************
The best two papers with a student as the lead and presenting author will
be
awarded travel prizes. For eligible papers, a brief recommendation letter
(such as from the student's advisor) should be emailed to
dna17@easychair.org. Recipients of the prize will be notified at the time
of acceptance. Some other student scholarships may also be available.
**********************************************************
*
* 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 MASS - Deadline March 20, 2011

CFP: IEEE MASS 2011

CALL FOR PAPERS

IEEE MASS 2011
The 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems
October 17-21, 2011, Valencia (Spain)http://mass2011.upv.es

<http://mass2011.upv.es/cfp%20IEEE%20MASS%202011.pdf>

*Scope:*
The 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems
(IEEE MASS 2011) is to be held in Valencia, Spain, on October 17-21, 2010.
Wireless ad-hoc communication has applications in a variety of environments,
such as conferences, hospitals, battlefields and disaster-recovery/rescue
operations, and is also being actively investigated as an alternative
paradigm for Internet connectivity in both urban and rural areas. Wireless
sensor and actuator networks are also being deployed for enhancing
industrial control processes and supply-chains, and for various forms of
environmental monitoring. The IEEE MASS 2011 aims at addressing advances in
research on multi-hop ad-hoc and sensor networks, covering topics ranging
from technology issues to applications and test-bed development.

*Topics of interest:*
Original, unpublished contributions are solicited in all aspects of (mobile)
ad-hoc networks and wireless sensor networks (WSN), systems and
applications. Topics include, but are not limited to:
- Vehicular networks and protocols
- Wireless mesh networks and cognitive networks
- MAC layer design for ad-hoc networks and WSNs
- MAC protocols (802.11, 802.15.4, UWB)
- Multi-channel, multi-radio and MIMO technologies
- Cross layer design and optimization
- P2P, overlay, and content distribution architectures for ad-hoc and
sensor networks
- Delay tolerant networks and opportunistic networking
- Power-aware architectures, algorithms and protocols design
- Clustering, topology control, coverage and connectivity
- Routing protocols (unicast, multicast, broadcast, geocast)
- Data transport and management in WSNs
- Data gathering, fusion, and dissemination in WSNs
- Localization and synchronization in WSNs
- Cooperative sensing in WSNs
- Capacity planning and admission control in ad-hoc and sensor networks
- Handoff / mobility management and seamless internetworking
- Resource management and wireless QoS Provisioning
- Key management, trust establishment in wireless networks
- Security and privacy issues in ad hoc and sensor networks
- Reliability, resiliency and fault tolerance techniques
- Security, privacy issues in vehicular, DTNs, and mesh networks
- Operating systems and middle-ware support
- Novel applications and architectures for WSNs
- Modeling, analysis and performance evaluation
- Measurements and experience from experimental systems and test-beds

*Submission guidelines:*
All submissions must be full papers in PDF format and uploaded on EDAS.
They must not exceed 10 single-spaced, double-column pages using 10 pt size
fonts on 8.5 x 11 inch pages in IEEE style format.

*Workshops:*
Proposals for full day workshops are solicited. Selections will be made
considering the expertise and experience of the workshop organizers and the
relevance of the topic to the central theme of the conference. Proposals of
at most 4 pages, including a 1-page biographical sketch, should be submitted
to the Workshops Chair by March 25, 2011.

*Demos:*
Real-world experimentation has proven to be an indispensable methodology to
evaluate mobile ad hoc and sensor systems. Furthermore, early prototyping is
an outstanding way to understand end user requirements and help adoption of
wireless ad hoc technologies by the mass market. With this brief background,
IEEE MASS solicits demonstrations of mobile ad hoc and sensor systems
showing real-systems prototypes at work, thus stimulating discussions among
the attendees. Abstract of demos should be submitted by June 26, 2011.
Important dates:

Papers:
Abstract Due: March 20, 2011
Manuscripts Due: March 27, 2011
Acceptance Notification: June 17, 2011
Camera-ready Submission: July 17, 2011

Demos:
Abstract Due: June 26, 2011
Acceptance Notification: July 22, 2011
Camera-ready Submission: August 12, 2011

Workshop:
Proposals Deadline: March 25, 2011
Proposals Notification: April 4, 2011
Manuscripts Due: June 26, 2011
Acceptance Notification: July 22, 2011
Camera-ready Submission: August 12, 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/
*
**********************************************************

Post-doc position in Databases at Hasselt University

The Databases and Theoretical Computer Science Research group is a research group of
Hasselt University in Belgium. The group focuses on theoretical
computer science, database research, data mining, and algorithmic
bioinformatics and consists of about 15 researchers.
See www.uhasselt.be and www.uhasselt.be/theocomp

The research group is looking for candidates for a Post-doc position (one or two years).
The intended research is situated in the domain of databases. A candidate can start as soon as
possible. A PhD in a related field is a necessary prerequisite.
If you are interested please contact Frank Neven (see the
website).

[DMANET] Open Position at the Department of Computer Science at Braunschweig Institute of Technology

The Department of Computer Science at Braunschweig Institute of Technology
(http://www.tu-bs.de) in Germany is looking for a candidate with a doctoral
degree who has a solid background in algorithms and optimization.

Duties combine teaching in English with coordinating international programs for
our students. Therefore, proficiency in English is a must, and sufficient
knowledge of German desired. In addition, candidates will have the opportunity
to participate in a variety of research activities. Pay is according to the
German bracket "TV-L 13" (between 3060 and 3940 Euros gross per month,
depending on previous experience and employment). The position is open and can
be filled as soon as possible. Funded with student fees, the initial term is
two years; renewal is possible, provided that an extension will be approved
by the relevant bodies.

We are looking for applicants with an above-average degree and a doctorate in
mathematics or computer science, who have a solid knowledge in optimization and
algorithms, an interest in and a capability for communication, teaching and
networking, who feel they could benefit from an interesting scientific
environment with a wide range of scientific work.

We are offering an opportunity to enhance and deepen the teaching and
scientific record as well as the participation in exciting interdisciplinary
projects that span all the way from basic research in algorithms to its
practical and technical application. The successful candidate will benefit
from the infrastructure of the Algorithmis Group within the Department of
Computer Science, and thus be part of a motivated team that maintains various
interdisciplinary and international contacts and activities.

Among applicants with equal qualifications, handicapped persons will be given
preference. The Braunschweig Institute of Technology is an equal-opportunity
employer and encourages women to apply.

Please send your detailed application by
** February 28, 2011 **

with the usual documents to:

Prof.Dr. Sandor Fekete
Technische Universitaet Braunschweig
Department of Computer Science
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany

fax: +49 531 391 3109

Electronic applications are welcome. If there are questions, please
contact Max Pagel via mail (m.pagel "at" tu-bs.de) or
phone (+49 531 391 3116).

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

[DMANET] Open position at the Department of Computer Science at Braunschweig Institute of Technology

Please find the English version below.

Die Abteilung Algorithmik des Departments fuer Informatik der Technischen
Universitaet Braunschweig (http://www.tu-bs.de) bietet unter der Leitung von
Prof. Dr. Sandor P. Fekete (http://www.ibr.cs.tu-bs.de/users/fekete) eine
breite Palette von Forschungsaktivitaeten, die von solider theoretischer
Grundlagenforschung bis zur praktischen Anwendung reichen. Ab April 2011 ist
bei uns eine Stelle fuer eine(n) Informatiker(in) oder Mathematiker(in) neu zu
besetzen.

Wir suchen

eine Wissenschaftliche Mitarbeiterin
oder einen Wissenschaftlichen Mitarbeiter (TV-L 13),

zur Promotion oder promoviert.

Die Besoldung erfolgt nach dem Tarifvertrag fuer den oeffentlichen Dienst der
Laender (TV-L) Stufe 13 (aktuell zwischen 3060 und 3940 Euro brutto im Monat, je
nach Erfahrung und bisheriger Anstellung).

Wir bieten die Moeglichkeit, begleitend eine Promotion zu verfolgen, bzw. (fuer
promovierte Bewerber/Bewerberinnen) die wissenschaftlichen Laufbahn zu
erweitern und zu vertiefen und dabei an einem breiten Spektrum
wissenschaftlicher Aktivitaeten und Projekte teilzunehmen. Als Mitglied der
Arbeitsgruppe sind Sie Teil eines motivierten Teams, das eine Vielzahl von
internationalen wissenschaftlichen Kontakten und Aktivitaeten in Algorithmik und
Optimierung unterhaelt.

Zu Ihren Pflichten gehoert die Durchfuehrung und Organisation von
Lehrveranstaltungen. Daher ist eine sehr gute Beherrschung der deutschen
Sprache zwingend erforderlich; darueber hinaus sollten gute Englischkenntnisse
vorhanden sein. Wir suchen nach Bewerbern/Bewerberinnen mit einem
ueberdurchschnittlichen Abschluss in Informatik oder Mathematik (Master oder
aequivalenter Abschluss, z.B. deutsches Diplom, bzw. Promotion). Solide
Kenntnisse in Optimierung und Algorithmen werden vorausgesetzt. Bewerber sollten
die Faehigkeit und das Interesse mitbringen, an verschiedensten Arten
wissenschaftlichen Arbeitens teilzunehmen, die von der Entwicklung neuer Ideen
bis hin zu deren praktischer Umsetzung reichen. Darueber hinaus erwarten wir
einen gesunden Teamgeist, da uns die gute Atmosphaere in der Abteilung sehr
wichtig ist.

Die Technische Universitaet Braunschweig will Frauen im Rahmen der gesetzlichen
Vorschriften besonders foerdern und fordert deshalb qualifizierte Frauen
nachdruecklich auf, sich zu bewerben. Schwerbehinderte Bewerberinnen und
Bewerber werden bei gleicher Eignung bevorzugt eingestellt.

Bitte senden sie ihre detaillierte Bewerbung bis zum
28. Februar 2011
mit den ueblichen Dokumenten an

Prof. Dr. Sandor Fekete
Technische Universitaet Braunschweig
Institut fuer Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany

fax: +49 531 391 3109

Bewerbungen in elektronischer Form sind willkommen. Bei Fragen kontaktieren
sie bitte Max Pagel per Email (m.pagel 'at' tu-bs.de) oder Telefon (+49 531
391 3116).

31. Januar 2011

English Version:

The Algorithms Group in the Department of Computer Science at
Braunschweig Institute of Technology (http://www.tu-bs.de) in Germany
offers a wide range of interdisciplinary research activities. The
group, headed by Professor Dr. Sandor P. Fekete
(http://www.ibr.cs.tu-bs.de/users/fekete), has a vacancy
for a computer scientist or mathematician, starting in April.

We are looking for a scientific employee / PhD student or postdoctoral
research associate (TV-L 13).

Duties include participation in teaching activities, so proficiency in
German is a must, sufficient knowledge of English desired. In addition,

researchers will have the opportunity to participate in a variety of
research activities. Pay is according to
the German bracket "TV-L 13" (between 3060 and 3940 Euros gross per month,
depending on previous experience and employment).

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

We are offering an opportunity to pursue a doctoral degree (to Ph.D.
candidates) or enhance and deepen the scientific record (to candidates
with a doctoreate), as well as the participation in exciting interdisciplinary
projects that span all the way from basic research in algorithms to its
practical and technical application. As a member of our group, you will be part
of a motivated team that maintains various interdisciplinary and international
contacts and activities.

Among applicants with equal qualifications, handicapped persons will
be given preference. The Braunschweig Institute of Technology is an
equal-opportunity employer and encourages women to apply.

Please send your detailed application by
** February 28, 2011 **

with the usual documents to:

Prof.Dr. Sandor Fekete
Technische Universitaet Braunschweig
Institut fuer Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany

fax: +49 531 391 3109

Electronic applications are welcome. If there are questions, please
contact Max Pagel via mail (m.pagel "at" tu-bs.de) or
phone (+49 531 391 3116).

January 31, 2011

LACL 2011 - Last CFP

LACL 2011

Logical Aspects of Computational Linguistics

June 29th, 30th and July 1st

LIRMM, Montpellier, France

http://lacl.gforge.inria.fr

PRESENTATION

LACL'2011 is the 6th edition of a series of international conferences
on logical and formal methods in computational linguistics. It
addresses in particular the use of type theoretic, proof theoretic and
model theoretic methods for describing natural language syntax and
semantics, as well as the implementation of natural language
processing software relying on such models. It will be held at the
LIRMM, Montpellier, France. It will be co-located with TALN, the
conference of the French association for NLP (ATALA).

Topics:

Computer scientists, linguists, mathematicians and philosophers are
invited to present their work on the use of logical methods in
computational linguistics and natural language processing, in natural
language analysis, generation or acquisition.

* logical foundation of syntactic formalisms
o categorial grammars
o minimalist grammars
o dependency grammars
o tree adjoining grammars
o model theoretic syntax
o formal language theory for natural language processing
o data-driven approaches
* logic for semantics of lexical items, sentences, discourse and dialog
o discourse theories
o Montague semantics
o compositionality
o dynamic logics
o game semantics
o situation semantics
o generative lexicon
o categorical semantics
* applications of these models to natural language processing
o software for natural language analysis
o software for acquiring linguistic resources
o software for natural language generation
o software for information extraction
o inference tasks
o evaluation
o scalability

SUBMISSIONS and PROCEEDINGS

Articles should be written in the LaTeX format of LNCS/LNAI by
Springer (see authors instructions at
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) and
should not exceed 16 pages (including figures, bibliography, possible
apendices). It is expected that each accepted paper be presented at
the meeting by one of its authors.

Papers must be submitted electronically in PDF format at
http://www.easychair.org/conferences/?conf=lacl2011

PROCEEDINGS

Accepted papers will be published in advance of the meeting as a
volume of the FoLLI LNAI subline of Lecture Notes in Computer Science
(LNCS) by Springer (http://www.springer.com/lncs).

INVITED SPEAKERS

To be announced.

PREVIOUS EDITIONS

A selection of the 1995 articles appeared in a special issue of the
Journal of Logic, Language and Information (7:4, 1998). The
proceedings of the international conferences LACL'96 ,LACL'97,
LACL'98, LACL'2001 and LACL'2005 appeared in the series Lecture Notes
in Artificial Intelligence (volumes 1328, 1582, 2014, 2099, 3492)
published by Springer.

IMPORTANT DATES

Paper submission deadline: February 6th 2011
Notification of acceptance: March 25th 2011
Camera-ready papers due: April 10th 2011
LACL conference: June 29th, 30th and July 1st 2011

CONTACTS

sylvain.pogodalla@inria.fr

Tuesday, February 1, 2011

ACM SIGBioinformatics

                                           ACM SIGBioinformatics  (Special Interest Group in Bioinformatics, Computational Biology, Biomedical Informatics) http://www.sigbioinformatics.org/  The ACM Special Interest Group on Bioinformatics, Computational Biology,  and Biomedical Informatics (SIGBioinformatics) has been established  since January 1, 2011 with the aim of focusing on research on bioinformatics  data management topics, roughly covered by the so-called biological and  bioomedical data, knowledge, and information management. The focus of  SIGBioinformatics is to bridge computer science, mathematics, statistics  with biology and biomedicine sharing research interests in the management  of data related to life sciences. The mission of ACM SIGBioinformatics is  to support advanced research, training, and outreach in Bioinformatics,  Computational Biology, and Biomedical Informatics by stimulating interactions  among researchers, educators and practitioners from related multi-disciplinary felds.  SIGBioinformatics membership rates: Researchers are invited to join and participate in SIGBioinformatics activities.  SIGBioinformatics membership is open to both ACM members and non-members. You can join at: https://campus.acm.org/public/qj/GenSIGQJ/siglist/gensigqj_siglist.cfm    Membership rates are: * Professional: 	 $25.00 * Students:	 $15.00 * Affiliate:	 $25.00 * Subscribers:	 $35.00  Professional and Student memberships refer to those who are already ACM Professional  or Student members, adding a SIGBioinformatics membership. Affiliate refers to any  non-ACM member who wishes to join SIG Bioinformatics, only. A subscriber is someone  who subscribes to the SIG Bioinformatics newsletter.  SIG Bioinformatics members will benefit for reduced registration fees at conferences  and workshops sponsored by SIGBioinformatics and conferences in cooperation with  SIGBioinformatics. One main conference sponsored by SIG Bioinformatics is:   ACM Conference on Bioinformatics, Computational Biology and Biomedicine (ACM-BCB) Chicago, Illinois, August 1-3, 2011 www.acmbcb.org

[DMANET] CALL FOR PAPERS - ADHOC NOW 2011 - Deadline Feb. 24

Apologies for cross-postings

--------------------------------------------------------------
CFP: ADHOC-NOW 2011
http://researchers.lille.inria.fr/~razafind/adhocnow2011/index.html
July 18-20, 2011, Paderborn, Germany
--------------------------------------------------------------

Since its creation in 2002, ADHOC-NOW has become a well-established and
well known international conference dedicated to wireless and mobile
computing. It serves as a forum for interesting discussions on ongoing
research and new contributions. The conference addresses both
experimental
and theoretical research in the areas of ad hoc networks, sensor networks,
mesh networks and vehicular networks. It focuses on all issues from link
layer up to the application layer. In 2011, ADHOC-NOW will for the first
time be organized in Germany, in the beautiful city of Paderborn. We seek
original contributions as work in progress, experimental and theoretical
research in Wireless Sensor, Ad-Hoc, Mobile and Wireless Networks.
Submissions must not be published or under review for another conference
or journal. We are interested, but not limited to, research papers in any
of the following areas:
-Mobile Ad Hoc Computing Platforms,Systems and Testbeds
-Mobile Social Networking
-Quality-of-Service
-Routing Protocols (Unicast, Multicast,etc.)
-Secure Services and Protocols
-Sensor and Actuator Networks
-Self-Configuration
-Service Discovery
-Time Synchronization
-Vehicular Networks
-Wireless Mesh Networks
-Wireless Internet
-Access Control
-Ad Hoc Networks of Autonomous Intelligent Systems
-Analytic Methods and Modeling for Performance Evaluation
-Ad Hoc Network Applications and Architectures
-Delay-Tolerant Networking
-Distributed and Localized Algorithms
-Energy Efficiency
-Geometric Graphs
-Location Discovery and Management
-Mobility Handling and Utilization

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

Program Chair
Hannes Frey (Univ. of Paderborn), DE
Xu Li (Univ. of Waterloo), CA

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

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

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

Web Chair
Tahiry Razafindralambo (INRIA), FR

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

[DMANET] Elsevier's COMCOM SI on Sensor and Robot Networks: Submission deadline is extended to Feb. 15, 2011

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

[Upon numerous requests, the submission deadline is extended to Feb. 15, 20
11.]

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: Feb. 15, 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/
*
**********************************************************

[DMANET] IEEE J-SAC SI on Cooperative Networking: new submission deadline, Feb. 15, 2011

[Our apologies if you receive multiple copies of this message]

Call for Papers
IEEE Journal on Selected Areas in Communications Cooperative Networking
Challenges and Applications

Cooperative networking has received significant attention recently as an
emerging network design strategy for future wireless networks. In
cooperative networking, individual network nodes can cooperate to implement
network goals in a coordinated way, and the cooperation can take place in a
cross-layer fashion. Successful cooperative networking can prompt the
development of advanced wireless networks to cost-effectively provide
multimedia services and applications such as telecommuting, video
conferencing, interactive media, real-time Internet games, etc., anytime,
anywhere. However, the impact and challenges of cooperative networking
on
the cross-layer design beyond cooperative transmissions are not
well-understood yet. Some fundamental aspects requiring immediate studies
include: theoretical tools to guide the design of cooperative networking
systems, effective incentive mechanisms for cooperation, new protocol design
for cooperative networking, and compatible deployment of cooperative
networking over the existing infrastructure.

This special issue aims at reporting the state-of-the-art research and
development on cooperative networking. Original, unpublished contributions
and invited articles, reflecting various aspects of cooperative networking
are encouraged. The topics of interest for the special issue include, but
are not limited to:

* MAC/link layer issues such as adaptive access connection and scheduling;
* Cooperative routing at the network layer, transport layer issues such as multi-homing transport layer
protocols, end-to-end flow and congestion
control;
* Application layer such as peer-to-peer system design over cooperative
networks;
* Cross layer design and optimization, and heterogeneous QoS provisioning;
* Topology control and mobility management;
* Resource management;
* Security support to complement/enhance cooperative networking;
* Information theoretic aspects, asymptotic performance analysis, coding
schemes and scaling law;
* System modeling and experimental study such as those in cellular network,
vehicular network, femtocell, and ad hoc/mesh network;
* System level topics such as incentive for cooperation, and economics issues
related to cooperative networks.

Prospective authors should prepare their manuscripts in accordance with the
IEEE J-SAC format described at http://www.jsac.ucsd.edu/Guidelines/info.html.
Authors should submit a PDF
version of their complete manuscript to
http://www.edas.info. The timetable is as follows:

* Manuscript submission: February 15, 2011
* First reviews complete: June 1, 2011
* Second reviews complete/all acceptance letters sent: August 1, 2011
* Materials to publisher: October 1, 2011
* Publication: 1st Quarter 2012

The Guest Editors for this issue are:
Xuemin (Sherman) Shen, xshen@bbcr.uwaterloo.ca
Qian Zhang, qianzh@cse.ust.hk
P.R. Kumar, prkumar@uiuc.edu
Are Hjxrungnes, arehj@unik.no
Zhu Han, zhan2@mail.uh.edu
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Papers: BIS-WSN 2011

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

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

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

NOTE: This workshop is a satelite workhop of the

2011 Genetic and Evolutionary Computation Conference (GECCO-2011)
July 12-16, Dublin, Ireland
http://www.sigevo.org/gecco-2011/

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

One Conference - Many Mini-Conferences 15 Program Tracks

PAPER SUBMISSION DEADLINE FOR WORKSHOP: April 7th, 2011

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

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

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

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

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

SCOPE AND TOPICS OF INTEREST

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

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

PAPER SUBMISSION

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

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

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

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

PROCEEDINGS

Accepted papers will be published in the ACM Digital Library

IMPORTANT DATES

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

WORKSHOP CO-CHAIRS

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

CONTACT INFORMATION

bis-wsn-2011@lsi.upc.edu

GECCO is sponsored by the Association for Computing Machinery Special
Interest Group on Genetic and Evolutionary Computation (SIGEVO). SIG
Services: 2 Penn Plaza, Suite 701, New York, NY, 10121, USA,
1-800-342-6626 (USA and Canada) or +212-626-0500 (Global).
**********************************************************
*
* 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 10th DIMACS Impl. Challenge: Graph Partitioning and Graph Clustering

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

(Apologies for cross-posting)

The Tenth DIMACS Implementation Challenge:
Graph Partitioning and Graph Clustering

http://www.cc.gatech.edu/dimacs10/

=== Call for Participation ===

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

On behalf of the Center for Discrete Mathematics and Theoretical
Computer Science DIMACS, the organizing committee invites
participation in an Implementation Challenge focusing on Graph
Partitioning and Graph Clustering. The Implementation Challenge
starts in February 2011 with the collection of testbeds.
Participants are invited to carry out research projects related
to the problem area and to present research papers at the
Challenge's workshop to be held in Atlanta (Georgia, USA)
on February 13/14, 2012. Refereed workshop proceedings will
be published in the AMS-DIMACS book series.

Motivation:

Graph partitioning and graph clustering are ubiquitous subtasks
in many application areas. Generally speaking, both techniques
aim at the identification of vertex subsets with many internal
and few external edges. To name only a few, problems addressed by
graph partitioning and graph clustering algorithms are: What are
the communities within an (online) social network? How do I speed
up a numerical simulation by mapping it efficiently onto a
parallel computer? How must components be organized on a computer
chip such that they can communicate efficiently with each other?
What are the segments of a digital image? Which functions are
certain genes (most likely) responsible for?

Goals:

The goals of the Implementation Challenge are (i) to determine
how algorithms depend on the structure of the underlying data
sets, (ii) to determine realistic algorithm performance, and
(iii) to obtain a reproducible picture of the state-of-the-art in
the area of graph partitioning and graph clustering algorithms.
To this end we are identifying a standard set of benchmark
instances and generators. Based on our initial proposals and
after a discussion with the community, we would like to establish
the most appropriate problem formulations and objective functions
for different applications.

Testbed:

We invite researchers from various application areas to provide
interesting data sets for graph partitioning and graph clustering
problems. Contributions could consist either of sample data sets
from a true application or of realistic instance generators
resembling practical data sets. Also, we invite the specification
of interesting objective functions based on real-world
applications. Our goal is to construct a modern library of test
problems reflecting current input sizes. The library will be
available for study both during and after the Challenge.

Developing Graph Partitioning and Graph Clustering Algorithms:

Algorithms may be developed for one or more categories (graph
partitioning / graph clustering, each with different objectives)
of the Challenge. Projects may involve either public domain or
proprietary codes. More details on the structure of the Challenge
will be announced later, please refer to the Challenge website
above.

How to Participate:

All information on the Challenge is available on the Challenge
website above. To register for the Challenge, please send an
email to dimacs-challenge-orga (at) cc.gatech.edu and register to the
participants' mailing list dimacs-challenge-10 (at) cc.gatech.edu.
Note that neither DIMACS nor the committee members can provide
financial support for research projects or machine cycles for the
experiments.

Committees:

The organizing committee consists of the coordinators David A.
Bader (Georgia Institute of Technology), Peter Sanders (Karlsruhe
Institute of Technology) and Dorothea Wagner (Karlsruhe Institute
of Technology), assisted by Henning Meyerhenke (Georgia Institute
of Technology). The advisory board members are Bruce Hendrickson
(Sandia National Laboratories), David S. Johnson (AT&T Labs -
Research), and Chris Walshaw (University of Greenwich).

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

ICLP-DC 2011 - Seventh ICLP Doctoral Student Consortium

**apologies for cross-posting**

---------------------------------------------------------------------------
---------------
ICLP-DC 2011

Seventh ICLP Doctoral Student Consortium
to be held in Lexington, Kentucky, USA at the occasion of ICLP
2011
July 6-10, 2011

http://cmt.math.unipr.it/iclp-dc-2011

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

Introduction

The ICLP Doctoral Consortium (DC) is the seventh doctoral consortium
to be offered as
part of the 27th International Conference on Logic Programming. The DC
follows the very
positive experience of the previous events held in Sitges (Spain) on
October 3rd,
2005, in Seattle (WA) on August 21st, 2006, in Porto (Portugal) on
September 8th, 2007,
in Udine (Italy) on December 10th, 2008, in Pasadena (USA) on July
15th, 2009 and in
Edinburgh (Scotland) on July 20th, 2010.

The DC will take place during the ICLP 2011 in Lexington, Kentucky
(USA). The Doctoral
Consortium is designed for doctoral students working in areas related
to logic and
constraint programming, with a particular emphasis to students
interested in pursuing a
career in academia. The Consortium is also open to exceptional
Master's students
developing MS Theses in Logic Programming. The Doctoral Consortium
aims to provide
students with an opportunity to present and discuss their research
directions and to obtain
feedback from peers as well as world-renown experts in the field.

General Information

The aims of the Doctoral Consortium are:

* To provide doctoral students working in the field of logic and
constraint programming
with a friendly and open forum to present their research ideas,
listen to ongoing work
from peer students, and receive constructive feedback.
* To provide students with relevant information about important
issues for doctoral
candidates and future academics.
* To develop a supportive community of scholars and a spirit of
collaborative research.
* To support a new generation of researchers with information and
advice on academic,
research, industrial, and non-traditional career paths.

The Consortium is designed for students currently enrolled in a Ph.D.
program, though we
are also open to exceptions (e.g., students currently in a Masters
program and interested
in doctoral studies). Students at any stage in their doctoral studies
are encouraged to
apply. Applicants are expected to be conducting research in the field
of Logic Programming;
topics of interest include (but are not limited to):

* Theoretical Foundations of Logic and Constraint Logic Programming
* Sequential and Parallel Implementation Technology
* Static and Dynamic Analysis, Abstract Interpretation,
Compilation Technology, Verification
* Logic-based Paradigms (e.g., Answer Set Programming, Concurrent
Logic Programming,
Inductive Logic Programming)
* Innovative Applications of Logic Programming

Submissions by students who have presented their work at a previous
ICLP Doctoral Consortia
are allowed, but should occur only if there are substantial changes or
improvements to the
student's work.

The Consortium allows participants to interact with established
researchers and with other
students, through presentations, question- answer sessions, panel
discussions, and invited
presentations. The Doctoral Consortium will provide the possibility to
reflect - through short
activities, information sessions, and discussions - on the process and
lessons of research and
life in academia. Each participant will give a short, critiqued,
research presentation.

Discussants:

Several renowned faculty members and researchers in the field of Logic
Programming will join in
evaluating the submission packets and will participate in the Doctoral
Consortium, providing
feedback to the presenters.

**Important Dates**

Submission Deadline: April 24th, 2011
Acceptance Notification: May 2nd, 2011
Last Date to Update Research Summary: May 8th, 2011 (tentative)
Doctoral Consortium: TBA July, 2011
ICLP 2011 Conference: July 6-10, 2011

*Submission Process*

*Application Process:

To apply for participation to the ICLP 2011 Doctoral Consortium,
prepare a submission package
consisting of a cover letter, a research summary, and a letter of
recommendation (e.g., from
your supervisor). The material should be submitted electronically, in
PDF format.

*Review Criteria:

The ICLP Doctoral Consortium review committee will select participants
based on their anticipated
contribution to the Consortium objectives. Participants typically have
settled on their thesis
directions and had their research proposal accepted by their thesis
committee. Students will be
selected based on clarity and completeness of the submission packet,
relevance of their research
area w.r.t. the focus of the ICLP Conference, stage of research,
advisor's letter, and evidence of
promise towards a successful research and academic career, such as
published papers or technical
reports.

*Award:

The ICLP Doctoral Consortium Discussants will review the submissions
to select the ones to be
presented. The organizing committee is actively seeking support to
offer scholarship packages to
accepted participants. We will update the web site as soon as we have
more information regarding
this.

*Submission Package

Send the submission package by e-mail to: iclp11dc@dbai.tuwien.ac.at.
Include the three documents
as separate pdf files in attachment.

All submissions must be in English. Submissions will not be considered
if they arrive after the
deadline. Your submission should not contain any proprietary or
confidential material.

Detailed instructions for each of the documents follow below.

*Cover Page:

Please include the following information in the cover page:

1. Statement of interest in participating in the Doctoral Consortium
2. Full name and School and Department in which you are earning
your doctorate degree
3. Contact information - address, telephone number, and email address
4. Title of your research and keywords pertinent to your research
5. The URL of your web page (if any)
6. Name of your supervising professor
7. Current stage in your program of study, e.g. (Master/PhD
student, start date)

*Research Summary:

Prepare your research summary as a PDF document, using either the same
format style as for the
regular submissions to ICLP 2011, or the Springer Verlag LNCS
Conference Publication Format.

Make sure to include your complete name, address and affiliation.

The body of your research summary should provide a clear overview of
the research, its potential
impact, and its current status. You are encouraged to include the
following sections:

1. Introduction and problem description
2. Background and overview of the existing literature
3. Goal of the research
4. Current status of the research
5. Preliminary results accomplished (if any)
6. Open issues and expected achievements
7. Bibliographical references

*Letter of Recommendation:

Include a letter of recommendation written by your Graduate Advisor or
Thesis Advisor. Please,
invite your advisor to include an assessment of the current status of
your thesis research and
an indication of the expected deadline for thesis submission. In
addition, your advisor should
indicate what she/he hopes you would gain from participation in the
Doctoral Consortium.

*Chairs

Alessandro Dal Palu'
Math Dept
Parma University, Italy

Stefan Woltran
Institute of Information Systems
TU Wien, Austria

Research Opportunities in Biological Computation at Microsoft Research Cambridge

Research Opportunities in Biological Computation

Microsoft Research, Cambridge, England (1st February 2011)

The Biological Computation Group at Microsoft Research is seeking to hire outstanding scientists to conduct research into uncovering fundamental principles of biological information processing. The overall aim of the group is to transform our understanding of how biological systems compute.

The group is studying biological systems across multiple scales and scientific domains, ranging from DNA computing and synthetic biology, through to developmental biology and immunology, tackling fundamental scientific questions in each domain. Current projects include designing molecular circuits made of DNA, and programming single cells that cooperate to perform complex functions over time and space. We also aim to understand the computation performed by cells during organ development, and how the adaptive immune system detects viruses and cancers in the human body, focusing on mechanism and function. We are tackling these questions through the development of computational models and domain-specific computational tools, in close collaboration with leading scientific research groups. The tools we develop are being integrated into a common software environment, which supports simulation and analysis across multiple scales and domains. Further information about the group is available at http://research.microsoft.com/biology , including links to our software tools, which are freely available for use by the scientific community.

We are seeking to hire outstanding scientists to undertake research in one or more of the following areas: fundamentals of biological computation, immunology, developmental biology, synthetic biology, DNA computing and neuroscience. Candidates should have a strong research background in one of these areas, or a background in computer science, engineering, maths or physics and have applied their work in biological modelling. Candidates with an experimental background should be able to demonstrate strong computational or mathematical expertise.

Candidates will be expected to develop collaborations with leading research groups, particularly experimentalists, and to publish their research in leading peer-reviewed scientific journals. However, the primary expectation is more ambitious: to make important contributions that enable fundamental progress in biological science.

The Biological Computation Group is part of Microsoft’s Computational Science Laboratory, which is well-resourced and also includes a Computational Ecology group together with expertise in software development. This is an exciting opportunity to join a young, dynamic team with excellent opportunities for growth in the future, including plans for state-of-the art wet lab facilities.

Postdoctoral positions are available for between two and three years, while permanent research positions are also available for more senior candidates. To apply, please complete the online application at https://research.microsoft.com/apps/tools/jobs/fulltime.aspx , preferably before February 28th. Any pre-application enquiries should be sent to Andrew Phillips (firstname.lastname@microsoft.com) with subject “Hiring”. Applications will be considered on receipt, and suitable candidates will be interviewed on an ongoing basis.

[DMANET] MIC 2011, 2nd Call for Papers

9th Metaheuristics International Conference

MIC 2011

25-28 July, 2011 in Udine, Italy

More details and up-to-date information at

http://mic2011.diegm.uniud.it

Scope of the Conference
========================

The Metaheuristics International Conference (MIC) series was established in 1995 and this is its 9th edition. MIC is the main event focusing on the progress of the area of metaheuristics and their applications. As in previous editions, MIC 2011 will provide an opportunity to the international research community in metaheuristics to discuss recent research results, to develop new ideas and collaborations, and to meet old friends and make new ones in a friendly and relaxed atmosphere.

MIC 2011 welcomes presentations that cover any aspects of metaheuristic research such as new algorithmic developments, high-impact applications, new research challenges, theoretical developments, implementation issues, and in-depth experimental studies. MIC 2011 strives for a high-quality program that will be completed by a number of invited talks, tutorials, and special sessions.

Relevant Research Areas
========================

MIC 2011 solicits contributions dealing with any aspect of metaheuristics. Typical, but not exclusive, topics of interest are:

+ Metaheuristic techniques such as tabu search, simulated annealing, iterated local search, variable neighborhood search, memory-based optimization, dynamic local search, evolutionary algorithms, memetic algorithms, ant colony optimization, variable neighborhood search, particle swarm optimization, scatter search, path relinking, etc.

+ Techniques that enhance the usability and increase the potential of metaheuristic algorithms such as reactive search mechanisms for self-tuning, offline metaheuristic algorithm configuration techniques, algorithm portfolios, parallelization of metaheuristic algorithms, etc.

+ Empirical and theoretical research in metaheuristics including large-scale experimental analyses, algorithm comparisons, new experimental methodologies, engineering methodologies for metaheuristic algorithms, search space analysis, theoretical insights into properties of metaheuristic algorithms, etc.

+ High-impact applications of metaheuristics in fields such as bioinformatics, electrical and mechanical engineering, telecommunications, sustainability, business, scheduling and timetabling. Particularly welcome are innovative applications of metaheuristic algorithms that have a potential of pushing research frontiers.

+ Contributions on the combination of metaheuristic techniques with those from other areas, such as integer programming, constraint programming, machine learning, etc.

+ Challenging applications areas such as continuous, mixed discrete-continuous, multi-objective, stochastic, or dynamic problems.

Important Dates
================

Submission deadline March 6, 2011
Notification of acceptance May 13, 2011
Camera ready copy May 27, 2011
Early registration June 6, 2011
Conference July 25-28, 2011

Submission Details
===================

We will accept submissions in three different formats.

S1) Original research contributions for publication in the conference proceedings of a maximum of 10 pages

S2) Extended abstracts of work-in-progress and position papers on an important research aspect of a maximum of 3 pages

S3) High-quality manuscripts that have recently, within the last six months, been submitted or accepted for journal publication

Accepted contributions of categories S1 and S2 will be published in the MIC 2011 conference proceedings. The proceedings will be assigned the ISBN 978-88-900984-3-7. Accepted contributions of category S3 will be orally presented at the conference, but not be included into the conference proceedings (neither in the post-conference proceedings).

The submission server is available at http://www.conftool.net/mic2011

Post-conference Publication
============================

It has become a tradition of MIC conferences to publish post-conference proceedings in an edited book. Authors of accepted papers in categories S1 and S2 (see submission details) are invited to submit improved and extended versions of their conference papers for publication in the MIC 2011 post-conference volume. The post-conference volume will appear in the Operations Research / Computer Science Interfaces series of Springer Verlag (confirmation pending).

Best Paper Award
=================

A best paper award will be presented at the conference. Only papers submitted in category S1 will be eligible for the best paper award.

Invited Talks
===============

There will be three invited talks at MIC 2011. The invited speakers are

- Holger H. Hoos, http://www.cs.ubc.ca/~hoos, University of British Columbia, Canada
Programming by Optimisation: Towards a new Paradigm for Developing High-Performance Software

- Andrea Lodi, http://www.or.deis.unibo.it/lodi.html, Alma Mater Studiorum - Universita degli Studi di Bologna, Italy
The heuristic (dark) side of MIP solvers

- Pascal Van Hentenryck, http://www.cs.brown.edu/~pvh, Brown University, USA
Meta-Heuristics for Last-Mile Disaster Preparedness and Recovery

Special Sessions
=================

The conference will integrate a number of special sessions. Currently confirmed are the following.

- Dynamic Optimization, organized by Amir Nakib and Patrick Siarry
- Hybrid Tree Search and Metaheuristic Algorithms, organized by Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini
- Matheuristics, organized by Karl Doerner, Vittorio Maniezzo, Celso Ribeiro, and Stefan Voss
- Metaheuristics in Employee Scheduling, organized by Dario Landa-Silva and Nysret Musliu
- Metaheuristics for Novel and Emerging Vehicle Routing Problems, organized by Jorge E. Mendoza, Christian Prins, Marc Sevaux
- Metaheuristics for Real Production Planning and Scheduling, organized by Ruben Ruiz
- Metaheuristics in Health Care Management and Services, organized by Ana Viana and Abdur Rais
- Methodologies for Heuristic Multi-Objective Optimization, organized by Walter Gutjahr and Frank Neumann
- Metaheuristics for Quadratic Binary Programs, organized by Fred Glover, Jin-Kao Hao, and Gary Kochenberger

The submission to the special sessions will be through the same submission site as for the main conference. For submission details and paper categories, we refer to the main submission information.

Conference Location
====================

The conference will be held in Udine, Italy. The conference site is Palazzo Antonini, the main site of the University of Udine. This is a 16th century palace in the city center of Udine.

Further Information
====================

Up-to-date information will be published on the web site http://mic2011.diegm.uniud.it. For information about local arrangements, registration forms, etc., please refer to the above-mentioned web site or contact the local organizers at the address below.

Conference Address
===================

MIC 2011 Organization
Luca Di Gaspero / Andrea Schaerf
DIEGM, University of Udine
via delle Scienze 208
33100 Udine, Italy
http://mic2011.diegm.uniud.it
mic2011@uniud.it
Fax: +39 0432 55 8251

MIC 2011 Conference Committee
==============================

Technical Program Chairs
Andrea Schaerf
Luca Di Gaspero
Thomas Stuetzle

Local organization
Sara Ceschia
Tommaso Urli
Luca Di Gaspero
Mirko Loghi
Andrea Schaerf
**********************************************************
*
* 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: Metaheuristics and Heuristics for heavily constrained hybrid Flowshop Problems

Metaheuristics and Heuristics for heavily constrained hybrid Flowshop
Problems

By Thijs Urlings

January 2011, 348 pages

Series: Dissertations in Artificial Intelligence (DISKI)

Volume: 331

ISBN 978-3-89838-331-8 (Akademische Verlagsgesellschaft AKA GmbH)

ISBN 978-1-60750-678-2 (IOS Press)

Description:

Many researchers agree about the existence of a gap between machine
scheduling literature on the one hand and scheduling in real-world
production environments on the other hand. This book aims to contribute
in diminishing this gap.
A hybrid flowshop problem with a combination of many constraints that
occur in reality, is addressed. An exact solution method is developed,
and some heuristics. Also, a number of metaheuristics is adapted to the
problem and several new ones are presented. Comparison is done,
enhancing statistical analyses. The solution representation appears to
have an important influence on the quality of the results.
Multiobjective scheduling is a common need in practice. For Pareto
optimisation in a hybrid flowshop, two algorithms and a complete
methodology for the comparison of approximation algorithms are
presented. From the obtained results, one can conclude that methods that
work well for relatively simple, theoretical problems do often not
behave so well for more complex real-life environments. Therefore,
research to this latter kind of problems is highly relevant.

For ordering details see the AKA website:

http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318

Dr. Thijs Urlings

Assistant Professor

Delft University of Technology

Innovation and Public Sector Efficiency Studies

T: +31 15 27 85538

F: +31 15 27 86332

E: t.h.urlings@tudelft.nl <mailto:t.h.urlings@tudelft.nl>

W: www.tudelft.nl/thurlings
<http://www.tbm.tudelft.nl/live/pagina.jsp?id=f9026b8d-01de-45ef-ace0-07
2fd644e447&lang=en>

------_=_NextPart_001_01CBC1ED.DE842EFB
Content-Type: text/html;
charset="us-ascii"
Content-Transfer-Encoding: quoted-printable

<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta http-equiv=Content-Type content="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 14 (filtered medium)"><style></style></head><body lang=NL link=blue vlink=purple><div class=WordSection1>Metaheuristics and Heuristics for heavily constrained hybrid Flowshop Problems<o:p></o:p>By Thijs Urlings<o:p></o:p><o:p> </o:p>January 2011, 348 pages<o:p></o:p>Series: Dissertations in Artificial Intelligence (DISKI)<o:p></o:p>Volume: 331<o:p></o:p><o:p> </o:p>ISBN 978-3-89838-331-8 (Akademische Verlagsgesellschaft AKA GmbH)<o:p></o:p>ISBN 978-1-60750-678-2 (IOS Press)<o:p></o:p><o:p> </o:p>Description:<o:p></o:p>Many researchers agree about the existence of a gap between machine scheduling literature on the one hand and scheduling in real-world production environments on the other hand. This book aims to contribute in diminishing this gap. A hybrid flowshop problem with a combination of many constraints that occur in reality, is addressed. An exact solution method is developed, and some heuristics. Also, a number of metaheuristics is adapted to the problem and several new ones are presented. Comparison is done, enhancing statistical analyses. The solution representation appears to have an important influence on the quality of the results. Multiobjective scheduling is a common need in practice. For Pareto optimisation in a hybrid flowshop, two algorithms and a complete methodology for the comparison of approximation algorithms are presented. From the obtained results, one can conclude that methods that work well for relatively simple, theoretical pr!
oblems do often not behave so well for more complex real-life environments. Therefore, research to this latter kind of problems is highly relevant.<o:p></o:p><o:p> </o:p>For ordering details see the AKA website:<o:p></o:p><a href="http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318">http://www.aka-verlag.com/loadtop/load.php?isbn=9783898383318</a><o:p></o:p><o:p> </o:p><o:p> </o:p>Dr. Thijs Urlings<o:p></o:p>Assistant Professor<o:p></o:p><o:p> </o:p>Delft University of Tech!
nology<o:p></o:p>Innovation and Public Sector Efficiency Studies<o:p></o:p>T: +31 15 27 85538<o:p></o:p>F: +31 15 27 86332<o:p></o:p>E: <a href="mailto:t.h.urlings@tudelft.nl">t.h.urlings@tudelft.nl</a><o:p></o:p>W: <a href="http://www.tbm.tudelft.nl/live/pagina.jsp?id=f9026b8d-01de-45ef-ace0-072fd644e447&lang=en">www.tudelft.nl/thurlings</a><o:p></o:p></div></body></html>
------_=_NextPart_001_01CBC1ED.DE842EFB--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Theory Announcements

Thursday, February 3, 2011

[DMANET] Junior Professorship (W1) Bioinformatics for High Throughput Technologies at FSU Jena

[DMANET] Workshop on Universal Algebra and Computer Science

[DMANET] Second Alpen-Adria workshop on Optimization

Erice School on "Graph Theory, Algorithms and Applications"

Erice School on "Graph Theory, Algorithms and Applications"

Wednesday, February 2, 2011

[DMANET] Postdoc in Theoretical Computer Science/Algorithms/Combinatorics at the University of Warwick

[DMANET] DNA 17 Call for Papers

[DMANET] CFP - IEEE MASS - Deadline March 20, 2011

Post-doc position in Databases at Hasselt University

[DMANET] Open Position at the Department of Computer Science at Braunschweig Institute of Technology

[DMANET] Open position at the Department of Computer Science at Braunschweig Institute of Technology

LACL 2011 - Last CFP

Tuesday, February 1, 2011

ACM SIGBioinformatics

[DMANET] CALL FOR PAPERS - ADHOC NOW 2011 - Deadline Feb. 24

[DMANET] Elsevier's COMCOM SI on Sensor and Robot Networks: Submission deadline is extended to Feb. 15, 2011

[DMANET] IEEE J-SAC SI on Cooperative Networking: new submission deadline, Feb. 15, 2011

[DMANET] Call for Papers: BIS-WSN 2011

[DMANET] CfP 10th DIMACS Impl. Challenge: Graph Partitioning and Graph Clustering

ICLP-DC 2011 - Seventh ICLP Doctoral Student Consortium

Research Opportunities in Biological Computation at Microsoft Research Cambridge

[DMANET] MIC 2011, 2nd Call for Papers

[DMANET] BOOK ANNOUNCEMENT: Metaheuristics and Heuristics for heavily constrained hybrid Flowshop Problems

Mailing Lists

Search This Blog

Blog Archive

Thursday, February 3, 2011

Wednesday, February 2, 2011

Tuesday, February 1, 2011

Mailing Lists

Subscribe To

Search This Blog

Blog Archive