Friday, November 30, 2012

Assistant Professorships (Tenure Track) at ETH Zurich

Assistant Professorships (Tenure Track) in Computer Science

The Department of Computer Science (www.inf.ethz.ch) at ETH Zurich invites applications for assistant professorships (Tenure Track) in the areas of:

  • Computer Systems
  • Software Engineering (including programming languages)
  • Information Systems (with emphasis on Big Data)

For candidates with exceptional research accomplishments also applications for a full professorship will be considered.

The department offers a stimulating and well-supported research and teaching environment. Collaboration in research and teaching is expected both within the department and with other groups of ETH Zurich and related institutions.

Applicants should have internationally recognized expertise in their field and pursue research at the forefront of Computer Science. Successful candidates should establish and lead a strong research program. They will be expected to supervise Ph.D. students and teach both undergraduate level courses (in German or English) and graduate level courses (in English).

Assistant professorships have been established to promote the careers of younger scientists. The initial appointment is for four years with the possibility of renewal for an additional two-year period and promotion to a permanent position.

Your application should include your curriculum vitae, a list of publications, a statement of research and teaching interests and the names of at least three referees. The letter of application should be addressed to the President of ETH Zurich, Prof. Dr. Ralph Eichler. The closing date for applications is 15 January 2013. ETH Zurich is an equal opportunity and affirmative action employer. In order to increase the number of women in leading academic positions, we specifically encourage women to apply. ETH Zurich is further responsive to the needs of dual career couples and qualifies as a family friendly employer. Please apply online: http://www.facultyaffairs.ethz.ch/facultypositions/ap_computerscience

 

 

[DMANET] (no subject)

The LGI2A,Laboratory of Computer Science and Control Systems of University of Artois (Bethune, North of France) is seeking to fill a postdoctoral position in:

"Service Network Design in Supply Chain Systems"


for a 12 month contract to be filled as soon as possible.
Successful candidate will perform research on models of capacitated multi-commodity flow, routing and location and develop mathematical
models and efficient solution methods for real-life industrial applications (exact methods and heuristic approaches).


The salary will be around 2,000 euro per month (only roughly).
The research will be carried out in the group of "Systems Optimization" of LGI2A led by Prof. Gilles Goncalves.


LGI2A (www.lgi2a.univ-artois.fr/) offers a strong scientific support, a friendly environment and collaborative international environment.
Several international/EU industrial/research projects at LGI2A permit students and researchers to be in the middle of research
collaboration and help them to extend their network to their counterparts at other universities, academic institutes and
industries to develop their future career. Several meetings and plenary seminars will offer opportunity to students and researchers
to communicate and benefit from the others latest research results.


Bethune is a beautiful city located at the North of France (40 minutes North of Lille) in a very calm and quiet North-Western European region. It
will take 1 hour going to Brussels, 2 hour from London and 70 minutes to Paris by TGV trains.


Candidates must hold a PhD degree (or about to defend within a month) or equivalent in computer science, mathematics or a related area and
should have a solid knowledge of mixed integer programming, excellent programming skills, experience in decomposition methods (primal and
dual), metaheuristics, and algorithms. Other skills such as knowledge in probability theory and stochastic programming are beneficial.
Good communication skills and solid English writing skills are mandatory.

Knowledge of French is not required, but successful candidates will be encouraged to learn some basics.
Often there has been free French course offered to researchers and their family members by the University of Lille du Nord.

Interested applicants should send
their application containing
- cover and motivation letter
- curriculum vitae
- copies of PhD degree or attestation of defense from university
- summary of PhD thesis (English, about 1 pages)
- names and email addresses of at least two referees, including the thesis adviser
- candidate may choose to also provide complete thesis and any other scientific publications

Applicants are invited to submit the application by respecting the deadline of 10 December 2012 to:

Gilles Goncalves
Gilles.Goncalves@univ-artois.fr
and
Shahin Gelareh
Shahin.Gelareh@univ-artois.fr

if you have any questions regarding the positions or your application, please do not hesitate to contact the aforementioned emails (emails
should be destined to both).

Please put "[SGGG2012postdoc]" in your application email subjects.
**********************************************************
*
* 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] Reader (Associate Professor) / Professor in Management Science, University of Strathclyde Business School

***Apologies for cross-listing***

UNIVERSITY OF STRATHCLYDE
DEPARTMENT OF MANAGEMENT SCIENCE

READER/PROFESSOR


The Department of Management Science at the University of Strathclyde is seeking to recruit a Professor or Reader in Management Science/Operational Research (MS/OR). The post is designed to strengthen the Department's research base and contribute to the University's strategic ambition to be recognized as a leading technological university. The appointee will be a leading researcher in Management Science/Operational Research. We particularly welcome applications from, but are not limited by, those with an interest in the areas of health, energy or operations management. We seek individuals who have a strong methodological basis and have experience of translating theory to practice through collaborative research that engages with user groups. The department has a strong reputation in both theory and collaborative research, runs a popular Masters programme in MS/OR, and has a strong doctoral programme. It is part of Strathclyde Business School, one of the top ranking UK Business Schools.

MS/OR is a key area for the university in developing its Technology and Innovation Centre, an £89 million investment supported by Scottish Enterprise and the Scottish Funding Council. This centre links industry and public bodies with the university through programmes in Energy, Health and Advanced Manufacturing. MS/OR researchers contribute to each of these themes. Strathclyde's Technology and Innovation Centre sits alongside its other industrial research centres  and the UK's first Fraunhofer Centre. The university's innovative approach to industrial collaboration is one of the factors that have resulted in it being named UK University of the Year by THE. The university's rapidly developing industrial research collaborations offers tremendous opportunities for MS/OR researchers.

For further details and informal enquiries please contact Professor Susan Howick, susan.howick@strath.ac.uk; Tel: +44 141 548 3798.  Further information about the department is available at http://www.strath.ac.uk/mansci/.


For an application pack visit http://vacancies.strath.ac.uk or contact Human Resources, University of Strathclyde, Glasgow G1 1XQ. Tel. 0141 553 4133, quoting ref: JA/178/2012.  Full details of the position will appear on this website shortly.

Closing date: 18th January 2013

We value diversity and welcome applications from all sections of the community
The University of Strathclyde is a Registered Scottish Charity, No SCO15263


**********************************************************
*
* 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 position in theoretical computer science at EPFL

The theory group at EPFL has a postdoctoral position available. An ideal candidate should have a strong research track-record and willingness to work on important challenges in theoretical computer science. We have a focus on approximation algorithms, hardness of approximation and efficient exact algorithms and are willing to branch out to other topics as well.

The position is for one or two years, and comes with a competitive salary and generous support for scientific travel. In addition, EPFL, located in the heart of Europe, provides an active and stimulating research atmosphere with short- and long-term visitors. Ideally, the appointment should start in Fall 2013, but other starting dates might be also possible.

To apply, please send an email to ola + "dot" + svensson at epfl.ch with your curriculum vitae, research statement, and the names and addresses of three or more individuals who will provide letters of recommendation. Letter writers should email their letters directly to me. (Please make sure that your name is included in the subject line of each of the letters.)

To ensure full consideration, please apply by *December 30, 2012*.


For more information about our research please consult:

- http://theory.epfl.ch

- http://theory.epfl.ch/osven/

Moreover, any questions regarding the position can be sent to the above-mentioned email address.
**********************************************************
*
* 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 Positions in Discrete Optimization at MPI for Informatics

