Thursday, October 19, 2017

[DMANET] PhD position in Algorithms & Optimisation (Univ. of Liverpool, UK)

PhD position in Algorithms & Optimisation (Univ. of Liverpool, UK)


A fully funded PhD position:

A fully funded 3-year PhD position is available at the Computer Science Department of the University of Liverpool, UK.
The Department is the world-leading research centre in Computer Science with a particular strength in theoretical computer science and artificial intelligence. The department offers a strong research environment, spanning a wide range of research topics such as complexity theory and algorithms, distributed computing and computer networks, verification and formal methods, automata and computability theory, computational game theory, data mining, machine learning and natural language processing.

The successful candidate will do research in the areas of algorithms, optimisation and machine learning, designing new approaches and their analyses for simulation-based planning techniques with applications to online retail. This project will be in cooperation with Shop Direct, the second largest retailer in the UK. The candidate will be supervised by Professor Piotr Krysta ( https://www.csc.liv.ac.uk/~piotr/ ) and will become a member of the Algorithms and Optimisation research group at the Department of Computer Science: https://intranet.csc.liv.ac.uk/research/optimisation/people.html.

This PhD project will study a Loan Pricing Problem (LPP), in which a customer browses pages of an online retailer and is interested to purchase a new product. The retailer offers the customer payment options: a list of appropriately priced loans. These offers are based on the customer's past history, and are carefully chosen and personalised, to maximise the customer's lifetime value. How can we model and efficiently solve this problem based on the customer's history? LPP can be approached by simulation-based planning techniques via Markov decision processes. We will use our expertise in this area and in combinatorial pricing and the design and analysis of algorithms to build a learning model for LPP based on data from Shop Direct. Our goal is to develop a novel framework of meta-algorithms which would automatically generate efficient algorithms to solve LPP based on the historic data. We will use both experimental and theoretical analysis of the performance of our algorithms. Our toolkit will involve state of the art techniques in simulation-based planning, machine learning, approximation algorithms and optimisation.

This PhD project is an exciting opportunity to delve into an important and timely research area on a border of algorithms, optimisation and data analysis with a renowned team of researchers and a modern high-tech internet retailer Shop Direct based in Liverpool. The project will help expose the PhD candidate to contemporary theoretical developments in these research areas as well as their direct deployment in industrial practice. A PhD within this project will prepare the candidate to undertake academic research career and industrial research and development IT career.

The position will be based in University of Liverpool's Department of Computer Science and supervised by Professor Piotr Krysta, and co-supervised by Dr. Rahul Savani (Economics and Computation group) and Dr. Frans Oliehoek (Data Mining and Machine Learning group), with a close cooperation with Shop Direct's Data Science Department.

Prior Experience:
We look for ambitious and highly motivated candidates with good first degree (BSc or MSc) in Computer Science, Mathematics or closely related subject, and with a strong interest and background in algorithms and optimisation, and programming skills. A mathematically oriented mind is desired. The applicant must have good communication skills, both verbal and in writing (English), be self-motivated and helpful team member.

How to Apply:
Applications should be made formally by following the University of Liverpool's standard process. Details can be found
here: https://www.liverpool.ac.uk/computer-science/postgraduate/phdstudy/applications/ Applications should list
Prof. Piotr Krysta as the potential supervisor and choose the option "School funded PhD" when asked how you will
fund the PhD. Applications must contain a cover letter, a curriculum vitae or resume, copies of undergraduate and
graduate transcripts, a 1-2 page research statement describing how the applicant's qualifications and research
interests would fit the project, a copy of the applicant's bachelor or master's thesis and the names and contact
information of academic references.

Funding Notes:
This PhD studentship will be for 3 years at GBP 20,000 (tax-free) per year.
a) If UK/EU this will relate to Full Fees & Maintenance (current fee £4,195)
b) If overseas/international applicants this will relate to Full Fee and a small maintenance (current fee is £18,900).

Applications are admitted until 24 November 2017, or until a suitable candidate is found thereafter. The selected candidate can start this position immediately, but the latest starting date for this fully-funded PhD position is 1 March 2018. Please send your informal inquiries to Prof. Piotr Krysta (pkrysta@liverpool.ac.uk).

**********************************************************
*
* 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] Fully Funded Ph.D. or PostDoc position in structural graph theory at Technical University Berlin — deadline approaching

We invite applications for a research position in the area of structural or algorithmic graph theory at the research group of Prof. Stephan Kreutzer at the Technical University Berlin. Application deadline is 21 October 2017 but late applications or partial applications augmented later may be accepted if they are completed no later than 5 November 2017.


The position is open to a Post Doctoral Researcher or a Ph.D. student. Is is funded through the ERC Consolidator Grant "DISTRUCT - Structure Theory for Directed Graphs", see https://erc.europa.eu/projects-and-results/erc-funded-projects/distruct for project details. The salary grade is according to TV-L 13.


The overall goal of the project is to develop a structure theory for directed graphs and corresponding algorithmic consequences in the spirit of the graph minor project by Robertson and Seymour for undirected graphs. Substantial progress especially on the structural part has been made already and we are looking for a candidate who can get involved in the project, especially developing the algorithmic applications for digraphs with excluded clique minors.


Applicants should therefore have a solid background in theoretical

computer science/discrete mathematics and graph theory, preferably structural and algorithmic graph theory. Knowledge of graphs embedded on a surface, algorithms on bounded genus graph classes especially for disjoint paths are especially useful. Applications also should have a deep interested in structure theory and directed graphs. But we also invite applications for candidates working in related areas such as parameterized graph algorithms etc.


The PI of the project is Prof. Stephan Kreutzer, the head of the Logic and Semantics Research Group at the Computer Science Department of the Technical University Berlin.


The main research focus of the group is algorithmic graph structure

theory and research combining logical techniques and graph theory.

In total the group currently consist of nine full time researchers and will shortly grow to between 10 to 12.



Successful candidates will therefore be embedded into a larger group

working on related topics which provides a lively and active

research environment. In addition, the TU Berlin hosts several other groups in related areas, for instance the group of Prof. Niedermeier working mostly on

parameterized algorithms as well as several related groups in the

mathematics department. Furthermore, the research group actively

participates in the Berlin Mathematical School and the Berlin Graduate

School "Methods for Discrete Structures" which add to the lively

research environment at the TU Berlin.



The successful candidate will receive a salary according to

TV-L 13, the standard rate for research assistants at German

universities. The project has sufficient travel money available

to support conference and workshop attendance as well as research

visits to other groups internationally.



Applications containing at least a cover letter should be submitted by 21 October 2017. The application should be augmented by a cv including a publication list and a research statement. Missing pieces can be submitted later upon request. Late applications will be considered in exceptional circumstances.


Applications should be submitted electronically to

stephan.kreutzer@tu-berlin.de<mailto:stephan.kreutzer@tu-berlin.de>. For further information see http://logic.las.tu-berlin.de/static/IV-347-17_eng_Wdh.pdf or contact


Stephan Kreutzer

Technische Universität Berlin

Ernst-Reuter Platz 7

10587 Berlin

Germany


Tel: +49 30 314 29088

EMail: stephan.kreutzer@tu-berlin.de





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

[DMANET] Travel Grants (STSMs) on Kidney Exchange Programmes

There are multiple travel grants available from the COST Action on Kidney Exchange Programmes (ENCKEP). Under this scheme you can apply for a grant for a "Short-Term Scientific Mission" (STSM), i.e., a research visit to another country, related to kidney exchange programmes. This includes work on optimisation and the mathematical aspects of kidney exchange matching, as well as any other research to do with kidney exchange.

