Friday, December 14, 2018

[DMANET] DICE-FOPARA 2019: Call for Papers

CALL FOR PAPERS

DICE-FOPARA 2019
Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis

6-7 April 2019, Prague; Satellite event of ETAPS 2019

https://conf.researchr.org/track/etaps-2019/dice-fopara-2019-papers

** OBJECTIVES **
The joint DICE-FOPARA workshop provides synergies by combining two complementary communities:
The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. Several approaches have been explored for that purpose, such as restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs.
The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice.
The joint DICE-FOPATA workshop at ETAPS 2019 follows the successful experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and ETAPS 2017 in Uppsala.

** TOPICS **
The joint workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice.
Areas of interest to the workshop include, but are not limited to, the following:
- type systems for controlling/inferring/checking complexity;
- logical and machine-independent characterisations of complexity classes;
- programming languages for complexity-bounded computation;
- logics closely related to complexity classes;
- theoretical foundations of program complexity analysis;
- static resource analysis and practical applications;
- resource analysis by term and graph rewriting.
- semantics of complexity-bounded computation;
- applications of implicit complexity to security;
- termination and resource analysis for probabilistic programs;
- semantic methods to analyse resources, including quasi-interpretations;
- practical applications of resource analysis;

** SUBMISSIONS **
We ask for submission of regular papers describing original work (up to 15 pages) or extended abstracts (up to 5 pages) presenting already published work or work in progress.
With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been already published, nor is presently submitted, elsewhere. With respect to submissions of extended abstracts, the goal is to provide a forum for discussing work in progress, but presentations of already published results are also welcome, provided those are within the scope of the workshop and potentially give rise to lively discussions during the meeting.
A special issue of an international journal devoted to the joint workshop may be proposed. In this case, the CFP will be posted after the workshop and will be open to long versions of papers presented at this venue, as well as other submissions relevant to the scientific scope.

Papers must be prepared using the LaTeX EPTCS style (http://style.eptcs.org/). Papers should be submitted electronically via the easychair submission page:
https://easychair.org/conferences/?conf=dicefopara2019

** IMPORTANT DATES **
Paper Submission -- January 31st, 2019
Author Notification -- February 21st, 2019
Final Version -- February 28th, 2019
Workshop -- April 6th and 7th, 2019

** PROGRAM COMMITTEE **
Chairs:
Steffen Jost, LMU, Munich, DE
Thomas Seiller, CNRS, LIPN, Villetaneuse, FR

Progam Committee:
Robert Atkey, University of Strathclyde, Glasgow, UK
Martin Avanzini, INRIA, Sophia Antipolis, FR
Lennart Beringer, Princeton University, US
Ezgi Cicek, Facebook, London, UK
Lukasz Czajka, TU Dortmund, DE
Ankush Das, Carnegie Mellon University, Pittsburgh, US
Hugo Feree, University of Kent, UK
Samir Genaim, Universidad Complutense de Madrid, ES
Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh, UK
Joanna Ochremiak, University of Cambridge, UK
Romain Pechoux, Université de Lorraine, FR
Paolo Pistone, Universität Tübingen, DE
Pedro Vasconcelos, University of Porto, PT
Margherita Zorzi, Università degli Studi di Verona, 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] CFP workshop on combinatorial optimization and environment modelling

Call for Papers

11th International Workshop on Computational Optimization (WCO19)
Leipzig, Germany, September 1-4, 2019

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2019

IEEE CS is a technical co-sponsor of FedCSIS 2019

https://fedcsis.org/2019/wco

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

We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:

* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods
*numerical and heuristic methods for modeling

The applications of interest are included in the list below, but are
not limited to:

* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.
*environment modeling and optimization
===============================

Best paper award

The best WCO18 paper will be awarded during the social dinner of FedCSIS2018.
The best paper will be selected by WCO19 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.

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

Submission and Publication

* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Communication and Position papers will only
appear in the conference proceedings).
* Extended versions of selected papers presented at WCO18 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.

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

Important dates:

Paper submission (sharp / no extensions) : May 14th, 2019
Position paper submission : June 4th, 2019
Author notification : June 25th, 2019
Final paper submission and registration : July 10, 2019
Conference date : September 1-4, 2019

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

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania

If you have any question do not hesitate to send an email to :
wco2019@fedcsis.org

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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 application of metaheuristics to large scale problems

Dear Colleague,

On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 13th International Conference on Large
Scale Scientific Computation - LSSC'19, June 10 - 14, 2019, Sozopol,
Bulgaria, with arrival: June 9 and departure: noon June 14.

The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Topics

The list of topics includes, but is not limited to:

combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc

Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).

Important deadlines
Deadline for submission of abstracts
January 15, 2019
Notification of acceptance of the talks on the basis of the
submitted abstract
January 31, 2019
Deadline for registration
February 15, 2019
Deadline for submission of full papers
March 01, 2019
Notification of acceptance of full papers
April 15, 2019


Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.

Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom19/


Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* 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] Head of School in Computer Science and Engineering, UNSW Sydney, Australia

UNSW Sydney is recruiting a Head of School for the School of Computer
Science & Engineering.
This is a continuing position, normally at the level of professor.

Announcement:
http://external-careers.jobs.unsw.edu.au/cw/en/job/495688/head-of-school-cse
Apply before Friday, 18 Jan 2019.

--
Serge Gaspers | ARC Future Fellow & Associate Professor
Associate Head of School (Research)
Head of the Algorithms group
School of Computer Science and Engineering, UNSW Sydney
T +61 2 9385 6934 | E sergeg@cse.unsw.edu.au

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

Thursday, December 13, 2018

[DMANET] PhD Student Position in Machine Learning

At the Tampere University of Technology (Finland) is a PhD position
available in the Predictive Medicine and Data Analytics Lab headed by
Prof Frank Emmert-Streib.



The position is funded for three years (1 + 2 years) in the area of data
science.



Requirements:


· MSc in Computer Science or related field


· Very good grades


· good understanding of machine learning and/or statistics


· very good programming skills (if possible in R)


· very good presentation skills


· excellent communication skills in English


· self-motivated


· attentive to details



Project:


The project will develop new methodology for prostate cancer by
combining methods from text mining and network analysis. For this we
will use existing data to extract meaningful information.



