[DMANET] Optimisation Events

The events described below may be of interest to some.

Regards,

Adam N. Letchford
Lancaster University, UK

-------------------------------------------------------------------------------------------------
1. LANCS International Workshop on Discrete and Nonlinear Optimisation, Cardiff, 13th-15th May

This workshop is being organised by Iskander Aliev, Joerg Fliege and Adam Letchford.  People will
be invited to submit abstracts on any aspects of discrete and nonlinear optimisation, whether
theoretical, algorithmic or applied. Abstracts that build connections between the two sub-fields
will be particularly welcomed.  Some prominent international key speakers will be invited.  For
more details, see:

http://www.lancs-initiative.ac.uk/page/189/Workshop-in-May-2013.htm

2. Summer School and Workshop on Polynomial Optimisation, Cambridge, 15th-19th July 2013

These events are being organised by Adam Letchford, Jean-Bernard Lasserre, Markus Schweighofer
and Joerg Fliege.  They form part of a four-week programme on polynomial optimisation, taking
place at the Isaac Newton Institute for Mathematical Sciences, Cambridge.  For more details, see:

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

[DMANET] Postdoc in Facility Location and Logistics

Postdoctoral Research Associate in Facility Location and Logistics
Kent Business School, University of Kent

Applications are invited for a 2-year fixed term position as a
postdoctoral researcher associate (PDRA) in the area of Facility
Location and Logistics starting in February 2013 (or soon thereafter).
The PDRA will join the Management Science group of the Kent Business
School. The PDRA will be expected to actively engage in basic research
as part of the Management Science group with the primary goal of
publishing in top operational research journals. The PDRA will have wide
latitude to help frame and design the specific programme of research.
Potential areas of investigation include but are not limited to facility
protection planning, robust supply chain systems, disaster management,
hub location, and energy and the environment. The post holder will
further assist in the preparation of grant applications and support the
general research culture of the Business School by organising and
delivering seminars.

Applicants are expected to hold a PhD in Operational Research /
Management Science, Mathematics, Computer Science or a closely related
discipline. The ideal candidate will have a firm knowledge of integer
programming and heuristic methods and a demonstrated interest in
facility location planning and logistics. Good computer programming
experience in C/C++, Java or similar, as well as excellent written and
communication skills, is essential. Applications will be assessed based
on relevant skills and previous publication record.

Salary: £31,020 - £35,938 (Grade 7)

How to Apply
Please see the link below to view the full job description and to apply
for this post.

http://www11.i-grasp.com/fe/tpl_kent01.asp?s=xgIfLQnAyPBgDdPyv&jobid=37082,3498483434&key=31871610&c=566234877821&pagestamp=seivcrrbvixcvifrve

Applications should include all of the following materials:

- A short cover letter explaining your specific interest in the research
project, relevant training and skills

- A curriculum vitae (CV)

- Names and contact information of two potential references who can
supply letters of support if short-listed for the position

If you require further information regarding the post or application
process please contact Louise Barlow at l.j.barlow@kent.ac.uk. Please
note applications must be made online via the University website.
Details sent directly via email will not be considered.

Informal enquiries may be directed by email to:

Dr Jesse O'Hanley at j.ohanley@kent.ac.uk

Completed applications should be received no later than: 23 November 2012

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

[DMANET] postdoctoral fellowship in Integer Programming (Univ. of Waterloo)

=====================================================================
The Department of Combinatorics and Optimization at the University of
Waterloo is seeking candidates for a one-year postdoctoral
fellowship, renewable for a second year in the area of Integer
Programming. Research will be conducted with Professor Ricardo
Fukasawa in theory and methodology for Integer and Mixed-Integer
Programming. Teaching is not a requirement, but can be arranged if
there is interest.

A Ph.D. degree in mathematics, computer science, optimization,
operations research or a related field is required.

Ideal candidates will have a strong theoretical background in Integer
Programming as well as experience in implementation of optimization
algorithms and use of commercial IP software and expertise in C/C++.
Interested individuals should apply using MathJobs
(http://mathjobs.org). Applications should include a curriculum
vitae, a short statement of research interests and goals, and three
reference letters.

To receive full consideration, applications must be received by Jan
12, 2013. After that date, applications will be accepted until the
position is filled.
=====================================================================
**********************************************************
*
* 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] IJRIE Call for Paper (Vol. 1, No. 3, December 2012)

CALL FOR Paper

Call for Paper of the International Journal of Research in industrial
Engineering (IJRIE).

Greetings and call for paper for Vol. 1, No.3.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science
Submissions open for Volume 1, Number 3, December 2012.

Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.

Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject

Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
Final paper submission should be done at E-mail: ijrie.admin@nvlscienc.com
Reviewer Response should be done at E-mail: ijrie.editor@nvlscience.com
Any query response should be done at E-mail: ijrie.info@nvlscience.com

We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Best Regards
IJRIE Office
www.nvlscience.com/index.php/ijrie


Please consider forwarding this call for papers to the appropriate groups
or
individuals.


Best Regards
IJRIE Office

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

from Alistair Sinclair: Simons Institute for the Theory of Computing; Announcements

The newly created Simons Institute for the Theory of Computing at UC Berkeley has recently posted the following announcements:

1. Details of programs for academic year 2013-14: http://simons.berkeley.edu

2. Research Fellow positions (application deadline Jan 15, 2013): http://simons.berkeley.edu/fellows.html
[Opportunities for outstanding junior scientists to spend one or two semesters at the Institute in academic year 2013-14, in connection with one of its programs.]

3. Call for program proposals (deadline Dec 15, 2012): http://simons.berkeley.edu/submit_proposal.html
[An invitation for groups of researchers to submit proposals for programs - typically one semester in length - to run at the Institute during Fall 2014, Spring 2015 or Fall 2015.]

[DMANET] PostDoc and PhD positions in approximation algorithms at IDSIA, University of Lugano

The Dalle Molle Institute (www.idsia.ch), University of Lugano (Switzerland), invites applications for

1) One postdoc position up to 3 years
2) One PhD student position (University of Lugano) for 3+1 years 


The positions are funded by the Swiss National Science Foundation
(Project Title: Approximation Algorithms for Machine Scheduling).

