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. Special Issue of "Discrete Applied Math" for CTW 2013 - 3rd
Call for Papers - Deadline Extended (Bodo Manthey)
----------------------------------------------------------------------
Message: 1
Date: Fri, 27 Sep 2013 20:42:56 +0200
From: Bodo Manthey <b.manthey@utwente.nl>
To: DMANET <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Special Issue of "Discrete Applied Math" for CTW
2013 - 3rd Call for Papers - Deadline Extended
Message-ID: <5245D1B0.20900@utwente.nl>
Content-Type: text/plain; charset=ISO-8859-15; format=flowed
Third Call for Papers for the special issue of
Discrete Applied Mathematics
for the 12th Cologne-Twente Workshop on Graphs and Combinatorial
Optimization (CTW 2013)
-----------------------------------
Extended deadline: October 20, 2013
-----------------------------------
Following the tradition of previous CTWs, a special issue of Discrete
Applied Mathematics will be devoted to the 12th Cologne-Twente Workshop
on Graphs and Combinatorial Optimization (CTW 2013,
http://www.math.utwente.nl/~ctw/), held on May 21-23, 2013 at the
University of Twente, Enschede, Netherlands.
All interested researchers are invited to contribute to this special
volume. The topics should relate to the themes of the workshop (graph
theory, combinatorial optimization and the design and analysis of
algorithms). Submissions of contributions not presented at the workshop
are also welcome.
All articles will be thoroughly refereed according to the high standards
of Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, make sure
that you specify that the paper is a submission to the special issue of
CTW 2013.
Looking forward to your contribution,
The guest editors,
Johann Hurink & Bodo Manthey
ctw2013@utwente.nl
------------------------------
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 25
**************************************
Monday, September 30, 2013
Friday, September 27, 2013
dmanet Digest, Vol 67, Issue 24
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. MPB Special Issue (Letchford, Adam)
2. IPCO 2014 Call for Papers (Jens Vygen)
----------------------------------------------------------------------
Message: 1
Date: Thu, 26 Sep 2013 11:34:09 +0000
From: "Letchford, Adam" <a.n.letchford@lancaster.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] MPB Special Issue
Message-ID:
<06185FC256DE8543BD7F3AF9F51ACC34186CA8@EX-1-MB1.lancs.local>
Content-Type: text/plain; charset="us-ascii"
MATHEMATICAL PROGRAMMING Series B
Special issue on POLYNOMIAL OPTIMIZATION
Second Call for Papers
Polynomial Optimization (PO) refers to optimization problems in which all
objective and constraint functions are polynomials. Such problems form an
important and remarkably general class of NP-hard global optimization
problems. A fascinating feature of PO is that it can be approached from
several different directions. Indeed, in addition to traditional techniques
drawn from operational research, computer science and numerical analysis,
new techniques have recently emerged based on concepts taken from
algebraic geometry, commutative algebra and moment theory. For this
reason, PO is a rapidly expanding field.
We are pleased to announce this special issue of Mathematical Programming
Series B on PO, the deadline for which is 30th November 2013. We welcome
papers on all aspects of PO, whether concerned with theory, applications,
algorithms or software. Since we expect a large number of submissions,
all papers that we receive will be refereed to a high standard. Papers that
are deemed to be of high quality, yet are not included in the special issue,
may be forwarded to either Mathematical Programming Series A or
Mathematical Programming Computation for consideration (with the agreement
of both the authors and the respective editor-in-chief).
Manuscripts must be submitted on-line via:
http://www.editorialmanager.com/mapr/
When prompted to Choose Article Type, please select
"S.I. : Polynomial Optimization - Series B" from the menu. Due to limits in
page volume, we request that initial submissions be no more than 25 pages
in length. We also request that papers use the standard Springer LaTeX
style "svjour3". The necessary files are available at:
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip.
Many thanks in advance for your contributions to this special issue.
The guest editors:
Jean-Bernard Lasserre (LAAS-CNRS, Toulouse)
Adam Letchford (Lancaster, UK)
Pablo Parrilo (MIT)
David Steurer (Cornell).
------------------------------
Message: 2
Date: Thu, 26 Sep 2013 14:40:24 +0200
From: Jens Vygen <vygen@or.uni-bonn.de>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] IPCO 2014 Call for Papers
Message-ID: <0C394856-5E98-4B67-B354-AB7D2F356D56@or.uni-bonn.de>
Content-Type: text/plain; charset=utf-8
Call for Papers for the
17th Conference on
Integer Programming and Combinatorial Optimization
(IPCO XVII)
to be held at
Bonn, Germany,
June 23-25, 2014
Conference website for additional details and paper submission:
http://www.or.uni-bonn.de/ipco/
The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Authors are invited to submit extended abstracts of their recent work by November 15, 2013; see the submission guidelines for more information. The program committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not submitted to journals or conferences with proceedings before the notification date (January 31, 2014). Papers violating these requirements will not be considered by the Program Committee.
During the conference, approximately 33 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as Springer Lecture Notes in Computer Science. They will contain extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals. Each participant will receive a copy of the proceedings at the conference.
Important Dates:
Submission deadline: November 15, 2013 (23:59 CET).
Notification date: January 31, 2014
Conference: June 23-25, 2014
Program Committee:
Flavia Bonomo (Universidad de Buenos Aires)
Sam Burer (University of Iowa)
G?rard Cornu?jols (Carnegie Mellon University)
Satoru Fujishige (Kyoto University)
Michael J?nger (Universit?t zu K?ln)
Matthias K?ppe (University of California, Davis)
Jon Lee, chair (University of Michigan)
Jeff Linderoth (University of Wisconsin)
Jean-Philippe Richard (University of Florida)
Andr?s Seb? (CNRS, Laboratoire G-SCOP, Grenoble)
Maxim Sviridenko (University of Warwick)
Chaitanya Swamy (University of Waterloo)
Jens Vygen (Universit?t Bonn)
David P. Williamson (Cornell University)
Laurence Wolsey (Universit? catholique de Louvain)
------------------------------
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 24
**************************************
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. MPB Special Issue (Letchford, Adam)
2. IPCO 2014 Call for Papers (Jens Vygen)
----------------------------------------------------------------------
Message: 1
Date: Thu, 26 Sep 2013 11:34:09 +0000
From: "Letchford, Adam" <a.n.letchford@lancaster.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] MPB Special Issue
Message-ID:
<06185FC256DE8543BD7F3AF9F51ACC34186CA8@EX-1-MB1.lancs.local>
Content-Type: text/plain; charset="us-ascii"
MATHEMATICAL PROGRAMMING Series B
Special issue on POLYNOMIAL OPTIMIZATION
Second Call for Papers
Polynomial Optimization (PO) refers to optimization problems in which all
objective and constraint functions are polynomials. Such problems form an
important and remarkably general class of NP-hard global optimization
problems. A fascinating feature of PO is that it can be approached from
several different directions. Indeed, in addition to traditional techniques
drawn from operational research, computer science and numerical analysis,
new techniques have recently emerged based on concepts taken from
algebraic geometry, commutative algebra and moment theory. For this
reason, PO is a rapidly expanding field.
We are pleased to announce this special issue of Mathematical Programming
Series B on PO, the deadline for which is 30th November 2013. We welcome
papers on all aspects of PO, whether concerned with theory, applications,
algorithms or software. Since we expect a large number of submissions,
all papers that we receive will be refereed to a high standard. Papers that
are deemed to be of high quality, yet are not included in the special issue,
may be forwarded to either Mathematical Programming Series A or
Mathematical Programming Computation for consideration (with the agreement
of both the authors and the respective editor-in-chief).
Manuscripts must be submitted on-line via:
http://www.editorialmanager.com/mapr/
When prompted to Choose Article Type, please select
"S.I. : Polynomial Optimization - Series B" from the menu. Due to limits in
page volume, we request that initial submissions be no more than 25 pages
in length. We also request that papers use the standard Springer LaTeX
style "svjour3". The necessary files are available at:
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip.
Many thanks in advance for your contributions to this special issue.
The guest editors:
Jean-Bernard Lasserre (LAAS-CNRS, Toulouse)
Adam Letchford (Lancaster, UK)
Pablo Parrilo (MIT)
David Steurer (Cornell).
------------------------------
Message: 2
Date: Thu, 26 Sep 2013 14:40:24 +0200
From: Jens Vygen <vygen@or.uni-bonn.de>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] IPCO 2014 Call for Papers
Message-ID: <0C394856-5E98-4B67-B354-AB7D2F356D56@or.uni-bonn.de>
Content-Type: text/plain; charset=utf-8
Call for Papers for the
17th Conference on
Integer Programming and Combinatorial Optimization
(IPCO XVII)
to be held at
Bonn, Germany,
June 23-25, 2014
Conference website for additional details and paper submission:
http://www.or.uni-bonn.de/ipco/
The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.
Authors are invited to submit extended abstracts of their recent work by November 15, 2013; see the submission guidelines for more information. The program committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not submitted to journals or conferences with proceedings before the notification date (January 31, 2014). Papers violating these requirements will not be considered by the Program Committee.
During the conference, approximately 33 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as Springer Lecture Notes in Computer Science. They will contain extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals. Each participant will receive a copy of the proceedings at the conference.
Important Dates:
Submission deadline: November 15, 2013 (23:59 CET).
Notification date: January 31, 2014
Conference: June 23-25, 2014
Program Committee:
Flavia Bonomo (Universidad de Buenos Aires)
Sam Burer (University of Iowa)
G?rard Cornu?jols (Carnegie Mellon University)
Satoru Fujishige (Kyoto University)
Michael J?nger (Universit?t zu K?ln)
Matthias K?ppe (University of California, Davis)
Jon Lee, chair (University of Michigan)
Jeff Linderoth (University of Wisconsin)
Jean-Philippe Richard (University of Florida)
Andr?s Seb? (CNRS, Laboratoire G-SCOP, Grenoble)
Maxim Sviridenko (University of Warwick)
Chaitanya Swamy (University of Waterloo)
Jens Vygen (Universit?t Bonn)
David P. Williamson (Cornell University)
Laurence Wolsey (Universit? catholique de Louvain)
------------------------------
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 24
**************************************
Wednesday, September 25, 2013
dmanet Digest, Vol 67, Issue 23
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. Postdoc in Combinatorics/Vienna (Ilse Fischer)
----------------------------------------------------------------------
Message: 1
Date: Wed, 25 Sep 2013 09:14:28 +0200
From: "Ilse Fischer" <ilse.fischer@univie.ac.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc in Combinatorics/Vienna
Message-ID:
<78c8684337cff17dd476aa70f2890591.squirrel@webmail.univie.ac.at>
Content-Type: text/plain;charset=utf-8
Postdoc position in Combinatorics
University of Vienna, Austria
A postdoc position in Combinatorics at the University of Vienna is
available. The position is within the framework of a START project, which
is funded by the Austrian Science Foundation FWF and led by Ilse Fischer,
and deals with recent topics in enumerative and algebraic combinatorics as
wells as statistical physics.
Successful candidates will join the combinatorics group
http://www.mat.univie.ac.at/~kratt/comb.html
The appointment is initially for one year and can be extended up to a
total of three years subject to satisfactory progress. The position comes
along with substantial travel funding and is available from December 1,
2013 (negotiable).
Applications, including CV, list of publications, research plan and the
names of two references including email addresses, should be sent to
Ilse Fischer
ilse.fischer at univie.ac.at
http://www.mat.univie.ac.at/~ifischer/
and will be considered until the position is filled.
For further information do not hesitate to contact Ilse Fischer.
------------------------------
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 23
**************************************
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. Postdoc in Combinatorics/Vienna (Ilse Fischer)
----------------------------------------------------------------------
Message: 1
Date: Wed, 25 Sep 2013 09:14:28 +0200
From: "Ilse Fischer" <ilse.fischer@univie.ac.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc in Combinatorics/Vienna
Message-ID:
<78c8684337cff17dd476aa70f2890591.squirrel@webmail.univie.ac.at>
Content-Type: text/plain;charset=utf-8
Postdoc position in Combinatorics
University of Vienna, Austria
A postdoc position in Combinatorics at the University of Vienna is
available. The position is within the framework of a START project, which
is funded by the Austrian Science Foundation FWF and led by Ilse Fischer,
and deals with recent topics in enumerative and algebraic combinatorics as
wells as statistical physics.
Successful candidates will join the combinatorics group
http://www.mat.univie.ac.at/~kratt/comb.html
The appointment is initially for one year and can be extended up to a
total of three years subject to satisfactory progress. The position comes
along with substantial travel funding and is available from December 1,
2013 (negotiable).
Applications, including CV, list of publications, research plan and the
names of two references including email addresses, should be sent to
Ilse Fischer
ilse.fischer at univie.ac.at
http://www.mat.univie.ac.at/~ifischer/
and will be considered until the position is filled.
For further information do not hesitate to contact Ilse Fischer.
------------------------------
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 23
**************************************
dmanet Digest, Vol 67, Issue 22
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. WICT 2013 - Final CFP - Hanoi, Vietnam (Ajith Abraham)
2. Faculty Position - Dept of CS, U. of Sao Paulo
(Yoshiharu Kohayakawa)
3. 2nd CFP: EvoENERGY 2014 (Kaufmann Paul)
4. Utrecht Graphs Workshop, 31/10 & 1/11, a second announcement
(Ross Kang)
5. Postdoc Position at Univ. Trier (duer@uni-trier.de)
6. NSF-Workshop (at SODA 2014) on Self-Organizing Particle
Systems (Andrea Richa)
----------------------------------------------------------------------
Message: 1
Date: Mon, 23 Sep 2013 07:52:13 +0530
From: Ajith Abraham <ajith.abraham@ieee.org>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] WICT 2013 - Final CFP - Hanoi, Vietnam
Message-ID:
<CAGkggF5SNxmT3nicouLzoOmVJiqWqg4mCvSmeHx3L_kBTEYO-A@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
-- Apologies for cross posting --
Final deadline: September 30, 2013
** WICT 2013 - Second Call for Papers **
Third World Congress on Information and Communication Technologies ( WICT2013)
December 15-18, 2013
Venue: Hanoi, Vietnam
http://www.mirlabs.org/wict13
http://www.mirlabs.net/wict13
Related event: SoCPaR 2013: http://www.mirlabs.org/socpar13
After the success of the Second World Congress on Information and
Communication Technologies (WICT 2012 -
http://www.mirlabs.net/wict12), we are pleased to announce the
organization of WICT 2013 to provide an opportunity for the
researchers from academia and industry to meet and discuss latest
solutions, scientific results and methods in the usage and
applications of ICT in the real world.
Objective:
--------------
As we all know, our society has been through several dramatic changes,
driven by innovations such as transportation systems, telephone etc.
Last few decades have experienced technologies that are evolving so
rapidly, altering the constraints of space and time, and reshaping the way
we communicate, learn and think. Rapid advances in information technologies
and other digital systems are reshaping our ecosystem. Innovations in ICT
allow us to transmit information quickly and widely, propelling the growth
of new urban communities, linking distant places and diverse areas of
endeavor in productive new ways, which a decade ago was unimaginable. Thus,
the theme of this World Congress is ?Innovating ICT For Social Revolutions?.
The four day World Congress is expected to provide an opportunity for the
researchers from academia and industry to meet and discuss the latest
solutions, scientific results and methods in the usage and applications of
ICT in the real world. The conference programme will include workshops,
special sessions and tutorials, along with prominent keynote speakers and
regular paper presentations in parallel tracks. All accepted papers will be
compiled in conference proceedings published by the IEEE.
Publication: IEEE
-------------------------
All accepted papers will be compiled in conference proceedings published by
the IEEE. Like previous editions, all accepted papers presented at WICT 2012
may be selected and recommended for possible publication in Journal
Special Issues and Edited Volumes (indexed by SCI, EI Compendex, etc.).
http://www.mirlabs.org/wict13/journal.php
Call for Papers:
----------------------
Please submit your papers to one of the following tracks or the main track
mentioned in the link: http://www.mirlabs.org/wict13/cfp.php
Author Guidelines:
--------------------------
Submission of paper should be made through the submission link:
http://www.easychair.org/conferences/?conf=wict20130
Please refer to the conference website link
http://www.mirlabs.org/wict13/#submission for guidelines to prepare your
manuscript. All accepted papers will be compiled in conference
proceedings published by the IEEE. It is mandatory that at least one of the
authors registers for every paper that is included in the conference
proceedings. Proceedings will be made available during the conference.
Call for Workshops and Special Sessions:
------------------------------------------------------------
WICT 2013 is seeking original high quality Special Sessions and Workshops
on focused discussion addressing innovative research highlighting
significant topics and emerging issues which are related to the conference
theme and with the desired expertise. Interdisciplinary session themes are
strongly sought after. Each special session resembles a mini-conference
within the main WICT meeting and will run throughout the conference in
parallel to other tracks (except the keynote presentations).
Important Dates:
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
Organizing Committee
(please see web site)
Contact:
Technical Matters:
Ajith Abraham
< ajith.abraham@ieee.org>
Local Organization:
Ngo Thanh Long,
<ngotlong@gmail.com>
------------------------------
Message: 2
Date: Mon, 23 Sep 2013 11:40:32 -0300
From: Yoshiharu Kohayakawa <yoshi@ime.usp.br>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Faculty Position - Dept of CS, U. of Sao Paulo
Message-ID: <21056.21216.388566.275696@renyi.ime.usp.br>
Content-Type: text/plain; charset=iso-8859-1
University of S?o Paulo
Institute of Mathematics and Statistics
Department of Computer Science
Tenure-Track Positions
Assistant Professor
Application Deadline: 15th October 2013
http://www.ime.usp.br/dcc/faculty_position
The Institute of Mathematics and Statistics of the University of S?o
Paulo (IME-USP) invites applications for faculty positions at the
Assistant Professor level. The Department is accepting applications in
all areas of Computer Science.
We expect candidates with strong potential for research and teaching.
The candidates should have a PhD in Computer Science or a related
area. The selected candidate will be responsible for research and for
teaching in the programs of the department (undergraduate and graduate
courses). Deadlines and documents required for the application are
specified at
http://www.ime.usp.br/dcc/faculty_position
The documents and selection interview may be either in Portuguese or
English.
The University of S?o Paulo (USP) is one of the most prestigious
universities in South America and it is the top university of Brazil.
The Department of Computer Science of the U. of S?o Paulo is
responsible for the BSc, MSc and PhD degrees in Computer Science,
offering some of the most competitive courses in the country.
More information: http://www.ime.usp.br/dcc
Contact: mac@ime.usp.br
(Another opening is expected to be announced in the near future.)
------------------------------
Message: 3
Date: Mon, 23 Sep 2013 17:32:50 +0200
From: Kaufmann Paul <paul.kaufmann@gmail.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2nd CFP: EvoENERGY 2014
Message-ID: <1BE46F1F-38DF-44E5-A9C6-59E879F5C41C@gmail.com>
Content-Type: text/plain; charset=us-ascii
EvoENERGY 2014
Evolutionary Algorithms in Energy Applications
23-25 April 2014 - Baeza, Spain
http://www.evostar.org
INTRODUCTION
Along with the worldwide incentive to reduce fossil and nuclear based power
generation, the number of distributed generators and other forms of
distributed energy resources which are installed in power networks has been
steadily increasing over the last years. This increased integration has
triggered a transformation of the energy system and challenges the
conventional operation of these networks.
On a network level, this transformation requires new control and communication
approaches, to guarantee the security of energy supplies as well as an optimal
exploitation of available resources. On a generator level, advanced control
strategies as well as morphological optimization (e.g., tuning of wind-blade
design) can help to assure an optimal performance of the generator.
EvoEnergy is intended as a platform for new, innovative computational
intelligence and nature-inspired techniques in the domain of energy-related
optimization research. We seek contributions ranging from new control concepts
for decentralized generation, strategies for their coordination in the network
to the morphological optimization of distributed generators.
TOPICS
Topics of interest include, but are not limited to, any of
the following:
- management of distributed generation and storage
- evolutionary design and morphological optimization in energy systems
- advanced distribution management system functionalities
- Smart Grid monitoring and control
- real time configurations of energy networks
- distributed optimization in energy networks
- grid planning and asset management
- energy demand reduction through evolutionary design optimisation
PUBLICATION DETAILS
Accepted papers will appear in the proceedings of EvoStar, published in a
volume of the Springer Lecture Notes in Computer Science, which will be
available at the Conference.
Submissions must be original and not published elsewhere. The submissions will
be peer reviewed by at least three members of the program committee. The
authors of accepted papers will have to improve their paper on the basis of
the reviewers comments and will be asked to send a camera ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference and attend the conference and present the work. The
reviewing process will be double-blind, please omit information about the
authors in the submitted paper.
Submission format: Springer LNCS (see EvoENERGY web page)
Page limit: 12 pages
Submission page: http://myreview.csregistry.org/evoapps14/
IMPORTANT DATES
Submission deadline: 1 November 2013
Notification:
Camera ready:
EvoENERGY: 23-25 April 2014
CHAIRS
Paul Kaufmann, University of Kassel, paul.kaufmann(at)gmail.com
Kyrre Glette, University of Oslo, kyrrehg(at)ifi.uio.no
CONFIRMED PROGRAM COMMITTEE
Andy Tyrrell, University of York, UK
Frank Neumann, University of Adelaide, AU
Jan Ringelstein, Fraunhofer Institure for Wind Technology and Energy System Technology, Germany
Kalyan Veeramachaneni, MIT Computer Science and Artificial Intelligence Laboratory, US
Konrad Diwold, Fraunhofer Institure for Wind Technology and Energy System Technology, Germany
Maizura Mokhtar, University of Central Lancashire, UK
Martin Middendorf, University of Leipzig, Germany
Peter Palensky, Austrian Institute of Technology, Austria
Ralph Evins, Laboratory of Building Science and Technology, Empa, Switzerland
Sanaz Mostaghim, Karlsruhe Institute of Technology, Germany
Una-May O'Reilly, MIT Computer Science and Artificial Intelligence Laboratory, US
------------------------------
Message: 4
Date: Mon, 23 Sep 2013 23:10:35 +0200
From: Ross Kang <ross.kang@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Utrecht Graphs Workshop, 31/10 & 1/11, a second
announcement
Message-ID:
<CAEN33Ljafgyn8=AEdMv8yd7cb7+5ah7jNdfjrco90zG2G7tR9w@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
We are pleased to announce a workshop in graph theory to be held on
Thursday, 31 October and Friday, 1 November 2013. It will take place
in Utrecht, an ancient and beautiful city in the heart of the
Netherlands.
We have an exciting programme planned. The speakers include Maria
Axenovich (Karlsruhe), Aart Blokhuis (Eindhoven), Hajo Broersma
(Twente), Louis Esperet (CNRS), Tom Kaiser (West Bohemia), Dan Kr?l'
(Warwick), Alex Scott (Oxford), Benny Sudakov (UCLA/ETH), and Carsten
Thomassen (DTU).
There are a limited number of slots for short contributed talks; those
interested are requested to send their provisional talk titles.
The workshop is open to all, but participants are kindly asked to
register by email to ross.kang@gmail.com. Make sure to include the
following information: name and affiliation (as it should appear on a
badge), dietary restrictions, day/time of arrival/departure. We may be
able to provide a booking code for a discount at a recommended hotel,
on request.
More information on the event at
http://www.staff.science.uu.nl/~Kang0002/UGW2013.html
Sincerely yours,
Ross Kang and Tobias M?ller
------------------------------
Message: 5
Date: Tue, 24 Sep 2013 15:49:54 +0200
From: duer@uni-trier.de
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc Position at Univ. Trier
Message-ID: <20130924154954.8wufhgse0wogks88@webmail.uni-trier.de>
Content-Type: text/plain; charset=ISO-8859-1; DelSp="Yes";
format="flowed"
Applications are invited for a postdoc position at the Department of
Mathematics at the University of Trier (Germany).
The postdoc will be working in the research project "Completely
Positive and Copositive Matrices" which is funded by the
German-Israeli Foundation for Scientific Research and Development
(GIF). The investigators in this project are Mirjam Duer (University
of Trier, Germany), Abraham Berman (Technion - Israel Institute of
Technology, Haifa) and Naomi Shaked-Monderer (The Max Stern Yezreel
Valley College). The research area will be in the intersection of
matrix theory and nonlinear optimization. More specifically, we are
interested in optimization problems over the copositive and completely
positive matrix cones, as well as the geometry of these cones.
The position will be starting 1 January 2014 or later, and is granted
for one year. Monthly salary will be according to TVL-E13. The
position may be extended for a second year which will be spent in
Israel at the Technion.
Applicants must hold a PhD degree in mathematics or a related field,
and should have an expertise in either matrix theory or conic
optimization. They should be able to communicate in English, German is
desirable but not mandatory.
Applications should include:
* a letter of application
* a detailed curriculum vitae
* names of two possible references
and should be directed by email in a single pdf-file to:
Prof. Dr. Mirjam Duer
Department of Mathematics
University of Trier
54286 Trier, Germany
T: +49 651 201 3481
E: duer@uni-trier.de
W: http://www.math.uni-trier.de/~duer/
For full consideration applications must be received by 20 October
2013, however late applications will be considered until the position
is filled.
------------------------------
Message: 6
Date: Tue, 24 Sep 2013 17:12:50 +0000
From: Andrea Richa <Andrea.Richa@asu.edu>
To: "'dmanet@zpr.uni-koeln.de'" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] NSF-Workshop (at SODA 2014) on Self-Organizing
Particle Systems
Message-ID:
<55A3A1B68C3B4B41878CBB7CA83C748910F322A5@exmbt04.asurite.ad.asu.edu>
Content-Type: text/plain; charset="us-ascii"
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from
thetheory and practice of self-organizing physical and biological systems
in order to report on recent advances in this area and to identify
directions for interdisciplinary research that will help shape the future
of the field. The one-day meeting will consist of several invited talks
around four major research areas, namely
- amorphous computing,
- modular robotics,
- self-organizing biological systems, and
- self-assembling DNA
Confirmed speakers are currently Bernard Chazelle (Princeton U.), John Reif
(Duke U.), Mark Yim (U. Pennsylvania), Nikolaus Correll (U. Colorado), and
Andrea Richa (Arizona State U.). For more information please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities. Application deadline: November 17, 2013
======================================================
Organizers:
Andrea W. Richa, Arizona State University, USA
Christian Scheideler, University of Paderborn, Germany
--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng., CIDSE |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha
------------------------------
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 22
**************************************
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. WICT 2013 - Final CFP - Hanoi, Vietnam (Ajith Abraham)
2. Faculty Position - Dept of CS, U. of Sao Paulo
(Yoshiharu Kohayakawa)
3. 2nd CFP: EvoENERGY 2014 (Kaufmann Paul)
4. Utrecht Graphs Workshop, 31/10 & 1/11, a second announcement
(Ross Kang)
5. Postdoc Position at Univ. Trier (duer@uni-trier.de)
6. NSF-Workshop (at SODA 2014) on Self-Organizing Particle
Systems (Andrea Richa)
----------------------------------------------------------------------
Message: 1
Date: Mon, 23 Sep 2013 07:52:13 +0530
From: Ajith Abraham <ajith.abraham@ieee.org>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] WICT 2013 - Final CFP - Hanoi, Vietnam
Message-ID:
<CAGkggF5SNxmT3nicouLzoOmVJiqWqg4mCvSmeHx3L_kBTEYO-A@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
-- Apologies for cross posting --
Final deadline: September 30, 2013
** WICT 2013 - Second Call for Papers **
Third World Congress on Information and Communication Technologies ( WICT2013)
December 15-18, 2013
Venue: Hanoi, Vietnam
http://www.mirlabs.org/wict13
http://www.mirlabs.net/wict13
Related event: SoCPaR 2013: http://www.mirlabs.org/socpar13
After the success of the Second World Congress on Information and
Communication Technologies (WICT 2012 -
http://www.mirlabs.net/wict12), we are pleased to announce the
organization of WICT 2013 to provide an opportunity for the
researchers from academia and industry to meet and discuss latest
solutions, scientific results and methods in the usage and
applications of ICT in the real world.
Objective:
--------------
As we all know, our society has been through several dramatic changes,
driven by innovations such as transportation systems, telephone etc.
Last few decades have experienced technologies that are evolving so
rapidly, altering the constraints of space and time, and reshaping the way
we communicate, learn and think. Rapid advances in information technologies
and other digital systems are reshaping our ecosystem. Innovations in ICT
allow us to transmit information quickly and widely, propelling the growth
of new urban communities, linking distant places and diverse areas of
endeavor in productive new ways, which a decade ago was unimaginable. Thus,
the theme of this World Congress is ?Innovating ICT For Social Revolutions?.
The four day World Congress is expected to provide an opportunity for the
researchers from academia and industry to meet and discuss the latest
solutions, scientific results and methods in the usage and applications of
ICT in the real world. The conference programme will include workshops,
special sessions and tutorials, along with prominent keynote speakers and
regular paper presentations in parallel tracks. All accepted papers will be
compiled in conference proceedings published by the IEEE.
Publication: IEEE
-------------------------
All accepted papers will be compiled in conference proceedings published by
the IEEE. Like previous editions, all accepted papers presented at WICT 2012
may be selected and recommended for possible publication in Journal
Special Issues and Edited Volumes (indexed by SCI, EI Compendex, etc.).
http://www.mirlabs.org/wict13/journal.php
Call for Papers:
----------------------
Please submit your papers to one of the following tracks or the main track
mentioned in the link: http://www.mirlabs.org/wict13/cfp.php
Author Guidelines:
--------------------------
Submission of paper should be made through the submission link:
http://www.easychair.org/conferences/?conf=wict20130
Please refer to the conference website link
http://www.mirlabs.org/wict13/#submission for guidelines to prepare your
manuscript. All accepted papers will be compiled in conference
proceedings published by the IEEE. It is mandatory that at least one of the
authors registers for every paper that is included in the conference
proceedings. Proceedings will be made available during the conference.
Call for Workshops and Special Sessions:
------------------------------------------------------------
WICT 2013 is seeking original high quality Special Sessions and Workshops
on focused discussion addressing innovative research highlighting
significant topics and emerging issues which are related to the conference
theme and with the desired expertise. Interdisciplinary session themes are
strongly sought after. Each special session resembles a mini-conference
within the main WICT meeting and will run throughout the conference in
parallel to other tracks (except the keynote presentations).
Important Dates:
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
Organizing Committee
(please see web site)
Contact:
Technical Matters:
Ajith Abraham
< ajith.abraham@ieee.org>
Local Organization:
Ngo Thanh Long,
<ngotlong@gmail.com>
------------------------------
Message: 2
Date: Mon, 23 Sep 2013 11:40:32 -0300
From: Yoshiharu Kohayakawa <yoshi@ime.usp.br>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Faculty Position - Dept of CS, U. of Sao Paulo
Message-ID: <21056.21216.388566.275696@renyi.ime.usp.br>
Content-Type: text/plain; charset=iso-8859-1
University of S?o Paulo
Institute of Mathematics and Statistics
Department of Computer Science
Tenure-Track Positions
Assistant Professor
Application Deadline: 15th October 2013
http://www.ime.usp.br/dcc/faculty_position
The Institute of Mathematics and Statistics of the University of S?o
Paulo (IME-USP) invites applications for faculty positions at the
Assistant Professor level. The Department is accepting applications in
all areas of Computer Science.
We expect candidates with strong potential for research and teaching.
The candidates should have a PhD in Computer Science or a related
area. The selected candidate will be responsible for research and for
teaching in the programs of the department (undergraduate and graduate
courses). Deadlines and documents required for the application are
specified at
http://www.ime.usp.br/dcc/faculty_position
The documents and selection interview may be either in Portuguese or
English.
The University of S?o Paulo (USP) is one of the most prestigious
universities in South America and it is the top university of Brazil.
The Department of Computer Science of the U. of S?o Paulo is
responsible for the BSc, MSc and PhD degrees in Computer Science,
offering some of the most competitive courses in the country.
More information: http://www.ime.usp.br/dcc
Contact: mac@ime.usp.br
(Another opening is expected to be announced in the near future.)
------------------------------
Message: 3
Date: Mon, 23 Sep 2013 17:32:50 +0200
From: Kaufmann Paul <paul.kaufmann@gmail.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2nd CFP: EvoENERGY 2014
Message-ID: <1BE46F1F-38DF-44E5-A9C6-59E879F5C41C@gmail.com>
Content-Type: text/plain; charset=us-ascii
EvoENERGY 2014
Evolutionary Algorithms in Energy Applications
23-25 April 2014 - Baeza, Spain
http://www.evostar.org
INTRODUCTION
Along with the worldwide incentive to reduce fossil and nuclear based power
generation, the number of distributed generators and other forms of
distributed energy resources which are installed in power networks has been
steadily increasing over the last years. This increased integration has
triggered a transformation of the energy system and challenges the
conventional operation of these networks.
On a network level, this transformation requires new control and communication
approaches, to guarantee the security of energy supplies as well as an optimal
exploitation of available resources. On a generator level, advanced control
strategies as well as morphological optimization (e.g., tuning of wind-blade
design) can help to assure an optimal performance of the generator.
EvoEnergy is intended as a platform for new, innovative computational
intelligence and nature-inspired techniques in the domain of energy-related
optimization research. We seek contributions ranging from new control concepts
for decentralized generation, strategies for their coordination in the network
to the morphological optimization of distributed generators.
TOPICS
Topics of interest include, but are not limited to, any of
the following:
- management of distributed generation and storage
- evolutionary design and morphological optimization in energy systems
- advanced distribution management system functionalities
- Smart Grid monitoring and control
- real time configurations of energy networks
- distributed optimization in energy networks
- grid planning and asset management
- energy demand reduction through evolutionary design optimisation
PUBLICATION DETAILS
Accepted papers will appear in the proceedings of EvoStar, published in a
volume of the Springer Lecture Notes in Computer Science, which will be
available at the Conference.
Submissions must be original and not published elsewhere. The submissions will
be peer reviewed by at least three members of the program committee. The
authors of accepted papers will have to improve their paper on the basis of
the reviewers comments and will be asked to send a camera ready version of
their manuscripts. At least one author of each accepted work has to register
for the conference and attend the conference and present the work. The
reviewing process will be double-blind, please omit information about the
authors in the submitted paper.
Submission format: Springer LNCS (see EvoENERGY web page)
Page limit: 12 pages
Submission page: http://myreview.csregistry.org/evoapps14/
IMPORTANT DATES
Submission deadline: 1 November 2013
Notification:
Camera ready:
EvoENERGY: 23-25 April 2014
CHAIRS
Paul Kaufmann, University of Kassel, paul.kaufmann(at)gmail.com
Kyrre Glette, University of Oslo, kyrrehg(at)ifi.uio.no
CONFIRMED PROGRAM COMMITTEE
Andy Tyrrell, University of York, UK
Frank Neumann, University of Adelaide, AU
Jan Ringelstein, Fraunhofer Institure for Wind Technology and Energy System Technology, Germany
Kalyan Veeramachaneni, MIT Computer Science and Artificial Intelligence Laboratory, US
Konrad Diwold, Fraunhofer Institure for Wind Technology and Energy System Technology, Germany
Maizura Mokhtar, University of Central Lancashire, UK
Martin Middendorf, University of Leipzig, Germany
Peter Palensky, Austrian Institute of Technology, Austria
Ralph Evins, Laboratory of Building Science and Technology, Empa, Switzerland
Sanaz Mostaghim, Karlsruhe Institute of Technology, Germany
Una-May O'Reilly, MIT Computer Science and Artificial Intelligence Laboratory, US
------------------------------
Message: 4
Date: Mon, 23 Sep 2013 23:10:35 +0200
From: Ross Kang <ross.kang@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Utrecht Graphs Workshop, 31/10 & 1/11, a second
announcement
Message-ID:
<CAEN33Ljafgyn8=AEdMv8yd7cb7+5ah7jNdfjrco90zG2G7tR9w@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
We are pleased to announce a workshop in graph theory to be held on
Thursday, 31 October and Friday, 1 November 2013. It will take place
in Utrecht, an ancient and beautiful city in the heart of the
Netherlands.
We have an exciting programme planned. The speakers include Maria
Axenovich (Karlsruhe), Aart Blokhuis (Eindhoven), Hajo Broersma
(Twente), Louis Esperet (CNRS), Tom Kaiser (West Bohemia), Dan Kr?l'
(Warwick), Alex Scott (Oxford), Benny Sudakov (UCLA/ETH), and Carsten
Thomassen (DTU).
There are a limited number of slots for short contributed talks; those
interested are requested to send their provisional talk titles.
The workshop is open to all, but participants are kindly asked to
register by email to ross.kang@gmail.com. Make sure to include the
following information: name and affiliation (as it should appear on a
badge), dietary restrictions, day/time of arrival/departure. We may be
able to provide a booking code for a discount at a recommended hotel,
on request.
More information on the event at
http://www.staff.science.uu.nl/~Kang0002/UGW2013.html
Sincerely yours,
Ross Kang and Tobias M?ller
------------------------------
Message: 5
Date: Tue, 24 Sep 2013 15:49:54 +0200
From: duer@uni-trier.de
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc Position at Univ. Trier
Message-ID: <20130924154954.8wufhgse0wogks88@webmail.uni-trier.de>
Content-Type: text/plain; charset=ISO-8859-1; DelSp="Yes";
format="flowed"
Applications are invited for a postdoc position at the Department of
Mathematics at the University of Trier (Germany).
The postdoc will be working in the research project "Completely
Positive and Copositive Matrices" which is funded by the
German-Israeli Foundation for Scientific Research and Development
(GIF). The investigators in this project are Mirjam Duer (University
of Trier, Germany), Abraham Berman (Technion - Israel Institute of
Technology, Haifa) and Naomi Shaked-Monderer (The Max Stern Yezreel
Valley College). The research area will be in the intersection of
matrix theory and nonlinear optimization. More specifically, we are
interested in optimization problems over the copositive and completely
positive matrix cones, as well as the geometry of these cones.
The position will be starting 1 January 2014 or later, and is granted
for one year. Monthly salary will be according to TVL-E13. The
position may be extended for a second year which will be spent in
Israel at the Technion.
Applicants must hold a PhD degree in mathematics or a related field,
and should have an expertise in either matrix theory or conic
optimization. They should be able to communicate in English, German is
desirable but not mandatory.
Applications should include:
* a letter of application
* a detailed curriculum vitae
* names of two possible references
and should be directed by email in a single pdf-file to:
Prof. Dr. Mirjam Duer
Department of Mathematics
University of Trier
54286 Trier, Germany
T: +49 651 201 3481
E: duer@uni-trier.de
W: http://www.math.uni-trier.de/~duer/
For full consideration applications must be received by 20 October
2013, however late applications will be considered until the position
is filled.
------------------------------
Message: 6
Date: Tue, 24 Sep 2013 17:12:50 +0000
From: Andrea Richa <Andrea.Richa@asu.edu>
To: "'dmanet@zpr.uni-koeln.de'" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] NSF-Workshop (at SODA 2014) on Self-Organizing
Particle Systems
Message-ID:
<55A3A1B68C3B4B41878CBB7CA83C748910F322A5@exmbt04.asurite.ad.asu.edu>
Content-Type: text/plain; charset="us-ascii"
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from
thetheory and practice of self-organizing physical and biological systems
in order to report on recent advances in this area and to identify
directions for interdisciplinary research that will help shape the future
of the field. The one-day meeting will consist of several invited talks
around four major research areas, namely
- amorphous computing,
- modular robotics,
- self-organizing biological systems, and
- self-assembling DNA
Confirmed speakers are currently Bernard Chazelle (Princeton U.), John Reif
(Duke U.), Mark Yim (U. Pennsylvania), Nikolaus Correll (U. Colorado), and
Andrea Richa (Arizona State U.). For more information please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities. Application deadline: November 17, 2013
======================================================
Organizers:
Andrea W. Richa, Arizona State University, USA
Christian Scheideler, University of Paderborn, Germany
--
Prof. Andrea W. Richa |Phone: 480-965-7555
Computer Science & Eng., CIDSE |FAX: 480-965-2751
Arizona State University |E-mail: aricha@asu.edu
PO Box 878809, Tempe AZ 85287-8809|Homepage:www.public.asu.edu/~aricha
------------------------------
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 22
**************************************
dmanet Digest, Vol 67, Issue 21
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. Postdoctoral Positions in Algorithms and Lower Bounds
(Bristol University, UK) (Raphael Clifford)
2. PhD studentship available for the project "Real-Time
Scheduling of Patrols Serving Motor Vehicle Breakdowns" (Bektas T.)
3. LATA 2014: 3rd call for papers (GRLMC)
4. SoCPaR 2013 - Final CFP - Hanoi, Vietnam (Ajith Abraham)
5. IPDPS 2014 - ALERT! Abstract Submission Deadline Approaching
(Francesco Silvestri)
----------------------------------------------------------------------
Message: 1
Date: Tue, 24 Sep 2013 15:10:57 +0100
From: Raphael Clifford <clifford@cs.bris.ac.uk>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoctoral Positions in Algorithms and Lower
Bounds (Bristol University, UK)
Message-ID:
<CAFHc1QaWPn+qe_A80fHqW8RnF7Y9p0KSbt9RUymRPrn22C7kNQ@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
Two three-year postdoctoral positions available in Algorithms and
Lower bounds at
the University of Bristol, UK.
This is a ?rolling advert? with a nominal advert close date of 31
December 2013. Applications are welcome at any time and the timing of
the selection process will be dependent on the applications received.
Start date is dependent on the circumstances of the successful
candidates.
Based in the Department of Computer Science at the University of
Bristol you will carry out research within a project concerned with
the development of new algorithms as well as provable time and space
lower bounds. This is part of an EPSRC funded research project on
pattern matching in dynamically changing as well as streaming data.
The role will require a high level of expertise in areas which may include
but not be limited to data structures, algorithms, probability,
discrete mathematics and combinatorics. Candidates with a strong
mathematical background are particularly encouraged to apply.
Post 1
The emphasis will be new pattern matching algorithms with provable
performance bounds such as appear in the conferences
ICALP/SODA/STOC/FOCS. You will also at times implement and test
algorithms related to the proposal.
Post 2
This role will have as its main focus the development of time and
space lower bounds for pattern matching problems. You will ideally
already be familiar with lower bound techniques such as the chronogram
method and Mihai Patrascu?s information transfer method.
For both posts you will have Ph.D. in theoretical computer science or
closely related area together with a strong track record of
international publications in algorithms/theoretical computer science
venues.
In addition you will have excellent written and spoken communication
skills including the ability to explain and share deep concepts. You
should have a strong mathematical background and ideally excellent
programming skills.
Appointments will be made at Research Assistant or Research Associate
depending on skills and experience.
More details are available by following the link in the News section
of http://www.cs.bris.ac.uk/Research/Algorithms/ .
Informal enquires can be made by email to Raphael.Clifford@bristol.ac.uk .
------------------------------
Message: 2
Date: Tue, 24 Sep 2013 14:33:47 +0000
From: "Bektas T." <T.Bektas@soton.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD studentship available for the project "Real-Time
Scheduling of Patrols Serving Motor Vehicle Breakdowns"
Message-ID: <CE676158.7B5B%t.bektas@soton.ac.uk>
Content-Type: text/plain; charset="iso-8859-1"
This PhD project will address problems of deployment and real-time
scheduling of patrol vehicles that have to service breakdowns. The main
goal of the project will be to use operational research techniques to
design algorithms that are effective in dealing with problems with about
2500 patrol vehicles across the UK. Specific objectives are:
(a) finding the optimal number and locations of new patrol stations (if
any) to be established under the uncertainty of the breakdown locations;
(b) determining the number of patrol vehicles to be deployed at each
(existing or new) station; and
? online scheduling of the patrol vehicles to service the incoming
requests for assistance within a target response time (where possible),
and with an overall objective of minimizing the total operation costs.
A simulation model will also be developed to evaluate the performance of
the algorithms that are developed.
The student will be based in the Operational Research Group in
Mathematical Sciences at the University of Southampton. The project will
run in collaboration with the AA (Automobile Association), which is based
in Basingstoke. Consequently, the student will spend some time in the AA
offices observing the processes, collecting data, liaising with staff, and
eventually communicating the results. The project will be jointly
supervised by Prof. Chris Potts and Prof. Tolga Bektas.
Applicants should have completed, or expect to complete before November
2013, a Bachelor?s degree in Operational Research, Mathematics,
Statistics, or a related area with at least an upper second class
classification (or the equivalent), and preferably a Master?s degree. The
deadline for applications is 14 October 2013, and the latest start date
for the PhD project is 1 December 2013.
The studentship will cover tuition fees at the UK/EU level and a stipend
of approximately ?13,500. Both UK/EU students and international students
are encouraged to apply.
Further information is available by contacting Chris Potts
(C.N.Potts@soton.ac.uk<mailto:C.N.Potts@soton.ac.uk>
<mailto:C.N.Potts@soton.ac.uk%3E>). Online applications can be made from
link on the website:
http://www.southampton.ac.uk/postgraduate/pgstudy/howdoiapplypg.html
------------------------------
Message: 3
Date: Sun, 22 Sep 2013 09:52:16 +0200
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] LATA 2014: 3rd call for papers
Message-ID: <596333893974440EA65953B8C574AB1C@Carlos1>
Content-Type: text/plain; charset="iso-8859-1"
8th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND
APPLICATIONS
LATA 2014
Madrid, Spain
March 10-14, 2014
Organized by:
Research Group on Implementation of Language-Driven Software and
Applications (ILSA)
Complutense University of Madrid
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/lata2014/
*********************************************************************
AIMS:
LATA is a yearly conference on theoretical computer science and its
applications. Following the tradition of the diverse PhD training events in
the field developed at Rovira i Virgili University in Tarragona since 2002,
LATA 2014 will reserve significant room for young scholars at the beginning
of their career. It will aim at attracting contributions from both classical
theory fields and application areas (bioinformatics, language technology,
artificial intelligence, etc.).
VENUE:
LATA 2014 will take place in Madrid, the capital of Spain. The venue will be
the School of Informatics of Complutense University.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata, concurrency and Petri nets
automatic structures
cellular automata
codes
combinatorics on words
compilers
computability
computational complexity
data and image compression
decidability issues on words and languages
descriptional complexity
DNA and other models of bio-inspired computing
digital libraries and document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
language-theoretic foundations of artificial intelligence and artificial
life
natural language and speech automatic processing
parallel and regulated rewriting
parsing
patterns
power series
quantum, chemical and optical computing
semantics
string and combinatorial issues in computational biology and bioinformatics
string processing algorithms
symbolic dynamics
symbolic neural networks
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2014 will consist of:
invited talks
invited tutorials
peer-reviewed contributions
INVITED SPEAKERS:
Javier Esparza (Munich Tech, DE), On Trees and Fixed Point Equations
(tutorial)
Leslie A. Goldberg (Oxford, UK), The Complexity of Approximate Counting
Oscar H. Ibarra (Santa Barbara, US), tba
Sanjeev Khanna (Philadelphia, US), tba
Helmut Seidl (Munich Tech, DE), tba
PROGRAMME COMMITTEE:
Dana Angluin (Yale, US)
Eugene Asarin (Paris Diderot, FR)
Jos Baeten (Amsterdam, NL)
Christel Baier (Dresden, DE)
Jan Bergstra (Amsterdam, NL)
Jin-Yi Cai (Madison, US)
Marek Chrobak (Riverside, US)
Andrea Corradini (Pisa, IT)
Mariangiola Dezani (Turin, IT)
Ding-Zhu Du (Dallas, US)
Michael R. Fellows (Darwin, AU)
J?rg Flum (Freiburg, DE)
Nissim Francez (Technion, IL)
J?rgen Giesl (Aachen, DE)
Annegret Habel (Oldenburg, DE)
Kazuo Iwama (Kyoto, JP)
Sampath Kannan (Philadelphia, US)
Ming-Yang Kao (Northwestern, US)
Deepak Kapur (Albuquerque, US)
Joost-Pieter Katoen (Aachen, DE)
S. Rao Kosaraju (Johns Hopkins, US)
Evangelos Kranakis (Carleton, CA)
Gad M. Landau (Haifa, IL)
Andrzej Lingas (Lund, SE)
Jack Lutz (Iowa State, US)
Ian Mackie (?cole Polytechnique, FR)
Carlos Mart?n-Vide (Tarragona, ES, chair)
Giancarlo Mauri (Milan, IT)
Faron G. Moller (Swansea, UK)
Paliath Narendran (Albany, US)
Enno Ohlebusch (Ulm, DE)
Helmut Prodinger (Stellenbosch, ZA)
Jean-Fran?ois Raskin (Brussels, BE)
Wolfgang Reisig (Humboldt Berlin, DE)
Marco Roveri (Bruno Kessler, Trento, IT)
Micha?l Rusinowitch (LORIA, Nancy, FR)
Yasubumi Sakakibara (Keio, JP)
Davide Sangiorgi (Bologna, IT)
Colin Stirling (Edinburgh, UK)
Jianwen Su (Santa Barbara, US)
Jean-Pierre Talpin (IRISA, Rennes, FR)
Andrzej Tarlecki (Warsaw, PL)
Rick Thomas (Leicester, UK)
Sophie Tison (Lille, FR)
Rob van Glabbeek (NICTA, Sydney, AU)
Helmut Veith (Vienna Tech, AT)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Ana Fern?ndez-Pampill?n (Madrid)
Carlos Mart?n-Vide (Tarragona, co-chair)
Antonio Sarasa (Madrid)
Jos?-Luis Sierra (Madrid, co-chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=lata2014
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be
available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed extended versions of some of the papers contributed to the
conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration is open from July 15, 2013 to March 10, 2014.
The registration form can be found at:
http://grammars.grlmc.com/lata2014/Registration.php
DEADLINES:
Paper submission: October 14, 2013 (23:59 CET)
Notification of paper acceptance or rejection: November 25, 2013
Final version of the paper for the LNCS proceedings: December 2, 2013
Early registration: December 9, 2013
Late registration: February 24, 2014
Starting of the conference: March 10, 2014
End of the conference: March 14, 2014
Submission to the post-conference journal special issue: June 14, 2014
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
LATA 2014
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Departament d?Economia i Coneixement, Generalitat de Catalunya
Universidad Complutense de Madrid
Universitat Rovira i Virgili
------------------------------
Message: 4
Date: Sun, 22 Sep 2013 20:31:09 +0530
From: Ajith Abraham <ajith.abraham@ieee.org>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SoCPaR 2013 - Final CFP - Hanoi, Vietnam
Message-ID:
<CAGkggF7aB0xe2nRted2whtdcT_7kj7mfk9uykoWcELRF-O8ALQ@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
----------------------------------------------------------------------------------------------------------------------
Apologies for cross-posting. Appreciate if you can distribute this CFP
to your network.
----------------------------------------------------------------------------------------------------------------------
Extended Dateline:
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
*** SoCPaR 2013 - Final Call for Papers ***
Fifth International Conference on Soft Computing and Pattern
Recognition (SoCPaR 2013)
* Hanoi, Vietnam *
December 15-18, 2013
http://www.mirlabs.net/socpar13/
http://www.mirlabs.org/socpar13/
------------------------------
Objective:
The aspiration of SoCPaR 2013 is to bring together worldwide leading
researchers, developers, practitioners, and educators interested in
advancing the state of the art in soft computing and pattern
recognition for exchanging knowledge that encompasses a broad range of
disciplines among various distinct communities. It is hoped that
researchers will bring new prospect for collaboration across
disciplines and gain idea facilitating novel breakthrough. The 4-day
conference will feature prominent keynote speakers,workshop,tutorials,
poster and paper presentation in parallel tracks. SoCPaR 2013 invites
novel contributions/papers of soft computing and pattern recognition
from fundamental aspects to various practical applications.
Topics:
** Soft Computing and Applications **
Evolutionary computing
Swarm intelligence
Artificial immune systems
Fuzzy Sets
Uncertainty analysis
Fractals
Rough Sets
Support vector machines
Artificial neural networks
Case Based Reasoning
Wavelets
Hybrid intelligent systems
Nature inspired computing techniques
Machine learning
Ambient intelligence
Hardware implementations
** Pattern Recognition and Applications **
Information retrieval
Data Mining
Web Mining
Image Processing
Computer Vision
Bio-informatics
Information security
Network security
Steganography
Biometry
Remote sensing
Medical Informatics
E-commerce
Signal Processing
Control systems
Author Guidelines:
--------------------------
Submission of paper should be made through the submission link:
https://www.easychair.org/account/signin.cgi?conf=socpar2013
Please refer to the conference website for guidelines to prepare your
manuscript. All accepted papers will be compiled in conference
proceedings published by the IEEE. It is mandatory at least an author
registers for every paper that is included in the conference
proceedings. Proceedings will be made available during the conference.
Expanded versions of SoCPaR 2013 selected papers will be published in
special issues of internationally referred journals (SCI/SCIE).
Important Dates:
------------------------
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
SoCPaR 2013 Organizing team:
---------------------------------------------
General Chairs
---------------------
Long Thanh Ngo, Le Quy Don University, Vietnam
Ajith Abraham, MIR Labs, USA
Andre Carvalho, Universidade de Sao Paulo, Brazil
Program Chairs
----------------------
Vaclav Snasel, VSB- Technical University of Ostrava, Czech Republic
Lam Thu Bui, Le Quy Don University, Vietnam
Emilio Corchado, University of Salamanca, Spain
Advisory Chairs and TPC Members, please see web site:
http://www.mirlabs.org/socpar13/committees.php
Local information Contact:
-------------------------------------
Ngo Thanh Long
ngotlong@gmail.com
------------------------------
Message: 5
Date: Sun, 22 Sep 2013 19:45:03 +0200
From: Francesco Silvestri <silvest1@dei.unipd.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IPDPS 2014 - ALERT! Abstract Submission Deadline
Approaching
Message-ID:
<CANYQr1dBMR6a8fqeoR7JuEH+eNT+fHb898p-g9L1pUnXjGSjow@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
IPDPS 2014 September 21, 2013 Release
----------------------------------------------
28th IEEE International Parallel & Distributed Processing Symposium
May 19-23, 2014
Arizona Grand Resort
PHOENIX (Arizona) USA
www.ipdps.org
---------------------------------------------
- October 11, 2013......Abstracts due
- October 18, 2013......Submission deadline
----------------------------------------------
IPDPS 2014 ALERTS
...Submission portal now open at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Due dates for most of 21 workshops are after December 09, 2013. See
http://www.ipdps.org/ipdps2014/2014_workshops.html
----------------------------------------------
IPDPS 2014 CALL FOR PAPERS
----------------------------------------------
----------------------------------------------
SCOPE : Authors are invited to submit manuscripts that present
original unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
- Parallel and distributed algorithms, focusing on topics such as:
numerical, combinatorial, and data-intensive parallel algorithms,
scalability of algorithms and data structures for parallel and
distributed systems, communication and synchronization protocols,
network algorithms, scheduling, and load balancing.
- Applications of parallel and distributed computing, including
computational and data-enabled science and engineering, big data
applications, parallel crowd sourcing, large-scale social network
analysis, management of big data, cloud and grid computing, scientific
and biomedical applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, big
data approaches, or discussing scalability toward the exascale level
are encouraged.
- Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; novel big data architectures; special-purpose
architectures, including graphics processors, signal processors,
network processors, media accelerators, and other special purpose
processors and accelerators; impact of technology on architecture;
network and interconnect architectures; parallel I/O and storage
systems; architecture of the memory hierarchy; power-efficient and
green computing architectures; dependable architectures; and
performance modeling and evaluation.
- Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools. Papers focusing on novel software systems for
big data and exascale systems are encouraged.
WHAT/WHERE TO SUBMIT
More details on submissions and instructions for submitting
manuscripts are available at www.ipdps.org. All submitted manuscripts
will be reviewed. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal. Go to
this page for instructions on submitting manuscripts:
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
IMPORTANT DATES
?October 11, 2013......Abstracts due
?October 18, 2013......Submission deadline
?December 09, 2013...Author notification
?February 01, 2014.....Camera ready due
----------------------------------------------
IPDPS 2014 CALL FOR PARTICIPATION
---------------------------------------------------------
---------------------------------------------------------
The 28th IEEE International Parallel & Distributed Processing
Symposium will be held 19-23 May 2014 in Phoenix at the Arizona Grand
Resort, an all-suites family-friendly resort and meeting place.
Phoenix has an international airport and is the hub for several US
airlines. It is only a six hour drive from Los Angeles and Las Vegas
and the starting point for one day tours of the Grand Canyon as well
as other historic communities in the area. For those who come early or
stay late, there are boundless Southwest tourist attractions and
activities. For shorter trip times, AGR has a water-world, golf
course, and hiking and riding trails on the premises and an indoor
athletic club and spa for fitness training. Check the IPDPS Web pages
for updates and information on workshops, the PhD Forum, and other
events as the full program develops and see the full call for papers
for details on submitting papers for 2014.
GENERAL CHAIR
Manish PARASHAR (Rutgers University, USA)
PROGRAM CHAIR
David A. BADER (Georgia Institute of Technology, USA)
PROGRAM VICE-CHAIRS
-Algorithms
Anne BENOIT (ENS Lyon, France)
-Applications
Padma RAGHAVAN (Pennsylvania State University, USA)
-Architecture
Yan SOLIHIN (North Carolina State University, USA)
-Software
Ron BRIGHTWELL (Sandia National Laboratories, USA)
WORKSHOPS CHAIR
?mit V. ?ATALY?REK (Ohio State University, USA)
WORKSHOPS VICE-CHAIR
Yogesh SIMMHAN (University of Southern California, USA)
----------------------------------------------
IPDPS 2014 WORKSHOPS
IPDPS workshops, held on the first and last days of the symposium,
provide attendees an opportunity to explore special topics. The 21
workshops planned for IPDPS 2014 in Phoenix are listed
athttp://www.ipdps.org/ipdps2014/2014_workshops.html. That page has a
link to the call for papers for each workshop. Note that most
workshops have a due date for submissions later than the author
notification date of December 9th for regular conference papers.
PhD FORUM CO-CHAIRS
Luc BOUG? (ENS Cachan, France)
Bo HONG (Georgia Institute of Technology, USA)
----------------------------------------------
ENHANCED STUDENT AUTHOR PROGRAM 2014
The PhD Forum & Student Author Program will provide added value to
encourage advisors to bring their students to IPDPS, with an enhanced
program providing a comprehensive venue for students to better prepare
for their research and career path in parallel and distributed
computing. Participating students will have the opportunity to both
present their research work and interact with senior academic and
industry people in an informal setting. In addition, there will be
mentoring sessions to help students improve communication skills,
obtain valuable information for career planning, get familiar with a
few of the trendy research topics, and make valuable contacts ? all
while enjoying the IPDPS main conference and many associated
workshops. See details at
http://www.ipdps.org/ipdps2014/2014_phd_forum.html
28th IEEE International Parallel & Distributed Processing Symposium
----------------------------------------------------------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
----------------------------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
------------------------------
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 21
**************************************
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. Postdoctoral Positions in Algorithms and Lower Bounds
(Bristol University, UK) (Raphael Clifford)
2. PhD studentship available for the project "Real-Time
Scheduling of Patrols Serving Motor Vehicle Breakdowns" (Bektas T.)
3. LATA 2014: 3rd call for papers (GRLMC)
4. SoCPaR 2013 - Final CFP - Hanoi, Vietnam (Ajith Abraham)
5. IPDPS 2014 - ALERT! Abstract Submission Deadline Approaching
(Francesco Silvestri)
----------------------------------------------------------------------
Message: 1
Date: Tue, 24 Sep 2013 15:10:57 +0100
From: Raphael Clifford <clifford@cs.bris.ac.uk>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoctoral Positions in Algorithms and Lower
Bounds (Bristol University, UK)
Message-ID:
<CAFHc1QaWPn+qe_A80fHqW8RnF7Y9p0KSbt9RUymRPrn22C7kNQ@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
Two three-year postdoctoral positions available in Algorithms and
Lower bounds at
the University of Bristol, UK.
This is a ?rolling advert? with a nominal advert close date of 31
December 2013. Applications are welcome at any time and the timing of
the selection process will be dependent on the applications received.
Start date is dependent on the circumstances of the successful
candidates.
Based in the Department of Computer Science at the University of
Bristol you will carry out research within a project concerned with
the development of new algorithms as well as provable time and space
lower bounds. This is part of an EPSRC funded research project on
pattern matching in dynamically changing as well as streaming data.
The role will require a high level of expertise in areas which may include
but not be limited to data structures, algorithms, probability,
discrete mathematics and combinatorics. Candidates with a strong
mathematical background are particularly encouraged to apply.
Post 1
The emphasis will be new pattern matching algorithms with provable
performance bounds such as appear in the conferences
ICALP/SODA/STOC/FOCS. You will also at times implement and test
algorithms related to the proposal.
Post 2
This role will have as its main focus the development of time and
space lower bounds for pattern matching problems. You will ideally
already be familiar with lower bound techniques such as the chronogram
method and Mihai Patrascu?s information transfer method.
For both posts you will have Ph.D. in theoretical computer science or
closely related area together with a strong track record of
international publications in algorithms/theoretical computer science
venues.
In addition you will have excellent written and spoken communication
skills including the ability to explain and share deep concepts. You
should have a strong mathematical background and ideally excellent
programming skills.
Appointments will be made at Research Assistant or Research Associate
depending on skills and experience.
More details are available by following the link in the News section
of http://www.cs.bris.ac.uk/Research/Algorithms/ .
Informal enquires can be made by email to Raphael.Clifford@bristol.ac.uk .
------------------------------
Message: 2
Date: Tue, 24 Sep 2013 14:33:47 +0000
From: "Bektas T." <T.Bektas@soton.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD studentship available for the project "Real-Time
Scheduling of Patrols Serving Motor Vehicle Breakdowns"
Message-ID: <CE676158.7B5B%t.bektas@soton.ac.uk>
Content-Type: text/plain; charset="iso-8859-1"
This PhD project will address problems of deployment and real-time
scheduling of patrol vehicles that have to service breakdowns. The main
goal of the project will be to use operational research techniques to
design algorithms that are effective in dealing with problems with about
2500 patrol vehicles across the UK. Specific objectives are:
(a) finding the optimal number and locations of new patrol stations (if
any) to be established under the uncertainty of the breakdown locations;
(b) determining the number of patrol vehicles to be deployed at each
(existing or new) station; and
? online scheduling of the patrol vehicles to service the incoming
requests for assistance within a target response time (where possible),
and with an overall objective of minimizing the total operation costs.
A simulation model will also be developed to evaluate the performance of
the algorithms that are developed.
The student will be based in the Operational Research Group in
Mathematical Sciences at the University of Southampton. The project will
run in collaboration with the AA (Automobile Association), which is based
in Basingstoke. Consequently, the student will spend some time in the AA
offices observing the processes, collecting data, liaising with staff, and
eventually communicating the results. The project will be jointly
supervised by Prof. Chris Potts and Prof. Tolga Bektas.
Applicants should have completed, or expect to complete before November
2013, a Bachelor?s degree in Operational Research, Mathematics,
Statistics, or a related area with at least an upper second class
classification (or the equivalent), and preferably a Master?s degree. The
deadline for applications is 14 October 2013, and the latest start date
for the PhD project is 1 December 2013.
The studentship will cover tuition fees at the UK/EU level and a stipend
of approximately ?13,500. Both UK/EU students and international students
are encouraged to apply.
Further information is available by contacting Chris Potts
(C.N.Potts@soton.ac.uk<mailto:C.N.Potts@soton.ac.uk>
<mailto:C.N.Potts@soton.ac.uk%3E>). Online applications can be made from
link on the website:
http://www.southampton.ac.uk/postgraduate/pgstudy/howdoiapplypg.html
------------------------------
Message: 3
Date: Sun, 22 Sep 2013 09:52:16 +0200
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] LATA 2014: 3rd call for papers
Message-ID: <596333893974440EA65953B8C574AB1C@Carlos1>
Content-Type: text/plain; charset="iso-8859-1"
8th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND
APPLICATIONS
LATA 2014
Madrid, Spain
March 10-14, 2014
Organized by:
Research Group on Implementation of Language-Driven Software and
Applications (ILSA)
Complutense University of Madrid
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
http://grammars.grlmc.com/lata2014/
*********************************************************************
AIMS:
LATA is a yearly conference on theoretical computer science and its
applications. Following the tradition of the diverse PhD training events in
the field developed at Rovira i Virgili University in Tarragona since 2002,
LATA 2014 will reserve significant room for young scholars at the beginning
of their career. It will aim at attracting contributions from both classical
theory fields and application areas (bioinformatics, language technology,
artificial intelligence, etc.).
VENUE:
LATA 2014 will take place in Madrid, the capital of Spain. The venue will be
the School of Informatics of Complutense University.
SCOPE:
Topics of either theoretical or applied interest include, but are not
limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata, concurrency and Petri nets
automatic structures
cellular automata
codes
combinatorics on words
compilers
computability
computational complexity
data and image compression
decidability issues on words and languages
descriptional complexity
DNA and other models of bio-inspired computing
digital libraries and document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
language-theoretic foundations of artificial intelligence and artificial
life
natural language and speech automatic processing
parallel and regulated rewriting
parsing
patterns
power series
quantum, chemical and optical computing
semantics
string and combinatorial issues in computational biology and bioinformatics
string processing algorithms
symbolic dynamics
symbolic neural networks
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2014 will consist of:
invited talks
invited tutorials
peer-reviewed contributions
INVITED SPEAKERS:
Javier Esparza (Munich Tech, DE), On Trees and Fixed Point Equations
(tutorial)
Leslie A. Goldberg (Oxford, UK), The Complexity of Approximate Counting
Oscar H. Ibarra (Santa Barbara, US), tba
Sanjeev Khanna (Philadelphia, US), tba
Helmut Seidl (Munich Tech, DE), tba
PROGRAMME COMMITTEE:
Dana Angluin (Yale, US)
Eugene Asarin (Paris Diderot, FR)
Jos Baeten (Amsterdam, NL)
Christel Baier (Dresden, DE)
Jan Bergstra (Amsterdam, NL)
Jin-Yi Cai (Madison, US)
Marek Chrobak (Riverside, US)
Andrea Corradini (Pisa, IT)
Mariangiola Dezani (Turin, IT)
Ding-Zhu Du (Dallas, US)
Michael R. Fellows (Darwin, AU)
J?rg Flum (Freiburg, DE)
Nissim Francez (Technion, IL)
J?rgen Giesl (Aachen, DE)
Annegret Habel (Oldenburg, DE)
Kazuo Iwama (Kyoto, JP)
Sampath Kannan (Philadelphia, US)
Ming-Yang Kao (Northwestern, US)
Deepak Kapur (Albuquerque, US)
Joost-Pieter Katoen (Aachen, DE)
S. Rao Kosaraju (Johns Hopkins, US)
Evangelos Kranakis (Carleton, CA)
Gad M. Landau (Haifa, IL)
Andrzej Lingas (Lund, SE)
Jack Lutz (Iowa State, US)
Ian Mackie (?cole Polytechnique, FR)
Carlos Mart?n-Vide (Tarragona, ES, chair)
Giancarlo Mauri (Milan, IT)
Faron G. Moller (Swansea, UK)
Paliath Narendran (Albany, US)
Enno Ohlebusch (Ulm, DE)
Helmut Prodinger (Stellenbosch, ZA)
Jean-Fran?ois Raskin (Brussels, BE)
Wolfgang Reisig (Humboldt Berlin, DE)
Marco Roveri (Bruno Kessler, Trento, IT)
Micha?l Rusinowitch (LORIA, Nancy, FR)
Yasubumi Sakakibara (Keio, JP)
Davide Sangiorgi (Bologna, IT)
Colin Stirling (Edinburgh, UK)
Jianwen Su (Santa Barbara, US)
Jean-Pierre Talpin (IRISA, Rennes, FR)
Andrzej Tarlecki (Warsaw, PL)
Rick Thomas (Leicester, UK)
Sophie Tison (Lille, FR)
Rob van Glabbeek (NICTA, Sydney, AU)
Helmut Veith (Vienna Tech, AT)
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Ana Fern?ndez-Pampill?n (Madrid)
Carlos Mart?n-Vide (Tarragona, co-chair)
Antonio Sarasa (Madrid)
Jos?-Luis Sierra (Madrid, co-chair)
Bianca Truthe (Magdeburg)
Florentina Lilica Voicu (Tarragona)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting
original and unpublished research. Papers should not exceed 12 single-spaced
pages (including eventual appendices) and should be formatted according to
the standard format for Springer Verlag's LNCS series (see
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).
Submissions have to be uploaded to:
https://www.easychair.org/conferences/?conf=lata2014
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be
available by the time of the conference.
A special issue of a major journal will be later published containing
peer-reviewed extended versions of some of the papers contributed to the
conference. Submissions to it will be by invitation.
REGISTRATION:
The period for registration is open from July 15, 2013 to March 10, 2014.
The registration form can be found at:
http://grammars.grlmc.com/lata2014/Registration.php
DEADLINES:
Paper submission: October 14, 2013 (23:59 CET)
Notification of paper acceptance or rejection: November 25, 2013
Final version of the paper for the LNCS proceedings: December 2, 2013
Early registration: December 9, 2013
Late registration: February 24, 2014
Starting of the conference: March 10, 2014
End of the conference: March 14, 2014
Submission to the post-conference journal special issue: June 14, 2014
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
LATA 2014
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34-977-559543
Fax: +34-977-558386
ACKNOWLEDGEMENTS:
Departament d?Economia i Coneixement, Generalitat de Catalunya
Universidad Complutense de Madrid
Universitat Rovira i Virgili
------------------------------
Message: 4
Date: Sun, 22 Sep 2013 20:31:09 +0530
From: Ajith Abraham <ajith.abraham@ieee.org>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] SoCPaR 2013 - Final CFP - Hanoi, Vietnam
Message-ID:
<CAGkggF7aB0xe2nRted2whtdcT_7kj7mfk9uykoWcELRF-O8ALQ@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
----------------------------------------------------------------------------------------------------------------------
Apologies for cross-posting. Appreciate if you can distribute this CFP
to your network.
----------------------------------------------------------------------------------------------------------------------
Extended Dateline:
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
*** SoCPaR 2013 - Final Call for Papers ***
Fifth International Conference on Soft Computing and Pattern
Recognition (SoCPaR 2013)
* Hanoi, Vietnam *
December 15-18, 2013
http://www.mirlabs.net/socpar13/
http://www.mirlabs.org/socpar13/
------------------------------
Objective:
The aspiration of SoCPaR 2013 is to bring together worldwide leading
researchers, developers, practitioners, and educators interested in
advancing the state of the art in soft computing and pattern
recognition for exchanging knowledge that encompasses a broad range of
disciplines among various distinct communities. It is hoped that
researchers will bring new prospect for collaboration across
disciplines and gain idea facilitating novel breakthrough. The 4-day
conference will feature prominent keynote speakers,workshop,tutorials,
poster and paper presentation in parallel tracks. SoCPaR 2013 invites
novel contributions/papers of soft computing and pattern recognition
from fundamental aspects to various practical applications.
Topics:
** Soft Computing and Applications **
Evolutionary computing
Swarm intelligence
Artificial immune systems
Fuzzy Sets
Uncertainty analysis
Fractals
Rough Sets
Support vector machines
Artificial neural networks
Case Based Reasoning
Wavelets
Hybrid intelligent systems
Nature inspired computing techniques
Machine learning
Ambient intelligence
Hardware implementations
** Pattern Recognition and Applications **
Information retrieval
Data Mining
Web Mining
Image Processing
Computer Vision
Bio-informatics
Information security
Network security
Steganography
Biometry
Remote sensing
Medical Informatics
E-commerce
Signal Processing
Control systems
Author Guidelines:
--------------------------
Submission of paper should be made through the submission link:
https://www.easychair.org/account/signin.cgi?conf=socpar2013
Please refer to the conference website for guidelines to prepare your
manuscript. All accepted papers will be compiled in conference
proceedings published by the IEEE. It is mandatory at least an author
registers for every paper that is included in the conference
proceedings. Proceedings will be made available during the conference.
Expanded versions of SoCPaR 2013 selected papers will be published in
special issues of internationally referred journals (SCI/SCIE).
Important Dates:
------------------------
Paper submission due: September 30, 2013
Notification of paper acceptance: October 20, 2013
Final manuscript due: November 05, 2013
Registration and full payment due: November 05, 2013
SoCPaR 2013 Organizing team:
---------------------------------------------
General Chairs
---------------------
Long Thanh Ngo, Le Quy Don University, Vietnam
Ajith Abraham, MIR Labs, USA
Andre Carvalho, Universidade de Sao Paulo, Brazil
Program Chairs
----------------------
Vaclav Snasel, VSB- Technical University of Ostrava, Czech Republic
Lam Thu Bui, Le Quy Don University, Vietnam
Emilio Corchado, University of Salamanca, Spain
Advisory Chairs and TPC Members, please see web site:
http://www.mirlabs.org/socpar13/committees.php
Local information Contact:
-------------------------------------
Ngo Thanh Long
ngotlong@gmail.com
------------------------------
Message: 5
Date: Sun, 22 Sep 2013 19:45:03 +0200
From: Francesco Silvestri <silvest1@dei.unipd.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IPDPS 2014 - ALERT! Abstract Submission Deadline
Approaching
Message-ID:
<CANYQr1dBMR6a8fqeoR7JuEH+eNT+fHb898p-g9L1pUnXjGSjow@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252
IPDPS 2014 September 21, 2013 Release
----------------------------------------------
28th IEEE International Parallel & Distributed Processing Symposium
May 19-23, 2014
Arizona Grand Resort
PHOENIX (Arizona) USA
www.ipdps.org
---------------------------------------------
- October 11, 2013......Abstracts due
- October 18, 2013......Submission deadline
----------------------------------------------
IPDPS 2014 ALERTS
...Submission portal now open at
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
...Due dates for most of 21 workshops are after December 09, 2013. See
http://www.ipdps.org/ipdps2014/2014_workshops.html
----------------------------------------------
IPDPS 2014 CALL FOR PAPERS
----------------------------------------------
----------------------------------------------
SCOPE : Authors are invited to submit manuscripts that present
original unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
- Parallel and distributed algorithms, focusing on topics such as:
numerical, combinatorial, and data-intensive parallel algorithms,
scalability of algorithms and data structures for parallel and
distributed systems, communication and synchronization protocols,
network algorithms, scheduling, and load balancing.
- Applications of parallel and distributed computing, including
computational and data-enabled science and engineering, big data
applications, parallel crowd sourcing, large-scale social network
analysis, management of big data, cloud and grid computing, scientific
and biomedical applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, big
data approaches, or discussing scalability toward the exascale level
are encouraged.
- Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; novel big data architectures; special-purpose
architectures, including graphics processors, signal processors,
network processors, media accelerators, and other special purpose
processors and accelerators; impact of technology on architecture;
network and interconnect architectures; parallel I/O and storage
systems; architecture of the memory hierarchy; power-efficient and
green computing architectures; dependable architectures; and
performance modeling and evaluation.
- Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools. Papers focusing on novel software systems for
big data and exascale systems are encouraged.
WHAT/WHERE TO SUBMIT
More details on submissions and instructions for submitting
manuscripts are available at www.ipdps.org. All submitted manuscripts
will be reviewed. Submitted papers should NOT have appeared in or be
under consideration for another conference, workshop or journal. Go to
this page for instructions on submitting manuscripts:
http://www.ipdps.org/ipdps2014/2014_call_for_papers.html
IMPORTANT DATES
?October 11, 2013......Abstracts due
?October 18, 2013......Submission deadline
?December 09, 2013...Author notification
?February 01, 2014.....Camera ready due
----------------------------------------------
IPDPS 2014 CALL FOR PARTICIPATION
---------------------------------------------------------
---------------------------------------------------------
The 28th IEEE International Parallel & Distributed Processing
Symposium will be held 19-23 May 2014 in Phoenix at the Arizona Grand
Resort, an all-suites family-friendly resort and meeting place.
Phoenix has an international airport and is the hub for several US
airlines. It is only a six hour drive from Los Angeles and Las Vegas
and the starting point for one day tours of the Grand Canyon as well
as other historic communities in the area. For those who come early or
stay late, there are boundless Southwest tourist attractions and
activities. For shorter trip times, AGR has a water-world, golf
course, and hiking and riding trails on the premises and an indoor
athletic club and spa for fitness training. Check the IPDPS Web pages
for updates and information on workshops, the PhD Forum, and other
events as the full program develops and see the full call for papers
for details on submitting papers for 2014.
GENERAL CHAIR
Manish PARASHAR (Rutgers University, USA)
PROGRAM CHAIR
David A. BADER (Georgia Institute of Technology, USA)
PROGRAM VICE-CHAIRS
-Algorithms
Anne BENOIT (ENS Lyon, France)
-Applications
Padma RAGHAVAN (Pennsylvania State University, USA)
-Architecture
Yan SOLIHIN (North Carolina State University, USA)
-Software
Ron BRIGHTWELL (Sandia National Laboratories, USA)
WORKSHOPS CHAIR
?mit V. ?ATALY?REK (Ohio State University, USA)
WORKSHOPS VICE-CHAIR
Yogesh SIMMHAN (University of Southern California, USA)
----------------------------------------------
IPDPS 2014 WORKSHOPS
IPDPS workshops, held on the first and last days of the symposium,
provide attendees an opportunity to explore special topics. The 21
workshops planned for IPDPS 2014 in Phoenix are listed
athttp://www.ipdps.org/ipdps2014/2014_workshops.html. That page has a
link to the call for papers for each workshop. Note that most
workshops have a due date for submissions later than the author
notification date of December 9th for regular conference papers.
PhD FORUM CO-CHAIRS
Luc BOUG? (ENS Cachan, France)
Bo HONG (Georgia Institute of Technology, USA)
----------------------------------------------
ENHANCED STUDENT AUTHOR PROGRAM 2014
The PhD Forum & Student Author Program will provide added value to
encourage advisors to bring their students to IPDPS, with an enhanced
program providing a comprehensive venue for students to better prepare
for their research and career path in parallel and distributed
computing. Participating students will have the opportunity to both
present their research work and interact with senior academic and
industry people in an informal setting. In addition, there will be
mentoring sessions to help students improve communication skills,
obtain valuable information for career planning, get familiar with a
few of the trendy research topics, and make valuable contacts ? all
while enjoying the IPDPS main conference and many associated
workshops. See details at
http://www.ipdps.org/ipdps2014/2014_phd_forum.html
28th IEEE International Parallel & Distributed Processing Symposium
----------------------------------------------------------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
----------------------------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
------------------------------
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 21
**************************************
Saturday, September 21, 2013
dmanet Digest, Vol 67, Issue 20
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
**************************************
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
**************************************
Friday, September 20, 2013
dmanet Digest, Vol 67, Issue 19
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. ISAIM 2014: Second Call for Papers (Dimitris Diochnos)
2. 1 PhD position in Parameterized Complexity at TU Berlin
(application deadline: October 1) (Stefan Kratsch)
----------------------------------------------------------------------
Message: 1
Date: Thu, 19 Sep 2013 20:37:03 +0100
From: Dimitris Diochnos <D.Diochnos@ed.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ISAIM 2014: Second Call for Papers
Message-ID: <32D671BE-8D44-4EF0-86EC-5FF82696AAA7@ed.ac.uk>
Content-Type: text/plain; charset=us-ascii
SECOND CALL FOR PAPERS
Thirteenth International Symposium on
ARTIFICIAL INTELLIGENCE and MATHEMATICS
ISAIM 2014
http://www.cs.uic.edu/Isaim2014/
January 6-8, 2014
Fort Lauderdale, Florida
PAPER SUBMISSION DEADLINE: October 15, 2013
The International Symposium on Artificial Intelligence and Mathematics (ISAIM) is a biennial meeting that fosters interactions between mathematics, theoretical computer science, and artificial intelligence. This is the thirteenth Symposium in the series, which is sponsored by the journal Annals of Mathematics and Artificial Intelligence and by Florida Atlantic University. We seek submissions of recent results, with a particular emphasis on the foundations of AI and mathematical methods used in AI. Papers describing applications are also encouraged, but the focus should be on principled lessons learned from the development of the application. Traditionally, the Symposium attracts participants from a variety of disciplines, thereby providing a unique forum for scientific exchange. The three-day Symposium includes invited speakers, presentations of technical papers, and special topic sessions. The Symposium takes place at the Embassy Suites Hotel in Fort Lauderdale. Plea!
se visit http://www.cs.uic.edu/Isaim2014/Venue for more information about the venue.
SPECIAL TOPIC INVITED SESSIONS:
o Boolean and pseudo-Boolean Functions
-Organized by Endre Boros, Rutgers University, and Yves Crama, University of Liege
o Mathematical Theories of Natural Language Processing
-Organized by Andras Kornai, Hungarian Academy of Sciences
o Theory of Machine Learning
-Organized by Lev Reyzin, University of Illinois at Chicago
o Proposals for organizing additional special sessions can be sent to the chairs for consideration by September 15, 2013.
INVITED SPEAKERS:
o Peter Stone, University of Texas at Austin
o Csaba Szepesvari, University of Alberta
PAPER SUBMISSION:
Paper submission will be electronic via the submission link on the Paper Submission page of the Symposium website (http://www.cs.uic.edu/Isaim2014/). Papers must be formatted in accordance with the guidelines given there.
The submission deadline is October 15, 2013 (11:59 PM PDT). Papers will be reviewed by members of the Program Committee. Authors will be notified of acceptance or rejection by November 15, 2013. Final versions of accepted papers, for inclusion in the conference electronic proceedings, are due by December 15, 2013.
Work that has already been published as of the ISAIM submission deadline should not be submitted to ISAIM unless it introduces a significant addition to the previously published work. However, the ISAIM web site proceedings are not archival, so papers submitted to ISAIM can be under review at the time of submission and can be submitted elsewhere after ISAIM.
Authors of a selected set of papers from the Symposium will be invited to submit full versions of their papers for inclusion in a special volume of the Annals of Mathematics and Artificial Intelligence, published by Springer. Those invited submissions will be subject to refereeing at the usual standards of the journal, and authors will receive more details with the acceptance notice. Papers must of course be new and unpublished to be considered for the special volume.
Any questions regarding paper submission should be sent to the program committee chairs at the email address <isaim2014 at cs DOT uic DOT edu>.
IMPORTANT DATES:
Paper submission: October 15, 2013
Notification: November 15, 2013
Final version due: December 15, 2013
Workshop: January 6-8, 2014, Ft. Lauderdale, Florida
ORGANIZERS:
o General Chair: Martin Charles Golumbic, University of Haifa
o Conference Chair: Frederick Hoffman, Florida Atlantic University
o Program Committee Chairs: Lisa Hellerstein, Polytechnic Institute of NYU
Gyorgy Turan, University of Illinois at Chicago and University of Szeged
o Publicity Chair: Dimitrios I. Diochnos, University of Edinburgh
PROGRAM COMMITTEE:
Stephane Airiau University of Amsterdam
Endre Boros Rutgers University
Arthur Choi University of California Los Angeles
Berthe Choueiry University of Nebraska-Lincoln
Yves Crama University of Liege
Marek Druzdzel University of Pittsburgh
Roni Khardon Tufts University
Richard Korf University of California Los Angeles
Loizos Michael Open University of Cyprus
Maurice Pagnucco University of New South Wales
Barnabas Poczos Carnegie Mellon University
Francesca Rossi University of Padova
Bart Selman Cornell University
Rocco Servedio Columbia University
Hans-Ulrich Simon Ruhr-University Bochum
Stefan Szeider Vienna University of Technology
Balazs Szorenyi University of Szeged
Miroslaw (Mirek) Truszczynski University of Kentucky
Frank Wolter University of Liverpool
Stefan Woltran Vienna University of Technology
Neil Yorke-Smith American University of Beirut
Send inquiries and requests to isaim2014 at cs DOT uic DOT edu.
Visit http://www.cs.uic.edu/Isaim2014/.
Join isaim@googlegroups.com to receive announcements related to ISAIM.
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
------------------------------
Message: 2
Date: Fri, 20 Sep 2013 10:38:39 +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: <523C098F.700@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.
------------------------------
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 19
**************************************
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. ISAIM 2014: Second Call for Papers (Dimitris Diochnos)
2. 1 PhD position in Parameterized Complexity at TU Berlin
(application deadline: October 1) (Stefan Kratsch)
----------------------------------------------------------------------
Message: 1
Date: Thu, 19 Sep 2013 20:37:03 +0100
From: Dimitris Diochnos <D.Diochnos@ed.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ISAIM 2014: Second Call for Papers
Message-ID: <32D671BE-8D44-4EF0-86EC-5FF82696AAA7@ed.ac.uk>
Content-Type: text/plain; charset=us-ascii
SECOND CALL FOR PAPERS
Thirteenth International Symposium on
ARTIFICIAL INTELLIGENCE and MATHEMATICS
ISAIM 2014
http://www.cs.uic.edu/Isaim2014/
January 6-8, 2014
Fort Lauderdale, Florida
PAPER SUBMISSION DEADLINE: October 15, 2013
The International Symposium on Artificial Intelligence and Mathematics (ISAIM) is a biennial meeting that fosters interactions between mathematics, theoretical computer science, and artificial intelligence. This is the thirteenth Symposium in the series, which is sponsored by the journal Annals of Mathematics and Artificial Intelligence and by Florida Atlantic University. We seek submissions of recent results, with a particular emphasis on the foundations of AI and mathematical methods used in AI. Papers describing applications are also encouraged, but the focus should be on principled lessons learned from the development of the application. Traditionally, the Symposium attracts participants from a variety of disciplines, thereby providing a unique forum for scientific exchange. The three-day Symposium includes invited speakers, presentations of technical papers, and special topic sessions. The Symposium takes place at the Embassy Suites Hotel in Fort Lauderdale. Plea!
se visit http://www.cs.uic.edu/Isaim2014/Venue for more information about the venue.
SPECIAL TOPIC INVITED SESSIONS:
o Boolean and pseudo-Boolean Functions
-Organized by Endre Boros, Rutgers University, and Yves Crama, University of Liege
o Mathematical Theories of Natural Language Processing
-Organized by Andras Kornai, Hungarian Academy of Sciences
o Theory of Machine Learning
-Organized by Lev Reyzin, University of Illinois at Chicago
o Proposals for organizing additional special sessions can be sent to the chairs for consideration by September 15, 2013.
INVITED SPEAKERS:
o Peter Stone, University of Texas at Austin
o Csaba Szepesvari, University of Alberta
PAPER SUBMISSION:
Paper submission will be electronic via the submission link on the Paper Submission page of the Symposium website (http://www.cs.uic.edu/Isaim2014/). Papers must be formatted in accordance with the guidelines given there.
The submission deadline is October 15, 2013 (11:59 PM PDT). Papers will be reviewed by members of the Program Committee. Authors will be notified of acceptance or rejection by November 15, 2013. Final versions of accepted papers, for inclusion in the conference electronic proceedings, are due by December 15, 2013.
Work that has already been published as of the ISAIM submission deadline should not be submitted to ISAIM unless it introduces a significant addition to the previously published work. However, the ISAIM web site proceedings are not archival, so papers submitted to ISAIM can be under review at the time of submission and can be submitted elsewhere after ISAIM.
Authors of a selected set of papers from the Symposium will be invited to submit full versions of their papers for inclusion in a special volume of the Annals of Mathematics and Artificial Intelligence, published by Springer. Those invited submissions will be subject to refereeing at the usual standards of the journal, and authors will receive more details with the acceptance notice. Papers must of course be new and unpublished to be considered for the special volume.
Any questions regarding paper submission should be sent to the program committee chairs at the email address <isaim2014 at cs DOT uic DOT edu>.
IMPORTANT DATES:
Paper submission: October 15, 2013
Notification: November 15, 2013
Final version due: December 15, 2013
Workshop: January 6-8, 2014, Ft. Lauderdale, Florida
ORGANIZERS:
o General Chair: Martin Charles Golumbic, University of Haifa
o Conference Chair: Frederick Hoffman, Florida Atlantic University
o Program Committee Chairs: Lisa Hellerstein, Polytechnic Institute of NYU
Gyorgy Turan, University of Illinois at Chicago and University of Szeged
o Publicity Chair: Dimitrios I. Diochnos, University of Edinburgh
PROGRAM COMMITTEE:
Stephane Airiau University of Amsterdam
Endre Boros Rutgers University
Arthur Choi University of California Los Angeles
Berthe Choueiry University of Nebraska-Lincoln
Yves Crama University of Liege
Marek Druzdzel University of Pittsburgh
Roni Khardon Tufts University
Richard Korf University of California Los Angeles
Loizos Michael Open University of Cyprus
Maurice Pagnucco University of New South Wales
Barnabas Poczos Carnegie Mellon University
Francesca Rossi University of Padova
Bart Selman Cornell University
Rocco Servedio Columbia University
Hans-Ulrich Simon Ruhr-University Bochum
Stefan Szeider Vienna University of Technology
Balazs Szorenyi University of Szeged
Miroslaw (Mirek) Truszczynski University of Kentucky
Frank Wolter University of Liverpool
Stefan Woltran Vienna University of Technology
Neil Yorke-Smith American University of Beirut
Send inquiries and requests to isaim2014 at cs DOT uic DOT edu.
Visit http://www.cs.uic.edu/Isaim2014/.
Join isaim@googlegroups.com to receive announcements related to ISAIM.
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
------------------------------
Message: 2
Date: Fri, 20 Sep 2013 10:38:39 +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: <523C098F.700@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.
------------------------------
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 19
**************************************
Thursday, September 19, 2013
dmanet Digest, Vol 67, Issue 18
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. 2nd Call for Papers: EvoCOP 2014 (Christian Blum)
----------------------------------------------------------------------
Message: 1
Date: Thu, 19 Sep 2013 11:21:34 +0200
From: Christian Blum <christian.c.blum@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd Call for Papers: EvoCOP 2014
Message-ID: <523AC21E.80500@gmail.com>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
** Apologies for multiple copies **
EvoCOP 2014 - 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation
April 23-25, 2014
Baeza, Spain
Part of EVO* 2014 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics for solving difficult
combinatorial optimization problems appearing in various industrial,
economic, and scientific domains. Prominent examples of metaheuristics
include: evolutionary algorithms, simulated annealing, tabu search,
scatter search and path relinking, memetic algorithms, ant colony and
bee colony optimization, particle swarm optimization, variable
neighbourhood search, iterated local search, greedy randomized adaptive
search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2014 conference will be held in the little town of Baeza
located in the south of Spain. It will be held in conjunction with
EuroGP (the 17th European Conference on Genetic Programming), EvoBio
(the 12th European Conference on Evolutionary Computation, Machine
Learning and Data Mining in Computational Biology), EvoMUSART (12th
European conference on evolutionary and biologically inspired music,
sound, art and design) and EvoApplications (specialist events on a range
of evolutionary computation topics and applications), in a joint event
collectively known as EVO*.
For more information see the EvoCOP 2014 webpage
http://www.evostar.org/
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Search-based software engineering
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, 7245 and 7832 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee.
The authors of accepted papers will have to improve their paper on the
basis of the reviewers comments and will be asked to send a camera ready
version of their manuscripts. At least one author of each accepted work
has to register for the conference, attend the conference and present
the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop14/
Page limit: 12 pages
Important Dates
Submission deadline: 1. November 2013
EVO* event: April 23-25, 2014
Programme Chairs
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
Gabriela Ochoa (University of Stirling, Scotland, UK)
gabriela.ochoa(at)cs.stir.ac.uk
------------------------------
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 18
**************************************
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. 2nd Call for Papers: EvoCOP 2014 (Christian Blum)
----------------------------------------------------------------------
Message: 1
Date: Thu, 19 Sep 2013 11:21:34 +0200
From: Christian Blum <christian.c.blum@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd Call for Papers: EvoCOP 2014
Message-ID: <523AC21E.80500@gmail.com>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
** Apologies for multiple copies **
EvoCOP 2014 - 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation
April 23-25, 2014
Baeza, Spain
Part of EVO* 2014 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics for solving difficult
combinatorial optimization problems appearing in various industrial,
economic, and scientific domains. Prominent examples of metaheuristics
include: evolutionary algorithms, simulated annealing, tabu search,
scatter search and path relinking, memetic algorithms, ant colony and
bee colony optimization, particle swarm optimization, variable
neighbourhood search, iterated local search, greedy randomized adaptive
search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2014 conference will be held in the little town of Baeza
located in the south of Spain. It will be held in conjunction with
EuroGP (the 17th European Conference on Genetic Programming), EvoBio
(the 12th European Conference on Evolutionary Computation, Machine
Learning and Data Mining in Computational Biology), EvoMUSART (12th
European conference on evolutionary and biologically inspired music,
sound, art and design) and EvoApplications (specialist events on a range
of evolutionary computation topics and applications), in a joint event
collectively known as EVO*.
For more information see the EvoCOP 2014 webpage
http://www.evostar.org/
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Search-based software engineering
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, 7245 and 7832 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee.
The authors of accepted papers will have to improve their paper on the
basis of the reviewers comments and will be asked to send a camera ready
version of their manuscripts. At least one author of each accepted work
has to register for the conference, attend the conference and present
the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop14/
Page limit: 12 pages
Important Dates
Submission deadline: 1. November 2013
EVO* event: April 23-25, 2014
Programme Chairs
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
Gabriela Ochoa (University of Stirling, Scotland, UK)
gabriela.ochoa(at)cs.stir.ac.uk
------------------------------
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 18
**************************************
Subscribe to:
Posts (Atom)