The Max Planck Institute for Informatics in Saarbrücken, Germany, is accepting
applications for

PhD Positions

to build up the research group "Discrete Optimization," headed by Andreas
Karrenbauer beginning in January 2013. The group will be supported by the Max
Planck Center for Visual Computing and Communication (www.mpc-vcc.org) and
closely integrated with the Algorithms and Complexity Department (Prof. Dr.
Kurt Mehlhorn).

The successful candidates will conduct research in one or more of the
following areas:
* Discrete Optimization Theory
* Discrete Optimization in Image Processing
* Applied and Industrial Discrete Optimization
* Algorithm Engineering

The positions are available from January 2013, for a duration of 2 years, with
the possibility for an extension.

Candidates must hold an excellent Diploma / Master's degree in mathematics,
computer science or a related area, and must have a very good knowledge of
discrete / combinatorial optimization and algorithm theory. Good programming
skills (C++) are mandatory (except for candidates with an outstanding
theoretical background).

The Max Planck Society seeks to increase the number of women in those areas
where they are underrepresented and therefore explicitly encourages women to
apply.

The Max Planck Society is further committed to employing more handicapped
individuals and particularly encourages these to apply.

Applicants should send by e-mail an application package containing a cover and
motivation letter, curriculum vitae, copies of diplomas, a summary of their
Diploma/Master's thesis (max. 2 pages in English or German), and the names and
e-mail addresses of two references (including thesis advisor) by December
15th, 2012, as a single pdf file attachment to Dr. Andreas Karrenbauer
(andreas.karrenbauer@mpii.de).

Applications received by the above date will receive full consideration;
however, the search will remain open until all positions are 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/
*
**********************************************************

Thursday, November 29, 2012

[DMANET] Reminder: Call for Papers: Special Issue on Matching under Preferences - Algorithms (ISSN 1999-4893)

Dear Colleague,

The following Special Issue will be published in Algorithms
(http://www.mdpi.com/journal/algorithms/, ISSN 1999-4893), and is now
open to receive submissions of full research papers and comprehensive
review articles for peer-review and possible publication:

Special Issue on Matching under Preferences
Website:
http://www.mdpi.com/journal/algorithms/special_issues/selected_papers_2012
Guest Editors: Dr. David Manlove and Dr. Péter Biró
Deadline for manuscript submissions: 31 December 2012
Scope: Matching problems involving preferences from an algorithmic
perspective. Topics of relevance include two-sided matching problems
with agents on both sides; two-sided matchings involving agents and
items; one-sided matching; and matching with payments

Article Processing Charges (APC) are waived for well prepared manuscripts
in this Special Issue.

You may send your manuscript now or up until the deadline.
Submitted papers should not have been published previously, nor be under
consideration for publication elsewhere. We also encourage authors to send
us their tentative title and short abstract by e-mail for approval to the
Editorial Office at algorithms at mdpi.com.

This Special Issue will be fully open access. Open access (unlimited and
free access by readers) increases publicity and promotes more frequent
citations as indicated by several studies. More information is available
at http://www.mdpi.com/about/openaccess/.

Algorithms (ISSN 1999-4893) is an open access journal of computer
science, theory, methods and interdisciplinary applications, data and
information systems, software engineering, artificial intelligence,
automation
and control systems, is published online quarterly by MDPI. It maintains a
rigorous and fast peer-review system and accepted papers are immediately
published online. Because it is an online and open access journal, papers
published in Algorithms will receive high publicity.

Please visit the website of Instructions for Authors before submitting a
paper at http://www.mdpi.com/journal/algorithms/instructions/.
Manuscripts should be submitted through the online manuscript submission
and editorial system at http://www.mdpi.com/user/manuscripts/upload/.

MDPI publishes several peer-reviewed, open access journals listed at
http://www.mdpi.com/. The Editorial Board members, including several
Nobel Laureates (http://www.mdpi.com/about/nobelists/), are all leading
active scholars. All MDPI journals maintain rapid, yet rigorous, peer-
review, manuscript handling and editorial processes. MDPI journals have
increased their impact factors, see "2011 Newly Released Impact Factors",
http://www.mdpi.com/about/announcements/235/.

In case of questions, please contact the Editorial Office at:
algorithms at mdpi.com

We are looking forward to hearing from you.

Kind regards,
Chelly Cheng
Assistant Editor of Algorithms

On behalf of the Guest Editors

Dr. David Manlove
School of Computing Science
University of Glasgow
Glasgow G12 8QQ
UK
Website: http://www.dcs.gla.ac.uk/~davidm/
E-Mail
: David.Manlove at glasgow.ac.uk

and

Dr. Péter Biró
Hungarian Academy of Sciences
Institute of Economics, Budapest
1112 Budaörsi út. 45., Hungary
Website: http://econ.core.hu/english/inst/staff.html
E-Mail: biro.peter at krtk.mta.hu


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

[DMANET] CiE 2013: The Nature of Computation, Milan, Italy, July 1-5, 2013

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

CiE 2013: The Nature of Computation
Logic, Algorithms, Applications

Milan, Italy
July 1 - 5, 2013

http://cie2013.disco.unimib.it

IMPORTANT DATES:

Submission Deadline for LNCS: 20 January 2013
Notification of authors: 4 March 2013
Deadline for final revisions: 1 April 2013


CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).


The Nature of Computation is meant to emphasize the special focus of
CIE13 on the unexpected and strong changes that studies on Nature have
brought in several areas of mathematics, physics, and computer science.
Starting from Alan Turing, research on Nature with a computational
perspective has produced novel contributions, giving rise even to new
disciplines.

Two complementary research perspectives pervade the Nature of
Computation theme. One is focused on the understanding of new
computational paradigms inspired by the processes occurring in the
biological world, while focusing on a deeper and modern understanding of
the theory of computation. The other perspective is on our understanding
of how computations really occur in Nature, on how we can interact with
those computations, and on their applications.


CiE 2013 conference topics include, but not exclusively:

* Admissible sets
* Algorithms
* Analog computation
* Artificial intelligence
* Automata theory
* Bioinformatics
* Classical computability and degree structures
* Cognitive science and modelling
* Complexity classes
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational biology
* Computational creativity
* Computational learning and complexity
* Computational linguistics
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* DNA computing
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Emerging and Non-standard Models of Computation
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of computation
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Machine learning
* Mathematical models of emergence
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural Computation
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebras and concurrent systems
* Programming language semantics
* Proof mining and applications
* Proof theory and computability
* Proof complexity
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Semantics and logic of computation
* Swarm intelligence and self-organisation
* Type systems and type theory
* Uncertain Reasoning
* Weak systems of arithmetic and applications

We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.

Contributed papers will be selected from submissions received by the
PROGRAM COMMITTEE consisting of:

* Gerard Alberts (Amsterdam) * Luis Antunes (Porto)
* Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris)
* Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape
Town, co-chair)
* Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa)
* Stephen Cook (Toronto ON) * Barry Cooper (Leeds)
* Ann Copestake (Cambridge) * Erzsebet Csuhaj-Varju (Budapest)
* Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan)
* Liesbeth De Mol (Gent) * Jerome Durand-Lose (Orleans)
* Viv Kendon (Leeds) * Bjoern Kjos-Hanssen (Honolulu, HI)
* Antonina Kolokolova (St. John's NF) * Benedikt Loewe (Amsterdam)
* Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin)
* Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt)
* Sonja Smets (Amsterdam) * Susan Stepney (York)
* S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam)

