Monday, March 25, 2019

[DMANET] Call for abstracts - AMSI Optimise 2019 | Perth, Australia 17-21 June

AMSI Optimise 2019
Mining | Oil | Gas | Agriculture | Water
17-21 June, Hyatt Regency Perth
https://optimise.amsi.org.au/

Now in its third year, AMSI Optimise moves to Perth, bringing together industry leaders from the natural resources sector, academic experts and the nation's current postgraduate talent. The conference provides a platform to understand industry drivers and foster research collaborations, connecting business with Australia's future workforce.

The themes of the 2019 conference are Mining, Oil & Gas, Agriculture & Water. The event will comprise a three-day industry-focused conference, followed by a two day research workshop.

SUBMIT AN ABSTRACT
We are accepting abstracts for the poster session on Day 1 and workshop talks on Days 4 & 5 of the event.
Up to $500 in prizes will be awarded to the best posters!
https://optimise.amsi.org.au/get-involved/

REGISTER: https://optimise.amsi.org.au/register/

Email: events@amsi.org.au<mailto:events@amsi.org.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/
*
**********************************************************

[DMANET] Post-Doc in Structural and Algorithmic Graph Theory at University of Primorska, Slovenia

A postdoctoral research position at the University of Primorska (Koper,
Slovenia)

The Departments of Mathematics of Andrej Marusic Institute (IAM) and
Faculty of Mathematics, Natural Sciences and Information Technologies
(FAMNIT) at the University of Primorska,
https://www.famnit.upr.si/en
are seeking a top early-career researcher for a postdoctoral position
within the project "Topics in Structural Graph Theory: Invariants,
Separators, and Intersection Representations" funded by the Slovenian
Research Agency,
http://p1-0285.iam.upr.si/en/research-projects/n1-0102
The project will investigate several key problems within pure and
algorithmic graph theory, with a focus on graph invariants and graph
classes. It will be developed along three interconnected research lines:
conditions for the existence of a function bounding one invariant in
terms of another one, algorithmic aspects of selected graph optimization
problems on various graph classes, and the development of a unifying
framework for generalizations of chordality. Progress on these problems
is expected to be obtained using an effective combination of various
complementary concepts and techniques suitable for the study of graph
classes such as: graph decompositions, graph width parameters, minimal
separators, graph minors, extremal graph theory.

Applicants must possess a PhD in a relevant area and should show
evidence of excellence in mathematics or theoretical computer science.
Expertise in structural and algorithmic graph theory is required,
including a good knowledge of various aspects of graph theory,
algorithms, and complexity theory. The successful candidate will be part
of the Departments of Mathematics at IAM and FAMNIT, University of
Primorska, and will work under the guidance of Associate Professor
Martin Milanic.

Terms and conditions:
- The position is for two years, with the possibility of renewal for one
additional year. By default, the starting date is September 1, 2019.
- The position comes with a teaching load of one course per semester at
bachelor and/or master level programs (on topics related to Discrete
Mathematics, Graph Theory, Mathematical Programming etc.) offered by FAMNIT.
- There will be a possibility of co-supervision of a PhD student
starting October 2019 and a possibility of collaboration within
bilateral research projects.
- The salary and the length of the contract depend on the academic title
into which the candidate can be elected following the university rules,
https://www.upr.si/sl/resources/files//univerza/interni-akti/merila-za-izvolitve-v-nazive.pdf
(in Slovene). For example, for election into academic title Assistant
Professor and Research Associate, one of the key necessary conditions is
that the total number of papers published by the candidate in SCI
journals, each paper divided by the number of authors, is at least 2.5.

Deadline: applications will be considered on a rolling basis until June
30, 2019, or until the position is filled. Priority will be given to
applications received by April 30, 2019.
Starting date: negotiable but preferably not later than October 1, 2019.

Application process:
To apply, please send the following documents in electronic form to
Martin Milanic (martin.milanic@upr.si) with the subject line "Koper
Postdoc 2019" in the Subject field:
- Curriculum Vitae,
- Publication List,
- Research Statement,
- Copies of three recent papers of preprints,
- Names and e-mail addresses of at least three persons who can be
contacted for reference (and have agreed to be contacted).

Informal inquiries should be addressed to Martin Milanic
(martin.milanic@upr.si).

--
Martin Milanic
Univerza na Primorskem / University of Primorska
Fakulteta za matematiko, naravoslovje in informacijske tehnologije
Faculty of Mathematics, Natural Sciences and Information Technologies
Glagoljaska 8, SI–6000 Koper
Tel.: +386 (0) 5-611-75-84
Fax: +386 (0) 5-611-75-71
E-mail: martin.milanic@upr.si
http://osebje.famnit.upr.si/~martin.milanic/
**********************************************************
*
* 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 Machine Learning for Opinion Mining in Social Networks

Postdoctoral position in Machine Learning for Opinion Mining in
Social Networks


