Thursday, December 20, 2018

[DMANET] CFP PARS-Workshop 2019, Berlin, Germany

-------------------------------------------------------------
CALL FOR PAPERS

28th PARS-Workshop on March 21-22, 2019 in Berlin, Germany

http://fg-pars.gi.de/workshops/pars-workshop-2019/

PARS is the special interest group on parallel algorithms, parallel computer
structures and parallel system software within the German Informatics
Societies (GI/ITG). The goal of the bi-annual PARS Workshop is the
presentation of important research within the scope of PARS and an exchange
of ideas between the participants. Topics of interest include, but are
not restricted to:

* Parallel Algorithms (Presentation, Complexity, Applications)
* Parallel Models of Computation and Parallel Architectures
* Parallel Programming Languages and Libraries
* Tools for Parallelization (Compilers, Performance Analysis, Auto-Tuner)
* Parallel Embedded Systems / Cyber-Physical Systems
* Software Engineering for Parallel and Distributed Systems
* Multicore-, Manycore-, GPGPU-Computing and Heterogeneous Architectures
* Cluster Computing, Grid Computing, Cloud Computing
* Interconnect and Hardware Structures (e.g. reconfigurable systems)
* Future Technologies and new Computational Paradigms for Architectures
(SoC, PIM, STM, Memristor, DNA-Computing, Quantum Computing)
* Teaching Parallel Computation (Experiences, E-Learning)
* Parallel and Distributed Computing in Life Sciences (e.g. Bio-Informatics,
Medical Informatics)

Workshop languages are German and Englisch. Papers are limited to 10 pages.
The workshop proceedings will be published in the yearly newsletter of
the PARS special interest group (PARS-Mitteilungen, ISSN 0177-0454). The
Workshop fee will be about 100 Euros.

Important Dates:

Papers of at most 10 pages (Format: GI Lecture Notes in Informatics:
https://gi.de/service/publikationen/lni/, previously unpublished) are to
be submitted electronically until *January 23, 2019* via:
https://easychair.org/conferences/?conf=pars2019
Author notification: February 15, 2019
Submission of camera-ready papers: August 31, 2019 (after Workshop)

Program Committee:

A. Doering, Zuerich
N. Eicker, Juelich
T. Fahringer, Innsbruck
D. Fey, Erlangen
V. Heuveline, Heidelberg
R. Hoffmann, Darmstadt
B. Juurlink, Berlin
W. Karl, Karlsruhe
J. Keller, Hagen
E. Maehle, Luebeck
U. Margull, Ingolstadt
E. W. Mayr, Muenchen
J. Mottok, Regensburg
W. E. Nagel, Dresden
M. Philippsen, Erlangen
K. D. Reinartz, Hoechstadt
B. Schnor, Potsdam
M. Schulz, Muenchen
P. Sobe, Dresden
C. Trinitis, Muenchen
T. Ungerer, Augsburg
R. Wanka, Erlangen

Student paper award:

The best paper based on a master or PhD thesis, and presented by the thesis
author, will receive the student paper award of the PARS special interest
group (endowed with 500 Euros). Co-authors are allowed, the PhD
degree should not yet be awarded at the time of paper submission.
Application for the award by e-mail to the organizers at the time of
paper submission.

Sponsor:

GI/ITG Special Interest Group PARS
http://fg-pars.gi.de

Organisation:
Prof. Dr. Ben Juurlink
Technische Universitaet Berlin
Architektur eingebetteter Systeme,
10587 Berlin, Germany,
Tel.: +49-30-314-73130,
E-Mail: b.juurlink@tu-berlin.de

Daniel Maier
Technische Universitaet Berlin
Architektur eingebetteter Systeme,
10587 Berlin, Germany,
Tel.: +49-30-314-22286,
E-Mail: daniel.maier@tu-berlin.de

Prof. Dr. Wolfgang Karl (PARS-Sprecher)
Karlsruhe Institut fuer Technologie
Rechnerarchitektur und Parallelverarbeitung
Haid-und-Neu-Strasse 7
76131 Karlsruhe
Tel.: 0721-608-43771
E-Mail: karl@kit.edu

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

[DMANET] MATCH-UP 2019: Call for papers

Call for papers (with apologies if you receive this more than once):

MATCH-UP 2019: the Fifth International Workshop on Matching Under Preferences

May 26th-29th 2019
Congressi Stefano Franscini (http://www.csf.ethz.ch/) , Monte Verità, Ascona, Switzerland
http://www.optimalmatching.com/MATCHUP2019/ (please subscribe to our mailing list there)
contact e-mail (Bettina Klaus): frontiers.marketdesign@gmail.com (mailto:frontiers.marketdesign@gmail.com)

(each participant will pay a fee covering direct costs of meals, coffee breaks, and an excursion, based on actual costs, of about 400 CHF)

MATCH-UP 2019 is the fifth workshop in the series of interdisciplinary and international workshops on matching under preferences. The first in the series took place in Reykjavik in 2008, the second took place in Budapest in 2012, the third in Glasgow in 2015, and the fourth in Boston in 2017.

Background:

Matching problems with preferences occur in widespread applications such as the assignment of school-leavers to universities, junior doctors to hospitals, students to campus housing, children to schools, kidney transplant patients to donors and so on. The common thread is that individuals have preference lists over the possible outcomes and the task is to find a matching of the participants that is in some sense optimal with respect to these preferences.

The remit of this workshop is to explore matching problems with preferences from the perspective of algorithms and complexity, discrete mathematics, combinatorial optimization, game theory, mechanism design and economics, and thus a key objective is to bring together the research communities of the related areas.

List of topics:

The matching problems under consideration include, but are not limited to:

* two-sided matchings involving agents on both sides (e.g. college admissions, resident allocation, job markets, school choice, etc.)
* two-sided matchings involving agents and items (e.g. house allocation, course allocation, project allocation, assigning papers to reviewers, school choice, etc.)
* one-sided matchings (roommates problem, kidney exchanges, etc.)
* matching with payments (assignment game, etc.)

Invited speakers:

* Péter Biró (http://www.mtakti.hu/en/kutatok/peter-biro/235/) , Hungarian Academy of Sciences, Budapest, Hungary
* Flip Klijn (https://sites.google.com/site/flipklijn/home) , Institute for Economic Analysis (IAE-CSIC), Barcelona, Spain
* Bahar Rastegari (https://sites.google.com/view/baharrastegari) , University of Southampton, UK
* Ildi Schlotter (http://www.cs.bme.hu/%7Eildi/) , Budapest University of Technology and Economics, Hungary

MATCH-UP 2019 Submissions, Easychair Paper Submission link: https://easychair.org/conferences/?conf=matchup2019

We call for original papers that have not previously been published in (or accepted to appear in) a conference proceedings or a journal. Papers can however be under review for a conference or journal elsewhere at the time of submission.
There is no page limit for submissions. The submission should contain within the first 12 pages a clear presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. Proofs that can enable the main mathematical claims of the paper to be verified must be provided. Material other than the first 12 pages will be read at the committee's discretion.
Only abstracts of accepted papers will appear in the workshop proceedings. This should allow the simultaneous or subsequent submission of contributed papers to other workshops, conferences or journals. If authors so choose, they may include a link to the full version of their paper (if published, e.g., on arXiv, REpeC, SSRN or on a personal web page) in the proceedings.

MATCH-UP 2019 Important dates:
* Paper submission deadline: 15 January 2019
* Notification: 22 February 2019
* Final version for proceedings: 15 March 2019
* Poster abstract submission deadline: 1 April 2019
* Workshop: Sunday 26 May (starting at 1400) to Wednesday 29 May (ending at 1830) with an excursion in the afternoon of Tuesday 28 May

MATCH-UP 2019 Organizing Committee:
* Péter Biró (http://www.econ.core.hu/english/inst/biro.html) , Hungarian Academy of Sciences, Budapest, Hungary
* Tamás Fleiner (https://web.cs.elte.hu/egres/www/mp_fleiner.html) , Budapest University of Technology and Economics, Hungary (CS Program Chair)
* Bettina Klaus (https://www.bklaus.net/) , University of Lausanne, Switzerland (Chair)
* David Manlove (http://www.dcs.gla.ac.uk/%7Edavidm) , University of Glasgow, UK
* Marek Pycia (http://www.econ.uzh.ch/en/people/faculty/pycia.html) , University of Zürich, Switzerland (ECON Program Chair)

MATCH-UP Steering Committee:
* Péter Biró (http://www.econ.core.hu/english/inst/biro.html) , Hungarian Academy of Sciences, Hungary
* Brian Dean (https://people.cs.clemson.edu/~bcdean/) , Clemson University, USA
* Bettina Klaus (https://www.bklaus.net/) , University of Lausanne, Switzerland
* David Manlove (http://www.dcs.gla.ac.uk/%7Edavidm) , University of Glasgow, UK

Further information:
Web: http://www.optimalmatching.com/MATCHUP2019/
Email (Bettina Klaus): frontiers.marketdesign@gmail.com (mailto:frontiers.marketdesign@gmail.com)

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

[DMANET] [DEADLINE EXTENSION] 14th International Computer Science Symposium in Russia (CSR-2019)

**Due to multiple requests, the submission deadline is extended to January 3, 2018**


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

Last Call for Papers

14th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2019)

July 1-5, 2019, Novosibirsk, Russia

https://logic.pdmi.ras.ru/csr2019/

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

CSR is an annual international conference held in Russia that is
designed to cover a broad range of topics in Theoretical Computer
Science. The list of previous CSR conferences can be found at
https://logic.pdmi.ras.ru/~csr/. Conference proceedings are published
in Springer's Lecture Notes in Computer Science series. A selection of
accepted papers will be published in a special issue of the Springer
journal, "Theory of Computing Systems".

CSR'19 will be part of the Computer Science Summer in Russia
(http://cssr.nsu.ru) which will also include the Ershov Informatics
Conference (PSI'19) and Summer School in Computer Science for
students.


IMPORTANT DATES

Deadline for submissions: January 3, 2018 *** EXTENDED ***
Notification of acceptance: February 25, 2019 *** DELAYED ***
Conference dates: July 1-5, 2019

Yandex Awards for the best paper and for the best student paper will
be given by the PC.

VENUE

Novosibirsk is the 3rd largest city in Russia and a major hub in
Western Siberia. It is easily accessible either via Moscow or Saint
Petersburg, or by a direct flight from Еurope (Frankfurt, Dusseldorf,
Prague, Thessaloniki) or Asia (Tokyo, Seoul, Hongkong, Shanghai,
Beijing or Bangkok). The conference will take place at Novosibirsk
University located in Akademgorodok -- a picturesque "academic town"
about 30km south from the main city of Novosibirsk.

TOPICS include, but are not limited to:

* algorithms and data structures
* computational complexity
* randomness in computing, approximation algorithms
* combinatorial optimisation, constraint satisfaction
* computational geometry
* formal languages and automata
* codes and cryptography
* combinatorics in computer science
* applications of logic to computer science, proof complexity
* fundamentals of machine learning
* theoretical aspects of big data

DISTINGUISHED OPENING LECTURE

Andrew Yao (Tsinghua U, China)

INVITED SPEAKERS

Michael Fellows (U Bergen, Norway) to be confirmed
Eric Fusy (CNRS/Ecole Polytechnique, France)
Giuseppe Italiano (LUISS U, Italy)
Meena Mahajan (Institute of Mathematical Sciences, India)
Petros Petrosyan (Yerevan State U, Armenia)
David Woodruff (Carnegie Mellon U, USA)
Dmitry Zhuk (Moscow U, Russia)

PROGRAM COMMITTEE

Maxim Babenko (Yandex/HSE Moscow, RU)
Petra Berenbrink (U Hamburg, DE)
Olaf Beyersdorff (U Jena, DE)
René van Bevern (Novosibirsk State U, RU)
Manuel Bodirsky (TU Dresden, DE)
Vladimir Braverman (Johns Hopkins U, US)
Holger Dell (Saarland U, DE)
Nachum Dershowitz (Tel Aviv U, IL)
Michael Elkin (Ben-Gurion U, IL)
Pierre Fraigniaud (CNRS & U Paris Diderot, FR)
Anna Frid (Aix-Marseille U, FR)
Pawel Gawrychowski (U Wrocław, PL)
Dora Giammarresi (U Rome, IT)
Elena Grigorescu (Purdue U, US)
Gregory Kucherov (CNRS & U Paris-Est Marne-la-Vallée, FR), chair
Christophe Paul (CNRS & U Montpellier FR)
Valentin Polishchuk (Linköping U, SE)
Artem Pyatkin (Sobolev Inst. of Mathematics & Novosibirsk State U, RU)
Alexander Rabinovich (Tel-Aviv U, IL)
Kunihiko Sadakane (U Tokyo, JP)
Arseny Shur (Ural Federal U, RU)
Igor Walukiewicz (CNRS & U Bordeaux, FR)
Jacobo Torán (U Ulm, DE)
Sergey Yekhanin (Microsoft Research, US)

CONFERENCE CHAIR

René van Bevern (Novosibirsk State U, RU)

ORGANIZING COMMITTEE

Denis Ponomaryov (A.P. Ershov Inst. of Informatics Systems, Novosibirsk)
Anastasia Karpenko (Novosibirsk State U)
Oxana Tsidulko (Sobolev Inst. of Mathematics, Novosibirsk)

STEERING COMMITTEE

Edward A. Hirsch (St. Petersburg Dept. of Steklov Inst. of Mathematics, RU)
Juhani Karhumäki (U Turku, FI)
Alexander Kulikov (St. Petersburg Dept. of Steklov Inst. of Mathematics, RU)
Ernst W. Mayr (Technische Universität München, DE)
Alexander Razborov (U of Chicago, USA and Steklov Inst. of Mathematics, Moscow, RU)
Mikhail Volkov (Ural Federal U, RU)

SUBMISSIONS

Authors are invited to submit papers presenting original research in
the conference topics, in electronic form (pdf format) via EasyChair
at https://easychair.org/conferences/?conf=csr19 Submissions must be
unpublished, not under review for publication elsewhere, and provide
sufficient information to judge their merits. Submissions must be in
English, and not exceed 12 pages, including the title page, in
Springer's LNCS LaTeX style. Additional material, to be read at the
discretion of reviewers and PC members, may be provided in a clearly
marked appendix or by reference to a manuscript on a web site.

At least one of the authors must commit to presenting the paper at the
conference.


UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, December 19, 2018

[DMANET] Helsinki ICT Network: Positions for Exceptional Doctoral Students (deadline Jan 31, 2019)

The Helsinki Doctoral Education Network in Information and
Communications Technology (HICT) is a joint initiative by Aalto
University and the University of Helsinki, the two leading universities
within this area in Finland. The network involves at present over 60
professors and over 200 doctoral students, and the participating units
graduate altogether more than 40 new doctors each year.

The quality of research and education in both HICT universities is
world-class, and the education is practically free as there are no
tuition fees for doctoral students in the Finnish university system. In
terms of the living environment, Helsinki has been ranked as one of the
world's top-10 most livable cities (Economist, 2017), and Finland is
among the best countries in the world with respect to many quality of
life indicators (https://bit.ly/2swphVU).

The activities of HICT are structured along five research area specific
tracks:

Algorithms and machine learning
Life science informatics
Networks, networked systems and services
Software and service engineering and systems
User centered and creative technologies

The participating units of HICT have currently funding available for
exceptionally qualified doctoral students. We offer the possibility to
join outstanding research groups, with a total of *20 research projects*
to choose from.

We welcome applicants with diverse backgrounds, and qualified female
candidates are explicitly encouraged to apply. For more information on
the positions, see "http://www.hict.fi/spring2019".

The online application form (https://bit.ly/2QKcsqP) closes January 31,
2019 at midnight Finnish time.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: Evolutionary Computation for Automated Algorithm Design at CEC 2019

IEEE 2019 Congress on Evolutionary Computation (CEC 2019)
Special Session on
Evolutionary Computation for Automated Algorithm Design (ECAAD 2019)
https://sites.google.com/site/ieeeecaad2019/

Aims, Scope and List of Topics

Computational intelligence systems play an imperative role in solving real world complex problems in industry. These systems have contributed to many facets of industry including data mining, transportation, health systems, computer vision, computer security, robotics, software engineering scheduling, and amongst others. Computational intelligence systems employ one or more computational intelligence techniques such as neural networks, fuzzy logic, genetic algorithms, multi-agent approaches and rule-based systems. Implementation of these techniques require a number of design decisions to be made, e.g. what architecture to use, what parameter values to use, and derivation of problem specific operators. It may also be necessary to employ a hybrid system combining techniques to solve a problem which introduces additional decisions such as which techniques to use and how to combine these techniques. This makes the development of computational systems time consuming, requiring extensive expertise, and many man hours. Consequently, there have been a number of initiatives to automate these processes.
There has been a fair amount of research into parameter tuning and control. The field of auto-machine learning aims to automate the design of machine learning algorithms so as to produce off-the-shelf machine learning techniques. Attempts to automate neural network architecture design has led to the field of neuroevolution. Research in this area has also been directed at inducing fuzzy functions, rule-based systems and multi-agent architectures. Hyper-heuristics, which were initially aimed at providing generalized solutions to combinatorial optimization problems, are proving to be effective in the automated development of techniques such as metaheuristics. Evolutionary algorithms such as genetic programming and genetic algorithms have chiefly been used in these initiatives. The aim of this special session is to examine recent developments in the field and future directions including the challenges and how these can be overcome.
The topics covered include, but are not limited to, the use of evolutionary algorithms for the following:

· Parameter control and tuning

· Architecture design, e.g. design of neural network and multi-

agent architectures

· Automated hybridization of intelligent techniques

· Derivation of operators

· Derivation of construction heuristics

· Derivation of evaluation functions

· Automatic system development using hyper-heuristics

· Automatic programming

· Auto-ML

· Search-based software engineering

· Neuroevolution


Organizers:

Nelishia Pillay,
University of Pretoria, South Africa
E-mail: npillay@up.ac.za<mailto:npillay@up.ac.za>

Rong Qu,
University of Nottingham, UK
E-mail: Rong.Qu@nottingham.ac.uk<mailto:Rong.Qu@nottingham.ac.uk>

Important Dates:

Paper submission deadline: 7 January, 2019
Paper acceptance notification: 7 March, 2019
Final paper submission deadline: 31 March, 2019
Early registration: 31 March, 2019

Paper Submission:

Special session papers are treated the same as regular papers and must be submitted via the CEC 2019 submission website<http://cec2019.org/>. When submitting choose the "Evolutionary Computation for Automated Algorithm Design" special session from the "Main Research Topic" list.

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 contact the sender and delete the email and
attachment.

Any views or opinions expressed by the author of this email do not
necessarily reflect the views of the University of Nottingham. Email
communications with the University of Nottingham may be monitored
where permitted by law.


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

Tuesday, December 18, 2018

[DMANET] 2019 Herman Goldstine Memorial Postdoctoral Fellowship

The Mathematical Sciences department of the IBM Thomas J. Watson
Research Center invites applications for its 2019–2020 Herman
Goldstine Memorial Postdoctoral Fellowship for research in
mathematical and computer sciences. The fellowship provides scientists
of outstanding ability an opportunity to advance their scholarship as
resident department members at the Research Center. The Research
Center is located in Westchester County, less than an hour north of
New York City.

The department provides an atmosphere in which basic research is
combined with work on practical applications. Our permanent members,
academic visitors, and post-doctoral fellows pursue research in pure
and applied mathematics and in theoretical and exploratory computer
science. Areas of research include: algorithms, artificial
intelligence and machine learning, numerical analysis and scientific
computing, dynamical systems, inverse problems, optimization,
operations research, applied probability, and statistics. Close
interaction with permanent department members is expected and
encouraged, but fellows are free to pursue their own research
interests.

Up to two fellowships will be awarded. Candidates must have received a
Ph.D. degree after September 2014 or should expect to receive one
before the fellowship commences in the second half of 2019 (usually in
September). The fellowship has a period of one year, and may be
extended for another year by mutual agreement. The stipend is expected
to be between $130,000 and $150,000, depending on the length of
experience. An additional allowance for moving expenses will be
provided.

For full details and to apply, please visit:
http://www.research.ibm.com/goldstine/

The deadline for application is January 31, 2019.

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

[DMANET] CFP 19th International Conference on Application of Concurrency to System Design (ACSD'19) 2nd call

Call for Papers and Announcement
ACSD 2019
19th INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN
Aachen, Germany, June 23-28, 2019

Additional information about the conference will be published via
http://www.petrinets2019.de/acsd-2019/

The conference will be co-located with the 40th International Conference on
Applications and Theory of Petri Nets
and Concurrency (Petri Nets 2019).


IMPORTANT DATES:
Abstract submission: January 16, 2019 (*)
Submission of Papers: January 22, 2019 (*)
Notification: March 8, 2019
Final Version Due: March 22, 2019 (*)
Participation in Tool Exhibition: June 1, 2019
Conference: June 23-28, 2019
(*) The deadline is the end of day Anywhere on Earth (AoE)

The 19th international ACSD conference will be organized by the Process and
Data Science (PADS) group at RWTH
Aachen University, Aachen, Germany. The conference will take place in the
conference area of the Tivoli football
stadium, close to the city center of Aachen. The language of the conference
is English. The conference proceedings
will be submitted for inclusion to IEEE Xplore.


CONFERENCE SCOPE:
The conference aims at cross-fertilizing both theoretical and applied
research about formal approaches (in a broad
sense) to designing computer systems that exhibit concurrent behavior. In
particular, the following topics are of interest:
- Formal models of computation and concurrency for synchronous and
asynchronous systems and problems, like data-flow
models, communicating automata, Petri nets, process algebras, graph
rewriting systems, state charts, MSCs, modal
and temporal logics
- Design principles for concurrent systems, in particular hardware/software
co-design, platform-based design,
component-based design, modular synthesis, distributed simulation and
control, refinement techniques,
hardware/software abstractions, cross-layer optimization
- Algorithms and tools for concurrent systems, ranging from programming
languages to algorithmic methods, for system
analysis and construction, including model checking, verification, and
static analysis techniques as well as
synthesis procedures
- High-performance computer architectures like many-core processors,
on-chip-networks, graphics processing units,
instruction-level parallelism, dataflow architectures, cache coherency,
memory systems, up to ad-hoc, mobile, and
wireless networks
- Resource management in implementations including task and communication
scheduling, network-, memory-, and
power-management, energy/power distribution, fault-tolerance, quality of
service, scalability, load balancing,
power proportionality
- Real-time aspects, incl. hard real-time requirements, security- and
safety-critical issues, functional and timing verification
- Cyber-physical systems, hybrid systems, networked systems, and networks
in biological systems
- Case studies of general interest, from industrial applications to
consumer electronics and multimedia, automotive
systems, (bio-) medical applications, neuromorphic applications, internet
(of things) and grid computing, to
gaming applications.


PAPER SUBMISSION:
ACSD seeks papers describing original work which has not been previously
published and is not under review for
publication elsewhere. All files must be prepared using the latest IEEE
Computer Society conference proceedings
guidelines (8.5 x 11 inch two-column format). The page limit for regular
papers is 10 pages. Accepted papers will
be included in the conference proceedings.
At least one author of each accepted contribution is expected to present
the paper at the conference, and will be
required to sign the copyright release forms. All papers have to be
submitted via EasyChair:
https://easychair.org/conferences/?conf=acsd2019.


ORGANIZATION

General Chair
Wil van der Aalst
RWTH Aachen University
52074 Aachen, Germany
wvdaalst@pads.rwth-aachen.de

Technical Program Committee Co-chairs
Joerg Keller
University of Hagen
58084 Hagen, Germany
Joerg.Keller@fernuni-hagen.de

Wojciech Penczek
ICS PAS & Siedlce University
Warsaw, Poland
penczek@ipipan.waw.pl

Organizing Committee
Wil van der Aalst (general chair)
Anna Kalenkova (publicity chair)
Detlef Wetzler (web chair)

Technical Program Committee
S. Akshay, India
Etienne Andre, France
Mohamed Faouzi Atig, Sweden
Josep Carmona, Spain
Franck Cassez, Australia
Thomas Chatain, France
Rocco De Nicola, Italy
Joerg Desel, Germany
Klaus Echtle, Germany
Alain Girault, France
Radu Grosu, Austria
Stefan Haar, France
Loic Helouet, France
Ludovic Henrio, France
Loig Jezequel, France
Gabriel Juhas, Slovakia
Joerg Keller, Germany (co-chair)
Christoph Kessler, Sweden
Jan Kretinsky, Czech Republic
Johan Lilius, Finland
Gerald Luettgen, Germany
Roland Meyer, Germany
Andrey Mokhov, UK
Claire Pagetti, France
Wojciech Penczek, Poland (co-chair)
Laure Petrucci, France
Marta Pietkiewicz-Koutny, UK
Dumitru Potop-Butucaru, France
Klaus Schneider, Germany
Sandeep Shukla, India
Ashutosh Trivedi, India
Jaco van de Pol, Denmark
Fei Xia, UK

Steering Committee
Alex Yakovlev, UK (chair)
Benoit Caillaud, France
Jordi Cortadella, Spain
Joerg Desel, Germany
Alex Kondratyev, USA
Luciano Lavagno, Italy
Antti Valmari, Finland
Andrey Mokhov, UK

AACHEN
Aachen is a historic city in North Rhine-Westphalia, Germany, at the point
where Germany borders on Belgium and
the Netherlands. Historically this spa-town was a prominent city, the place
where the German Kings were crowned,
and the residence of Charlemagne who still lies buried in the impressive
cathedral he himself had built. The city
has many historical sites that remind of those days, including medieval
buildings, city gates, and beautiful
fountains. Aachen is Germany's westernmost city. It lies near the borders
with Belgium and the Netherlands and
is nestled between the large national parks of the Eifel and the Ardennes.
The city has a population of 260,000,
which includes about 50,000 students and more than 4,000 academic staff
from across the world. Its lively student
community lends the city just as much character as its history. Aachen is
famous for its Printen gingerbread, its
hot springs, its Mardi Gras carnival and one of the world's largest
equestrian tournaments. The historic city
center and a wealth of bars, cafes, and restaurants, combined with the
nearby nature parks, such as the Eifel,
make Aachen a city where everyone feels at home. The venue of the
conference, the Tivoli football stadium, is
located on the border of the city center. This beautiful venue will provide
a unique atmosphere with great views
and excellent conference facilities.

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

[DMANET] CfP: [Algorithms] Special Issue: New Frontiers in Parameterized Complexity and Algorithms (Deadline: 15 July 2019)

Dear Colleagues,

We cordially invite you to submit a manuscript for consideration and
possible publication in a Special Issue on "New Frontiers in
Parameterized Complexity and Algorithms" to be published in an EI, ESCI
and Scopus-indexed open access journal Algorithms
(http://www.mdpi.com/journal/algorithms).

The submission manuscript deadline is *15 July 2019*. We invite you
to submit your latest research in the area of parameterized complexity
and parameterized algorithms. For more details please visit the website:
https://www.mdpi.com/journal/algorithms/special_issues/Parameterized_Complexity

You may share this invitation with your team members and colleagues;
co-authors are most welcome.

Please let me know within a month or as soon as possible if you and your
colleagues are interested in submitting a manuscript for this special
issue. If more time is needed, please feel free to tell us
(algorithms@mdpi.com or jones.zhang@mdpi.com). Your contribution would
be most welcome.

Algorithms is fully open access. Open access (unlimited and free access
by readers) increases publicity and promotes more frequent citations, as
indicated by several studies. As open access is supported by the authors
and their institutes, an Article Processing Charge (APC) of CHF 850
applies to accepted papers. You may be entitled to a discount if you
have previously received a discount code or if your institute is
participating in the MDPI Institutional Open Access Program (IOAP); for
more information see: http://www.mdpi.com/about/ioap.

For further details on the submission process, please see the
instructions for authors at the journal website
(http://www.mdpi.com/journal/algorithms/instructions).

We hope this topic is of interest to you and look forward to
collaborating with you in the near future.

Kind regards,
Ms. Jones Zhang
Assistant Editor
--
MDPI Wuhan Office
Algorithms Editorial Office

MDPI
Algorithms Editorial Office
St. Alban-Anlage 66, 4052 Basel
Switzerland
http://www.mdpi.com/
E-Mail
: algorithms@mdpi.com
http://www.mdpi.com/journal/algorithms/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Nominations: VCLA International Student Awards 2019 - Logic and Computer Science

The Vienna Center for Logic and Algorithms (VCLA) at TU Wien seeks
nominations for the VCLA International Student Awards 2019. The annually
awarded VCLA International Student Awards for Outstanding Master and
Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors
of scientific works across the wide spectrum of Logic and Computer Science.
Final Submission Deadline: 15.3.2019

AWARD

*Outstanding Master Thesis Award: 1200 EUR

*Outstanding Undergraduate Research (Bachelor) Award: 800 EUR

*The winners will be invited to present their work at an award ceremony in
Vienna, Austria.

ELIGIBILITY

*The degree must have been awarded between November 15th, 2017, and December
31st, 2018, (inclusive).

*Students who obtained their degree at TU Wien are excluded from the
nomination.

MAIN AREAS OF INTEREST

*Computational Logic, covering theoretical and mathematical foundations such
as proof theory, model theory, computability theory, algorithmic lower and
upper bounds, Boolean satisfiability (SAT), QBF, constraint satisfaction,
satisfiability modulo theories, automated deduction (resolution, refutation,
theorem proving), non-classical logics (substructural logics, multi-valued
logics, deontic logics, modal and temporal logics), computational complexity
and algorithms (complexity analysis, parameterized and exact algorithms,
decomposition methods).

*Databases and Artificial Intelligence, concerned with logical methods for
modeling, storing, and drawing inferences from data and knowledge. This
includes subjects like query languages based on logical concepts (Datalog,
variants of SQL, XML, and SPARQL), novel database-theoretical methods
(schema mappings, information extraction and integration), logic
programming, knowledge representation and reasoning (ontologies, answer-set
programming, belief change, inconsistency handling, argumentation,
planning).

*Verification, concerned with logical methods and automated tools for
reasoning about the behavior and correctness of complex state-based systems
such as software and hardware designs as well as hybrid systems. This ranges
from model checking, program analysis and abstraction to new
interdisciplinary areas such as fault localization, program repair, program
synthesis, and the analysis of biological systems.

NOMINATION REQUIREMENTS

*For nomination instructions, please visit
<https://logic-cs.at/award-call-2019/> https://logic-cs.at/award-call-2019/


*Kindly address all inquiries to <mailto:award@logic-cs.at>
award@logic-cs.at

IMPORTANT DATES

*Final submission deadline: March 15, 2019 (AoE)

*Notification of decision: end of June 2019

*Award ceremony: September 2019, Vienna (Austria)

AWARD COMMITTEE 2019

To be announced in January 2019. For the VCLA Award Committee 2018 see:
<http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/

*Robert Ganian (committee co-chair)

*Magdalena Ortiz (general chair)

*Revantha Ramanayake (committee co-chair)

IN MEMORIAM

The award is dedicated to the memory of Helmut Veith, the brilliant computer
scientist who tragically passed away in March 2016, and aims to carry on his
commitment to promoting young talent and promising researchers in these
areas.

RECIPIENTS OF THE VCLA INTERNATIONAL STUDENT AWARDS

<http://www.vcla.at/vcla-awards/> http://www.vcla.at/vcla-awards/

Please feel free to distribute as appropriate.


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

Monday, December 17, 2018

[DMANET] Competition on Evolutionary Computation in Uncertain Environments: A Smart Grid Application

http://www.gecad.isep.ipp.pt/ERM2019-Competition/
Taking place at: Genetic and Evolutionary Computation Conference – GECCO 2019 & IEEE Congress on Evolutionary Computation – CEC 2019

+ Competition Outline +

GECAD – Polytechnic of Porto –, in collaboration with Delft and Adelaide Universities, proposes the optimization of a centralized day-ahead energy resource management problem in smart grids under environments with uncertainty.

+ Competition goals +

The CEC/GECCO competition on "Evolutionary Computation in Uncertain Environments: A Smart Grid Application" has the purpose of bringing together and testing the more advanced Computational Intelligence (CI) techniques applied to an energy domain problem, namely the energy resource management problem under uncertain environments. The competition provides a coherent framework where participants and practitioners of CI can test their algorithms to solve a real-world optimization problem in the energy domain with uncertainty consideration, which makes the problem more challenging and worth to explore. In this CEC/GECCO 2019 edition, we propose a more challenging case study in comparison with WCCI 2018 competition. The uncertainty is now represented by 500 scenarios (the last edition was 100 scenarios) with a higher level of uncertainty on the photovoltaic (PV) production. We also decreased the amount of energy that the aggregator can buy in the energy market, thus limiting the available options to find a feasible solution. Good luck to all the participants!

+ Rules +

-Participants will propose and implement metaheuristic algorithm (e.g., evolutionary algorithms, swarm intelligence, estimation of distribution algorithm, etc.) to solve the energy resource management problem under uncertainty.
-The organizers provide a framework, implemented in MATALAB© 2014b 64 bits (Download http://www.gecad.isep.ipp.pt/ERM2019-Competition/files/MatlabPlatform.zip), in which participants can easily test their algorithms (we also provide a differential evolution algorithm implementation as an example). The guidelines (Download http://www.gecad.isep.ipp.pt/ERM2019-Competition/files/CEC_GECCO_2019_Guidelines_CISG.pdf) include the necessary information to understand the problem, how the solutions are represented, and how the fitness function is evaluated. Those elements are common for all participants.
-Since the proposed algorithms might have distinct sizes of population and run for a variable number of iterations, a maximum number of "50000 function evaluations" is allowed in each trial for all participants. The convergence properties of the algorithms are not a criterion to be qualified in this competition.
-20 independent trials should be performed in the framework by each participant.

+ How to submit an entry +

-The winner will be the participant with the minimum ranking index, which is calculated as the average value over the 20 trials of the expected fitness value (over the considered uncertain scenarios) plus the standard deviation.
- Each participant is kindly requested to put the text files corresponding to final results (see guideline document), as well as the implementation files (codes), obtained by using a specific optimizer, into a zipped folder named ERM2019_SG_Algorithm_Participant.zip (e.g. ERM2019_SG_DE_Lezama.zip).

+ How to cite +

[1] Fernando Lezama, Joao Soares, Zita Vale, Jose Rueda, SG-ERM-Uncertainty framework, 2018, (Download http://www.gecad.isep.ipp.pt/ERM2019-Competition/files/MatlabPlatform.zip).
[2] Fernando Lezama, Joao Soares, Zita Vale, Jose Rueda, "Guidelines for the CEC & GECCO 2019 competition on Evolutionary Computation in Uncertain Environments: A Smart Grid Application", December 2018.

+ Further related bibliography +

[1] Fernando Lezama, Joao Soares, Zita Vale, Jose Rueda, Sergio Rivera, Istvan Elrich, "2017 IEEE competition on modern heuristic optimizers for smart grid operation: Testbeds and results," Swarm and Evolutionary Computation, 2018.
[2] Joao Soares, Bruno Canizes, M. A. Fotouhi Gazvhini, Zita Vale, and G. K. Venayagamoorthy, "Two-stage Stochastic Model using Benders' Decomposition for Large-scale Energy Resources Management in Smart grids," IEEE Transactions on Industry Applications, 2017.
[3] Fernando Lezama, Joao Soares, Enrique Munoz de Cote, L. E. Sucar, and Zita Vale, "Differential Evolution Strategies for Large-Scale Energy Resource Management in Smart Grids," in GECCO '17: Genetic and Evolutionary Computation Conference Companion Proceedings, 2017.
[4] João Soares, Mohammad Ali Fotouhi Ghazvini, Marco Silva, Zita Vale, Multi-dimensional signaling method for population-based metaheuristics: Solving the large-scale scheduling problem in smart grids, Swarm and Evolutionary Computation, 2016.
[5] Joao Soares, Hugo Morais, Tiago Sousa, Zita Vale, Pedro faria, Day-ahead resource scheduling including demand response for electric vehicles, IEEE Transactions on Smart Grid 4 (1), 596-605, 2013.

+ Organizers +

Fernando Lezama, Polytechnic of Porto, PT, flzcl@isep.ipp.pt
João Soares, Polytechnic of Porto, PT, joaps@isep.ipp.pt
Zita Vale, Polytechnic of Porto, PT, zav@isep.ipp.pt
Jose Rueda, Delft University, NL, j.l.ruedatorres@tudelft.nl
Markus Wagner, Adelaide University, NL, markus.wagner@adelaide.edu.au

+ Contacts +

E-mail: zav@isep.ipp.pt
Phone: +351 228 340 511

Activity of IEEE CIS Task Force on Computational Intelligence in the Energy Domain, Intelligent Systems Subcommittee (ISS), part of IEEE PES TC Analytic Methods for Power Systems (AMPS)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Ph. D. position in Discrete Optimization at TU Darmstadt

A Ph. D. (teaching assistant) position is available in Discrete
Optimization at TU Darmstadt beginning April 2019. Please find the call
in German below.

------------------------------------------------------------------------

Am Fachbereich Mathematik der TU Darmstadt ist zum 1. April 2019 eine
Stelle als

Wissenschaftliche/r Mitarbeiterin/Mitarbeiter

für die Dauer von 3 Jahren mit der Möglichkeit der Verlängerung zu besetzen.

Die Bewerbungsfrist ist der 15.1.2019.


Aufgabengebiete:

- Mathematische Forschung im Gebiet der Diskreten Optimierung,
beispielsweise Verbindungen zum Maschinellen Lernen,
- Unterstützung bei den Lehrtätigkeiten des Fachbereichs.

Voraussetzungen:

Überdurchschnittlicher Masterabschluss in Mathematik oder einem
verwandten Fach; Interesse an mathematischer Forschung sowie Freude an
Lehrtätigkeit.

Die Stelle ist dem Fachgebiet Diskrete Optimierung, geleitet von Prof.
Marc Pfetsch zugeordnet. Thematisch soll die Entwicklung von
ganzzahligen Optimierungsverfahren, beispielsweise mit Verbindungen zum
Maschinellen Lernen untersucht werden.

Ziel der Anstellung ist, sich im Gebiet der Diskreten Optimierung
wissenschaftlich mit dem Ziel der Promotion zu qualifizieren. Bei
Vorliegen einer überdurchschnittlichen Promotion ist auch die
wissenschaftliche Qualifizierung zur Habilitation möglich.

Die Technische Universität Darmstadt strebt eine Erhöhung des Anteils
der Frauen am Personal an und fordert deshalb besonders Frauen auf, sich
zu bewerben. Bewerberinnen oder Bewerber mit einem Grad der Behinderung
von mindestens 50 oder diesen Gleichgestellte werden bei gleicher
Eignung bevorzugt. Die Vergütung erfolgt nach dem Tarifvertrag für die
Technische Universität Darmstadt (TV - TU Darmstadt).
Teilzeitbeschäftigung ist grundsätzlich möglich.

Bewerbungen bitte mit den üblichen Unterlagen unter Angabe der
Kenn-Nummer 589 elektronisch an
bewerbung [at] mathematik.tu-darmstadt.de
(bitte in einer PDF-Datei, max. 5 MB) schicken.

Die allgemeine Ausschreibung finden Sie unter

https://www.intern.tu-darmstadt.de/dez_vii/stellen/stellen_details_295552.de.jsp

bzw.

https://www.intern.tu-darmstadt.de/dez_vii/stellen/stellen_details_295552.en.jsp

Informationen über die Arbeitsgruppe finden sich unter:

https://www.mathematik.tu-darmstadt.de/optimierung/arbeitsgruppe_optimierung/index.de.jsp

Fachliche Fragen können Sie gerne an Prof. Pfetsch stellen (06151
1623440 oder pfetsch [at] mathematik.tu-darmstadt.de).

Für allgemeine Rückfragen steht Ihnen der Fachbereichskoordinator, Herr
Dr. Andreas Mars, Tel. 06151 16-21431, mars [at]
mathematik.tu-darmstadt.de, gerne zur Verfügung.

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

[DMANET] Announcement of Workshop on Kernels 2019

This is to announce Workshop on Kernels 2019 that will be held at
University of Bergen, Norway, on June 3-7 2019.

Workshop on Kernels (WorKer) is an irregular meeting focused on
kernelization: rigorous theory of preprocessing. The 2019 edition will be
the sixth installment of the workshop. For more information, please visit
http://worker2019.mimuw.edu.pl.

Registration will open in early Spring 2019.

Looking forward to see you in June in Bergen.

Best regards,
Marcin Pilipczuk
on behalf of the organizers

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

[DMANET] Special Issue "The Second International Workshop on Parallel and Distributed Data Mining"

Special Issue "The Second International Workshop on Parallel and Distributed Data Mining"

A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: 21 December 2018

http://www.mdpi.com/journal/algorithms/special_issues/Parallel_Distributed_Data_Mining


Special Issue Information

Dear Colleagues,

This Special Issue is devoted to the increasing interest in the design and implementation of parallel and distributed data mining algorithms. The Workshop on Parallel and Distributed Data Mining (WPDM 2018) is an international forum that brings together researchers and practitioners, working on different high-performance aspects of data mining algorithms, enabling novel applications. Indeed, datasets grow so rapidly that, every day, exabytes of data are being generated, and, in order to extract and infer useful knowledge, parallel processing techniques are required to cope with this huge volume of data: Traditional sequential software is not viable to cope with them. When the data are generated in different places (such as wireless sensor networks and/or Internet of things devices), they may be geographically spread out, and the data cannot be sent to a centralized site, thus, the need for distributed processing algorithms arises. Topics relevant to this Special Issue cover the scope of the WPDM 2018 Workshop (http://sara.unisalento.it/~cafaro/WPDM2018/):

- Parallel data mining algorithms using MPI and/or OpenMP
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Parallel data mining applications exploiting FPGA
- Distributed data mining algorithms
- Benchmarking and performance studies of high-performance data mining applications
- Novel programming paradigms to support high-performance computing for data mining
- Performance models for high-performance data mining applications and middleware
- Programming models, tools, and environments for high-performance computing in data mining
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Extended versions of papers presented at WPDM 2018 are sought, but this call for papers is fully open to all those who wish to contribute by submitting a relevant research manuscript.

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 850 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.


Special Issue Editors

Guest Editor
Assoc. Prof. Massimo Cafaro

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, Italy

Guest Editor
Dr. Italo Epicoco

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, Italy

Guest Editor
Dr. Marco Pulimeno

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy

Guest Editor
Prof. Giovanni Aloisio

Department of Engineering for Innovation, Via per Monteroni, 73100 Lecce, Italy
Euro-Mediterranean Centre on Climate Change, Foundation, Lecce, Italy

-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

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

[DMANET] The Third International Workshop on Parallel and Distributed Data Mining (WPDM 2019)

WPDM 2019


The Third International Workshop on Parallel and Distributed Data Mining (WPDM 2019)
http://sara.unisalento.it/~cafaro/WPDM2019/

CALL FOR PAPERS

The Third Workshop on Parallel and Distributed Data Mining (WPDM 2019) will be held in conjunction with The 19th International Conference on Computational Science and Its Applications (ICCSA 2019), http://www.iccsa.org


Saint Petersburg University, Saint Petersburg, Russia July 1-4 2019


Final submission Deadline: February 17, 2019


SCOPE AND OBJECTIVES

The Workshop on Parallel and Distributed Data Mining is an international forum which brings together researchers and practitioners working on different high-performance aspects of data mining algorithms, enabling novel applications. Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications. Therefore, there is an increasing interest in the design and implementation of parallel data mining algorithms. On parallel computers, by exploiting the vast aggregate main memory and processing power of processors and accelerators, parallel algorithms can easily address both the running time and memory requirement issues. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of data mining algorithms and applications. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance data mining algorithms and applications, and related topics.

The WPDM Workshop topics include (but are not limited to) the following:

- Parallel data mining algorithms using MPI and/or OpenMP
- Parallel data mining algorithms targeting GPUs and many-cores accelerators
- Parallel data mining applications exploiting FPGA
- Distributed data mining algorithms
- Benchmarking and performance studies of high-performance data mining applications
- Novel programming paradigms to support high-performance computing for data mining
- Performance models for high-performance data mining applications and middleware
- Programming models, tools, and environments for high-performance computing in data mining
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

INSTRUCTIONS FOR PAPER SUBMISSIONS

You are invited to submit original and unpublished research works on above topics. Submitted papers must not have been published or simultaneously submitted elsewhere. The submitted paper must be between 10 to 16 pages long and formatted according to the Springer LNCS (Lecture Notes in Computer Science) rules, Guidelines and templates can be found at the url http://www.springer.com/it/computer-science/lncs/conference-proceedings-guidelines

To submit a paper, please connect to the Submission site from the link available at the ICCSA 2019 web site: http://ess.iccsa.org.
Only papers submitted through the electronic system and strictly adhering to the relevant format will be considered for reviewing and publication. Please pay attention, when submitting your contribution to the workshop, to select the right entry in the listbox shown in the submission form.


CONFERENCE POLICY

By submitting the paper to ICCSA conference, all authors agree to abide by all ICCSA conference paper submission, publication and presentation policies. Namely, authors confirm that the work is original, has not appeared in literature in any form in the past and will not be submitted to any other venue concurrently with ICCSA submission or until it appears in ICCSA proceedings (in the case of acceptance). Furthermore, upon paper acceptance, authors agree to transfer copyright on the accepted paper to ICCSA, and one of the authors will register the paper and present the paper at the event. No paper withdrawals can be accepted after Conference pre-registration date or within three months of the actual event, whichever date comes first. Paper withdrawal request can be only accepted in writing through email, letter or fax to conference organizers. The conference has no responsibility for any intentional or accidental misuse, misinterpretation, or failure to follow above rules and conditions and holds no legal, civil or other responsibility for opinions, content or utilization of any methods/algorithms expressed in the Conference Proceedings.

If you have any questions about paper submission or the workshop, please contact the workshop organisers.

IMPORTANT DATES

February 17, 2019: Deadline for paper submission
March 31, 2019: Notification of Acceptance.
May 8, 2019: Early-bird Registration ends.
May 8, 2019: Submission deadline for the final version of the Papers
July 1-4, 2019: ICCSA 2019 Conference


WORKSHOP ORGANIZERS

Massimo Cafaro
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: massimo.cafaro@unisalento.it

Italo Epicoco
University of Salento, Italy
Phone: +39 0832 297235
Fax: +39 0832 297235
Email: italo.epicoco@unisalento.it

Marco Pulimeno
University of Salento, Italy
Phone: +39 0832 297371
Fax: +39 0832 297235
Email: marco.pulimeno@unisalento.it

Giovanni Aloisio
University of Salento & Euro Mediterranean Center on Climate Change Foundation, Italy
Phone: +39 334 6501704
Fax: +39 0832 297235
Email: giovanni.aloisio@unisalento.it


International Program Committee:

All submitted papers will be reviewed by the workshop technical program committee members.
Program Committee formation is pending and will be finalised shortly.


-

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

Massimo Cafaro, Ph.D.
Associate Professor
Dept. of Engineering for Innovation
University of Salento, Lecce, Italy
Via per Monteroni
73100 Lecce, Italy
Voice/Fax +39 0832 297371
Web http://sara.unisalento.it/~cafaro
E-mail massimo.cafaro@unisalento.it
cafaro@ieee.org
cafaro@acm.org

CMCC Foundation
Euro-Mediterranean Center on Climate Change
Via Augusto Imperatore, 16 - 73100 Lecce
massimo.cafaro@cmcc.it

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

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

[DMANET] WG 2019: FIRST CALL FOR PAPERS

********************************************
WG 2019: FIRST CALL FOR PAPERS
********************************************

45th International Workshop on Graph-Theoretic Concepts in Computer Science
June 19-21, 2019, Hotel Vall de Núria, Vall de Núria, Catalonia, Spain
http://wg2019.sau.thilikos.info

Submission link: https://easychair.org/conferences/?conf=wg2019
Submission deadline: February 19, 2019

LOCATION
The WG 2019 conference is the 45th edition of the WG series. It will take
place in
Vall de Núria, a valley very close to the French-Spanish borders. The
conference
will take place from Wednesday June 19 to Friday June 21, 2019.
Participants are
expected to arrive at Vall de Núria on Tuesday June 18, preferably by train
from
Barcelona, to join the welcome reception in the evening.

IMPORTANT DATES
Submission of papers: February 19, 2019
Acceptance notification: April 19, 2019
Conference: June 19-21, 2019
Final version: July 9, 2019

SCOPE
- design and analysis of sequential, parallel, randomized, parameterized
algorithms,
- distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modeling,
- graph drawing and layouts,
- computational geometry,
- computational biology,
- graph mining,
- random graphs and models of the web and scale-free networks, and
- support of the above concepts by suitable implementations and
applications.

SUBMISSIONS AND PROCEEDINGS
Contributors are invited to submit an extended abstract of at most 12 pages
Springer LNCS format (www.springer.com/lncs) including title, abstract and
references.
Proofs omitted due to space restrictions must be placed in an appendix, to
be read
by program committee members at their discretion. All papers must be
original and not
simultaneously submitted to another journal or conference. Accepted
contributions will be
published in the conference post-proceedings in the Lecture Notes in
Computer Science
(ARCoSS/LNCS) series of Springer-Verlag.

INVITED SPEAKERS
Frédéric Havet (Sophia Antipolis, France)
Saket Saurabh (Chennai, India & Bergen, Norway)
Marc Noy (Barcelona, Spain)

PROGRAM COMMITTEE
L. Sunil Chandran, Indian Institute of Science, India
Maria Chudnovsky, Princeton University, USA
Marek Cygan, University of Warsaw, Poland
Tınaz Ekim Aşıcı, Bogazici University, Turkey
Jirí Fiala, Charles University, Czech Republic
Loukas Georgiadis, University of Ioannina, Greece
Petr Golovach, University of Bergen, Norway
Gregory Gutin, Royal Holloway, UK
Juraj Hromkovic, ETH Zurich, Switzerland
Michael Kaufmann, University of Tuebingen, Germany
Eun Jung Kim, CNRS, LAMSADE, France
Cláudia Linhares Sales, Universidade Federal do Ceará, Brazil
Bojan Mohar , Simon Fraser University, Canada & University of Ljubljana,
Slovenia
Rolf Niedermeier, Technische Universität Berlin, Germany
Naomi Nishimura, University of Waterloo, Canada
Nicolas Nisse, INRIA Sophia Antipolis, France
Daniel Paulusma, Durham University, UK
Ignaz Rutter, Universität Passau, Germany
Ignasi Sau (Chair), CNRS, LIRMM, France
Maria Serna, UPC & Barcelona Graduate School of Mathematics, Spain
Mordechai Shalom, TelHai Academic College, Israel
Hisao Tamaki, Meiji University, Japan
Dimitrios M. Thilikos (Chair), CNRS, LIRMM, France & NKUA, Greece

ORGANIZING COMMITTEE
Ignasi Sau
Dimitrios M. Thilikos

CONTACT INFORMATION
wg2019@thilikos.info

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

Sunday, December 16, 2018

[DMANET] 9th PhD Summer School in Discrete Mathematics, Slovenia

Dear Colleagues,

We are happy to announce the "9th PhD Summer School in Discrete
Mathematics" to be held on Mt. Rogla, Slovenia, June 30 -- July 6, 2019.
The summer school consist of two courses:

1. Combinatorial limits and their applications in extremal combinatorics
Daniel Kral (Masaryk University, Czech Republik and University of Warwick,
UK)

2. Coxeter groups
Alice Devillers (The University of Western Australia, Australia)

There will also be a session of invited talks.
Confirmed invited speakers are:
Vida Dujmovic (University of Ottawa, Canada)
Miguel Angel Pizana (Universidad Autonoma Metropolitana-Iztapalapa, Mexico)
Jeroen Schillewaert (University of Auckland, New Zealand)
Klara Stokes (University of Skovde, Sweden)

Students will have the opportunity to present their research work. All
students that will give a talk during 9th PhD Summer School in Discrete
Mathematics will be competing for the best student talk award.

Financial support for PhD-students is available. This includes half-board
in one of the bungalows and the exemption from conference fee payment.
Students that want to apply for it, should indicate this in the
registration form and send their motivation letter and short CV (in
English).
Deadline for the financial support application is February 28th, 2019.


The registration form together with other relevant information (overview of
the mini-courses, accommodation, traveling information, mode of payment,
instructions for students etc.) is available at

https://conferences.famnit.upr.si/event/12/


Please feel free to forward this message to your colleagues and students.
For further questions please contact sygn@upr.si.


Best regards,

The Scientific Committee of 9th PhD Summer School in Discrete Mathematics:
Ademir Hujdurovic, Klavdija Kutnar, Aleksander Malnic, Dragan Marusic,
Stefko Miklavic, Primoz Sparl

The Organizing Committee of 9th PhD Summer School in Discrete Mathematics:
Bosjan Frelih, Ademir Hujdurovic, Bostjan Kuzman, Rok Pozar

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

[DMANET] Session on "Negative Ties and Signed Graphs" at Sunbelt 2019 in Montréal, Canada (June 18-23) – abstract submission deadline: 1 February 2019

*Special Conference-Within-a-Conference on Negative Ties and Signed Graphs
at Sunbelt 2019 Montréal, Canada (June 18-23)*


*Note: This session is open to anyone interested in presenting research on
negative and signed ties. There is no requirement to have submitted or been
accepted for the Special Issue. *

The journal Social Networks will be publishing a special issue on negative
ties and signed graphs that focuses on the co-existence of positive and
negative ties in networks and the need to study them together in order to
better understand network content and dynamics. To celebrate the special
issue and to point the way forward to new research in this burgeoning area,
we invite anyone with an interest in the topic to submit their work to a
special mini-conference within the Sunbelt social network conference.

In addition, we are asking authors of manuscripts that are either already
accepted for publication in the special issue or that went through the
revision process to present their work at the conference. We hope to have a
nice mix of presentations for work that has already undergone a significant
journal review process and more early-stage projects.

The conference will take place over a day to a day-and-a-half (to be
determined based on the number of submissions) during the normal course of
the Sunbelt conference in Montreal, Quebec in June, 2019.

In addition to presentations, the conference will feature panels and
discussions about the future of signed graph research, as well as helpful
tips on improving this work moving forward.

Please submit your abstracts for this conference through the session
labelled:


*"Negative Ties and Signed Graphs" *
at the 2019 Sunbelt Conference of the International Network for Social
Network Analysis (INSNA), June 18-23, 2019, Montréal, Canada.


Session organizers:

· Filip Agneessens, Surrey Business School, University of Surrey

· Samin Aref, Max Planck Institute for Demographic Research

· Nicholas Harrigan, School of Social Sciences, Singapore
Management University

· Giuseppe (Joe) Labianca, LINKS Network Analysis Center,
University of Kentucky

· Zachary Neal, Michigan State University


We encourage a wide range of submissions. Example works include (but are
not limited to): Methods and measures pertaining to negative ties and
signed graphs; understanding the inner workings of political and legal
bodies such as legislatures or courts; understanding how threats within a
network create needs for allies, and the implications for nodal power;
examining where bullying emerges in schools or organizations; how
perception of negative ties poses unique challenges in organizational
research; examining how relational ambivalence affects relational
trajectories; and how subgroup fault lines affect intra- and inter-group
conflict.

Please submit your abstract before 1 February 2019 . Please limit your
abstract to 250-500 words. If there is a full manuscript associated with
the abstract, please make note of this at the end of your abstract.

The conference website (https://www.fourwav.es/view/717/info/) provides
additional information.

The submissions website is located here:
https://www.fourwav.es/view/717/submission/


We look forward to your submissions.

*Samin Aref*

Laboratory of Digital and Computational Demography

Max Planck Institute for Demographic Research

Konrad-Zuse-Str. 1, 18057 Rostock

mailto:aref@demogr.mpg.de <aref@demogr.mpg.de>

http://www.demogr.mpg.de

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

[DMANET] Final call for nominations: Presburger Award for Young Scientists 2019

Final Call for Nominations: Presburger Award for Young Scientists 2019
Deadline: December 31st, 2018

Starting in 2010, the European Association for Theoretical Computer Science (EATCS) confers each year at ICALP the Presburger Award to a young scientist (in exceptional cases to several young scientists) for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers. The award is named after Mojzesz Presburger who accomplished his path-breaking work on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929.

Nominations for the Presburger Award can be submitted by any member or group of members of the theoretical computer science community except the nominee and his/her advisors for the master thesis and the doctoral dissertation. Nominated scientists have to be at most 35 years at the time of the deadline of nomination (i.e., for the Presburger Award of 2019 the date of birth should be in 1983 or later). The Presburger Award Committee of 2019 consists of Thore Husfeldt (Lund University and IT University of Copenhagen), Anca Muscholl (LaBRI, Bordeaux) and Jukka Suomela (Aalto, chair).

Nominations, consisting of a two page justification and (links to) the respective papers, as well as additional supporting letters, should be sent by e-mail to:

presburger-award@eatcs.org

The subject line of every nomination should start with Presburger Award 2019, and the message must be received before December 31st, 2018.

The award includes an amount of 1000 Euro and an invitation to ICALP 2019 for a lecture.

Previous Winners:
Mikolaj Bojanczyk, 2010
Patricia Bouyer-Decitre, 2011
Venkatesan Guruswami and Mihai Patrascu, 2012
Erik Demaine, 2013
David Woodruff, 2014
Xi Chen, 2015
Mark Braverman, 2016
Alexandra Silva, 2017
Aleksander Madry, 2018

Official website: http://www.eatcs.org/index.php/presburger


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

[DMANET] PhD studentship on Algorithms for Large Graphs at University of Sheffield (UK)

The Department of Computer Science at the University of Sheffield is
offering a fully funded 3 year PhD studentship on Algorithms for Large
Graphs

Project Description

Graphs or networks are a natural way to describe structural information.
For example, users of Facebook and the acquaintance relations among them
form a social network, the proteins together with interactions between
them define a biological network, and web-pages and hyperlinks give rise
to a huge web graph. Due to the rapid development of information
technology, many such graphs become extremely large, and are constantly
changing, which poses great challenges for efficiently analysing their
structures. This project aims to tackle these challenges through the
design and analysis of graph algorithms in the modern computational
models, including sublinear algorithms (e.g., property testing,
streaming algorithms) that only read a small portion or store a small
sketch of the large input while still have provable performance
guarantees, and dynamic algorithms that update efficiently the solution
of a problem after dynamic changes over the graph. Practical
applications of these theoretical studies will also be considered.

This project will be supervised by Dr Pan Peng, and commences in early 2019.

Prospective candidates should have excellent academic degree in computer
science, mathematics or a related area. The studentship requires good
background knowledge in Theoretical Computer Science, discrete
mathematics related to computer science and algorithm design.
Applications should include a detailed CV, proof of diplomas and
transcripts of records (BSc and MSc), and a cover letter detailing the
motivation and background. The application (or informal enquiries), in
English, must be send to Dr Pan Peng at p.peng@sheffield.ac.uk.

Funding Notes

This fully funded studentship is open to UK or EU students, and provides
a tax-free living allowance at the standard Research Council rate
(£14,777 p.a. for 2018/19) and full student tuition fees for three years.

We are also accepting applications from self-funded students and we
particularly welcome applicants through the China Scholarship Council
Scheme .

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

Saturday, December 15, 2018

[DMANET] PhD position in Operations Research at Eindhoven University of Technology

The Operations Planning Accounting and Control (OPAC) group at the
Eindhoven University of Technology has one PhD position in:
Data-driven E-Commerce Order Fulfillment (1.0 fte)

As e-commerce continues to grow, the logistics of moving products along the
last leg from warehouses to end-customers has become more important and
more complex. The market is highly competitive, volumes increase and
customers expect faster, on-demand deliveries, 7 days a week. As of 2022,
the USA e-commerce retail market is expected to grow to a staggering US$
638 billion, from US$ 409 billion in 2017 [Statista 2018]. Similar growth
rates are reported for Europe and several Asian countries. To cope with
this growth in expected volume, the capacity of last-mile delivery systems
will have to expand significantly.
The focus of this particular project is on e-fulfillment: a term which
collectively denotes warehousing operations, last-mile delivery and their
interdependence. Within the context of e-fulfillment, we study data-driven
optimization. Key to this research is the question how data can be used to
make better decisions. Data from various sources is available in abundance:
sensor and tracking data (IoT), demand, traffic and weather forecasts, etc.
It however remains largely unclear how this data can be used effectively to
improve e-fulfillment. Consequently, the main goal of this project is to
develop data-driven optimization techniques to improve efficiency in
e-fulfillment, while reducing costs, increasing customer satisfaction, and
lowering the ecological impact.
Within the context of the project, the candidate will be developing new
methodology, which typically involves Mathematical programming (Integer and
Constraint Programming), Stochastic optimization, as well as Machine
learning.

This project is funded by the Netherlands Organisation for Scientific
Research (NWO) and the Indian Ministry of Electronics and Information
Technology (MeitY).

The PhD candidate is expected to do scientific research in the domain
described, write a PhD thesis and publish research results in scientific
journals. The research is executed under the supervision of dr. Joris
Kinable and prof.dr. Tom van Woensel. The candidate also participates in
the PhD education program. A small part of the position involves teaching
(in English) in courses offered by the group.
Applicants for the PhD project should have completed (or be close to
completion of) a Master's degree in Operations Research, Computer Science,
Econometrics, Mathematics or a comparable domain. Fluency in English is
required. Moreover, the candidate must be comfortable in programming in an
OO programming language such as Java or C++. Affinity with Industrial
Engineering, Operations Management or Econometrics is a plus.

For more information (including the application procedure):
https://jobs.tue.nl/en/vacancy/phd-student-on-datadriven-ecommerce-order-fulfillment-10-fte-404945.html

Joris Kinable
Assistant Professor
Eindhoven University of Technology

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