The PROGRAMME COMMITTEE cordially invites all researchers (European and
non-European) in computability related areas to submit their papers (in
PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013.
The submission site https://www.easychair.org/conferences/?conf=cie2013 is open.
We particularly invite papers that build bridges between different
parts of the research community.

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it
Website: http://cie2013.disco.unimib.it
************************************************************************

**********************************************************
*
* 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] 2nd CfP DEBS 2013

DEBS 2013: 7th ACM International Conference on Distributed Event-Based
Systems
Arlington, Texas, USA, June 29 - July 3, 2013

http://www.orgs.ttu.edu/debs2013/

The annual ACM International Conference on Distributed Event-Based
Systems (DEBS) provides a forum dedicated to the dissemination of
original research, the discussion of new practical insights, and the
reporting of relevant experience relating to event-based computing.
Event-based systems are rapidly gaining importance in many application
domains, ranging from real-time data processing in web environments,
logistics and networking, to complex event processing in finance and
security. The DEBS conference brings together researchers and
practitioners from these various communities to share their views and
reach a common understanding of current research work and open
challenges. The conference also provides a forum for facilitating the
exchange of ideas between academia and industry.

This year, DEBS is specifically encouraging submissions on the role,
importance and impact of events and event-based technologies in Big Data
systems and applications.

=== DEBS 2013 tracks:

- A Research Track featuring high-quality, peer-reviewed research papers.
- An Industry Track for systems and concepts and experience reports.
- A Tutorial Track geared towards both academia and industry.
- A Demonstration and Posters Track with practical demonstrations and
early work.
- A Grand Challenges Track to test research and commercial systems.
- A Doctoral Workshop.


=== DEBS 2013 Important Dates:

Grand Challenge Problem Description Posted:
January 21, 2013

Abstract submission for Research Papers, Industry Papers, and Industry
Experience Reports:
February 1, 2013

Research Paper, Industry Paper, and Industry Experience Report submission:
February 8, 2013

Tutorial Proposal submission:
March 15, 2013

Grand Challenge Solution with Paper submission:
April 12, 2013

Author notification for Research Papers, Industry Papers, Industry
Experience Reports, Grand Challenge Solutions, and Tutorials:
April 26, 2013

Poster, Demo, and Doctoral Workshop submission:
April 30, 2013

Author notification for Posters, Demos, and Doctoral Workshop:
May 8, 2013

Submission deadline for camera ready copies:
May 14, 2013

Conference:
June 29-July 3, 2013


=== Submissions

All submissions must be original and unpublished. Accepted papers will
be published by ACM and disseminated through the ACM Digital Library.

More information about the tracks and submission information can be
found on the DEBS 2013 website:

http://www.orgs.ttu.edu/debs2013/

=== Scope of the Conference

The topics addressed by the conference include (but are not limited to):

*** Models, Architectures and Paradigms

- Event-driven architectures
- Big Data (event-processing in Big Data)
- Internet of Things (event-processing in M2M)
- Basic interaction models
- Event algebras, event schemas and type systems
- Languages for event correlation and patterns, streaming and continuous
queries, data fusion
- Models for static and dynamic environments
- Complex event processing
- Design and programming methodologies
- Event-based business process management and modeling
- Experimental methodologies
- Performance modeling and prediction based on analytic approaches
- Functional Reactive Programming

*** Middleware Infrastructures for Event-Based Computing

- Federated event-based systems
- Middleware for actuator and sensor networks
- Algorithms and protocols
- Optimization techniques for event-based (or streaming) systems
- Event dissemination based on p2p systems
- Context and location awareness
- Fault-tolerance, reliability, availability, and recovery
- Security issues
- (Self-)Management
- Mobility and resource constrained device support
- Streaming queries, transformations, or correlation engines
- Logic-based event processing
- Semantic event processing
- Business Process Management with events

*** Applications, Experiences, and Requirements

- Use cases and applications of event-based systems
- Real-world application deployments using event-based middleware
- Domain-specific deployments of event-based systems
- Real-world data characterizing event-based applications
- Benchmarks, performance evaluations, and testbeds
- Application requirements for next-generation event-based solutions
- Relation to other architectures
- Enterprise application integration
- Event-driven business process management
- Information logistics
- Seamless integration of event-based mechanisms into middleware platforms

=== Organization:

General Co-Chairs:
Sharma Chakravarthy, The University of Texas at Arlington, USA
Susan D. Urban, Texas Tech University, USA

Program Co-Chairs:
Peter Pietzuch , Imperial College London, UK
Elke Rundensteiner, Worcester Polytechnic Institute, USA

Proceedings Chair:
Suzanne W. Dietrich, Arizona State University. USA

Industry Co-Chairs:
Alex Alves, Oracle, USA
Brian Connell, West Global, Ireland

Tutorial Co-Chairs:
Qingchun (Dustin) Jiang, Oracle, USA
Badrish Chandramouli, Microsoft Research, USA

Poster and Demo Co-Chairs:
Alexander Artikis, NCSR Demokritos, Greece
Raman Adaikkalavan, Indiana University South Bend, USA

Doctoral Workshop Co-Chairs:
TBD

Grand Challenge Co-Chairs:
Zbigniew Jerzak, SAP, Germany
Holger Ziekow, AGT International, Germany

Publicity Co-Chairs:
Ugur Cetintemel, Brown University, USA
David Eyers, University of Otago, New Zealand
Boris Koldehofe, University of Stuttgart, Germany

Industry Support Co-Chairs:
Nenad Stojanovic, FZI, Germany
Jonathan Goldstein, Microsoft Research, USA

Local Organization Co-Chairs:
Leonidas Fegaras, The University of Texas at Arlington, USA

Web Chair:
Samujjwal Bhandari, Texas Tech University, USA

Research Track PC:
see http://www.orgs.ttu.edu/debs2013/index.php?goto=pc

Industry Track PC:
see http://www.orgs.ttu.edu/debs2013/index.php?goto=ipc

**********************************************************
*
* 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] Academic positions: Computer Science, University of Liverpool, UK

University of Liverpool

The School of Electrical Engineering, Electronics and Computer Science

Appointments to various academic grades depending on research experience and vision.

Salary - Various, Closing Date 31st January 2013

The School brings together the disciplines of Computer Science and Electrical and Electronic Engineering. Since the formation of the School, posts have been created to develop new research activities as well as supporting existing core and interdisciplinary activities. There is a need to continue with our investment to strengthen and broaden our research activities in order to take full advantage of the developing research horizon. Therefore, we welcome applications from ambitious academics from all academic grades who would like to make significant contribution to the School and to play a major role in leading and shaping the research direction and who can make a contribution to the existing research excellence.

The School has existing research themes in the following areas: Multi-Agent Systems; Complexity Theory and Algorithms; Logic and Computation; Economics and Computation; Sensors, Diagnostics and Biomedical devices; Information and communications, and Energy Technology. There are also interdisciplinary research themes across the University to which the School is making a contribution (e.g. Computational Biology, Autonomous Systems, molecular electronics, risk and uncertainty, energy etc).

Recruitment is not restricted to existing research themes and candidates within the Computer Science and Electrical and Electronic Engineering research disciplines are welcome and encouraged to apply. The emphasis will be on selecting candidates who can demonstrate their existing research quality and who wish to develop it further and on candidates early on in their careers but who can demonstrate research potential.