This is mostly intended for researchers based in Europe visiting institutions in other European countries, but there are some exceptions. For full details, see:
http://www.enckep-cost.eu/page/scientific-missions/guidelines

We especially encourage PhD students and early stage researchers to apply.

The minimum length is 5 days, and most often they are for a week or so; however, much longer visits are also possible.

The current application deadline is 12th November. You can apply for trips starting between 11th December 2017, and finishing by mid-April 2018.

Please read carefully the application guide http://www.cost.eu/STSM_userguide
and the guidelines given on the website (especially the page called Application Procedure) before applying.

We'd be grateful if you could forward this email to people who might be interested.

On behalf of COST Action CA15210,

Nic Wilson (STSM Chair)
David Manlove (Action Vice Chair)
Joris van de Klundert (Action Chair)

ENCKEP websites:
http://www.cost.eu/COST_Actions/ca/CA15210
http://www.enckep-cost.eu/

**********************************************************
*
* 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] First announcement: Symposium on Discrete Mathematics 2018

First announcement:

Symposium on Discrete Mathematics 2018
TU Graz, June 15-16, 2018

The Symposium on Discrete Mathematics, the biannual meeting of the
Discrete Mathematics Section of the DMV (German Mathematical Society),
will take place on June 15-16 at Graz University of Technology.

Main speakers:
Laszlo Babai (University of Chicago)
Amin Coja-Oghlan (Goethe University Frankfurt)
Ioannis Emiris (University of Athens)
Penny Haxell (University of Waterloo)
Martin Skutella (TU Berlin)

On the occasion of the symposium, the Richard-Rado-Prize 2018 for a
dissertation in Discrete Mathematics will be awarded. The prize is
funded by a donation of Springer-Verlag.

Executive committee of the Discrete Mathematics Section:
Mihyun Kang, Volker Kaibel, Tibor Szabo, Thorsten Theobald

Local organization:
Mihyun Kang, Jochen Resch (IT support), Sandra Wissler
(administrative support)

For more information see https://www.math.tugraz.at/comb/sdm2018/
**********************************************************
*
* 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] [Extended Deadline] INCOM 2018 Final Call for Papers Special Session "Modeling and optimization approaches for the next generation manufacturing systems"

[Apologies for cross posting]

*Extended Deadline: 15th November 2017 (no further extensions!)*

*Session "Modeling and optimization approaches for the next generation
manufacturing systems"*

With the emergence of the new manufacturing revolution, often called
Industry 4.0, new manufacturing organizations/configurations, enhanced with
innovative technologies such as advanced robotics, Internet of Things
(IoT), data analytics ... are being used. Thus, companies and factories,
faced with increasing competitiveness, are working on the development of
new algorithms and systems to cope with the increasing practice of
autonomous machines and the demand load and environmental constraints.
Moreover,
they consistently deal with a dynamic and agile environment, characterized
by a considerable amount of data, a changing manufacturing process and
uncertain inputs.

*Topics*
In the way to investigate issues and solutions with regards to the previous
report, this session is devoted to the novel intelligent algorithms and
systems tackling the next generation manufacturing problems such as:
online scheduling, simulation-optimization framework, data-driven
optimization, etc. We aim that this session gathers researchers
andpractitioners working on promising research directions and recent
advances
in these topics. The scope of the session includes, but is not limited to
the
following topics:

- New algorithms for online scheduling problems
- Intelligent manufacturing systems
- Simulation-optimization models for manufacturing systems
- Virtual-based simulation models for optimizing manufacturing system
- evolution
- New algorithms for self-optimization of distributed manufacturing
- system
- Advanced evolutionary algorithms for effective manufacturing
- Robust optimization for scheduling and production planning under
- uncertainty
- Efficient energy optimization in manufacturing and planning
- Intelligent systems for warehouse management
- Data-driven optimization for manufacturing

*Keywords*: industrie 4.0, intelligent systems, data-driven framework,
simulation

*Submission and deadlines:*
All manuscripts must be electronically submitted through the PaperPlaza
Conference Manuscript Management System. Guidelines for the preparation of
manuscripts are provided on the IFAC website. Authors are advised to read
PaperCept's Getting Started Manual for Authors. Only PDF files compliant
with the IFAC Publications All papers will be accepted with the
understanding that the authors will present them at the INCOM. At least one
author of every accepted paper will be required to register for INCOM
before uploading the final version.
Authors are invited to submit draft papers reporting original research of
theoretical or applied nature. Final manuscripts are limited to six (6)
double column pages. Accepted papers exceeding the normal length may be
included in the proceedings upon payment of over-length page charges for
each page in excess of six pages, up to a maximum of two additional pages.
Authors are invited to use the Invited session identification code (268a1)
when submitting their manuscript.

*Paper submission closure*: 15th November 2017
*Paper notification of acceptance*: 12th January 2018
*Camera-ready version*: 16th February 2018

**********************************************************
*
* 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] Postdoc positions in algorithms and lower bounds at Bristol University, UK

Two 1 year postdoc positions in algorithms and lower bounds at Bristol
University, UK.

Start date: Mutually agreed.
End date: 31/12/2018

Salary: 36612 - 41212 UK pounds.

Please contact Raphael Clifford (raphael.clifford@bristol.ac.uk)
directly for more details of these posts.

Based in the Department of Computer Science you will carry out
research within a project concerned with the development of new
algorithms as well as provable time and space lower bounds. Our
current work focuses on algorithms and data structures for dynamically
changing data however we also have a broader interest in other aspects
of algorithms/theory research.

The post will require a high level of expertise in areas which may
include but not be limited to data structures/algorithms, discrete
probability, discrete mathematics and combinatorics.

Candidates with interests in both lower bounds and algorithms or only
one of the two are strongly encouraged to apply.
**********************************************************
*
* 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/
*
**********************************************************

Re: [DMANET] Max Planck Postdoctoral Fellowship for Excellent Women in Computer Science

*

* Max Planck Postdoctoral Fellowship for Excellent Women in Computer
Science *


* Max-Planck Institute for Informatics, Saarbruecken, Germany *


Every second year the Max Planck Institute for Informatics awards the
Lise Meitner Award Fellowship. This postdoctoral grant supports
excellent female computer scientists in their careers, giving them the
opportunity to develop their scientific ideas without exertion of
influence. It consists of a two-year tax-free research fellowship and
business expenses.


Fellows will be chosen based on the strength of their academic
background and research credentials. Applications should include a CV,
cover letter, publication list, short research plan (one page is
enough), and two references. This grant is according to the fellowship
rules of the Max Planck Society; it usually amounts to 3,000 Euro/month
and is completed by compensation for business expenses of 10,000 Euro/year.


Application details can be found under the following link:


https://www.mpi-inf.mpg.de/news/employment/lise-meitner-award-fellowship/

Web announcement:

Max Planck Postdoctoral Fellowship for Excellent Women in Computer Science


Every second year the Max Planck Institute for Informatics awards the
Lise Meitner Award Fellowship. This postdoctoral grant supports
excellent female computer scientists in their careers, giving them the
opportunity to develop their scientific ideas without exertion of
influence. It consists of a two-year tax-free research fellowship and
business expenses.


