Monday, October 8, 2018

[DMANET] PhD studentship in optimization, Strathclyde Business School (Glasgow, UK)

A PhD studentship in optimization is available at the Dept. of Management Science, University of Strathclyde Business School, Glasgow, UK, for the project entitled "Multi-Level Robust Optimization: Theory, Algorithms and Practice". Funding is available to cover 3 years of tuition fees plus a tax free stipend (£14,777 per year for 2018-19, and increased every academic year). The studentship is open to candidates from any nationality (UK/EU/international), and the fees will be fully covered at the international level.

The application deadline is midnight of 25th October 2018 Thursday. There may be a short phone/Skype interview on 29th and 30th October, so the applicants should be available on either of these two days. The successful candidate will be expected to start their PhD in January 2019 (but no later than 1st April 2019 due to funding constraints). Only complete applications (including a successful English test result, if applicable) from excellent candidates will be accepted, please see eligibility below before applying.

FUNDING AND ELIGIBILITY
Funding is available to cover 3 years of tuition fees at the UK/EU/international level, plus a tax free stipend of £14,777 for 2018-19, increased incrementally every year for inflation. The student will also have access to a minimum travel fund of £3,500 (with further funds from the department available) to attend a conference and/or specialized training (such as NATCOR courses) every year.

The PhD project requires a highly numerate graduate with interests in mathematical optimization. Candidates should have at least a First Class Honours degree or equivalent (e.g., a B.Sc. degree with 3.4 GPA in a 4.0 system), and/or preferably a Master's degree in a quantitative discipline such as industrial engineering, operations research, mathematics or computer science (amongst others). Experience in programming and fundamental knowledge in optimization are not essential but highly desirable (there will be training opportunities throughout PhD). Candidates who are not native English speakers will be required to provide evidence for their English skills (such as by IELTS or similar tests that are approved by UKVI, or a degree completed in an English speaking country - please note that this is essential for visa applications of non-EU candidates. If you have a scheduled test before 1st November 2018, also feel free to submit your application).

Applications are admitted until end of Thursday 25th October 2018.

HOW TO APPLY
Please submit your complete applications to Dr Euan Barlow (euan.barlow@strath.ac.uk), with email subject "PhD application for multi-level robust optimization". Your application should include:
- One-page cover letter,
- CV,
- Scans of any university degree certificates and transcripts (no other certificates),
- English test results (if applicable - check UKVI webpages for further information), and
- Two recommendation letters (or contact details of two referees, if letters are not available to them).

There may be brief (20 minutes) phone/Skype interviews on Monday 29th October and Tuesday 30th October, so if you are available only on one of these days, please ensure to note this in your cover letter. You will be notified end of Friday 26th October if you are shortlisted for an interview.

If you are a non-EU/EEA citizen requiring a visa to study in the UK, please ensure to check information available on official UKVI websites, in particular for recognized English tests (note TOEFL is *not* recognized) and recognized English speaking countries, if you are a national of or obtained a higher education degree in one of these countries.

Applications not satisfying the eligibility requirements will be disregarded.

More information about the department can be found here: http://www.strath.ac.uk/business/managementscience/

Informal enquiries about the project should be directed to Dr Euan Barlow (euan.barlow@strath.ac.uk).

ABOUT THE PROJECT
In practice, decision-problems which concern planning horizons spanning several months or years will typically involve various sources of uncertainty, and in many cases these uncertainties will impact decisions over differing time-scales and in different levels of the problem. Accurately accounting for these uncertainties in an optimization model is challenging with traditional approaches, as all uncertainties would generally be treated simultaneously. The proposed project will develop novel optimization theory and methodologies to tackle this general class of problems, namely multi-level robust optimization problems (and potentially its extension to multi-objective problems). Efficient algorithmic approaches to tackling this new class of optimization problem will then be investigated.

As various complex logistics problems demonstrate, many real world problems come in the form of multi-level decision problems with different uncertainties apparent at different levels of the problem. Such complex decision-problems necessitate computationally tractable frameworks which can enable key stakeholders to establish near-optimal decisions in short time-scales, in addition to establishing a rigorous theoretical understanding of the mathematical properties of these problems in order to design and develop computational tools most effectively. Although some efficient approaches exist for the multi-level optimization problems, there remain challenges in solving these problems, e.g., how do different levels interact with each other and how much ''influence'' do they have on each other. Such challenges increase in the presence of uncertainties, and are magnified even further when the problems also become multi-objective, as the analysis on how to weigh different objectives is extremely complex. There is only very limited and application-specific work in the literature regarding parameter uncertainties in case of multi-level optimization problems, albeit without any theoretical understanding of the underlying mathematical structures and challenges.

The PhD project aims to address research questions such as:
- Can we establish a thorough theoretical understanding of the structure of the robust multi-level optimization problems, including alternative reformulations of the problems and their theoretical strengths and weaknesses? Furthermore, can we extend such results to the case of multi-objective problems?
- Can we exploit the statistical or structural properties of these problems in the design of efficient algorithms? How effective can such algorithms be, whether in regard to theoretical or computational limitations?
- Can we apply these algorithms effectively to case studies representing a number of different practical decision-problems?

Depending on the interests and skills of the successful PhD student, there is flexibility on which research question(s) to pursue.

**********************************************************
*
* 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] CiE 2019: First Call for Papers

============================
CiE 2019 FIRST CALL FOR PAPERS:
============================
CiE 2019
Durham, United Kingdom
July 15 - July 19, 2019
https://community.dur.ac.uk/cie.2019/
http://www.computability.org.uk

IMPORTANT DATES:
============================
Deadline for article registration (abstract submission): 7 January 2019 AOE
Deadline for article submission: 14 January 2019 AOE
Notification of acceptance: 18 March 2019
Final versions due: 4 April 2019

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: 15 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, orrganised by Noura Al Moubayed (Durham University) and Jason Connolly (Durham University)

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

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

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

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

- Transfinite Computations, organised by Sabrina Ouazzani (Paris-Est Créteil University)

The speakers of the special sessions will be announced soon.

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

Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of:

Erika Abraham (RWTH Aachen)
Merlin Carl (University of Konstanz)
Erzsébet Csuhaj-Varjú (Eötvös Loránd University)
Walter Dean (University of Warwick)
Henning Fernau (University of Trier)
Gianluca Della Vedova (University of Milano-Bicocca)
Liesbeth De Mol (University of Lille)
Valerie de Paiva (Nuance Communications)
Alessandra Di Pierro (University of Verona)
Johanna Franklin (Hofstra University)
Pawel Gawrychowski (University of Wrocław)
Pinar Heggernes (University of Bergen)
Mathieu Hoyrup (LORIA)
Peter Jonsson (Linköping University)
Dietrich Kuske (TU Ilmenau)
Stephane Le Roux (TU Darmstadt)
Benedikt Löwe (University of Amsterdam)
Florin Manea (Christian-Albrechts-University)
Barnaby Martin (Durham University)
Elvira Mayordomo (University of Zaragoza)
Klaus Meer (BTU Cottbus-Senftenberg)
Dirk Nowotka (Christian-Albrechts-University)
Arno Pauly (Swansea University)
Daniel Paulusma (Durham University, co-chair)
Daniela Petrisan (Paris Diderot University)
Giuseppe Primiero (University of Milan, co-chair)
Christine Tasson (Paris Diderot University)
Hélène Touzet (University of Lille)
Peter Van Emde Boas (University of Amsterdam)
Georg Zetzsche (Paris Diderot University)

The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics.

