Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. 1 PhD position in Parameterized Complexity at TU Berlin
(application deadline: October 1) (Stefan Kratsch)
2. CFP: Special Issue of IEEE Transactions on Evolutionary
Computation (Per Kristian Lehre)
3. CfP: AMAI Special Issue on Geometric Reasoning (Temur Kutsia)
----------------------------------------------------------------------
Message: 1
Date: Fri, 20 Sep 2013 10:43:02 +0200
From: Stefan Kratsch <stefan.kratsch@tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 1 PhD position in Parameterized Complexity at TU
Berlin (application deadline: October 1)
Message-ID: <523C0A96.4030307@tu-berlin.de>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Department of Software Engineering and Theoretical Computer Science
Technical University Berlin
1 PhD position in Parameterized Complexity
Research Assistant (100% TV-L 13)
A PhD position is available in the DFG-funded Emmy Noether Junior Research
Group
"Efficient preprocessing for hard problems"
led by Stefan Kratsch at TU Berlin. The successful candidate will perform
research on parameterized complexity, kernelization, and related topics.
The main focus of research is on the rigorous study of polynomial-time
preprocessing for NP-hard combinatorial problems. Apart from scientific
contributions, the successful candidate will pursue a PhD in theoretical
computer science, with the goal of defending a doctoral thesis within
3-4 years.
The position is fulltime with an initial contract for 2 years and the
possibility to extend by up to 2 further years. There are no teaching
obligations,
but interest in teaching (exercises or lectures) is encouraged. The
position is available from November 1, 2013. Starting salary is roughly
1900
Euros net (includes mandatory health insurance; 3200 Euros before tax).
The junior research group is associated with the "Algorithms and
complexity"
group chaired by Prof. Rolf Niedermeier (http://www.akt.tu-berlin.de/),
which currently consists of 9 further PhD students and postdocs.
Berlin offers a strong scientific landscape including three renowned
universities.
Furthermore there are a DFG (German Research Foundation) research
training group, called "Methods for Discrete Structures" (MDS) and the DFG
research center MATHEON; these offer opportunities for joint research and
support for PhD students (e.g., meetings, lecture series, summer schools).
Besides sciences, Berlin offers an exceptional variety of attractions,
and a
flourishing cultural scene as well as a fast-paced multicultural living
environment that should cater to most interests and hobbies.
Candidates must hold a master's degree (or equivalent) in computer science,
mathematics or a related area, or have almost completed their study.
They should have a very good knowledge about algorithms and complexity.
Background in parameterized complexity and, e.g., algebra and probability
theory as well as programming skills are beneficial.
Good communication skills and solid English writing skills are mandatory,
as all publications as well as presentation of results by talks at
conferences and workshops will be in English.
Knowledge of German is not required, but it will be encouraged to learn
at least the basics.
First and foremost, candidates should bring strong curiosity and eagerness
to both ask and pursue scientific questions.
Interested applicants should send their application containing
- cover letter (see below)
- curriculum vitae
- an overview of grades and courses taken
- copy of Bachelor and Master certificates (or equivalent)
- summary of master/diploma thesis (English, 1-3 pages)
- (optionally) complete thesis and any other scientific publications
- recommendation letters (see below)
by
October 1, 2013
to
Dr. Stefan Kratsch
stefan.kratsch@tu-berlin.de
http://www.user.tu-berlin.de/stefan.kratsch/
*Cover letter*
Please include clear statements regarding your motivation to work in
research and why you want to pursue a PhD. Why are you interested in
parameterized complexity and/or kernelization? What other directions of
theoretical computer science and discrete mathematics are you interested
in and/or possess strong qualification in?
*Recommendation letters*
It is requested that interested applicants supply between
1 and 3 letters of recommendation written by professors and researchers
that they have interacted with (this should include the supervisor of
the master/diploma thesis). *The letters should be sent directly by email*
to stefan.kratsch@tu-berlin.de and preferably arrive around October 1 too.
Applications arriving by October 1 will receive full consideration,
however, the search remains open until the position is filled.
Qualifications being equal, precedence will be given to candidates with
disabilities.
Do not hesitate to contact stefan.kratsch@tu-berlin.de if you have any
questions regarding the position or your application.
------------------------------
Message: 2
Date: Fri, 20 Sep 2013 09:50:42 +0100
From: Per Kristian Lehre <PerKristian.Lehre@nottingham.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: Special Issue of IEEE Transactions on
Evolutionary Computation
Message-ID: <87y56rg9lp.fsf@eta.cs.nott.ac.uk>
Content-Type: text/plain; charset=us-ascii
----------------------------------------------------------------------
Call for Papers
Special Issue on Theoretical Foundations of Evolutionary Computation
IEEE Transactions on Evolutionary Computation
----------------------------------------------------------------------
Aim and Scope
Evolutionary computation methods such as evolutionary algorithms or
ant colony optimization have been successfully applied to a wide range
of problems. This includes classical combinatorial optimization
problems and many hard real-world optimization problems. Real-world
problems are often hard to optimize by traditional methods as they are
non-linear, highly constrained, multi-objective, and come with a wide
range of uncertainties. Many different evolutionary computation
methods for dealing with complex problems have been proposed over the
years
In contrast to the successful applications to extremely difficult
problems, the theoretical understanding of these algorithms lags far
behind the practical success. This is unfortunate, since a rigorous
understanding of the working principles of evolutionary methods can
lead to a better understanding under which situations a given type of
algorithm works, and provide design guidelines for new powerful
methods in practice.
For these reasons the last 20 years saw increasing efforts to lay the
theoretical foundations of evolutionary methods. The aim of this
special issue is to advance the theoretical understanding of
evolutionary computation methods and bridge theory and practice. We
solicit novel, high-quality scientific contributions on theoretical or
foundational aspects of evolutionary computation. A successful
exchange between theory and practice in evolutionary computation is
very desirable and papers bridging theory and practice are of
particular interest. In addition to strict mathematical
investigations, experimental studies strengthening the theoretical
foundations of evolutionary computation methods are very welcome.
Topics
The special issue will present in a coherent form novel results from
different sub-areas of evolutionary computation theory. Authors are
encouraged to submit novel, high-quality research from any sub-area,
including (but not limited to):
- Representations
- Scaling issues
- Methods for handling constraints
- Dynamic and stochastic environments
- Feature-based analysis, fitness landscapes and problem difficulty
- Co-evolution
- Evolutionary multi-objective optimization
- Meta-optimization
- Human/evolutionary algorithm interactions (human in the loop)
- Runtime analysis of all types of evolutionary computing techniques
including evolutionary algorithms, swarm intelligence, memetic
algorithms and artificial immune systems.
Submission
Manuscripts must be prepared according to the instructions of the
"Information for Authors" section of the journal, available at
http://ieee-cis.org/pubs/tec/authors/. Papers incorrectly formatted
will be returned without review.
Papers must be submitted through the IEEE TEVC journal website:
http://mc.manuscriptcentral.com/tevc-ieee. Authors must clearly
indicate "Special issue on Theoretical Foundations of Evolutionary
Computation" in the comments to the Editor-in-Chief. Submitted papers
will be reviewed by at least three reviewers. The submission of a
manuscript implies that it is the authors' original unpublished work
and is not being submitted for possible publication elsewhere.
Schedule
- 30 Nov 2013: Submission deadline
- 1 Feb 2014: Notice of the first round review
- 15 Mar 2014: Revision due
- 1 May 2014: Final notice of acceptance / reject
- 1 Jun 2014: Final manuscript due
Guest Editors
- A/Prof Frank Neumann, University of Adelaide,
<frank.neumann@adelaide.edu.au>
- Prof Benjamin Doerr, Max Planck Institute for Informatics,
<doerr@mpi-inf.mpg.de>
- Dr Per Kristian Lehre, University of Nottingham,
<perkristian.lehre@nottingham.ac.uk>
- Prof Pauline Haddow, Norwegian University of Science and
Technology, <pauline@idi.ntnu.no>
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.
------------------------------
Message: 3
Date: Fri, 20 Sep 2013 12:26:44 +0200
From: Temur Kutsia <kutsia@risc.jku.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: AMAI Special Issue on Geometric Reasoning
Message-ID: <523C22E4.9080106@risc.jku.at>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Call for Papers
Annals of Mathematics and Artificial Intelligence
Special Issue on Geometric Reasoning
http://dream.inf.ed.ac.uk/events/amai-geom
Geometry is one of most studied areas of mathematics and, though its
role as a
foundational system has evolved over time, it remains key to our
understanding
of many aspects of the world. It is one of the first areas to which
Artificial
Intelligence (AI) was applied and has remained the focus of much work in
the
field, giving rise to new mathematical concepts and techniques, heuristics,
algorithms, and applications over the past fifty years. In view of the
importance
of geometry and the sustained advances in the field of computer-based
geometric
reasoning and its applications, the time seems ripe to take stock of the
progress
so far and look at some of the latest mathematical and AI-related
advances in
the field. Thus, we invite original contributions -- ranging from theory to
implementations and applications -- and insightful surveys to a special
issue of
the Annals of Mathematics and Artificial Intelligence on Geometric
Reasoning.
Relevant topics include (but are not limited to):
* Automated and interactive theorem proving in geometry involving
algebraic,
logical, and/or probabilistic approaches.
* Symbolic and numerical methods for geometric computation and constraint
solving.
* The formal verification of geometric algorithms, for instance in
relation to
computational geometry.
* Reasoning and manipulation via diagrams, including approaches based on
dynamic
geometry.
* The design, implementation, and evaluation of software for geometric
reasoning.
* Knowledge management and libraries of test problems for theorem
proving in
geometry.
* The applications to geometric modelling, CAGD/CAD, computer vision,
robotics,
and education.
Submission
Prospective authors should follow the instructions set out by the Annals of
Mathematics and Artificial Intelligence on its webpage
(http://www.springer.com/computer/ai/journal/10472) and submit their
articles
through Springer's Editorial Manager System (at
https://www.editorialmanager.com/amai)
by the deadline indicated below.
Please note that the guest editors will first carry a quick assessment
of each
submission and only papers that are deemed relevant to the special issue
and are
of high enough quality will be forwarded to at least two referees for full,
independent reviews.
Important dates
* Submissions due: December 31, 2013
* First-round acceptance notification: March 31, 2014
* Revised versions due: April 30, 2014
* Final decision: June 30, 2014
* Final papers due: August 31, 2014
* Publication date: 2014 (To be confirmed)
Special Issue Editors
* Jacques Fleuriot (University of Edinburgh, UK)
* Tetsuo Ida (University of Tsukuba, Japan)
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 67, Issue 20
**************************************
No comments:
Post a Comment