Theory Announcements: February 2018

Wednesday, February 28, 2018

[DMANET] 30th Cumberland Conference

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

30th Cumberland Conference on Combinatorics, Graph Theory and Computing

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

The 30th Cumberland Conference will take place at Marshall University in Huntington, West Virginia, on Saturday, May 19th, and Sunday, May 20th, 2018. Please see our website:

http://www.marshall.edu/math/cumberland2018

* Featured speakers:

Charles Colbourn, Arizona State University

Patricia Hersh, North Carolina State University

Greg Warrington, University of Vermont

Michael Young, Iowa State University

* Contributed 20-minute talks on all areas of combinatorics and graph theory and associated areas of computer science are welcome.

* Deadlines: We strongly expect for travel support to be provided by the US National Science Foundation. Requests for travel support will be given priority if submitted by April 11, 2018. Abstracts should be submitted by April 25, 2018. There is no registration fee but participants need to register, either online or at the conference, provided that we receive NSF support (which we strongly expect we will). We encourage you to register online by May 9, 2018.

* Organizing committee (Marshall University):

JiYoon Jung

Elizabeth Niese

Carl Mummert

Michael Schroeder

If you have any questions, please contact the organizers at cumberland2018@marshall.edu<mailto:cumberland2018@marshall.edu>.

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

[DMANET] CfP: 8th Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA) @ GECCO 2018

-------------------------------------------------------------------------------
8th Workshop on
Evolutionary Computation for the Automated Design of Algorithms
(ECADA)

15-19 July 2018 @ GECCO 2018, Kyoto, Japan

http://web.mst.edu/~tauritzd/ECADA/
-------------------------------------------------------------------------------

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

We welcome original submissions on all aspects of Evolutionary Computation for
the Automated Design of Algorithms, in particular, evolutionary computation
methods and other hyper-heuristics for the automated design, generation or
improvement of algorithms that can be applied to any instance of a target
problem domain. Relevant methods include methods that evolve whole algorithms
given some initial components as well as methods that take an existing
algorithm and improve it or adapt it to a specific domain. Another important
aspect in automated algorithm design is the definition of the primitives that
constitute the search space of hyper-heuristics. These primitives should
capture the knowledge of human experts about useful algorithmic components
(such as selection, mutation and recombination operators, local searches, etc)
and, at the same time, allow the generation of new algorithm variants. Examples
of the application of hyper-heuristics, including genetic programming and
automatic configuration methods, to such frameworks of algorithmic components
are of interest to this workshop, as well as the (possibly automatic) design of
the algorithmic components themselves and the overall architecture of
metaheuristics. Therefore, relevant topics include (but are not limited to):

- Applications of hyper-heuristics, including general-purpose automatic
algorithm configuration methods for the design of metaheuristics, in
particular evolutionary algorithms, and other algorithms for application
domains such as optimization, data mining, machine learning, image
processing, engineering, cyber security, critical infrastructure protection,
and bioinformatics.

- Novel hyper-heuristics, including but not limited to genetic programming
based approaches, automatic configuration methods, and online, offline and
life-long hyper-heuristics, with the stated goal of designing or improving
the design of algorithms.

- Empirical comparison of hyper-heuristics.

- Theoretical analyses of hyper-heuristics.

- Studies on primitives (algorithmic components) that may be used by
hyper-heuristics as the search space when automatically designing algorithms.

- Automatic selection/creation of algorithm primitives as a preprocessing step
for the use of hyper-heuristics.

- Analysis of the trade-off between generality and effectiveness of different
hyper-heuristics or of algorithms produced by a hyper-heuristic.

- Analysis of the most effective representations for hyper-heuristics (e.g.,
Koza style Genetic Programming versus Cartesian Genetic Programming).

- Asynchronous parallel evolution of hyper-heuristics.