The App (http://www.litislab.fr/equipe/app/) and MIND
(http://www.litislab.fr/equipe/mind/) teams of the LITIS lab at INSA
Rouen Normandy offer a postdoctoral position for 12 months as part of
the SAPhIRS project.

Keywords: machine learning, deep learning, recurrent neural networks

Description of the project and postdoctoral missions:

Social networks are regularly used to express opinions on public and
political events or to disseminate opinions on sensitive topics (hate
speech, hooliganism, racism and nationalism, etc.). The objective of the
SAPhIRS project is to study opinion propagation within social networks:
to identify the key mechanisms for disseminating information and opinion
and to identify leaders of influence. Particularly in Security field, we
will focus on Twitter detection and analysis of hamessages calling for
hatred or violence, monitoring their spread and detection of influential
actors.

As part of this project, we propose a 12-month postdoctoral position in
machine learning for opinion mining, sentiment analysis and the
detection of changes of opinion in Tweets. For this purpose, we plan to
use state-of-the-art methods in NLP based on deep-learning neural
networks, and especially recurrent neural networks with internal memory
such as LSTMs or GRUs.

In other words, the main tasks would be:

To annotate tweets automatically according to an opinion:
supervised classification problem;
To automatically identify messages containing the expression of
radical ideas, in English, in French and in Arabic chat alphabet
(transliteration of Arabic in Latin alphabet, also called arabizi or
arabish): problem of supervised learning on unbalanced classes and
possibly weakly supervised learning;
To detect changes of opinion in user Tweets sequences: detection of
anomalies and breaks in a time series.

The main difficulties come from the encoding of input data (short texts
from Twitter, in French and Arabizi) for which language models remain to
be defined, and in the design and learning of adapted recurrent models
dedicated to these three tasks.

Profiles:
Candidates must have a doctorate in Machine Learning with, if possible,
experience in NLP and/or Deep Learning. Knowledge of recurrent networks
and Arabizi would also be a plus.

Contractual conditions:
The contract will be 12 months starting as soon as possible, with a
gross salary of approximately 3500 €. The recruited person will work in
the LITIS lab at INSA Rouen Normandy in Saint-Etienne-du-Rouvray.

Application: CV, motivation letter, recommendation letters.

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

[DMANET] Exploratory Papers - AUTOMATA 2019

Dear colleagues and friends,

Please find below the call for EXPLORATORY 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 for
Information Processing (IFIP).

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

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

* Exploratory papers


- Exploratory papers are meant to be short reports (8 pages long
maximum) of recent discoveries, work-in-progress or partial results.
- All accepted exploratory papers must be presented at the conference in
a 15-minute talk.
- Exploratory papers will be included in local proceedings that will be
distributed at the workshop.

* 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

* 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 exploratory papers: *May 3rd, 2019*
- Notification of acceptance exploratory papers: May 17th, 2019
- Final versions of exploratory papers: May 24th, 2019


- Early registration for exploratory paper author/other participants:
May 24th, 2019
- Final registration deadline: June 7th, 2019

* Submissions:

Authors are invited to submit exploratory papers of no more than 8 pages
via EasyChair:

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

Submissions should contain original research or work-in-progress 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.

* Silver Jubilee:

AUTOMATA 2019 will be the Silver Jubilee of the event, so the programme
will reflect this special occasion.

* Program Committee:

- Alonso Castillo-Ramirez (chair)
- Alberto Dennunzio
- 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/
*
**********************************************************

[DMANET] [FINAL DEADLINE: April 7, 2019] 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 deadline for submissions extended to: April 7, 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

April 7, 2019: Deadline for paper submission
April 24, 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

All submitted papers will be reviewed by the workshop technical program committee members.

International Program Committee:

Alfredo Cuzzocrea, University of Trieste and ICAR-CNR, Italy
Bronis R. de Supinski, Lawrence Livermore National Laboratory, USA
Giuseppe Di Fatta, University of Reading, UK
Ann Gordon-Ross, University of Florida, USA
Kenli Li, Hunan University, China
Donato Malerba, University of Bari, Italy
Barbara Masucci, University of Salerno, Italy
Mitsunori Ogihara, University of Miami, USA
Takahiko Shintani, The University of Electro-Communications , Japan
Domenico Talia, University of Calabria, Italy
Paolo Trunfio, University of Calabria, Italy
Jeffrey D. Ullman, Stanford University, USA
Laurence T. Yang, St Francis Xavier University, Canada


-

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

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] Gamenets'19 : Call for Participation

Dear colleagues

Please find the Call for participation of Gamenets'19.

Sorry if you already received several versions of this call.


Web version
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=r99adfja17ebnjlmmr4kvkpl5&i=2s7&iw=1&n=2fu&p=H301802549&s=wv&sn=2fu>


Forward
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=d089tcdmj1fjtgok56bq67kdg&i=2s7&iw=1&n=2fu&p=H301740084&s=fwdn&sn=2fu>


[GameNets 2019]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=89f640s32qtu48aln884sn6h0&i=2s7&iw=1&p=H197671585&s=lp&sn=2fu&z=1cpp>


[Paris, France]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=1lj912p37re2d79qq0p7ivebsl&i=2s7&iw=1&p=H1842862477&s=lp&sn=2fu&z=1cpp>

*Scope 
*
Welcome to 2019 International Conference on Game Theory of Networks
(GameNets
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=12r3029g4s0adnrko65gv8t3s8&i=2s7&iw=1&p=H164428710&s=lp&sn=2fu&z=1cpp>),
to be held in Telecom ParisTech, Paris, France. The conference is
organized by the EAI
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2sa9k2i0reo8hk73olilvlp3fg&i=2s7&iw=1&p=H164428709&s=lp&sn=2fu&z=1cq4>(European
Alliance for Innovation). Game theory has become a useful tool for
modeling and studying various networks (communication, transportation,
social, biological, economic networks). The past decade has witnessed a
huge explosion of interest in issues that intersect networks and game
theory. At the advent of an era of networks equipped with artificial
intelligence and machine-to-machine communications, game theory faces
new challenges. Game theory is for example called to play a key role in
the design of new generation networks (beyond 5G, ICN, SDN) as well as
in the development of and the Internet of things.

This conference encourages high quality papers that advance the
state-of-the-art in theoretical aspects and/or propose original
applications of game theory in networks. The goal is to gather research
contributions, from game theory and networks, that address the major
today's challenges in the domain. We encourage prospective authors to
submit original and unpublished work.

We are pleased to invite you to attend GameNets 2019
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2jasmcnj9da7th05s2dos4lv1l&i=2s7&iw=1&p=H164428708&s=lp&sn=2fu&z=1cpp> which
will take place in Paris, France on April 25 - 26, 2019.

Register now
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3b62g284gocqpe9h5m01lc18g1&i=2s7&iw=1&p=H221515971&s=lp&sn=2fu&z=1cq5>


Early Registration until 22 February 2019!


Keynote speaker
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3ufj92bo2pe3q3s212tsf7kbl4&i=2s7&iw=1&p=H1799725610&s=lp&sn=2fu&z=1cq2>

[Prof. Ariel Orda]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=29ks09re4ofbh10f3t2s4c82sq&i=2s7&iw=1&p=H1548525786&s=lp&sn=2fu&z=1cq2>

Prof. Ariel Orda

Israel Institute of Technologyy, currently the Herman and Gertrude Gross
Professor of Communications. 


Invited talks of GameNets 2019
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=1ug5bgae5obbb0lq1m2glo04v4&i=2s7&iw=1&p=H1688978226&s=lp&sn=2fu&z=1cq3>

[Prof. Eitan Altman]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=1jdqg9ri1of3vsj5k13osaomvv&i=2s7&iw=1&p=H852863890&s=lp&sn=2fu&z=1cq3>

Prof. Eitan Altman
Inria, France

 
[Giacomo Como]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=13u1hel5lu3lm9bn0b8s8ile5c&i=2s7&iw=1&p=H654687919&s=lp&sn=2fu&z=1cq3>

Giacomo Como
Politecnico di Torino, Italy

 
[Stephane Durand]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=14spu2d6u31detdomh6gdqn9t&i=2s7&iw=1&p=H2132727568&s=lp&sn=2fu&z=1cq2>

Stephane Durand
Inria, France

[Bruno Gaujal]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=29d7f50nql7297j4m4nlesm66u&i=2s7&iw=1&p=H641512977&s=lp&sn=2fu&z=1cq3>

Bruno Gaujal
Inria, France

 
[Marco Scarsini]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2c1n8coh30sp741ani6h1sv6dc&i=2s7&iw=1&p=H866038832&s=lp&sn=2fu&z=1cq3>

Marco Scarsini
LUISS University, Rome

 
[Marc Schroder]
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=27p7lq7377hr2racnjoo79c2ib&i=2s7&iw=1&p=H1921376655&s=lp&sn=2fu&z=1cq3>

Marc Schroder
Maastricht University,
Netherlands

***
We look forward to seeing you soon!
EAI


FOLLOW US!
facebook
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2b1bd6549r5cotcmij4hjks2qr&i=2s7&iw=1&p=H824158454&s=lp&sn=2fu&z=1cps>
You Tube
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3felmaj1hs2d79o0qne6orta24&i=2s7&iw=1&p=H824158453&s=lp&sn=2fu&z=1cpt>
twitter
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=263eb1hat8jjb99n26qjni88q8&i=2s7&iw=1&p=H824158452&s=lp&sn=2fu&z=1cpu>
linkedin
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=hflu02es3ub2d5paure8jpuq6&i=2s7&iw=1&p=H824158451&s=lp&sn=2fu&z=1cpv>


<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2n8e73gjgrlimofeslra588jtc&i=2s7&iw=1&p=H824158450&s=lp&sn=2fu&z=1cq0>

EAI I.V.Z.W. | ADDRESS: 9000 GENT,  BEGIJNHOFLAAN 93A (BELGIUM)
WWW.EAI.EU
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3voqj752ucif18ds6lqnkeb11v&i=2s7&iw=1&p=H824158449&s=lp&sn=2fu&z=1cq1>


Share: Forward to friend
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=9v03nhvq6nihrokk53v0bgr4u&i=2s7&iw=1&n=2fu&p=H1830092685&s=fwdn&sn=2fu>
Share Facebook
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=2if43d1ip2loeqcvqng337448k&i=2s7&iw=1&n=2fu&p=H1830092681&s=sn&sdsc=&shimage=&shtype=&shurl=&sn=2fu&soc=facebook&tit=>
Share Twitter
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3jqgcsecolqkqsbtvqpp1m9jaa&i=2s7&iw=1&n=2fu&p=H1830092677&s=sn&shrel=&shrep=&shtag=&shtxt=&shvia=&sn=2fu&soc=twitter>
Share Linkedin
<http://createnet.mailmta.com/nl/link?c=1c0d4&d=3po&h=3a15nrpu888l3f4ceklqa5jq7o&i=2s7&iw=1&n=2fu&p=H1830092649&s=sn&shsrc=&shsum=&sn=2fu&soc=linkedin&tit=>


--
Marceau Coupechoux

Telecom ParisTech (ENST)
Département Informatique et Réseaux
23 Avenue d'Italie
CS 51327
75214 Paris cedex 13


**********************************************************
*
* 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] Registration at the SAT/SMT/AR Summer School is now open!

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