The position requires to give some lectures in machine learning to
students (5% of total time).



Interested individuals should contact Prof. Dr Frank Emmert-Streib
(frank.emmert-streib@tut.fi)

**********************************************************
*
* 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] SIROCCO 2019 - Preliminary Call for Papers

SIROCCO 2019 - Preliminary Call for Papers

26th International Colloquium on Structural Information and
Communication Complexity (SIROCCO 2019)

http://cs.gssi.it/sirocco2019

July 1-4, 2019, L'Aquila, Italy

OVERVIEW. SIROCCO is devoted to the study of the interplay between
structural knowledge, communication, and computing in decentralized
systems of multiple communicating entities. Special emphasis is given to
innovative approaches leading to better understanding of the
relationship between computing and communication. SIROCCO has a
tradition of interesting and productive scientific meetings in a relaxed
and pleasant atmosphere, attracting leading researchers in a variety of
fields in which communication and knowledge play a significant role.
This year, SIROCCO will be held in L'Aquila, a beautiful historical city
in the mountain side, 100km away from Rome.

SCOPE. Original papers are solicited from all areas of study of local
structural knowledge, global communication, and computational
complexities. Among the typical areas are distributed computing,
communication networks, game theory, parallel computing, social
networks, mobile computing (including autonomous robots), peer to peer
systems, communication complexity, fault tolerant graphs, and
probability in networks. Keeping up with the tradition of SIROCCO, new
areas are always welcome.

SUBMISSIONS. Papers are to be submitted electronically through EasyChair
at the following link: https://easychair.org/conferences/?conf=sirocco2019.

Authors are invited to submit their work in one of the two acceptable
formats: regular papers and brief announcements. First, abstracts should
be registered and later the full papers are due. A regular submission
must report on original research and must contain results that have not
previously appeared, and have not been concurrently submitted to a
journal or a conference with published proceedings. It must be no longer
than 12 single-column pages on letter-size paper using at least 11-point
font, including tables and references. Up to 4 additional pages of
figures may be included with the submission. Additional details may be
included in a clearly marked appendix, which will be read at the
discretion of the program committee. Full Proofs omitted for lack of
space should appear in an appendix.

A submission for a brief announcement must be no longer than 3
single-column pages on letter-size paper using at least 11-point font.
The title of a submission for a brief announcement must begin with
"Brief announcement:". Such submissions may describe work in progress or
work presented elsewhere. A submission that is not selected for regular
presentation may be invited for a brief announcement.

PUBLICATION. Regular papers and brief announcements will be included in
the conference proceedings that will be published by Springer. Regular
papers receive up to 15 pages, brief announcements receive up to 2
LNCS-style pages.

BEST STUDENT PAPER AWARD. A prize will be given to the best student
regular paper. A paper is eligible if at least one author is a full-time
student at the time of submission, and the contribution of the student
is significant. This must be noted on the cover page. The program
committee may decline to give the award or may split it.

KEY DATES (all in 2019)
Abstract registration: April 1
Full paper submission: April 7
Notification: May 17
Proceedings version: TBD
Early registration: June 1

PROGRAM COMMITTEE
Dan Alistarh, IST Austria, Austria
James Aspnes, Yale University, USA
Alkida Balliu, Aalto University, Finland
Vittorio Bilò, University of Salento, Italy
Lelia Blin, Sorbonne University, France
Ioannis Caragiannis, University of Patras, Greece
Keren Censor-Hillel, Technion, Israel (co-chair)
Michele Flammini, GSSI & University of L'Aquila, Italy (co-chair)
Luisa Gargano, University of Salerno, Italy
Chryssis Georgiou, University of Cyprus, Cyprus
Magnús Halldórsson, Reykjavik University, Iceland
Tomasz Jurdzinski, University of Wroclaw, Poland
Fabian Kuhn, University of Freiburg, Germany
Toshimitsu Masuzawa, Osaka University, Japan
Alessia Milani, University of Bordeaux, France
Ivan Rapaport, Universidad de Chile, Chile
Dror Rawitz, Bar-Ilan University, Israel
Mordechai Shalom, Tel-Hai College, Israel
Jennifer Welch, Texas A&M University, USA
Prudence W.H. Wong, University of Liverpool, UK
Yukiko Yamauchi, Kyushu University, Japan

ORGANIZING COMMITTEE
Guido Proietti, University of L'Aquila, Italy (chair)
Gianlorenzo D'Angelo, GSSI, Italy
Mattia D'Emidio, University of L'Aquila, Italy
Michele Flammini, GSSI & University of L'Aquila, Italy
Luciano Gualà, University of Rome Tor Vergata, Italy
Ludovico Iovino, GSSI, Italy
Cosimo Vinci, University of L'Aquila, Italy

STEERING COMMITTEE
Shantanu Das, Aix-Marseille University, France
Rastislav Kralovic, Comenius University, Slovakia
Zvi Lotker, Ben Gurion University, Israel
Boaz Patt-Shamir, Tel Aviv University, Israel
Andrzej Pelc, University of Québec, Canada
Nicola Santoro, Carleton University, Canada
Sebastien Tixeuil, University Paris 6, France
Jukka Suomela, Aalto University, FInland
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, December 12, 2018

[DMANET] The 7th Gdańsk Workshop on Graph Theory [CFP]

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

THE SEVENTH GDAŃSK WORKSHOP ON GRAPH THEORY

July 1-5, 2019

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

Dear Colleagues,

We cordially invite you to attend the 7th GDAŃSK WORKSHOP ON GRAPH THEORY
that will take place on July 1-5 (2019) on the Sobieszewo Island, an island
on the Baltic sea between the Gdańsk Bay and the delta of Vistula river.
Apart from bringing together researchers in the area of graph theory and
combinatorics, during this edition we shall also celebrate the 70th Birthday
of prof. Jerzy Topp.

INVITED SPEAKERS

Csilla Bujtás /Hungary/
Douglas F. Rall /USA/
Eduardo Rivera-Campo /Mexico/
Andrzej Ruciński /Poland/
Carlos Seara /Spain/
Maciej Sysło /Poland/

DEADLINE for early registration: March 1, 2019