THE PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) to submit their papers in all areas related to the above for presentation at the conference and inclusion in the proceedings of CiE 2019 at https://easychair.org/conferences/?conf=cie2019 .

Papers must be submitted in PDF format, using the LNCS style (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines) and must have a maximum of 12 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Papers building bridges between different parts of the research community are particularly welcome.

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

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, we are able to offer some 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.

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

Sunday, October 7, 2018

[DMANET] DISC 2018: Final Call for Participation

DISC 2018 - International Symposium on Distributed Computing
October 15-19, 2018, New Orleans, Louisiana
http://www.disc-conference.org/wp/disc2018/

Registration and Student Travel Grants
======================================

Conference registration:
http://www.disc-conference.org/wp/disc2018/registration/

Information on student travel awards:
http://www.disc-conference.org/wp/disc2018/nsf-travel-awards/


Conference Program
===============

http://www.disc-conference.org/wp/disc2018/program/


Local Information & Hotels
==========================

The conference will be held in the Hampton Inn & Suites New
Orleans-Convention Center 1201 Convention Center Blvd, New Orleans
Louisiana, 70130. The block of rooms at the conference hotel has been fully
booked and another block of rooms has been acquired at another Hampton Inn
& Suites. These additional rooms are located at Hampton Inn & Suites New
Orleans Downtown (French Quarter Area) 226 Carondelet Street, New Orleans
Louisiana, 70130. For information on how to book, please see:
http://www.disc-conference.org/wp/disc2018/hotel-information/

For more information on traveling to the venue please see:
http://www.disc-conference.org/wp/disc2018/location-information/


Invited Speakers
================

* Sandor Fekete (Technische Universität Braunschweig)
* Tom Goldstein (University of Maryland)
* Michael Mendler (Universität Bamberg)


Workshops
=========

* ADGA: Workshop on Advances in Distributed Graph Algorithms (October 15,
2018) http://adga.hiit.fi/
* SCNDS: Workshop on Storage, Control, Networking in Dynamic Systems
(October 19, 2018) https://sites.google.com/site/scnds2018/

**********************************************************
*
* 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] ICDCN 2019 - List of Accepted Papers

===================================================================
DISTRIBUTED COMPUTING TRACK: FULL PAPERS

*Round Efficient Computationally Secure Multi-party Computation Revisited
Authors: L. Bangalore, A. Choudhury, G. Garimella

*Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity
Authors: L. Barenboim, Y. Tzur

*Sublinear-Time Mutual Visibility for Fat Oblivious Robots
Authors: P. Poudel, G. Sharma, A. Aljohani

*Parallel Algorithms for Predicate Detection
Authors: V. Garg, R. Garg

*Reconfigurable Dataflow Graphs For Processing-In-Memory
Authors: C. Shelor, K. Kavi

*Silent Self-Stabilizing Scheme for Spanning-Tree-like Construction
Authors: S. Devismes, D. Ilcinkas, C. Johnen

*The Weakest Failure Detector to Solve the Mutual Exclusion Problem in an Unknown Dynamic Environment
Authors: E. Mauffret, D. Jeanneau, L. Arantes, P. Sens

*Benefit of Self-Stabilizing Protocols in Eventually Consistent Key-Value Stores: A Case Study
Authors: D. Nguyen, S. Kulkarni, A. Datta

*Efficient Dispersion of Mobile Robots on Graphs
Authors: A. Kshemkalyani, F. Ali

*Perfectly Secure Message Transmission over Partially Synchronous Networks
Authors: R. Kishore, A. Inumella, K. Srinathan

*Improving Efficacy of Concurrent Internal Binary Search Trees using Local Recovery
Authors: A. Ramachandran, N. Mittal

*A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries
Authors: B. Chatterjee, S. Peri, M. Sa, N. Singhal

*Session Guarantees with Raft and Hybrid Logical Clocks
Authors: M. Roohitavaf, J. Ahn, W. Kang, K. Ren, G. Zhang, S. Ben-Romdhane, S. Kulkarni

*Time-Optimal Uniform Scattering in a Grid
Authors: P. Poudel, G. Sharma

*A simple 2(1 – 1/\ell ) factor distributed approximation algorithm for Steiner tree in the CONGEST model
Authors: P. Saikia, S. Karmakar

*Consistify: Preserving Correctness and SLA Under Weak Consistency
Authors: S. Sidhanta, W. Golab, S. Mukhopadhyay


DISTRIBUTED COMPUTING TRACK: SHORT PAPERS

*Big Data Analytics Framework for Spatial Data
Authors: P. Shah, S. Chaudhary

*Odd-Even Based Adaptive Two-way Routing in Mesh NoCs for Hotspot Mitigation
Authors: R. S. Reshma Raj, C. Gayathri, Saidalavi Kalady, P.B. Jayaraj

*On the Hardness of the Strongly Dependent Decision Problem
Authors: M. Biely, P. Robinson

*QoS and Performance Metrics for Container-based Virtualization in Cloud Environments
Authors: I. Jawarneh, P. Bellavista, F. Bosi, L. Foschini, G. Martuscelli, R. Montanari, A. Palopoli

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

NETWORKING TRACK: FULL PAPERS

*Distributed Alpha-Fair Transmit Power Adaptation Based Congestion Control in VANET
Authors: C. Navdeti, C. Giri, I. Banerjee

*Scalable, High-speed On-chip based NDN Name Forwarding using FPGA
Authors: D. Saxena, S. Mahar, V. Raychoudhury, J. Cao

*Detection of Beacon Transmission Denial Attack in ITS Using Temporal Auto-correlation and Random Inspections
Authors: S. Sultana, F. Altaf, M. Aditia, M. Burra, C. Maurya, S. Maity

*Building an Emulation Environment for Cyber Security Analyses of Complex Networked Systems
Authors: F. Tanasache, M. Sorella, S. Bonomi, R. Rapone, D. Meacci

*Scheduling Virtual WiFi Interfaces for High Bandwidth Live Video Upstreaming Using Multipath TCP
Authors: S. Maheshwari, P. Lundrighan, S. Kasera

*pTASC - Tranversal Autonomous Secure Communications
Authors: P. Sousa, A. Cirne, J. Resende, R. Martins, L. Antunes

*Advanced Urban Public Transportation System for Indian Scenarios
Authors: P. Rajput, M. Chaturvedi, P. Patel

*Improving Performance of TCP for Wireless Network using SDN
Authors: K. Singh, S. Gupta, S. Verma, M. Pandey

*Low Complexity Landmark-Node Tracing in WSNs using Multi-Agent Random Walks
Authors: S. Redhu, R. Hegde

*On Upper and Lower Bounds of Identifying Code Set for Soccer Ball Graph with Application to Satellite Deployment
Authors: A. Sen, V. Goliber, K. Basu, C. Zhou, S. Ghosh

*Multi-Tenant Mobile Offloading Systems for Real-Time Computer Vision Applications
Authors: Z. Fang, J. Lin, M. Srivastava, R. Gupta

*pDCell: an End-to-End Transport Protocol for Mobile Edge Computing Architectures
Authors: C. Fiandrino, J. Widmer, K. Kogan, A. de la Oliva

*NOVN: Named-Object Based Virtual Network Architecture
Authors: F. Bronzino, S. Maheshwari, I. Seskar, D. Raychaudhuri

*Exploration and Impact of Blockchain-enabled Adaptive Non-binary Trust Models
Authors: D. Kravitz

*Cache Attacks on Blockchain Based Information Centric Networks: An Experimental Evaluation
Authors: S. Roy, F. Morais, M. Salimitari, M. Chatterjee

