Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.deTo 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. [OPODIS 2015] : Just a few days remaining for abstract
registration (Romaric Ludinard)
2. Final CfP: Special Issue in Evolutionary Computation Journal
(MIT Press) on Combinatorial Optimization Problems (September
1st, 2015) (José Francisco Chicano García)
3. Tier II Canada Research Chair in Combinatorics and
Optimization (University of Waterloo) (Alfred Menezes)
----------------------------------------------------------------------
Message: 1
Date: Mon, 17 Aug 2015 19:49:04 +0200
From: Romaric Ludinard <romaric.ludinard@inria.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [OPODIS 2015] : Just a few days remaining for
abstract registration
Message-ID: <55D21E90.9030607@inria.fr>
Content-Type: text/plain; charset=utf-8
We apologize in advance if you receive multiple copies of this CFP.
Please remember that the abstract registration deadline is in a few
days, on 24th August 2015.
========================================================================
OPODIS 2015
The 19th International Conference on Principles of Distributed Systems
14-17 Dec, Rennes
http://opodis2015.irisa.fr
Schedule
Abstract registration: 24 August 2015
Submission deadline: 31 August 2015
Acceptance notification: 5 Nov 2015
Final version due: 19 Nov 2015
Conference: 14-17 Dec 2015, Rennes
========================================================================
OPODIS is an open forum for the exchange of knowledge on distributed
computing and distributed computer systems. All aspects of distributed
systems are within the scope of OPODIS, including theory, specification,
design, performance, and system building. With strong roots in the
theory of distributed systems, OPODIS covers nowadays the whole range
between the theoretical aspects and practical implementations of
distributed systems, as well as experimentation and quantitative
assessments.
*SUBMISSION*
Papers must be submitted electronically in PDF format, use the LIPIcs
style, and be written in English.
Papers shall be formatted in the same way as they will appear in the
proceedings. This should make it transparent to readers, as well as to
reviewers, that the published version and the reviewed version
correspond to each other in length and scope.
In particular, submissions must be formatted using the LaTeX style
templates for LIPIcs at
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/
A submission must not exceed 16 pages, including figures, tables and
references. The first page, which counts towards the total length,
should include the title of the paper, author name(s) and affiliation,
an abstract, contact email, and a list of keywords.
Additional details may be included in a clearly marked appendix or as
further supplementary material, which will be read, or not, at the
discretion of the reviewers. Submissions are expected to be intelligible
and complete without such additional details.
A submission must report on original research that has not previously
appeared, and has not been concurrently submitted to a journal or
conference with published proceedings. Any overlap with a published or
concurrently submitted paper must be clearly indicated.
The Program Co-Chairs reserve the right to refuse, out of hand, papers
that are out of scope, that are of clearly inferior quality, or that
violate the submission guidelines. The remaining papers will undergo a
thorough reviewing process. Each paper will be peer-reviewed in depth by
at least three Program Committee members. The Program Committee will
select contributions to be presented at the conference and published in
the proceedings according to the criteria of originality, clarity, and
completeness.
Papers must be submitted at the following link
https://secure.iacr.org/websubrev/opodis2015/submit/
*TUTORIALS*
OPODIS 2015 will feature selected tutorials, covering research subjects
in the scope of the conference.
Experts in the domains covered by OPODIS are invited to share their
expertise with the community by submitting proposals for tutorials. The
duration of a tutorial is one session (90 to 120 minutes), including
time for questions.
A tutorial proposal should not exceed three (3) pages in length using a
11pt font size. It must include the following information:
-The title of the tutorial;
-An abstract of the tutorial content;
-A brief statement of the relevance of the tutorial to OPODIS;
-The name(s), e-mail address(es) and affiliation(s) of the presenter(s);
-The biography and relevant publications of the presenter(s);
-If the authors will consider submitting an abstract of the tutorial (see
below);
-When applicable, if and where the tutorial has already been given in
the past.
Presenters of tutorials will be given the possibility to publish an
extended abstract of the tutorial content in the proceedings of the
conference. Such extended abstracts are encouraged but optional, and
will have to be accepted through peer review before inclusion.
Tutorial proposals must be sent by email directly to the program co-chairs
in PDF format. More information will appear on:
https://opodis2015.irisa.fr/keynotes-and-tutorials/
The selection will be based on a combination of interest in content from
the perspective and the topics of OPODIS, the timeliness and the
potential to attract or establish new communities, and the proposed
organization.
*PROGRAM CHAIRS*
Christian Cachin, IBM Research - Zurich
Maria Potop-Butucaru, LIP6
*GENERAL CHAIR*
Emmanuelle Anceaume CNRS / IRISA, France
*PROGRAM COMMITTEE*
Silvia Bonomi La Sapienza, Italy
Christian Cachin (co-chair) IBM Research - Zurich, Switzerland
Keren Censor-Hillel Technion, Israel
Xavier Defago JAIST, Japan
Shlomi Dolev Ben-Gurion University of the Negev, Israel
Panagiota Fatourou University of Crete, Greece
Antonio Fernandez Anta IMDEA Networks Institute, Spain
Christof Fetzer TU Dresden, Germany
Emmanuel Godard Université Aix-Marseille, France
Wojciech Golab University of Waterloo, Canada
Krishna P. Gummadi MPI SWS Saarbrücken, Germany
Taisuke Izumi Nagoya Institute of Technology, Japan
Flavio Junqueira MSR Cambridge, United Kingdom
Rüdiger Kapitza TU Braunschweig, Germany
Aggelos Kiayias University of Athens, Greece
Fabian Kuhn University of Freiburg, Germany
Petr Kuznetsov Telecom ParisTech, France
Dahlia Malkhi VMware Research, United States
Rui Oliveira Universidade do Minho, Portugal
Marina Papatriantafilou Chalmers, Sweden
Fernando Pedone University of Lugano, Switzerland
Andrzej Pelc University of Quebec, Canada
Erez Petrank Technion, Israel
Peter Pietzuch Imperial College, United Kingdom
Florin Pop University Politehnica of Bucharest, Romania
Maria Potop-Butucaru (co-chair) Université Paris 6/LIP6, France
Michel Raynal IUF & IRISA-INRIA Rennes, France
Etienne Rivière University of Neuchâtel, Switzerland
Luís Rodrigues INESC-ID, Universidade de Lisboa, Portugal
Matthieu Roy LAAS-CNRS, France
Alex Shvartsman University of Connecticut, United States
Roman Vitenberg University of Oslo, Norway
Philipp Woelfel University of Calgary, Canada
Haifeng Yu National University of Singapore, Singapore
*STEERING COMMITTEE*
Marcos K. Aguilera VMWare, United States
Roberto Baldoni Sapienza University of Rome, Italy
Giuseppe Prencipe University of Pisa, Italy
Nicola Santoro Carleton University, Ottawa, Canada
Marc Shapiro INRIA, France
Sébastien Tixeuil (chair) IUF & LIP6-CNRS, France
Maarten van Steen VU University Amsterdam, Netherlands
*ORGANIZING COMMITTEE*
Emmanuelle Anceaume (general chair) CNRS / IRISA, France
Yann Busnel (organization chair) EXCESS (ENSAI) / INRIA, France
Elisabeth Lebret INRIA, France
Romaric Ludinard (publication chair) University La Sapienza, Italy
Lydie Mabil INRIA, France
------------------------------
Message: 2
Date: Tue, 18 Aug 2015 00:29:39 +0200
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Final CfP: Special Issue in Evolutionary Computation
Journal (MIT Press) on Combinatorial Optimization Problems (September
1st, 2015)
Message-ID: <4E22396A-48C1-4640-B4F8-7A32FD3BBAE9@lcc.uma.es>
Content-Type: text/plain; charset=utf-8
** Apologies for multiple postings **
===============================================================
Special Issue in Evolutionary Computation Journal, MIT Press
on Combinatorial Optimization Problems
http://ecj.fhv.at
===============================================================
** DESCRIPTION
Combinatorial Optimization Problems consist in finding an optimal solution (according to some objective function) from a finite search space. These problems arise in Industry and Academia and, unfortunately, most of them cannot be solved efficiently, that is, they are NP-hard and no polynomial time algorithm is known to solve them. For this reason, in the last decades researches have investigated the use of stochastic search algorithms to find near optimal solutions to these problems. In particular, a great research effort has been devoted to the development of metaheuristic algorithms to solve combinatorial optimization problems.
Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, travelling salesman, graph problems, satisfiability, energy optimization problems, packing problems and planning problems.
Prominent examples of metaheuristics include evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, ant colony optimization, particle swarm optimization, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, hyperheuristics and hybrid algorithms.
We encourage authors to submit original high-quality research on the application of metaheuristic algorithms to combinatorial optimization problems or theoretical aspects of this application.
** SUBMISSION GUIDELINES
All submissions have to be prepared according to the "guidelines for authors" as published in the journal website at http://ecj.fhv.at . Authors should submit their manuscripts to the Evolutionary Computation Editorial Manager at http://ecj.fhv.at . When submitting a paper, please send at the same time an email to Francisco Chicano (chicano@lcc.uma.es) and a copy to ecj@fhv.at mentioning the special issue, the paper title, and author list to inform about the submission.
** TENTATIVE SCHEDULE
1 September 2015 submission deadline (extended)
15 December 2015 authors notification
15 March 2016 authors' revisions
1 July 2016 final notification
15 July 2016 final manuscript
Winter 2016 tentative publication
** GUEST EDITORS
Francisco Chicano
e-mail: chicano@lcc.uma.es
Universidad de Malaga, Spain
Christian Blum
e-mail: christian.blum@ehu.es
University of the Basque Country, Spain
Gabriela Ochoa
e-mail: gabriela.ochoa@cs.stir.ac.uk
University of Stirling, Scotland, UK
------------------------------
Message: 3
Date: Tue, 18 Aug 2015 10:06:48 -0400 (EDT)
From: Alfred Menezes <ajmeneze@uwaterloo.ca>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Tier II Canada Research Chair in Combinatorics and
Optimization (University of Waterloo)
Message-ID:
<Pine.LNX.4.64.1508181006020.31631@cpu135.math.uwaterloo.ca>
Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed
====================================================================
TIER II CANADA RESEARCH CHAIR IN COMBINATORICS AND OPTIMIZATION
UNIVERSITY OF WATERLOO
The Department of Combinatorics and Optimization
(http://math.uwaterloo.ca/co) at the University of Waterloo
invites applications for a Tier II Canada Research Chair.
This position is at the level of a tenure-track Assistant
Professor or tenured Associate Professor. Applicants should
have research interests in one of the following areas:
Algebraic Combinatorics, Continuous Optimization, Cryptography,
Discrete Optimization, and Graph Theory.
A Ph.D. degree and evidence of excellence in research and teaching
are required. Successful applicants are expected to maintain an
active program of research, to attract and supervise graduate
students, and to participate in undergraduate and graduate teaching.
The salary range for the position is $105,000 to $155,000.
Negotiations beyond this salary range will be considered for
exceptionally qualified candidates. The effective date of
appointment is July 1 2016.
Interested individuals should apply using the MathJobs site
(http://www.mathjobs.org). Applications should include a
curriculum vitae, research and teaching statements, and up to
three reprints/preprints. In addition, at least three reference
letters should be submitted.
All Chairs are subject to review and final approval by the
CRC Secretariat. More information on the Canada Research Chair
program can be found at http://www.chairs.gc.ca.
Inquiries may be addressed to combopt@math.uwaterloo.ca or to
Chris Godsil, Chair, Department of Combinatorics and Optimization,
University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. Closing
date for receipt of applications is December 1, 2015.
The University of Waterloo respects, appreciates and encourages
diversity. We welcome applications from all qualified individuals
including women, members of visible minorities, Aboriginal peoples
and persons with disabilities. All qualified candidates are
encouraged to apply; however, Canadian citizens and permanent
residents will be given priority.
Three reasons to apply: https://uwaterloo.ca/watport/why-waterloo
====================================================================
------------------------------
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 13
**************************************