SAT / SMT / AR Summer School 2019

Lisbon, Portugal, 3 - 6 July 2019

https://reason.di.fc.ul.pt/ssa-school-2019/

Registration deadline: 31 May 2019, 23:59 AoE

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

Satisfiability (SAT), Satisfiability Modulo Theories (SMT), and Automated
Reasoning (AR) continue to make rapid advances and find novel uses in a wide
variety of applications, both in computer science and beyond. The SAT/SMT/AR
Summer School aims to bring a select group of students up to speed quickly in
this exciting research area. The school continues the successful line of
Summer Schools that ran from 2011 to 2015 as SAT/SMT Summer Schools and added
AR in 2016.

The SAT/SMT/AR summer school will precede SAT 2019
(http://sat2019.tecnico.ulisboa.pt/) and SMT 2019 (http://smt2019.galois.com/)
taking place on July 3-6, 2019 at the Instituto Superior Técnico (IST/UL),
University of Lisbon, Portugal.

## Registration

Registration at the summer school is **free of charge** but *mandatory* for
all attendees. Registration deadline is **May 31, 2019**.

Please, take into consideration that the number of attendees is limited.
Register as soon you are sure to be able to attend the summer school.

Note that **scholarships** will be available for *PhD students from the US*,
thanks to the NSF support.

## More Information

More information about the summer school can be found at
https://reason.di.fc.ul.pt/ssa-school-2019/. Any questions related to the
summer school may be addressed to the organizers
(ssa.school2019@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] [2019-01373 - PhD Position F/M [Sub - 2019] - Parallel Gray-box Optimization for Large-scale Problem Solving] Publication de l'offre d'emploi

Dear Colleagues, please help to disseminate this offer of PhD grant.

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

Title: Parallel Gray-box Optimization for Large-scale Problem Solving

Location: Inria Lille - Nord Europe

Keywords: Optimization; Evolutionary algorithms; Parallel and distributed computing; Gray-Box Optimization; Machine learning.

Abstract: The goal of this PhD is to foster the next generation of large-scale parallel optimizers, by contributing to the design of advanced algorithms attacking big gray-box optimization problems and to set up an innovative and solid fundamental understanding of their characteristics, while exploiting the power offered by modern parallel computing platforms.
The successful candidate will be part of the BONUS team at Inria Lille, and will eventually collaborate with a number of international and highly recognized researcher partners with whom the team is actively working, e.g., in the USA, UK, Japan, Hong Kong. More information about the international research environment can be provided on-demand.

Skills: Candidates with the following skills will be preferred:
Fluent English, excellent communication skills, keen to team working
Good background in (combinatorial) optimization and/or evolutionary algorithms
Good background in parallel and distributed computing
Background in graph theory and machine learning
Good experience in programming

Applications: To apply, the following is mandatory: CV + application letter + recommendation letters + references + school transcripts
Prior to application, it is recommended to contact : omar.abdelkafi@inria.fr, arnaud.liefooghe@inria.fr, bilel.derbel@inria.fr

Candidates must apply via the INRIA common platform on the link:
https://jobs.inria.fr/public/classic/fr/offres/2019-01373

Supervisor: B. Derbel (University of Lille, France)
Co-Supervisors: O. Abdelkafi (University of Lille, France), A. Liefooghe (University of Lille, France)
Team: BONUS (CRIStAL - CNRS UMR 9189 / Inria Lille - Nord Europe)

Advantage:
Restaurant facilities
Partially-reimbursed public transport
other Inria common facilities

Remuneration: Subject to Inria regulation:
1st and 2nd year : 1593.50€ Net monthly salary (after taxes)
3rd year : 1676.31€ Net monthly salary (after taxes)

Deadline: Application must be submitted as soon as possible (hard deadline by April 22, 2019).

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

Omar ABDELKAFI,
Associate Professor,
BONUS research group,
CRIStAL (CNRS UMR 9189) — Inria Lille - Nord Europe,
University of Lille — Faculty of Science and Technology — Computer Science Department.

**********************************************************
*
* 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] SIEMENS AI@Industry Hackaton

***********************************************************
SIEMENS AI@Industry Hackaton
***********************************************************

24.4.-27.4.2019

****************************
Siemens AI Lab in Munich is hosting a Hackaton on industrial AI applications. There will be several tracks, including one with a focus on operations research (check out Track 3 - Energy efficient process optimization).
If you want to team up with others to take a crack at challenges arising in an industrial setting, come to Munich for 72 hours of concept creation and coding.

For more information and application visit

http://ai-hackathon.com/

The application deadline is 7.4.2019. There will be no travel support, but there are prices to win.
We are happy to answer your questions at team@ai-hackathon.com<mailto:team@ai-hackathon.com>.
If you have students who might be interested, it would be great if you tell them about it.

Siemens AG
Corporate Technology
Research and Development for Digitalization and Automation
Operations Research for Decision Support
CT RDA BAM ORD-DE
Otto-Hahn-Ring 6
81739 München, Deutschland
Tel.: +49 172 5475770
Mobil: +49 172 5475770
mailto:gottschalk.corinna@siemens.com
www.siemens.com/ingenuityforlife<https://siemens.com/ingenuityforlife>
[www.siemens.com/ingenuityforlife]
Siemens Aktiengesellschaft: Vorsitzender des Aufsichtsrats: Jim Hagemann Snabe; Vorstand: Joe Kaeser, Vorsitzender; Roland Busch, Lisa Davis, Klaus Helmrich, Janina Kugel, Cedrik Neike, Michael Sen, Ralf P. Thomas; Sitz der Gesellschaft: Berlin und München, Deutschland; Registergericht: Berlin Charlottenburg, HRB 12300, München, HRB 6684; WEEE-Reg.-Nr. DE 23691322

**********************************************************
*
* 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, March 24, 2019

[DMANET] CIMPA Research school on graphs , Algorithms and randomness(final call for travel grant)

CIMPA Research School and Workshop on

Graphs , Algorithms and Randomness

will be held this years from June 15 to June 22 at Faculty of
mathematical Sciences ,university of Tabriz , Tabriz .Iran .

Tabriz city is the second oldest city in Iran , So old that is origins are
shrouded in legend , and the city and its environs contain a number of
historic attractions and surrounded by colorful mountain . also , Tabriz
is in the north west of Iran and near the border of 3 countries( Turkey
, Azerbaijan, Armenia ).

we have 6 main courses in this school:

Course 1: "Colouring problems on oriented graphs", Eric SOPENA (LaBRI,
Bordeaux University, France)
Course 2: "Efficient graph algorithms and applications", Michel HABIB
(IRIF-Paris 7, France)
Course 3: "Distributed Network Computing", Pierre FRAIGNIAUD (CNRS,
IRIF-Paris 7, France)
Course 4: "Power of randomness in algorithms and complexity", Frederic
MAGNIEZ (CNRS, IRIF-Paris 7, France)
Course 5: "Decoding algorithms for codes based on random graphs", Omid
ETESAMI (Researcher at IPM, Tehran-Iran)
Course 6: "Random tiling and perfect matching, Cédric Boutillier (Sorbonne
Université ,France)

CIMPA Institute support PhD student , Fresh PhD and Postdocs from
developing countries to participate in this schools . For travel grant
please apply via the following link :(deadline is March 31)
www.cimpa.info/en/node/40

for more information and registration please visit our school website :
http://cimpa2019.tabrizu.ac.ir/

Best Wishes from the school Administrative and scientific coordinators ,

Afshin Behmaram ( behmarammath@gmail.com )

Reza Naser Asr( reza@irif.fr )

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

[DMANET] CPM 2019 - 1st Call for Participation

==============================
=== *CPM 2019 Call for PARTICIPATION* ===
==============================
30th Annual Symposium on Combinatorial Pattern Matching
Pisa, Italy, June 18-20, 2019
http://cpm2019.di.unipi.it/

*REGISTRATION* is open:
http://cpm2019.di.unipi.it/registration/*

KEYNOTE SPEAKERS*

Paweł Gawrychowski (University of Wrocław, Poland)

How to exploit periodicity


Antonio Restivo (University of Palermo, Italy)
Some variations on Lyndon words

Michal Ziv-Ukelson (Ben Gurion University of the Negev, Israel)
Stringology combats microbiological threats

*HIGHLIGHT SPEAKERS*
[the Highlights of CPM is a special session introduced in this CPM
edition, for presenting the highlights of recent developments in
combinatorial pattern matching]

Diptarka Chakraborty (Weizmann Institute of Science, Israel)
Approximating edit distance within constant factor in truly
sub-quadratic time (FOCS 2018)

Nicola Prezza (University of Pisa, Italy)
At the roots of dictionary compression: string attractors (STOC 2018)

*ACCEPTED PAPERS *
[http://cpm2019.di.unipi.it/accepted/]

Haitao Jiang, Jiong Guo, Daming Zhu and Binhai Zhu.
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery
Problem

Eitan Kondratovsky and Amihood Amir.
Sufficient Conditions for Efficient Indexing under Different Matchings

Nicola Prezza and Giovanna Rosone.
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler
Transform

Niko Kiirala, Leena Salmela and Alexandru I. Tomescu.
Safe and complete algorithms for dynamic programming problems, with an
application to RNA folding

Takaaki Nishimoto and Yasuo Tabei.
Conversion from RLBWT to LZ77

Djamal Belazzougui and Fabio Cunial.
Fully-functional bidirectional Burrows-Wheeler indexes

Michał Gańczorz.
Entropy lower bounds for dictionary compression

Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone and Marinella
Sciortino.
A New Class of Searchable and Provably Highly Compressible String
Transformations

Dmitry Kosolobov and Nikita Sivukhin.
Compressed Multiple Pattern Matching

Karim Labib, Przemysław Uznański and Daniel Wolleb-Graf.
Hamming distance completeness

Jan Studený and PrzemysÅ‚aw UznaÅ„ski.
Approximating Approximate Pattern Matching

Sung Gwan Park, Amihood Amir, Gad M. Landau and Kunsoo Park.
Cartesian Tree Matching and Indexing

Nicola Prezza.
Optimal Rank and Select Queries on Dictionary-Compressed Text

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl and Marcin PiÄ…tkowski.
Indexing the Bijective BWT

Julian Pape-Lange.
On Maximal Repeats in Compressed Strings

Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote and Brigitte
Vallee.
Dichotomic selection on words: a probabilistic analysis

Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos
and Simon J. Puglisi.
Computing the Antiperiod(s) of a String

Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson,
Daniel Paulusma and Stephane Vialette.
Finding a Small Number of Colourful Components

Pawel Gawrychowski and Tatiana Starikovskaya.
Streaming dictionary matching with mismatches

Pawel Gawrychowski, Jakub Radoszewski and Tatiana Starikovskaya.
Quasi-periodicity in streams

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and
Masayuki Takeda.
Computing runs on a trie

Bastien Cazaux and Eric Rivals.
Linking BWT and XBW via Aho-Corasick automaton: applications to
Run-Length Encoding

Mai Alzamel, Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka,
Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń
and Wiktor Zuba.
Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Diego Diaz-Dominguez, Travis Gagie and Gonzalo Navarro.
Simulating the DNA string graph in succinct space

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and
Masayuki Takeda.
Faster queries for longest substring palindrome after block edit

Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova and Murray
Patterson.
A rearrangement distance for fully-labelled trees

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki
Takeda.
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations

Diptarama Hendrian, Takuya Takagi and Shunsuke Inenaga.
Online Algorithms for Constructing Linear-size Suffix Trie

Oleg Merkurev and Arseny Shur.
Searching Long Repeats in Streams

WE LOOK FORWARD TO SEE YOU IN PISA!!!

Nadia Pisanti and Solon Pissis

--
Solon P. Pissis, Ph.D

Principal Investigator
Life Sciences and Health research group
Centrum Wiskunde & Informatica (CWI)
Science Park 123, 1098 XG Amsterdam
The Netherlands

Tel: +31 20 592 4263
Skype: solonas13
Email: solon.pissis@cwi.nl
WWW: https://homepages.cwi.nl/~solon/


**********************************************************
*
* 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] Full Professorship in Computer Science, Aarhus University

Full Professorship in Computer Science, Aarhus University

The Department of Computer Science (www.cs.au.dk) at Aarhus University
is looking for an excellent and visionary Full Professor of Computer
Science. Aarhus University has made an ambitious strategic investment in
a 5-year recruitment plan to radically expand the Department of Computer
Science. Therefore, we seek researchers driven by excellence in research
and visions for the future digitization agenda to join the department.

Application deadline is Monday June 3rd 2019.
For more information see
http://www.au.dk/om/stillinger/job/full-professorship-in-computer-science-aarhus-university-1


**********************************************************
*
* 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, March 23, 2019

[DMANET] [Extended Deadline-April 01] CFP SpaCCS 2019 (12+SIs): The 12th International Conference on Security, Privacy and Anonymity in Computation, Communication and Storage

Call For Papers
=============================================================================
The 12th International Conference on Security, Privacy and Anonymity in
Computation, Communication and Storage (SpaCCS 2019)
July 14-July 17, 2019, Atlanta, USA

http://cse.stfx.ca/~cybermatics/2019/spaccs/