Please visit the conference web page http://www.gwgt.mif.pg.gda.pl for
other details and feel free to pass this announcement on to anyone you
think might be interested in.

ACCOMPANYING EVENT

Just after the workshop, on July 6-12 (2019), Department of Algorithms
and Systems Modeling of the ETI Faculty at the Gdańsk University of
Technology organizes the next edition of Gdańsk Summer School of Advanced
Science on Algorithms for Discrete Optimization, see
https://eti.pg.edu.pl/advanced-science-on-algorithms/advanced-science
for more details.


Best regards,
Pawel Zylinski
GWGT Team

--------------------------------------------------------------------------
The 7th Gdańsk Workshop on Graph Theory
http://www.gwgt.mif.pg.gda.pl
--------------------------------------------------------------------------

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

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

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

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

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


Special Issue Information

Dear Colleagues,

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

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

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

Manuscript Submission Information

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


Special Issue Editors

Guest Editor
Assoc. Prof. Massimo Cafaro

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

Guest Editor
Dr. Italo Epicoco

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

Guest Editor
Dr. Marco Pulimeno

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

Guest Editor
Prof. Giovanni Aloisio

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

-

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

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

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

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

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

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

WPDM 2019


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

CALL FOR PAPERS

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


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


Final submission Deadline: February 17, 2019


SCOPE AND OBJECTIVES

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

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

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

INSTRUCTIONS FOR PAPER SUBMISSIONS

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

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


CONFERENCE POLICY

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

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

IMPORTANT DATES

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


WORKSHOP ORGANIZERS

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

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

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

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


International Program Committee:

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


-

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

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

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

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

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

[DMANET] Postdoctoral Position in Discrete Mathematics - University of Munich

Dear colleagues,

one postdoctoral position is available at the Institute for Mathematics,
University of Munich, Germany. The position is funded by the ERC grant
PTRCSP and additional funding from the university. All candidates
working in discrete mathematics, in particular in random graphs or
probabilistic combinatorics, are welcome to apply. The starting date is
flexible.

The position is available for a maximum of 4 years and comes with a
teaching duty of 2 hours. Funds for travel and other research expenses
are available. The gross monthly salary starts at 3850 EUR.


The application documents (CV, publication list, list of references)
should be submitted in one PDF file per email to Konstantinos Panagiotou
<kpanagio@math.lmu.de>.


Sincerely,

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

Tuesday, December 11, 2018

[DMANET] Postdoc position at FU Berlin (full research position)

Starting date
As soon as possible (earliest starting date March 1, 2019)

Duration
Until June 30, 2020