Further information about the posts and preferred areas are given in the further particulars. Informal enquiries can be made to Professor J W Spencer, Head of School, by telephone 0151 794 4524 or email joe@liv.ac.uk, or to Professor L Gasieniec, Head of Department of Computer Science, by telephone +44 151 7954290, or email L.A.Gasieniec@liverpool.ac.uk. The information on how to apply will be available at http://www.liv.ac.uk/working/

Informal enquires concerning the research areas below should be directed to:

- Economics and Computation: Dr Piotr Krysta, email pkrysta@liverpool.ac.uk

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

[DMANET] PhD Positions at U. Edinburgh in Networks and Algorithms

PhD student positions in Networks, Algorithms and Geometry are available
at the Department of Informatics, University of Edinburgh. Applicants
should have interest in one or more of the following areas:

* Distributed algorithms, network protocols, sensor and mobile networks
* Computational geometry and topology
* Algorithms, graphs, streaming data

For more information, contact Dr Rik Sarkar (rsarkar@inf.ed.ac.uk) or
see http://homepages.inf.ed.ac.uk/rsarkar/positions.html

The research at Edinburgh School of Informatics is consistently ranked
as one of the top in the U.K. The historic city of Edinburgh is lively,
beautiful, and a great place to live. More information for students are
available at
http://www.ed.ac.uk/schools-departments/informatics/postgraduate and
http://www.ed.ac.uk/polopoly_fs/1.98591!/fileManager/pg-informatics-2013.pdf

For application procedures and positions, see
http://www.ed.ac.uk/schools-departments/informatics/postgraduate/apply/overview

Early applications are encouraged. Students from abroad (outside U.K.
and E.U.) who need funding, should complete the applications by December 14.


Rik Sarkar

Lecturer/Assistant Professor
School of Informatics
University of Edinburgh
Phone: +44 131 650 4444
email: rsarkar@inf.ed.ac.uk
Web: http://homepages.inf.ed.ac.uk/rsarkar/

--


The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

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

Tuesday, November 27, 2012

[DMANET] Postdoc position in TCS at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications
for a postdoctoral position in Theoretical Computer Science with a focus
on proof complexity and connections to SAT solving.

KTH is the leading technical university in Sweden, with education and
research spanning from natural sciences to all branches of engineering
including architecture, industrial management and urban planning. The
Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research
environment covering a wide range of research topics such as complexity
theory and approximation algorithms, computer and network security,
cryptography, formal methods and natural language processing. The group
has a consistent track record of publishing regularly in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.

We are seeking a postdoc for the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving.

This project aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
We are particularly interested in exploring the possibility of basing SAT
solvers on stronger proof systems than are currently being used. In order
to do so, however, a crucial step is to obtain a better understanding of
the corresponding proof systems, and in this context there are a number of
well-known and relatively longstanding open questions in proof complexity
that we want to study and try to solve. A more detailed description of the
project can be found at http://www.csc.kth.se/~jakobn/project-proofcplx.

The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. The group currently consists of one postdoctoral
researcher and two PhD students (in addition to the project leader).
Travel funding is included, and the group also receives short-term and
long-term visitors on a regular basis.

This is a full-time employed position for one year with a possible
one-year extension. The successful candidate is expected to start at the
latest in August-September 2013, although this is to some extent
negotiable.

To receive full consideration, applications should be received by January
14, 2013. More information and instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2012-0444-Eng.php. Informal
enquiries are welcome and may be sent to Jakob Nordstrom.


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

[DMANET] CfP special issue of Internet Mathematics "Searching and mining the Web and social networks"

Call for papers

Special issue of Internet Mathematics  "Searching and mining the Web and social networks"

The special issue of Internet Mathematics  "Searching and mining the Web and social networks" invites  original research papers on algorithmic and mathematical methods for search and mining in web and social networks.  The rapid growth and evolution in structure and content of the World Wide Web in recent years poses new algorithmic challenges in Web search. In addition, social networks (Facebook, Twitter, LinkedIn) gained enormous popularity in the last few years.  The active use of social networks spreads beyond their initial purposes making them important for political or social events.   Algorithmic analysis of Web and social networks is essential for the practical accessibility and efficient usage of the enormous amount of data available on the Web. Furthermore, mathematical analysis of network algorithms is vital for their justifiable improvement.

The special issue will publish high quality research articles, review papers, and position papers related to  theoretical and empirical analysis for  search and mining  of the (social) Web. The topics include but are not limited to the following:

*         Web mining
*         Graph algorithms, spectral methods
*         Visualization, patterns, communities
*         Personalized search and ranking
*         Ranking and machine learning for ranking
*         Clustering
*         Algorithmic methods for social network analysis and measurement
*         Modelling and monitoring of user activity in social web
*         Social media analysis
*         Citation networks
*         Social reputation, influence, and trust
*         Recommendation systems and voting systems

The papers should be prepared and submitted according to the general guidelines for authors of Internet Mathematics. Please use the option for the special issue submission.
http://www.tandf.co.uk/journals/UINM

Submission Dead-line (extended): January 15, 2013.
Acceptance decision: April 1, 2013
Special issue publication: early 2014

For any questions please feel free to contact the guest editors:
Sebastiano Vigna, University of Milano
Nelly Litvak, University of Twente
______________________________________________________
Dr. Nelly Litvak
Department of Applied Mathematics, Faculty EEMCS, University of Twente, P.O. Box 217, 7500AE, Enschede, The Netherlands
Tel: +31(53)4893388
Fax:+31(53)4893069

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

Monday, November 26, 2012

[DMANET] 10th Annual Conference on Theory and Applications of Models of Computation (TAMC13)

FIRST CALL FOR PAPERS: TAMC 2013
The 10th annual conference on Theory and Applications of
Models of Computation

University of Hong Kong, Pokfulam, Hong Kong

Important Dates
Submission deadline : 11:59 pm EST January 11, 2013
Notification of authors : late February or early March, 2013
Final versions deadline : to be announced soon

The TAMC proceedings will be published in the Lecture Notes in
Computer Science Series by Springer (http://www.springer.com/lncs).
Authors of accepted papers are expected to present their work
at the conference.

Post Conference Publications
Special issues of the journals Theoretical Computer Science and
Mathematical Structures in Computer Science devoted to a
selected set of accepted papers of the conference are planned.

Aims and Scope

TAMC aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of
the conference are computability, complexity, and algorithms. Typical
but not exclusive topics of interest include:

* algebraic computation
* algorithmic coding theory
* algorithmic number theory
* approximation algorithms
* automata theory
* circuit complexity
* computability
* computational biology, and biological computing
* computational complexity
* computational game theory
* computational logic
* computational geometry
* continuous and real computation
* cryptography
* data structures
* design and analysis of algorithms
* distributed algorithms
* fixed parameter tractability
* graph algorithms
* information and communication complexity
* learning theory
* natural computation
* network algorithms, networks in nature and society
* online algorithms
* optimization
* parallel algorithms
* privacy and security
* property testing
* proof complexity
* quantum computing
* randomness, pseudo-randomness
* randomized algorithms
* streaming algorithms

http://www.cs.hku.hk/tamc2013/call.htm


**********************************************************
*
* 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] 5 days left | book chapter abstracts | Media Convergent Divergence | Springer-Verlag