For more detailed information, see the ECADA workshop website
(http://web.mst.edu/~tauritzd/ECADA/).

---------------
IMPORTANT DATES
---------------

Submission deadline: March 27, 2018
Reviews due: April 6, 2018
Notification of acceptance: April 10, 2018
Camera-ready deadline: April 24, 2018
Workshop date: July 15 or 16, 2018 (TBC)

-----------------
PAPER SUBMISSION
-----------------

Workshop papers must be submitted using the GECCO submission system this
year. After login, authors need to select the "Workshop Paper" submission form
and select the ECADA workshop. To see a sample of the "Workshop Paper"
submission form go to GECCO's submission site
(https://ssl.linklings.net/conferences/gecco/) and chose "Sample Submission
Forms".

Submitted papers must not exceed 8 pages and are required to be in compliance
with the GECCO 2018 Papers Submission Instructions
(http://gecco-2018.sigevo.org/index.html/tiki-index.php?page=Papers+Submission+Instructions).

It is recommended to use the same templates as the papers submitted to the main
tracks, but ECADA does not require to remove the author information.

All accepted papers will be presented at the corresponding workshop and appear
in the GECCO Conference Companion Proceedings.

-----------------
WORKSHOP SCHEDULE
-----------------

The schedule will be announced on the workshop website shortly after the paper
acceptance notification deadline.

------------------------------------
ORGANIZERS (in alphabetical order)
------------------------------------

Manuel López-Ibáñez (manuel.lopez-ibanez@manchester.ac.uk)

Daniel R. Tauritz (dtauritz@acm.org)

John R. Woodward (j.woodward@qmul.ac.uk)

[DMANET] Research Associate position in Text Mining and Information Retrieval, Univ. of Nottingham, UK

Term: 1st July 2018 - 30th June 2019 (12 months)
Salary: Depending on qualifications and experience
Range: £26,495 to £38,833 per annum
Closing Date for applications: 1st April 2018

Details of the position and application can be found at:
http://www.jobs.ac.uk/job/BHQ873/research-associate-fellow-fixed-term/

Applications are invited to the above post to support Nottingham's contribution to project ENLIVEN (Encouraging Lifelong Learning for an Inclusive and Vibrant Europe) funded by the European Commission, working in the Automated Scheduling Planning and Optimisation (ASAP) Research Group at the School of Computer Science. This is a project within a consortium of 10 European countries. The project focuses on knowledge discovery, based on analysing large databases of documents collected from the consortium member countries, to establish knowledge bases within case based reasoning systems for policy making in lifelong learning in Europe. The objectives include to retrieve and extract knowledge from large amounts of data and documents, and to develop intelligent decision support systems to support policy makers throughout the policy making process for adult lifelong learning.

Applications are invited from highly skilled researchers in Computer Science, Artificial Intelligence, Knowledge Engineering, Mathematics or a related area. A good understanding of text mining and information retrieval is essential. Experience on text mining tools and knowledge discovery techniques will be an advantage.

The applicants must have (or be very close to completing) a PhD in Computer Science, Artificial Intelligence or related disciplines. The successful candidate will be working on text mining on large databases of documents to retrieve patterns / knowledge, and be involved in building Intelligent Decision Support Systems collaboratively with other members at Computer Science and other consortium members. They should be able to work both independently and collaboratively and be able to meet tight deadlines. Good communication skills to work within multidisciplinary teams are crucial. The candidates will be expected to disseminate research results in peer-reviewed journals and conferences.

Informal enquiries may be addressed to Dr Rong Qu (Rong.Qu@nottingham.ac.uk, Tel: +44 (0)115 8466503), Professor Bob John (Robert.john@nottingham.ac.uk) and Dr Jason Atkin (Jason.Atkin@nottingham.ac.uk). Please note that applications sent directly to this email address will not be accepted.

This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please contact the sender and delete the email and
attachment.

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

[DMANET] Postdoctoral position at INRIA Lille - Nord Europe

Title: Optimization of the mining of transactions within the Ethereum blockchain.

Duration: 18 months.

Contact: bernard.fortz@inria.fr

Job environment and objectives.

The postdoctoral research will be carried out within the partnership of the INOCS team and the start-up company Utocat specialist in blockchain management.

The objective of this project is to optimize the mining of transactions within the Ethereum blockchain, both in terms of processing time and costs.

Based on historical data extracted from the blockchain, the research aims at answering the two following questions:

For a fixed fee, what is the maximum time limit for a transaction to be undermined?

For a fixed maximum time limit, what is the amount of costs to be allocated (gasPrice)?

The researcher will combine machine learning techniques and robust and two-level optimization techniques to model the problem and develop efficient algorithms to solve it.

Scientific environment

The postdoctoral research will be carried out within the partnership of the INOCS team and the start-up company Utocat.

The researcher will be supervised by Luce Brotcorne (INOCS) and Bernard Fortz (INOCS).

Frequent meetings will be organized with Utocat.

INOCS:

The primal goal of INOCS is the study (modeling and methodological concerns) of optimization problems involving complex structures (CS). The INOCS team focuses on integrated models for problems with (CS) taking into account the whole structure of the problem and the development of solution methods taking explicitly into account the nature and the structure of the decisions as well as the properties of the problem. More information at https://team.inria.fr/inocs/

Utocat:

Utocat was created in October 2014 by Clément Francomme to help merchants accepting bitcoin payments and converting it directly in euros. In 2015, Utocat joined the EuraTechnologies acceleration program and pivoted to propose Blockchainiz : the dedicated access platform for Banks and Insurance companies..

As a Platform As A Service (PAAS), Blockchainiz is a blockchain solution for financial services that accompanies projects up to the production stage. Blockchainiz connects the functional processes to the blockchain. Data is not replicated on different IT systems anymore. Blockchain is used as a common repository for every part of the process. Hence, it enables to

limit the typing errors, to optimize the costs and delays while the customer experience is improved. More information at: https://www.blockchainiz.io

Now, they develop a new product : Catalizr, a connector between bank, investor and company that enables the automation of the management of unlisted securities between these three actors and facilitates investment in very small businesses (TPEs) and SMEs via a completely digital and secure process in the blockchain.

More information at : https://www.utocat.com/fr

Skills

Candidates should hold a PhD degree in Operations research, mathematics, computer science, or similar fields and should ideally have a solid background in discrete optimization, integer programming, decomposition techniques. Computer science skills in algorithmic and C/C++ development as well as basic knowledge of machine learning techniques and blockchain technology are also welcome.

Knowledge of French is not required, but good communication skills and a solid knowledge of English are essential.

Contact. If you are interested by the position, please send your CV and a motivation letter to bernard.fortz@inria.fr.

[DMANET] Postddoc position INRIA Lille- INOCS; Application of Stackelberg games to avoid fare evasion

Application of Stackelberg games to avoid fare evasion
Postdoctoral research project

INRIA Lille - INOCS team

Supervisors: Luce Brotcorne, Bernard Fortz, Martine Labbé.

Duration: 1 year.
Contact: Luce.Brotcorne@inria.fr

In the class of games known as Stackelberg games, one agent, the leader,
must commit to a strategy that can be observed by several other agents,
the followers, before he/she commits to a strategy of his/her own. The
leader wishes to find an optimal payoff-maximizing mixed strategy to
commit to, under the assumption that the followers will have knowledge
of the leader's mixed strategy and will best-respond to it. The problem
in such games consists thus in finding a payoff-maximizing mixed
strategy for the leader and corresponds to a bilevel problem with
bilinear objectives.

Stackelberg games can be modeled as a bilinear bilevel optimization
problem that can be reformulated as a single level mixed integer
nonlinear program (MINLP) (Conitzer and Sandholm 2006; Paruchuri et al.
2008; Kiekintveld et al. 2009). Recently, new stronger models have been
proposed by members the INOCS team (Casorran-Amilburu et al. 2016).

In this project, we will consider a specific application of Stackelberg
games in the context of fare evasion avoidance in transportation
systems. Many transportation system require passengers to purchase
tickets before entering, but they are not physically forced to do so
because the lack of infrastructure (e.g. no automatic doors to grant
access). Therefore, to avoid fare evasion, patrol units move in the
transit system to inspect passengers. One objective for the authority
organizing the patrols is to catch the maximum number of fare evaders
(and to collect a maximum amount of fines), while passengers have to
make a choice between buying a ticket or taking the risk of paying the
fine if they are controlled.

The problem can be seen as a Stackelberg game in which the leader has to
establish a mixed (randomized) strategy for the patrols, and the
passengers, observing this strategy, decide to buy a ticket or not,
maximizing their cost (depending on the probability of being fined).

To the best of our knowledge, the only approach to the problem using
mixed integer programming tool provides a heuristic solution that
overestimates the objective of the leader (Yin et al. 2012). In this
research proposal, we plan to

- establish the computational complexity of the problem;
- propose extended formulations to model exactly the objective of the
leader;
- develop decomposition methods based on column generation to solve
the problem effectively.

Research environment

The INOCS team aims to develop new models, algorithmic techniques and
implementations for optimization problems with complex structure (CS).
More precisley, we consider that an optimization problem presents a CS
when for example it involves some hierarchical leader-follower structure
(bilevel optimization). Luce Brotcorne and Martine Labbé are specialists
in bilevel optimization with a particular expertise to solve Stackelberg
games, while Bernard Fortz has also a strong experience in decomposition
methods that will be at the core of algorithms developed in the project.
This joint experience was already applied in the context of pricing
problems (Fortz, Labbé, and Violin 2013).

Contact.
If you are interested by the position, please send your CV and a motivation letter to Luce.Brotcorne@inria.fr

References

Casorran-Amilburu, Carlos, Bernard Fortz, Martine Labbé, and Fernando
Ordóñez. 2016. "Novel Formulations for General and Security Stackelberg
Games." Université libre de Bruxelles.

Conitzer, Vincent, and Tuomas Sandholm. 2006. "Computing the Optimal
Strategy to Commit to." In _Proceedings of the 7th Acm Conference on
Electronic Commerce_, 82–90. ACM.

Fortz, Bernard, Martine Labbé, and Alessia Violin. 2013. "Dantzig-Wolfe
Reformulation for the Network Pricing Problem with Connected Toll Arcs."
_Electronic Notes in Discrete Mathematics_ 41 (0):117–24.
https://doi.org/http://dx.doi.org/10.1016/j.endm.2013.05.083 .

Kiekintveld, Christopher, Manish Jain, Jason Tsai, James Pita, Fernando
Ordóñez, and Milind Tambe. 2009. "Computing Optimal Randomized Resource
Allocations for Massive Security Games." In _Proceedings of the 8th
International Conference on Autonomous Agents and Multiagent
Systems-Volume 1_, 689–96. International Foundation for Autonomous
Agents and Multiagent Systems.

Paruchuri, Praveen, Jonathan P Pearce, Janusz Marecki, Milind Tambe,
Fernando Ordóñez, and Sarit Kraus. 2008. "Playing Games for Security: An
Efficient Exact Algorithm for Solving Bayesian Stackelberg Games." In
_Proceedings of the 7th International Joint Conference on Autonomous
Agents and Multiagent Systems-Volume 2_, 895–902. International
Foundation for Autonomous Agents and Multiagent Systems.

Yin, Zhengyu, Albert Xin Jiang, Milind Tambe, Christopher Kiekintveld,
Kevin Leyton-Brown, Tuomas Sandholm, and John P Sullivan. 2012. "TRUSTS:
Scheduling Randomized Patrols for Fare Inspection in Transit Systems
Using Game Theory." _AI Magazine_ 33 (4):59.

[DMANET] PhD or Postdoc positions at the Technical University of Munich

The Department of Informatics at the Technical University of Munich
(Germany) is looking for Postdoc or PhD students working on mathematical
optimization and market design led by Prof. Martin Bichler
(http://dss.in.tum.de).

Market design uses mathematical optimization, economic theory, and
experiments to design market rules and institutions. Examples involve
the design of spectrum auction markets, environmental markets, energy,
procurement and logistics markets. Candidates should have a strong
background in mathematical optimization and an interest in topics such
as algorithm design, game theory, approximation, discrete convexity and
related applications.

Applicants for the PhD position should hold a Master's degree in
computer science, operations research and management science, or
mathematics and may obtain a PhD degree in computer science. Applicants
for the Postdoc position should hold a PhD degree in one of the
mentioned disciplines.

Prospective candidates will assist in teaching courses of the group
(dss.in.tum.de). Salary (for both PhD students and Postdocs) is
according to German tariff E13. The position is available for an initial
period of 2 years, but may be extended.

Applications should be submitted by email to bichler "at" in.tum.de
using the subject line "Application".

Please enclose a curriculum vitae including a complete list of
publications and a sample publication (e.g., a Master's thesis).

The submission deadline is MARCH 21, 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] PhD Position at the University of Hamburg

PhD Position in the "Theory of Efficient Algorithms (TEA)" group of the University of Hamburg

Applications are invited for a fully funded PhD position (TV-L 13) in Theoretical Computer Science at the University of Hamburg, Germany. Research duties will focus on the analysis of efficient approximation and online algorithms as well as on randomized processes. Both classical optimization problems (e.g., scheduling in data centers) and more modern scenarios (e.g., the online exploration of huge networks) will be considered. Candidates are expected to have an excellent background in theoretical computer science and/or discrete mathematics.

For further information, please see the official job advertisement under https://www.uni-hamburg.de/en/uhh/stellenangebote/wissenschaftliches-personal/20-03-08-96en.pdf. Applications should include a cover letter, curriculum vitae, and copies of degree certificate(s). The application deadline is March 20th, 2018. Please send applications per email to peter.kling@uni-hamburg.de.

--
Prof. Dr. Peter Kling
Universität Hamburg
https://academic.pkling.de

[DMANET] Postdoc position in computational geometry at The University of Sydney

Postdoc position in computational geometry at The University of Sydney

We are advertising a 2.5 years (1+1.5) postdoctoral research fellowship in
computational geometry at University of Sydney, Australia.
Expected start date is the 1st of July 2018 (can be negotiated).

The successful applicant will conduct research with Joachim Gudmundsson
and André van Renssen in the Sydney Algorithms and Computing Theory
(SACT) group. The aim will be to design effective algorithms and data
structures in the area of computational movement analysis (funded by the
Australian Research Council).

Collaboration with other members of the SACT group is encouraged.
The SACT group at USyd currently includes Julián Mestre, Lijun Chang,
André van Renssen, William Umboh and Joachim Gudmundsson.

We are looking for outstanding PhD graduates with a track record in
the field of algorithms and data structures, ideally with an emphasis
on computational geometry. Experience in experimental algorithmics is
an advantage but not essential.

Salary Package: AUD 90,276 - AUD 96,905 pa plus superannuation

Please send applications by email to
joachim.gudmundsson@sydney.edu.au, including:
- a letter of application,
- a research statement, and
- a detailed curriculum vitae (incl. contact details for three referees).

Application date (AoE): 31 March 2018.

If you have any questions, you are welcome to mail us directly
(joachim.gudmundsson@sydney.edu.au).

Tuesday, February 27, 2018

[DMANET] Full professor position in data sience / artificial intelligence

Telecom SudParis announces the opening of a full-time faculty position at the level of full professor. Qualified candidates must have an outstanding research record in the field of Data Analytics and/or Artificial Intelligence. The selected person will develop research and teaching activities in this domain, will collaborate with existing research groups of the CNRS lab Samovar, and will be active in fundraising for industrial and governmental projects. He/she will be involved in the graduate level courses of the future university « New Uni », which will bring together Ecole Polytechnique, Ensta, Ensae, Telecom Paristech, and Telecom Sudparis.

The desired candidate should have an outstanding methodological knowledge in data science or/and Artificial Intelligence; in particular, a recognized expertise in one of the following fields

- Machine Learning – statistical learning;

- Deep learning for analyzing 2D and 3D multimedia contents;

- Artificial intelligence, automated reasoning and symbolic computation;

- Data analytics for networks (internet of things, security, etc.)

Candidate applications should include a cover letter, vitae or resume, and at least 2 reference letters. Applications should be sent to

recrutements@tem-tsp.eu no later than March 16th.

All additional information can be obtained from Prof. Walid BEN-AMEUR, Director of the CNRS Las Samovar (walid.benameur@telecom-sudparis.eu).

[DMANET] [CFP]: 13th International Conference on Critical Information Infrastructures Security CRITIS 2018

------------------------------------------------------------------------------
*** Apologies for multiple copies ***

C a l l F o r P a p e r s

13th International Conference on Critical Information Infrastructures
Security CRITIS 2018
Kaunas, Lithuania, September 24-26, 2018

Full-text paper submission due: April 30, 2018

CONFERENCE OUTLINE:

CRITIS 2018 continues the tradition of presenting innovative research
and exploring new challenges in the field of critical (information)
infrastructures protection (C(I)IP), resilience and fostering the
dialogue with stakeholders.

CRITIS 2018 aims at bringing together researchers, professionals from
academia, critical (information) infrastructure operators, industry,
defence sector and governmental organisations working in the field of
the security of critical (information) infrastructure systems.

Moreover, CRITIS aims to encourage and inspire early stage and
open-minded researchers in this demanding multi-disciplinary field of
research. Outstanding research performance demonstrated by young
researchers may compete for the Young CRITIS Award (YCA).

The Projects' Dissemination Session will be an opportunity of
dissemination for ongoing European, multinational, and national
projects, to share the experiences among scientist and experts working
on different projects in the C(I)IP domain.

CRITIS 2018 conference has a special focus on current and future energy
infrastructures within a special session Energy infrastructure operators
and stakeholders: key challenges and solution directions, chaired by
Marcelo Masera (EC Joint Research Centre in Petten, The Netherlands).
Invited speakers will be mainly from European electricity and/or gas
Transmission System Operators (TSO), some representatives from European
electricity and gas Distributed System Operators (DSO), NATO and
European policy-makers.

CRITIS 2018 topics (but not limited to):
http://www.lei.lt/critis2018/call-for-papers.html

Special sessions will be organized by CRITIS 2018 Supporting Chairs:
- "Energy CIP": Marcelo Masera, European Commission, Joint Research
Centre, the Netherlands
- "CI Resilience": Marianthi Theocharidou, European Commission,
Joint Research Centre, Italy
- "Human Factor and CIP": Grigore Havarneanu, UIC, France
- "SCADA Security": Simin Nadjm-Tehrani, Linköping University,
Sweden
- "Modelling and Simulation in CIP": Erich Rome (President 2E!SAC),
Fraunhofer IAIS, Germany
- "Interconnected Infrastructures and Systems of Systems": Enrico
Zio, Politecnico di Milano, Italy and Ecole Centrale Paris, France
- "IoT Security": Sokratis K. Katsikas, NTNU, Norway and University
of Piraeus, Greece

Call for Papers (PDF to download):
http://www.lei.lt/critis2018/assets/critis_2018_call_for_papers.pdf

Accepted papers are to be included to post-proceedings, published by
Springer-Verlag in their Lecture Notes in Computer Science (LNCS)
series.

IMPORTANT DATES:
================

30 April 2018 -- Full-text submission
18 June 2018 -- Notification of acceptance
9 September 2018 -- Camera-ready papers

Programme Chair
================
- Eric Luiijf, TNO (retired) and Luiijf Consultancy, the Netherlands

Steering Committee Chairs
- Bernhard M. Hämmerli, Technical University Lucerne and ACRIS GmbH,
Switzerland
- Javier Lopez, University of Malaga, Spain
- Stephen D. Wolthusen, Royal Holloway, University of London, UK and
NTNU, Norway

Local Co-Chairs
- Inga Žutautaitė, Lithuanian Energy Institute, Lithuania
- Ričardas Krikštolaitis, Vytautas Magnus University, Lithuania

Publicity Chairs
- Cristina Alcaraz, University of Malaga, Spain
- Rolandas Urbonas, Lithuanian Energy Institute, Lithuania

CRITIS 2018 Secretary Office
============================
Lithuanian Energy Institute
Breslaujos g. 3, Kaunas, Lithuania
Tel. +370 37 401948
+370 37 401938
E-mail: critis2018@lei.lt

Conference website: www.lei.lt/critis2018
**********************************************************
*
* 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] IEEE PICom 2018 (Deadline March 30, Best Papers invited for Special Issues of Prestigious Journals)

[Please accept our apologies if you receive multiple copies of this Call
for Papers (CFP).]

=========================CALL FOR PAPERS=============================

IEEE
PICom 2018
The 16th IEEE International Conference on Pervasive Intelligence
and Computing (PICom 2018)
http://cyber-science.org/2018/picom/

Athens, Greece, 12-15
August 2018

Sponsored by IEEE, IEEE Computer Society and IEEE Technical
Committee of Scalable Computing (TCSC)

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

IMPORTANT DATES
===============

Workshop Proposal Due:     Feb. 28, 2018
Regular Paper Submission Due:     Mar. 30, 2018
Wksp/SS/Poster Paper Due:    April 30, 2018
Authors Notification:         May   20, 2018
Camera-ready Submission:     June 15, 2018

INTRODUCTION
=============

Over the last fifty years, computational intelligence has evolved from
logic-based artificial intelligence, nature-inspired soft computing, and
social-oriented agent technology to cyber-physical integrated ubiquitous
intelligence towards Pervasive Intelligence (PI). The International
Conference on Pervasive Intelligence and Computing is intended to cover
all kinds of these intelligent paradigms as well as their applications
in various pervasive computing domains. PICom-2018 is the conference on
Pervasive Intelligence and Computing, previously held as PCC (Las Vegas,
USA, 2003 and 2004), PSC (Las Vegas, USA, 2005), PCAC (Vienna, Austria,
2006, and Niagara Falls, Canada, 2007), IPC-2007 (Jeju, Korea, December
2007), IPC-2008 (Sydney, Australia, December 2008), and since 2009 as
the name PICom. IEEE PICom 2018 will be held on 12-15 August 2018 in
Athens, Greece, co-located with IEEE CyberSciTech 2018, IEEE DASC 2018
and DataCom 2018. It aims to bring together computer scientists and
engineers, to discuss and exchange experimental and theoretical results,
work-in-progress, novel designs, and test-environments or test-beds in
the important areas of Pervasive Intelligence and Computing.

SCOPE AND TOPICS
================

Topics of interests include, but are not restricted to:†

-     Deep Learning and Deep Computation
-     Big Data and Smart Data
-     Brain-inspired Computing
-     Crowd Souring and Intelligence
-     Social Intelligence and Computing
-     Agent-based Computing
-     Ubiquitous Intelligence
-     Cyber-Physical Computing
-     The Internet of Things
-     Cloud of Things and Cloud of Sensors
-     Embedded HW, SW & Systems
-     Pervasive Devices and RFIDs
-     Wearable Devices and Applications
-     Sensor Technology and Networks
-     Pervasive Networks/Communications
-     Edge and Fog Computing
-     Mobile Edge Computing (MEC)
-     Device Virtualization
-     Privacy, Security and Trust
-     Context-Aware Computing
-     Mobile Data Mining
-     Ubiquitous Data Mining
-     Activity Recognition
-     Cloud Computing
-     Services for Pervasive Computing
-     Smart Cities and Smart Homes
-     Intelligent Social Networking
-     Pervasive Technologies for ITS
-     HCI for Pervasive Computing
-     Mobile Data Modeling
-     Middleware for Pervasive Computing
-     Intelligent/Smart IoT
-     Programming Abstractions for IoT
-     Semantic Analysis

PAPER SUBMISSION GUIDELINE
==========================

Authors are invited to submit their original research work that has not
previously been published or under review in any other venue. Papers
should be prepared in IEEE CS Proceedings format and submitted via EDAS
systems (https://edas.info/newPaper.php?c=24494). Research papers should
explore a specific technology problem and propose a complete solution to
it, with experimental results. A regular (full) paper is between 6-8
pages. A WiP, workshop, or special session paper should be between 4-6
pages and a poster paper should be between 2-4 pages. Some papers
originally submitted as full can be accepted as short papers or posters
during the review process. In such cases, the authors will need to
reduce the paper accordingly when preparing the camera-ready version. At
least one of the authors of any accepted paper is requested to register
and present the paper at the conference.

SPECIAL ISSUES
==========================
Extended versions of selected excellent papers will be considered for
fast-track publication in regular or special issues of prestigious
journals. The following journals are already confirmed:

1 - Information Fusion - Elsevier - Impact Factor: 5.667
(https://www.journals.elsevier.com/information-fusion/)
2 - World Wide Web journal - Springer (www.Springer.com/11280 ) -
Special Issue on Smart Computing and Cyber Technology for Cyberization

ORGANISING COMMITTEE
==========================
General Chairs
-Flavia C. Delicato, Federal U of Rio de Janeiro, Brazil
-Nikolaos Doulamis, Nat Tech Univ. of Athens, Greece

General Executive Chairs
-Klimis Ntalianis, Athens U of Applied Sciences, Greece
-Liqiang Wang, University of Central Florida, USA

Program Chairs
-Giancarlo Fortino, University of Calabria, Italy
-Pietro Manzoni, Univ. Politecnica de Valencia, Spain
-Qiang Yang, Zhejiang University, China
-Vana Kalogeraki, Athens U of Economics and Business

Workshop and Special Session Chairs
-Tie Qiu, Dalian University of Technology, China
-Andreas Panayides, University of Cyprus

Publicity Chairs
-Aline Carneiro Viana, INRIA, France
-Kazuaki Tanaka, Kyushu Inst. of Technology, Japan
-Igor dos Santos, Federal U of Rio de Janeiro, Brazil
-Wei Li, University of Sydney, Australia
-Yaoqing Liu, Clarkson University, USA

Local Arrangement Chair
-Nikolaos Mastorakis, Hellenic Naval Academy, Greece

Advisory Committee Chairs
-Samee U. Khan, North Dakota State University, USA
-Constantinos S. Pattichis, University of Cyprus

Steering Committee
-Jianhua Ma, Hosei University, Japan
-Laurence T. Yang, St. Francis Xavier Univ., Canada
-Adnan Al-Anbuky, Auckland U of Tech., New Zealand

[DMANET] Postdoc and PhD positions in Paris

The Algorithms Groups at IBISC, University Paris-Saclay and LIP6, Sorbonne University invite applications for

PhD and Postdoc Positions in Algorithms.

The position for PhD is full-time three year and that for postdoc is full-time one year with possible extension. The starting dates are before September 2018 and can be negotiated. The Algorithms groups in IBISC and LIP6 provides a strong environment and offers many opportunities for collaborations/interaction with researchers in the Paris region, for example DI ENS and IRIF. Applicants should have curiosity and enthusiasm for mathematical problems and strong background in theoretical computer science, in particular in one of the following domains:

* Approximation/Online Algorithms
* Algorithmic Game Theory
* Online Convex Optimization/Machine Learning

All applications should include

* a cover letter describing the interest in the position,
* a detailed CV/resume
* List of publications (PostDocs), or list of courses and grades (PhD students)
* Two or more references.

Interested candidates should send their application to Nguyen Kim Thang <thang@ibisc.fr> via email by March 31, 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] Hurry! A PhD studentship and a KTP position in machine learning/optimization for grabs at the University of Manchester

Dear colleagues,

The Alliance Manchester Business School <https://www.mbs.ac.uk/>(AMBS) at
the University of Manchester (UoM), UK, is looking for a talented MSc and
PhD student or Postdoc to fill two projects in the domain of Machine
Learning and Optimization.

*Position 1:*
- 1 x PhD studentship as part of the UoM's CDT in Data Analytics & Society
- Topic of PhD: Development of an automated data analytics platform for
forensic testing
- Skills required: Knowledge (or keen interest) in explainable AI
solutions, machine learning and optimization
- Industrial partner: Forensic Testing Service http://www.forensic-te
sting.co.uk/ <http://www.forensic-testing.co.uk/>
- Supervisors: Richard Allmendinger and Yu-Wang Chen (AMBS, UoM) and Mark
Burns (Forensic Testing Service)
- Official advert: <http://goog_1931860534/>https://datacdt.org/pr
ojects/mn23/ <https://datacdt.org/projects/mn23/>
- Project start: October 2018
*- Application Deadline: 19 April*

*Position 2:*
- 1 x KTP position (for someone with a PhD) to work for 21 months with
Dream Agility as a Data Scientist
- Topic of project: Develop intelligent bidding algorithms for online
product ads
- Skills required: Knowledge in machine learning and optimization, and good
programming skills
- Industrial partner: Dream Agility https://dreamagility.com/
- Supervisors: Richard Allmendinger (AMBS, UoM), Jon Shapiro (Computer
Science, UoM), Rob Cantrill (Dream Agility)
- Official advert: http://www.jobs.ac.uk/job/BHX175/data-scientist-ktp-
associate-dream-agility-ltd/
<https://outlook.manchester.ac.uk/owa/redir.aspx?C=FcV5WoLYWkdZy94keskak7tK8rMmvQqkhFo9H8oHywfUN44l2H3VCA..&URL=http%3a%2f%2fwww.jobs.ac.uk%2fjob%2fBHX175%2fdata-scientist-ktp-associate-dream-agility-ltd%2f>

- Project start: ASAP
*- Application deadline: 23 March*

If you know of anyone who may be interested in these positions, then please
forward them this email.
I am happy to have a chat about the projects with potential candidates.

Thanks,
Richard

Monday, February 26, 2018

[DMANET] Postdoc Algorithms for Data Tiling

The Center for Computation and Technology of Louisiana State University is looking for a Postdoctoral Researcher in the field of Combinatorial Optimization.

The successful candidate will work under the supervision of Stefan van Zwam on algorithms for automated data tiling in high-performance computing environments. The work forms part of the multidisciplinary project ``Phylanx: A Distributed Array Toolkit.'' See http://phylanx.stellar-group.org <http://phylanx.stellar-group.org/> for more information on the project. The position is initially for one year, and is expected to be renewed for up to three years subject to satisfactory progress and continued project funding. The starting date can be negotiated, but sooner is better.

Required qualifications:
* A PhD in Computer Science or Mathematics with a focus on Combinatorial Optimization or Algorithms.

Desired qualifications:
* Experience with the design of approximation algorithms
* Affinity with applications as well as theory
* A strong publication record
* Ability to work in a large team
* Strong communication skills

Helpful qualifications:
* Knowledge of the computational needs of Big Data applications
* Knowledge of Machine Learning algorithms
* Programming experience in Python and C++
* Experience with High-Performance Computing and/or Cloud Computing

To apply, submit the following:
* A cover letter of no more than 2 pages addressing the qualifications listed above
* A CV including publication record
* At least three letters of recommendation
* One or two representative publications

Link to official ad:
https://lsu.wd1.myworkdayjobs.com/LSU/job/LSU---Baton-Rouge/Postdoctoral-Researcher_R00020744 <https://lsu.wd1.myworkdayjobs.com/LSU/job/LSU---Baton-Rouge/Postdoctoral-Researcher_R00020744>

Review of applications will begin on March 1st, and will continue until the position has been filled. Feel free to contact svanzwam@math.lsu.edu <mailto:svanzwam@math.lsu.edu> (senior researcher) or aserio@cct.lsu.edu <mailto:aserio@cct.lsu.edu> (project manager, CCT contact) with any questions.
**********************************************************
*
* 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 Fellow/Theme Lead in Algorithms and Machine Learning

Dear Colleagues,

Please find the advertisement about an exciting opportunity for
an experienced researcher to lead new research in Algorithms and Machine Learning
within Leverhulme Research Centre in Functional Materials Design at the University of Liverpool.

This research position is for 5 years and could suit to an ambitious scientist
motivated to produce step-change advances in promoting revolutionary
algorithmic ideas into the area of computational chemistry.

Closing Date for applications: 16 March 2018

Best Regards,
Igor Potapov
University of Liverpool
potapov@liverpool.ac.uk

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

Research Fellow/Theme Lead in Algorithms and Machine Learning
for Functional Materials Design

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

Tenure: 5 years
Salary: Depending on qualifications and experience
Range: £33,518 - £38,883 pa (Grade 7) £39,992 - £50,618 pa (Grade 8)
Closing Date for applications: 16 March 2018

This particular post will suit to an ambitious scientist motivated to produce step-change advances in promoting revolutionary algorithmic ideas
in material design and/or machine learning techniques for harnessing exponential knowledge growth.

A 5-year Research Fellow position is available within the £10 M Centre for Functional Materials Design funded by the Leverhulme Trust.
The post will act as a theme leader in the area of algorithms and machine learning for functional materials design.
You should have a PhD in Computer Science, Mathematics, or other relevant discipline with a commitment to developing
collaborative research within or across the academic networks, external partners and stakeholder groups.
Knowledge of the cutting edge of algorithm design and/or machine learning techniques are essential.
Application of such techniques to chemical or materials problems would be an advantage, but we will also
consider applicants with pure Computer Science or Mathematics backgrounds who are keen to apply their knowledge to new problems.

https://www.liverpool.ac.uk/leverhulme-research-centre/research-opportunities-and-training/other-vacancies/

[DMANET] Computational Geometry: Young Researchers Forum -- Second Announcement

Computational Geometry: Young Researchers Forum -- Second Announcement
=====================================================================

The 34th Symposium on Computational Geometry (SoCG) will take place June
11-14, 2018 in Budapest, Hungary. It brings together the global community
of researchers who work on a large variety of aspects that combine
geometry, algorithms and applications. To allow a broad audience to
actively participate in the community's major scientific event, this year
SoCG will again be accompanied by a series of satellite events, which
together constitute "CG Week 2018". See
http://www.renyi.hu/conferences/socg18/ for details.

One of these satellite events will be the "Computational Geometry: Young
Researchers Forum" (CG:YRF), which is aimed at current and recent students.
The active involvement by students and recent graduates in research,
discussions, and social events has been longstanding tradition in the CG
community. Participation in a top-level event such as SoCG can be
educating, motivating, and useful for networking, both with other students
and with more senior scientists.

The YRF presents young researchers (defined as not having received a formal
doctorate before 2016) an opportunity to present their work (in progress as
well as finished results) to the CG community in a friendly, open setting.
Just like in the main event, presentations will be given in the form of
talks. A pre-screening (but no formal review process) will ensure
appropriate quality control.

Submission guidelines:
----------------------
- The idea of the event is for young researchers to present new and ongoing
work. Therefore, the work should not have appeared in print in a formally
reviewed proceedings volume or journal by the time of submission, and at
least one author must be young researcher.
- Topics must fit into the general context of SoCG, as described in the
call for SoCG submissions.
- A submission must be in the form of a 2-page abstract, formatted
according to the same style file as regular SoCG submissions (LIPIcs
typesetting instructions can be found at (
http://www.dagstuhl.de/en/publications/lipics).
- The Easychair submission link is
https://easychair.org/conferences/?conf=cgweek2018
- Accepted abstracts will be compiled in a booklet of abstracts that will
be distributed among the participants; this should not be considered a
formal publication. In particular, participants are encouraged to submit
(an extended version of) their presented work to a conference with formal
proceedings and/or to a journal.
- The work must be presented at CG:YRF by an author who is a young
researcher. Otherwise, it will be removed from the program.

We will employ a two-phase screening process. After the first review phase,
there will be a notification of either rejection (if the result is clearly
out of scope, or technically incorrect), or conditional acceptance,
accompanied with a description of required changes to be made (either with
respect to content or format). In the second phase, we will check whether
the changes have been implemented satisfactorily. The screening process is
intended to ensure the technical quality of the presented work. Submissions
that are not well-written risk rejection, irrespective of correctness.
Authors are strongly encouraged to have their submissions proofread by
their advisor or another experienced scientist.

Important dates (deadlines are 23:59 Anywhere on Earth):
----------------------------------------------------
- March 26, 2018: Deadline for submissions
- April 16, 2018: Notification of conditional acceptance
- April 23, 2018: Deadline for revisions
- April 30, 2018: Notification of acceptance
- June 11-14, 2018: CG-Week 2018

YRF Program Committee
---------------------
Don Sheehy (chair), University of Connecticut
Peyman Afshani, Aarhus University
Chao Chen, CUNY Queens College
Elena Khramtcova, Université Libre de Bruxelles
Irina Kostitsyna, TU Eindhoven
Jon Lenchner, IBM Research, Africa
Nabil Mustafa, ESIEE Paris
Amir Nayyeri , Oregon State University
Haitao Wang, Utah State University
Yusu Wang, The Ohio State University

[DMANET] CfP SoCS 2018: The 11th Annual Symposium on Combinatorial Search

CALL FOR PAPERS SoCS 2018

https://sites.google.com/view/socs18/

IMPORTANT DATES

* Abstract submission: April 29, 2018
* Paper submission: May 1, 2018
* Notification: June 1, 2018
* Symposium: July 14-15, 2018

SUBMISSIONS
Submissions have to be made via EasyChair.
All submissions must be formatted in AAAI Style.
Accepted papers will be included in the SoCS proceedings.

We welcome the following kinds of submissions:

* Original Papers (Long or Short)

Original papers are technical papers that report on substantial research or position papers discussing ideas and concepts related to search. Long papers may be up to 8 pages in length, plus an additional page for references only. Short papers may be up to 4 pages, plus an additional page for references only. Long and short original papers should be new work which has not been published in (nor is currently simultaneously under review at) any other archival publication venue.

* Previously Published Papers

In order to foster the exchange of ideas at SoCS, we encourage authors to submit extended abstracts of papers describing new research which has been published in other venues in the last year. These abstracts may be up to 2 pages, plus an additional page for references only. The abstract should reference the original paper.

TOPICS OF INTEREST
Topics of interest include but are not limited to the following:

* Analysis of search algorithms

* Automated synthesis of lower bounds

* Automatic algorithm selection and parameter tuning

* Bounding and pruning techniques

* Combinatorial puzzles

* Continuous problem solving

* External-memory and parallel search

* Incremental and active learning in search

* Meta-reasoning and search

* Methodology and critiques of current practice

* Model-based search

* Random versus systematic search strategy selection

* Portfolios of search algorithms

* Real-time search

* Search in goal-directed problem solving

* Search space discretization for continuous state-space problems

* Self-configuring and self-tuning algorithms

* Symmetry handling

* Time, memory, and solution quality trade-offs

* Search in big data

* Constraint search

* Search in robotics

* Search-based diagnosis

* Real-life applications

[DMANET] ACM DEBS 2018: Call for Papers (Deadline Extended)

---------------------------------------------------------------------
- Our apologies if you receive multiple copies of this CFP -
- -
- Abstract submission deadline (extended): Mar 2nd, 2018 -
- Full manuscript due (extended): Mar 9th, 2018 -
- Acceptance notification: Apr 17th, 2018 -
---------------------------------------------------------------------

ACM DEBS 2018 — Call for Research Papers

Where: Hamilton, New Zealand
When: 25 - 29 June 2018

Over the past decade, the ACM International Conference on Distributed
and Event-Based Systems (DEBS) has become one of the leading venues for
contributions in the fields of distributed and event-based systems. The
ACM DEBS conference provides a forum dedicated to the dissemination of
original research, the discussion of practical insights, and the
reporting of experiences relevant to distributed systems and event-based
computing. It brings together academia and industry to discuss
innovative technology and exchange ideas.

Scope

The DEBS conference covers topics both in distributed and in event-based
computing. The scope of the conference includes systems dealing with
detecting, processing and responding to events and with massively
distributed middleware and applications. Topics include, but are not
limited to:

1. Models, Architectures and Paradigms: Event-driven architectures,
real-time analytics, complex event processing, event processing in big
data, stream processing, rule-based systems, logic-based event
recognition, event correlation and pattern languages.
2. Middleware infrastructures: Distributed data processing, distributed
programming, federated event-based systems, information-centric
networking, fault tolerance, reliability, availability, and scalability,
as well as cloud, peer-to-peer, ubiquitous and mobile computing.
3. Applications, Experience and Requirements: Use cases and
applications of distributed and event-based systems in various domains
including internet of things, cyber-physical systems, sensor networks,
network monitoring, online machine learning, online graph algorithms,
smart cities, smart grids, finance, healthcare, transportation, and
logistics. Also, relevant topics span enterprise-level computing,
including enterprise application integration, real-time enterprises,
event-based business process management, and support for enterprises to
respond in timely fashion to changing situations.

Important Dates

- Abstract submission for research track: Mar 2nd, 2018
- Research paper submission: Mar 9th, 2018
- Research paper notification: Apr 17th, 2018
- Conference: Jun 25th–29th, 2018

Submissions

All submissions must be original and unpublished. Accepted papers will
be published by ACM and disseminated through the ACM Digital Library.
Note that the proceedings will be available prior to the conference, and
that the official publication date is the date the proceedings appear in
the ACM Digital Library. This date may be up to two weeks prior to the
first day of the conference. The official publication date affects the
deadline for any patent filings related to published work.

The conference adopts a double-blind review process for the research
track, where neither authors nor reviewers know each other's identities.
This means that papers must not list or otherwise identify the authors.
References to previous work should be done in the third person so as to
not reveal the identities of the authors. Research track submissions
that are not anonymous may be rejected without review.

Research Track papers must be no longer than 12 pages. The authors of
accepted papers will be given a choice between different copyright
agreements, in accordance with the recent changes in the ACM policy. The
options will include new opportunities for open access as well as the
traditional ACM copyright agreement. Further information about the
submissions will be posted on the conference website: http://debs.org/2018

Organizers

General Co-Chairs:

Annika Hinze, University of Waikato
David Eyers, University of Otago

Program Committee Co-Chairs:

Martin Hirzel, IBM T.J. Watson
Matthias Weidlich, Humboldt-Universität zu Berlin

Sunday, February 25, 2018

[DMANET] Deadline approaching --- March 5 --- EURO 2018 in Valencia

Deadline approaching: March 5

EURO 2018 - 29th European Conference on Operational Research, Valencia, Spain, July 8-11, 2018 ( [ http://www.euro2018valencia.com/ | http://www.euro2018valencia.com/ ] )

Abstract submission ( [ https://www.euro-online.org/conf/euro29/ | https://www.euro-online.org/conf/euro29/ ] )

The Program and Organization Committees, chaired by Greet Vanden Berghe , Rubén Ruiz and Ramón Álvarez-Valdés , are preparing a high-quality scientific program and an exciting social program.

They cordially welcome you to submit your valuable abstract at your earliest convenience , as the deadline is getting close.

Plenary Speakers:

Cynthia Barnhart - Chancellor of the Massachusetts Institute of Technology and IFORS Distinguished Lecturer ( [ https://cee.mit.edu/people_individual/cynthia-barnhart/ | https://cee.mit.edu/people_individual/cynthia-barnhart/ ] )

Roger Z. Ríos-Mercado - Professor of Operations Research, Universidad Autónoma de Nuevo León (UANL), México ( [ http://yalma.fime.uanl.mx/~roger/work/index.html | http://yalma.fime.uanl.mx/~roger/work/index.html ] )

Gerhard Woeginger - Professor at RWTH Aachen University, Chair of the Algorithms and Complexity Group ( [ https://algo.rwth-aachen.de/~woeginger/ | https://algo.rwth-aachen.de/~woeginger/ ] )

BQ_BEGIN

Keynote Speakers :

Carol Alexander - University of Sussex

Maria Antónia Carravilla - University of Porto

Elaine Chew - Queen Mary University of London

Santo Fortunato - Indiana University

Patrick Jaillet - MIT

Pinar Keskinocak - Georgia Tech

David Matchar - Duke-NUS Medical School

Dolores Romero Morales - Copenhagen Business School

Anita Schöbel - Universität Göttingen

Tamás Terlaky - Lehigh University

Iris Vis - University of Groningen

BQ_END

BQ_BEGIN

Various enrichments to the program can be found at [ http://www.euro2018valencia.com/ | http://www.euro2018valencia.com/ ] .

CALL FOR PAPERS AND SESSIONS:
=============================

Invited and contributed papers will be organized in Sessions . In general, sessions will be a part of Streams , grouped in 25 Main Areas , which you may find at [ http://euro2018valencia.com/streams_and_areas/ | http://euro2018valencia.com/streams_and_areas/ ] . Each participant may present max. 1 paper at EURO 2018.

Abstract submission system : [ https://www.euro-online.org/conf/euro29/ | https://www.euro-online.org/conf/euro29/ ] . Abstracts: max. 1500 characters; submission deadline: March 5, 2018 .

MAKING AN IMPACT:
==================

It includes a wide variety of sessions aimed at helping practitioners to do a better job. It is organized by the EURO Working Group on Practice of OR, the network for OR practitioners in industry, consultancy, government and beyond. It will be packed with opportunities to:

*Explore the challenges every practitioner faces, and share solutions, *Try out new techniques – are they any good for you,

*See case studies showcasing important applications, *Exchange ideas and expertise with people in similar fields,

*Meet leading academics and discover what they can do for you – and what you can do for them, *Build your network among like-minded professionals

( [ http://euro2018valencia.com/making-an-impact/ | http://euro2018valencia.com/making-an-impact/ ] ).

IMPORTANT DATES:
=================

Abstract Submission deadline: Monday, March 5, 2018

Early registration deadline: Friday, April 6, 2018
Author registration deadline: Friday, April 20, 2018

REGISTRATION FEES:
===================

Regular: 400 EUR (early); 500 EUR (late),
Student/Retired: 200 EUR (early); 300 EUR (late).
Accompanying persons: 125 EUR.

Early registration ends April 6, 2018.

Please note that the Conference Gala Dinner on Tuesday is not included in the registration fee (75 EUR).

Registration: online via [ http://euro2018valencia.com/registration/ | http://euro2018valencia.com/registration/ ] .

We look forward to welcoming you to our very exciting conference in beautiful and hospitable Valencia!

Greet Vanden Berghe, Ramón Álvarez-Valdés and Rubén Ruiz

CONFERENCE SECRETARIAT:
Address: Plaza Virgen de la Paz, 3, 46001, Valencia, Spain
Phone: (+34) 963 262 600
Email: [ mailto:euro2018valencia@upv.es | euro2018valencia@upv.es ]
>From Monday to Friday 9:00-15:00 CEST

BQ_END

[DMANET] registration and accommodations for AofA 2018

Dear Colleagues:

The website for the 29th International Conference on Probabilistic,
Combinatorial, and Asymptotic Methods for the Analysis of Algorithms
(AofA 2018), which will take place June 25-29, 2018, in Uppsala, Sweden,
is now up and running at

http://www.math.uu.se/AofA2018/ .

Book now! The cost of registration goes up after April 24, and booking
codes for conference rates at convenient hotels expire as early as April
29.

See you in Uppsala!,

Jim Fill (Program Chair)

--
*****************************************
*James Allen Fill*
(Jim Fill)

Professor of Applied Mathematics and Statistics
Professor of Computer Science
The Johns Hopkins University
Department of Applied Mathematics and Statistics
3400 N. Charles St.
Baltimore, MD 21218-2682

email: jimfill@jhu.edu <mailto:jimfill@jhu.edu>
Web: http://www.ams.jhu.edu/~fill/ <http://www.ams.jhu.edu/%7Efill/>

[DMANET] Three postdoc positions in Algorithmic Game Theory at the University of Oxford

Dear colleagues,

I am looking for three postdocs to join the ERC project "Algorithms, Games, Mechanisms, and the Price of Anarchy" (ALGAME) at the University of Oxford. The posts start as soon as possible and end on 31 March 2019.

The project covers many areas within the field of algorithmic game theory and consists mainly of three intertwined research strands: algorithmic mechanism design, price of anarchy, and online algorithms. The postdocs will be involved in expanding the current research on mechanism design, game-theoretic issues of blockchains, price of anarchy, and quantifying the effects of mechanisms on the society of players.

For more information please contact Elias Koutsoupias elias@cs.ox.ac.uk.

Details and application form at
http://www.cs.ox.ac.uk/news/1473-full.html
http://www.cs.ox.ac.uk/news/1474-full.html

There are two levels: Research Associate and Senior Research Associate.
Fresh PhDs should apply for the first level and everybody else for both levels.

Deadline for applications: 26 March 2018 at 12 noon.

—
Elias Koutsoupias
Professor of Computer Science, University of Oxford

[DMANET] The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)

WPDM 2018

The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)
http://sara.unisalento.it/~cafaro/WPDM2018/

CALL FOR PAPERS

As part of The 18th International Conference on Computational Science and Its Applications (ICCSA 2018), http://www.iccsa.org

July 2 - 5 2018, Melbourne, Australia

Submission Deadline: March 8, 2018

SPECIAL ISSUE

Selected extended versions of workshop papers will be invited to a Special Issue to appear in the Algorithms journal (see http://www.mdpi.com/journal/algorithms/special_issues/Parallel_Distributed_Data_Mining)

SCOPE AND OBJECTIVES

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

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

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

INSTRUCTIONS FOR PAPER SUBMISSIONS

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

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

CONFERENCE POLICY

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

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

IMPORTANT DATES

March 8, 2018: Deadline for paper submission
April 8, 2018: Notification of Acceptance.
May 6, 2018: Early-bird Registration ends.
May 6, 2018: Submission deadline for the final version of the Papers
July 2-5, 2018: ICCSA 2018 Conference

WORKSHOP ORGANIZERS

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

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

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

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

International Program Committee:

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

Gianfranco Bilardi, University of Padova, Italy
Matteo Ceccarello, University of Padova, Italy
Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Giuseppe Di Fatta, University of Reading, UK
Ann Gordon-Ross, University of Florida, USA
Giuliano Laccetti, University of Naples, Italy
Pablo Moscato, University of Newcastle, Australia
Mitsunori Ogihara, University of Miami, USA
Takahiko Shintani, University of Electro-Communications, Japan
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA

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

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

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

[DMANET] [AHPAMA2018] Deadline Extension

[AHPAMA2018] Deadline Extension

1st International Workshop on
Advances in High-Performance Algorithms Middleware and Applications
http://sara.unisalento.it/~cafaro/AHPAMA2018/

Held in conjunction with the the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2018), Washington, DC, USA May 1-4 2018

NEW DEADLINE: February 28, 2018

The Workshop on Advances in High-Performance Algorithms Middleware and Applications is an international forum which brings together researchers and practitioners working on different high-performance aspects of algorithms, middleware and technologies enabling novel applications. Middleware technologies include tools to assemble together different resources such as parallel supercomputers, data archives, high-speed storage systems, advanced visualization devices and scientific instruments using high speed networks connecting geographically distributed devices and organizations. Many recent international efforts are actively fostering the development of such applications and technologies. The Workshop will allow exchanging ideas and results related to on-going research, focusing on high-performance aspects of algorithms and applications.

Creating breakthrough parallel algorithms for high-performance applications requires addressing several key computing problems which may lead to novel solutions and new insights in interdisciplinary applications. The focus of the workshop is on all forms of advances in high-performance algorithms middleware and applications, and related topics. For example, the following topics are relevant to the workshop:

- Scalable message-passing parallel algorithms using MPI
- Scalable shared-memory parallel algorithms using OpenMP
- GPGPU parallel algorithms using OpenCL or CUDA
- Green High-Performance Computing
- Exploiting modern parallel architectures including FPGA, many-cores and multi-cores for parallel applications
- Middleware for high-performance computing
- Benchmarking and performance studies of high-performance applications
- Novel programming paradigms to support high-performance computing
- Performance models for high-performance applications and middleware
- Efficient job scheduling for high-performance applications
- Performance-aware resource reservation
- Security-related performance issues
- Programming models, tools, and environments for high-performance computing
- Caching, streaming, pipelining, and other optimization techniques for data management in high-performance computing
- Peer-to-peer systems for high-performance grid and cloud environments
- Optimization techniques for mobile grids

Submission Guidelines

The results presented in the paper must be unpublished and not submitted for publication elsewhere, including the proceedings of other conferences or workshops. Papers will be peer-reviewed by at least three reviewers. Papers are evaluated with respect to originality, significance, clarity, and technical soundness. One author of each accepted paper will be expected to present the paper at the workshop. Authors are invited to submit papers electronically in PDF format. Submitted manuscripts should be structured as technical papers and may not exceed 10 letter-size (8.5 x 11) pages including all figures, tables and references using the IEEE format for conference proceedings. Papers need to be submitted through Easy Chair following this link: https://easychair.org/conferences/?conf=ahpama1

Important Dates

Paper submission: February 28, 2018
Author notification: March 7, 2018
Camera ready: March 15, 2018
Workshop: May 1-4, 2018

Workshop Organizers

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

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

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

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

Program Committee

Clemente Galdi, University of Naples Federico II, Italy
Giuliano Laccetti, University of Naples Federico II, Italy
Barbara Masucci, University of Salerno, Italy
Umberto Ferraro Petrillo, University of Rome La Sapienza, Italy
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Francesco Versaci, CRS4, Italy
Laurence T. Yang, St. Francis Xavier University, Canada

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

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

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

Theory Announcements

Wednesday, February 28, 2018

[DMANET] 30th Cumberland Conference

[DMANET] CfP: 8th Workshop on Evolutionary Computation for the Automated Design of Algorithms (ECADA) @ GECCO 2018

[DMANET] Research Associate position in Text Mining and Information Retrieval, Univ. of Nottingham, UK

[DMANET] Postdoctoral position at INRIA Lille - Nord Europe

[DMANET] Postddoc position INRIA Lille- INOCS; Application of Stackelberg games to avoid fare evasion

[DMANET] PhD or Postdoc positions at the Technical University of Munich

[DMANET] PhD Position at the University of Hamburg

[DMANET] Postdoc position in computational geometry at The University of Sydney

Tuesday, February 27, 2018

[DMANET] Full professor position in data sience / artificial intelligence

[DMANET] [CFP]: 13th International Conference on Critical Information Infrastructures Security CRITIS 2018

[DMANET] [CFP] IEEE PICom 2018 (Deadline March 30, Best Papers invited for Special Issues of Prestigious Journals)

[DMANET] Postdoc and PhD positions in Paris

[DMANET] Hurry! A PhD studentship and a KTP position in machine learning/optimization for grabs at the University of Manchester

Monday, February 26, 2018

[DMANET] Postdoc Algorithms for Data Tiling

[DMANET] Research Fellow/Theme Lead in Algorithms and Machine Learning

[DMANET] Computational Geometry: Young Researchers Forum -- Second Announcement

[DMANET] CfP SoCS 2018: The 11th Annual Symposium on Combinatorial Search

[DMANET] ACM DEBS 2018: Call for Papers (Deadline Extended)

Sunday, February 25, 2018

[DMANET] Deadline approaching --- March 5 --- EURO 2018 in Valencia

[DMANET] registration and accommodations for AofA 2018

[DMANET] Three postdoc positions in Algorithmic Game Theory at the University of Oxford

[DMANET] The Second International Workshop on Parallel and Distributed Data Mining (WPDM 2018)

[DMANET] [AHPAMA2018] Deadline Extension

Mailing Lists

Search This Blog

Blog Archive

Wednesday, February 28, 2018

Tuesday, February 27, 2018

Monday, February 26, 2018

Sunday, February 25, 2018

Mailing Lists

Subscribe To

Search This Blog

Blog Archive