The ECCO XXVI - 2013 conference will be organized jointly by the
LAMSADE-CNRS UMR 7243 of the University Paris-Dauphine and the
laboratory CEDRIC of the Conservatoire National des Arts et Métiers (CNAM).

ECCO (European Chapter on Combinatorial Optimization) is a working group
of EURO (Association of European Operational Research Societies) that
provides an excellent opportunity to discuss recent and important issues
in Combinatorial Optimization and its applications with European
combinatorialists by organizing annual conference meetings.

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

in the Discrete Mathematics group at the Ilmenau University of Technology, Chair Matthias Kriesell. We are looking for a strong researcher (for example documented by an excellent PhD) in Combinatorial Optimization with close connections to Graph Theory and/or Theoretical Computer Science. The position includes teaching in English or German. The positions starts 1.10.2013, the deadline for applications is 31.3.2013.

**********************************************************
*
* 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, February 27, 2013

AIT Austrian Institute of Technology, the Austrian research institute with European format which focuses on the key infrastructure issues of the future, is looking to strengthen its team with the immediate appointment of a staff member in the area of transport logistics and optimisation.

The main tasks will be:
* Collaboration in national and international research projects
* Conception and close to market implementation of projects in the area of transport logistics
* Data analysis and simulation
* Liaison with cooperation partners from industry
* Project management

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

The Chair for Bioinformatics, Institute of Computer Science at the Friedrich-Schiller University Jena offers the following position:

PostDoc/PhD student as a research associate (Wissenschaftlicher Mitarbeiter)

The position is part of the project Parameterized Algorithmics for Bioinformatic, funded by the Deutsche Forschungsgemeinschaft. Scope of this project is to develop efficient algorithms for NP-hard bioinformatics problems, in particular using parameterized algorithmics. Focus of research is, besides developing such algorithms, also their implementation, evaluation, algorithm engineering, and biological case studies. Other methods for solving NP-hard optimization problems, such as Integer Linear Programming, will also be considered.

Requirements for PhD students: Applicants for this project must have or be about to obtain a Master's degree or a qualification equivalent to the German Diploma in bioinformatics, computer science, or mathematics. The applicant should have an very good background in algorithmics. Introductory course level knowledge or better in biology and molecular biology is required. Good programming skills are required, and experience in software design would be helpful.

Requirements for Postdocs: Applicants for this project must have a PhD in bioinformatics, computer science, or mathematics. It is required that the applicant has research experience in developing paramterized algorithms, preferably for bioinformatics problems, documented by publications in scientific journals or conference proceedings.

Salary is according to Entgeltgruppe 13 TV-L, either a full position (for PostDocs) or 3/4 position (for PhD students). These positions are temporary appointments.

Handicapped applicants will be given preference in case of equal qualifications.