All accepted papers will be published by Springer LNCS (EI Indexed). Best
Paper Awards will be presented to high quality papers. Distinguished
papers, after further revisions, will be be published in 12+ SCI & EI
indexed special issues (confirmed).
1. ACM Transactions on Internet Technology
Special Issue on Decentralized Blockchain Applications and Infrastructures
for Next Generation Cyber-Physical Systems
https://toit.acm.org/pdf/ACM-ToIT-CfP-Decentralized_Blockchain_Applications.pdf
Publisher: ACM, IF = 1.727
2. IEEE Transactions on Network Science and Engineering
Special Issue: Blockchain in Future Networks and Vertical Industries
Publisher: IEEE
3. IET Cyber-Physical Systems: Theory & Applications
Special Issue: Advanced Technologies for Cyber Physical Systems
Publisher: IET
4. IEEE Access
Special Section on Deep Learning: Security and Forensics Research Advances
and Challenges
https://ieeeaccess.ieee.org/special-sections/deep-learning-security-and-forensics-research-advances-and-challenges
Publisher: IEEE, IF = 3.557
5. Transactions on Blockchain Technology and Applications
http://vdlt.io/tIndex.html
Special Issue: Advances in Blockchain and Internet-of-Things
6. Digital Communications and Networks
Special Issue: TBD
Publisher: Elsevier, SCI indexed in 2019
7. Sensors
Special Issue: IoT-Enabled Sensor Networks: Vision and Challenges
https://www.mdpi.com/journal/sensors/special_issues/IoT_SensorNet
Publisher: MDPI, IF = 2.475
8. Remote Sensing
Special Issue: Intelligence Computing Paradigms with Remote Sensing
Networks in Water Hydrology
https://www.mdpi.com/journal/remotesensing/special_issues/water_Computational
Publisher: MDPI, IF = 3.406
9. Journal of Systems Architecture
Special Issue: Dependable Cyber Physical Systems (SI: DCPS19)
https://www.journals.elsevier.com/journal-of-systems-architecture/call-for-papers/special-issue-on-dependable-cyber-physical-systems-sidcps19
Publisher: Elsevier, IF = 0.913
10. EURASIP Journal on Wireless Communications and Networking
Special Issue: Human-centered Computing in Cloud / Edge / Fog
https://jwcn-eurasipjournals.springeropen.com/human-centered-computing
Publisher: Springer, IF = 2.407
11. EURASIP Journal on Wireless Communications and Networking
Special Issue: Multi-modal Sensor Data Fusion in Internet of Things
https://jwcn-eurasipjournals.springeropen.com/multi-modal-sensor
Publisher: Springer, IF = 2.407
12. CCF Transactions on Pervasive Computing and Interaction
Special Issue: Pervasive Intelligence: State-of-the- Art, Challenges and
Perspectives

* More special issues will be added later.
=============================================================================
The 2019 International Conference on Security, Privacy and Anonymity in
Computation, Communication and Storage (SpaCCS 2019) is the 12th event in
the series of conferences which are devoted to security, privacy and
anonymity in computation, communication and storage. SpaCCS is now
recognized as the main regular event of the world that is covering many
dimensions including security algorithms and architectures, privacy-aware
policies, regulations and techniques, anonymous computation and
communication, encompassing fundamental theoretical approaches, practical
experimental projects, and commercial application systems for computation,
communication and storage. As applications of computer systems and networks
have permeated in every aspect of our daily life, the issues of security,
privacy, and anonymity have become increasingly critical. The conference
will provide a forum for the world-class researchers to gather and share
their research achievements, emerging ideas and trends in the highly
challenging research fields.


==================
Important Dates
==================
Submission Deadline (Extended): April 01, 2019
Authors Notification Date: May 01, 2019
Final Manuscript Due: June 01, 2019
Conference Date: July 14 - July 17, 2019


==================
Topics of interest include, but are not limited to
==================
Track 1: Security
1.1 Computation
-Security Model and Architecture
- Software and System Security
- Secure computation
- Security in Cloud/Fog/Edge Computing and Pervasive/Ubiquitous Computing
- Artificial Intelligence
- Secure Network Computing
- Risk Analysis and Management
1.2 Communication
- Network Security
- Malware and Botnets
- Intrusion Detection
- Security in Web Services
- Security in Mobile Social Networks
- Security in Mobile and Wireless Communications
- Fraud and Cyber-Crime
1.3 Storage
- Access Control
- Accounting and Audit
- Applied Cryptography
- Database Security
- Authentication
- Computer forensics
- Data Protection and Data Integrity
- Digital Content Protection and Digital Forensics
- Information Hiding
- Security in Big Data and its Applications

Track 2: Privacy
2.1 Computation
- Measuring and Quantifying Privacy
- Privacy Modelling and Analysis
- Software and System Privacy
- Privacy-preserving Computing
- Differential Privacy
- Blockchain-based Computation
- Privacy-enhanced Network Computing
- Obfuscation-based Privacy
- Cryptographic Tools
- Building and Deploying Privacy-enhancing Systems
- Reliability, Robustness, and Abuse Prevention in Privacy Systems
2.2 Communication
- Privacy in Web Services
- Privacy Metrics and Policies
- Crowdsourcing for Privacy
- Location and Mobility Privacy
- Privacy in Cloud and Big Data Applications
- Blockchain-based Communication
- Quantum Communications
- Privacy in Ubiquitous Computing and Mobile Devices
- Privacy in Social Networks and Microblogging Systems
- Privacy-enhanced Access Control, Authentication, and Identity Management
2.3 Storage
- Data Protection Technologies
- Privacy in Big Data and its Applications
- Policy Languages and Tools for Privacy
- Privacy and Human Rights
- Blockchain-based Storage
- Interdisciplinary Research Connecting Privacy to Other Fields
- Privacy in Cloud Computing and Pervasive/Ubiquitous Computing
- Information Leakage, Data Correlation and Generic Attacks to Privacy
- Privacy-Preserving Data Mining, Data Release and Publishing

Track 3: Anonymity
3.1 Computation
- Anonymous Data Mining and Data Sharing
- Parallelism Exploitation Techniques for Anonymity
- Anonymity in Big Data Analytics
- Anonymous Management in Trust Relationships
- Anonymous Video Analytics Technology
- Anonymity Metrics, Measures and Evaluations
- Anonymity Models, Hardware/Device of Anonymity
3.2 Communication
- Anonymity in Wireless Communication Systems
- Anonymous Communication Protocols
- Anonymity in Mobile, Ad Hoc, and Wireless Sensor Networks
- Anonymous Proxy Software
- Anonymous Communication and Internet
- Anonymous Social Networks, Structural k-Anonymity in Social Networks
- Authentication Protocol Providing User Anonymity
3.3 Storage
- Anonymous Information Storage and Management
- Private and Anonymous Data Storage
- Forensics
- Anonymity-Preserving Data Collection and Database
- Anonymity, Pseudonymity & Identity Management
- Anonymity in Big Data and Cloud Scenarios
- Anonymity in Health and Medical Databases