Research area
The successful candidate will support the research of Project A03 'Geometric Constraints on Polytopes' within the collaborative research centre SFB/TRR 109 'Discretization in Geometry and Dynamics' ( http://www.discretization.de ) funded by DFG. The objective of Project A03 is to study the interaction between geometric properties of convex polytopes and their combinatorial data.

Requirements
The applicant should have a PhD in mathematics and should possess solid skills and research experience relevant for the project (discrete geometry with further connections to Geometry/Discrete Mathematics/Topology/Numerics). Willingness to collaborate and to work in a team. Programming experience is an asset.

Application
The application, including cover letter, CV and a research statement (1-2 pages) should be submitted as PDF (one file) and at least two letters of recommendation should be arranged. Applicants are asked to send their application electronically to Prof. Rainer Sinn via pose@math.fu-berlin.de and use 'SFB_TPA03_2019' as subject.

Deadline for application: December 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/
*
**********************************************************

Monday, December 10, 2018

[DMANET] Tenure track position at Dalhousie University

The department of Mathematics and Statistics of Dalhousie University is advertizing a tenure track position in Combinatorics, Algebra or Analysis. This is a restricted search; the position is part of a campaign to increase diversity in the university. For more details, see

https://blogs.dal.ca/academiccareers/files/2018/12/3339-Math-Stats.pdf


**********************************************************
*
* 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 computational geometry in Prague

Two postdoc positions are available at the Institute of Computer Science of
the Czech Academy of Sciences.

The positions are for the period April 2019 to June 2020, with the
possibility of renewal until December 2021 (starting date is negotiable).
Research will be conducted within the project "Structural properties of
visibility in terrains and farthest color Voronoi diagrams", funded by the
Czech Science Foundation. The PI of the project is Maria Saumell.

The position comes with a gross salary of 44000 CZK/month which is quite
above the average salary in Prague. Additionally, there is support for
travel. There are no teaching duties. The successful candidates would also
have the possibility to join the RISE project CONNECT (
https://www.connect-rise.eu/).

The candidates should have strong background in discrete and computational
geometry. The age limit is 35 years excluding maternity and parental leave,
and sick leave in the case of a long-term illness.

Prague is a vibrant, multicultural and beautiful city. It offers a great
quality of life and benefits from a strategic location in the heart of
Europe.

To apply, please send a cover letter, your CV, and a proof of education to
ics@cs.cas.cz. Additionally, please arrange for two reference letters to be
sent to the same address. The closing date is January 18, 2019.

Informal inquiries are welcome and can be sent to maria.saumell.m@gmail.com

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

[DMANET] CfP MAPSP 2019

MAPSP 2019 - Second Call for Papers

14th Workshop on Models and Algorithms for Planning and Scheduling Problems

June 2-7 June, 2019
Renesse, the Netherlands
http://sbe.maastrichtuniversity.nl/mapsp2019/
Contact: mapsp2019-sbe@maastrichtuniversity.nl

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

MAPSP is a biennial workshop dedicated to all theoretical and practical
aspects of scheduling, planning, and timetabling.

The 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2019) will be organized in Hotel "De Zeeuwse Stromen" in Renesse. It will take place in the week of 2-7 June 2019. Renesse is a village on the isle of Schouwen-Duiveland in the province Zeeland of the Netherlands. The hotel is a short walk from the beach.

The program will consist of invited plenary lectures and shorter
contributed talks. The confirmed invited speakers are:

Mike Bender (Stony Brook University)
Neil Olver (Free University of Amsterdam)
Aravind Srinivasan (University of Maryland)

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

Submissions:

MAPSP submissions undergo a selection process based on a light
refereeing by the Program Committee. MAPSP does not publish proceedings
other than a conference booklet (no ISSN). Hence, presenting your paper
at MAPSP will not prevent you from submitting it to journals or to other
conferences. Similarly, it is acceptable to submit a paper that was
presented at an earlier conference. To make the refereeing process easier, you are requested to indicate whether, and if so, where your paper has been previously published.

Abstracts of 2-3 pages must be submitted using EasyChair according to
the guidelines at http://sbe.maastrichtuniversity.nl/mapsp2019/

Submission Link: https://www.easychair.org/conferences/?conf=mapsp2019

We intend to publish a special issue of the Journal of Scheduling for which we invite some of the contributions presented at the workshop. Papers submitted for this special issue will undergo the usual reviewing process of Journal of Scheduling.

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

Important dates:

Submissions: January 25, 2019
Notification: 8 March, 2019
Early registration: mid April, 2019
Conference: June 2-7, 2019

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

The program committee:

Kunal Agrawal (Washington University, USA),
Syamantak Das (IIIT Delhi, New Delhi, India),
Jian-Jia Chen (Dortmund University, Germany),
Jeremy Fineman (Georgetown University, USA),
Bala Kalyanasundaram (Georgetown University, USA),
Samir Khuller (Chair) (University of Maryland, USA),
Peter Kling (University of Hamburg, Germany),
Sigrid Knust (University of Osnabrück, Germany),
Amit Kumar (IIT New Delhi, India),
Shi Li (University at Buffalo, USA),
Benjamin Moseley (Carnegie Mellon University, USA),
Barna Saha (University of Massachusetts, USA),
Leen Stougie (CWI, the Netherlands),
Tami Tamir (The Interdisciplinary Center, Herzliya, Israel),
Nguyen Kim Thang (University Evry Val d'Essonne, France),
Tjark Vredeveld (Maastricht University, the Netherlands).

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

Organization: Andre Berger, Rene Sitters, Leen Stougie, Tjark Vredeveld, Nikhil Bansal, Han Hoogeveen, Johann Hurink, Steef van de Velde


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

[DMANET] Final CfP: CSR 2019 (14th International Computer Science Symposium in Russia, July 1-5, 2019, Novosibirsk, Russian Federation)

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

Last Call for Papers

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

July 1-5, 2019, Novosibirsk, Russia

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

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

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

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


IMPORTANT DATES

Deadline for submissions: December 23, 2018
Notification of acceptance: February 13, 2019
Conference dates: July 1-5, 2019

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

VENUE

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

TOPICS include, but are not limited to:

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

DISTINGUISHED OPENING LECTURE

Andrew Yao (Tsinghua U, China)

INVITED SPEAKERS

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

PROGRAM COMMITTEE

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

CONFERENCE CHAIR

René van Bevern (Novosibirsk State U, RU)

ORGANIZING COMMITTEE

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

STEERING COMMITTEE

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

SUBMISSIONS

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

At least one of the authors must commit to presenting the paper at the
conference.
**********************************************************
*
* 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 Discrete Optimization at RWTH Aachen University

English version below.

Gesucht

Wissenschaftliche/r Mitarbeiter/in im Bereich Diskrete Optimierung

Unser Profil

Die Arbeitsgruppe Diskrete Optimierung (Leitung: Prof. Dr. Arie Koster)
am Lehrstuhl II für Mathematik entwickelt neuartige mathematische
Methoden für die Anwendung von Ganzzahliger nicht) linearer Optimierung,
Robuster Optimierung und Algorithmischer Graphentheorie in aktuellen
Anwendungsbereichen wie z. B. Entwurf von Energie- und
Kommunikationsnetzen sowie Planungsaufgaben im Gesundheitswesen. In der
Lehre werden sowohl Spezialvorlesungen für den Studiengang Mathematik,
als auch eingehende Mathematikvorlesungen für weitere Studiengänge
angeboten.

Ihr Profil

Abgeschlossenes Hochschulstudium (Master oder vergleichbar) der
Fachrichtung Mathematik
Überdurchschnittliche Studienleistungen
Sichere Beherrschung der deutschen und englischen Sprache
Solide Fachkenntnisse im Bereich der Diskreten Optimierung
Wünschenswert: gute Programmierkenntnisse (C++, Python), Erfahrung mit
Modulierungssprachen (Ampl, Gams) und Erfahrung als stud. Hilfskraft

Ihre Aufgaben

Mitwirkung im Lehrbetrieb sowohl bei Grundvorlesungen, als auch bei
Masterveranstaltungen
Forschungsarbeit auf einem Teilgebiet der Diskreten Optimierung und ihre
Anwendungen, wie z. B. Algorithmische Graphentheorie, Ganzzahlige
Optimierung oder Robuste Optimierung
Durchführung von Drittmittelprojekten

Unser Angebot

Die Einstellung erfolgt im Beschäftigtenverhältnis.
Die Stelle ist zum 01.04.2019 zu besetzen und befristet bis zum
31.03.2021. Die Weiterbeschäftigung für mindestens ein Jahr ist vorgesehen.
Es handelt sich um eine Vollzeitstelle. Auf Wunsch kann eine
Teilzeitbeschäftigung ermöglicht werden.
Eine Promotionsmöglichkeit besteht.
Die Stelle ist bewertet mit EG13 TV-L.

Die Ausschreibung finden Sie auch auf
http://www.rwth-aachen.de/cms/root/Die-RWTH/Jobs-Ausbildung/Jobboerse/~kbag/JOB-Einzelansicht/file/25627/

Die RWTH ist als familiengerechte Hochschule zertifiziert.
Wir wollen an der RWTH Aachen besonders die Karrieren von Frauen fördern
und freuen uns daher über Bewerberinnen.
Frauen werden bei gleicher Eignung, Befähigung und fachlicher Leistung
bevorzugt berücksichtigt, sofern sie in der Organisationseinheit
unterrepräsentiert sind und sofern nicht in der Person eines
Mitbewerbers liegende Gründe überwiegen.
Bewerbungen geeigneter schwerbehinderter Menschen sind ausdrücklich
erwünscht.

Ihre Bewerbung

Senden Sie bitte Ihre Bewerbung inklusive Anschreiben, Lebenslauf, die
Namen zweier Referenzen sowie weitere Unterlagen als einzelne PDF-Datei bis

18.01.2019

an

bewerbung@math2.rwth-aachen.de

Bei Fragen können Sie gerne auch diese E-Mail-Adresse verwenden.

=====

We invite applications for a

Ph.D. student position

in the area of Discrete Optimization
at RWTH Aachen University (Lehrstuhl II für Mathematik, Prof. Arie Koster).

About the Research Group

The discrete optimization group at RWTH Aachen University, headed by
Professor Arie Koster, develops novel mathematical methods for the
application of mixed-integer (non-)linear optimization, robust
optimization, and algorithmic graph theory to actual application fields
like the design of communication and energy networks and the planning of
health care systems. The teaching profile of the group consists of both
classes in discrete optimization for Mathematics students (B.Sc., M.Sc.)
and elementary courses for other programs.

About the position

A position for a PhD student is available, initially for 24 months, from
April 2018 (a later starting date is negotiable). The position is
full-time and paid according at TV-L 13 level.

Topic of research will be in a branch of discrete optimization and/or
its application, e.g., algorithmic graph theory, integer linear
programming, or robust optimization. The succesful candidate will
contribute to the group's teaching obligations, both regarding
elementary courses in mathematics for engineers and optimization courses
for mathematicians at bachelor and master level. Participation in
3rd-party funded projects is welcomed.

About you

The candidate should have (or expect to have shortly) an excellent
master degree in mathematics with solid knowledge in the area of
discrete optimization. Excellent command of both the German and English
language is a prerequisite. Profound computer programming skills (C++,
Python) as well as experience with modelling languages (ampl, GAMS) are
desirable. Candidates with experience as student teaching assistant have
an added value.

Further Information

The full text of this vacancy can be found at
http://www.rwth-aachen.de/cms/root/Die-RWTH/Jobs-Ausbildung/Jobboerse/~kbag/JOB-Einzelansicht/file/25627/(german).


RWTH Aachen University has been certified as a "Family Friendly
University".

RWTH is committed to promoting the careers of women and therefore looks
forward to receiving applications by female candidates.

For positions in organisational units where women are underrepresented,
in cases of equal qualification, ability and professional achievement,
preference will be given to female applicants unless reasons specific to
an individual candidate tilt the balance in his favor.

The University positively welcomes applications from suitably qualified
disabled people.

How to apply

Please send your application in a *single* PDF file containing a letter
of motivation, academic CV, the names of two references, and any other
supporting material no later than

January 18, 2019

to

bewerbung@math2.rwth-aachen.de

Questions can be directed to the same address anytime.

--
Prof. Dr. Arie M.C.A. Koster
RWTH Aachen University
Lehrstuhl II für Mathematik
Pontdriesch 10-12, 2.0G, Raum 307
D-52062 Aachen
E: koster@math2.rwth-aachen.de
W: http://www.math2.rwth-aachen.de/~koster/
T: +49 (0)241 80-94995 (Secretary) -94524 (Direct)
F: +49 (0)241 80-92136

**********************************************************
*
* 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] Stelle in Analytics/Data Mining