We are looking for outstanding candidates for one postdoc position and one PhD student position with excellent mathematical skills and with a background in computer science or mathematics (preferably with a specialization in one of the following topics: combinatorial optimization, discrete mathematics, approximation algorithms and computational complexity).

The selected candidates, together with the current Algorithms and Complexity group at IDSIA (visit http://algo.idsia.ch/), will try to attack some challenging open problems in scheduling theory.

Annual Postdoc salary: roughly 75,000 CHF (Swiss Francs) per year low taxes.
Annual PhD salary: roughly 45,000 CHF (Swiss Francs) per year, low taxes.
Application deadline: 30th November, 2012.

More details are available and the application procedure
is explained at www.idsia.ch/~monaldo/positions/positions.html

Please do not hesitate to contact Prof. Monaldo Mastrolilli (monaldo@idsia.ch) with
questions if you are interested in the position.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Postdoc Position at CTIC at Aarhus University

Postdoc Position at CTIC at Aarhus University
--------------------------------------------------------------------

CTIC (Center for the Theory of Interactive Computation) offers a postdoc position within the theory of computation and related areas at Aarhus University, Denmark, starting April 2013 or earlier.

We look for applicants committed to playing an active part in continuously building strong research collaborations between the computer science department at Aarhus University and IIIS at Tsinghua University, Beijing. In particular, the successful applicant will spend significant time at IIIS, with funding for such visits being part of the post doc position.

CTIC is a collaboration between the Computer Science Department at Aarhus University, Denmark and IIIS at Tsinghua University, Beijing, China. The center leaders are Andrew Chi-Chih Yao, Tsinghua University, and Peter Bro Miltersen, Aarhus University. The focus areas of CTIC are computational complexity theory, cryptography, quantum information theory and algorithmic game theory.

More information about CTIC can be found at the center website: http://ctic.au.dk/

To apply or to obtain further information before applying, please email ctic@cs.au.dk

[DMANET] Professorship and assistant professorship positions in Bordeaux

The engineering department of the University of Bordeaux is advertising two open positions in Operations Research: one professorship and one assistant professorship. The recrutees will join the INRIA team « RealOpt » doing research in Mathematical Programming, while being members of the Mathematics Institute of Bordeaux and the LABEX CPU created in the framework of the research excellence initiative. The candidates should have high profile research records in mathematical optimization: combinatorial algorithms, polyhedral and Lagrangian approaches, non linear mixed integer programming, constraint programming, or robust and stochastic optimization. An expertise in application areas such as networks, production planning, and scheduling, and in numerical experimentation are essential along with some inclination for industrial transfer.

Note that prior to applying, the candidates must obtain a qualification to enter the French educational system, by submitting a CV to the national council by December. However, registration for this procedure is urgent: it must be done y October 25, 4PM Paris time:
http://www.univ-perp.fr/fr/Enseignant_chercheur/procedure_de_qualification_pr_ou_mcf_annee_2010.html

For further information, please contact fv@math.u-bordeaux1.f

**********************************************************
*
* 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] NetSys 2013 - PhD Forum - Final Call for Submissions

Final Call for Submissions - please apologize multiple copies


***************************************
* Networked Systems 2013 *
* PhD Forum
*
* NetSys 2013, Stuttgart, Germany *
* March 11-15, 2013
*
*
*
* http://www.netsys2013.de *
***************************************

The doctoral colloquium at NetSys 2013 follows
the format of similar events at international
conferences such as PerCom, UbiComp, and Pervasive.
The aim is twofold. First, it should provide PhD
students in an early phase of their career with
the opportunity to discuss these with experts and
gain general feedback as well as specific comments
on their proposal. Second, this is an excellent
opportunity for a young researcher to start a
personal network with other PhD students as
well as with already established experts.

Format
------
The aim of the doctoral colloquium is to discuss research
ideas and PhD projects at different - typically - early
stages. The colloquium aims at a friendly atmosphere which
shall inspire the participants and put them - and their
research - in the focus. A panel of experts will discuss
the research based on a short presentation. Interactivity
and discussion are the goal.
In addition to the colloquium a presentation of all participants
at the main conference will take place as a poster session.
A brief introduction of the topics (One-Minute-Madness)
is used to attract conference participants.

Submissions
-----------
Prospective participants are required to submit three different
documents via email at phd-chair@netsys2013.de:

at the point of submission:

1. Research Statement: a two-page abstract that sketches the
research proposal of the PhD student, the contribution to
knowledge and how the research will advance the state of the art.

2. Curriculum Vitae: a one brief CV that lists the education,
research interests and - if available - publications.

at the point of acceptance:

3. a poster that will be presented at the conference

Chairs
------
Christian Becker (University of Mannheim)
Klaus Wehrle (RWTH Aaachen)

Important Dates
---------------
31.Oct.2012 submission
14.Dec.2012 notification

**********************************************************
*
* 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] LAGOS 2nd CFP, DEADLINE EXTENSION and financial support information.

LAGOS'13 - VII Latin-American Algorithms, Graphs and Optimization Symposium


Playa del Carmen, Mexico
April 22-26, 2013

http://xamanek.izt.uam.mx/LAGOS2013/
lagos2013@xamanek.izt.uam.mx


-- About the conference

LAGOS (the Latin-American Algorithms, Graphs, and Optimization
Symposium), is the merging of two Latin-American Conferences on these
subjects: GRACO (Brazilian Symposium on Graphs, Algorithms, and
Combinatorics) and LACGA (Latin-American Conference on Combinatorics,
Graphs, and Applications). The previous editions were held in
Fortaleza, Brazil (GRACO 2001), Santiago, Chile (LAGCA 2004), Angra
dos Reis, Brazil (GRACO 2005), Puerto Varas, Chile (LAGOS 2007),
Gramado, Brazil (LAGOS 2009), and Bariloche, Argentina (LAGOS 2011).


-- Important dates

New submissions deadline: October 31, 2012
New notification of acceptance/rejection: January 14, 2013
Conference dates: April 22-26, 2013

-- Conference themes

Themes include, but are not limited to, the following AMS classifications:

Algorithms: analysis of algorithms; approximation algorithms;
randomized algorithms; computational geometry.

Operations Research and Mathematical Programming: combinatorial
optimization; integer programming; polyhedral combinatorics;
operations research and management science.

Graph Theory: cliques, dominating and independent sets; coloring of
graphs and hypergraphs; covering and packing, factorization, matching;
digraphs, tournaments; graph algorithms; graphs and matrices;
hypergraphs; perfect graphs; random graphs; structural
characterization of types of graphs.

Applications: mathematical programming, combinatorial optimization,
continuous optimization, heuristics, and metaheuristics, applied to
real-world problems.


-- LAGOS Steering Committee

Thomas Liebling (EPFL, Switzerland)
Jayme Szwarcfiter (UFRJ, Brazil)

-- Invited speakers

Oswin Aichholzer (Technische Universität Graz, Austria)
József Balogh (University of Illinois at Urbana-Champaign, USA)
Flavia Bonomo (Universidad de Buenos Aires, Argentina)
Silvia Fernández-Merchant (California State University at Northridge, USA)
Ferran Hurtado (Universitat Politècnica de Catalunya, Spain)
Brendan D. McKay (Australian National University, Australia)
Luis Montejano (Universidad Nacional Autónoma de México, Mexico)
Jorge Urrutia (Universidad Nacional Autónoma de México, Mexico)
Yoshiko Wakabayashi (Universidade de São Paulo, Brazil)
Doron Zeilberger (Rutgers University, USA)

-- Instructions for Submissions