Fellows will be chosen based on the strength of their academic
background and research credentials. Applications should include a CV,
cover letter, publication list, short research plan (one page is
enough), and two references. This grant is according to the fellowship
rules of the Max Planck Society; it usually amounts to 3,000 Euro/month
and is completed by compensation for business expenses of 10,000
Euro/year. The deadline for the application is 01.12.2017.

For more information, please contact meitner-award@mpi-inf.mpg.de.


About the Max Planck Institute for Informatics


The Max Planck Society is Germany's largest society for fundamental
research with more than 30 Nobel Prize winners, including Prof.
Christiane Nüsslein-Volhard - one of the few female Nobel Laureates. The
research institutes of the Max Planck Society are nationally and
internationally renowned as Centers of Excellence in foundational research.


The Max Planck Institute (MPI) for lnformatics is devoted to
cutting-edge research in computer science and technology with a focus on
algorithms and their applications in a broad sense. Its research ranges
from fundamental topics (algorithms and complexity, automation of logic)
to a variety of application domains (computer graphics and vision,
geometric computation, program verification, databases and information
systems, and computational biology). The MPI for lnformatics is located
on the campus of Saarland University in Saarbrücken, Germany.


The Saarland University campus is also home to the Max Planck Institute
for Software Systems, the German Research Institute for Artificial
Intelligence, the Center for IT-Security, Privacy, and Accountabilty
(CISPA), the Cluster of Excellence on Multimodal Computing and
Interaction, the Center for Bioinformatics, and the Graduate School of
Computer Science. These institutions cooperate closely and comprise a
total of more than 300 researchers in computer science. The institute
collaborates with several of the major research institutions in Europe
and the United States and has high international visibility.


The MPI for lnformatics strives to provide a family-friendly work
environment, with day care opportunities for smaller children and other
means of support for working mothers.


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

[DMANET] Call for Participation: SOFSEM 2018, 44th Int Conference on Theory and Practice of Computer Science, Krems a/d Donau (Austria), Jan 29 - Febr 2, 2018

-- 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

-- CALL FOR PARTICIPATION --

We cordially invite you to participate in SOFSEM 2018, the annual winter
conference devoted to the latest developments in the foundations of computer
science, software engineering, and data and knowledge-based systems. SOFSEM
is well-known as the highly interactive and inspiring, international meeting
place for active researchers and professionals in computer science.

Early registration deadline:
November 24, 2017
http://sofsem2018.ocg.at/registration.html

HIGHLIGHTS

- Seven invited speakers on current research:
Manfred Broy (TU Munchen and Bavarian Center for Digitization)
Michel Chaudron (Chalmers and Gothenburg University)
Thomas Eiter (TU Vienna),
Georg Gottlob (Oxford University)
Monika Henzinger (University of Vienna)
Yannis Manolopoulos (Aristotle University of Thessaloniki)
Danny Weyns (Catholic University Leuven)

- A rich program of accepted papers:
Preliminary program: http://sofsem2018.ocg.at
Proceedings: in the Springer Series Lecture Notes in Computer Science.

- Student Research Forum:
The Forum gives PhD students the opportunity to present their research
and receive feedback on their projects. The forum is embedded in the
main program, see http://sofsem2018.ocg.at

VENUE AND REGISTRATION
SOFSEM 2018 is held at the Danube University in Krems, a colorful historic
town along the Danube in the proximity of Vienna (Austria). We cordially
invite you to register at: http://sofsem2018.ocg.at/registration.html

For hotels and travel information, see http://sofsem2018.ocg.at/travel.html
Reduced rates for some hotels gradually expire until November 30, 2017.

PROGRAM CHAIRS
General chair:
- A Min Tjoa (TU Wien, Austria)
Chairs Foundations of Computer Science:
- Jan van Leeuwen (Utrecht University, The Netherlands)
- Jiří Wiedermann (Academy of Sciences, Prague, Czech Republic)
Chair Software Engineering: Methods, Tools, Applications:
- Stefan Biffl (TU Wien, Austria)
Chair Data, Information and Knowledge Engineering:
- Ladjel Bellatreche (ISAE-ENSMA, France)
Chair Student Research Forum:
- Roman Špánek (Technical University of Liberec, Czech Republic)

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

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

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

Wednesday, October 18, 2017

[DMANET] [Deadline approaching] XIII Summer School in Discrete Mathematics. Valparaiso, Chile

------------------------------------------------------------
---------------------------------------
XIII Summer School in Discrete Mathematics. Valparaiso, Chile
(XIII Escuela de Verano en Matemáticas Discretas)
http://eventos.cmm.uchile.cl/discretas2018/
Dates: January 8-12, 2018.
Application deadline: October 27
------------------------------------------------------------
---------------------------------------

The school is aimed to students in mathematics, sciences and engineering
interested in algorithms, computer science, combinatorics, optimization,
games, and their applications. The courses are oriented towards graduate and
advance undergraduate students.