Wissenschaftliche/r MitarbeiterIn

Business Analytics for Production

FH OÖ Forschungs & Entwicklungs GmbH | Fakultät
für Management | Steyr

Aufgaben:

·
Mitarbeit an Forschungsprojekten

·
Entwicklung von Modellen

·
Publikationstätigkeiten

·
Teilnahme an Konferenzen

·
Entwicklung von praxisrelevanten Lösungen

Profil:

·
Gute Kenntnisse
in Business Analytics und Data Mining

·
Hohe Affinität zur Produktion und Forschung

·
Abgeschlossenes einschlägiges Studiums z.B. Statistik, Mathematik oder
Informatik

·
Publikationserfahrung und Doktorart wünschenswert

·
sehr gute Deutsch- und Englischkenntnisse

ÜBER UNS

Als größte und forschungsstärkste Fachhochschule entwickeln wir
innovative Produkte
und Dienstleistungen

für Wirtschaft und Industrie. Bei uns finden Sie eine spannende und
verantwortungsvolle
Tätigkeit in einem

kreativen, kollegialen und teamorientierten Umfeld vor - und ganz
wichtig: Den notwendigen
Gestaltungsspielraum,

um Ihre Ideen in Projekte umzusetzen!

BEWERBUNG AN:

Daniela Hüttner | researchjobs35@fh-ooe.at | Tel.: +43 5 0804 33100

FH OÖ Forschungs und Entwicklungs GmbH | Wehrgrabengasse 1-3, 4400 Steyr
| www.fh-ooe.at

Wir versuchen, den Anteil an weiblichem Lehr- und Forschungspersonal zu
erhöhen.
In

diesem Sinne laden wir speziell Frauen ein, sich zu bewerben. Gehalt ab €
2.700
brutto/

Monat in Abhängigkeit vom Qualifikationsprofil. Kosten, die mit der
Bewerbung entstehen,

werden nicht ersetzt. Die Stelle ist auf die Projektdauer bis 2020
befristet.


**********************************************************
*
* 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] ICALP 2019: 2nd Call for Papers

==================================
ICALP 2019 - Second Call for Papers
==================================

https://icalp2019.upatras.gr/

The 46th International Colloquium on Automata, Languages, and Programming (ICALP)
will take place in Patras, Greece, on 8-12 July 2019.

ICALP is the main conference and annual meeting of the European Association for
Theoretical Computer Science (EATCS). As usual, ICALP will be preceded by a series
of workshops, which will take place on 8 July 2019.

=============== Important dates =======================

Submissions: Monday 18 February 2019, 23:59 AoE
Notification: Friday 19 April 2019

Final manuscripts: Monday 29 April 2019
Early registration: Thursday 30 May 2019

Deadlines are firm; late submissions will not be considered.

===========================
Submissions and Proceedings
===========================

ICALP proceedings are published in the Leibniz International Proceedings in
Informatics (LIPIcs) series. This is a series of high-quality conference
proceedings across all fields in informatics established in cooperation with
Schloss Dagstuhl - Leibniz Center for Informatics. LIPIcs volumes are published
according to the principle of Open Access, i.e., they are available online and
free of charge.