==========================================================================================
CALL FOR BOOK CHAPTER PROPOSALS (500 words)

Convergent Divergence? - Cross-Disciplinary Viewpoint on Media Convergence
Springer-Verlag, Germany

Artur Lugmayr, Cinzia Dal Zotto, and Gregory Ferrell Lowe Lowe (Eds.)

* 5 DAYS LEFT * * 5 DAYS LEFT * * 5 DAYS LEFT * * 5 DAYS LEFT * * 5 DAYS LEFT *


http://www.tut.fi/emmi/Submissions/2012ConvergenceBook/

++=========================================================================================

Upcoming Deadline: 1st December 2012 - intention to prepare a manuscript
Book Website: http://www.tut.fi/emmi/WWW/ameamain/2012convergence
Email List: https://listmail.tut.fi/mailman/listinfo/emmi-convergence
Submission System: http://www.tut.fi/emmi/Submissions/2012ConvergenceBook/
Contact us: emmi-convergence@listmail.tut.fi

Media Convergence happens on many levels and each of them implicates specific challenges and
priorities. Within the scope of this book, we focus on end-to-end convergence on various levels:
managerial, information systems, and end-consumers level. The book will especially shed light
into the complexity of the topic and act as a reference book and educational resource in this
field. The implementations of convergence strategies can only succeed when they take into
account the expectations and aspirations of every actor with a stake in the enterprise, including
content producers. Managers unanimously agree on the importance of human resources management
within the implementation process. This consideration implies that convergence is more than an
economic opportunity and needs to be understood as well as a focus of editorial strategy.
Convergence is often discussed at a rhetorical and political level. But how does convergence
actually happen, and does convergence lead to divergence? Media industry understands convergence
in ways that differ from the perceptions of consumers, who are clearly diverging in the ways they
consume media. Media managers are faced with the need to satisfy users? expectations and also
undertake convergence as an industrial strategy to achieve economies of scope & scale. Another
challenge lies in the development of information systems in media industries that support
convergence. Do these also lead to divergence? Does blurring the boundaries between the various
distribution platforms let media diverge from the consumer?s point of view? This book will
encourage an active discussion around this theme, taking multiple viewpoints into account: a
content creator perspective (journalistic or artistic), an information system perspective, the
consumer?s expectations, management and technological challenges, as well as market dynamics.
In conclusion, can all the challenges of convergence be solved, or does convergence lead to
further divergence.

==========================================================================================
Topics of Interest
==========================================================================================

------------------------------------------------------------------------------------------
Convergence Issues in the Media Industry and Media Organizations
------------------------------------------------------------------------------------------
o Media policy and regulatory challenges
o Cross-platform, cross-country, and converging media policies
o Convergence versus media market competition and concentration
o Media products demand and offer, consumers versus producers: diverging convergence?
o Convergence and managerial challenges in the media industries (TV, radio, news, publishing, music, online)
o Converging newsrooms, organizational and human resource development
o Convergence management and leadership
o Business models and strategies for converging media products and services
o Impact of social media on convergence processes
o Branding media in converging environments
o Marketing and advertising in converging environments
o Intellectual property rights and royalty management in convergence processes
o Quality and ethics in converging environments
o Management, leadership of projects and media organizations for convergence

------------------------------------------------------------------------------------------
Technological Convergence ? Media Business Information Management & Information Systems
------------------------------------------------------------------------------------------
o Media business information management for convergence
o Media information system design enabling convergence
o Business intelligence in converging media environments
o Knowledge management systems in converging environments
o Workflow management, operational efficiency and new capturing technologies producing converging services
o Operational efficiency and cost reduction of converging technologies
o Cross-media offering, distribution channels and convergence
o Home platforms, mobility, multi-play and network convergence
o Systems for management reporting, analysis, and decision support in converging environments
o Standards to enable technical convergence
o Data warehousing in converging environments
o Integration of analogue and digital media productions
o Mobile convergence
o E2E systems and solutions in converging media environments
o Production processes for convergence
o Asset management and metadata enabling convergence
o E2E systems, infrastructures and solutions
o Collaborative media productions and convergence
o Integration of analogue and digital media production and distribution

------------------------------------------------------------------------------------------
Convergence Issues from a Consumer, HCI, Experience Perspective
------------------------------------------------------------------------------------------
o Quality of Experience (QoE)
o Customer service/relation management (CRM) and analytics
o Audience and consumer research within convergence processes
o Convergence versus personalized and individualized media products offerings
o Convergence and consumer loyalty aspects, consumer targeting, niche audiences, and new revenue streams
o Changing aesthetics of media in times of convergence
o Human centred and user friendly computing and interaction
o New technologies for consumer studies and research
o User experience, user innovation and convergence
o User experience, user innovation and convergence
o Social impact
o Security and privacy in a converging environment
o Human computer interaction and experience design enabling convergence
o Understanding the audience, audience trends, and audience statistics in converging eco-systems
o and experience Tools, systems, theories, and techniques to understand, create and design interactivity

------------------------------------------------------------------------------------------
Convergence in Practice: Applications, Services, and Eco-Systems
------------------------------------------------------------------------------------------
o Converging service economy
o Convergence and sustainability
o Convergence project management
o Business information systems
o Convergence media industry projects (TV, movie, online, and print)
o Successful and unsuccessful case studies on media convergence
o End-to-end digital content
o Live events
o Etc.

We strongly welcome other topic suggestions dealing with convergence on a managerial,
information system, and consumer level beyond the topics suggested above.

==========================================================================================
Schedule & Deadlines
==========================================================================================
* 1st December 2012
Notification for intending to contribute with a book chapter to help us in the
review process planning of the book (author team, preliminary title, and very brief abstract of
max. 250 words)
* 31st January 2013
1st manuscript version (also authors who did not notify us to intend to contribute are invited
to submit)
* 1st March 2013
Review comments for 1st manuscript version and notification of acceptance
* 31st May 2013 2nd manuscript version that should include several review comments and final notification of
acceptance
* 1st July 2013 Final manuscript
==========================================================================================
Manuscript Preparation
==========================================================================================
* please follow the manuscript formatting guidelines below, and only submit the original version
(in Microsoft word) with the submission system
* each final manuscript should be 15-20 pages long (depending on the number of submissions longer
manuscripts will also be accepted)
* Please prepare your manuscript according the following guidelines:
http://www.springer.com/authors/book+authors?SGWID=0-154102-12-417900-0
* Manuscript submission website:
http://www.tut.fi/emmi/Submissions/2012ConvergenceBook/

==========================================================================================
Stay Informed
==========================================================================================
Email-list: https://listmail.tut.fi/mailman/listinfo/emmi-convergence
Questions: lartur@acm.org (please cc to: emmi-convergence@listmail.tut.fi)
Facebook: https://www.facebook.com/groups/ConvergentDivergence/


br,

Artur

--------------------------------------------------------------------------------------------------------------------------
Prof. Dr. Artur Lugmayr
Tel.: +358 (0)40 849 0773 or +358 (0)40 821 0558, Fax.: +358 3 3115 4680
artur.lugmayr@tut.fi, http://www.tut.fi/emmi/, http://www.facebook.com/artur.lugmayr, http://www.artur-lugmayr.info/, http://twitter.com/lartur#, www.ambientmediaassociation.org