Extended abstracts. Authors are invited to submit an extended abstract
in English (up to 6 pages), containing original research results. The
authors are fully responsible of convincing the referees of the
correctness and interest of their results using only those six pages.
Authors can add an optional appendix with proofs, sketches of proofs,
or additional material. If included, the appendix will be read at the
discretion of the Scientific Committee and it is expected that it will
only be used to reach a decision for very unusual cases. The appendix
has no page limit, and since it will not be published, it cannot be
referenced in the extended abstract. Submission of a paper implies
that the work described has not been previously published (except in
the form of a short abstract or as part of a lecture or academic
thesis), that it is not simultaneously submitted elsewhere, and that,
if accepted, it will not be published elsewhere in the same form. A
special volume of Electronic Notes in Discrete Mathematics (ENDM) will
be dedicated to accepted extended abstracts. The extended abstracts
must comply with the ENDM LaTeX style and are limited to 6 pages,
including the front matter, text, and references. Instructions for
submission preparation may be obtained in the ENDM web page
(http://www.elsevier.com/locate/endm). Once prepared, the paper should
be submitted by means of the Easy Chair system
(https://www.easychair.org/conferences/?conf=lagos13).

Posters. Submissions of posters on all areas related to the symposium
are also solicited. Posters must also be submitted for review in the
form of an extended abstract formatted in the ENDM style
(http://www.elsevier.com/locate/endm), and must not exceed 2 pages in
length. Posters should also be submitted via the Easy Chair System
(https://www.easychair.org/conferences/?conf=lagos13). Accepted
posters will NOT appear in the ENDM special volume, but they will
appear in the symposium's booklet. Posters will be presented at the
symposium in a separate session.

Following the tradition of LAGOS, a special issue of Discrete Applied
Mathematics will be prepared after LAGOS'13. All authors of accepted
papers at the symposium are invited to contribute to this special
volume. The topics should relate to the central themes of the
symposium, but are not necessarily restricted to the presentations at
LAGOS'13. All articles will be refereed according to the standards of
Discrete Applied Mathematics.

-- Financial support

There will be a limited number of accommodation grants for students.
Preference will be given to those students presenting a talk or a
poster and, as a second criterion, to graduate students. Instructions
to apply to this support, will be given on the web page later.

-- Scientific Committee

Gilberto Calvillo (Universidad Nacional Autónoma de México, Mexico)
José Correa (Universidad de Chile, Chile)
Jesús De Loera (chair) (University of California, Davis, USA)
Guillermo Durán (UBA, Argentina; Universidad de Chile, Chile)
Friedrich Eisenbrand (École Polytechnique Fédérale de Lausanne, Switzerland)
Luerbio Faria (Universidade do Estado do Rio de Janeiro, Brazil)
David Fernández-Baca (Iowa State University, USA)
Carlos Ferreira (Universidade de São Paulo, Brazil)
Komei Fukuda (Eidgenössische Technische Hochschule Zürich, Switzerland)
Sylvain Gravier (Université Joseph Fourier, France)
Ilya Hicks (Rice University, USA)
Hiroshi Imai (University of Tokyo, Japan)
Marcos Kiwi (Universidad de Chile, Chile)
Matthias Köppe (University of California, Davis, USA)
Jesús de Loera (University of California, Davis, USA)
Vadim Lozin (University of Warwick, UK)
Martín Matamala (Universidad de Chile, Chile)
Eduardo Moreno (Universidad Adolfo Ibañez, Chile)
Graciela Nasini (Universidad Nacional de Rosario, Argentina)
Miguel Pizaña (chair) (Universidad Autónoma Metropolitana, Mexico)
Fábio Protti (Universidade Federal Fluminense, Brazil)
Iván Rapaport (Universidad de Chile, Chile)
Sergio Rasjbaum (Universidad Nacional Autónoma de México, Mexico)
Jorge Ramírez-Alfonsin (Université Montpellier 2, France)
Celso C. Ribeiro (Universidade Federal Fluminense, Brazil)
Gelasio Salazar (chair) (Universidad Autónoma de San Luis Potosí, Mexico)
Claudia Linhares-Sales (Universidade Federal do Ceará, Brazil)
Alejandro Torrielo (University of Southern California, USA)
Cid Carvalho de Souza (UNICAMP, Brazil)
Mario Valencia-Pabon (Université Paris 13, France)
Annegret Wagler (Université Blaise Pascal, France)
Andrés Weintraub (Universidad de Chile, Chile)
Mark Wilson (University of Auckland, New Zealand)
**********************************************************
*
* 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] Post-doc position: Development of Mechanism Design Theory for Sustainable Resrouce Allocation

%%%%%%%%%%%%%%%%%%%%%%
Post-doctoral position:
Development of Mechanism Design Theory for Sustainable Resource Allocation
%%%%%%%%%%%%%%%%%%%%%%

THE PRINCIPAL INVESTIGATOR:
Professor Makoto Yokoo: http://agent.inf.kyushu-u.ac.jp/~yokoo/
MAIN CO-INVESTIGATORS:
Professor Yukihiko Funaki: http://www.f.waseda.jp/funaki/index-e.html
Professor Michihiro Kandori: http://mkandori.web.fc2.com/
Professor Akihisa Tamura: http://www.math.keio.ac.jp/~aki-tamura/

THE PROJECT:
This project is funded by Grants-in-Aid for Scientific Research,
Japan Society for the Promotion of Science.
This project will develop the theory and mechanisms for optimizing
the allocation of precious resources, by synthesizing/extending
technologies from computer science and micro economics.
This project is carried out by an interdisciplinary research team
that consists of leading Japanese researchers in computer science and
micro economies. Specific research topics include automated mechanism
design, equilibrium analysis of repeated games based on POMDP,
concise representation schemes for cooperative games, mechanism
design for two-sided matching, combinatorial auctions, discrete
convex analysis, etc.

POSITION REQUIREMENTS:
The ideal candidate will have a PhD in a relevant discipline
(such as Artificial Intelligence, Computer Science,
Operations Research, Game Theory, Micro Economics),
and established track record evident by publication in top quality
conferences and/or journals. Expertise in one or more of the
following areas is a must: multiagent systems, algorithm,
combinatorial optimization, mechanism design, game-theory,
and micro economics.

PACKAGE:
The successful candidate will be employed by Kyushu University in
Japan, and will visit and collaborate with co-investigators.
The salary package is highly competitive (about $50k p/a + health
insurance). The position will be for an initial duration of 12
months, extendible (up to 4 years) depending on performance and
continuation.

SUBMISSION:
The postdoc position will be available from April 1, 2013.
The application process will remain open until the position is filled
by a suitable candidate.
Interested applicants should submit the following to
Professor Makoto Yokoo
(recruit <at> agent.inf.kyushu-u.ac.jp):
(1) Academic CV, including names and contact details of 2 referees.
(2) A 1-page "statement of interest", explaining the candidate's
interest in the project.
(3) Five "representative papers" describing the applicant's research.
If possible, please also include a link to a website with an online
version of your PhD thesis and relevant publications (e.g., your
professional homepage).

A confirmation will be sent when the application is received.
Incomplete or generic applications will be ignored.

FURTHER INFORMATION:
Please contact Professor Makoto Yokoo
(recruit <at> agent.inf.kyushu-u.ac.jp)
**********************************************************
*
* 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] IPDPS 2013 - Call for Workshop Papers, PhD Forum, and Commercial Participation

October 21, 2012 Release
---------------------------------------------
IEEE-IPDPS 2013 WORKSHOPS
See submission due dates in December and January

IPDPS 2013 PhD FORUM
Deadline for submissions is January 14, 2013

IPDPS 2013 COMMERCIAL PARTICIPATION
See details at http://www.ipdps.org/ipdps2013/2013_commercial.html

---------------------------------------------
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20-24 May 2012
www.ipdps.org
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
Hosted by Boston University
----------------------------------------------
In response to the IPDPS 2013 Call for Papers, 492 submissions were
received by the October 1, 2012 deadline and are under review. Authors
were invited to submit papers covering all areas of parallel and
distributed processing that address topics of interest in the four
areas of algorithms, applications, architecture and software. The
papers selected will be presented in technical sessions on Tuesday,
Wednesday and Thursday of the conference along with daily keynote
presentations.

GENERAL CO-CHAIRS
Martin Herbordt (Boston University, USA)
Charles C. (Chip) Weems (University of Massachusetts at Amherst, USA)
PROGRAM CHAIR
Sanjay Ranka (University of Florida, USA)
----------------------------------------------
PhD FORUM CO-CHAIRS
Luc Bougé (ENS Cachan, France)
Bo Hong (Georgia Institute of Technology, USA)
The PhD Forum offers graduate students an opportunity to present a
research poster describing their ongoing dissertation to the entire
IPDPS conference audience and to submit a short paper for publication.
The deadline for submissions is January 14, 2013. See details at
www.ipdps.org.

----------------------------------------------
LOCAL PARTICIPATION & COMMERCIAL CHAIR
Ayse Coskun (Boston University, USA)
IPDPS extends a special invitation to Boston area companies to
consider participation in IPDPS 2013 to share in the benefits of
associating with an international community of top researchers and
practitioners in fields related to parallel processing and distributed
computing. See details at
http://www.ipdps.org/ipdps2013/2013_commercial.html.

----------------------------------------------
WORKSHOPS CHAIR
Ümit V. Çatalyürek (Ohio State University, USA)

ABOUT IPDPS WORKSHOPS

IPDPS workshops, held on the first and last day of the conference, are
a major part of the IPDPS week-long family of events. These workshops
provide the IPDPS community an opportunity to explore special topics,
and the goal of the workshops is to present work that is more
preliminary and cutting-edge or that has more practical content than
the more mature research presented in the main symposium. Proceedings
of the workshops are published by the IEEE Digital Library and are
distributed at the conference.

Below is the list of workshops planned for 2013 in Boston with the due
dates for submission of manuscripts. Each is linked from the IPDPS
Webpage athttp://www.ipdps.org/ipdps2013/2013_workshops.html. Note
that all workshops have their own Website and Call for Papers and may
make changes in their submission requirements and due dates. Note that
most workshops have a due date for submissions later than the author
notification date of December 23rd for regular conference papers.

-------------------------------------------------------
MONDAY WORKSHOPS - May 20th, 2013
-------------------------------------------------------
HCW (7-Jan-2013)
--Heterogeneity in Computing Workshop
RAW (16-Dec-2012)
--Reconfigurable Architectures Workshop
HIPS (tba)
--High-Level Parallel Programming Models & Supportive Environments
NIDISC (6-Jan-2013)
--Nature Inspired Distributed Computing
HiCOMB (28-Dec-2012)
--High Performance Computational Biology
APDCM (26-Dec-2012)
--Advances in Parallel and Distributed Computing Models
CASS (6-Jan-2013)
--Communication Architecture for Scalable Systems
HPPAC (14-Jan-2012)
--High-Performance, Power-Aware Computing
HPGC (7-Jan-13)
--High-Performance Grid and Cloud Computing
ASHES (11-Jan-13)
--Accelerators and Hybrid Exascale Systems
EduPar (11-Jan-13)
--Parallel and Distributed Computing Education (NSF/TCPP Workshop)
PLC (tba)
--Multicore and GPU Programming Models, Languages and Compilers

---------------------------------------------
FRIDAY WORKSHOPS - May 24th
---------------------------------------------
PDSEC (31-Dec-2012)
--Parallel and Distributed Scientific and Engineering Computing
DPDNS (15-Nov-2012)
--Dependable Parallel, Distributed and Network-Centric Systems
MTAAP (13-Jan-2013)
--Multi-Threaded Architectures and Applications
LSPP (6-Jan-2013 )
--Large-Scale Parallel Processing
PCO (4-Jan-2013)
--Parallel Computing and Optimization
ParLearning (13-Jan-2013)
--Parallel and Distributed Computing for Machine Learning and
Inference Problems
HPDIC (1-Jan-2013)
--High Performance Data Intensive Computing
CloudFlow (9-Jan-2013 )
--Workflow Models, Systems, Services and Applications in the Cloud
JSSPP (tba)
--Job Scheduling Strategies for Parallel Processing
LSDSS (tba)
--Large Scale Distributed Service-oriented Systems
ViPES (21-Dec-2012)
--Virtual Prototyping of Parallel and Embedded 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/
*
**********************************************************

[DMANET] New book Data Correcting Approaches in Combinatorial Optimization

New book is published:

Data Correcting Approaches in Combinatorial Optimization

Series: SpringerBriefs in Optimization

Goldengorin, Boris, Pardalos, Panos M.

2012, 2012, X, 114 p. 41 illus.
Softcover
Information

ISBN 978-1-4614-5285-0
(net)
49,95 €

About this book

​​​​​​​​​​​​​​​​​Data Correcting Approaches in Combinatorial Optimization focuses
on algorithmic applications of the well known polynomially solvable
special cases of computationally intractable problems. The purpose
of this text is to design practically efficient algorithms for
solving wide classes of combinatorial optimization problems. 
Researches, students and engineers will benefit from new bounds
and branching rules in development efficient branch-and-bound type
computational algorithms. This book examines applications for
solving the Traveling Salesman Problem and its variations, Quadratic
Cost Partition and Its Special Case: Max-Cut Problem, Different
Classes of Allocation and Cluster Analysis  as well as some classes
of Scheduling Problems.
 
Extensive computational experiments with Data Correcting Algorithms 
show that, for example, the so called multilevel Data Correcting
Algorithm (DCA) for submodular function applied to the Quadratic
Cost Partition Problem is able to solve its benchmark instances
defined on dense graphs with up to 500 vertices within 10 min on a
standard PC. A single level DCA is included in MATLAB Toolbox for
submodular function optimization and maintained by Andreas Krause.

Content Level » Research

Keywords » algorithmics - cluster analysis - combinatorial
optimization - data correcting

Related subjects » Computational Science & Engineering - Mathematics -
Theoretical Computer Science

http://www.springer.com/new+%26+forthcoming+titles+%28default%29/book/978-1-4614-5285-0

**********************************************************
*
* 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] WSLST 2013: 1st announcement

2013 INTERNATIONAL WINTER SCHOOL IN LANGUAGE AND SPEECH TECHNOLOGIES

WSLST 2013

(formerly International PhD School in Language and Speech Technologies)

Tarragona, Spain

January 7-11, 2013

Organized by:
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University

http://grammars.grlmc.com/wslst2013/

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

AIM:

WSLST 2013 offers a broad and intensive series of lectures at different
levels on selected topics in language and speech technologies. The students
choose their preferred courses according to their interests and background.
Instructors are top names in their respective fields. The School intends to
help students initiate and foster their research career.

The previous event in this series was SSLST 2012:
http://grammars.grlmc.com/sslst2012/

ADDRESSED TO:

Graduate (and advanced undergraduate) students from around the world. Most
appropriate degrees include: Computer Science and Linguistics. Other
students (for instance, from Mathematics, Electrical Engineering, Logic, or
Cognitive Science) are welcome too.


The School is appropriate also for people more advanced in their career who
want to keep themselves updated on developments in the field.

There will be no overlap in the class schedule.

COURSES AND PROFESSORS:

- Simon King (U Edinburgh), Speech Synthesis [introductory/intermediate, 8
hours]
- Constantine Kotropoulos (U Thessaloniki), Pattern Recognition Problems
Related to Speech [intermediate, 6 hours]
- Lori Levin (Carnegie Mellon U), The Theory behind the Resources
[introductory/intermediate, 8 hours]
- Rainer Martin (U Bochum), Signal Processing for Voice Communication
Devices [intermediate, 8 hours]
- German Rigau (U Basque Country, Donostia), Knowledge Resources for
Semantic Processing [introductory/intermediate, 8 hours]
- Marc Swerts (Tilburg U), Facial Expressions in Human-Human and
Human-Machine Interactions [introductory/intermediate, 6 hours]
- Tomoki Toda (Nara Institute of Science and Technology), Statistical Voice
Conversion [introductory/advanced, 8 hours]

REGISTRATION:

It has to be done on line at

http://grammars.grlmc.com/wslst2013/Registration.php

FEES:

They are variable, depending on the number of courses each student takes.
The rule is:

1 hour =

- 10 euros (for payments until November 15, 2012),
- 12.50 euros (for payments between November 16 and December 11, 2012),
- 15 euros (for payments after December 11, 2012).

PAYMENT PROCEDURE:

The fees must be paid to the School's bank account:

Uno-e Bank
bank's address: Julian Camarillo 4 C, 28037 Madrid, Spain
IBAN: ES3902270001820201823142
SWIFT/BIC: UNOEESM1
account holder: C. Martin – GRLMC
account holder's address: Av. Catalunya 35, 43002 Tarragona, Spain

Please mention WSLST 2013 and your name in the subject. A receipt will be
provided on site.

Remarks:

- Bank transfers should not involve any expense for the School.
- People claiming early registration will be requested to prove that the
bank transfer order was carried out by the deadline.
- The organizers reserve the right to cancel a course if the number of
students who signed up for it is less than 10.
- Students will be refunded only in the case when a course gets cancelled
due to the unavailability of the instructor or because of insufficient
registration numbers.

People registering on site at the beginning of the School must pay in cash.
For the sake of local organization, however, it is much recommended to do it
earlier.

ACCOMMODATION:

Information about accommodation will be available on the website of the
School.

CERTIFICATE:

Students will be delivered a certificate stating the courses attended, their
contents, and their duration.

IMPORTANT DATES:

Announcement of the programme: October 19, 2012
Very early registration deadline: November 15, 2012
Early registration deadline: December 11, 2012
Starting of the School: January 7, 2013
End of the School: January 11, 2013

QUESTIONS AND FURTHER INFORMATION:

Lilica Voicu:
florentinalilica.voicu@urv.cat

WEBSITE:

http://grammars.grlmc.com/wslst2013/

POSTAL ADDRESS:

WSLST 2013
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34-977-559543
Fax: +34-977-558386

ACKNOWLEDGEMENTS:

Diputació de Tarragona
Universitat Rovira i Virgili

**********************************************************
*
* 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: ACM SIGMETRICS 2013 Pittsburgh, PA, USA, June 17-21, 2013.

(Please accept our apologies if you receive multiple copies of this message)

The abstract submission deadline is only 2 weeks away!

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Call For Papers
ACM SIGMETRICS 2013 -- International Conference on Measurement and
Modeling of Computer Systems
June 17-21, 2013
Carnegie Mellon University, Pittsburgh, PA, USA
http://www.sigmetrics.org/sigmetrics2013/
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

ACM SIGMETRICS 2013 solicits papers on the development and application
of state-of-the-art, broadly applicable analytic, simulation and
measurement-based performance evaluation techniques. Of particular
interest is work that presents new performance evaluation methods or
that creatively applies previously developed methods to make predictions
about, or gain insights into key design trade-offs in, computer and
networked systems. The main conference will be held from June 18-20,
2013. There will be workshops and tutorials on June 17, 2013. There
will also be workshops on June 21, 2013. Submission details will be
published shortly on this Web site. A rebuttal process will be piloted this
year to provide authors with the opportunity to clarify
misunderstandings perceived in the first round reviews.

The notion of performance is broadly construed – including
considerations of speed and scalability as well as reliability,
availability,
sustainability and manageability of systems. We encourage both
theoretical contributions and also submissions relating to real world
empirical studies or focusing on implementation and experimental issues.

Quantitative design and evaluation studies of:

* Computer and communication networks, protocols and algorithms
* Wireless, mobile, ad-hoc and sensor networks
* Computer architectures, multi-core processors, memory systems and
storage networks
* Operating systems, file systems and databases
* Virtualization and data centers
* Distributed and cloud computing
* Energy-efficient computing systems
* Real-time and fault-tolerant systems
* Mobile and personal computing systems
* Large-scale operational systems
* Software systems and enterprise applications
* Smart power grids
* Social networks, multimedia systems, service-oriented architectures
and Web services
* Emerging technologies

Methodologies, formalisms, solution techniques and algorithms for:

* Performance, scalability, power and reliability analysis
* Sustainability analysis and power management
* Capacity planning, resource allocation, run time management and scheduling
* Anomaly detection
* Analytical modeling techniques and model validation
* System measurement, monitoring and forecasting
* Workload characterization and benchmarking
* Quality of service, total cost of ownership and pricing
* Experimental design, statistical analysis, simulation
* Performance-oriented applications of game theory, economics, machine
learning, control theory, and signal processing

ORGANIZING COMMITTEE
General Chair: Mor Harchol-Balter, Carnegie Mellon University
PC Co-Chairs: John Douceur, Microsoft Research
Jun Xu, Georgia Institute of Technology
Workshop Chair: Cathy Xia, The Ohio State University
Tutorials Chair: Eno Thereska, Microsoft Research
Publicity Co-Chairs: Jia Wang, AT&T Labs - Research
Marc Lelarge, INRIA
Finance Chair: Alma Riska, EMC Corporation
Student Activity Chair: Urtzi Ayesta, CNRS
Publications Chair: Ton Dieker, Georgia Institute of Technology
Registrations Chair: Patrick Loiseau, Eurecom
Local Arrangements Chair: Nicole Stenger, Carnegie Mellon University
Webmaster: Anshul Gandhi, Carnegie Mellon University

IMPORTANT DATES
Abstracts due: November 2, 2012 (11:59PM EDT)
Full papers due: November 9, 2012 (11:59PM EST)
First-round reviews available: December 26, 2012
Rebuttals to reviews: January 4, 2013 (11:59PM EST)
Notification: February 11, 2013


TECHNICAL PROGRAM COMMITTEE
Tarek Abdelzaher, UIUC
Aditya Akella, University of Wisconsin
Urtzi Ayesta, LAAS-CNRS
Sem Borst, Bell Labs, TU/e, CWI
Niklas Carlsson, Linköping University
Giuliano Casale, Imperial College London
Lucy Cherkasova, HP Labs
Florin Ciucu, TU Berlin, Deutsche Telekom Labs
John Douceur, Microsoft Research
Ton Dieker, Georgia Tech
Do Young Eun, North Carolina State University
Zihui Ge, AT&T Labs
Garth Gibson, CMU
Leana Golubchik, USC
Ajay Gulati, VMware
Varun Gupta, University of Chicago
Charlie Hu, Purdue University
Canturk Isci, IBM T J Watson Research Center
Alain Jean-Marie, INRIA
Mike Kozuch, Intel Research Pittsburgh
Marc Lelarge, INRIA
Baochun Li, University of Toronto
Bill Lin, UCSD
Alex Liu, Michigan State University
John Lui, Chinese University of Hong Kong
Qin Lv, University of Colorado at Boulder
Richard Ma, National University of Singapore
Ishai Menache, Microsoft Research
Arif Merchant, Google
Vishal Mishra, Columbia University
Jason Nieh, Columbia University
Ana Radovanovic, Google
Rhonda Righter, UC Berkeley
Alma Riska, EMC Corporation
Philippe Robert, INRIA
Dan Rubenstein, Columbia University
Sujay Sanghavi, UT Austin
Saswati Sarkar, University of Pennsylvania
Karsten Schwan, Georgia Tech
Jiri Schindler, NetApp
Evgenia Smirni, College of William and Mary
Thrasyvoulos Spyropoulos, Eurecom
Christopher Stewart, Ohio State University
Y. C. Tay, National University of Singapore
Don Towsley, University of Massachusetts
Bhuvan Urgaonkar, Penn State University
Darryl Veitch, University of Melbourne
Milan Vojnovic, Microsoft Research
Jia Wang, AT&T Labs
Tom Wenisch, University of Michigan
Adam Wierman, CalTech
Carey Williamson, University of Calgary
Cathy Xia, Ohio State University
Jun Xu, Georgia Tech
Li Zhang, IBM T. J. Watson Research Center
Zhi-Li Zhang, University of Minnesota
Gil Zussman, Columbia University
Bert Zwart, VU University Amsterdam

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

[DMANET] Postdoc positions in Pilsen

POSTDOCTORAL RESEARCH POSITIONS
University of West Bohemia, Pilsen
----------------------------------

Two postdoctoral positions in the area of Discrete Mathematics are
available at the University of West Bohemia in Pilsen, Czech Republic.
The expected starting date is January 1, 2013, with contracts for up to
29 months. The postdoctoral fellows will be expected to actively engage
in research with members of the Pilsen Discrete Mathematics group.
Research will be supervised by Tomas Kaiser and by Zdenek Ryjacek,
respectively.

The calls can be found at:

http://nexliz.zcu.cz/sites/default/files/docs/VR/NEXLIZ-FAV-5_EN-Academician_research_assistant_(postdoc).pdf
(the position supervised by Zdenek Ryjacek, ryjacek@kma.zcu.cz) and

http://nexliz.zcu.cz/sites/default/files/docs/VR/NEXLIZ-FAV-2_EN-Academician_research_assistant_(postdoc).pdf
(the position supervised by Tomas Kaiser, kaisert@kma.zcu.cz).

For further details, see
https://nexliz.zcu.cz/en/node/24

or contact directly the supervisors at
Tomas Kaiser <kaisert@kma.zcu.cz>
Zdenek Ryjacek <ryjacek@kma.zcu.cz>

--

----------------------------------------------------------------------
Zdenek Ryjacek
Department of Mathematics
University of West Bohemia
Univerzitni 8
306 14 Pilsen, Czech Republic
e-mail: ryjacek@kma.zcu.cz
http://www.kma.zcu.cz/Ryjacek
----------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD position in Discrete Mathematics

PhD position in Discrete Mathematics

Umeå University is looking for a PhD candidate in the area of discrete
mathematics.

At the department of Mathematics and Mathematical Statistics there is an
active research group working in the areas of the Traveling Salesman
Problem, integer programming, Boolean satisfiability, hypergraphs,
Hamiltonian cycles and Latin squares. Possible areas of the PhD project
may be in the fields of graph theory, combinatorial optimization and
combinatorial game theory.

The applicant should have advanced implementation skills, e.g., in C++.

Furthermore the applicant should have good knowledge of the English
language and good writing skills.

The application should contain a CV, including academic grades and
relevant documentation.
Please also provide a personal letter of one A4 sheet describing yourself
and your reasons for applying for this position and give at least two
references (name, email and phone number) familiar with the applicant's
qualifications. Documents should be sent electronically as one
single PDF document.

Finally, a copy of the Master thesis should be added to the application as
one single PDF document.

For more information, contact

Gerold Jäger, +46-(0)90-786 61 41,
gerold.jaeger@math.umu.se<mailto:gerold.jaeger@math.umu.se>
Homepage: http://www.math.umu.se/english/staff/gerold-jaeger

or

Head of the Department Robert Johansson, +46-(0)90-786 93 65,
robert.johansson@math.umu.se<mailto:robert.johansson@math.umu.se>

The complete advertisement can be found at

http://www8.umu.se/umu/aktuellt/arkiv/lediga_tjanster/313-828-12.html

Your complete application, marked with reference number 313-828-12, should
be sent to jobb@umu.se (state the reference number as subject) or to the
Registrar, Umeå University, SE-901 87 Umeå, Sweden to arrive November 15,
2012 at the latest.









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

[DMANET] PostDoc or PhD position in Bioinformatics at the FSU Jena

English text see below.

Am Lehrstuhl für Bioinformatik, Institut für Informatik der
Friedrich-Schiller Universität Jena ist zum nächstmöglichen Zeitpunkt
die Stelle eines

Wissenschaftlichen Mitarbeiters (Post-Doktorand oder Doktorand)

zu besetzen. Diese Stelle wird Teil der Forschungsaktivitäten des
Lehrstuhls sein, siehe http://bio.informatik.uni-jena.de/research/.
Insbesondere soll der zukünftige Mitarbeiter in einem der drei Bereiche
IDUN (algorithmische Massenspektrometrie), 3AGC (Genome Rearrangements)
oder FlipCut supertrees (phylogenetische Supertree-Methoden) arbeiten.
Dies beinhaltet die Entwicklung und das Algorithm Engineering neuer
bioinformatischer Methoden und Algorithmen, sowie ihre Anwendung auf
reale Messdaten und die Gewinnung neuer biologischer Erkenntnisse.

Anforderungen für Doktoranden. Bewerber müssen über ein abgeschlossenes
Diplom- oder Master-Studium in den Bereichen Bioinformatik, Informatik
oder Mathematik verfügen, oder ein solches Studium in naher Zukunft
abschließen. Notwendig sind sehr gute Kenntnisse in Bereich Algorithmik
sowie Grundkenntnisse in den Bereichen Biologie und Molekularbiologie.
Wünschenswert sind Grundkenntnisse in einem der drei Anwendungsbereiche.
Die Projektarbeit erfordert gute Programmierkenntnisse, Erfahrung im
Bereich Software Design ist wünschenswert.

Anforderungen für Post-Doktoranden. Bewerber müssen über eine
abgeschlossene Promotion in den Bereichen Bioinformatik, Informatik oder
Mathematik verfügen, oder ihre Dissertation bereits eingereicht haben.
Für Post-Doktoranden zwingend erforderlich sind Vorarbeiten in einem der
drei oben aufgeführten Forschungsbereiche, nachgewiesen durch
Publikationen in Fachzeitschriften oder Konferenz-Proceedings.

Die Vergütung erfolgt gemäß Entgeltgruppe 13 TV-L, es handelt sich um
eine volle Stelle (für Post-Doktoranden) bzw. 3/4 Stelle (für
Doktoranden). Die Möglichkeit zur wissenschaftlichen Qualifikation wird
geboten. Die Stelle ist befristet.

Beiträge zur Lehre der Studiengänge Bioinformatik (Diplom, B.Sc., M.Sc.)
werden erwartet.

Schwerbehinderte werden bei gleicher Eignung, Befähigung und fachlicher
Qualifikation bevorzugt berücksichtigt.

Bewerbungen mit den üblichen Unterlagen (Lebenslauf, Publikationsliste,
Zeugniskopien) sind bis zum 19.11.2012 (vorzugsweise via EMail)
einzureichen bei:

Kathrin Schowtka

Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany

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

PostDoc/PhD students as a research associate (Wissenschaftliche Mitarbeiter)

This position will be part of the general research acitivities of the
chair, see http://bio.informatik.uni-jena.de/research/. In particular,
the applicant is expected to work in one of the areas IDUN
(computational mass spectrometry), 3AGC (genome rearrangements), or
FlipCut supertrees (phylogenetic supertree methods).

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, and basic knowledge in one of the three areas
(computational mass spectrometry, genome rearrangements, computational
phylogenetics). 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 preliminary studies in one of the three research
areas, 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). This position is a
temporary appointment.

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

