[DMANET] ISAAC 2017 - Final call for papers

---------------------------------------------------------------
Final Call for Papers

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017)
December 9-12, 2017, Phuket, Thailand
http://aiat.in.th/isaac2017/

Submission Deadline: June 29, 2017 11:59PM (PDT)
---------------------------------------------------------------

The 28th International Symposium on Algorithms and Computation
(ISAAC 2017) will be held in Phuket, Thailand on December 9-12,
2017. The symposium is intended to provide a forum for
researchers working in algorithms and theory of computation.
Papers presenting original research in the areas of algorithms
and theory of computation are sought. Papers in relevant
applied areas are also welcomed. The topics include, but are
not limited to:
Algorithmic game theory
Algorithms and data structures
Approximation algorithms
Combinatorial optimization
Computational biology
Computational complexity
Computational geometry
Cryptography
Experimental algorithms
Graph drawing and graph algorithms
Internet algorithms
Online algorithms
Parallel and distributed algorithms
Quantum computing
Randomized algorithms.

---------------------------------------------------------------
Important Dates

June 29, 2017: Submission Deadline
August 31, 2017: Notification
October 3, 2017: Camera-Ready Version Due
December 9-12, 2017: ISAAC

---------------------------------------------------------------
Submission Guidelines

Authors are invited to submit an extended abstract or full
paper of at most 12 pages with an optional appendix. The
submission should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear
comparison with related work. They must not be submitted
simultaneously to another conference with refereed proceedings
or to a journal. Drafts which contain essentially the same
results as papers under review in other conferences or
journals cannot be submitted to ISAAC 2017. Exempted are
workshops and conferences without formal proceedings, but
possibly with handouts containing short abstracts. At least
one author of an accepted paper is required to present the
paper at the conference as a registered participant.

Papers must be formatted in LaTeX, using the LIPIcs style file,
which is available at
http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/ .
The maximum length of the paper (including title, the list of
authors, abstract, references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the
font, do not make a separate title page, etc.: use the LIPIcs
style file as given.

Proofs omitted due to space constraints must be placed in an
appendix that is to be read by the program committee members
at their discretion and will not be published as part of the
proceedings. Thus the paper without the appendix should be
able to stand on its own.

Submissions are due on June 29, 2017 11:59PM (PDT). Only
electronic submission will be allowed via the easychair
submission server
http://www.easychair.org/conferences/?conf=isaac2017 .

These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LIPIcs format) will
be rejected without consideration of their merits.

---------------------------------------------------------------
Availability of Full Versions

Polished full versions are expected to be published in refereed
journals after the ISAAC conference. Upon acceptance, if there
is an omitted detail in the camera-ready version for ISAAC,
authors are encouraged to upload a full version of the accepted
paper to a preprint server, e.g., arXiv, ECCC, or an
e-repository at universities/institutes, so that interested
readers can access the full proofs that are omitted in ISAAC
proceedings. When authors refer to omitted proofs in ISAAC
proceedings, citation to the accessible full version is
desired. However, uploading a full version is not mandatory
for authors.

---------------------------------------------------------------
Special Issues

Special issues in Algorithmica and International Journal of
Computational Geometry and Applications are planned for
selected papers from ISAAC 2017.

---------------------------------------------------------------
Awards

The Best Paper and the Best Student Paper will be awarded. A
paper is eligible for the Best Student Paper if all authors are
full-time students at the time of submission. To indicate that
a submission is eligible, please mark the checkbox ``Eligible
for best student paper'' in the web form on the submission
server.

---------------------------------------------------------------
Invited Speakers

Satoru Iwata (University of Tokyo, Japan)
Suresh Venkatasubramanian (University of Utah, USA)

---------------------------------------------------------------
Program Committee

Isolde Adler (University of Leeds, UK)
Patrizio Angelini (University of Tübingen, Germany)
Markus Bläser (Saarland University, Germany)
Yixin Cao (Hong Kong Polytechnic University, Hong Kong)
Jean Cardinal (Université Libre de Bruxelles, Belgium)
Parinya Chalermsook (Aalto University, Finland)
Erin Wolf Chambers (Saint Louis University, USA)
Kun-Mao Chao (National Taiwan University, Taiwan)
Sevag Gharibian (Virginia Commonwealth University, USA)
Keiko Imai (Chuo University, Japan)
Taisuke Izumi (Nagoya Institute of Technology, Japan)
Jesper Jansson (Kyoto University, Japan)
Naoyuki Kamiyama (Kyushu University, Japan)
Akinori Kawachi (Tokushima University, Japan)
Chung-Shou Liao (National Tsing Hua University, Taiwan)
Yoshio Okamoto (The University of Electro-Communications, Japan) Co-Chair
Dömötör Pálvölgyi (University of Cambridge, UK)
C. Pandu Rangan (Indian Institute of Technology Madras, India)
Laura Sanità (University of Waterloo, Canada)
Daniel Stefankovic (University of Rochester, USA)
Takeshi Tokuyama (Tohoku University, Japan) Co-Chair
Kei Uchizawa (Yamagata University, Japan)
Marc van Kreveld (Utrecht University, the Netherlands)
Haitao Wang (Utah State University, USA)
Yajun Wang (Microsoft, USA)
Wei Xu (Tsinghua University, P.R. China)
Guochuan Zhang (Zhejiang University, P.R. China)
Martin Ziegler (KAIST, Republic of Korea)

---------------------------------------------------------------
Local Arrangement Committee

Thanaruk Theeramunkung (Sirindhorn International Institute of Technology,
Thammasat University)
Jittat Fakcharoenphol (Kasetsart University)
Natsuda Kaothanthong (Sirindhorn International Institute of Technology,
Thammasat University)
Pokpong Songmuang (Thammasat University)
**********************************************************
*
* 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] 2 PhD positions at LMU Munich - Algorithmic Genomics

The Canzar lab at the Gene Center of the Ludwig-Maximilians
Universität Munich is recruiting two PhD students in algorithmic
genomics, to start in fall 2017. The position provides a competitive
salary for a period of 4 years.

The successful applicant will develop and engineer efficient
algorithms for analyzing Big Data in genomics, from (single-cell)
RNA-seq to third-generation technologies like PacBio and Oxford
Nanopore.

Supporting the lab's agenda, the successful candidate will employ
tools and techniques from combinatorial optimization and machine
learning to reveal biological clues buried under billions of short
genomic sequences. Translated into scalable and usable software, they
will equip scientists around the world with powerful tools to get the
most from the many petabytes of sequencing data produced every year.

The Canzar lab is embedded in the stimulating, interdisciplinary
environment of the Graduate School for Quantitative Biosciences Munich
(QBM), which integrates approaches ranging from (bio)informatics and
theoretical biophysics to molecular systems biology. The lab is housed
in the new Research Center for Molecular Biosystems (BioSysM) at the
life sciences campus Grosshadern/ Martinsried, with excellent access
to other parts of Munich via public transport.

We are seeking motivated candidates with an excellent Master's degree
(or equivalent) in computer science, (applied) mathematics, or
bioinformatics to join our lab. We expect the candidate to have a
solid background in algorithm design and good programming skills as
well as an interest in interdisciplinary work (biology, medicine).

To apply, send your application materials, including a motivation
letter, your CV, and names of two referees in a single pdf file to
Stefan Canzar (stefan.canzar@lmu.de), who can also supply further
information about this position. For more information about the lab at
LMU, please visit our website at https://canzarlab.github.io/.

Applications will be reviewed starting from July 10, 2017.

**********************************************************
*
* 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 Deadline Extension: The 3rd IEEE International Conference on Data Science and Systems (DSS 2017)

******************************** IEEE DSS-2017 CFP *******************************
The 3rd IEEE International Conference on Data Science and Systems (DSS 2017)
Bangkok, Thailand
December 18 - 20, 2017
http://hpcl.seas.gwu.edu/dss2017/ <http://hpcl.seas.gwu.edu/dss2017/>

INTRODUCTION
=============
In parallel with Petrol as a driving resource in this world, Data is becoming an increasingly decisive resource in modern societies, economies, and governmental organizations. Gradually and steadily, it is being world-wide recognized that data and talents are playing key roles in modern businesses.
As an interdisciplinary area, Data Science draws scientific inquiry from a broad range of subject areas such as statistics, mathematics, computer science, machine learning, optimization, signal processing, information retrieval, databases, cloud computing, computer vision, natural language processing and etc. Data Science is on the essence of deriving valuable insights from data. It is emerging to meet the challenges of processing very large datasets, i.e. Big Data, with the explosion of new data continuously generated from various channels such as smart devices, web, mobile and social media.
Data Systems are posing many challenges in exploiting parallelism of current and upcoming computer architectures. Data volumes of applications in the fields of sciences and engineering, finance, media, online information resources, etc. are expected to double every two years over the next decade and further. With this continuing data explosion, it is necessary to store and process data efficiently by utilizing enormous computing power. The importance of data intensive systems has been raising and will continue to be the foremost fields of research. This raise brings up many research issues, in forms of capturing and accessing data effectively and fast, processing it while still achieving high performance and high throughput, and storing it efficiently for future use. Innovative programming models, high performance scalable computing platforms, efficient storage systems and expression of data requirements are at immediate need.
DSS (Data Science and Systems) was created to provide a prime international forum for researchers, industry practitioners and domain experts to exchange the latest advances in Data Science and Data Systems as well as their synergy. 2017 is the 3rd event following the success in 2015 (DSDIS 2015) and 2016 (DSS 2016).