==================
Paper Submission
==================
All papers need to be submitted electronically through the conference
website (https://edas.info/N25666) with PDF format. Submitted papers must
not substantially overlap with papers that have been published or that are
simultaneously submitted to a journal or a conference with proceedings.
Papers must be clearly presented in English, must not exceed 14 pages (or
up to 20 pages with the pages over length charge) in Springer LNCS format (
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines),
including tables, figures, references and appendices. Papers will be
selected based on their originality, significance, relevance, and clarity
of presentation assessed by at least three reviewers. Submission of a paper
should be regarded as a commitment that, should the paper be accepted, at
least one of the authors will register and attend the conference to present
the work.


==================
Organizing Committee
==================
General Chairs
- Kim-Kwang Raymond Choo, University of Texas at San Antonio, USA
- Mark Last, Ben-Gurion University of the Negev, Israel
- Yanqing Zhang, Georgia State University, USA

Program Chairs
- Md Zakirul Alam Bhuiyan, Fordham University, USA
- Jun Feng, St Francis Xavier University, Canada
- Rongxing Lu, University of New Brunswick, Canada

Workshop Chair
- Wm. Bradley Glisson, Sam Houston State University, USA

Publicity Chairs
- Peter Mueller, IBM Zurich Research Laboratory, Switzerland
- Reza M. Parizi, Kennesaw State University, USA
- Yogachandran Rahulamathavan, Loughborough University London, UK

Local Chair
- Yubao Wu, Georgia State University, USA

Web Chairs
- Zihao Jiang, St. Francis Xavier University, Canada
- Xin Nie, Huazhong University of Science and Technology, China

Steering Committee
- Guojun Wang, Guangzhou University, China (Chair)
- Gregorio Martinez, University of Murcia, Spain (Chair)
- Jemal H. Abawajy, Deakin University, Australia
- Jose M. Alcaraz Calero, University of the West of Scotland, UK
- Jiannong Cao, Hong Kong Polytechnic University, Hong Kong
- Hsiao-Hwa Chen, National Cheng Kung University, Taiwan
- Jinjun Chen, University of Technology Sydney, Australia
- Kim-Kwang Raymond Choo, University of Texas at San Antonio, USA
- Robert Deng, Singapore Management University, Singapore
- Mario Freire, The University of Beira Interior, Portuga
- Minyi Guo, Shanghai Jiao Tong University, China
- Weijia Jia, Shanghai Jiao Tong University, China
- Wei Jie, University of West London, UK
- Georgios Kambourakis, University of the Aegean, Greece
- Ryan Ko, University of Waikato, New Zealand
- Constantinos Kolias, George Mason University, USA
- Jianbin Li, Central South University, China
- Jie Li, University of Tsukuba, Japan
- Jianhua Ma, Hosei University, Japan
- Felix Gomez Marmol, University of Murcia, Spain
- Geyong Min, University of Exeter, UK
- Peter Mueller, IBM Zurich Research Laboratory, Switzerland
- Indrakshi Ray, Colorado State University, USA
- Kouichi Sakurai, Kyushu University, Japan
- Juan E. Tapiador, The University Carlos III of Madrid, Spain
- Sabu M. Thampi, Indian Institute of Information Technology and
Management, India
- Jie Wu, Temple University, USA
- Yang Xiao, The University of Alabama, USA
- Yang Xiang, Swinburne University of Technology, Australia
- Zheng Yan, Aalto University, Finland
- Laurence T. Yang, St. Francis Xavier University, Canada
- Wanlei Zhou, University of Technology Sydney, Australia


--
Dr. Jun Feng
St. Francis Xavier University
Huazhong University of Science and Technology
Mobile: +86-18827365073
E-Mails: junfeng989@gmail.com, 512675288@qq.com
WeChat: junfeng10001000

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

Friday, March 22, 2019

[DMANET] Summer School on Randomness and Learning in Non-Linear Algebra at Max Planck Institute for Mathematics in the Sciences

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

Summer School on Randomness and Learning in Non-Linear Algebra
<https://www.mis.mpg.de/calendar/conferences/2019/ranlearn2019.html>

July 01 - 04, 2019

Max Planck Institute for Mathematics in the Sciences

Leipzig, Germany

*** Poster submissions and registration are NOW OPEN. ***

*** Travel funding applications are being accepted until April 1st, 2019.
***

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

Speakers:

This summer school will be bringing together researchers working on
probabilistic and statistical methods and questions in nonlinear algebra.

Keynote speakers:

-

Peter Bürgisser (Technische Universität Berlin)
-

Daniel Erman (University of Wisconsin-Madison)
-

Antonio Lerario (Scuola Internazionale Superiore di Studi Avanzati)


Invited guest speakers:

-

Serkan Hosten (San Francisco State University)
-

David Kahle (Baylor University)
-

Robert Krone (University of California, Davis)
-

Uwe Nagel (University of Kentucky)
-

Michael Stillman (Cornell University)
-

Dane Wilburne (York University)
-

Jay Yang (University of Minnesota)
-

Shahrzad (Sara) Jamshidi Zelenberg (Illinois Institute of Technology)


Scientific Organizers:

-

Paul Breiding, MPI for Mathematics in the Sciences
-

Jesus A. De Loera, University of California at Davis
-

Sonja Petrovic, Illinois Institute of Technology
-

Despina Stasi, Illinois Institute of Technology


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

Registration, funding, and poster session information:

Students, postdocs, and other early career researchers are strongly
encouraged to submit a poster to present at the poster session.

Travel funding is available: all interested participants may apply for
funding during the registration process and will receive further
instructions in their confirmation email.

*** Funding decisions will be made by April 15th, 2019. ***

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

Logistical information:

For information about travel to the institute, please check the "Travel
instructions <https://www.mis.mpg.de/institute/howtofind.html>" link from
the school homepage.

US-based participants who anticipate that they may receive a travel
allowance from our NSF grant will need to comply with the agency's travel
guidelines (see below).

We have blocked several rooms at a nearby hotel at 69 Euro per night for a
single room (excluding breakfast); information on how to reserve these will
be contained at registration through email. The rooms will be blocked until May
19, 2019.

NSF guidelines for air travel:

See section G. INTERNATIONAL CONSIDERATIONS on this site:
https://www.nsf.gov/pubs/policydocs/pappguide/nsf13001/aag_6.jsp

Participants may note that, depending on their origin/destination city
pair, they don't necessarily have to use a US-flag carrier to fly to the
school. To see if this is the case, please check the city-pair requirement
of the Open-Skies agreement (there are links on the site above).

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

Despina Stasi, PhD
Department of Applied Mathematics
Illinois Institute of Technology

Office: John T. Rettaliata Engineering Center, Room 118b
Office Tel: 312-567-8933
Email: despina.stasi@iit.edu <stasdes@iit.edu>
mypages.iit.edu/~stasdes

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

[DMANET] Tenure Track Position in Data Science at Ryerson University

Dear colleagues,

The Department of Mechanical and Industrial Engineering at Ryerson
University invites applications for a tenure-stream faculty position in the
area of data science and machine learning at the rank of Assistant
Professor, starting July 1, 2019. Please see the following link for details:

https://hr.cf.ryerson.ca/ams/faculty/preview.cfm?posting_id=524013

Regards,
Ayse

--
Ay*ÅŸ*e Ba*ÅŸ*ar Bener, PhD
Professor and Director
Data Science Lab
Department of Mechanical and Industrial Engineering

Program Director, MSc in Data Science and Analytics
Program Director, Certificate in Data Analytics, Big Data
and Predictive Analytics.

Affiliated Scientist, St. Michael's Hospital
Research Fellow, IBM CAS

Director, Big Data, Office of the Provost and Vice President Academic
Ryerson University
350 Victoria Street, Toronto, ON Canada M5B 2K3
Tel: 1 416 979 5000, X- 553155
Web: http://www.ryerson.ca/~abener/
Web: http://www.datasciencelab.ca

**********************************************************
*
* 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 position in Global Optimization at Charles University in Prague

======================================================
Postdoc position
Department of Applied Mathematics (KAM)
Charles University, Faculty of Mathematics and Physics
Prague, Czech Republic
======================================================

Applications are invited for a postdoc position at Charles University in
Prague, Czech Republic. The position is for one year (with possibility
of renewal), starting July 1, 2019.

The topic of the project is:

"Interval methods for global optimization"

In particular, the research will be conducted in some of the following
directions:

- Interval linear algebra for global optimization, properties of
interval matrices, complexity issues
- Theory and methods for checking fundamental properties of functions
on feasible domains
- Convex underestimators and the corresponding relaxation properties
- Investigation of enclosing objects, relaxation on these objects and
development of contractors

Candidates should have a completed PhD in Mathematics or Computer
Science, and demonstrate potential for excellence in research. It is
expected to have strong background in optimization. Skills in operations
research, interval computation and programming are appreciated as well.

Please send your CV and cover letter by April 30, 2019, electronically
to:
Milan Hladik (head of the Optimization and Interval Methods Group)
hladik@kam.mff.cuni.cz
https://kam.mff.cuni.cz/~hladik/

Department webpage:
https://kam.mff.cuni.cz/

Interval Methods Group webpage:
https://kam.mff.cuni.cz/gim/index.html

======================================================
contact:
Milan Hladík
Associate Professor,
Charles University, Faculty of Mathematics and Physics,
Department of Applied Mathematics,
Malostranske nam. 25, 118 00, Prague, Czech Republic
e-mail: hladik@kam.mff.cuni.cz
https://kam.mff.cuni.cz/~hladik
======================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] Call for Abstracts: ECCO XXXII Conference - Malta 2019

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