Submission Guidelines
---------------------
Authors are invited to submit an extended abstract of no more than 12 pages,
excluding references, presenting original research on the theory of computer
science. All submissions must be formatted in the LIPIcs style
https://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/)
and submitted via Easychair to the appropriate track of the conference. The use
of pdflatex and the LIPIcs style are mandatory: papers that deviate significantly
from the required format may be rejected without consideration of merit.

No prior publication and no simultaneous submission to other publication outlets
(either a conference or a journal) is allowed.

Technical details necessary for a proper scientific evaluation of a submission
must be included in the 12-page submission or in a clearly labelled appendix, to
be consulted at the discretion of program committee members. Authors are strongly encouraged
to also make full versions of their submissions freely accessible in an on-line
repository such as ArXiv, HAL, ECCC.

Best Paper Awards
-----------------
As in previous editions of ICALP, there will be best paper and best student paper
awards for each track of the conference. In order to be eligible for a best student
paper award, a paper should be authored only by students and should be marked as
such upon submission.

Topics
======
Papers presenting original research on all aspects of theoretical computer science
are sought. Typical but not exclusive topics of interest are:

Track A: Algorithms, Complexity and Games
-----------------------------------------
* Approximation Algorithms
* Combinatorial Optimization
* Combinatorics in Computer Science
* Computational Biology
* Computational Complexity
* Computational Geometry
* Cryptography
* Data Structures
* Design and Analysis of Algorithms
* Foundations of Algorithmic Game Theory
* Machine Learning
* Parallel, Distributed and External Memory Computing
* Quantum Computing
* Randomness in Computation

Track B: Automata, Logic, Semantics, and Theory of Programming
-------------------------------------------------------------
* Algebraic and Categorical Models
* Automata, Games, and Formal Languages
* Emerging and Non-standard Models of Computation
* Databases, Semi-Structured Data and Finite Model Theory
* Logic in Computer Science, Theorem Proving and Model Checking
* Models of Concurrent, Distributed, and Mobile Systems
* Models of Reactive, Hybrid and Stochastic Systems
* Principles and Semantics of Programming Languages
* Program Analysis and Transformation
* Specification, Refinement, Verification and Synthesis
* Type Systems and Theory, Typed Calculi

Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
* Algorithmic Aspects of Networks and Networking
* Algorithmic Game Theory
* Formal Methods for Network Information Management
* Foundations of Privacy, Trust and Reputation in Networks
* Foundations of Complex Networks
* Message-Passing Models of Distributed Computing
* Mobile and Wireless Networks and Communication
* Network Economics and Incentive-Based Computing Related to Networks
* Networks of Low Capability Devices
* Network Mining and Analysis
* Overlay Networks and P2P Systems
* Specification, Semantics, Synchronization of Networked Systems
* Theory of Security in Networks

Focus of track C:
The aim for Track C is to be the leading venue for theory papers motivated
by networking applications, and/or proposing theoretical results relevant
to networking, certified analytically.


===============================
ICALP 2019 Programme Committee
===============================

Track A: Algorithms, Complexity and Games
---------------------------------------------------
Yossi Azar (Tel-Aviv University)

Sayan Bhattacharya (University of Warwick)

Aaron Bernstein (Rutgers University)

Jarosław Byrka (University of Wroclaw)

Karl Bringmann (Max-Planck-Institut für Informatik, Saarbrücken)

Gerth Stølting Brodal (Aarhus University)

Parinya Chalermsook (Aalto University)

Paul Duetting (London School of Economics)

Uriel Feige (Weizmann Institute, Rehovot)

Claudio Gentile (INRIA, Lille and Google Research, New York)

Mohsen Ghaffari (ETH Zurich)

Antoine Joux (IMJ-PRG, Sorbonne)

Thomas Kesselheim (University of Bonn)

Michal Koucký (Charles University of Prague)

Alexander Kulikov (Steklov Institute of Mathematics, St. Petersburg)

Sophie Laplante (Université Paris Diderot)

François Le Gall (Kyoto University)

Stefano Leonardi (Sapienza University of Rome, chair)

Vangelis Markakis (Athens University of Economics and Business)

Renato Paes-Leme (Google Research, New York)

Marcin Pilipczuk (University of Warsaw)

MS Ramanujan (University of Warwick)

Adi Rosén (CNRS and U. Paris Diderot)

Eva Rotenberg (Technical University of Denmark)

Rahul Santhanam (University of Oxford)

Alessandra Scafuro (North Carolina State University)

Sandeep Sen (IIT Delhi)

Francesco Silvestri (University of Padua)

Paul Spirakis (U. Liverpool and U. Patras)

Leen Stougie (CWI, Amsterdam)

Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai)

Chaitanya Swamy (University of Waterloo)

Stefan Szeider (Technical University of Vienna)

Rico Zenklusen (ETH Zurich)

Track B: Automata, Logic, Semantics, and Theory of Programming
---------------------------------------------------------------
Parosh Abdulla (Uppsala University)

Christel Baier (TU Dresden, chair)
Krishnendu Chatterjee (IST)
Thomas Colcombet (CNRS and U. Paris Diderot)

Laure Daviaud (University Warwick)

Pedro D'Argenio (Universidad Nacional de Córdoba)
Josee Desharnais (Université Laval)
Mariangiola Dezani (Università di Torino)

Amina Doumane (ENS Lyon)
Rocco de Nicola (IMT Lucca)
Nathanaël Fijalkow (CNRS, U. Bordeaux)

Wan Fokkink (Vrije Universiteit Amsterdam)

Christoph Haase (University of Oxford)

Ichiro Hasuo (University of Tokyo)

Rahda Jagadeesan (De Paul University Chicago)

Markus Lohrey (Universität Siegen)

Radu Mardare (Aarlborg University)

Matteo Mio (ENS Lyon)

Madhusudan Parthasarathy (University of Illinois)

Mickael Randour (Université de Mons)

Sven Schewe (University of Liverpool)

Lutz Schröder (Universität Erlangen-Nürnberg)

Helmut Seidl (TU München)

Michal Skrzypczak (University of Warsaw)

Pawel Sobocinski (University of Southampton)

Christine Tasson (Université Paris Diderot)