------------------------------------------------------------
--------------------------------------
Place: Instituto de Sistemas Complejos de Valparaiso (http://www.iscv.cl/),
Valparaiso, Chile.
------------------------------------------------------------
--------------------------------------

Courses:

Penny Haxell, University of Waterloo,
"Edge colouring multigraphs"

Kurt Mehlhorn, Max-Planck-Institut für Informatik,
"Two Topics in Discrete Algorithms: Certifying Algorithms and Slime Mold
Computations."

Rotem Oshman, Tel-Aviv University,
"CONGEST Algorithms and Lower Bounds."

------------------------------------------------------------
--------------------------------------
Application deadline: October 27.
The accepted students will receive financial aid enough to cover local
expenses in Valparaiso. More info at
http://eventos.cmm.uchile.cl/discretas2018/postulaciones/
------------------------------------------------------------
--------------------------------------


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

[DMANET] Special Issue on Parallel and Distributed Data Mining

Special Issue on Parallel and Distributed Data Mining
Information Sciences, Elsevier


The sheer volume of new data, which is being generated at an increasingly fast pace, has already produced an anticipated data deluge that is difficult to challenge. We are in the presence of an overwhelming vast quantity of data, owing to how easy is to produce or derive digital data. Even the storage of this massive amount of data is becoming a highly demanding task, outpacing the current development of hardware and software infrastructure. Nonetheless, this effort must be undertaken now for the preservation, organization and long-term maintenance of these precious data. However, the collected data is useless without our ability fully understand and make use of it. Therefore, we need new algorithms to address this challenge.

Data mining techniques and algorithms to process huge amount of data in order to extract useful and interesting information have become popular in many different contexts. Algorithms are required to make sense of data automatically and in efficient ways. Nonetheless, even though sequential computer systems performance is improving, they are not suitable to keep up with the increase in the demand for data mining applications and the data size. Moreover, the main memory of sequential systems may not be enough to hold all the data related to current applications.

This Special Issue takes into account the increasing interest in the design and implementation of parallel and distributed data mining algorithms. Parallel algorithms can easily address both the running time and memory requirement issues, by exploiting the vast aggregate main memory and processing power of processors and accelerators available on parallel computers. Anyway, parallelizing existing algorithms in order to achieve good performance and scalability with regard to massive datasets is not trivial. Indeed, it is of paramount importance a good data organization and decomposition strategy in order to balance the workload while minimizing data dependences. Another concern is related to minimizing synchronization and communication overhead. Finally, I/O costs should be minimized as well. Creating breakthrough parallel algorithms for high-performance data mining applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications.

Moreover, increasingly the data is spread among different geographically distributed sites. Centralized processing of this data is very inefficient and expensive. In some cases, it may even be impractical and subject to security risks. Therefore, processing the data minimizing the amount of data being exchanged whilst guaranteeing at the same time correctness and efficiency is an extremely important challenge. Distributed data mining performs data analysis and mining in a fundamentally distributed manner paying careful attention to resource constraints, in particular bandwidth limitation, privacy concerns and computing power.

The focus of this Special Issue is on all forms of advances in high-performance and distributed data mining algorithms and applications. The topics relevant to the Special Issue include (but are not limited to) the following.

TOPICS OF INTEREST

Scalable parallel data mining algorithms using message-passing, shared-memory or hybrid programming paradigms

Exploiting modern parallel architectures including FPGA, GPU and many-core accelerators for parallel data mining applications

Middleware for high-performance data mining on grid and cloud environments

Benchmarking and performance studies of high-performance data mining applications

Novel programming paradigms to support high-performance computing for data mining

Performance models for high-performance data mining applications and middleware

Programming models, tools, and environments for high-performance computing in data mining

Map-reduce based parallel data mining algorithms

Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing for data mining

Novel distributed data mining algorithms

SUBMISSION GUIDELINES

All manuscripts and any supplementary material should be submitted electronically through Elsevier Editorial System (EES) at http://ees.elsevier.com/ins (http://ees.elsevier.com/ins). The authors must select as "SI:PDDM" when they reach the "Article Type" step in the submission process.

A detailed submission guideline is available as "Guide to Authors" at: http://www.elsevier.com/journals/information-sciences/0020-0255/guide-for-authors.

IMPORTANT DATES

Submission deadline: December 1th, 2017
First round notification: March 1th, 2018
Revised version due: May 1st, 2018
Final notification: June 1st, 2018
Camera-ready due: July 1st, 2018
Publication tentative date: October 2018

Guest editors:

Massimo Cafaro, Email: massimo.cafaro@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Italo Epicoco, Email: italo.epicoco@unisalento.it
University of Salento, Italy and Euro-Mediterranean Centre on Climate Change, Foundation

Marco Pulimeno, Email: marco.pulimeno@unisalento.it
University of Salento, Italy


-

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

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

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

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

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

[DMANET] PhD and Postdoc Positions (Discrete Mathematics and Combinatorial Algorithms)

PhD and Postdoc Positions (Discrete Mathematics and Combinatorial Algorithms)

The Information Theory team at Aalto University carries out research in a variety
of subfields within discrete mathematics (coding theory, design theory, graph theory,
information theory) and computer science (combinatorial algorithms). In particular,
studies on classification of fundamental combinatorial structures have been pursued
(P. Kaski & P.R.J. Ostergard, Classification Algorithms for Codes and Designs, Springer,
Berlin, 2006).

Algorithms for clique (independent set) search play a central role in the research,
and the team has developed the Cliquer software
https://users.aalto.fi/~pat/cliquer.html
Possible topics for study and research include exact and heuristic algorithms for the
maximum clique problem and other (NP)-hard problems as well as application of these to
construction, enumeration, and classification of various types of discrete structures.
A 500-core compute cluster owned by the team is a dream come true for anyone wanting to
push the limits of what is computationally doable. CERN hunts new particles, we hunt
new mathematical structures.

[The information within brackets is for the postdoc position.]
An applicant for the PhD [postdoc] position should have a Master's [PhD] degree
in mathematics or computer science, excellent programming skills (C), good skills
in English, and documented knowledge in some subfields of discrete mathematics or
computer science related to the topics mentioned above. The entry level salary is
2422 EUR [3517 EUR] before taxes. The employee is assumed to act as a teaching assistant
[teacher] for one course per year. The preferable starting time is January 2018 but can
be somewhat adjusted; the position is filled for a maximum of 4 [1.5] years with an
option of extension for the postdoc position.

Any inquiries should be sent by email to patric.ostergard@aalto.fi
The application should be sent to the same address as soon as possible
but no later than on November 30, 2017. Please submit the following documents:

-a CV and (if applicable) a list of publications,
-copies of university grade transcripts and diplomas,
-the names of two persons who are willing to provide a letter of reference,
if asked, and
-for the PhD position only: a motivation letter,
-for the postdoc position only: a research plan.

---

Patric Ostergard
Professor

Dept. of Communications & Networking
Aalto University
P.O. Box 13000, 00076 Aalto, FINLAND
Tel: +358 50 344 3610
Email: patric.ostergard@aalto.fi
WWW: http://users.aalto.fi/pat/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, October 17, 2017

[DMANET] Visiting Professor in Computer Science The Faculty of Mathematics and Physics, Charles University (Prague)

Visiting Professor in Computer Science The Faculty of Mathematics and
Physics, Charles University (Prague) invites applications for the
position of a Visiting Professor in Computer Science.

The position is open in any area of computer science at the School of
Computer Science of the Faculty. The applicant must be an
internationally recognized scholar in his research area, and is expected
to teach two 90-minute courses per week at advanced undergraduate (MSc.)
level. The curriculum of the courses is proposed by the applicant and is
part of the application. At least one of the courses should introduce
topics related to recent research. All teaching will be in English,
Czech language fluency is not required. A teaching assistant for both
courses will be provided by the Faculty.

The position is funded by the Czech Operational Programme Research,
Development and Education, project no.
CZ.02.2.69/0.0/0.0/16_015/0002362. The funding is available for one
semester (5 months), commencing either on February 1, 2018, or on
September 1, 2018.

The gross monthly salary is 84.000 CZK (approx. 3230 EUR).

The Faculty will provide assistance with locating housing and schooling
for dependents (English language pre-school, elementary and secondary
schools are available in Prague).

Electronic applications accompanied by:
curriculum vitae,
list of publications,
research and teaching statements,
a copy of PhD diploma,
a curriculum of the proposed courses,
and a specification of the starting date preference,

should be sent to the Faculty of Mathematics and Physics, Charles
University (Jan Trlifaj, Vice-Dean for Research and International
Relations, Jan.Trlifaj@mff.cuni.cz).

The application deadline is November 15th, 2017. The review of
candidates will begin immediately, and the successful candidates will be
contacted by December 15th, 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] PhD position in algorithms

PhD positions in Algorithms at the University of Bergen is available. The deadline is Nov 15, 2017. Please follow the link
https://www.jobbnorge.no/en/available-jobs/job/143360/phd-position-in-multivariate-algorithms <https://www.jobbnorge.no/en/available-jobs/job/143360/phd-position-in-multivariate-algorithms>
for further information.
**********************************************************
*
* 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] PMS 2018: Final Call for Papers

******************************************************************
PMS 2018
16th International Conference on Project Management and Scheduling
April 17-20, 2018
Rome - Italy
www.pms2018.ing.uniroma2.it
******************************************************************

PMS 2018 (16th International Workshop on Project Management and
Scheduling) is organized by the Department of Enterprise Engineering
of the University of Rome "Tor Vergata" (Rome, Italy). The workshop
will be held in Rome - Italy - on April, 17-20, 2018 at Residenza di
Ripetta, strategically located in the heart of the City - a few steps
away from Piazza del Popolo and Piazza di Spagna.

The workshop website is http://www.pms2018.ing.uniroma2.it