*Measurements and Analytics of Wide-Area File Transfers over Dedicated Connections
Authors: N. Rao, Q. Liu, S. Sen, Z. Liu, R. Kettimuthu, I. Foster


NETWORKING TRACK: SHORT PAPERS

*A Hybrid Classifier Approach to Multivariate Sensor Data for Climate Smart Agriculture Cyber-Physical Systems
Authors: A. Pandey, P. Tiwary, S. Kumar, S.K. Das

*Defense Strategies and Expected Capacity of High Performance Computing Infrastructures
Authors: N. Rao, N. Imam, C. Ma, F. He

*Dynamic Sensor Selection for Path Coverage
Authors: S. Shamoun, T. Abdelzaher, A. Bar-Noy

*HydraDoctor: Real-time Liquids Intake Monitoring by Collaborative Sensing
Authors: B. Du, C. Lu, X. Kan, K. Wu, M. Luo, J. Hou, K. Li, S. Kanhere, Y. Shen, H. Wen

*A Study on Packet Processing Using GPUs
Authors: D. Cerovic, A. Amamou, K. Haddadou, G. Pujolle
**********************************************************
*
* 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] VeRoLog Solver Challenge 2019

== CALL FOR PARTICIPATION - VeRoLog Solver Challenge 2019 ==

The VeRoLog Solver Challenge (VSC) is an initiative of VeRoLog, the Working Group on Vehicle Routing and Logistics within EURO, the Association of the European Operational Research Societies. The VSC is aimed at promoting the development of effective algorithms for real-world applications in Vehicle Routing. The problem subject of the challenge is selected by the VeRoLog board in collaboration with a company. The challenge is open to everybody, regardless of affiliation. Registration is free.

The VSC 2019, organized by ORTEC (https://ortec.com/), revolves around a challenging vehicle routing problem which has received little attention in the literature so far. This problem combines distribution and subsequent installation of equipment, such as vending machines. The organizers provide a comprehensive description of the problem, the formal challenge rules, instances, and some resources such as a solution validator on the challenge website https://verolog2019.ortec.com/.

The challenge consists of two parts. Participants may compete –and win money prizes– in one or in both parts of the challenge.

PART 1: ALL-TIME-BEST CHALLENGE
This part runs from 8 October 2018 until 5 May 2019. The main goal in this challenge is to find all-time-best solutions to the 25 'early instances'. Submitted solutions are ranked weekly on the challenge website. Solutions submitted in this part of the challenge may be obtained by any means available.

PART 2: RESTRICTED RESOURCES CHALLENGE
This part, which starts on 1 January 2019, is a challenge in the more traditional form: resources are restricted, especially time. Participants have to run their algorithm on a set of 'late instances' and submit their solutions and implementations no later than 1 March 2019. Based on the submitted results, the organizers select the finalists. The algorithms of the finalists are then run on a set of hidden instances. Per instance the participants are ranked and the participant with the lowest mean rank is the winner of the challenge.

FICO, GUROBI and IBM supply licenses of their solvers Xpress, GUROBI and CPLEX, respectively, which ORTEC may use during the second part. This means that the algorithms submitted may call on these solvers.


== AWARDS ==

The awards, supplied by ORTEC, are as follows.

In the all-time-best challenge: €0,50 per instance per week for the instance's frontrunner at the end of the week; €40 per instance for the instance's frontrunner by the end of May 5, 2019.

In the restricted resources challenge: the award for the winner is €2019, the runner-up is awarded €500, and the award for third place is €250.

The awards will be presented during the upcoming VeRoLog conference in Seville, June 3-5, 2019 (https://verolog2019.sciencesconf.org/). Selected participants will have the possibility to present during this conference and to publish in a special issue of the journal Networks.


== IMPORTANT DATES ==

Start all-time-best challenge: Oct 8, 2018
Start restricted resources challenge: Jan 1, 2019
Submission deadline restricted resources challenge: Mar 1, 2019
Finalists announced: May 1, 2019
End all-time-best challenge: May 5, 2019
Winners announced: June 4, 2019 (VeRoLog conference, Seville)
**********************************************************
*
* 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, October 6, 2018

[DMANET] PhD position University of Twente

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

*PhD Researcher at University of Twente in the NWO project**
*
´*Self-organising marketplace to realise a self-organised sustainable
power system* (AGILE)´
(see also
https://www.utwente.nl/en/organization/careers/vacancy/!/414850/phd-position-mathematics-in-decentralized-energy-management
)

The Operations Research group of the Department of Applied Mathematics
at the University of Twente has a vacancy for a full-time PhD position
in the AGILE project. This project has as goal to design self-organising
market mechanisms and corresponding distributed software to enable a
smart and sustainable energy system.

The candidate of this vacancy will focus on mathematical aspects. In
particular, the candidate will work in the general area of stochastic
off-line planning and scheduling, on-line dispatching,
self-configuration and self-optimisation and will contribute as one of
two PhDs to AGILE project, which is a collaboration of University of
Twente, Eindhoven University of Technology, and industry partners.

Besides a strong Operations Research and Mathematic background an
affinity with engineering and applications would be appreciated. A
strong background in power systems engineering is not essential – the
other PhD student in the project will focus on those aspects.
Organization

The PhD candidate will be employed at the chair Discrete Mathematics and
Mathematical Programming at the University of Twente (see
www.utwente.nl/eemcs/dmmp/ and www.utwente.nl/eemcs/energy/ for the
energy management related research) but the project is carried out in
cooperation with the Stochastics and Power systems engineering groups at
Eindhoven University of Technology.

*Contact*
Please apply before November 1, 2018 via the webpage
https://www.utwente.nl/en/organization/careers/vacancy/!/414850/phd-position-mathematics-in-decentralized-energy-management

For more information about this position and the project, please contact:
Johann Hurink (j.l.hurink@utwente.nl) or
Bert Zwart (bertz@cwi.nl).


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

[DMANET] CFP MAPSP 2019

MAPSP 2019 - First 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<mailto: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

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

Friday, October 5, 2018

[DMANET] IPCO 2019 call for papers

Conference on Integer Programming and Combinatorial Optimization
IPCO XX, May 22–24, 2019
to be held at the University of Michigan in Ann Arbor, Michigan, USA.
Submission deadline: November 20, 2018 (23:59 EST)
Website: http://umich.edu/~ipco2019conf/

The IPCO conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

Authors are invited to submit extended abstracts of their recent work by November 20, 2018 (23:59 EST); see the submission guidelines below for more information. The Program Committee will select the papers to be presented on the basis of the submitted extended abstracts. Contributions are expected to be original, unpublished and not submitted to journals or conferences with proceedings before the notification date (January 31, 2019). Papers violating these requirements will not be considered by the Program Committee.

During the conference, approximately 33 papers will be presented in single-track sessions. Each lecture will be 30 minutes long. The proceedings will be published as a volume of Springer Lecture Notes in Computer Science. They will contain extended abstracts of all accepted submissions. It is expected that revised and extended versions will subsequently be submitted for publication in appropriate journals.

Program Committee

Amitabh Basu (Johns Hopkins U)
Pierre Bonami (IBM)
Jose Correa (U Chile)
Sanjeeb Dash (IBM)
Volker Kaibel (U Magdeburg)
Simge Küçükyavuz (U Washington)
Retsef Levi (MIT)
Jim Luedtke (U Wisconsin, Madison)
Andrea Lodi (Polytechnique Montreal, Chair)
Tom McCormick (UBC)
Ruth Misener (Imperial College)
Viswanath Nagarajan (U Michigan)
Marc Pfetsch (TU Darmstadt)
Martin Skutella (TU Berlin)
Gautier Stauffer (Kedge Business School)
Angelika Wiegele (Alpen-Adria U Klagenfurt)

Submission Guidelines

The extended abstract — in Springer LNCS format — should not exceed 10 pages plus references. An appendix of at most 2 pages for more detailed proofs (e.g., main lemma) and / or detailed computational results is welcome and, if present, will be refereed and published. Submissions not following these guidelines will not be considered. Full versions of the submitted papers freely accessible in on-line repositories are welcome.
The first page should contain the title, the authors with their affiliations, and a short abstract. The introduction should be a broadly accessible exposition of the main ideas and techniques used to achieve the results, including motivation and a clear comparison with related work. In particular, the introduction should convey to the non-expert why the paper should be accepted to IPCO.
It is required to use LaTeX2e together with the LNCS class file from Springer. Please check the Springer Information for LNCS Authors for additional information.
The submitted extended abstracts will be refereed according to the standards of other top tier refereed conferences. The main acceptance criteria used by the Program Committee are the quality and originality of the research, plus its interest to people working in the field. It is crucial that the importance of the work is understood by the committee. The claimed results must be correct and new.
A paper will not be considered in any of the following cases:
– it has been already published;
– it has been submitted to a journal or to another conference with proceedings before the notification date;
– it has a member of the Program Committee among its authors;
– it is submitted after the submission deadline.

Submission website

Abstracts should be submitted through the submission website: https://easychair.org/conferences/?conf=ipco2019
Abstracts should be submitted using the LNCS template for November 20, 2018
Information for authors and template available here: http://www.springer.com/computer/lncs/lncs+authors?SGWID=0-40209-0-0-0


**********************************************************
*
* 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] Lecturer (Tenured Assistant Professor) post, Royal Holloway, University of London

Lecturer (Tenured Assistant Professor) post 
Royal Holloway, University of London (apply by October 17, 2018)
====================================================

The Department of Computer Science at Royal Holloway, University of London, invites applications for a Lecturer position (a full-time and permanent (tenured) post). The call is open to candidates working in all areas of Computer Science, including Algorithms and Complexity.

Full post information:
https://jobs.royalholloway.ac.uk/vacancy.aspx?ref=0918-375
Further contact information: jose.fiadeiro@rhul.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] PhD position in Robust Optimization at the University of Siegen

