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. Extended Deadline: MCDA Journal - Special Issue (Joshua Knowles)
2. Reachability Problems (Warsaw 2015) - Presentation-Only
Track: 4th August 2015 (Potapov, Igor)
3. ISCO 2016 - 4th International Symposium on Combinatorial
Optimization (info@isco2016.it)
4. Second Call for Papers for CALDAM 2016. (Anil Maheshwari)
5. SSS 2015 - Final Call for Participation (Maxwell Young)
6. Senior Lecturer/Chair in OR at Lancaster (Letchford, Adam)
----------------------------------------------------------------------
Message: 1
Date: Thu, 30 Jul 2015 14:56:36 +0100
From: Joshua Knowles <j.knowles@manchester.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Extended Deadline: MCDA Journal - Special Issue
Message-ID:
<CAGCv5cgyRoVdFS04_5K8JqxTBNbXVzx67V+1vOhp9nk0CjScrQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear all,
=== Apologies for cross-posting ===
The Special Issue on "Understanding Complexity in Multiobjective
Optimization"
Guest Editors: Salvatore Greco, Kathrin Klamroth, Joshua Knowles, Günter
Rudolph
has extended the submission deadline to _31 October 2015_
Many thanks and best regards,
Joshua
--
Details:
Special Issue on "Understanding Complexity in Multiobjective Optimization"
Guest Editors: Salvatore Greco, Kathrin Klamroth, Joshua Knowles, Günter
Rudolph
This special issue of JMCDA is devoted to further strengthen the links
between the Evolutionary
Multiobjective Optimization (EMO) and Multiple Criteria Decision Making
(MCDM) communities, and to
advance our understanding of different aspects concerning complexity in
multiobjective optimization.
The need for a better understanding of complexity is pressing and timely as
recent work has sometimes
shown opposing views regarding how problems scale and grow in difficulty,
and their inherent
challenges. On the one hand, we know that multiobjective optimization
problems are complex problems
by their very nature. For example optimization problems that are easy to
solve in the single objective case are often
intractable and highly complex already in the biobjective case, and
further fundamental limitations in multiobjective optimization are apparent
as we scale up to many objectives.
On the other hand, a multiobjective perspective can in a sense also help
reduce complexity. For example,
it often leads to a better understanding of a problem and hence supports
the decision making process.
And adding objectives to a problem does not always make it harder, because
decomposing it can
reduce the presence of local optima, for example. From the MCDM point of
view, we observe that
there is an intrinsic complexity in the process of
understanding the optimization problem and building preferences on the
solutions proposed by the
multiobjective optimization. At the beginning of the decision process the
Decision Maker (DM) has a
rather vague idea of the decision problem at hand and, consequently, also
the preferences are
incomplete, approximate, uncertain or fuzzy.
Taking into account the above remarks, complexity in multiobjective
optimization, as the main theme of the special
issue, will be focused around three topics:
Focus 1: Complexity in preference
This topic is mainly concerned with elicitation, representation and
exploitation of the preference of one
or more users, for example: discovering and building preferences that are
dynamic and unstable, group
preference, complex structure of criteria, non-standard preferences,
learning in multiobjective
optimization.
Focus 2: Complexity in optimization
This topic is mainly concerned with the generation of alternative candidate
solutions, given some set of
objective functions and feasible space. The following topics are examples
for the wide range of issues in
this context: high-dimensional problems, complex optimization problems,
simulation-based optimization
and expensive functions, uncertainty and robustness, interrelating decision
and objective space
information.
Focus 3: Complexity in applications
An all-embracing goal is to achieve a better understanding of complexity in
practical problems. Many
fields in the Social Sciences, Economics, Engineering Sciences are
relevant: E-government, Finance,
Environmental Assessment, E-commerce, Public Policy Evaluation, Risk
Management and Security issues
are among the possible application areas.
These three topics will provide a strong basis for progress in both the
theory and practice of handling
complexity in multiobjective optimization in all its guises.
Submissions are now invited for this special issue, which will be subject
to the standard review processes
of the journal. Contributions should be submitted online at
http://mc.manuscriptcentral.com/mcda,
making sure that the box asking whether the submission is for special issue
is checked, and that
"understanding complexity in multiobjective optimization" is entered into
the appropriate field.
The final date for submissions is XX31XXJulyXX now 31 October 2015.
--
Joshua Knowles
Professor of Natural Computation
http://www.cs.bham.ac.uk/~jdk/
School of Computer Science, University of Birmingham, UK
and Honorary Professor, MBS, University of Manchester, UK
------------------------------
Message: 2
Date: Thu, 30 Jul 2015 14:07:20 +0000
From: "Potapov, Igor" <potapov@liverpool.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Reachability Problems (Warsaw 2015) -
Presentation-Only Track: 4th August 2015
Message-ID:
<7ECE8E01AEB79A459E3F30C54E56CF7CC0E41F13@CHEXMBX1.livad.liv.ac.uk>
Content-Type: text/plain; charset="utf-8"
REACHABILITY PROBLEMS 2015
CALL for participation and Informal Presentations
-------------------------------------------------------
The 9th International Workshop on Reachability Problems (RP2015),
21 - 23 September 2015, University of Warsaw, Poland
Deadline for presentations-only track: 4th of August 2015
http://rp2015.mimuw.edu.pl/
++++++++++++++++++++++++++++++++++
The 9th Workshop on Reachability Problems will be hosted by the University
of Warsaw. http://rp2015.mimuw.edu.pl/
The event will take place in the old university campus, at the heart of
Warsaw. The Reachability Workshop is specifically aimed at gathering together
scholars from diverse disciplines interested in reachability problems that appear in
algebraic structures, computational models, hybrid systems, logic and
verification.
Invited Speakers:
- Christel Baier Technische Universität Dresden
- Alessandro D'Innocenzo Università degli Studi dell'Aquila
- Jerome Leroux LABRI, Université Bordeaux
- Peter Bro Miltersen Aarhus Universitet
- Andrey Rybalchenko Microsoft Research
- James Worrell University of Oxford
Topics of interest include (but are not limited to): reachability for
infinite state systems, rewriting systems; reachability analysis in counter/timed/
cellular/communicating automata; Petri nets; computational aspects of
semigroups, groups and rings; reachability in dynamical and hybrid systems;
frontiers between decidable and undecidable reachability problems;
complexity and decidability aspects; predictability in iterative maps and new
computational paradigms.
Submissions: Presentation-Only Track
In addition to regular papers that will appear in our LNCS proceedings, we
invite researchers to apply to give a presentation at RP 2015 without an
accompanying paper. Such presentations can be based on work that has
appeared (or which is going to appear) in the proceedings of another conference, or
which has not yet been submitted. These contributions will be judged
solely on the basis of their attractiveness to the workshop.
To apply to give such a presentation please submit a PDF file containing a
short abstract (up to two pages) by e-mail [ rp2...@easychair.org ] by
August 4th 2015, with subject "RP2015 Presentation-Only Track". This abstract
will not be published in the conference proceedings.
Notification for the presentation-only track will be August 11th 2015.
In addition to LNCS proceedings we plan also to publish selected papers and presentations
in a special issue of Information and Computation Jounral.
RP2015 Program Committee:
Mikołaj Bojańczyk (co-chair) University of Warsaw
Tomas Brazdil Masaryk University, Brno
Thomas Brihaye Université de Mons
Krishnendu Chatterjee IST Austria
Lorenzo Clemente University of Warsaw
Javier Esparza Technische Universität München
Kousha Etessami University of Edinburgh
Stefan Göller ENS Cachan
Christoph Haase ENS Cachan
Tero Harju University of Turku
Raphael Jungers UCLouvain
Sławomir Lasota (co-chair) University of Warsaw
Richard Mayr University of Edinburgh
Pierre McKenzie Université de Montréal
Joel Ouaknine University of Oxford
Giovanni Pighizzini University of Milano
Igor Potapov (co-chair) University of Liverpool
Alexander Rabinovich Tel Aviv University
Sylvain Salvati LaBRI Bordeaux
Sylvain Schmitz ENS Cachan
Olivier Serre LIAFA Paris
PC chairs of RP2015
------------------------------
Message: 3
Date: Thu, 30 Jul 2015 17:42:22 +0200
From: info@isco2016.it
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ISCO 2016 - 4th International Symposium on
Combinatorial Optimization
Message-ID: <1aa064a81767d0014c6e46ee2f6be5e2@pop.isco2016.it>
Content-Type: text/plain; charset=UTF-8; format=flowed
CONFERENCE ANNOUNCEMENT AND SPRING SCHOOL
4th International Symposium on Combinatorial Optimization (ISCO 2016)
May 18-20, 2016 - Vietri sul Mare (Salerno) - Italy
www.isco2016.it
SPRING SCHOOL
A Spring School will be organized before the conference, on May 16-17 in
the same venue.
THEME AND SCOPE
ISCO is a biannual symposium whose aim is to bring together researchers
from all the communities related to combinatorial optimization,
including algorithms and complexity, mathematical programming and
operations research. It is intended to be a forum for presenting
original research in these areas and especially in their intersections.
Quality papers on all aspects of combinatorial optimization, from
mathematical foundations and theory of algorithms to computational
studies and practical applications, are solicited.
SESSIONS
The conference is organized into plenary and parallel sessions. The
conference language is English.
Each speaker can give only one talk.
Proposals for invited sessions are welcome.
Researchers who are interested to organize an invited session should
contact Raffaele Cerulli (raffaele@unisa.it).
CONFERENCE IMPORTANT DATES
Submissions deadline: February 15, 2016
Notification of authors: March 20, 2016
Early registration deadline: April 5, 2016
SPRING SCHOOL IMPORTANT DATES
Early Registration Deadline for Spring School: February 28, 2016
Spring School: May 16-17, 2016
Conference: May 18-20, 2016
CONFERENCE CHAIR
Raffaele Cerulli (University of Salerno, Italy)
Satoru Fujishige (Kyoto University, Japan)
Ridha Mahjoub (University Paris Dauphine, France)
STEERING COMMITTEE
M. Baïou (LIMOS, CNRS, University Blaise Pascal, Clermont-Ferrand,
France)
P. Fouilhoux (University Pierre and Marie Curie, Paris, France)
L. Gouveia (University of Lisbon, Portugal)
N. Maculan (Universidad Federal do Rio de Janeiro, Brasil)
A. R. Mahjoub (University Paris-Dauphine, France)
V. Paschos (University Paris-Dauphine, France)
G. Rinaldi (IASI, Roma, Italy)
ORGANIZING COMMITTEE
Raffaele Cerulli (University of Salerno, Italy)
Francesco Carrabs (University of Salerno, Italy)
Monica Gentili (University of Salerno, Italy)
Ciriaco D'Ambrosio (University of Salerno, Italy)
Andrea Raiconi (University of Salerno, Italy)
Carmine Cerrone (University of Salerno, Italy)
Rosa Pentangelo (University of Salerno, Italy)
Selene Silvestri (University of Salerno, Italy)
PROGRAM COMMITTEE, INVITED SPEAKERS, SPRING SCHOOL TOPIC AND TEACHERS
WILL BE ANNOUNCED SOON IN THE CONFERENCE WEB PAGE: PLEASE STAY TUNED
FOR INFORMATION: info@isco2016.it
------------------------------
Message: 4
Date: Thu, 30 Jul 2015 11:52:45 -0400
From: Anil Maheshwari <maheshwa@scs.carleton.ca>
To: dmanet@zpr.uni-koeln.de, Anil Maheshwari <anil@scs.carleton.ca>
Subject: [DMANET] Second Call for Papers for CALDAM 2016.
Message-ID: <55BA484D.2010700@scs.carleton.ca>
Content-Type: text/plain; charset=utf-8; format=flowed
CALDAM 2016: 2nd Conference on Algorithms and Discrete Applied Mathematics
February 18-20, 2016
Thiruvanthapuram, India
http://caldam.tcs.tifr.res.in/
CALDAM 2016 invites papers describing original research in the areas of
design, analysis and experimental evaluation of algorithms and in
discrete applied mathematics. Papers must be typeset using LaTeX/LaTeX2e
and may not exceed 12 pages in LNCS style, including bibliographic
references. Further details may be included in a clearly marked appendix
that will be read at the discretion of the program committee. Only
electronic submission is allowed. Submitted papers must describe
previously unpublished work and may not be submitted concurrently to
another conference with refereed proceedings or to a refereed journal.
SCOPE
The range of topics within the scope of CALDAM 2016 includes (but is not
limited to) the following
Topics Related to Algorithms
Approximation Algorithms | Combinatorial Algorithms | Combinatorial
Optimization | Computational Biology Computational Complexity |
Computational Geometry | Data Structures | Experimental Algorithm
Methodologies | Graph Algorithms | Graph Drawing | Parallel and
Distributed Algorithms | Parameterized Complexity | Network Optimization
| Online Algorithms | Randomized Algorithms
Topics Related to Discrete Applied Mathematics
Algebraic Combinatorics | Design Theory | Enumeration | Extremal
Combinatorics | Graph Theory | Topological and Analytical Techniques in
Combinatorics | Probabilistic Combinatorics | Combinatorial Number
Theory | Discrete Geometry | Ramsey Theory
PROCEEDINGS
The proceedings of accepted papers will be published in Lecture Notes in
Computer Science by Springer: LNCS. Special issues on CALDAM 2016 are
likely to be published in reputed international journals.
IMPORTANT DATES
Paper Submission: Authors should submit the paper by September 25, 2015,
AOE.
Notification of Acceptance: November 11, 2015
Camera-ready Version: November 28, 2015
Pre-Conference School: February 15-16, 2016
Conference: February 18-20, 2016
SUBMISSION
Submissions may be made using the server atEasy Chair 2016
<https://www.easychair.org/conferences/?conf=caldam2016>
------------------------------
Message: 5
Date: Fri, 31 Jul 2015 09:32:50 -0700
From: Maxwell Young <maxreevesyoung@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SSS 2015 - Final Call for Participation
Message-ID:
<CAO9KOVJ-NttLH+T-ygY4ySeNHpSct-LFiJ=uDsTEZv6b62Q16A@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
======================================================
Final Call for Participation
17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2015)
Edmonton, Alberta, Canada
18-21 August 2015
sss15.cs.ualberta.ca
======================================================
Keynote Speakers:
Distributed Runtime Verification
Sergio Rajsbaum (Instituto de Matematicas, Universidad Nacional Autonoma de
Mexico, Mexico) - Aug. 19
Is Bitcoin Stable, Secure, and Scalable?
Roger Wattenhofer (Distributed Computing Group, ETH Zurich, Switzerland) -
Aug. 20
Correctness Conditions for Randomized Shared Memory Algorithms
Philipp Woelfel (Department of Computer Science, University of Calgary,
Canada) - Aug. 21
======================================================
Summer School Lectures (August 18th)
Communication-less Secure-multiparty-computation
Shlomi Dolev (Ben-Gurion University, Israel)
An Introduction to Distributed Computability via Combinatorial Topology
Sergio Rajsbaum (Universidad Nacional Autonoma de Mexico, Mexico)
Distributed Computing by Mobile Entities
Nicola Santoro (Carleton University, Canada)
======================================================
All registration fees include the summer school as well as the banquet
event.
Regular: CAD$720
Student: CAD$430
======================================================
Please visit the conference webpage for:
- list of accepted papers
- registration
- information on local arrangements
======================================================
------------------------------
Message: 6
Date: Fri, 31 Jul 2015 20:23:14 +0000
From: "Letchford, Adam" <a.n.letchford@lancaster.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>,
Subject: [DMANET] Senior Lecturer/Chair in OR at Lancaster
Message-ID:
<06185FC256DE8543BD7F3AF9F51ACC3435AB6F55@EX-0-MB1.lancs.local>
Content-Type: text/plain; charset="Windows-1252"
Senior Lecturer/Chair in Operations Research (Ref: A1318)
We wish to make a senior appointment in Operations Research. You will have expertise in a range of areas connected with Operations Research that include mathematical methods, algorithm development, and real world applications. You will work with research groups within the Department to strengthen the Department's research agenda in Operations Research. We encourage cooperation with the recently established Centre for Transportation and Logistics (CENTRAL). You will also develop a research agenda involving outside organisations and seek opportunities for collaboration with other Lancaster departments with interests in this area (e.g. Computing and Maths & Stats, Pentland Centre for Sustainability in Business).
Potential research interests may include:
• Mathematical methods of Operations Research
• Optimization in logistics, routing, location and supply chains
• Operations Research and sustainability, e.g. green logistics
• A substantive interest in a knowledge transfer to industry
A desirable quality in the successful candidate would be the ability to envision how new technology and the emerging area of data science can inform operations research methods in the solution of organizational problems. You will also contribute to the new undergraduate programme in Business Analytics and Consultancy and the Masters programmes in Management Science and Operations Research/Logistics and Supply Chain Management and engage with the STOR-i Centre for Doctoral Training.
Candidates should have a relevant PhD, a publication record that demonstrates international excellence and experience of effective organizational engagement.
Full details of the post including job documents, salary and how to apply can be found at:
https://hr-jobs.lancs.ac.uk/Vacancy.aspx?ref=A1318.
Informal enquiries to Professor Matthias Ehrgott, Head of The Department of Management Science, tel: +44 (0)1524 593888, email: m.ehrgott@lancaster.ac.uk
Closing Date: Friday 9th October 2015
Interview date: Wednesday 11th November 2015
------------------------------
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 90, Issue 1
*************************************
No comments:
Post a Comment