Tampere University of Technology
Department of Business Information Management and Logistics
P.O. Box 541, Korkeakoulunkatu 8
FIN 33101 Tampere
FINLAND
**********************************************************
*
* 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: Healthcare special session, IESM13

Dear colleagues,

There will be a dedicated session on 'Healthcare Management and Engineering' in the forthcoming International Conference on Industrial Engineering and Systems Management (IESM 2013, Rabat, Morocco, http://www.iesm13.org/). The session potential topics include, but are not limited to:
- Home Heath care
- Lean HealthCare
- Capacity planning
- Day surgery (ambulatory surgery)
- Logistical supports
- Emergency

Hoping to see you at Rabat next year!

Best regards
Malek Masmoudi
Contractual Assistant Professor
University of Saint-Etienne, France


IESM 2013 - 5th International Conference on Industrial Engineering and Systems Management
Modelling, Optimisation and Simulation in Research and Industrial Applications:
Challenges and Opportunities

May 20-22, 2013 - Rabat, Morocco

All needed information are available on the Conference Website. Please visit http://www.iesm13.org/ for sessions proposals and topics of the conference.

IMPORTANT DATES
Proposal for special session/track: extended to November, 30th, 2012
Full paper (10 pages): extended to December 15th, 2012

Co-organized by
Mohammadia Engineering School (UM5A - Rabat - Morocco) And University of Valenciennes and Hainaut-Cambrésis (France)
Website: www.iesm13.org
Contact: contact@iesm13.org

Please feel free to further distribute this invitation also to possibly interested colleagues and students.
We apologize in case of any multiple receipt of this message.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, November 25, 2012

[DMANET] Postdoctoral Research Position: Optimizing Port Supply Chains

The University of Newcastle, Australia, invites expressions of
interest for Postdoctoral Research Fellowships in the area of theory
and algorithms for optimization of integrated supply chains,
starting early in 2013, or as soon as possible subject to applicant
availability.

Fellowships are available for 1 or 2 years, with possible 1-year extensions.
The salary will be in the range of AU$63,572-$79,915 per annum,
depending on the skills and experience of the applicant. There is also
provision for a relocation allowance, and for additional funds to
support travel to conferences both overseas and within Australia during
the period of the fellowship.

The successful applicant will hold a PhD in operations research,
engineering, mathematics, computer science, or related discipline.
Strong optimization and computer programming skills are essential. A
knowledge of constraint programming and/or artificial intelligence
techniques would be an asset.

Expressions of interest are preferred before December 1, 2012, however
later interest will be considered until the position is filled. To
express your interest in a fellowship please send your CV, together
with an academic transcript showing details of all courses you have
taken, the grades you were awarded, an interpretation of those grades,
and the names and contact details of at least two people who can
provide confidential references, to Daniel Urquhart at the address
shown below. If your transcript is not in English, please provide an
English translation. Please feel free to include a link to your PhD
thesis, and/or include other publications in your email. Include
details of your computer programming skills and experience, your
optimization training and background, and any experience you have with
modelling and solving industrial problems. Please also indicate your
possible start dates.

The project will be funded under an Australia Research Council (ARC)
Linkage Grant with industry support from the Hunter Valley Coal
Chain Coordinator (HVCCC - www.hvccc.com.au) and Triple Point
Technologies (TPT - www.tpt.com).

The export of coal is a critical economic activity in Australia.
However the logistics of getting the coal from mine to port is
highly complex, involving solution of numerous interrelated planning
and scheduling problems. For example, trains must be scheduled on
tightly capacitated rail lines, equipment for stacking and
reclaiming coal from stockpiles must be scheduled, and the layout of
the stockpiles themselves must be planned. This project will
investigate the optimization of key planning activities in the
export coal supply chain, and seek to develop effective algorithms
for their solution.

The postdoctoral fellows will join a research team of several
faculty, research fellows and PhD students working on this project,
under the supervision of Professors Natashia Boland and Martin
Savelsbergh.

The University of Newcastle is a major research university in
Australia, increasingly recognised internationally as a rapidly
emerging educational institution. The main campus is located in the
city of Newcastle: on the coast about two hours drive north from
Sydney. The School of Mathematical and Physical Sciences provides a
stimulating and supportive environment for research and teaching,
with ample opportunities for collaborative research partnerships
both within the university and with industry. Although well known
for its beautiful beaches and pleasant climate, Newcastle is home to
Australia's (and the world's) largest coal exporting port. Newcastle
is also at the gateway of one of Australia's largest wine-growing
regions, the Hunter valley. Thus opportunities for research in
shipping, transportation, and mineral resources abound.

The School includes a strong group in Operations Research, with a
number of faculty, research fellows, and current PhD students
working in areas such as mixed integer programming, mixed integer
nonlinear programming, supply chain logistics, transportation
optimization, and health systems optimization. The group has strong
collaborations with colleagues in computer science working with
evolutionary algorithms. It also has close research links with
first-class international institutions and excellent support from
industry and government research funding.

For further information on the School and the University, go to
http://www.newcastle.edu.au/school/mathematical-physical-sciences/
or http://www.newcastle.edu.au/. For further information about
Newcastle, Australia, refer to sections below, or visit
http://www.visitnewcastle.com.au/visitnewcastle.asp. Further
information can be obtained by contacting Daniel Urquhart below.

Main contact:
Daniel Urquhart
School of Mathematical and Physical Sciences
The University of Newcastle
T: +61 2 4921 5440
E: Daniel.A.Urquhart@newcastle.edu.au
**********************************************************
*
* 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 at The University of Newcastle

The University of Newcastle
Australian Postgraduate Award (Industry)
PhD scholarship