A three-year, full-time PhD position (100% TV-L E13) is available in the
research group of Marc Goerigk at the University of Siegen, Germany.

If you hold a a Master's degree (or equivalent) in management science,
operational research, mathematics, theoretical computer science,
physics, or related disciplines; and if you are interested in exploring
robust, data-driven and discrete optimisation, please consider the
official job announcement at:

http://www.uni-siegen.de/uni/stellen/wiss/831931.html

Note that below the German text on top, there is an English job
description on the bottom.

The application deadline is 17 October 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/
*
**********************************************************

Thursday, October 4, 2018

[DMANET] ICCG 2019 - call for papers

The 2nd Iranian Conference on Computational Geometry
(ICCG 2019)
February 19, 2019, Tehran, Iran
http://iccg.math.sharif.ir <http://iccg.math.sharif.ir/>

Submission Deadline: November 10, 2018
-----------------------------------------------------------
The 2nd Iranian Conference on Computational Geometry (ICCG) will be held
on February 19, 2019 at the Department of Mathematical Sciences, at
Sharif University of Technology, Tehran, Iran. ICCG is an annual
conference whose goal is to bring together students and researchers from
academia and industry, in order to promote research in the fields of
combinatorial and computational geometry.

Important dates:
Submission deadline: November 10, 2018
Acceptance notification: December 10, 2018
Conference: February 19, 2019

Program committee:
Mohammad Ali Abam, Sharif University of Technology (co-chair)
Ahmad Biniaz, University of Waterloo, Canada
Mohammad Farshi, Yazd University (co-chair)
Mohammad Ghodsi, Sharif University of Technology, Iran
Joachim Gudmundsson, The university of Sydney, Australia
Shahin Kamali, University of Manitoba, Canada
Philipp Kindermann, Universitat Würzburg, Germany
Matias Korman, Tufts university, USA
Maarten Loffler, Utrecht university, Netherlands
Mehran Mehr, Eindhoven University of Technology, Nethrelands
Saeed Mehrabi, Carleton university, Canada
Ali Mohades Khorasani, Amirkabir University of Technology, Iran

Morteza Monemizadeh, Amazon, USA

Martin Nollenburg, Technische Universitat Wien, Austria
Jeff Philips, University of Utah, USA
Zahed Rahmati, Amirkabir University of Technology, Iran
Alireza Zarei, Sharif University of Technology, Iran
Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran

Submission Guidelines:

ICCG does not have formally reviewed proceedings. The results presented
at ICCG could also be submitted to peer-reviewed conferences and/or
journals. Papers that have been just submitted to other peer-reviewed
events, conferences, or journals are eligible to be presented at ICCG.