The workshop will cover the following but non exhaustive list of topics:
- Project Management: Network modeling, Project scheduling, Resource
management, Due-date management, Project risk management, Project
scheduling under uncertainty, Proactive/reactive project scheduling,
Multicriteria project scheduling, Applications, Software
- Machine Scheduling: Shop scheduling, Scheduling with additional
constraints, Machine assignment and scheduling, Flexible/robust
scheduling, Grid scheduling, Multicriteria scheduling, Applications,
Software.

The workshop will consist of technical and selected presentations as
well as invited presentations made by esteemed researchers working on
Project Management and Scheduling.

Plenary speakers confirmed are:
- Jacques Carlier - Université de Technologie de Compiègne
- Rolf Möhring - Technische Universität Berlin
- Erwin Pesch - Universität Siegen

All researchers, academics, phd students and practitioners working on
the conference themes are invited to participate to PMS 2018
submitting an extended abstract (length 4 single-spaced A4 pages).
Templates and guidelines to authors are available on the PMS 2018
website. These 4-page submissions will be reviewed according to the
standard reviewing process of international conferences. A selection
of submissions will be presented during the workshop.

Best student paper award. See the PMS 2018 website for details
(section Call for papers).

After the workshop, the authors will have the opportunity to submit
full papers to a special issue of Annals of Operations Research (see
the PMS 2018 website).

Important deadlines:
Paper submission: 31st October 2017
Notification of acceptance: 19th January 2018
Final paper presentation: 12th February 2018
Early registration: 15th February 2018

A list of hotels will be made available on the PMS 2018 website soon.
We remind you that Rome is very crowded in the period of the
Conference. Hence, we warmly invite all the participants to reserve
their accommodation as soon as possible in order to find solutions at
best rates.

For detailed information about the conference and the venue, please,
visit the Conference website: http://www.pms2018.ing.uniroma2.it, or
send an email to caramia@dii.uniroma2.it.

On behalf of the Organizing Committee,
Massimiliano Caramia (Conference Chair)

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

Monday, October 16, 2017

[DMANET] 5th International Combinatorics Conference registration closing soon

#### Early-bird registration closing very soon ####
5th International Combinatorics Conference (5ICC)
Dates: Dec 4-9 2017
Venue: Monash University, Melbourne, Australia
Web: http://www.monash.edu/5icc/
e-mail
: 5icc@monash.edu


*** Early-bird registration will close very soon (31st October) ***
*** Submission of abstracts will close soon afterwards (10th November) ***

5ICC is the fifth in a series of major combinatorics
conferences that are run once per decade by the
Combinatorial Mathematics Society of Australasia.

Researchers in any area of discrete mathematics and its applications
are warmly invited. Students are also encouraged to attend, and there
will be a prize for the best student talk.

Plenary Speakers:

Bill Chen, Nankai University
Maria Chudnovsky, Princeton University
Charlie Colbourn, Arizona State University
Marston Conder, University of Auckland
David Eppstein, University of California, Irvine
Joanna Fawcett, Imperial College London
Jacob Fox, Stanford University
Daniela Kühn, Birmingham University
Barbara Maenhaut, University of Queensland
Brendan McKay, Australian National University
Alexander Scott, Oxford University
Paul Seymour, Princeton University
Balázs Szegedy, Rényi Institute
Le Anh Vinh, Vietnam National University

There will be a welcome function in the evening on Sunday 3 December.
Talks will start on Monday 4 Dec and finish lunchtime on Saturday 9 Dec.
The conference excursion will be in the afternoon of Wednesday 6 Dec.
The conference banquet will be in the evening on Friday 8 Dec.

**********************************************************
*
* 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] Tenure-Track Computer Science Position at City University of New York, Lehman College (*All Areas, Open Rank*)

*** Tenure-Track Computer Science Position at City University of New York,
Lehman College ***

* All Areas, Open Rank *

Lehman College of The City University of New York invites applications at
all levels for a computer science faculty position beginning in Fall 2018.
Outstanding candidates from all areas of computer science will be
considered, but those working in the following research areas are
particularly encouraged to apply: machine learning, robotics, networks,
security, data center-scale computing, and cyber-physical systems. The
successful candidate will be expected to pursue an active, externally
funded research program and to perform high-quality undergraduate teaching
and mentoring.

The Department of Computer Science, which was spun off from the Department
of Mathematics and Computer Science in Fall 2017, currently consists of
seven tenure-track faculty and one lecturer, and plans to expand
aggressively in the coming years. The department offers undergraduate (B.S.
& B.A.) and graduate (M.S.) degrees. Through a joint appointment on the
Graduate Center Doctoral Faculty, the successful candidate will teach and
advise Ph.D. students as well. The Department has a strong focus on
undergraduate education. Our undergraduates are well prepared to find jobs
and internships or to continue graduate education. Recently, the Department
formed a partnership with New York City called the "Tech Talent Pipeline,"
which funds internships for students to gain experience in the tech
industry.

The Lehman College campus is located in Bronx, New York and is a Senior
College within the City University of New York (CUNY) system. Lehman is the
only four-year public college in the Bronx and is recognized as a Hispanic
Serving Institution serving the borough and surrounding region as an
intellectual, economic and cultural center. Lehman provides undergraduate
and graduate studies in the liberal arts and sciences and professional
education within a dynamic research environment. With a diverse student
body of more than 13,000, Lehman offers more than 90 undergraduate and
graduate programs. Ranked as having the fourth highest mobility rate in the
nation by the National Bureau of Economic Research and the Equality of
Opportunity Project, Lehman is a proud catalyst for economic and social
mobility for its students, almost half of whom are first generation college
students.


QUALIFICATIONS

For Assistant, Associate, or Full Professor:
Ph.D. degree in Computer Science or related field. Also required are a
sincere commitment to students, the potential to develop and maintain an
active research agenda, and the ability to cooperate with others for the
good of the institution.

Candidates at the Associate Professor and Professor levels must have a
well-established active research program and an excellent teaching record.
Applications from candidates with experience in departmental leadership are
especially encouraged. Candidates at the Assistant Professor level must
have completed a Ph.D. in computer science or related field at the time of
appointment and must have demonstrated the capacity for excellence both in
research and in teaching.


HOW TO APPLY

In order to be considered for this position, please complete the following
three steps.

STEP ONE: Go to
https://home.cunyfirst.cuny.edu/psp/cnyepprd/GUEST/HRMS/c/HRS_HRAM.HRS_CE.GBL?Page=HRS_CE_JOB_DTL&Action=A&JobOpeningId=17582&SiteId=1&PostingSeq=1
(CUNYfirst Job ID 17582), click Apply Now, and follow the instructions to
register and submit a cv, cover letter, research statement and teaching
statement (all in a single PDF file).

STEP TWO: Arrange for three recommendation letters to be sent to
matthew.johnson1@lehman.cuny.edu.

STEP THREE: Email a copy of the cv, cover letter, research statement and
teaching statement (all in a single PDF file) to
matthew.johnson1@lehman.cuny.edu.


CLOSING DATE

Review of CVs will begin on January 2, 2018 and continue until a candidate
has been identified.


EQUAL EMPLOYMENT OPPORTUNITY

CUNY encourages people with disabilities, minorities, veterans and women to
apply. At CUNY, Italian Americans are also included among our protected
groups. Applicants and employees will not be discriminated against on the
basis of any legally protected category, including sexual orientation or
gender identity. EEO/AA/Vet/Disability Employer.


**********************************************************
*
* 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/
*
**********************************************************

Tenure-Track Computer Science Position at City University of New York, Lehman College (*All Areas, Open Rank*)

*** Tenure-Track Computer Science Position at City University of New York, Lehman College ***