The School of Mathematical and Physical Sciences at the University of
Newcastle is offering an APA(I) scholarship worth AUD $28,715 per
annum.
The scholarship will be funded under an ARC Linkage Grant, and is
collaborative with researchers in Computer Science & Software
Engineering at the University of Melbourne, and with Newcastle-based
companies Hunter Valley Coal Chain Coordinator Limited (HVCCC)
www.hvccc.com.au ( http://www.hvccc.com.au/ ) and Triple Point
Technologies (TPT) www.tpt.com ( http://www.tpt.com/ ).
Applications for this APA(I) scholarship close 1 December 2012.

Project Background

Blended mineral products are important for Australia's economy.
Blending is carried out in stockpiles, often at multiple points in the
mining supply chain, and complexities in stockyard and supply chain
operations can negatively impact the value sought from blending.
Whilst blending has long been tackled with mathematical programming
techniques, little has been done to integrate blending with stockyard
management
and supply chain planning.
This project will develop new mathematical and computational tools for
operational stockyard and supply chain planning, to maximize the value
realised from blended products, and the efficiency with which they are
delivered through the supply chain.
This project will be supervised by Professors Natashia Boland and
Martin Savelsbergh.

Availability

This APA(I) scholarship will be offered for 3 years, with possible
extension of up to 6 months. If the successful candidate is an
international student a full tuition fee scholarship and single
overseas student health cover will be offered for the same period.
Domestic
Research Higher Degree students are not liable for fees.
The scholarship is available for study in the School of Mathematical
and Physical Sciences at the University of Newcastle. It is expected
that your study will commence in Semester 1, 2013. For further
information on the School and the University, refer to sections below,
or go to
http://www.newcastle.edu.au/school/mathematical-physical-sciences/
or
http://www.newcastle.edu.au/students/research-higher-degree/. For
further information about Newcastle, refer to sections below, or visit
http://www.visitnewcastle.com.au/visitnewcastle.asp

Payment Information

APA(I) scholarship awards include a living allowance of $28,715 per
annum. Note: Stipend rates are indexed annually. Provision also exists
for a relocation allowance and a thesis allowance.
Applicant attributes
The successful applicant will hold an undergraduate degree, and have
undertaken some form of preliminary research training in operations
research, engineering, mathematics, computer science, or related
discipline. Applicants from software engineering or industrial
engineering will find their skills particularly relevant. Strong
mathematical and computer programming skills are essential and
knowledge of operations research, constraint programming and/or
artificial
intelligence techniques would be an asset. A can-do attitude, and
excellent communication skills, will also be highly valued.

Eligibility

This scholarship is for study in Australia for those who have achieved
Honours Class 2 Division I or equivalent, in their undergraduate
degrees, or who have an appropriate higher qualification. The
equivalency of international students' qualifications to Honours
Class 2 Division 1 will be assessed on a case-by-case basis.

Application Details

To apply for this scholarship please send your CV, together with an
academic transcript showing details of all courses you have taken, the
grades you were awarded, an interpretation of those grades, and the
names and contact details of at least two people who can provide
confidential references, to the address shown below. If your
transcript is not in English, please provide an English translation. If
you have
completed a thesis or other publications, please feel free to include
them in the email application. Include details of your computer
programming skills and experience, your mathematical training and
background, and any experience you have with modelling and solving
industrial problems.

The University of Newcastle

The University of Newcastle is a major research university in
Australia, ranked in the top ten in Australia for overall research
funding and outcomes. Further, the University was the top-ranked in
Australia in the discipline of applied mathematics in the recent
Excellence in Research Australia (ERA) rankings.

The main University of Newcastle campus is located in the city of
Newcastle: on the East coast of Australia about two hours drive north
from Sydney. The School of Mathematical and Physical Sciences provides
a stimulating and supportive environment for research and teaching,
with
ample opportunities for collaborative research partnerships both
within the university and with industry. Although well known for its
beautiful beaches and pleasant climate, Newcastle is home to a
significant port,
and Australia's largest coal-handling terminal. Newcastle is also at
the gateway of one of Australia's largest wine-growing regions, the
Hunter
valley. Thus opportunities for research in shipping, transportation,
and mineral resources abound.

This APA(I) Scholarship can also be found online here:
http://www.jason.edu.au/scholarship.pl?id=6138&page=1


Main Contact

Daniel Urquhart
School of Mathematical and Physical Sciences
The University of Newcastle
T +61 2 4921 5440
E Daniel.A.Urquhart@Newcastle.edu.au
**********************************************************
*
* 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] Submission to COCOON 2013 is now open

The 19th Annual International Computing and Combinatorics Conference
(COCOON'13) will be held in Hangzhou, China, during June 21 - 23, 2013.

Papers should be submitted electronically via the Springer online
conference system.
http://senldogo0039.springer-sbm.com/ocs/home/COCOON2013

• Papers must be formatted using the LNCS style file.

• The maximum length of a paper (including references, but excluding the
optional appendix) is 12 pages.

• Proofs omitted due to space constraints must be placed in an appendix to
be read by the program committee.

• Submission deadline: January 6, 2013.

More updated Information can be found at
http://www.cs.zju.edu.cn/algo/cocoon2013/

--
Regards,
Deshi

College of Computer Science
Zhejiang University,
Hangzhou 310027,
China.
Http://www.cs.zju.edu.cn/people/yedeshi
**********************************************************
*
* 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 CiE 2013: The Nature of Computation

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

CiE 2013: The Nature of Computation

Logic, Algorithms, Applications

Milan, Italy

July 1 - 5, 2013

http://cie2013.disco.unimib.it

IMPORTANT DATES:

Submission Deadline for LNCS: 20 January 2013
Notification of authors: 4 March 2013
Deadline for final revisions: 1 April 2013


CiE 2013 is the ninth conference organised by CiE (Computability in
Europe), a European association of mathematicians, logicians, computer
scientists, philosophers, physicists and others interested in new
developments in computability and their underlying significance for the
real world. Previous meetings have taken place in Amsterdam (2005),
Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponte
Dalgada (2010), Sofia (2011) and Cambridge (2012).


The Nature of Computation is meant to emphasize the special focus of
CIE13 on the unexpected and strong changes that studies on Nature have
brought in several areas of mathematics, physics, and computer science.
Starting from Alan Turing, research on Nature with a computational
perspective has produced novel contributions, giving rise even to new
disciplines.

Two complementary research perspectives pervade the Nature of
Computation theme. One is focused on the understanding of new
computational paradigms inspired by the processes occurring in the
biological world, while focusing on a deeper and modern understanding of
the theory of computation. The other perspective is on our understanding
of how computations really occur in Nature, on how we can interact with
those computations, and on their applications.


CiE 2013 conference topics include, but not exclusively:

* Admissible sets
* Algorithms
* Analog computation
* Artificial intelligence
* Automata theory
* Bioinformatics
* Classical computability and degree structures
* Cognitive science and modelling
* Complexity classes
* Computability theoretic aspects of programs
* Computable analysis and real computation
* Computable structures and models
* Computational and proof complexity
* Computational biology
* Computational creativity
* Computational learning and complexity
* Computational linguistics
* Concurrency and distributed computation
* Constructive mathematics
* Cryptographic complexity
* Decidability of theories
* Derandomization
* DNA computing
* Domain theory and computability
* Dynamical systems and computational models
* Effective descriptive set theory
* Emerging and Non-standard Models of Computation
* Finite model theory
* Formal aspects of program analysis
* Formal methods
* Foundations of computer science
* Games
* Generalized recursion theory
* History of computation
* Hybrid systems
* Higher type computability
* Hypercomputational models
* Infinite time Turing machines
* Kolmogorov complexity
* Lambda and combinatory calculi
* L-systems and membrane computation
* Machine learning
* Mathematical models of emergence
* Molecular computation
* Morphogenesis and developmental biology
* Multi-agent systems
* Natural Computation
* Neural nets and connectionist models
* Philosophy of science and computation
* Physics and computability
* Probabilistic systems
* Process algebras and concurrent systems
* Programming language semantics
* Proof mining and applications
* Proof theory and computability
* Proof complexity
* Quantum computing and complexity
* Randomness
* Reducibilities and relative computation
* Relativistic computation
* Reverse mathematics
* Semantics and logic of computation
* Swarm intelligence and self-organisation
* Type systems and type theory
* Uncertain Reasoning
* Weak systems of arithmetic and applications

We particularly welcome submissions in emergent areas, such as
bioinformatics and natural computation, where they have a basic
connection with computability.

Contributed papers will be selected from submissions received by the
PROGRAM COMMITTEE consisting of:

* Gerard Alberts (Amsterdam) * Luís Antunes (Porto)
* Arnold Beckmann (Swansea) * Laurent Bienvenu (Paris)
* Paola Bonizzoni (Milan, co-chair) * Vasco Brattka (Munich and Cape
Town, co-chair)
* Cameron Buckner (Houston TX) * Bruno Codenotti (Pisa)
* Stephen Cook (Toronto ON) * Barry Cooper (Leeds)
* Ann Copestake (Cambridge) * Erzsébet Csuhaj-Varjú (Budapest)
* Anuj Dawar (Cambridge) * Gianluca Della Vedova (Milan)
* Liesbeth De Mol (Gent) * Jérôme Durand-Lose (Orléans)
* Viv Kendon (Leeds) * Bj√∏rn Kjos-Hanssen (Honolulu, HI)
* Antonina Kolokolova (St. John’s NF) * Benedikt Löwe (Amsterdam)
* Giancarlo Mauri (Milan) * Rolf Niedermeier (Berlin)
* Geoffrey Pullum (Edinburgh) * Nicole Schweikardt (Frankfurt)
* Sonja Smets (Amsterdam) * Susan Stepney (York)
* S. P. Suresh (Chennai) * Peter van Emde Boas (Amsterdam)

The PROGRAMME COMMITTEE cordially invites all researchers (European and
non-European) in computability related areas to submit their papers (in
PDF format, max 10 pages using the LNCS style) for presentation at CiE 2013.
The submission site https://www.easychair.org/conferences/?conf=cie2013 is open.
We particularly invite papers that build bridges between different
parts of the research community.

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

Contact: Paola Bonizzoni - bonizzoni at disco.unimib.it
Website: http://cie2013.disco.unimib.it
************************************************************************
**********************************************************
*
* 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] CSR 2013: Call for papers

8th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2013)