SCOPE AND TOPICS

================

A. Data Science

• Foundational theories and models of data science

• Foundational algorithms and methods for big data

• Data classification and taxonomy

• Data metrics and metrology

• Machine learning and deep learning

• Data analytics

• Data provenance

• Fault tolerance, reliability, and availability

• Security, privacy and trust in Data

B. Data Processing Technology

• Data sensing, fusion and mining

• Data representation, dimensionality reduction, processing and proactive service layers

• Data capturing, management, and scheduling techniques

• Stream data processing and integration

• Knowledge discovery from multiple information sources

• Statistical, mathematical and probabilistic modeling and theories

• Information visualization and visual data analytics

• Information retrieval and personalized recommendation

• Parallel and distributed data storage and processing infrastructure

• MapReduce, Hadoop, Spark, scalable computing and storage platforms

• Security, privacy and data integrity in data sharing, publishing and analysis

• Replication, archiving, preservation strategies

• Stream data computing

• Meta-data management

• Remote data access

C. Data Systems

• Storage and file systems

• High performance data access toolkits

• Programming models, abstractions for data intensive computing

• Compiler and runtime support

• Future research challenges of data intensive systems

• Real-time data intensive systems

• Network support for data intensive systems

• Challenges and solutions in the era of multi/many-core platforms

• Green (power efficient) data intensive systems

• Data intensive computing on accelerators and GPUs

• Productivity tools, performance measuring and benchmark for data intensive systems

• Big Data, cloud computing and data intensive systems

D. Data Applications

• HPC system architecture, programming models and run-time systems for data intensive applications

• Innovative applications in business, finance, industry and government cases

• Data-intensive applications and their challenges

• Innovative data intensive applications such as health, energy, cybersecurity, transport, food, soil and water, resources, advanced manufacturing, environmental Change, and etc.

IMPORTANT DATES
================
· Paper Submission Deadline: July 1, 2017 (Extended)
· Authors Notification: August 15, 2017
· Camera-Ready Paper Due: September 15, 2017
· Early Registration Due: September 15, 2017
· Conference Date: December 18 - 20, 2017

PAPER SUBMISSION GUIDELINE
==========================
Submissions must include an abstract, keywords, the e-mail address of the corresponding author and should not exceed 8 pages for main conference, including tables and figures in IEEE CS format. The template files for LATEX or WORD can be downloaded here. All paper submissions must represent original and unpublished work. Each submission will be peer reviewed by at least three program committee members. Submission of a paper should be regarded as an undertaking that, should the paper be accepted, at least one of the authors will register for the conference and present the work. Submit your paper(s) in PDF file at the submission site.

PUBLICATIONS
==========================
Accepted and presented papers will be included into the IEEE Conference Proceedings published by IEEE CS Press. Authors of accepted papers, or at least one of them, are requested to register and present their work at the conference, otherwise their papers may be removed from the digital libraries of IEEE CS after the conference.
Distinguished papers presented at the conference, after further revision, will be published in special issues of Journal of Network and Computer Applications, Future Generation Computer Systems, Journal of Computer and System Sciences and IEEE Transactions on Emerging Topics in Computing.
**********************************************************
*
* 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] Open PhD position: "Optimization of Wind-to-Hydrogen supply chain under uncertainty"

"Optimization of Wind-to-Hydrogen supply chain under uncertainty"

Hydrogen is the only carbon-free storable fuel. When combined with
renewable energy sources, it has the potential to become one of the main
contributors of a sustainable future as a green energy vector.
This PhD thesis will focus on a Wind-to-Hydrogen (W2H2) system where
hydrogen is produced through electrolysis of water and electricity is
provided by a wind farm. After production, hydrogen should be stored,
transported and distributed in an optimal way, given the numerous
technology alternatives available.

In this system, there will be two decision makers: wind farm operator
and hydrogen producer with conflicting interests in a hierarchical
setting. This type of problems is usually modeled as a Stackelberg game
(bilevel programming) in the literature and it will be direction of this
thesis as well.

Uncertainties of the system notably come from electricity generation
(due to changing weather conditions), variability of energy prices in
the day-ahead spot market and demand fluctuation. These uncertainties
will be addressed in the modelling part.

We are offering a 3-year CIFRE contract PhD thesis in collaboration with
PersEE Innovation, a Paris based startup company (Sezin Afsar) and
Laboratory CERMICS, Ecole des Ponts Paris Tech (Michel De Lara). The
thesis will be based on modeling and solving different versions of this
problem described above. Different types of real-life or realistic data
will be available for testing.

Keywords: supply chain management, wind energy, hydrogen, stochastic
optimization, bilevel programming

Required Technical Skills:
• Master's degree or equivalent in Industrial Eng, Computer Science,
Applied Math or any relevant subject
• Experience in Python/C/C++ and solvers such as GAMS, CPLEX or Gurobi
• General knowledge of mathematical programming and optimization.
Expertise in stochastic and bilevel programming is an advantage.
• Familiarity with at least one of relevant fields (energy systems,
renewable energy, scheduling, supply chain management…)

Behavioral Skills:
• Adaptability to team work
• Curiosity and enthusiasm to learn
• Flexibility
• Being open to new ideas and innovations
• Willingness to contribute to a cleaner future
• Speaking French is a plus

Candidates may send their CV, transcript, motivation letter and
references to saf@pers-ee.fr until July 15th, 2017. Start date will be
October 2017 or later.

--
Dr. Sezin AFSAR

PersEE - Optimization Scientist
(+33)1 40 05 04 03
**********************************************************
*
* 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] Research Position in Algorithms and Complexity Theory at the University of Oxford

A research position in algorithms and complexity theory at the University of Oxford, with a start date as soon as possible and an end date on 28 February 2019.
Professor Leslie Ann Goldberg is looking for an additional postdoctoral researcher to join the ERC project "Mapping the Complexity of Counting" at the University of Oxford. This is a five-year project from 1 March 2014 to 28 February 2019. After the new appointment, we will have four postdocs in all. See http://www.cs.ox.ac.uk/people/leslieann.goldberg/mcc.html.

The salary range is GBP 31,076 - 38,183 per year, depending on experience.

Deadline for applications noon 19 July, 2017.
Interviews (skype) 2 August.
Details and application form at http://www.cs.ox.ac.uk/news/1329-full.html.

Any questions? leslie.goldberg@cs.ox.ac.uk<mailto:leslie.goldberg@cs.ox.ac.uk>

The project is about figuring out the complexity of computational counting problems, which includes complexity theory, phase transitions, dichotomy theorems, mixing rates of stochastic processes, etc.

Candidates should have a PhD in algorithms and complexity or in a closely related area of discrete mathematics.
Expertise in one or more of the following would be helpful: combinatorics or discrete probability, graph polynomials or partition functions, mixing rates of Markov chains, constraint satisfaction problems including algebraic methods for classifying their difficulty, holographic algorithms or Holant problems.

**********************************************************
*
* 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: JCDCG^3 2017: Submission DL (June 30) approaching

JCDCG^3 2017: The 20th Anniversary of Japan Conference on Discrete and Computational Geometry, Graphs, and Games --- Celebrating the Works and Contributions of Professors Jin Akiyama, Vasek Chvatal, Mikio Kano, Janos Pach, and Jorge Urrutia

(Apologize for multipule distributions)

---- 2nd Call For Presentations ---

Date: Aug. 29 -- Sept. 1, 2017
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Submission Deadline: June 30th, 2017 (JST)

Web site:
http://www.jcdcgg.u-tokai.ac.jp
http://www.alg.cei.uec.ac.jp/itohiro/JCDCGG/

Invited Plenary Speakers:
- Jin Akiyama (Tokyo University of Science, Japan)
- Vasek Chvatal (Concordia University, Canada)
- Erik Demaine (MIT, USA)
- David Eppstein (University of California, Irvine, USA)
- Mikio Kano (Ibaraki University, Japan)
- Naoki Katoh (Kwansei Gakuin University, Japan)
- Evangelos Kranakis (Carleton University, Canada)
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Jorge Urrutia (UNAM, Mexico)

Scope:
We invite submissions of original research on, but not restricted to, discrete geometry, computational geometry, graph theory, graph algorithms, and complexity and winning strategies of games and puzzles.

The collection of abstracts will be distributed in only electric form.