* All Areas, Open Rank *

Lehman College of The City University of New York invites applications at all levels for a computer science faculty position beginning in Fall 2018. Outstanding candidates from all areas of computer science will be considered, but those working in the following research areas are particularly encouraged to apply: machine learning, robotics, networks, security, data center-scale computing, and cyber-physical systems. The successful candidate will be expected to pursue an active, externally funded research program and to perform high-quality undergraduate teaching and mentoring.

The Department of Computer Science, which was spun off from the Department of Mathematics and Computer Science in Fall 2017, currently consists of seven tenure-track faculty and one lecturer, and plans to expand aggressively in the coming years. The department offers undergraduate (B.S. & B.A.) and graduate (M.S.) degrees. Through a joint appointment on the Graduate Center Doctoral Faculty, the successful candidate will teach and advise Ph.D. students as well. The Department has a strong focus on undergraduate education. Our undergraduates are well prepared to find jobs and internships or to continue graduate education. Recently, the Department formed a partnership with New York City called the "Tech Talent Pipeline," which funds internships for students to gain experience in the tech industry.

The Lehman College campus is located in Bronx, New York and is a Senior College within the City University of New York (CUNY) system. Lehman is the only four-year public college in the Bronx and is recognized as a Hispanic Serving Institution serving the borough and surrounding region as an intellectual, economic and cultural center. Lehman provides undergraduate and graduate studies in the liberal arts and sciences and professional education within a dynamic research environment. With a diverse student body of more than 13,000, Lehman offers more than 90 undergraduate and graduate programs. Ranked as having the fourth highest mobility rate in the nation by the National Bureau of Economic Research and the Equality of Opportunity Project, Lehman is a proud catalyst for economic and social mobility for its students, almost half of whom are first generation college students.


QUALIFICATIONS

For Assistant, Associate, or Full Professor:
Ph.D. degree in Computer Science or related field. Also required are a sincere commitment to students, the potential to develop and maintain an active research agenda, and the ability to cooperate with others for the good of the institution.

Candidates at the Associate Professor and Professor levels must have a well-established active research program and an excellent teaching record. Applications from candidates with experience in departmental leadership are especially encouraged. Candidates at the Assistant Professor level must have completed a Ph.D. in computer science or related field at the time of appointment and must have demonstrated the capacity for excellence both in research and in teaching.


HOW TO APPLY

In order to be considered for this position, please complete the following three steps.

STEP ONE: Go to https://home.cunyfirst.cuny.edu/psp/cnyepprd/GUEST/HRMS/c/HRS_HRAM.HRS_CE.GBL?Page=HRS_CE_JOB_DTL&Action=A&JobOpeningId=17582&SiteId=1&PostingSeq=1 (CUNYfirst Job ID 17582), click Apply Now, and follow the instructions to register and submit a cv, cover letter, research statement and teaching statement (all in a single PDF file).

STEP TWO: Arrange for three recommendation letters to be sent to matthew.johnson1@lehman.cuny.edu.

STEP THREE: Email a copy of the cv, cover letter, research statement and teaching statement (all in a single PDF file) to matthew.johnson1@lehman.cuny.edu.


CLOSING DATE

Review of CVs will begin on January 2, 2018 and continue until a candidate has been identified.


EQUAL EMPLOYMENT OPPORTUNITY

CUNY encourages people with disabilities, minorities, veterans and women to apply. At CUNY, Italian Americans are also included among our protected groups. Applicants and employees will not be discriminated against on the basis of any legally protected category, including sexual orientation or gender identity. EEO/AA/Vet/Disability Employer.

[DMANET] CFP COMPLEXIS 2018 - 3rd Int.l Conf. on Complexity, Future Information Systems and Risk (Funchal, Madeira/Portugal)

SUBMISSION DEADLINE

3rd International Conference on Complexity, Future Information Systems and Risk

Submission Deadline: October 30, 2017

http://www.complexis.org/

March 20 - 21, 2018
Funchal, Madeira, Portugal.

COMPLEXIS is organized in 7 major tracks:

- Complexity in Informatics, Automation and Networking
- Complexity in Biology and Biomedical Engineering
- Complexity in Social Sciences
- Complexity in Computational Intelligence and Future Information Systems
- Complexity in EDA, Embedded Systems, and Computer Architecture
- Network Complexity
- Complexity in Risk and Predictive Modeling

In Cooperation with IFSR, EATCS.

With the presence of internationally distinguished keynote speakers:
Ernesto Estrada, University of Strathclyde, United Kingdom

A short list of presented papers will be selected so that revised and extended versions of these papers will be published by Springer.