Please send your application with the usual documents (CV, list of
publications, copies of certificates, preferred via email) until Nov
19th 2012 to:

Kathrin Schowtka

Friedrich-Schiller-Universität Jena
Institut für Informatik
Lehrstuhl für Bioinformatik
Ernst-Abbe-Platz 2
07743 Jena, Germany

http://bio.informatik.uni-jena.de/jobs/mitarbeiter/

--
Prof. Dr. Sebastian Boecker, Lehrstuhl fuer Bioinformatik
Institut fuer Informatik, Friedrich-Schiller-Universitaet Jena
Ernst-Abbe-Platz 2, 07743 Jena, Germany
Office 3405, Phone +49 (0)3641 9-46451, Fax +49 (0)3641 9-46452
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] Fellowships for doctoral candidates at Paderborn University

The International Graduate School "Dynamic Intelligent Systems" of Paderborn University (Germany) offers 3-year fellowships for doctoral candidates starting on April 1, 2013. The application deadline is November 30, 2012.

---------------------------------------------
The Graduate School "Dynamic Intelligent Systems" is run by the departments of Computer Science, Mathematics, Business Computing, Electrical Engineering and Mechanical Engineering. Its faculty consists of

Computer Science: Johannes Blömer (Codes and Cryptography), Marco Dorigo (Swarm Intelligence), Gregor Engels (Database and Information Systems), Holger Karl (Computer Networks), Uwe Kastens (Programming Languages and Compilers), Hans Kleine Büning (Knowledge-based Systems), Friedhelm Meyer auf der Heide (Algorithms and Complexity), Marco Platzner (Computer Engineering), Franz Rammig (Design of Distributed Embedded Systems), Wilhelm Schäfer (Software Engineering), Heike Wehrheim (Specification and Modelling of Software Systems)