Track C: Foundations of Networks and Multi-Agent Systems:
Models, Algorithms and Information Management
---------------------------------------------------------
Amotz Bar-Noy (CUNY)

Vittorio Bilo' (University of Salento)

Bogdan S. Chlebus (University of Colorado Denver)

Xiaotie Deng (Peking University, Beijing)

Paola Flocchini (University of Ottawa, chair)

Leszek Gasieniec (University of Liverpool)

Tobias Harks (University of Augsburg)

Magnús Halldórsson (Reykjavik University)

Christos Kaklamanis (University of Patras)

Ralf Klasing (University of Bordeaux)

Max Klimm (Humboldt Universität zu Berlin)

Ravi Kumar (Google Mountain View)

Silvio Lattanzi (Google Zurich)

Toshimitsu Masuzawa (University of Osaka)

Ruta Mehta (U. Illinois Urbana-Champaign)

Olga Nikolaevna Goussevskaia (Federal University of Minas Gerais)

Ariel Orda (Technion)

Gopal Pandurangan (University of Houston)

Pino Persiano (University of Salerno)

Maria Potop-Butucaru (U. Paris VI)

Giuseppe Prencipe (University of Pisa)

Andrea Richa (Arizona State U.)

Patrick Thiran (EPFL)

Nicola Santoro (Carleton University)

Jukka Suomela (Aalto University)

Peter Widmayer (ETH Zurich)

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

Invited Speakers

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

Michal Feldman (Tel-Aviv University, Israel)

Martin Grohe (RWTH Aachen, Germany)

Ola Svensson (EPFL, Switzerland)

Frits Vaandrager (Radboud University, The Netherlands)

Mihalis Yannakakis (Columbia University, USA)

============================
ICALP 2019 Proceedings Chairs
============================
Ioannis Chatzigiannakis (Sapienza University of Rome, Italy)
Emanuela Merelli (University of Camerino, Italy)

===============================
ICALP 2019 Organizing Committee
===============================

- Efstratios Gallopoulos (University of Patras, Greece)
- John Garofalakis (University of Patras and CTI, Greece)
- Christos Kaklamanis (University of Patras and CTI, Greece)
- Sotiris Nikoletseas (University of Patras and CTI, Greece)
Conference Co-Chair
- Christos Zaroliagis (University of Patras and CTI, Greece)
Conference Co-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/
*
**********************************************************

Sunday, December 9, 2018

[DMANET] Assistant professor (mathematical computer science) at the University of Illinois at Chicago

University of Illinois at Chicago
Department of Mathematics, Statistics, and Computer Science

Tenure Track – Assistant Professor in Mathematical Computer Science:
https://www.mathjobs.org/jobs/jobs/13215

The Department of Mathematics, Statistics, and Computer Science seeks
applicants for an Assistant Professor to join the mathematical computer
science group. Applicants working in the areas of theoretical computer
science and mathematical computing are especially encouraged. Applicants
must have a Ph.D. or equivalent degree in mathematics, computer science or
a related field, an outstanding research record, and evidence of strong
teaching ability. The salary is negotiable. The position is effective
August 16, 2019. Final authorization of the position is subject to the
availability of funding.

For more about the mathematical computer science group see:
http://homepages.math.uic.edu/~mcs/index.html

For more about theoretical computer science at UIC see:
https://theory.cs.uic.edu/

The Department of Mathematics, Statistics, and Computer Science has active
research programs in a broad spectrum of centrally important areas of pure
mathematics, computational and applied mathematics, mathematical computer
science, probability and statistics, and mathematics education. See
http://www.math.uic.edu for more information.

Applicants should provide a vita, research and teaching statements, and at
least three (3) letters of recommendation. Applications should be
submitted at https://www.mathjobs.org/jobs/jobs/13215 . No applications
will be accepted by surface mail or e-mail.

To ensure full consideration, application materials must be received by
January 14, 2019, but applications will be accepted through February 11,
2019.

The University of Illinois at Chicago is an affirmative action, equal
opportunity employer, dedicated to the goal of building a culturally
diverse and pluralistic faculty and staff committed to teaching and working
in a multicultural environment. We strongly encourage applications from
women, minorities, individuals with disabilities and covered veterans. The
University of Illinois may conduct background checks on all job candidates
upon acceptance of a contingent offer. Background checks will be performed
in compliance with the Fair Credit Reporting Act.

**********************************************************
*
* 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 - AUTOMATA 2019 - Reminder

Dear colleagues and friends,

Please find below the call for papers for the 25th International Workshop
on Cellular Automata (CA) and Discrete Complex Systems (DCS), AUTOMATA 2019.

AUTOMATA 2019 is the official annual event of IFIP WG 1.5
<http://www.iec.hiroshima-u.ac.jp/ifip15/>: this is the Working Group 5 (on
Cellular Automata and Discrete Complex Systems), of the Technical Committee
1 (on Foundations of Computer Science), of the International Federation of
Information Processing (IFIP).

————————————————————————————————–
June 26th-28th, University of Guadalajara, Guadalajara, Mexico.

https://automata2019.wordpress.com/
————————————————————————————————–

* Aims:

The purpose of this conference is to highlight the major advances in the
field and the development of new tools, to support the development of
theory and applications of CA and DCS, and to identify and study within an
inter- and multidisciplinary context the important fundamental aspects,
concepts, notions and problems concerning CA and DCS.

* Venue:

The workshop is organized by the Department of Mathematics of University
Center of Exact Sciences and Engineering of the University of Guadalajara,
in the city of Guadalajara, Mexico.

* Topics (not exhaustive):

dynamic, topological, ergodic and algebraic aspects of Cas and DCSs
algorithmic and complexity issues
emergent properties
formal languages
symbolic dynamics
tilings
models of parallelism and distributed systems
synchronous versus asynchronous models
phenomenological descriptions and scientific modelling
applications of CAs and DCSs

* Paper categories

There are two categories of submission – full papers and exploratory
papers. Full papers are meant to report more complete and denser research,
while exploratory papers are meant to be short reports of recent
discoveries, work-in-progress or partial results. Submissions of full
papers are refereed and selected by the program committee. Exploratory
papers go through a less rigorous evaluation process. All accepted papers
must be presented at the conference.