We invite authors to submit their research works as extended abstracts
that should not exceed four pages, and must be prepared with LaTeX,
using our ICCG 2019 LaTeX template. The submission must be submitted
through EasyChair (https://easychair.org/conferences/?conf=iccg2019)


---
This email has been checked for viruses by Avast antivirus software.
https://www.avast.com/antivirus

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

ISAAC 2018: Call for Participation

**********************************
CALL FOR PARTICIPATION
********************************** 

================================================================
ISAAC 2018 - The 29th International Symposium on Algorithms and Computation

December 16-19, 2018 

Jiaoxi, Yilan County, Taiwan

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

We are glad to invite you to participate in the 29th International Symposium on Algorithms and Computation (ISAAC 2018), to be held in Jiaoxi, Yilan County, Taiwan on December 16-19, 2018. The symposium is intended to provide a forum for researchers working in algorithms and theory of computation. 

In this year, we schedule two keynote talks by Clifford Stein and Shang-Hua Teng. In addition, we organize a special workshop on Dec. 16, right before the regular program of ISAAC (Dec. 17-19) and invite several internationally renowned computer scientists who were born in 1949 or earlier as special guest speakers, including Tetsuo Asano, Fan Chung Graham, Kurt Mehlhorn, and so on. 

In particular, we also plan to arrange an open-problem session during ISAAC, which aims at providing a forum for discussion and brainstorming among the ISAAC community. The 'bubble-tea' session of open problems will be chaired by Sándor Fekete and Luca Trevisan, and submissions are open until Oct. 21 (Sun), 2018. 

[Session of Open Problems: Call-for-Abstracts]

The registration is open now. The early registration fee is $15,000 TWD for regular participants (and $10,000 TWD for students) until October 26, 2018. (After that, the registration fee will be $18,000 TWD for regular participants and $12,000 TWD for students.) Both of the registrations include admission to the special workshop, all sessions of ISAAC 2018, welcome reception on December 16, conference dinner banquet on December 18, and lunch on December 16-19. 

[Registration]


Additional information can be found on the conference website at:


We look forward to seeing you at ISAAC'18 in Jiaoxi, Yilan, Taiwan!  


Best regards,  
Wen-Lian Hsu, Chung-Shou Liao and  Der-Tsai Lee 
PC Co-Chairs and Chair of ISAAC 2018


=========================================
Location, Accommodation and Transportation
=========================================  

ISAAC 2018 will take place in Jiaoxi, Yilan County, Taiwan. Jiaoxi is one of the most famous towns in Taiwan known for its hot springs. The conference venue is Hotel Royal Chiaohsi, the best five-star hotel in the town, which is only 30- or 40-min away from the capital city, Taipei by bus or train. ISAAC also offers free shuttle service from Taipei Main Station (and Taipei Songshan Airport (TSA)) to Jiaoxi area. If your flight arrives at Taoyuan International Airport (TPE), you can take Taoyuan Metro Express to Taipei Main Station. 

Please refer to more details at: 


=================== 
Important Dates
=================== 

Submission deadline of the open-problem session: October 21, 2018
Early registration deadline: October 26, 2018 
Conference dates: December 16-19, 2018 


================ 
Committees
================ 

Conference Chair: 
 D. T. Lee (Academia Sinica, Taiwan)

Program Committee: 
 Sang Won Bae  (Kyonggi University, Korea)
 Mark Bun  (Princeton University, USA)
 Hubert Chan  (The University of Hong Kong, Hong Kong)
 Danny Chen  (University of Notre Dame, USA)
 Ho-Lin Chen  (National Taiwan University, Taiwan)
 Kai-Min Chung  (Academia Sinica, Taiwan)
 Leah Epstein  (University of Haifa, Israel)
 MohammadTaghi Hajiaghayi (University of Maryland, USA)
 Wing-Kai Hon  (National Tsing Hua University, Taiwan)
 Seok-Hee Hong  (University of Sydney, Australia)
 Sun-Yuan Hsieh (National Cheng Kung University, Taiwan)
 Wen-Lian Hsu  (Academia Sinica, Taiwan, Co-Chair)
 Zhiyi Huang  (The University of Hong Kong, Hong Kong)
 Giuseppe F. Italiano (University of Rome Tor Vergata, Italy)
 Naonori Kakimura (Keio University, Japan)
 Ralf Klasing  (CNRS and University of Bordeaux, France)
 Dieter Kratsch (Universite de Lorraine, Metz, France)
 Minming Li  (City University of Hong Kong, Hong Kong)
 Yi Li  (Nanyang Technological University, Singapore)
 Chung-Shou Liao (National Tsing Hua University, Taiwan, Co-Chair)
 Pinyan Lu  (Shanghai University of Finance and Economics, China)
 Kazuhisa Makino (Kyoto University, Japan)
 Petra Mutzel  (TU Dortmund University, Germany)
 Jesper Nederlof (Technische Universiteit Eindhoven, Netherlands)
 Evanthia Papadopoulou (Universita della Svizzera italiana, Switzerland)
 Kunsoo Park (Seoul National University, Korea)
 Seth Pettie  (University of Michigan, USA)
 Marcin Pilipczuk (University of Warsaw, Poland)
 Kunihiko Sadakane (The University of Tokyo, Japan)
 Rahul Shah  (Louisiana State University, USA)
 Tetsuo Shibuya (The University of Tokyo, Japan)
 Xiaoming Sun  (Chinese Academy of Sciences, China)
 Shin-ichi Tanigawa (The University of Tokyo, Japan)
 Takeshi Tokuyama (Tohoku University, Japan)
 Rob van Stee  (University of Siegen, Germany)
 Dorothea Wagner (Karlsruhe Institute of Technology, Germany) 
 Haitao Wang  (Utah State University, USA)
 Gerhard Woeginger (RWTH Aachen, Germany)
 Prudence Wong  (The University of Liverpool, UK)
 Hsu-Chun Yen  (National Taiwan University, Taiwan)
 Huacheng Yu  (Harvard University, USA)
 Christos Zaroliagis (University of Patras, Greece)
 Guochuan Zhang (Zhejiang University, China)

Organizing Co-Chairs:
 Ho-Lin Chen  (National Taiwan University, Taiwan)
 Wing-Kai Hon  (National Tsing Hua University, Taiwan)

[DMANET] CFP GameNets 2019

Dear colleagues,

Please find below the CFP of GameNets that will be held in Paris on the
25-26th April 2019.

http://gamenets.org/call-for-papers/

Sorry if you have received multiple copies of this CFP.

Regards,

Marceau

TPC Chairs are :

* Konstantin Avrachenkov, INRIA
* Longbo Huang, Tsinghua University
* Jason Marden, University of California Santa Barbara

TPC Members are :

* Philip Brown, University of Colorado
* Pierre Coucheney, Université de Versailles St Quentin
* Ceyhun Eksin, Texas A&M University
* Zhixuan Fang, Chinese University of Honk Kong
* Andrey Garnaev, Rutgers University
* Xiaowen Gong, Auburn University
* Yezekael Hayel, Université d'Avignon
* Vijay Kamble, University of Illinois at Chicago
* David Leslie, Lancaster University
* Lorenzo Maggi, Nokia Bell Labs
* Ramtin Pedarsani, University of California Santa Barbara
* Vincent H Poor, Princeton University
* Jorge Poveda, University of Colorado
* Bary Pradelski, ETH Zurich
* Lillian Ratliff, University of Washington
* Alonso Silva Allende, Safran
* Berhouz Touri, University of California San Diego
* Quanyan Zhu,  New York University


Web version
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=28kihla9u9nu1acocfdq50slmi&i=2s7&iw=1&n=2aq&p=H301802549&s=wv&sn=2aq>

[GAMENETS 2019]
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=3qipfhcepq1452f1cl187o2dqv&i=2s7&iw=1&p=H197671585&s=lp&sn=2aq&z=1av1>


[Paris, France ]
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=34opc2u03b7da2m2399krk86rm&i=2s7&iw=1&p=H68588866&s=lp&sn=2aq&z=1av1>


April 25 - 26, 2019 | Paris, France
Submission Deadline: 10 November 2018


Scope

GameNets 2019
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=ht7ga2crj16astb2ua3ei2dik&i=2s7&iw=1&p=H164428710&s=lp&sn=2aq&z=1av1> 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 are pleased to invite you to submit your paper to GameNets 2019. They
should follow the Springer formatting guidelines (see Initial Submission
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=3ih44og96nv7i6gfrtqec29jks&i=2s7&iw=1&p=H164428709&s=lp&sn=2aq&z=1avb>).


Call for Papers
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1t1h45b14rosg2322qjpoqr06b&i=2s7&iw=1&p=H164428708&s=lp&sn=2aq&z=1av8>


**

Publication

All registered papers will be submitted for publication by Springer and
made available through SpringerLink Digital Library.

Authors of selected best accepted papers will be invited to submit an
extended version to:
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=2vcishk0fm0rr82kibieqsa6hs&i=2s7&iw=1&p=H573252935&s=lp&sn=2aq&z=1av4>
Springer Wireless Networks (WINET) Journal

<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=12kd9m2cannhra6mccd1amv702&i=2s7&iw=1&p=H573252934&s=lp&sn=2aq&z=1av9>All
accepted authors are eligible to submit an extended version in a fast
track of:

EAI Endorsed Transactions on Serious Games
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=cjh4kcpalph02aoard9hjsvol&i=2s7&iw=1&p=H573252933&s=lp&sn=2aq&z=1ava>
Proceedings will be submitted for inclusion in leading indexing
services, including Ei Compendex, ISI Web of Science, Scopus, CrossRef,
Google Scholar, DBLP, as well as EAI's own EU Digital Library (EUDL).

Important dates

Full Paper Submission Deadline: 10 November 2018

Notification deadline: 10 January 2019

Camera-ready deadline: 31 January 2019

Conference dates: 25-26 April 2019

Submit Paper
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1r3dqbq2qv44r3cm74lh6gs7cd&i=2s7&iw=1&p=H71887036&s=lp&sn=2aq&z=1avb>

Follow us!

facebook
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1orvc6gn552uo597v95giv740&i=2s7&iw=1&p=H1617754602&s=lp&sn=2aq&z=1avc
  You Tube
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=rch0tovaosnba7qg8gknkb9fp&i=2s7&iw=1&p=H1617754603&s=lp&sn=2aq&z=1avd>  
twitter
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1thhu9t1s0081g1jkbq4ebn0bp&i=2s7&iw=1&p=H1617754604&s=lp&sn=2aq&z=1ave>  
linkedin
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=22va27gqe45ck2otrasop3ds2q&i=2s7&iw=1&p=H1617754605&s=lp&sn=2aq&z=1avf>

<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=2mbf7cnf7bpdj54s6q6828ng7o&i=2s7&iw=1&p=H1617754606&s=lp&sn=2aq&z=1avg>
EAI i.v.z.w. | address: 9000 GENT,  Begijnhoflaan 93a (Belgium) | 
WWW.EAI.EU
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=3af7fmh7k6vkerte7v0nstud7v&i=2s7&iw=1&p=H1617754607&s=lp&sn=2aq&z=1avh>


Unsubscribe
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=k65h5jqdkenakjjh3896t6t40&i=2s7&iw=1&p=H2077533189&s=unsub&sn=2aq>


Share: Forward to friend
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1beicnv7j0vr2si1nk3can415s&i=2s7&iw=1&n=2aq&p=H1830092685&s=fwdn&sn=2aq>
Share Facebook
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=29t8a1ttjs9oqjrhcstqago778&i=2s7&iw=1&n=2aq&p=H1830092681&s=sn&sdsc=&shimage=&shtype=&shurl=&sn=2aq&soc=facebook&tit=>
Share Twitter
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=ufhldlajsq4rhmujo6q9rvgg7&i=2s7&iw=1&n=2aq&p=H1830092677&s=sn&shrel=&shrep=&shtag=&shtxt=&shvia=&sn=2aq&soc=twitter>
Share Linkedin
<http://createnet.mailmta.com/nl/link?c=j3i7&d=3ko&h=1c0ve2bk92ds42p1jlsg1adumt&i=2s7&iw=1&n=2aq&p=H1830092649&s=sn&shsrc=&shsum=&sn=2aq&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/
*
**********************************************************

Special Issue on Surveys and Tutorials on Network Protocols and Algorithms

Special Issue on Surveys and Tutorials on Network Protocols and Algorithms

*** Call for Papers, Special Issue on Surveys and Tutorials ***

Network Protocols and Algorithms

ISSN 1943-3581

http://www.macrothink.org/journal/index.php/npa/

Network Protocols and Algorithms is a free-access online international journal, peer-reviewed and published by Macrothink Institute. It publishes papers focused on the design, development, manage, optimize or monitoring any type of network protocol, communication system, algorithm for communication and any protocol and algorithm to communicate network devices.

We solicit survey papers and tutorial papers of any topic related with Network Protocols or Algorithms.

Survey papers give an overview of all the research papers done on a particular topic. They should introduce the most relevant achievements from various researchers in a topic. They usually do not contribute anything new but try to sum up what is known about a subject. Survey papers provide a compact overview about the current state of the art in a specific or new emerging area, such as technology, algorithms, systems, etc.

Tutorial papers may address mature or emerging topics of interest related to a particular research or technology area of the journal. They must provide an in-depth survey of a well-defined topic with the option of describing a particular a particular technology or system. Tutorial papers may provide the reader some basic technical understanding and the breadth of research in an existing or emerging technology. Tutorial paper gives the readers the opportunity to gain new insights, knowledge and skills on evolving and emerging research topics in the scope of the journal. They are intended to inspire and guide the readers to better understand existing areas of research or pursue emerging research topics that can lead to creative solutions.

The scope of the journal include, but are not limited to, the following topic areas:

- Synchronization Protocols and Algorithms
- Security Protocols and Algorithms
- QoS Protocols and Algorithms
- Ad-Hoc and Sensor Network Protocols and Algorithms
- Content Delivery Networks Protocols and Algorithms
- P2P Protocols and Algorithms
- Cluster-Based Protocols and Algorithms
- Real-Time Protocols and Algorithms
- Wireless Protocols and Algorithms
- MAC Protocols and Algorithms for Wired Networks
- Mobile wireless internet protocols and algorithms
- Delay Tolerant protocols and algorithms
- Mesh network protocols and algorithms
- Protocols and algorithms for Voice over IP delivery
- Cognitive Radio Network Protocols and Algorithms
- Monitoring and management protocols and algorithms
- Optical networking protocols and algorithms
- Scalable Network Protocols and Algorithms
- Protocols and algorithms for Green Computing and Resource Allocation
- Power Efficient and Energy Saving Network Protocols and Algorithms
- Routing Protocols and Algorithms
- Tree-based Protocols and Algorithms
- Distributed/Decentralized Algorithms for Networks
- Fault tolerant Protocols and Algorithms
- Protocols and algorithms for Mobile and Dynamic Networks
- Cross-Layer Collaborative Protocols and Algorithms
- Formal methods and cryptographic algorithms for communication
- Multimedia Network Protocols and Algorithms
- Network Protocols and Algorithms for Context-Aware and Semantic Networks
- Localized Network Protocols and Algorithms
- Transport Layer Protocols
- Smartgrid Protocols and Algorithms
- Network Protocols Simulation Techniques
- Protocols and Algorithms for Mobile and Vehicular Ad Hoc Networks
- Cloud Computing Network Protocols and Algorithms
- Artificial Intelligence algorithms applied to Network Protocols
- Protocols and algorithms for IPTV delivery

You are welcome to submit a paper or forward this call for papers to any people working in Network Protocols and Algorithms that may be interested in submitting a paper. A meaningful summary of open issues about the topic in the paper would be a plus.

Important Dates:

- Manuscript Due: October 21, 2018
- Notification: November 25, 2018
- Final Manuscripts Due: December 16, 2018
- Tentative Publication: December 30, 2018

Network Protocols and Algorithms has linked its papers to references by DOI (Digital Object Identifier) numbers. The publisher and journal have a zero-tolerance plagiarism policy. We check the plagiarism issue using sevreal methods. Network Protocols and Algorithms appears in many search engines like Google & Google Scholar, Bing, Yahoo and Ask, and appears in several journal Impact Factor systems. Network Protocols and Algorithms is added and indexed in many journal databases including DBLP, EBSCO, Index Copernicus, etc.

Submission Information:
Only original and unpublished research papers will be considered in this journal. Manuscripts must be writen in English. All submissions will be reviewed based on technical merit and relevance. Instructions for authors and submissions can be found in http://www.macrothink.org/journal/index.php/npa/about/submissions


Jaime Lloret Mauri
Editor in Chief of Network Protocols and Algorithms
Associate Professor
Integrated Management Coastal Research Institute
Universitat Politecnica de Valencia

[DMANET] IPDPS 2019 Call for Papers - abstracts due on October 8th!

----------------------------------------------------------
IEEE IPDPS 2019
33rd IEEE International Parallel & Distributed Processing Symposium
May 20-24, 2019
Hilton Rio de Janeiro Copacabana
Rio de Janeiro, Brazil
www.ipdps.org
----------------------------------------------------------

...IPDPS 2019 Call for Papers - abstracts due on October 8th!

-----------------------------
CALL FOR PAPERS - ABSTRACTS DUE October 8th, 2018
-----------------------------
SCOPE
Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies and interdisciplinary
work covering multiple IPDPS areas are especially welcome. Topics of
interest include but are not limited to the following topic areas:

* Parallel and distributed computing theory and algorithms (Algorithms):
Design and analysis of novel numerical and combinatorial parallel
algorithms; protocols for resource management; communication and
synchronization on parallel and distributed systems; parallel algorithms
handling power, mobility, and resilience.

* Experiments and practice in parallel and distributed computing
(Experiments): Design and experimental evaluation of applications of
parallel and distributed computing in simulation and analysis;
experiments on the use of novel commercial or research architectures,
accelerators, neuromorphic architectures, and other non-traditional
systems; algorithms for cloud computing; domain-specific parallel and
distributed algorithms; performance modeling and analysis of parallel
and distributed algorithms.

* Programming models, compilers and runtimes for parallel applications
and systems (Programming Models): Parallel programming paradigms, models
and languages; compilers, runtime systems, programming environments and
tools for the support of parallel programming; parallel software
development and productivity.

* System software and middleware for parallel and distributed systems
(System Software): System software support for scientific workflows;
storage and I/O systems; system software for resource management, job
scheduling, and energy-efficiency; frameworks targeting cloud and
distributed systems; system software support for accelerators and
heterogeneous HPC computing systems; interactions between the OS,
runtime, compiler, middleware, and tools; system software support for
fault tolerance and resilience; containers and virtual machines; system
software supporting data management, scalable data analytics, machine
learning, and deep learning; specialized operating systems and runtime
systems for high performance computing and exascale systems; system
software for future novel computing platforms including quantum,
neuromorphic, and bio-inspired computing.

* Architecture: Architectures for instruction-level and thread-level
parallelism; memory technologies and hierarchies; exascale system
designs; data center architectures; novel big data architectures;
special-purpose architectures and accelerators; network and interconnect
architectures; parallel I/O and storage systems; power-efficient and
green computing systems; resilience and dependable architectures;
performance modeling and evaluation.

* Multidisciplinary: Papers that cross the boundaries of the previous
tracks are encouraged and can be submitted to the multidisciplinary
track. During submission of multidisciplinary papers, authors should
indicate their subject areas that can come from any area. Contributions
should either target two or more core areas of parallel and distributed
computing where the whole is larger than sum of its components, or
advance the use of parallel and distributed computing in other areas of
science and engineering.

WHAT/WHERE TO SUBMIT
Abstracts must be submitted by October 8, 2018; submitted abstracts may
not exceed 500 words. Manuscripts must be submitted by October 15, 2018;
submitted manuscripts may not exceed ten (10) single-spaced
double-column pages using 10-point size font on 8.5x11 inch pages (IEEE
conference style), including figures, tables, and references. The
submitted manuscripts should include author names and affiliations.

For more details, see the website at
http://www.ipdps.org/ipdps2019/2019-call-for-papers.html. The submission
portal will be available by September.
-----------------------------------------------------------------------
GENERAL CHAIR
Vinod Rebello (Fluminense Federal University, Brazil)

2019 PROGRAM CHAIR AND VICE-CHAIR
Jose Moreira (IBM Research, USA) and
Alba Cristina Melo (University of Brasilia, Brazil)

2019 PROGRAM AREA CHAIRS
ALGORITHMS:
Gianfranco Bilardi (University of Padova, Italy)
EXPERIMENTS:
Maria Jesus Garzaran (Intel Corporation, USA)
PROGRAMMING MODELS:
Xavier Martorell (Technical University of Catalunya, Spain)
SYSTEM SOFTWARE:
Dilma Da Silva (Texas A&M University, USA)
ARCHITECTURE:
Per Stenstrom (Chalmers University of Technology, Sweden)
MULTIDISCIPLINARY:
Nancy Amato (Texas A&M University, USA)

WORKSHOPS CHAIR and VICE-CHAIR
Erik Saule (University of North Carolina Charlotte, USA)
Jaroslaw Zola (The State University of New York at Buffalo, USA)

WORKSHOPS PROCEEDINGS CHAIR
Kyle Chard (University of Chicago, USA)

WORKSHOPS COMMITTEE
Olivier Beaumont (Inria Bordeaux Sud-Ouest, France)
Sunita Chandrasekaran (University of Delaware, USA)
Ananth Kalyanaraman (Washington State University, USA)
Cynthia A. Philips (Sandia National Laboratories, USA)
Sivasankaran Rajamanickam (Sandia National Laboratories, USA)
Min Si (Argonne National Laboratory, USA)
Alan Sussman (University of Maryland, USA)
Bora Ucar (CNRS, France)

IPDPS 2019 VENUE
Rio de Janeiro is one of the most visited cities in the Southern
Hemisphere and is known for its natural settings, plentiful beaches,
dramatic mountains, backdrop of Samba and Bossa Nova rhythms, and a
vibrant city center that resonates with culture and a deep sense of
history and heritage. Its wonderful weather, unique gastronomy, and
famous landmark attractions, including the statue of Christ the Redeemer
overlooking the city, named one of the New Seven Wonders of the World,
draw visitors from around the world. As host city for the 2014 FIFA
World Cup and then the 2016 Summer Olympics, Rio welcomed millions to
the city and created an outstanding infrastructure to cater to the needs
of its visitors, including world-class accommodations, upgraded
transportation links, and

----------------------------------------------------------------------------
...Follow us on Facebook at https://www.facebook.com/IPDPS
...Follow us on Twitter at https://twitter.com/IPDPS
-----------------------------------------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel
Processing
In cooperation with
ACM SIGARCH,
ACM SIGHPC;
IEEE Computer Society Technical Committee on Computer Architecture, and
IEEE Computer Society Technical Committee on Distributed Processing
-----------------------------------------------------------------------------
------------------------------------------------------------------------------


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

Wednesday, October 3, 2018

[DMANET] Second Call for Papers - ICDCN 2019 Workshops

ICDCN 2019 is hosting several associated workshops. The details along with the extended deadlines are as follows:

- Computing and Networking for Smart Healthcare (CoNSH)
https://consh2019.wordpress.com/

- International Workshop on Emergency Response Technologies and Services (EmeRTeS)
http://sites.google.com/view/emertes2019

- International Workshop On Networking Women In Distributed Computing And Networks (NWCDN)
http://nwdcn-2019.appspot.com/

- The 8th International Workshop on Computing and Networking for IoT and Beyond (ComNet-IoT)
https://sites.google.com/view/comnet-iot2019

- International Workshop on Analytics for Security in Cyber Physical Systems (ASCPS)
https://sites.google.com/umbc.edu/ascps2019/

- Cloud based Health INformatics (CHIN)
https://sites.google.com/nitc.ac.in/chin2019/home

- Algorithms and Architectures for Distributed Data Analytics (AADDA)
http://www.iith.ac.in/~sathya_p/AADDA/AADDA2019.html

- Pervasive Security for Smart Connected Communities (PerSeC3)
https://persecsystems.github.io/PerSec2018/


These details are also available on ICDCN Workshop page: https://events.csa.iisc.ac.in/icdcn2019/workshops.htm

Please refer to the individual workshop pages for the details. The important dates are:

- Submission Deadline: 15th October 2018 AoE (extended)

- Acceptance Notification: 5th November 2018 AoE (extended)

- Camera Ready Version: 15th November 2019 AoE

- Workshop Dates: 4th & 7th January 2019

**********************************************************
*
* 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 positions at IRIF (previously, LIAFA), Paris, France

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

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

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

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

Applications should consist of a CV including list of publications, a summary of research, and names and emails of at least three references. For further technical instructions on how to submit applications, please visit the "openings" sections at https://www.irif.fr/en/equipes/algocomp/index .

Applications should be received by November 5, 2018.


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

[DMANET] Clustering Research Position 2018

Research Positions

The Computer Science and Engineering Department of the European University Cyprus<http://www.euc.ac.cy/> and AAI Scientific Cultural Services Ltd. (AAISCS<http://aaiscs.com/>) invite applications for two (2) positions of Researchers in the research groups Astrophysics and High Performance Computing'' (Assis. Prof. Dr. Vicky Papadopoulou Lesta) and `` Laboratory for Human Brain Dynamics<http://aaiscs.com/LHBD/index.html> (LHBD)'' (Prof. Dr. Andreas A Ioannides).

The positions are available for 2 years. A further extension is planned. The annual salary range between approximated Gross Monthly Salary is 1,670 - 2,500 euro and additional funds for travel and other research expenses are available for each of the positions.

QUALIFICATIONS

* Bachelor`s Degree and/or postgraduate degree (M.Sc., PhD) in Computer Science/Engineering or Mathematics or Physics or Electrical Engineering or a related field from an accredited institution.

* Good Mathematical background and in particular in Graph Theory will be considered an advantage.

* Very good programming skills.

* Previous research experience will be considered an advantage.

The prospective researcher assistant will study modeling and development of efficient solutions for clustering problems with Applications in Neuroscience and Astrophysics. The problem will mainly be investigated using Graph Theoretical tools but also other tools such as Spectral Graph Theory and Bayesian analysis.

The goal is to investigate the state of the art on clustering problems exploiting the reach knowledge from the pool of Graph Theory, but also other theoretical and more applied tools, in order to model and solve efficiently clustering problems related to Neuroscience or Astrophysics. The proposed solutions will be implemented in common programming languages such as C/C++ and Python. Knowledge in the Applications (Neuroscience or Astrophysics) is not required.

Application letters (including a detailed CV) must be sent by e-mail as a single .pdf file to: v.papadopoulou@euc.ac.cy<mailto:v.papadopoulou@euc.ac.cy> and/or a.ioannides@aaiscs.com<mailto:a.ioannides@aaiscs.com>

*** In the subject line please use the title Clustering Research Position 2018 ***

To receive full consideration, applications should be received by November 25, 2018. The researcher can start working on the project on December 1st. Applications sent after this date will be considered until the position is filled.

For more information, please contact Assist. Prof. Vicky Papadopoulou by phone at +357-22713046 or via e-mail at v.papadopoulou@euc.ac.cy<mailto:v.papadopoulou@euc.ac.cy>.

Best regards

Vicky Papadopoulou Lesta
Assistant Professor,
Department of Computer Science and Engineering<cse.euc.ac.cy>
European University Cyprus<euc.ac.cy>

http://faculty.euc.ac.cy/vpapadopoulou/

________________________________

The information contained in this communication is intended solely for the use of the individual or entity to whom it is addressed and others authorized to receive it. It may contain confidential or legally privileged information. If you are not the intended recipient you are hereby notified that any disclosure, copying, distribution or taking any action in reliance on the contents of this information is strictly prohibited and may be unlawful. If you have received this communication in error, please notify us immediately by responding to this email and then delete it from your system. European University Cyprus & Cyprus College is neither liable for the proper and complete transmission of the information contained in this communication nor for any delay in its receipt.

**********************************************************
*
* 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] WINE 2018 -- Call for Posters

The 14th Conference on Web and Internet Economics, WINE 2018, will
feature a poster session for the presentation of results published
elsewhere in the past 12 months or work in progress that are relevant to
the WINE community. Each presenter will also be given the opportunity to
give a lightning talk of 2-3 minutes about the contribution.

**For Graduating Students**

This session will also include posters and short presentations by
graduating students and postdocs in algorithmic game theory and related
fields, who will be on the job market soon.

Poster submission deadline: Friday, October 26, 2018 (Anywhere on Earth)
Author notification: November 2, 2018

More details and submission guidelines can be found on the web site of
WINE 2018:

https://www.cs.ox.ac.uk/conferences/wine2018/call-for-posters.html


--
Prof. Paul W. Goldberg, Dept of Computer Science, Oxford
Room 255, Wolfson Building
Office phone +44 (0)1865 610756

**********************************************************
*
* 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] [Deadline extended to October 19] CFP: Springer IJIS, Special Issue on "IoT Security and Privacy"

Dear All,

We are pleased to announce that the submission deadline has been extended to
October 19.

Please consider submitting to the special issue of International Journal of
Information Security on "IoT Security and Privacy".

Please find the details described below.

We look forward to your submissions!

Best regards,

Guest Editors

Call for Papers

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

Springer International Journal of Information Security

Special Issue on "IoT Security and Privacy"

https://ijis-si-iotsec.github.io/

https://link.springer.com/journal/10207

The Internet is gradually transforming from a communication platform for

conventional IT appliances into the Internet of Things (IoT),

increasingly interconnecting many assorted devices and sensors. These

devices are generally referred as IoT devices, and many of them are

inexpensive and can be constrained in terms of energy, bandwidth and

memory. The establishment of IoT ecosystems in various domains is

bringing multiple benefits to human users and companies alike. Example

of such domains include Smart Homes, Smart Cities, the Industrial

Internet and even Intelligent Transportation Systems. However, the IoT

as a whole – including related paradigms such as Machine-to-Machine

(M2M) and Cyber-Physical Systems (CPS) – is susceptible to a multitude

of threats. In fact, many IoT devices currently are insecure and have

many security vulnerabilities. For example, many vulnerable IoT devices

which have been infected with malware have subsequently become comprised

into large botnets, resulting in devastating DDOS attacks. Consequently,

ensuring the security of such IoT ecosystems – before, during, and after

an attack takes place – is a crucial issue for our society at this moment.

This special issue aims to collect contributions by leading-edge

researchers from academia and industry, show the latest research results

in the field of IoT security and privacy, and provide valuable

information to researchers as well as practitioners, standards

developers and policymakers. Its aim is to focus on the research

challenges and issues in IoT security. Manuscripts regarding novel

algorithms, architectures, implementations, and experiences are welcome.

Topics include but are not limited to:

* Secure protocols for IoT devices

* Privacy solutions and privacy helpers for IoT environments

* Trust frameworks and secure/private collaboration mechanisms for IoT

environments

* Secure management and self-healing for IoT environments

* Operative systems security for IoT devices

* Security diagnosis tools for IoT devices

* Threat and vulnerability detection in IoT environments

* Anomaly detection and prevention mechanisms in IoT networks

* Case studies of malware analysis in IoT environments

* IoT forensics and digital evidence

* Testbeds and experimental facilities for IoT security analysis and

research

* Standardization activities for IoT security

* Security and privacy solutions tailored to specific IoT domains and

ecosystems

Submission Guidelines

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

Authors should prepare their manuscripts according to the "Instructions

for Authors" guidelines outlined at the journal website:

http://www.springer.com/computer/security+and+cryptology/journal/10207

Note that the journal sets no page limit, although we encourage authors

to keep their submissions to a length that's in the ballpark of the

accepted articles (unless there are special reasons to submit something

longer), i.e., less than 30 pages, in order to expedite the review process.

All papers will be peer-reviewed, by following a regular reviewing

procedure.

Guest Editors

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

Takeshi Takahashi, National Institute of Information and Communications
Technology, Japan

Rodrigo Roman Castro, Universidad de Málaga, Spain

Ryan Ko, University of Waikato, New Zealand

Bilhanan Silverajan, Tampere University of Technology, Finland

Said Tabet, EMC Corporation, USA

(Guest Editors of the special issue of International Journal of Information
Security on "IoT Security and Privacy")


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