June 25-29, 2013, Ekaterinburg, Russia

http://csr2013.urfu.ru/

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

CSR 2013 intends to reflect the broad scope of international cooperation in
computer science. It is the eighth conference in a series of regular events
previously held in St.Petersburg (2006), Ekaterinburg (2007), Moscow (2008),
Novosibirsk (2009), Kazan (2010), St.Petersburg (2011), and Nizhny
Novgorod (2012). The proceedings are published in Springer LNCS.

IMPORTANT DATES

Deadline for submissions: December 11, 2012
Notification of acceptance: February 13, 2013
Conference dates: June 25-29, 2013

As it has become a tradition, there will be YANDEX AWARDs
for the best paper and for the best student paper!

VENUE

Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour
flight) east from Moscow. It is the capital city as well as the main
financial, cultural, and scientific centre of the Ural region.
Ekaterinburg is accessible by direct regular flights of a number of
international airlines including Lufthansa, Aeroflot, Finnair,
Czech Airlines, Turkish Airlines, and FlyDubai. Ural Federal
University is the largest Russian university outside Moscow.

TOPICS include, but are not limited to:

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

INVITED SPEAKERS

* Mario Szegedy (Rutgers) will give an opening lecture

* Thomas Colcombet (CNRS)
* Gilles Dowek (INRIA)
* Alexandr Kostochka (University of Illinois at Urbana-Champaign / Novosibirsk State University)
* Nicole Schweikardt (Goethe University)
* Jeffrey Shallit (University of Waterloo)
* Paul Spirakis (University of Patras)
* Ryan Williams (Stanford University)

PROGRAM COMMITTEE

* Max Alekseyev (University of South Carolina)
* Andris Ambainis (University of Latvia)
* Maxim Babenko (Higher School of Economics, Moscow)
* Patrick Baillot (ENS Lyon)
* Glencora Borradaile (Oregon State University)
* Andrei Bulatov (Simon Fraser University) Chair
* Yijia Chen (Shanghai Jiao Tong University)
* Victor Dalmau (University Pompeu Fabra)
* Yevgeniy Dodis (Courant Institute of Mathematical Sciences)
* Manfred Droste (University Leipzig)
* Anna Frid (Sobolev Institute of Mathematics)
* Hamed Hatami (McGill University)
* Tero Harju (University of Turku)
* Michal Koucky (Mathematical Institute of Czech Academy of Sciences)
* Stephan Kreutzer (Tecnical University of Berlin)
* Alexander Kulikov (Steklov Institute of Mathematics at St. Petersburg)
* Konstantin Makarychev (Microsoft Research at Redmond)
* Simone Martini (University of Bologna)
* Jaroslav Nesetril (Charles University)
* Jean-Eric Pin (University Paris 7)
* Harald Raecke (University of Munich)
* Alexander Razborov (University of Chicago and Steklov Mathematical Institute)
* Mikhail Volkov (Ural Federal University)

ORGANIZERS

B.N.Yeltsin Ural Federal University, Ekaterinburg, Russia

CONFERENCE CHAIR

Arseny Shur (Ural Federal University)

SUBMISSIONS

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

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

SATELLITE EVENTS

The 2nd Workshop on Current Trends in Cryptography (June 23-24, 2013)
https://www.tc26.ru/en/CTCryptEN/CTCrypt2013

The 6th School for students and young researchers "Computer Science
Ekaterinburg Days" (June 29 - July 1, 2013).

Workshop proposals are welcome.

FURTHER INFORMATION AND CONTACTS

Web: http://csr2013.urfu.ru/
Email: csr2013@urfu.ru


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

Friday, November 23, 2012

[DMANET] Computational Geometry Postdoc Vacancy at TU Braunschweig

The Algorithms Group (with Sándor Fekete and Alexander Kröller) in the Department of Computer Science at Braunschweig University of Technology, Germany, has a vacancy for a computer scientist or mathematician, available immediately.

We are looking for

a scientific employee / postdoctoral research associate
(TV-L13 = about 2800 Euros gross per month; DFG project "Kunst!").

The position will be for one year. Applications for a one-year research visit from excellent PhD students are welcome.

The position is funded from DFG-Project "Kunst!", so applicants are expected to contribute to the project; however, ample time to work on independent research will be given.

The project combines methods from computational geometry, mathematical programming, and algorithm engineering in an exciting way. The goal is to solve problems from the art gallery family (almost) exactly, and to design theoretically and practically efficient algorithms. See the paper

Kroeller, Baumgartner, Fekete, Schmidt: Exact solutions and bounds for general art gallery problems. ACM Journal of Experimental Algorithmics 17(1)-2.3, 2012. http://dl.acm.org/citation.cfm?id=2184449

to get an idea on the subject. Interesting research directions can be in visibility computations, extended real-world versions of the problem, the analysis of notoriously hard cases, exploiting multi-core, and robust data structures.

We are looking for applicants with an above-average Ph.D. in mathematics or computer science, who have a solid knowledge in computational geometry, an interest in and a capability for a wide range of scientific work (from developing ideas all the way to their practical realization), an open mind for the other activities of our department, and a healthy team spirit.

Proficiency in English is a must. Familarity with C++ development and algorithm implementation is a plus.

There are no teaching obligations, but researchers will have the opportunity to interact with students in the context of their projects.

We are offering an opportunity to participate in exciting interdisciplinary projects that span all the way from basic research in algorithms to its practical and technical application. As a member of our group, you will be part of a motivated team that maintains various interdisciplinary and international contacts and activities. Among applicants with equal qualifications, handicapped persons will be given a preference. The Braunschweig University of Technology is an equal-opportunity employer and encourages women to apply.


Applications are considered on a rolling basis until the position is filled.

Please send your applications with the usual documents to:

Alexander Kroeller
Technische Universität Braunschweig
Institut für Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Mühlenpfordtstraße 23
38106 Braunschweig
Germany

fax: +49 531 391 3109

Electronic applications are preferred - even more if they come in a single PDF file. If there are questions, please contact Alexander Kroeller via mail (a.kroeller "at" tu-bs.de) or phone (+49 531 391 3112).



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