Accepted full papers will appear in the proceedings published by Springer
in the Lecture Notes in Computer Science (LNCS) series. Exploratory papers
will not be included in the LNCS proceedings, but in local proceedings that
will be distributed at the workshop.

* Special issue

A special issue, collecting extended and improved versions of some selected
papers presented at the conference, will be published in Natural Computing
<https://link.springer.com/journal/11047>. Depending on the number of
papers presented at the conference, a second special issue will be arranged
in Complex Systems <http://www.complex-systems.com/>.

* Invited speakers:

- Pablo Arrighi (Aix-Marseille University and LIF de Marseille, France)
- Hector Zenil (SciLifeLab and Karolinska Institute, Sweden)
- Tullio Ceccherini-Silberstein (University of Sannio, Italy)

* Important dates:

Submission deadline full papers (12 pages): February 4, 2019
Notification of acceptance full papers: March 15, 2019
Final versions: March 29, 2019

Submission deadline exploratory papers (8 pages): May 3, 2019
Notification of acceptance exploratory papers: May 17, 2019

Early registration deadline for full paper author: March 29, 2019
Early registration for exploratory paper author/other participants: May 24,
2019
Final registration deadline: June 7, 2019

* Submissions:

Authors are invited to submit papers of no more than 12 pages (for full
papers) or 8 pages (for exploratory papers) via EasyChair:

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

Submissions should contain original research that has not previously been
published. Submission must be formatted in LaTeX using the LNCS format
<http://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines>
and
submitted in PDF. Papers authored or co-authored by PC members are also
welcomed.

* Program Committee:

- Alonso Castillo-Ramirez (chair)
- Alberto Dennunzio
- Anahí Gajardo
- Andrew Adamatzky
- Danuta Makowiec
- Edgardo Ugalde
- Enrico Formenti
- Franco Bagnoli
- Guillaume Theyssier
- Hector Zenil
- Henryk Fukś
- Hiroshi Umeo
- Ilkka Törmä
- Jan Baetens
- Janko Gravner
- Jarkko Kari
- Katsunobu IMAI
- Luciano Margara
- Martin Kutrib
- Maximilien Gadouleau
- Nazim Fatès
- Paola Flocchini
- Pedro de Oliveira
- Pietro Di Lena
- Reem Yassawi
- Siamak Taati
- Thomas Worsch
- Turlough Neary

We are looking forward to seeing you in Guadalajara!

———————————————————————————————————–

Organizing Committee

- Alonso Castillo-Ramirez (Chair)
- Humberto Gutiérrez Pulido
- Osbaldo Mata Gutiérrez
- María de la Paz Suárez
- Juan Manuel Márquez Bobadilla

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

Saturday, December 8, 2018

[DMANET] JOB@QMUL

Postdoctoral Research Assistant - QMUL17132

Department: School of Electronic Engineering & Computer Science
Salary: £33,615 - £37,411 per annum (Grade 4)
Reference: QMUL17132
Date posted: 07-Dec-2018
Closing date: 06-Jan-2019

Job profile
<https://webapps2.is.qmul.ac.uk/jobs/getfile?fname=QMUL17132_QMUL17132_PDRA_JP_FINAL07122018.docx>
Apply online
<https://ig24.i-grasp.com/fe/tpl_QMUL01.asp?newms=rf&ID=QMUL17132>
Overview:

Software is now at the heart of almost everything we do in the world. This
software remains largely handmade, and as such, is prone to defects.
Testing detects only a subset of software defects with the rest lying
dormant, sometimes for years. When these defects emerge in software systems
the safety and business consequences can be severe. Software failures and
their damaging consequences are regularly reported in the press. Finding
and fixing defects has been an intransigent problem over many years. The
traditional approach to this problem relies on finding defects during
testing then developers manually fixing those defects afterwards.

In this project we establish a new technique to automatically fix predicted
defects in software code before testing. We use machine learning-based
defect prediction information to generate automatic fixes using Genetic
Improvement. Our approach aims to offer developers effective fixes to code
which is predicted as defective. A higher proportion of the fixes our
approach offers to developers should be acceptable, generated quicker and
available earlier in the development cycle than previous attempts at
automated repair. Importantly, our approach targets a wider pool of defects
as it specifically includes targeting those dormant defects which are not
identified by testing.

Using our approach the developer will always remain in control of the code
produced. Fixes are suggested, and the developer is the 'gate-keeper',
deciding if a suggested fix is accepted, rejected, or can itself be
modified to improve the code. One of the tangible outputs of the project
will be a defect fixing tool (Fixie), which will provide support to
developers in their daily coding activities. The tool will be developed in
collaboration with several industrial partners and will be empirically
evaluated throughout the project.

Applicants must have a PhD awarded in Computer Science, Electric/Electronic
Engineering or a related topic, experience conducting research in computer
science to a high standard and a track record of publishing in high-quality
conference venues and journals.

Strong ability to proficiently organise and prioritise own work and
organise research within the project timetable and the ability to present
material verbally and visually in a seminar is also an essential criteria.

The post is full time, fixed term appointment for 2 years, with an expected
start date of 01 March 2019. Starting salary will be in the range of
£33,615 - £37,411 per annum, inclusive of London Allowance. Benefits
include 30 days annual leave, pension scheme and interest-free season
ticket loan.

Candidates must be able to demonstrate their eligibility to work in the UK
in accordance with the Immigration, Asylum and Nationality Act 2006. Where
required this may include entry clearance or continued leave to remain
under the Points Based Immigration Scheme.

Informal enquiries should be addressed to John R. Woodward at
j.woodward@qmul.ac.uk.

Details about the school can be found at www.eecs.qmul.ac.uk

To apply, please click the link below.

Candidates are kindly requested to upload documents totaling no more than
10 pages.

Please note large documents, e.g., PhD thesis/Research papers, are not
forwarded to the interview panel.

The closing date for applications is 6 January 2019. Interviews are
expected to be held shortly thereafter.

*Valuing Diversity & Committed to Equality *

*QMUL is proud to be a London Living Wage Employer*


(excuse terse response - sent from mobile device)
----thank you,
j.woodward@qmul.ac.uk
http://www.eecs.qmul.ac.uk/~jwoodward/

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