Business Computing: Wilhelm Dangelmaier (Business Computing, esp. CIM), Leena Suhl (Decision Support & Operations Research Lab)

Mathematics: Michael Dellnitz (Applied Mathematics - Numerical Mathematics and Dynamical Systems), Eckhard Steffen (Graph Theory)

Mechanical Engineering: Jürgen Gausemeier (Product Engineering), Ansgar Trächtler (Control Engineering and Mechatronics)
------------------------------------------------
Further information is available on www.uni-paderborn.de/gs.

Applicants must hold a Master Degree (or equivalent) in Computer Science, Mathematics, Business Computing, Electrical Engineering, Mechanical Engineering or related fields.
Applications should be submitted electronically on http://pace.uni-paderborn.de/application.html) before November 30, 2012.

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

[DMANET] EvoCOP 2013: Call for Papers

** Apologies for multiple copies **

EvoCOP 2013 - 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation

3th - 5th April, 2012
Vienna, Austria

Part of EVO* 2013 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications


The 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics that are used to solve
difficult combinatorial optimization problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, simulated annealing,
tabu search, scatter search and path relinking, memetic algorithms, ant
colony and bee colony optimization, particle swarm optimization,
variable neighbourhood search, iterated local search, greedy randomized
adaptive search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.

The EvoCOP 2013 conference will be held in Vienna, Austria. The
conference will be held in conjunction with EuroGP (the 16th European
Conference on Genetic Programming), EvoBio (the 11th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (11th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.

For more information see the EvoCOP 2013 webpage
http://www.evostar.org/


Areas of Interest and Contributions

Topics of interest include, but are not limited to:


Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing

Publication Details

All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, and 7245 for the previous proceedings).

Submission Details

Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by at least three members of the
program committee. The authors of accepted papers will have to improve
their paper on the basis of the reviewers comments and will be asked to
send a camera ready version of their manuscripts. At least one author of
each accepted work has to register for the conference, attend the
conference and present the work.

The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.

Submission link: http://myreview.csregistry.org/evocop13/
Page limit: 12 pages

Important Dates
Submission deadline: 1. November 2012
EVO* event: 3-5 April 2013

Programme Chairs
Martin Middendorf (University of Leipzig, Germany)
middendorf(at)informatik.uni-leipzig.de
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)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/
*
**********************************************************