ECCO XXXII Conference - 2019

MALTA, 30 May - 1 June 2019

<https://ecco2019.euro-online.org/> https://ecco2019.euro-online.org/

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

Deadline for Submission of Abstracts

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

Submission of Abstracts for Contributed Talks:

The deadline for the submission of abstracts has been extended to 31st March
2019. Abstracts should be submitted by e-mail on ecco2019malta@outlook.com
using the LaTeX template provided here:
https://ecco2019.euro-online.org/contributed-talks.html.

Special Issue dedicated to the Conference:

A special issue of the "Journal of Combinatorial Optimization" (see
<https://link.springer.com/journal/10878>
https://link.springer.com/journal/10878), containing selected full length
papers, refereed according to the high standards of the Journal, will be
dedicated to the Conference.

Normal Registration Period: ***Closing 14th April 2019!***

The registration form can be found on:
<https://ecco2019.euro-online.org/registration.html>
https://ecco2019.euro-online.org/registration.html. The fee of 190 EUR
includes the Conference Registration Fee and Conference Pack, the Conference
Dinner for the Participant, the Conference Outing for the Participant, and
the Welcome Reception for the Participant and any Accompanying Person.

Further information:

Website: <https://ecco2019.euro-online.org/>
https://ecco2019.euro-online.org/

e-mail: <mailto:ecco2019malta@outlook.com> ecco2019malta@outlook.com

Contact:

John Baptist Gauci

Department of Mathematics, Faculty of Science, University of Malta, Msida
MSD2080, Malta

T: +356 2340 2357

E: <mailto:john-baptist.gauci@um.edu.mt> john-baptist.gauci@um.edu.mt

W: <https://www.um.edu.mt/profile/johnbaptistgauci>
https://www.um.edu.mt/profile/johnbaptistgauci


**********************************************************
*
* 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, March 21, 2019

[DMANET] CiE 2019: Call for Informal Presentations

========================================
CiE 2019 CALL FOR INFORMAL PRESENTATIONS:
=========================================
CiE 2019: Computing with Foresight and Industry
Durham, United Kingdom
July 15 - July 19, 2019
https://community.dur.ac.uk/cie.2019/
http://www.computability.org.uk

IMPORTANT DATES:
============================
Deadline for informal presentations submission: 1 May 2019
(The notifications of acceptance for informal presentations will be sent a few days after submission.)

Early registration before: 17 May 2019

CiE 2019 is the 15th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world.

Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017) and Kiel (2018).

TUTORIAL SPEAKERS:
==================
- Markus Holzer (JLU Giessen)
- Assia Mahboubi (University of Nantes)

INVITED SPEAKERS:
=================
- Felipe Cucker (City University of Hong Kong)
- Ursula Martin (University of Oxford)
- Alexander Schönhuth (CWI, Amsterdam)
- Sonja Smets (University of Amsterdam)
- Linda Brown Westrick (Penn State)

HOSTED BY:
=============
Algorithms and Complexity in Durham (ACiD), a research group in the Department of Computer Science, Durham University

For questions please contact the organisers at the e-mail address cie.2019@durham.ac.uk.

SPECIAL SESSIONS:
=================
Computational Neuroscience, organised by Noura Al Moubayed (Durham University) and Jason Connolly (Durham University)

- Ulrik Beierholm (Durham University)
- Netta Cohen (Leeds University)
- Evelyne Sernagor (Newcastle University)
- V Anne Smith (University of St Andrews)

History and Philosophy of Computing, organised by the Council of the HaPoC Commission

- Tony Hoare (University of Oxford, via Skype)
- Michael Jackson (Open University)
- Ray Turner (University of Essex)

Lowness Notions in Computability, organised by Johanna Franklin (Hofstra University) and Joseph S. Miller (University of Wisconsin-Madison)

- Kenshi Miyabe (Meiji University)
- Benoit Monin (LACL, Créteil University)
- Keng Meng Ng (Nanyang Technological University)
- Don Stull (LORIA)

Probabilistic Programming and Higher-Order Computation, organised by Christine Tasson (Paris Diderot University)

- Thomas Ehrhard (IRIF, Paris Diderot University)
- Cameron Freer (MIT)
- Joost-Pieter Katoen (RWTH Aachen)
- Sam Staton (University of Oxford)

Smoothed and Probabilistic Analysis of Algorithms, organised by Bodo Manthey (University of Twente)

- Sophie Huiberts (CWI, Amsterdam)
- Stefan Klootwijk (University of Twente)
- Clemens Rösner (University of Bonn)
- Sebastian Wild (University of Waterloo)

Transfinite Computations, organised by Sabrina Ouazzani (LIX, École Polytechnique)

- Merlin Carl (University of Konstanz)
- Lorenzo Galeotti (University of Hamburg)
- Benjamin Rin (Utrecht University)
- Philip Welch (University of Bristol)

CONTRIBUTED PAPERS:
===================

The list of accepted papers can be found at https://community.dur.ac.uk/cie.2019/.

INFORMAL PRESENTATIONS:
=======================

Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://easychair.org/conferences/?conf=cie2019), using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines) and be 1 page; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2019 may appear or may have appeared in other conferences with formal proceedings and/or in journals.

WOMEN IN COMPUTABILITY:
=======================

We are very happy to announce that within the framework of the Women in Computability programme, sponsored by ACM-Women, we are able to offer four grants of up to 250 EUR for junior female researchers who want to participate in CiE 2019. Applications for this grant should be sent to Liesbeth De Mol, liesbeth.demol@univ-lille3.fr, before 15 May 2019 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior female researchers who are presenting a paper (including informal presentations) at CiE 2019.

HaPoc Travel Grants
======================

The HaPoc Council offers two HaPoC travel grants of 250USD each to support participation in the conference. To be eligible for a grant, an accepted paper or informal presentation in the area of history and/or philosophy of computing is required. Applications for these grants must be made to HaPoC directly, see hapoc.org/node/284 for further details.

ASL Travel Grants
======================

Students, who are members of the Association for Symbolic Logic, may apply for (limited) ASL travel funds that the ASL is making available for sponsored meetings. See aslonline.org/meetings/student-travel-awards/.


Association CiE:
http://www.computability.org.uk

CiE Conference Series:
http://www.computability.org.uk/index.php/cie-conference-series/
**********************************************************
*
* 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] GECCO 2019: Workshop on Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM)

< We apologize for multiple posting. Please kindly disseminate this Call for Papers to your colleagues and contacts>

***********************************************************
CALL FOR PAPERS
***********************************************************
Workshop on
Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM)

The Genetic and Evolutionary Computation Conference (GECCO 2019)
July 13-17, 2019, Prague, Czech Republic

Paper submission deadline: April 3, 2019
Webpage: http://blogs.exeter.ac.uk/ecmcdm/
***********************************************************



About the workshop
In many real-world problems, several conflicting objectives need to be optimized simultaneously. Therefore, it is crucial to properly structure and solve the problem with relevant tools for supporting a decision maker. Multiple criteria decision making (MCDM) tools have been found to be useful in several such applications e.g. health care, education, environment, transportation, business and production. In recent years, there has also been growing interest in merging EC and MCDM techniques for several applications. This workshop will showcase research that is both at the interface of EC and MCDM as well as in the more traditional MCDM domain.
The workshop on Evolutionary Computation + Multiple Criteria Decision Making (EC + MCDM) to be held in GECCO 2019 aims to promote the research on theory and applications in the field. Topics of interest (but not limited to) include:

• Preference elicitation and representation
• Interactive multiobjective optimization or decision maker in the loop
• Visualization in EC + MCDM
• Aggregation/trade-off operators & algorithms
• Fuzzy logic based decision making techniques
• Bayesian and other decision making techniques
• Interactive multiobjective optimization for (computationally) expensive problems
• Using surrogates (or metamodels) in MCDM
• Hybridization of EC and MCDM
• Scalability in EC + MCDM
• MCDM and machine learning
• MCDM for Big data
• MCDM in real-world applications
• Exploring and using cognitive capabilities in MCDM
• Use of psychological tools to aid decision maker

Submission
We invite papers up to 8 pages relevant to the workshop and position papers of up to 2 pages showing preliminary results. We also welcome posters, demonstrations or presentations on ground-breaking theoretical and application results in the field. Accepted papers will be published in the GECCO Companion Proceedings and will be presented orally at the workshop.

For paper submission instructions and templates, please see: https://gecco-2019.sigevo.org/index.html/Workshops

Important dates
Submission opening: February 27, 2019
Submission deadline: April 3, 2019
Reviews due: April 13, 2019
Decisions due: April 17, 2019
Camera-Ready Material: April 24, 2019
Early author registration: April 24, 2019

Workshop organizers
Tinkle Chugh (University of Exeter, UK)
Richard Allmendinger (Alliance Manchester Business School, University of Manchester, UK)
Jussi Hakanen (Faculty of Information Technology, University of Jyväskylä, Finland)

More information about the organizers can be found on the workshop webpage http://blogs.exeter.ac.uk/ecmcdm/

Contact
Please feel free contact any of the special session organizers at (t.chugh@exeter.ac.uk<mailto:t.chugh@exeter.ac.uk>, richard.allmendinger@manchester.ac.uk<mailto:richard.allmendinger@manchester.ac.uk>, jussi.hakanen@jyu.fi<mailto:jussi.hakanen@jyu.fi>) in case you have any questions about the workshop.










**********************************************************
*
* 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] Academic positions at Maastricht University School of Business and Economics

Position(s): Assistant Professors (Tenure Track) in Algorithms & Optimization, Computational Statistics, Machine Learning and Data Mining

Department/University: Department of Business Analytics, Maastricht University School of Business and Economics

Location: Maastricht, the Netherlands

Application deadline: March 31, 2019

JOB DESCRIPTION
The new department of Business Analytics at the Maastricht University School of Business and Economics (SBE) is committed to high quality research and education. Our goal is to combine academic technical rigor with industrial relevance and impact. The department is looking for talented and ambitious data scientists for several tenure track Assistant Professor positions in Business Analytics/Intelligence. Experts in Algorithms & Optimization, Computational Statistics, Machine Learning and Data Mining are especially encouraged to apply. The Assistant Professor contributes high quality research in the field of Business Analytics/Intelligence to the department and is committed to collaborate with the other researchers within SBE as well as beyond. The Assistant Professor teaches and coordinates courses in the area of Business Analytics/Intelligence in bachelor, in master, and in post-graduate programs. The Assistant Professor contributes to the design of a new bachelor program in Business Analytics, to the development of this program and further development of the existing master programs related to Business Intelligence. Education is performed within small groups according to the Problem Based Learning principle. We strive to excel in teaching and in innovative teaching methods. All teaching at SBE is in English.

REQUIREMENTS
The applicant should hold a PhD degree in econometrics, statistics, data science, computer science, operations research, mathematics, artificial intelligence. The applicant should have commitment to excellence in research. The candidate must have strong affinity to applied research and industrial projects. The applicant should have acquired teaching experience. The department appreciates an open mind to multidisciplinary research, non-mainstream approaches to applications and data-driven research, and the ambition to combine rigor with relevance.

CONDITIONS OF EMPLOYMENT
The terms of employment of Maastricht University are set out in the Collective Labor Agreement of Dutch Universities (CAO). Furthermore, local UM provisions also apply. For more information look at the website: http://www.maastrichtuniversity.nl > Support > UM employees. Initially, candidates are employed on a temporary contract as assistant professor (level 2) and agree to specific development goals. Five years into the appointment, candidates will be evaluated and if the development goals have been met, promoted to assistant professor (level 1) on a permanent contract. The evaluation can be brought forward if criteria are met earlier. On the candidate's request the evaluation can be deferred in case of special personal circumstances, such as pregnancy leave, parental leave or chronic illness. Decisions about contract renewal, promotion and tenure are based on individual performance, principally in research and teaching. The tenure track criteria are ambitious but set so as to be attainable. Maastricht University salaries are competitive with those at the top European universities and annual teaching loads are comparable.

EMPLOYER
Maastricht University (www.maastrichtuniversity.nl) is renowned for its unique, innovative, problem-based learning system, which is characterized by a small-scale and student-oriented approach. Research at UM is characterized by a multidisciplinary and thematic approach, and is concentrated in research institutes and schools. Maastricht University has around 16,300 students and 4,300 employees. Reflecting the university's strong international profile, a fair amount of both students and staff are from abroad. The university hosts 6 faculties: Faculty of Health, Medicine and Life Sciences, Faculty of Law, School of Business and Economics, Faculty of Science and Engineering, Faculty of Arts and Social Sciences, Faculty of Psychology and Neuroscience. The School of Business and Economics (abbreviated as SBE) is a high-level European school in the fields of Economics and International Business Administration and is accredited by both the AACSB and EQUIS. The school is located in the heart of Maastricht. The key characteristics of SBE are small-scale teaching methods, a portfolio of international study programs, and strong incentives for top-quality research. SBE attracts outstanding students from over 60 countries on its MBA, Bachelor, Masters, Ph.D., and executive education programs (all in English). Forty percent of the student population and thirty-five percent of the academic faculty come from outside The Netherlands.

DEPARTMENT
Department of Business Analytics is a brand new department in the School of Business and Economics. It is created to boost high quality collaborative multi-disciplinary research in the areas of business analytics and business intelligence. Data Science in Maastricht University is strongly represented by several collaborating units: Institute of Data Science, Institute of Business Intelligence and Smart Services, Department of Data Science and Knowledge Engineering, Department of Quantitative Economics, and the new Department of Business Analytics. The new department is responsible for design, starting and further developing of a new BSc program in Business Analytics, next to the existing MSc programs related to Business Intelligence. Moreover, Department of Business Analytics will disseminate and propagate data analytic knowledge and skills within SBE, participate in post-graduate educational programs of the faculty. Research and education at the department are expected to be at the highest European level and members of the department are expected to publish their research in the leading international journals. The department is committed to building a culturally diverse faculty and strongly encourages applications from female and minority candidates.

APPLICATION PROCEDURE
Applications should be sent electronically to recruitment-sbe@maastrichtuniversity.nl<mailto:recruitment-sbe@maastrichtuniversity.nl> ultimately 31 March 2019. Please, don't forget to mention the job vacancy number AT2019.072 in your letter. Applications must include curriculum vitae, a motivation letter, and two names of references as well as a relevant job market paper, and any available teaching evaluations. Selected applicants will be invited for an interview in April 2019.

Maastricht University is committed to nurturing an inclusive culture and a welcoming atmosphere. This inclusiveness strategy has resulted in a very diverse representation of nationalities and cultures. We strongly believe that diversity (including, but not limited to nationality, age and gender) of the staff and student population will increase the quality of UM education & research. Fostering diversity and inclusivity creates an academic community where individual talents thrive, and values and differences are cherished. We strongly encourage you to apply if you are qualified for this position.

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