Submission format: Authors are required to submit a pdf-file of an extended abstract of
** at most 2 pages **
in a standard 10-point font on A4-paper to

https://easychair.org/conferences/?conf=jcdcg32017

by June 30th, 2017 (JST).

Note:
- We have not prepared for special rates at hotels. So, please
make accommodation arrangements on your own..
- The official language for presentations and abstracts of talks
in this conference is English.

Special Issue *****
The collection of abstracts will be distributed in electric form.
No formal proceedings will be published (such as LNCS).
However, we plan to edit a special issue of this conference. This
issue will appear in Graphs and Combinatorics, Springer,
Details on this special issue will be given afterward.

***************************************************************
* Important Dates:
* - Extended-Abstract (at most 2 pages) Submissions Deadline:
* June 30th, 2017 (JST)
* - Notification: (expected to) July 14, 2017
* - Camera-Ready File Submission Deadline: July 28, 2017
* - Conference: Aug. 29 -- Sept. 1, 2017
***************************************************************

Committees:

Conference Chair: Toshinori Sakai (Tokai University, Japan)

Programming Committee:
- Jean Cardinal (ULB, Belgium)
- Ruy Fabila-Monroy (Cinvestav, Mexico)
- Takashi Horiyama (Saitama University, Japan)
- Hiro Ito (UEC, Japan; Chair)
- Matias Korman (Tohoku University, Japan)
- Stefan Langerman (ULB, Belgium)
- Chie Nara (Meiji University, Japan)
- Yoshio Okamoto (UEC, Japan)
- Hirotaka Ono (Nagoya University, Japan)
- Vera Sacristan (UPC, Spain)
- Toshinori Sakai (Tokai University, Japan)
- Tomohiro Tachi (University of Tokyo, Japan)
- Ryuhei Uehara (JAIST, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)
- Aaron Williams (Bard College at Simon's Rock, USA)

Organizing Committee:
- Hiro Ito (UEC, Japan)
- Takako Kodate (Tokyo Woman's Christian University, Japan)
- Keiko Kotani (Tokyo University of Science, Japan; co-chair)
- Yasuko Matsui (Tokai University, Japan)
- Atsuki Nagao (Seikei University, Japan)
- Toshinori Sakai (Tokai University, Japan; co-Chair)
- Kazuhisa Seto (Seikei University, Japan)
- Xuehou Tan (Tokai University, Japan)
- Shin-ichi Tokunaga (Tokyo Medical and Dental University, Japan)

Contact:
JCDCG^3 2017 Organizing Committee
jcdcgg@ml.tokai-u.jp

..A A .. ......ITO Hiro, Professor
. ..... School of Informatics and Engineering,
. @ @ .... The University of Electro-Communications
. = x = . .... 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, JAPAN
. . . . Tel/Fax: +81 42 443 5332
.(( (( ( .. E-mail: itohiro@uec.ac.jp

**********************************************************
*
* 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] Reachability Problems RP2017 - Extended Deadline: 19 June

Dear Colleagues,

The deadline for Reachability Problems Workshop RP2017 ( http://rp17.cs.rhul.ac.uk ) has been extended to 19th June.
(RP'17) 11th International Workshop on Reachability Problems 2017<http://rp17.cs.rhul.ac.uk/>
rp17.cs.rhul.ac.uk
Workshop on Reachability Problems

The call for papers is available here: http://rp17.cs.rhul.ac.uk/cfp.txt and also attached below.

Please consider to send your papers and encourage your collaborators to come to Reachability Problems
that will be in 2017 in London. The nearby event (immediately after RP) will be
Highlights of Logic, Games and Automata 2017 http://highlights-conference.org/

Hope to see you in London in September.

Best Regards,
Igor

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

The 11th International Workshop on Reachability Problems (RP'17)

7 - 9 September 2017 | Royal Holloway, University of London, UK | http://rp17.cs.rhul.ac.uk

The 11th Workshop on Reachability Problems will be hosted at Royal Holloway,
University of London.

The Reachability Workshop is specifically aimed at gathering together scholars
from diverse disciplines interested in reachability problems that appear in
algebraic structures, computational models, hybrid systems, logic and
verification.

Invited Speakers:

Hana Chockler, King's College London
Laurent Doyen, LSV - ENS Cachan
Raphael Jungers, Universite catholique de Louvain
Andreas Podelski, University of Freiburg

Submissions:

Authors are invited to submit a draft of a full paper with at most 12 pages (in
LaTeX, formatted according to LNCS guidelines) via Easychair. Proofs omitted
due to space constraints must be put into an appendix to be read by the program
committee members at their discretion. Submissions deviating from these
guidelines risk rejection. Electronic submissions should be formatted in pdf.
Simultaneous submission to other conferences or workshops with published
proceedings is not allowed.

Submission link: https://easychair.org/conferences/?conf=rp2017

Topics of interest include (but are not limited to): reachability problems in
infinite state systems, rewriting systems, dynamical and hybrid systems;
reachability problems in logic and verification; reachability analysis in
different computational models, counter timed/cellular/communicating automata;
Petri nets; computational aspects of algebraic structures (semigroups, groups
and rings); frontiers between decidable and undecidable reachability problems;
predictability in iterative maps and new computational paradigms.

Important Dates

Submission deadline: 19 June 2017 (AoE) (EXTENDED)
Notification to authors: 11 July 2017 (EXTENDED)
Final version: 14 July 2017 (EXTENDED)
Workshop: 7 - 9 September 2017

Presentation-Only Track

In addition to regular papers that will appear in our LNCS proceedings, we
invite researchers to apply to give a presentation at RP'17 without an
accompanying paper. Such presentations can be based on work that has appeared
(or which is going to appear) in the proceedings of another conference, or which
has not yet been submitted. These contributions will be judged solely on the
basis of their attractiveness to the workshop.

To apply to give such a presentation please submit a PDF file containing a short
abstract (up to two pages) by e-mail [ rp2017@easychair.org ] by August 2st
2017, with subject "RP2017 Informal Presentations". This abstract will not be
published in the conference proceedings. Notification for the presentation-only
track will be August 9th 2016.

Proceedings

The Conference Proceedings will be published as the volume of the Springer
Verlag LNCS (Lecture Notes in Computer Science) series and distributed at the
Conference. We plan also to publish selected papers in a special issue of a high
quality journal following the regular referee procedure.

RP'16 Program Committee:

Igor Potapov, University of Liverpool (co-chair)
Matthew Hague, Royal Holloway, University of London (co-chair)

Paul Bell, Liverpool John Moores University
Patricia Bouyer-Decitre, LSV, CNRS & ENS de Cachan
Aiswarya Cyriac, Chennai Mathematical Institute
Giorgio Delzanno, Universita Degli Studi Di Genova
Piotrek Hofman, University of Warsaw
Peter Lammich, Institut fuer Informatik, TU Munich
Martin Lange, University of Kassel
Salvatore La Torre, Università degli Studi di Salerno
Ranko Lazic, University of Warwick
Ondrej Lengal, Brno University of Technology
Jerome Leroux, Laboratoire Bordelais de Recherche en Informatique
Rupak Majumdar, Max Planck Institute for Software Systems
Ahmed Rezine, Linköping University
Tachio Terauchi, School of Information Science, Japan Advanced Institute of Science and Technology
Hsu-Chun Yen, National Taiwan University

Previous Workshops:

2016: RP'16 in Aalborg, Denmark
LNCS proceedings, Volume 9899/2016, Springer Verlag
2015: RP'15 in Warsaw, Poland
LNCS proceedings, Volume 9328/2015, Springer Verlag
2014: RP'14 in Oxford, UK
LNCS proceedings, Volume 8762/2014, Springer Verlag
2013: RP'13 in Uppsala, Sweden
LNCS proceedings, Volume 8169/2013, Springer Verlag
2012: RP'12 in Bordeaux, France
LNCS proceedings, Volume 7550/2012, Springer Verlag
2011: RP'11 in Genova, Italy
LNCS proceedings, Volume 6945/2011, Springer Verlag
2010: RP'10 in Brno, Czech Republic
LNCS proceedings, Volume 6227/2010, Springer Verlag
2009: RP'09 in Palaiseau, France
LNCS proceedings, Volume 5797/2009, Springer Verlag
2008: RP'08 in Liverpool, UK
ENTCS proceedings, Volume 223, Elsevier
2007: RP'07 in Turku, Finland
TUCS General Publication Series, Volume 45, Turku Centre for Computer Science

**********************************************************
*
* 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] Postdoctoral Research Associate in Integer Programming for Matching Problems at the University of Edinburgh

Applications are invited for a 3-year, full time postdoctoral position in the area of integer programming and mathematical optimization algorithms for matching problems. The position will be based at the School of Mathematics, University of Edinburgh, and is available to start between October 1st and November 1st 2017.

The successful candidate will join the Edinburgh Research Group in Operational Research and Optimization (www.maths.ed.ac.uk/ERGO) and will work with Dr Sergio Garcia Quiles, Professor Jacek Gondzio and Dr Joerg Kalcsics on the project funded by the EPSRC Research Grant EP/P029825/1 "IP-Match: Integer Programming for Large and Complex Matching Problems".

This project is in collaboration with the University of Glasgow (EPSRC Research Grant EP/P029825/1) and the Project Partners NHS Blood and Transplant (NHSBT) and Teach First.

Applicants will have completed a PhD in Operational Research or a related field and will demonstrate outstanding research potential. An ideal candidate will have a documented expertise and research record in integer programming. The applicant will demonstrate excellent programming skills (C++ or similar) and will have high expertise in optimization solvers (CPLEX or similar).

All applicants should apply online. Only complete applications will be considered. Please upload a CV and a research statement under optional documents and arrange for at least two referees to send letters of recommendation directly to hr@maths.ed.ac.uk by the closing date of 5pm (GMT) on Monday July 31st 2017. We anticipate interviews will be held on the week commencing September 11th.

Salary: GBP 32,004 - 38,183 (depending on experience)

Informal enquiries: Dr Sergio Garcia Quiles, phone: +44 131 650 5038, e-mail: sergio.garcia-quiles@ed.ac.uk

--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

**********************************************************
*
* 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] OMG - DMV 2017 congress in Salzburg

Dear all,

we would like to invite you to contribute to the

Discrete Mathematics and Theoretical Computer Science

session of the 2017 Joint Annual Meeting of the Austrian and German Mathematical Societies in Salzburg, Austria, September 11 - 15, 2017

Registration and abstract submission are available at

http://oemg-dmv-2017.sbg.ac.at/

With thanks and best regards
Amin Coja-Oghlan
Mihyun Kang

**********************************************************
*
* 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] FCT 2017 - Call for participation

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

*** First Call for Participation ***

FCT 2017

21st International Symposium on
Fundamentals of Computation Theory

September 11-13, 2017
Bordeaux, France

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

*** Registration is now open athttp://fct2017.labri.fr/
*** Early registration: July 16, 2017.

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

=========
ABOUT FCT
=========

The Symposium on Fundamentals of Computation Theory (FCT) was established in 1977 for researchers interested in all aspects of theoretical computer science, and in particular algorithms, complexity, formal and logical methods. FCT is a biennial conference. The last preceding Symposia were held in Gdansk, Liverpool, Oslo, Wrocław, Budapest, Lübeck.

FCT 2017 will take place in Bordeaux, which is located in the South West of France. The region is famous for its wines and its gastronomy. The city centre of Bordeaux is classified at the Unesco World Heritage.

================
INVITED SPEAKERS
================

There will be four invited talks at FCT 2017. The invited speakers are:

- Thomas Colcombet (CNRS, Université Paris Diderot, France).
- Martin Dietzfelbinger (Technische Universität Ilmenau, Allemagne).
- Juraj Hromkovic (ETH Zürich, Suisse).
- Anca Muscholl (Université de Bordeaux, France).

There will also be one invited talk in memoriam of Zoltan Esik given by:

- Jean-Eric Pin (CNRS, Université Paris Diderot, France).

===============
ACCEPTED PAPERS (in submission order)
===============

1. Christof Löding and Christopher Spinrath. Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
2. Max Kanovich, Stepan Kuznetsov and Andre Scedrov. Undecidability of the Lambek calculus extended with subexponential and bracket modalities
3. Endre Boros, Ondrej Cepek and Kazuhisa Makino. Strong Duality in Horn Minimization
4. Joost Engelfriet and Andreas Maletti. Multiple Context-free Tree Grammars and Multi-Component Tree Adjoining Grammars
5. George Manoussakis. Listing all fixed length simple cycles in sparse graphs in optimal time
6. Emmanuel Filiot, Nicolas Mazzocchi and Jean-François Raskin. Decidable Weighted Expressions with Presburger Combinators
7. Holger Petersen. Busy Beaver Scores and Alphabet Size
8. Pierre Ganty and Elena Gutiérrez. Parikh Image of Pushdown Automata
9. Matthias Bentert, Till Fluschnik, André Nichterlein and Rolf Niedermeier. Parameterized Aspects of Triangle Enumeration
10. Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbańska and Paweł Żyliński. The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
11. Anurag Anshu, Peter Høyer, Mehdi Mhalla and Simon Perdrix. Contextuality in multipartite pseudo-telepathy graph games
12. Alexander Shen. Automatic Kolmogorov complexity and normality revisited
13. Tomasz Jurdzinski and Michał Różański. Deterministic Oblivious Local Broadcast in the SINR Model
14. Jérémie Cabessa and Olivier Finkel. Expressive Power of Evolving Neural Networks Working on Infinite Input Streams
15. Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon Pissis and Yann Ramusat. Minimal absent words in a sliding window & applications to on-line pattern matching
16. Luc Sanselme and Simon Perdrix. Determinism and Computational Power of Real Measurement-based Quantum Computation
17. Nicolas Bousquet, Aline Parreau and Arnaud Mary. Token Jumping in minor-closed classes
18. Christian Engels, Raghavendra Rao B V and Karteek Sreenivasaiah. On depth five Sum-Power-Sum-Power-Sum Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree.
19. Albert Atserias, Phokion Kolaitis and Simone Severini. Generalized Satisfiability Problems via Operator Assignments
20. Till Fluschnik, Marco Morik and Manuel Sorge. The Complexity of Routing with Few Collisions
21. Pushkar Joglekar, Raghavendra Rao B V and Siddhartha Sivakumar. On Weak-Space Complexity over Complex Numbers
22. Dima Grigoriev and Vladimir Podolskii. Tropical Combinatorial Nullstellensatz and Fewnomials Testing
23. Gianluca De Marco, Tomasz Jurdziński, Michał Różański and Grzegorz Stachowiak. Subquadratic Non-adaptive Threshold Group Testing
24. Aris Pagourtzis, Giorgos Panagiotakos and Dimitris Sakavalas. Reliable communication via semilattice properties of partial knowledge
25. Indranil Banerjee and Dana Richards. New Results On Routing Via Matchings On Graphs
26. Markus Blaeser, Raghavendra Rao B V and Jayalal Sarma. Testing Equivalence of Polynomials under Scaling
27. Charis Papadopoulos and Spyridon Tzimas. Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
28. Andreas Bärtschi and Thomas Tschager. Energy-efficient fast delivery by mobile agents
29. Kord Eickmeyer and Ken-Ichi Kawarabayashi. FO Model Checking on Map Graphs

===============================
FURTHER INFORMATION AND CONTACT
===============================

For more details, please visit the FCT 2017 website:http://fct2017.labri.fr/ (now open for registration).

For further information, please send an e-mail tofct2017@labri.fr.

**********************************************************
*
* 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] 2nd CfP for SOFSEM 2018 - deadline: 30 June 2017

-- S O F S E M 2018 --
44th International Conference on
Current Trends in Theory and Practice of Computer Science
Krems an der Donau, Austria
January 29 - February 2, 2018

Website: http://sofsem2018.ocg.at

-- 2nd CALL FOR PAPERS --

SUBMITTING PAPERS
The DEADLINE for submissions to SOFSEM 2018 is: JUNE 30th, 2017 (abstracts
due June 23rd). Papers should be submitted using EasyChair, following the
instructions at http://sofsem2018.ocg.at.

INVITED LECTURES
The program of SOFSEM 2018 will have both contributed and invited talks, The
invited lecturers include Manfred Broy (Munchen), Monika Henzinger (Vienna),
Michel Chaudron (Gothenburg), Danny Weyns (Leuven), Thomas Eiter (Vienna) and
Yannis Manolopoulos (Thessaloniki). Special keynote speaker is Georg Gottlob
(Oxford).

PROGRAM COMMITTEE CHAIR
A Min Tjoa (TU Wien, Austria)

SOFSEM 2018 TRACKS

A. FOUNDATIONS OF COMPUTER SCIENCE
Chairs:
- Jan van Leeuwen (Utrecht University, The Netherlands)
- Jiří Wiedermann (Academy of Sciences, Prague, Czech Republic)

B. SOFTWARE ENGINEERING: METHODS, TOOLS, APPLICATIONS
Chair:
- Stefan Biffl (TU Wien, Austria)

C. DATA, INFORMATION and KNOWLEDGE ENGINEERING
Chair:
- Ladjel Bellatreche (Laboratoire du LIAS, France)

For PhD students there is:
D. STUDENT RESEARCH FORUM
Chair:
- Roman Špánek (Technical University of Liberec, Czech Republic)

PROCEEDINGS
Proceedings will be published in the Series Lecture Notes in Computer Science
of Springer Verlag.

IMPORTANT DATES:
Paper Abstracts Deadline................ June 23, 2017
Full Papers Deadline.................... June 30, 2017
Notification (Acceptance/Rejection)..... September 21, 2017
Camera-ready Papers..................... October 4, 2017
Author Registration Deadline............ October 15, 2017
Poster Deadline......................... November 20, 2017
Early Registration Deadline............. November 24, 2017
Posters Camera-ready.................... December 5, 2017
Poster Author Registration Deadline......December 12, 2017
Late Registration Deadline.............. January 28, 2018
Conference...............................January 29 - February 2, 2018

ORGANIZATION:
AUSTRIAN COMPUTER SOCIETY (OCG)
Organizing Committee Chair
Ronald Bieber (OCG, Austria)

CONTACT
Christine Haas
Austrian Computer Society (OCG)
1010 Vienna | Wollzeile 1
Austria
christine.haas@ocg.at
http://sofsem2018.ocg.at

--------------------------------
--8323328-1281748953-1495529815=:3414--
**********************************************************
*
* 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] Announcements for PhD positions in Stochastic Programming and Data-Driven Optimization

*Ph.D. Student Positions*

Start date: Academic Year 2018-2019 (August 2018) – Application Deadline
January 10th, 2018.

The Decision Sciences Department at the George Washington University has
several openings for Ph.D. student positions (starting August 2018) to work
in one of the following areas: stochastic programming, distributionally
robust optimization, data-driven optimization with possible application in
financial risk and engineering, military operations, and disaster
management. Students with interests in these areas would work under the
supervision of Professor Miguel Lejeune (http://www.milejeune.org/). See
publications at: http://www.milejeune.org/res-publications-aio.html.

Candidates are required to have a degree in Computer Science, Operations
Research, Industrial Engineering, Mathematics, or a related field. Prior
knowledge in optimization and probability, and the ability to code (C ,C++,
AMPL, Matlab, etc.) are welcome. Good English oral and written
communication skills are also important, as well as an enthusiasm for
high-quality research.

More information about the doctoral program in the Decision Sciences
Department is available at:
http://business.gwu.edu/programs/doctoral-programs/decision-sciences/

If you are interested in this position, you should email (mlejeune@gwu.edu)
your CV and a letter of interest to Dr. Lejeune before applying for the
position.

Miguel Lejeune

Full Professor, Decision Sciences

The George Washington University

2201 G Street NW

Funger Hall

EmaiL: mlejeune@gwu.edu

Web: http://www.milejeune.org/

Phone: +1-202-994-6576

**********************************************************
*
* 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] WAOA 2017 Last call for papers

WAOA 2017 - Last call for papers

15th Workshop on Approximation and Online Algorithms
https://algo2017.ac.tuwien.ac.at/waoa/

7-8 September 2017. Vienna, Austria
=================================================================
Important Dates

Submission deadline: June 27, 2017
Notification: July 21th, 2017
Workshop: September 7-8, 2017
Camera Ready: September 25, 2017

=================================================================
Scope

Approximation and online algorithms are fundamental tools to deal with
computationally hard problems and problems in which the input is gradually
disclosed over time. Both kinds of problems arise from a large number of
applications in a variety of fields. The workshop focuses on the design
and analysis of approximation and online algorithms. It also covers
experimental methods used to design and analyze efficient approximation
and online algorithms.

WAOA 2017 will be part of ALGO 2017 (https://algo2017.ac.tuwien.ac.at/waoa/),
which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, IPEC, and PCSS.
ALGO 2017 will take place 4-8 September 2017 in Vienna, Austria.

Topics
Papers are solicited in all research areas related to approximation and
online algorithms, including, but not limited to:

- graph algorithms
- inapproximability results
- network design
- packing and covering
- paradigms for the design and analysis of
approximation and online algorithms
- parameterized complexity
- scheduling problems
- algorithmic game theory
- algorithmic trading
- coloring and partitioning
- competitive analysis
- computational advertising
- computational finance
- cuts and connectivity
- geometric problems
- mechanism design
- resource augmentation
- real-world applications

====================================================================
Publication:

Proceedings will be published in the Springer series Lecture Notes
in Computer Science after the workshop takes place.

Submission guidelines:
----------------------

Authors are invited to submit an extended abstract or full paper of at
most 12 pages, not including the references, describing original
unpublished research. Simultaneous submission to other conferences
with published proceedings is not permitted. The title page of the
submission should include the authors' full names, addresses, e-mail
addresses, and an abstract summarizing the results in roughly 100-200
words. The remainder of the submission should contain a description
of the main results, an explanation of their importance, and a clear
comparison with related work. The submission must include full proofs
of the results. Material that cannot be included in the 12 allowed
pages can be placed in an appendix, that will be read at the sole
discretion of the program committee.

Submissions should be formatted for letter-size paper with reasonable
margins and at least 11-point font.

Papers should be submitted electronically via the EasyChair submission
system at:

https://easychair.org/conferences/?conf=waoa2017

By submitting a paper the authors acknowledge that in case of acceptance
at least one of the authors must register at ALGO 2017 or WAOA 2017,
attend the conference, and present the paper.

====================================================================
Program Committee

Yossi Azar, Tel Aviv University
Danny Chen, University of Notre Dame
Jose Correa, Universidad de Chile
Khaled Elbassioni, Masdar Institute Abu Dhabi
Leah Epstein, University of Haifa
Rolf Fagerberg, University of Southern Denmark
Rudolf Fleischer (co-chair), German University of Technology in Oman
Martin Fürer, The Pennsylvania State University
Klaus Jansen, University of Kiel
Li Jian, Tsinghua University
George Karakostas, McMaster University
Monaldo Mastrolilli, IDSIA Switzerland
Nicole Megow, University of Bremen
Jiri Sgall, Charles University
Roberto Solis-Oba (co-chair), Western University
Frits Spieksma, KU Leuven
Clifford Stein, Columbia University
Denis Trystram, Grenoble Institute of Technology
Gerhard Woeginger, RWTH Aachen University
Qin Zhang, Indiana University Bloomington

**********************************************************
*
* 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] Optimization Problems Definition Contest - Call for Problems

*** Please kindly forward to those who may be interested ***

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

Optil.io Platform

Brilliant Challenges
Optimization Problems Definition Contest

FIRST CALL FOR PROBLEMS

https://www.optil.io/optilion/brilliant

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

Evaluation as a Service (EaaS), in brief, is defined as a paradigm of
keeping the evaluation data in the cloud and allowing to access them via
dedicated interfaces [1]. Optil.io [2] is an online judge platform
following EaaS concept that allows the users from all over the world to
continuously and reliably evaluate the algorithmic solutions of complex
optimization problems and to organize specific science- and
industry-inspired challenges. By hiding the test cases from the
participants and providing the homogeneous, cloud-based runtime
environment, we provide an objective method for assessment of various
algorithms, submitted by the users, solving optimization problems. *The
aim of the Brilliant Challenges contest is to collect interesting,
applicable problems that could be published on the Optil.io platform and
addressed by its users.*

Awards:
-------

Five prizes will be awarded with restricted eligibility criteria (check
the contest website):
* 1st prize (1000 EUR)
* 2nd prize (700 EUR)
* Special distinction for the most entertaining problem (700 EUR)
* Distinction for the most interesting industry-inspired problem (400 EUR)
* Distinction for the most interesting science-inspired problem (400 EUR)

How to participate:
-------------------
Follow the simple procedure described at the contest webpage
(https://www.optil.io/optilion/brilliant) and submit your problem before
15 September 2017.

Organization Committee:
-----------------------

* Dr. Szymon Wasik, Poznan University of Technology (Chief organizer)
* Prof. Jacek Blazewicz, V-ce Director of IFORS (Head of Scientific
Committee)
* Prof. Erwin Pesch, Siegen University (Member of Scientific Committee)
* Prof. Thomas Villmann, University of Applied Sciences Mittweida
(Member of Scientific Committee)
* Prof. Grzegorz Pawlak, Computing Science Professor, and Entrepreneur
(Member of Scientific Committee)
* Dr. Maciej Antczak, Poznan University of Technology (Head of Technical
Committee)

References:
-----------

[1] Hanbury, Allan, et al. "Evaluation-as-a-Service: Overview and
outlook", arXiv:1512.07454, 2015.

[2] Wasik, Szymon, et al. "Optil. io: Cloud Based Platform For Solving
Optimization Problems Using Crowdsourcing Approach", Proceedings of the
19th ACM Conference on Computer Supported Cooperative Work and Social
Computing Companion, doi:10.1145/2818052.2869098, 433-436, ACM, 2016.

--
Szymon Wąsik, Ph.D.
Laboratory of Algorithm Design and Programming Systems
Institute of Computing Science
Poznan University of Technology
Piotrowo 2, 60-965 Poznan, Poland
http://www.cs.put.poznan.pl/swasik
e-mail: szymon.wasik@cs.put.poznan.pl
tel: 0048 61 665 3032

**********************************************************
*
* 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 positions @ Ubiquitous Internet - IIT-CNR, Pisa

Several PhD positions are open @ IIT-CNR, Pisa, Italy, on the following
topics
#1: Analysis of large-scale Online Social Networks (H2020 SoBigData)
#2: Distributed data analytics for IoT (H2020 SoBigData & AUTOWARE)
#3: Social-based Network Traffic Analysis for Cybersecurity (IIT
Cybersecurity Lab)

** Hosting University: IIT-CNR has multiple agreements for joint PhD
programmes
with the University of Pisa (http://phd.dii.unipi.it/en/,
https://www.di.unipi.it/it/phd) and
the University of Florence (http://smartcomputing.unifi.it/).

** Position type: doctoral fellowship, 3 years
** Starting date: fall 2017
** Location: IIT-CNR, Pisa, Italy - http://www.iit.cnr.it/
** Supervisor: Andrea Passarella - http://cnd.iit.cnr.it/andrea/
** Salary: EUR ~1200 per month (net)
** Application deadline: continuous evaluation, up until the end of July
2017

For all positions, it will be possible (and advised) to organise one
visiting
student period abroad (typically, 6 months) during the PhD.

Position #1: Analysis of large-scale Online Social Networks
-----------------------------------------------------------
Job description
---------------
The PhD activities will be focused on BigData analytics applied to data
crawled
from Online Social Networks. Specifically, the subject of the PhD will be on
(i) collecting large-scale datasets from popular OSNs (e.g., Twitter),
and analyse
the social network structures and the patterns of interactions between
users through Big Data analytics techniques
(ii) designing new data-centric services which exploit knowledge about the
extracted social network structures.

Successful candidates will be supervised by Dr. Andrea Passarella
(http://cnd.iit.cnr.it/andrea), and will work in the framework of the
H2020 SoBigData European Project, the EC-funded H2020 Research
Infrastructure
for social Big Data analysis (http://www.sobigdata.eu/).

The PhD activities will involve interdisciplinary approaches focusing on
a mix
of (i) efficient data crawling and collection techniques, (ii)
large-scale data
analysis, (iii) knowledge extraction, (iv) design of data-centric
services in
OSN platforms.

Candidate profile
-----------------
Ideal candidates should have or about to obtain a MSc degree in Computer
Science,
Computer Engineering, Physics, Statistics, or closely related
disciplines, and a
proven track record of excellent University grades.
Preferably, the topic of the MSc thesis should have been in one of the
relevant research areas (BigData analytics, OSN analysis/programming,
Complex
network analysis). Good written and spoken communication skills in
English are
required.

Position #2: Distributed data analytics for Internet of Things
-------------------------------------------------------------------------
Job description
---------------
The expected amount of data generated by pervasive devices in IoT
environments
calls for new distributed machine learning approaches, which depart from the
conventional model of collecting all data in huge data centres where machine
learning models are used to extract knowledge. Instead, data analytics is
performed on small datasets collected by individual nodes, which then
collaborate to learn more complex models. This approach is currently
explored,
among others by Google in the Federated Learning activity
(https://research.google.com/pubs/pub44822.html). It promises to be more
scalable, and to better preserve the users' privacy, with respect to
centralised
machine learning approaches.

One PhD position is open in this area. The PhD activities
will be focused on the design and evaluation of distributed data analytics
algorithms to be implemented on collaborating sets of networked nodes.
Distributed deep learning for Internet of Things environments will be a
specific
subject of investigation.

Successful candidates will be supervised by Dr. Andrea Passarella, and the
activities will be carried out in the H2020 FoF AUTOWARE European Project.

The PhD will work on a mix of these topics:
(i) design and prototyping of distributed data analytics algorithms
for IoT;
(ii) evaluation of the performance (e.g., with respect to centralised
solutions, in
terms of accuracy and generated network traffic);
(iii) analysis of the performance bounds of the distributed analytics
algorithms

Candidate profile
-----------------
Ideal candidates should have or about to obtain a MSc in Computer Science,
Computer Engineering, Mathematics, or closely related disciplines,
and a proven track record of excellent University grades.
Preferably, the topic of the MSc thesis should be in one of the relevant
research areas
(IoT, mobile networking and computing, machine learning, BigData analytics).
Good written and spoken communication skills in English are required.

Position #3: Social-based Network Traffic Analysis for Cybersecurity
--------------------------------------------------------------------

Job description
---------------
Traditionally, network traffic monitoring tools have focused merely on
network-oriented metrics such as volume of data exchanged or top host
talkers. Recent cybersecurity attacks instead demonstrated that social
relationships have a great impact on network threats. These attacks
exploit social relationships such as a shared disk between friends or
people belonging to the same working group. To contrast cybersecurity
attacks of
this kind, novel analysis techniques need to be developed, which do not
focus
exclusively on packet-level analysis, but correlate traffic patterns
with the
properties of the nodes generating them (e.g., the same traffic pattern
might be
legitimate or not, depending on whether the communicating endpoints
belong to
the same user, to members of the same social community, or to complete
strangers).

The PhD activities will be focused on (i) learning how social relationships
influence network traffic data exchange (ii) designing new social-centric
algorithms and techniques that can be used to detect network traffic
anomalies
as well spot security infections and intrusions, with particular focus
on IoT
environments, where data must be analysed locally through decentralised
algorithms.

Successful candidates will be co-supervised by Dr. Andrea Passarella and
Dr. Luca Deri, and the activities will be carried out in the framework
of the
IIT-CNR Cybersecurity Lab.

The PhD activities will involve interdisciplinary approaches focusing on
a mix
of (i) network traffic analysis protocols and tools, (ii) large-scale
network
metrics analysis, (iii) mapping of social relationship with networks
activities,
(iv) behaviour-based network traffic modelling.

Candidate profile
-----------------
Ideal candidates should have or about to obtain a MSc in Computer Science,
Computer Engineering, or closely related disciplines, and a proven track
record
of excellent University grades. Preferably, the topic of the MSc thesis
should
be in one of the relevant research areas (IoT, network traffic analysis,
network
measurement, mobile networking and computing, social networking). Good
written
and spoken communication skills in English are required.

=================================================

Research group
--------------
The PhD students will work in the Ubiquitous Internet group of IIT-CNR
in Pisa, Italy
(http://cnd.iit.cnr.it). UI activities range over multiple topics
related to the
design and analysis of Future Internet networking and computing systems,
including data-centric networks, mobile cloud, data analytics,
online/mobile social
networks, self-organising networks, hybrid wireless/wired networking and
computing. The UI group has a strong track record of successful
activities in
European projects, from FP6 to H2020, which is reflected in the many
international collaborations in EU and USA activated by the researchers
of the
group.

Application procedure
---------------------
Applications should consist of (all documents in English):
- a complete CV, including exams taken during the University degrees
(including
the MSc final degree), with grades, and a link to the MSc. thesis
- a 1-page research statement showing motivation and understanding
of the topic of the position
- at least one contact person (2 even better) who could act as reference(s)

The applications and any request of information should be sent to:
a.passarella@iit.cnr.it, with subject, respectively:
"PhD application: Online Social Network Analysis",
"PhD application: Distributed data analytics for IoT", or
"PhD application: Social-based Network Traffic Analysis for Cybersecurity".

Applications will be continuously evaluated upon reception.
Applications will be considered until the position is filled, up until
the end of
July 2017. Multiple rounds of interviews will be organised with selected
candidates
while the positions are open. Interview will be scheduled based on the
received
applications, possibly also before the end of July 2017.

Selected candidates will have to apply for the formal public selections
to enter
one of the mentioned PhD programmes. Examinations typically take place
during
Fall (detailed will be provided to selected candidates as soon as
decided by the
Universities).

Contact point
-------------
For any additional information or clarification, please send a message to
a.passarella@iit.cnr.it

--
Andrea Passarella
--
Institute for Informatics and Telematics (IIT)
National Research Council (CNR)
Via G. Moruzzi, 1 voice: +39 050 315 3269
56124 Pisa, Italy fax: +39 050 315 2593
@/sip: a.passarella@iit.cnr.it mobile: +39 346 0082 540
========================================================================
Founding Associate EiC
Elsevier Journal on Online Social Networks and Media
http://www.journals.elsevier.com/online-social-networks-and-media/

**********************************************************
*
* 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] Assistant Professor position in Combinatorial Optimization, University of Twente

The University of Twente (The Netherlands) has an opening for a position as
assistant professor in the group Discrete Mathematics and Mathematical
Programming (4 years).

Our group consists of currently 8 permanent staff in research and teaching,
plus Postdocs and PhD students, covering a range of topics in

-Combinatorial & Mathematical Optimization,
-Design & Analysis of Algorithms,
-Algorithmic Game Theory.

We also work in different application areas such as energy, logistics,
as well as traffic networks. See also www.utwente.nl/ewi/dmmp/
Specifically, our group is engaged in a 'decentralized energy management'
initiative, where we develop mathematics and ICT to improve the efficiency
of energy and smart grid technology, matching energy supply to the
requested demand over time. See also www.utwente.nl/ctit/energy/

We look for a talented post-PhD with passion for research and teaching.
Your background should be in Mathematics, Theoretical Computer Science
or related areas. The new position is meant to strengthen the mathematical
foundations of our decentralized energy management team, so a background in
Combinatorial Optimization or Mechanism Design will help. What we offer is
an active research environment, with lots of opportunities for sparring your
new ideas with researchers with different backgrounds.

Please find the full job advertisement at
https://www.utwente.nl/en/organization/careers/vacancies/!/vacature/1049712

Feel free to contact:
Johann Hurink (j.l.hurink@utwente.nl)
Marc Uetz (m.uetz@utwente.nl)

**********************************************************
*
* 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] [CP / ICLP / SAT 2017] Call for submissions in the Doctoral Program

=====================================================?==========
CP / ICLP / SAT 2017 -- CALL FOR SUBMISSIONS IN THE DOCTORAL PROGRAM
===============================================================

Information page: http://cp2017.a4cp.org/doctoral_program/

Updates
-----------

FINANCIAL ASSISTANCE AVAILABLE: Thanks to the generosity of the AI
Journal, we will be able to sponsor accommodation and registration fees for up
to 20 students in the Doctoral Program. See the Doctoral Program website for \
details.

The Doctoral Program
-----------------------------

This year the co-located CP 2017, ICLP 2017 and SAT 2017 conferences are holding
a joint Doctoral Program (DP). The DP is open to all students doing research on
constraints, satisfiability or logic programming, including students that
participated in previous DPs. It is a place where you can meet other student
researchers, discuss your ongoing work in a relaxed atmosphere, as well as
getting some mentoring from an experienced researcher in the field.

You can participate by submitting a paper about your ongoing research, or just
the abstract if you have a paper accepted at either of the main conferences; see
below for detailed instructions.

The program is a full-day event at the conference and includes presentations of
the papers and mentoring by a senior researcher who will see your talk and and
spend some time to discuss with you during the conference, as well as a nice
(and free) dinner at the end of the day.

More information is available at http://cp2017.a4cp.org/doctoral_program/

Important dates
---------------------

- Submission Deadline: June 19, 2017
- Doctoral Program: August 28, 2017 in Melbourne (as part of CP/ICLP/SAT)?

Dr Tommaso Urli

Researcher | Optimisation Platforms

DATA61 | CSIRO

E tommaso.urli@data61.csiro.au<mailto:tommaso.urli@data61.csiro.au> T +61 2 6218 3862 M +61 403 464 731

Tower A Level 3, 7 London Circuit, Canberra ACT 2601

www.data61.csiro.au

CSIRO's Digital Productivity business unit and NICTA have joined forces to create digital powerhouse Data61

[Data61 | CSIRO logo]
**********************************************************
*
* 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] Postdoctoral Research Fellow in Computer Science

Hello,

The University of Nottingham Ningbo China is currently recruiting Postdoctoral Research Fellow in Computer Science. It will be much appreciated if you can help forward this email to suitable candidates.

Postdoctoral Research Fellow in Computer Science

Reference: AD17046
Closing Date: Open till filled
Contract Status: Full Time, fixed-term for 3 years
Vacancy: 2
Salary & Benefits: RMB208,000- RMB260,000 per annum before all deductions, depending on qualifications and experience
Location: Ningbo China

Job Outline
Join a unique British University in China. The University of Nottingham Ningbo China (UNNC) was the first Sino-foreign University to open its doors in China. This award winning campus offering a UK style education has grown to establish a student body of over 7,000 in just 12 years.
Applications are invited for the above posts in the Ningbo Nottingham International Academy for Marine Economy and Technology within the Faculty of Science & Engineering based at the University of Nottingham Ningbo, China. The School of Computer Science at UNNC is part of the School of Computer Science at the University of Nottingham, UK, which is ranked among the top UK Computer Science departments (http://www.nottingham.ac.uk/computerscience/). The School at UNNC offers a full range of undergraduate and postgraduate computer science programmes. Supported by major research grants, the School of Computer Science at UNNC is developing strong research in areas including Big Data and Visual Analytics, Computational Intelligence, Software Implementation and Testing, and Visual Information Processing. Computer Science at UNNC is a designated strategic area for growth in the University's Strategy 2020 Plan.
Applications are invited for 2 prestigious Research Fellowships in our Faculty of Science and Engineering to establish a new Centre of Excellence in the application of optimization and datamining as relevant to the Ningbo Nottingham International Academy for Marine Economy and Technology. Candidates will work as a member of a growing team to establish state of the art laboratory facilities, to develop technology transfer opportunities with local and international companies and to supervise and carry out innovative research.
Main Duties and Responsibilities
* Perform fundamental computer science research for the development of new algorithms and systems as relevant to the marine economy and related areas;
* Work with clients to optimize models and processes for a particular application especially in the transport industries;
* Supervise undergraduate and postgraduate students and provide training in research and laboratory methodologies and protocols;
* Manage projects to agreed schedules and outputs;
* Develop research proposals, project reports and research publications;
* Present proposals to clients and funding agencies;
* Disseminate results at scientific meetings and sponsor visits;
* Work with IP specialists to protect and exploit research discoveries;
* Work proactively to create new opportunities for business growth through new research and training partnerships.

How to Apply

Please send job application with the following documents before the closing date:

1. UNNC Application Form (please download from here);

http://www.nottingham.edu.cn/en/about/documents/applicationform.doc

2. Cover Letter;

3. CV.

Please kindly note that all documents should be completed in English and in Word/ PDF format.

Late or incomplete application will not be considered to be shortlisted.

Please send application and enquiries to job@nottingham.edu.cn<mailto:job@nottingham.edu.cn>.

The closing date for an initial review of applicants will be Friday 2 July 2017. The post will remain open until filled.

For more details please access: http://www.nottingham.edu.cn/en/hr/jobs/current/ad17046.aspx
**********************************************************
*
* 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] UNSW Scientia PhD Scholarship in Smart Mobility Methodologies for Optimizing Transport Networks

The UNSW Scientia PhD Scholarship Scheme (package of A$50,000 per annum)

Topic - Smart Mobility Methodologies for Optimizing Transport Networks

With increases in communication technology and wider availability of diverse real-time data, the behaviour of travellers is fundamentally shifting as individuals are more open to shared mobility, journey adaptation, and trip-based pricing. Further, the tools available to regional planners are growing exponentially in terms of predictive capability as well as complexity.

The successful applicant will develop optimization-based mathematical theory and models for improving transport system congestion and reliability, as well as practical and efficient solution methods and tools. They will deliver research advances on system-wide transport descriptors, such as dynamic transport network equilibria and the mechanisms governing traveller behaviour, and develop methods to improve the operation of the transport network.

Supervisory team
----------------
* Prof Travis Waller - School of Civil and Environmental Engineering
* Dr Lauren Gardner - School of Civil and Environmental Engineering
* Prof Gary Froyland - School of Mathematics and Statistics

After consulting the eligibility requirements (see below), an expression of interest may be lodged at http://www.2025.unsw.edu.au/apply/scientia-phd-scholarships/smart-mobility-methodologies-optimizing-transport-networks

**Closes 21 July 2017**

Further details
===============

The UNSW Scientia PhD Scholarship Scheme aims to attract the best and brightest people into strategic research areas and provide them with an enhanced culture of research excellence, mentoring, career development, leadership and community. The Scheme provides 4 years of funding for the candidate to complete a PhD at UNSW. The awards will be made across all Faculties in areas of identified research strengths and the scheme will ensure that candidates reflect the disciplinary, gender and cultural diversity of UNSW. In contrast to our other prestigious UNSW scholarship schemes, the UNSW Scientia scheme is targeted and applicants must apply to a specific research area with an identified supervisory team.

Distinctiveness - The key distinctive features of the UNSW Scientia PhD Scholarship Scheme include:

1. Prestigious Scholarship Package - UNSW Scientia PhD scholars are awarded a scholarship package of $50,000 per annum, comprising a tax-free living allowance of $40,000 per annum for 4 years, and a support package of up to $10,000 per annum to provide financial support for career development activities
2. Outstanding supervision combined with exceptional research environments - all successful candidates will be supervised by teams of UNSW's best researchers aligned with UNSW research strengths, who will be selected on the basis of their demonstrated capacity in excellence in research and high quality supervision, plus their commitment to developing and mentoring PhD scholars
3. Engagement - all successful candidates will have a strong commitment to making a difference in the world with demonstrated potential for contributing to the learning and teaching excellence, social engagement and/or global impact pillars of the 2025 strategy
4. Career and Development - all successful candidates will be provided with career coaching and development throughout the 4 years of candidature, and encouraged to engage with knowledge exchange activities.

Eligibility
===========
1. The scheme is open to domestic and international candidates
2. To be able to apply to the scheme, potential applicants must be nominated by a team of approved UNSW supervisors
3. Due to the structured program, only new PhD candidates qualifying for direct entry to the PhD will be eligible for entry into the scheme
4. The minimum requirement for admission to the Scheme is:
5. an appropriate four year degree of Bachelor with at least upper second class Honours, or
6. a completed Masters by Research including a substantial research component, or
7. qualifications at a level considered equivalent to either of the above
8. All nominees must be eligible for admission to the PhD program as described in the Admission to Higher Degree Research Programs Procedure
9. Successful candidates should be able to meet all of the selection criteria (listed below) at the highest level
10. All successful applicants must be located on a UNSW campus for a minimum of 2 years and this must include the first year of the program.

--
Professor Gary Froyland
School of Mathematics and Statistics
University of New South Wales
Sydney NSW 2052, Australia

I: www.maths.unsw.edu.au/~froyland
E: g.froyland@unsw.edu.au<mailto:g.froyland@unsw.edu.au>
T: +61 2 9385 7050
F: +61 2 9385 7123
**********************************************************
*
* 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 for AutoML workshop at ECML/PKDD-2017

CALL FOR PAPERS

The ECML-PKDD 2017 Workshop on Automatic Machine Learning (AutoML)
Collocated with ECML-PKDD in Skopje, Macedonia, September 22, 2017
Web: http://ecmlpkdd2017.automl.org
Email: ecmlpkdd2017@automl.org

----------------------------------------------------------------
Important Dates:
Submission deadline: 10 July, 2017, 11:59pm UTC-12 (July 10 anywhere in
the world)
Notification: 30 July, 2017
----------------------------------------------------------------

AutoML: Automatic selection, configuration and composition of machine
learning algorithms

This workshop will provide a platform for discussing recent developments in
the areas of meta-learning, algorithm selection and configuration, which
arise in many diverse domains and are increasingly relevant today.
Researchers and practitioners from all areas of science and technology face
a large choice of parameterized machine learning algorithms, with little
guidance as to which techniques to use in a given application context.
Moreover, data mining challenges frequently remind us that algorithm
selection and configuration are crucial in order to achieve cutting-edge
performance, and drive industrial applications. Meta-learning leverages
knowledge of past algorithm applications to select the best techniques for
future applications, and offers effective techniques that are superior to
humans both in terms of the end result and especially in the time required
to achieve it. In this workshop, we will discuss different ways of
exploiting meta-learning techniques to identify the potentially best
algorithm(s) for a new task, based on meta-level information, including
prior experiments on both past datasets and the current one. Many
contemporary problems also require the use of complex workflows that
consist of several processes or operations. Constructing such complex
workflows requires extensive expertise, and could be greatly facilitated by
leveraging planning, meta-learning and intelligent system design. This task
is inherently interdisciplinary, as it builds on expertise in various areas
of AI.

Main research areas of relevance to this workshop include, but are not
limited to:
- Algorithm / model selection and configuration
- Meta-learning and exploitation of meta-knowledge
- Hyperparameter optimization
- Automatic generation and evaluation of learning processes / workflows
- Representation learning and automatic feature extraction / construction
- Automatic feature coding / transformation
- Automatic detection and handling skewed data or missing values
- Automatic acquisition of new data (active learning, experimental design)
- Usage of planners in the construction of workflows
- Reinforcement learning for parameter control & algorithm design
- Representation of learning goals and states in learning
- Control and coordination of learning processes
- Meta-reasoning
- Layered learning
- Multi-task and transfer learning
- Learning to learn
- Intelligent experiment design

Co-chairs: Frank Hutter, Holger Hoos, Pavel Brazdil and Joaquin Vanschoren

We welcome standard submissions of up to 6 pages (not including references)
in ECML-PKDD format, as well as longer papers of up to 15 pages (not
including references).
For further details, please see the submission page; the submission
deadline is July 10th, 2017.
All accepted papers will be presented as posters and very short poster
spotlights; the best paper(s) will be selected for an oral presentation.
At least one author of each accepted paper should be registered for the
main conference.
**********************************************************
*
* 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] 12 Open Phd-Positions in Research Training Group UnRAVeL at RWTH Aachen University

[Apologies for multiple postings.]

=======================================================================
12 Research Assistants/Associates

in the post graduate program
"Uncertainty and Randomness in
Algorithms, Verification and Logic"

at RWTH Aachen University, Aachen, Germany
=======================================================================

Context.
The RWTH Aachen University is looking for enthusiastic and highly
qualified doctoral researchers. 12 positions are available within the
interdisciplinary Research Training Group (RTG) UnRAVeL founded by
Deutsche Forschungsgemeinschaft (DFG). The key emphasis of an RTG is on
the qualification of doctoral researchers with a focused research
program and a structured training strategy. The RTG UnRAVeL aims to
significantly advance probabilistic modelling and analysis for
uncertainty by developing new theories, algorithms, and tool-supported
verification techniques, and to apply them to core problems from
security (e.g., probabilistic protocols), planning (robotics and railway
engineering), and safety and performance analysis (railway systems). To
tackle these research challenges, theoretical computer scientists from
computer-aided verification, logic and games, algorithms and complexity,
together with experts from management science (robust optimization),
applied computer science (robotics and security), and railway
engineering intensively cooperate within the RTG UnRAVeL.

Required profile.
Candidates must have (or soon obtain) a master degree in Computer
Science, Mathematics or related area and have completed their studies
with excellent grades. You should have interest in performing original,
highly competitive scientific research, publishing your results in top
conferences and scientific journals. Self-motivation and the ability to
work both independently and as a team player in local and international
research groups are expected. Fluency in English is required;
proficiency in German is helpful but not compulsory.

How to apply?
Your written application should contain:

- a curriculum vitae
- a transcript of records (list of courses and grades)
- a cover letter including a statement of interest in (some of) the
RTG topics that can be found on our web-site (see below), and
- a recommendation letter e.g., by your master thesis supervisor(s).

All documents should be formatted as a single pdf-file. You should send
your application ultimately by ** July 14, 2017 (AoE) ** to the e-mail
address: unravel-appl@cs.rwth-aachen.de

What do we offer?
We offer a stimulating international research environment, the
possibility to participate in highly competitive and interdisciplinary
research and the opportunity to involve students in your research
through project work. Doctoral researchers have a status as employee
with a salary according to the German federal employee scale TV-L E13;
the exact salary is subject to your family situation. The duration of
the positions is three years. RWTH Aachen University offers excellent
facilities for professional and personal development. Starting date of
the positions: as soon as possible from October 1, 2017 on.

More information about the RTG UnRAVeL can be found at:

https://moves.rwth-aachen.de/research/projects/unravel/

Enquiries can be directed to Prof. Joost-Pieter Katoen (e-mail:
katoen@cs.rwth-aachen.de).

RWTH Aachen University is certified as a "Family-Friendly University".
We particularly welcome and encourage applications from women, disabled
persons and ethnic minority groups, recognizing they are
underrepresented across RWTH Aachen University. The principles of fair
and open competition apply and appointments will be made on merit.
_______________________________________________
Unravel mailing list
Unravel@lists.rwth-aachen.de
https://mailman.rwth-aachen.de/mailman/listinfo/unravel?
**********************************************************
*
* 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] [IEEE-SSCI 2017] CFP special session on Operations Research Techniques for Modeling and Optimizing Logistics and Production Systems

[Please accept our apologies if you receive multiple copies of this CFP]

Dear colleagues,

As part of the Symposium Series on Computational Intelligence (SIEEE-SSCI
2017) in *Hawaii, USA* during *November 27th -December 1st 2017*, (
http://www.ele.uri.edu/ieee-ssci2017/index.html), we are organizing a
special session on *Operations Research Techniques for Modeling and
Optimizing Logistics and Production Systems*. We have the pleasure to
invite you to participate in it.

*Objectives and topics*

This special session deals with optimization challenges of modern logistics
and production systems. Original methods may be proposed based on
intelligent computing, modeling and optimization techniques to provide
effective and efficient solution methods for complex optimization problems.
It aims specifically at the most recent developments of Operations Research
models and other applications of intelligent computing techniques used for
scheduling and optimization in a variety of production and logistics
systems.

Topics of interest include, but are not limited to:

o Simulation and multi-agent systems for performance evaluation

o Exact algorithms (Brand and Bounds, Dynamic programming …)

o Heuristic and metaheuristic methods applied to operations research
models

o Multi-criteria decision making for operations and logistics

o Other related topics

Important dates

Submission of papers: July 2, 2017
Notification of acceptance: August 27, 2017
Camera-ready papers: September 24, 2017
Registration & payment: September 24, 2017

Submission

For author guidelines, please refer to http://www.ele.uri.edu/ieee-
ssci2017/PaperSubmission.htm

Best regards,

Taha Arbaoui.

___

Université de Technologie de Troyes <http://www.utt.fr/fr/index.html>

12 rue Marie Curie - CS 42060 - 10004 Troyes, France

Tél. : (33) 03 25 71 76 00 | Fax : (33) 03 25 71 76 76
**********************************************************
*
* 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/
*
**********************************************************