All papers presented at the congress venue will also be available at the SCITEPRESS Digital Library (http://www.scitepress.org/DigitalLibrary/).

Should you have any question please don't hesitate contacting me.

Kind regards,
COMPLEXIS Secretariat

Address: Av. D. Manuel I, 27A, 2º esq.
2910-595 Setubal, Portugal
Tel: +351 265 520 184
Fax: +351 265 520 186
Web: http://www.complexis.org/
e-mail
: complexis.secretariat@insticc.org


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

[DMANET] Call for Papers, Second International Workshop on Bilevel Programming, Lille, June 18-22

Call for Papers

Second International Workshop on Bilevel Programming

INRIA Lille-Nord Europe, France

June 18-22, 2018

https://iwobip2.sciencesconf.org/

The main motivation for hosting IWOBIP'18 is to bring together a group of academics, practitioners, and researchers interested in Bilevel Optimization. It is also meant to attract young researchers and graduated students (master and Ph.D. students) who are specializing in this topic.

Bilevel Programming is a fairly recent branch of optimization that deals with programs whose constraints embed an auxiliary optimization problem. Bilevel programs are pervasive and are commonly found in a number of real-world problems. This includes problems in the domains of transportation, energy, economics, decision science, environmental economics, security, etc.

In addition to contributed presentations, IWOBIP'18 will consist of plenary lectures and mini-courses, both given by world-renowned researchers. Mini-courses will be given from June 18 to June 19 noon.

The workshop will take place from June 19 noon to June 22 .

The following topics are among the ones of interest to IWOBIP'18: theory, exact methods, heuristic algorithms and applications modeled as bilevel programming problems. An important goal of the conference is to foster new collaborations and joint projects. We, therefore, encourage the presentation of ongoing projects and recent results.

Location
The city of Lille, located in the north of France, is easily reachable by plane (Lesquin Airport) or by train from the airports of Brussels (about 1 hour) or Paris (50 minutes from Charles De Gaulle Airport).

Lille offers a wide variety of tourist, recreational and cultural activities, which undoubtedly will make the stay more attractive during the workshop.

Paper submission

Papers submitted for presentation at the conference will be selected on the basis of extended abstracts of maximum 3 pages which will be reviewed by the international program committee.

Further information and instructions on how to submit a paper can be obtained on the conference web site:

https://iwobip2.sciencesconf.org/.

Important dates

Extended abstracts deadline: December, 15, 2017

Notification of acceptance: February, 16, 2018

Early registration deadline: March 16, 2018

Conference dates: June 18-22, 2018

Conference co-chairs

Luce Brotcorne, Martine Labbé

Conference information

Conference web site: https://iwobip2.sciencesconf.org/.

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

Sunday, October 15, 2017

[DMANET] postdoctoral positions at IRIF (previously, LIAFA), Paris, France

The Algorithms and Complexity group of IRIF - previously LIAFA -
(CNRS and University ParisDiderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions in classical and quantum
computing. Topics of interest include (but are not limited to): algorithms,
streaming algorithms, approximation algorithms, online algorithms, biological
algorithms, communication complexity, cryptography (including post-quantum
cryptography), computational game theory, quantum computing, computational
applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot - Paris 7.
For more information about IRIF, please seehttp://www.irif.fr ,
and for more information about the Algorithms and Complexity
group please see http://algo.irif.fr .
Further information may be obtained from any of the permanent
members of the group.

The starting date of the position(s) will usually be in September 2018
but can be negotiated.

The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the "openings" sections at:
algo.irif.fr .

The position(s) will be financed either by the team's own resources, or
via joint applications of the candidate and the team to external funding
sources.

Applications should be received by November 15, 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] Faculty positions in the School Computing at Clemson University

Tenure-Track Faculty Positions in the School of Computing

The School of Computing at Clemson University invites applications from
a culturally diverse pool of candidates for positions in its three
academic units representing a broad cross-section of computing and its
applications: the Division of Computer Science (CS), the Division of
Human-Centered Computing (HCC), and the Division of Visual Computing
(VC). Preference will be given to candidates at the rank of Assistant
Professor, though all ranks will be considered. CS prefers applicants
with interest in machine learning, software engineering, and security.
HCC invites applicants whose work demonstrates strong potential impact
in any area of human-centered computing. VC invites applicants with
areas of interest such as computer graphics, computer vision, animation,
simulation, motion, human modeling, game development, digital
production, visualization, robotics, and perceptual methods.

The school includes 42 faculty, of which 31 are tenured or tenure-track.
It enrolls 750+ undergraduate and 250+ graduate students. The School
offers BA and BS degrees in Computer Science, BS in Computer Information
Systems, MS in Computer Science, MFA and MS in Digital Production Arts,
PhD in Computer Science, PhD in Human-Centered Computing, and PhD and MS
in Biomedical Data Science & Informatics.

Clemson is the public land grant institution of South Carolina and is
classified in the highest research category by the Carnegie Foundation.
Clemson enrolls nearly 24,000 students, including over 5,000 ethnic
minorities and 1,500 international students. In Fall 2017, Clemson has
over 18,600 undergraduate and 4,800 graduate students. Research and
economic development activities are enhanced by public-private
partnerships at three innovation campuses and six research and education
centers located throughout South Carolina. Clemson University is ranked
23rd among public national universities by U.S. News & World Report. We
are fully committed to a culturally diverse faculty and student body.

Successful candidates should have an earned doctorate by the start date
of August 15th, 2018 in computer science, human-centered computing, or a
related area. Rank will be commensurate with qualifications. We value
diversity and thus strongly encourage applications from exceptional
scholars who can also contribute to the diversity and excellence of our
academic community through research, teaching, and service.

The anticipated start date is August 15, 2018, though an earlier date is
possible. Application review will begin November 15, 2017, and will
continue until the position is filled. Applicants should upload a cover
letter, current vitae, research statement, teaching statement and the
names and addresses of three references to:

https://apply.interfolio.com/45929 (Computer Science)
https://apply.interfolio.com/46047 (Visual Computing)
https://apply.interfolio.com/46005 (Human-Centered Computing)

Applicants whose interests overlap divisions are encouraged to submit
separate applications to each appropriate division for maximum
consideration.

If you have a particular need to contact us, please contact Christy Babb
(cbabb) at clemson.edu.

Clemson University does not discriminate against any individual or group
of individuals on the basis of race, color, religion, sex, sexual
orientation, gender, pregnancy, national origin, age, disability,
veteran's status or genetic information. Clemson University is an
Affirmative Action/Equal Opportunity Employer.

--
Ilya Safro
School of Computing
Clemson University
http://www.cs.clemson.edu/~isafro

**********************************************************
*
* 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] 7th edition of the Winter School on Network Optimization (3rd announcement)

?


The 7th edition of the Winter School on Network Optimization will take place at Hotel Estoril-Éden, Monte Estoril, from the 15th to the 19th of January 2018. Its main objective is to provide an opportunity for PhD students to get together and attend high level courses in the field of Network Optimization. Non-PhD students are welcome to attend the school, but the number of participants is limited and priority will be given to PhD students. In this edition of the school, the lecturers and subjects to be addressed are:

Adam Ouorou (Orange Labs) - Robust optimization in telecommunications;

Martine Labbé (Univ. Libre de Bruxelles) - Bilevel programming: Stackelberg games and Pricing Problems;

Ivana Ljubic (ESSEC, Paris) - Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem;

Silvano Martello (Univ. of Bologna) - Packing problems in one and more dimensions;

Juan José Salazar-Gonzalez (Univ. de La Laguna) - Models and Algorithms for Vehicle Routing Problems with Pickups and Deliveries.

The school is part of the activities of the CMAFCIO (Centro de Matemática, Aplicações Fundamentais e Investigação Operacional) University of Lisbon as well as of the ENOG

(European Network Optimization Group). The event is also endorsed by the EURO (the Association of European Societies) and APDIO (the Portuguese OR society).

Potential participants are invited to submit their CVs to the address NetOpt2018@fc.ul.pt no later than the 31st October .

Further information is available in the webpage (http://netopt2018.campus.ciencias.ulisboa.pt<http://netopt2018.campus.ciencias.ulisboa.pt/>)??

**********************************************************
*
* 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/
*
**********************************************************

Friday, October 13, 2017

[DMANET] PPSN 2018 - Call for TUTORIALS and WORKSHOPS

PPSN 2018 - Call for TUTORIALS and WORKSHOPS

15th International Conference on Parallel Problem Solving from Nature
8-12 September 2018
Coimbra, Portugal

http://ppsn2018.dei.uc.pt


Important Dates

Proposal submission due: 15 November 2017
Notification of acceptance: 15 December 2017
Tutorials and Workshops: 8-9 September 2018
Conference: 8-12 September 2018

Call for TUTORIALS

The PPSN 2018 Organizing Committee invites proposals for tutorials to be held in
conjunction with PPSN 2018. The tutorial topic should enjoy broad interest
within the community. It can be an established or emerging research topic within
the field itself, but also from a related research field or about an interesting
application area. The proposed topic should be broad enough to provide a gentle
introduction to the research area, but it should also cover the most important
contributions in depth. The planned duration of the tutorials is 90 minutes.


Submission Details

Prospective tutorial organisers are invited to submit a plain-text tutorial
proposal by email to:

ppsn2018.tutorials@dei.uc.pt

The proposal should include:

- Title of the tutorial
- Brief abstract
- A tutorial description in syllabus form
- Contact details and a short CV of the organiser(s)
- Potential target participants and audience


Tutorial Chairs

Michael T. M. Emmerich, Leiden University, Netherlands
Gisele L. Pappa, Federal University of Minas Gerais, Brazil

Call for WORKSHOPS

The PPSN 2018 Organising Committee invites proposals for workshops to be held in
conjunction with PPSN 2018. The workshops are intended to be forums for
presenting and discussing, for example, new emerging approaches or critical
reflections within a subfield. They provide an excellent opportunity to meet
people with similar interests, to be exposed to cutting-edge research and to
exchange ideas in an informal setting. The organisers of an accepted workshop
are responsible for its coordination, publicity (e.g., for sending out call for
papers/abstracts), collecting and reviewing the papers/abstracts, and
maintaining a webpage providing a list of accepted talks. Moreover, organisers
can decide between half-day and full-day workshops. The workshop format is also
up to the organisers. However, we encourage to facilitate interactive sessions.
We suggest to solicit concept papers or abstracts of not more than a few pages'
length, instead of full papers.


Submission Details

Prospective workshop organisers are invited to submit a plain-text workshop
proposal by email to:

ppsn2018.workshops@dei.uc.pt

The proposal should include:

- Title of the workshop
- Brief description of the workshop topics
- Potential target participants and audience
- Roughly approximated number of participants
- Rough estimate of the number of talks
- Contact details and a short CV of the organiser(s)


Workshop Chairs:

Robin C. Purshouse, University of Sheffield, UK
Christine Zarges, Aberystwyth University, UK


--
Luís Paquete | paquete@dei.uc.pt
http://www.uc.pt/go/paquete
Dept. of Informatics Engineering
University of Coimbra, Portugal

**********************************************************
*
* 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] 2018 School on Column Generation