A PhD fellowship to work on theory of constraint satisfaction is
available at the DTIC department, Universitat Pompeu Fabra
(Barcelona).
The candidate will work under the supervision of Dr. Victor Dalmau, on
the mathematical and algorithmic aspects of Constraint Satisfaction.
Applicants should have a master degree or equivalent and are expected
to have an strong academic background in logic, discrete mathematics,
algorithms, and/or computational
complexity. Interested applicants should contact Dr. Victor Dalmau,
Department of Information and Communication Technologies, Universitat
Pompeu Fabra.
email: victor.dalmau@upf.edu, url:www.tecn.upf.es/~vdalmau/**********************************************************
*
* 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/*
**********************************************************

Deadline for abstract submission: 10th March 2013
Deadline for registration: 10th March 2013

The 29th British Colloquium for Theoretical Computer Science will be
hosted by the Department of Computer Science, University of Bath,
from 24th to 27th March 2013.

The purpose of BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers.

We are pleased to announce that a further 6 fully-funded PhD Student
Bursaries are available, covering UK
travel, accommodation at the on-campus rate, and full registration.
It is easy to apply for one. Please see the website for details.

The scope of the colloquium includes all aspects of theoretical
computer science, including automata theory, algorithms, complexity
theory, semantics, formal methods, concurrency, types, languages and
logics. Both computer scientists and mathematicians are welcome to
attend, as are participants from outside of the UK.

The colloquium features both invited and contributed talks. This
year's invited speakers are

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

The Conference on Networked Systems (NetSys 2013) provides an
international forum for engineers and scientists in academia,
industry, and government to discuss innovations in the realm of
networked systems – including aspects of networking, distributed
systems, communications, middleware, and applications.

This biennial international conference is the successor of the
conference series Kommunikation in Verteilten Systemen (KiVS), which
was started more than 30 years ago and developed to the major
scientific event in German-speaking countries in the field of
communications and distributed systems.

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

The Business School at University of Applied Sciences Stralsund invites applications for a permanent position (W2-Professur):

Professor in Business Intelligence and Statistics

The position includes teaching for students of Business Informatics at bachelor and master level (mainly in German). Applicants should have a solid background in statistics and mathematics and practical experience in business intelligence applications.

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

The school will be held in Ekaterinburg, Russia on June 29 -- July 01, 2013.The topic of the school is "Algorithms and Complexity". The program willconsist of 4 short lecture courses as well as student presentations andposter sessions. Students are encouraged to submit not only published orcompleted research, but also a short summary of work in progress or even aconcise review of a problem area. The primary goal of submitting a paper,as we see it, is getting feedback from experts in complexity theory as wellas school lecturers and participants.

The school will be held right after the 8th International Computer ScienceSymposium in Russia (CSR 2013, June 25--29): http://csr2013.urfu.ru/Any participant of the school may arrive earlier and attend the talks ofthe CSR 2013 without paying the conference registration fee.

Application form: http://www.csedays.ru/theory2013/formDeadline: April 10, 2013*********************************************************** * 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/***********************************************************

It is with great pleasure that we announce the fifth AIMMS/MOPTA
Optimization Modeling Competition. The competition is jointly
organized by the conference organizers of MOPTA and Paragon Decision
Technology (http://www.aimms.com). Finalists are expected to attend
and present their results at the 2013 MOPTA Conference to be held
August 14-16, 2013 at Lehigh University, Bethlehem, PA, USA.

Teams of at most three students can participate. The team leader has to
be a graduate student, though the other members of the team can be
advanced undergraduate students. Each member of the team must be
registered as a full-time student at a recognized educational institution
during the Spring term of the 2012-2013 academic year. Students with a
background in optimization, regardless of their actual field of study, are
eligible. Collaboration between students from different departments is
strongly encouraged. Each team must declare a team advisor with which
the team may consult about the problem and their solution. It is the team
advisor's responsibility to ensure that the students have appropriate
knowledge for the competition. The team advisor should not be involved
as a participant in the solution process.

As the conference is international, so is the competition. Teams from all
over the world can participate, as long as at least one team member can
come to the conference, should the team make it to the final round. The
official language of the competition is English.

Luis F. Zuluaga,
Assistant Professor
Industrial and Systems Engineering
Lehigh University
**********************************************************
*
* 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/*
**********************************************************

The Metaheuristics International Conference (MIC) is a forum for the exchange of new algorithmic developments, high-impact and novel applications, new research challenges, theoretical developments, implementation issues, and in-depth experimental studies in metaheuristics.

- High-impact applications of metaheuristics in fields such as bioinformatics, data mining, planning and scheduling, telecommunications, logistics and supply chains, etc. Particularly welcome are innovative applications of metaheuristics that have a potential of widening research frontiers.

- Contributions on the interface of metaheuristics with other disciplines, such as agent-based models, integer programming, constraint programming, machine learning, etc.

- Challenging problems such as multi-objective, stochastic, or dynamic problems.

MIC2013 will feature refereed and invited presentations and panels on emerging issues that bring academic and industry participants together in dialogue. We plan to organize special sessions on Meta-Heuristics and Big Data Analytics, Meta-Heuristics and Constraint Programming, Dynamic Vehicle Routing, Distributed Problem Solving, Meta-Heuristics and Multi-Objective Optimization.

Invited are original full papers of up to 10 pages as well as extended abstracts of work-in-progress and position notes of up to 3 pages. Accepted papers will be published in the proceedings that will be available at the conference. In addition, a post-conference special issue of an appropriate journal (to be announced later) is planned to be published. Participants will be invited to submit extended versions of their work for consideration.

Submission Guidelines

Submitted papers must be formatted according to MIC 2013 guidelines and submitted electronically through the MIC 2013 paper submission site. Full instructions including formatting guidelines and electronic templates (both LaTeX and Microsoft Word) are available on the MIC 2013 website.

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

39th International Workshop on Graph-Theoretic Concepts in Computer Science, June 19-21, 2013, in Lübeck, Germany

Scope: WG conferences aim to connect theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas of computer science and by extracting new problems from applications. The goal is to present recent results and to identify and explore directions of future research. Submitted papers should describe original results in any aspects and areas of graph theory related to computer science, including but not restricted to

Submissions: Please submit your contribution via EasyChair:https://www.easychair.org/conferences/?conf=wg2013 The submission must not exceed 12 pages in Springer- Verlag Lecture Notes LaTeX style. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Simultaneous submission of papers to any other conference with published proceedings or submitting papers previously accepted for journal publication is not allowed. Only electronic submissions in PostScript or Portable Document Format (PDF) are accepted. Authors are encouraged to post full versions of their submissions in a freely accessible repository such as the arXiv or ECCC.

Proceedings: Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag.

Conference Website:http://www.informatik.uni-rostock.de/wg2013/*********************************************************** * 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, February 25, 2013

FIRST CALL FOR PAPERS
ISAAC 2013
The 24th International Symposium on Algorithms and Computation
December 16-18, 2013
The University of Hong Kong, Hong Kong
http://www.cs.hku.hk/isaac2013/

The 24th International Symposium on Algorithms and Computation (ISAAC 2013)
will be held in Hong Kong, December 16-18, 2013. The symposium is intended
to provide a forum for researchers working in algorithms and theory of
computation. Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant applied areas are
also welcome.

PUBLICATION
The proceedings will be published by Springer-Verlag in the LNCS
series. Selected papers will be invited to special issues of Algorithmica
and International Journal of Computational Geometry and Applications.

PAPER SUBMISSION
The submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a comparison with
related work. The main text, including title, abstract, and references,
should not exceed 11 pages in LNCS style. An optional appendix should be
used to provide proof details that do not fit in the main text. Submitted
papers must describe unpublished work. Authors should not submit papers
with the same results or essentially the same results that are accepted
or published or under review by a conference with refereed proceedings
or a journal. Only electronic submission will be allowed and only pdf
files will be accepted. It will be done via Easychair:
https://www.easychair.org/conferences/?conf=isaac2013

AWARDS
A Best Paper and a Best Student Paper may be awarded. A paper is eligible
for the Best Student Paper Award if all authors are full-time students
at the time of submission. To indicate that a submission is eligible,
please add the phrase "Eligible for the Best Student Paper Award" in
the abstract.

To allow for some delays in submission of papers to CALCO 2013, the
deadline has been moved by one week. See the new dates in the call for
papers below and at the CALCO'13 web page
http://coalg.org/calco13/

CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science.

It is a high-level, bi-annual conference formed by joining the
forces and reputations of CMCS (the International Workshop on
Coalgebraic Methods in Computer Science), and WADT (the Workshop on
Algebraic Development Techniques). Previous CALCO editions took place
in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy, 2009)
and Winchester (UK, 2011). The fifth edition will be held in Warsaw,
the capital of Poland.

We invite submissions of technical papers that report results of
theoretical work on the mathematics of algebras and coalgebras, the
way these results can support methods and techniques for software
development, as well as experience with the transfer of the resulting
technologies into industrial practice. We encourage submissions in
topics included or related to those listed below.

Prospective authors are invited to submit full papers in English
presenting original research. Submitted papers must be unpublished and
not submitted for publication elsewhere. Experience papers are
welcome, but they must clearly present general lessons learned that
would be of interest and benefit to a broad audience of both
researchers and practitioners. As with previous editions, the
proceedings will be published in the Springer LNCS series. Final
papers should be no more than 15 pages long in the format specified by
Springer (see http://www.springer.de/comp/lncs/authors.html). It is
recommended that submissions adhere to that format and
length. Submissions that are clearly too long may be rejected
immediately. Proofs omitted due to space limitations may be included
in a clearly marked appendix. Both an abstract and the full paper must
be submitted by their respective submission deadlines.

A special issue of the open access journal Logical Methods in Computer
Science (http://www.lmcs-online.org), containing extended versions of
selected papers, is also being planned.

For the first time, this edition of CALCO will feature two kinds of
awards: a best paper award whose recipients will be selected by the PC
before the conference and a best presentation award, elected by the
participants.

Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.

-- SATELLITE WORKSHOPS --

CALCO 2013 will be preceded by the CALCO Early Ideas Workshop, chaired
by Monika Seisenberger (Swansea University). The workshop is dedicated
to presentation of work in progress and original research
proposals. PhD students and young researchers are particularly
encouraged to contribute. Attendance at the workshop is open to all -
it is anticipated that many CALCO conference participants will want to
attend the CALCO Early Ideas workshop (and vice versa).

A workshop dedicated to tools based on algebraic and/or coalgebraic
principles, CALCO Tools, will be held alongside the main conference,
chaired by Lutz Schröder (Friedrich Alexander Universität
Erlangen-Nürnberg). Papers of this workshop will be included in the
CALCO proceedings.

-- CALCO Early Ideas Overview --

The CALCO Early Ideas Workshop invites submissions on the same topics
as the CALCO conference: reporting results of theoretical work on the
mathematics of algebras and coalgebras, the way these results can
support methods and techniques for software development, as well as
experience with the transfer of the resulting technologies into
industrial practice. The list of topics of particular interest is
shown on the main CALCO 2013 page.

CALCO Early Ideas presentations will be selected according to originality,
significance, and general interest, on the basis of submitted 2-page short
contributions. It can be work in progress, a summary of work submitted to a
conference or workshop elsewhere, or work that in some other way might be interesting to
the CALCO audience. A booklet with the accepted short contributions will be
available at the workshop.

After the workshop, authors will have the opportunity to submit
a full 10-15 page paper on the same topic. The reviewing will be carried out by
the CALCO Early Ideas PC, with the support of the CALCO PC. The volume of
selected papers will be available online. Authors will retain copyright, and are
also encouraged to disseminate the results by subsequent publication elsewhere.

CALCO-Tools will take place on the same dates as the main CALCO
conference, with no overlap between the technical programmes of the
two events. Topics of interest include systems, prototypes, and tools
developed specifically for the design, checking, execution, and
verification of (co)algebraic specifications, but also tools targeting
different application domains while making core or interesting use of
(co)algebraic techniques.

Tool submissions should not exceed 5 pages in LNCS format. The
accepted tool papers will be included in the final proceedings of the
conference. The tools should be made available on the web at the time
of submission. Each submission will be evaluated by at least three
reviewers; one or more of the reviewers will be asked to download and
use the tool. At least one of the authors of each tool paper must
attend the conference to demo the tool.

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

Eligible for the 2013 Ackermann Award are PhD dissertations in topics
specified by the EACSL and LICS conferences, which were formally
accepted as PhD theses at a university or equivalent institution between
1.1.2011 and 31.12.2012. The deadline for submission is 15 April 2013.
Submission details follow below.
Nominations can be submitted from 1 January 2013 on and should be sent
to the chair of the Jury, Anuj Dawar, by e-mail: anuj.dawar@cl.cam.ac.uk

The Award
The 2013 Ackermann award will be presented to the recipient(s) at the
annual conference of the EACSL (CSL'13), 2-5 September 2013, in Torino
(Italy). The award consists of

* a diploma,
* an invitation to present the thesis at the CSL conference,
* the publication of the laudatio in the CSL proceedings,
* travel support to attend the conference.

The jury is entitled to give more (or less) than one award per year.
Jury
The jury consists of:

1. the thesis (ps or pdf file);
2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
3. a supporting letter by the PhD advisor and two supporting letters
by other senior faculty or researchers in equivalent positions (in
English); supporting letters can also be sent directly to Anuj Dawar
(anuj.dawar@cl.cam.ac.uk);
4. a short CV of the candidate;
5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period
(scanned as pdf-file or faxed).

The submission should preferably be sent by e-mail as attachments to
professor Anuj Dawar:
anuj.dawar@cl.cam.ac.ukWith the following subject line and text:

Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text. Letters of support and documents can
also be faxed to:
Prof. Anuj Dawar
Ackermann Award
+44 1223 334678

The Jury has the right to declare submissions to be out of scope or not
to meet the requirements.

Dear colleagues,
I would like to draw your attention to our three-year PhD Studentship in
the Portsmouth Business School, starting 1 October 2013.

Topic:
The persistent surveillance problem consists of covering a particular
area of interest (AOI) in order to detect abnormal conditions. In
real-life applications, this problem is mainly found in the context of
security, for example, in airborne, land-based and sea-based border
surveillance scenarios. With differing conditions, vehicle constraints
may vary and, therefore, different conditions have to be taken into
account including motion and endurance constraints. The problem is
mainly solved by using default patterns to ensure a balanced coverage of
the AOI. This approach imposes the challenge of adapting to particular
scenario-dependent conditions including prioritised regions, obstacles
and non-regular shaped AOIs. The supervisory team has worked on the FP7
EU funded project SEABILLA (www.seabilla.eu), where one milestone has
been the design of an optimal routing algorithm for Unmanned Aerial
Vehicles (UAV) in a persistent surveillance mission. The routing must be
efficient (for example, minimise the distance travelled) and effective
(for example, maximise the detection rate of abnormal behaviour). This
problem has been solved under the assumption that all UAVs have the same
capabilities (speed, sensors range, turning angle, etc.). However, in
practice UAV fleet capabilities may vary which introduces an additional
substantial level of complexity.

This PhD project aims to extend our research in persistent coverage for
UAVs with a possible focus on:

• The integration of UAV platforms with different capabilities in the
coverage exercise.
• The incorporation of a learning-based concept that is able to adapt
the routing in accordance to the new suspicious categorised area by
learning from previously detected abnormal behaviour of maritime vehicles.
• The outline of a performance comparison of traditional pattern routing
and the new proposed approach.

Qualifications: Applicants will have a good first degree (minimum 2.1 or
equivalent) and ideally a Masters (or equivalent) in a relevant subject
area.

Enquiries relating to the topic should be directed to: Dr. Jana Ries
(jana.ries@port.ac.uk) or Dr Alessio Ishizaka (alessio.ishizaka@port.ac.uk)
Qualifications: Applicants will have a good first degree (minimum 2.1 or
equivalent) and ideally a Masters (or equivalent) in a relevant subject
area.

Applications should include:
• a full CV including personal details, qualifications, educational
history and, where applicable, any employment or other experience
relevant to the application
• contact details for TWO referees able to comment on your academic
performance
• a statement of 1,000 (words) outlining your proposed project,
identifying the objectives of the research and discussing how the work
will build on or challenge existing research in the above field.

Application Deadline: 19 April 2013
Interviews will be conducted on Thursday 23 May 2013.

Funding Status:The studentship will cover tuition fees and an annual
grant equivalent to that offered by the ESRC – set at £13,720 per annum
for 2013/14 for a maximum of three years. UK/EU residence eligibility
conditions apply.

There is a multitude of routing services that provide real time route planning capabilities based on current traffic observations. These services are based on an A-to-B basis and do not respect the current situation. However, this situation influences the possible routes and means of transport. Furthermore the personal preferences and the situation also have an influence on the chosen modes.
The topic of the project hence is to combine these two components:
1. Estimation and adaptation of individual mode choice preferences based on previous choices, situational context (determining the current choice set) and mobility history.
2. Ranking and thus recommendation of route/mode choice depending on the personal mobility profile based on provided route/mode alternatives.
Currently to the best of our knowledge no such service exists. The innovation here lies in the summarization of past observed behaviour for the ranking of alternative routes.

The work will include
+ the development of the models (of the mixed logit discrete choice type),
+ implementation of the estimation algorithms including appropriate online adaptation methods,
+ theoretical analysis of the properties of the resulting estimators,
+ development and implementation of the ranking algorithms
+ testing and validation of the methods on extensive data sets.
Special emphasis will be given to the identification and implementation of the choice set determination.

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