2018 School on Column Generation
Paris, France, February 26 - March 2, 2018

https://www.gerad.ca/colloques/ColumnGeneration2018/

REGISTRATION IS OPEN, SPACE IS LIMITED.

The 2018 School on Column Generation is the fourth of its kind (after
Paris, France, in 2014, Darmstadt, Germany, in 2010 and Montréal, Canada,
in 2006) and aims at teaching the state-of-the-art in column generation and
branch-and-price to advanced students and PhD students but also to
practitioners and researchers interested. The lectures will be given by
renowned scientists in the field, complemented by hands-on experience in a
computer lab. The participants will have the opportunity to present their
own research or application problems in order to foster discussions and
create a real workshop atmosphere.

Topics to be covered include: Basic theory (decompositions, reformulations,
convexification, discretization, etc.), vehicle routing and crew scheduling
applications, shortest path subproblems, column generation heuristics,
master problem issues (stabilization, aggregation), branching and cutting,
and hints on implementation issues. In particular, on Thursday, we will
spend a whole day with the SCIP framework and learn about implementing
branch-price-and-cut.

Lectures are given by Guy Desaulniers, Jacques Desrosiers, Marco Luebbecke
and Roberto Wolfler-Calvo.

The practical session with SCIP/GCG is given by Jonas Witt.

The program starts on Monday at 9.00 and ends on Friday around 17.00, so we
will have five full days of school.

**********************************************************
*
* 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/
*
**********************************************************

[Mycolleagues] 8th Conference on Decision and Game Theory for Security (GameSec) | Call for Participation

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

 

Call for Participation

 

The 8th Conference on Decision and Game Theory for Security (GameSec)

 

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

 

GameSec 2017, the 8th Conference on Decision and Game Theory for Security will

take place in Vienna, Austria, on October 23-25, 2017.

 

http://www.gamesec-conf.org/

 

The GameSec conference brings together academic, industry and government

researchers to identify and discuss the major technical challenges and present

recent research results that highlight the connections between and among game

theory, control, distributed optimization, and economic incentives within the

context of real world security, trust, and privacy problems. The past editions

of the GameSec conference took place in Berlin-Germany (2010), College Park

Maryland-USA (2011), Budapest-Hungary (2012), Fort Worth Texas-USA (2013), Los

Angeles-USA (2014), London-UK (2015), and New York-USA (2016).

 

The deadline for early registration is September 28, 2017. Student travel

grants are available for students who are interested in attending the

conference. The deadline for student travel grant applications is September 8,

2017.

 

The conference features two keynote talks:

 

- Speaker 1: Professor V.S. Subrahmanian, Dartmouth College, USA.

 

Biography: V.S. Subrahmanian is The Dartmouth College Distinguished Professor

in Cybersecurity, Technology, and Society. Prior to this, we was Professor of

Computer Science for 28 years at the University of Maryland and Director of

the Center for Digital International Government. He has developed data-driven

algorithms that bring game theory and predictive analytics together for a

variety of problems relating to counter-terrorism, cyber-security, and the

airline industry. In cyber-security, he developed adversary models and Pareto

optimal methods to help system administrators decide what vulnerabilities to

patch and what vulnerable software to deactivate. He also extended this model

to one where, additionally, the defender has honeypots that he can install in

a strategic way. More recently, he has been looking at game-theoretic models

in which the defender can provide "fake" scan results that enable a defender

to divert the attack from network nodes containing truly valuable information.

He led the team that won DARPA's 2015 Twitter Bot Challenge in the SMISC

program. His Global Cyber Vulnerability Report is the biggest study to date of

the vulnerability of 44 countries from over 20B malware and telemetry records.

He has written over 300 refereed papers and (co-) authored 6 books. Prof.

Subrahmanian serves on the editorial boards of journals such as Science, ACM

Transactions on Intelligent Systems & Technology. ACM Transactions on

Computational Logic, and more. In addition, he is the editor in chief of IEEE

Intelligent Systems. A fellow of both AAAI and AAAS, he has delivered numerous

invited talks and keynote addresses. https://www.cs.umd.edu/~vs/.

https://www.cs.umd.edu/~vs/.

 

- Speaker 2: Professor Piet van Mieghem, Technical University Delft,

Netherlands.

 

Biography: Piet Van Mieghem is professor at the Delft University of Technology

with a chair in telecommunication networks and chairman of the section Network

Architectures and Services (NAS) since 1998. His main research interests lie

in the modelling and analysis of complex networks (such as infrastructural,

biological, brain, social networks) and in new Internet-like architectures and

algorithms for future communications networks. He is the author of four books:

Performance Analysis of Communications Networks and Systems, Data

Communications Networking, Graph Spectra for Complex Networks and Performance

Analysis of Complex Networks and Systems. Currently, he serves on the

editorial board of the OUP Journal of Complex Networks. Professor Van Mieghem

received a Master and Ph. D. degree in Electrical Engineering from the

K.U.Leuven (Belgium) in 1987 and 1991, respectively. Before joining Delft, he

worked at the Interuniversity Micro Electronic Center (IMEC) from 1987 to

1991. During 1993 to 1998, he was a member of the Alcatel Corporate Research

Center in Antwerp, where he was engaged in performance analysis of ATM systems

and in network architectural concepts of both ATM networks (PNNI) and the

Internet. He was a visiting scientist at MIT (department of Electrical

Engineering, 1992-1993) and a visiting professor at UCLA (department of

Electrical Engineering, 2005), at Cornell University (Center of Applied

Mathematics, 2009) and at Stanford University (department of Electrical

Egineering, 2015). He was member of the editorial board of Computer Networks

(2005-2006), the IEEE/ACM Transactions on Networking (2008-2012), the Journal

of Discrete Mathematics (2012-2014) and Computer Communications (2012-2015).

https://www.nas.ewi.tudelft.nl/people/Piet/.

 

The conference program includes 24 full and 4 short papers. The themes of the

conference this year were broad and encompassed work in the areas of network

security, security risks and investments, decision making for privacy,

security games, incentives in security, cybersecurity mechanisms, intrusion

detection, and information limitations in security. The program also includes

a special track on “Data-Centric Models and Approaches” which aims to close

the gap between theory and practice in this domain.

 

 

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

Kind regards,

GameSec 2017 Organizers:

Bo An (TPC co-chair), Nanyang Technological University, Singapore

Christopher Kiekintveld (TPC co-chair), University of Texas at El Paso, USA

Stefan Rass (General Chair), Universitaet Klagenfurt, Austria