Wednesday, November 30, 2016

dmanet Digest, Vol 105, Issue 26

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. CFP: The 12rd International Conference on Wireless
Algorithms, Systems, and Applications (WASA 2017) (AI, CHUNYU)
2. Ph.D positions in TCS and Optimization at Boston University
(Orecchia, Lorenzo)
3. CFP: [2 Days Left] - ICC'17 Workshop - 5th IEEE SCPA 2017 -
May 21-25, 2017. Paris, France (Sandra Sendra)
4. MIP workshop 2017 : additional information (Giacomo Nannicini)


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

Message: 1
Date: Tue, 29 Nov 2016 16:46:03 +0000
From: "AI, CHUNYU" <AIC@uscupstate.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFP: The 12rd International Conference on Wireless
Algorithms, Systems, and Applications (WASA 2017)
Message-ID:
<CY4PR01MB27742EE1C2A29D3BA4CAE094DC8D0@CY4PR01MB2774.prod.exchangelabs.com>

Content-Type: text/plain; charset="us-ascii"

The 12rd International Conference on Wireless Algorithms, Systems, and Applications (WASA 2017)
Guilin, Guangxi, China
June 19- June 21, 2017
http://wasa-conference.org/WASA2017

WASA has recently been added to the list of recommended journals and conferences by China Computer Federation (CCF)

SCOPE
WASA is designed to be a forum for theoreticians, system and application designers, protocol developers and practitioners to discuss and express their views on the current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.

PAPER SUMBISSSION
Please submit extended abstracts (up to 12 pages in Springer LNCS format) via the online submission system (https://easychair.org/conferences/?conf=wasa2017). Submission implies willingness of at least one author to register and present at the symposium. The authors should choose one of the following tracks:


IMPORTANT DATES
Submission Deadline: February 15, 2017
Notification: March 15 2017
Camera-Ready Submission Date: March 25, 2017


SPECIAL ISSUES:

Extended versions of most papers from the conference will be published in special issues of Personal and Ubiquitous Computing (SCI), Journal of Combinatorial Optimization (SCI), Sensors (SCI), IEEE Access (SCI), Tsinghua Science and Technology (SCI), and International Journal of Distributed Sensor Network (SCIE).


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

Message: 2
Date: Tue, 29 Nov 2016 17:35:21 +0000
From: "Orecchia, Lorenzo" <orecchia@bu.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Ph.D positions in TCS and Optimization at Boston
University
Message-ID: <D4632688.3C68E%orecchia@bu.edu>
Content-Type: text/plain; charset="us-ascii"

Applications are invited for fully-funded Ph.D. positions in the Department of Computer Science at Boston University, within the Theoretical Computer Science group (TCS). The selected candidates will collaborate with Prof. Alina Ene and Prof. Lorenzo Orecchia on algorithms for large-scale convex and combinatorial optimization. Candidates who like algorithmic problem solving and have theoretical computer science/mathematical backgrounds are strongly encouraged to apply. More information on TCS at BU can be found here:
http://www.bu.edu/cs/theory/

Boston is a great location for a Ph.D. in Theoretical Computer Science. Thanks to the presence of numerous universities (MIT, Harvard, Northeastern, BU, Tufts, UMass, BC, Brandeis) and research institutions (Microsoft New England, MERL, the medical schools), the city has a critical mass of researchers in TCS and related areas, with numerous possibilities for collaboration and learning. Boston is also a very intellectually stimulating, cosmopolitan, yet livable, compact city. Boston University is located in the heart of Boston, at walking distance from Harvard, MIT, Northeastern and Microsoft Research New England.

The Department of Computer Science prides itself on an open research environment that strongly encourages collaborations, both within BU and with other Boston-area institutions. The Department has a long tradition of producing high-quality research results and its PhD graduates have been successful in finding prestigious academic and industrial positions. To support our students, all accepted PhD students are guaranteed funding for 5 years, as long as they continue to satisfy academic requirements and maintain good academic standing.

We encourage all interested students to submit their application by Dec 15, 2016. Late applications will be considered on a rolling basis while spaces are available. Instructions on how to apply can be found here:
https://www.bu.edu/cs/graduate/admissions/

If you have any questions, feel free to contact Lorenzo Orecchia at orecchia@bu.edu<mailto:orecchia@bu.edu>.

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

Message: 3
Date: Wed, 30 Nov 2016 00:23:41 +0100
From: Sandra Sendra<sandra.sendra.upv@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: [2 Days Left] - ICC'17 Workshop - 5th IEEE SCPA
2017 - May 21-25, 2017. Paris, France
Message-ID: <201611292323.uATNNf5i016085@smtp.upv.es>
Content-Type: text/plain; charset=us-ascii

-------------------- CALL FOR PAPERS (DEADLINE EXTENDED) -----------------
5th IEEE International Workshop on Smart Communication Protocols and Algorithms (SCPA 2017)
May 21-25, 2017. Paris, France
In conjunction with IEEE ICC 2017
http://scpa.it.ubi.pt/2017/
------------------------------------------------------------------------------------------------

Selected papers will be invited to the Special Issue on Smart Protocols and Algorithms of the International Journal Network Protocols and Algorithms (ISSN: 1943-3581) or to the Special Issue on Recent Advances on Communications and Networking Technology Journal (ISSN: 2215-082X (Online); ISSN: 2215-0811 (Print)).


Communication protocols and algorithms are needed to communicate network devices and exchange data between them. The appearance of new technologies usually comes with a protocol procedure and communication rules that allows data communication while taking profit of this new technology. Recent advances in hardware and communication mediums allow proposing new rules, conventions and data structures which could be used by network devices to communicate across the network. Moreover, devices with higher processing capacity let us include more complex algorithms that can be used by the network device to enhance the communication procedure.
Smart communication protocols and algorithms make use of several methods and techniques (such as machine learning techniques, decision making techniques, knowledge representation, network management, network optimization, problem solution techniques, and so on), to communicate the network devices to transfer data between them. They can be used to perceive the network conditions, or the user behavior, in order to dynamically plan, adapt, decide, take the appropriate actions, and learn from the consequences of its actions. The algorithms can make use of the information gathered from the protocol in order to sense the environment, plan actions according to the input, take consciousness of what is happening in the environment, and take the appropriate decisions using a reasoning engine. Goals such as decide which scenario fits best its end-to-end purpose, or environment prediction, can be achieved with smart protocols and algorithms. Moreover, they could learn from the pas!
t and use this knowledge to improve
future decisions.
In this workshop, researchers are encouraged to submit papers focused on the design, development, analysis or optimization of smart communication protocols or algorithms at any communication layer. Algorithms and protocols based on artificial intelligence techniques for network management, network monitoring, quality of service enhancement, performance optimization and network secure are included in the workshop.
We welcome technical papers presenting analytical research, simulations, practical results, position papers addressing the pros and cons of specific proposals, and papers addressing the key problems and solutions. The topics suggested by the conference can be discussed in term of concepts, state of the art, standards, deployments, implementations, running experiments and applications.

Topics of interest:
------------------------------------------------------------------------------------------------
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal, including, but are not limited to, the following topic areas:
- Smart network protocols and algorithms for multimedia delivery
- Application layer, transport layer and network layer cognitive protocols
- Cognitive radio network protocols and algorithms
- Automatic protocols and algorithms for environment prediction
- Algorithms and protocols to predict data network states
- Intelligent synchronization techniques for network protocols and algorithms
- Smart protocols and algorithms for e-health
- Software applications for smart algorithms design and development
- Dynamic protocols based on the perception of their performance
- Smart protocols and algorithms for Smartgrids
- Protocols and algorithms focused on building conclusions for taking the appropriate actions
- Smart Automatic and self-autonomous ad-hoc and sensor networks
- Artificial intelligence applied in protocols and algorithms for wireless, mobile and dynamic networks
- Smart security protocols and algorithms
- Smart cryptographic algorithms for communication
- Artificial intelligence applied to power efficiency and energy saving protocols and algorithms
- Smart routing and switching protocols and algorithms
- Cognitive protocol and algorithm models for saving communication costs
- Any kind of intelligent technique applied to QoS, content delivery, network Monitoring and network management
- Smart collaborative protocols and algorithms
- Problem recognition and problem solving protocols
- Genetic algorithms, fuzzy logic and neural networks applied to communication protocols and algorithms

Important Dates:
------------------------------------------------------------------------------------------------
Submission Deadline: 2nd December, 2016 (Extended deadline)
Acceptance Notification: 17th February, 2016
Camera Ready Deadline: 10th March, 2016

Submission guidelines:
------------------------------------------------------------------------------------------------
All submissions must be full papers in PDF format and uploaded on EDAS: (https://edas.info/newPaper.php?c=22957&track=82208)

All submissions should be written in English with a maximum paper length of five (5) printed pages (10-point font) including figures without incurring additional page charges.

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

General Chairs:
Jaime Lloret Mauri, Universitat Politecnica Val�ncia, Spain
Joel Rodrigues, National Institute of Telecommunications (Inatel), Brazil;
Instituto de Telecomunica��es, Univ. of Beira Interior, Portugal

TPC Chairs:
Sandra Sendra, Universidad de Granada, Spain
Kashif A. Saleem, Kind Saud University, Saudi Arabia
Bruno Silva, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal

Keynote Chairs:
Danda B. Rawat, Georgia Southern University, USA

Panel Chairs:
Raimir Filho, University of Fortaleza, Brazil
Pascal Lorenz, University of Haute Alsace, France

Industry Chair:
Antonio S�nchez-Esguevillas, Telefonica R&D, Spain

Publicity Chairs:
Sofiane Hamrioui, University of Haute Alsace, France
Jose M. Jimenez, Universidad Polit�cnica de Valencia, Spain

Web Chair:
Jo�o N. Isento, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal


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

Message: 4
Date: Tue, 29 Nov 2016 19:12:03 -0500
From: Giacomo Nannicini <giacomo.n@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] MIP workshop 2017 : additional information
Message-ID:
<CAFy=0d0753YzBWN0Tz+9uYsuhJXyvmb+gfyWGYayBDOgD=wHmw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

*** MIXED INTEGER PROGRAMMING WORKSHOP 2017: SECOND ANNOUNCEMENT ***


We are pleased to announce that the 2017 workshop in Mixed Integer
Programming (MIP 2017) will be held June 19–22 at HEC Montréal
(Quebec, Canada). The 2017 Mixed Integer Programming workshop will be
the fourteenth in a series of annual workshops held in North America
designed to bring the integer programming community together to
discuss very recent developments in the field. The workshop consists
of a single track of invited talks and features a poster session that
provides an additional opportunity to share and discuss recent
research in MIP.

All workshop participants are invited to submit a poster abstract
before March 1, 2017. There will be an award for the best poster
presented by a student. To submit an abstract, please email a two page
PDF containing a detailed abstract of the poster to:

mip2017poster@gmail.com

Space for posters is limited; and the submitted poster abstracts will be
used to select the accepted posters. Therefore, it is important that the
abstract provides a good description of the research to be presented. We
expect to send out acceptance notifications around March 15.

For more information and updates, please see the workshop website at
https://sites.google.com/site/mipworkshop2017/

Confirmed speakers:
- Miguel Anjos, École Polytechnique de Montréal
- Yoshua Bengio, University of Montréal
- David Bergman, University of Connecticut
- Pierre Bonami, IBM ILOG
- Austin Buchanan, Oklahoma State University
- Christoph Buchheim, TU Dortmund
- Philipp Christophel, SAS
- Bill Cook, University of Waterloo
- Daniel Dadush, CWI Amsterdam
- Santanu Dey, Georgia Institute of Technology
- Dinakar Gade, Sabre
- Angelos Georghiou, McGill University
- Hassan Hijazi, Australian National University
- Dorit Hochbaum, UC Berkeley
- Volker Kaibel, Otto von Guericke Universitat Magdeburg
- Thorsten Koch, TU Berlin
- Burak Kocuk, Carnegie Mellon University
- Matthias Koeppe, UC Davis
- Pablo Parrilo, MIT
- Michael Perregaard, FICO
- Maurice Queyranne, University of British Columbia
- Francisco Trespalacios, ExxonMobil
- Sven Wiese, University of Bologna
- Sercan Yildiz, University of North Carolina

Program Committee:
- Merve Bodur, Georgia Institute of Technology
- Daniel Espinoza, Gurobi
- Fatma Kılınç-Karzan (chair), Carnegie Mellon University
- Andrea Lodi, École Polytechnique de Montréal
- Giacomo Nannicini, IBM Research

Local Committee:
- Miguel Anjos, École Polytechnique de Montréal
- Jean-François Cordeau, HEC Montréal
- Andrea Lodi, École Polytechnique de Montréal
- Odile Marcotte, Université du Québec à Montréal
- Louis-Martin Rousseau, École Polytechnique de Montréal

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 26
***************************************

Tuesday, November 29, 2016

dmanet Digest, Vol 105, Issue 25

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. Postdoc positions in Paris (endingn December 1st)
(Communication FSMP)
2. CFP: Special Session on "Smart Cities" - MIC 2017
(Barcelona) (Jamal Toutouh)
3. PhD positions in Mathematics at the London School of
Economics and Political Science (LSE) (Gregory Sorkin)
4. IFORS Developing Countries OR Resources Website
(Gerhard-Wilhelm Weber)
5. PostDoc Position in Discrete Optimization at EPFL
(Friedrich Eisenbrand)


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

Message: 1
Date: Fri, 25 Nov 2016 17:33:00 +0100
From: Communication FSMP <communication@fsmp.fr>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Postdoc positions in Paris (endingn December 1st)
Message-ID: <892CC721-2D97-41FD-AD7C-6DB713415D3C@fsmp.fr>
Content-Type: text/plain; charset=utf-8

The Foundation Sciences Mathématiques de Paris offers post-doctoral positions in fundamental computer science.
These positions are for one or two years and starting in October 2017 in the research laboratories affiliated to the Foundation.
The deadline of application is December 1st 2016.

Please read job description and eligibility criteria here:
http://www.sciencesmaths-paris.fr/en/postdoctoral-programmes-247.htm

Online application available here:
http://www.sciencesmaths-paris.fr/en/Researchers%20and%20Students-380.htm

Contact: Kevin Ledocq, +33 1 44 27 68 03, +33 1 44 27 68 03 (fax)
Email: contact@fsmp.fr
Postal Mail:
Fondation Sciences Mathématiques de Paris
IHP - 11 rue Pierre et Marie Curie
F75231 Paris Cedex 05
Web Page: http://www.sciencesmaths-paris.fr/en/


Best regards,

Gaël Octavia
Responsable de la communication
Fondation Sciences Mathématiques de Paris
www.sciencesmaths-paris.fr <http://www.sciencesmaths-paris.fr/>
IHP - 11 rue Pierre et Marie Curie
75231 Paris Cedex 05
communication@fsmp.fr
Tél : 33 (0)1 44 27 67 70
Fax : 33 (0)1 44 27 68 04

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

Message: 2
Date: Mon, 28 Nov 2016 09:50:13 +0100
From: Jamal Toutouh <jamaltoutouh@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: Special Session on "Smart Cities" - MIC
2017 (Barcelona)
Message-ID:
<CAM9XBaM-dVG4mDKQYQGxaSSYGqppRRMq3mENzThcf8Ne-zdUoQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

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

* Special Session on "Smart Cities" *

* Metaheuristic International Conference (MIC 2017) *

* Barcelona, Spain, July 4th-7th 2015 *

* *

* http://mic2017.upf.edu/special-sessions/ *

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

Smart Cities represent a new community of researchers, developers and
innovators where new intelligent applications are continuously seek. As a
way of creating these intelligent products and services, metaheuristics
appear as a way of developing scalable, highly restricted and data driven
applications.

This special session provides a forum for the exchange of ideas and results
among researchers, developers, and practitioners working on the application
of heuristic and metaheuristic methods to address problems related to smart
cities.

As a key point to distinguish old applications and the new smart city
environment, potential authors are requested to attack several edges of a
problem (holistic vision, e.g. routes and pollution), use real data, deal
with the actual city problem (not with a very abstract model of it) and
consider business plans, users or real restrictions.

The goal of this special session is to present high-quality research papers
that contain novel contributions addressing both practical applications and
theoretical issues, including smart governance, smart energy, smart
building, smart mobility, smart infrastructure, technology, smart
healthcare, and smart citizens.

Topics of interest include (but are not limited to) metaheuristics in:

· Energy, water, waste and green power management

· Environmental, social and economic sustainability

· Smart mobility, ITS, electric vehicles, fleet of vehicles

· Open data and big data

· City planning and operations

· Modeling human demands

· Healthcare management in cities, social inclusion, education

· Sustainable urban grow, planning, and economic development

· Social (crowding), living labs, cloud applications for cities

· Safety and emergency systems

· Web services, mobile apps, urban platforms

· Internet of things, cyber-physical systems, holistic integration

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

* Submission deadline: *January 23, 2017*
* Notification of acceptance: February 27, 2017
* Camera-ready papers: March 6, 2017
* Early registration due date: *March 31, 2017*

** Conference: July 4-7 2017*

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

SHOULD YOU NEED SOME MORE TIME, PLEASE ASK US

Session Chairs:

* Prof. Enrique Alba (University of Malaga, Spain, e-mail: eat@lcc.uma.es)

* Dr. Jamal Toutouh (University of Malaga, Spain, e-mail: jamal@lcc.uma.es)

--

*Jamal Toutouh, PhD. *

E.T.S.I. Informática

University of Málaga
Group GISUM[NEO]
- Tlf: 95213 33 03
- @: jamal[at]lcc.uma.es
- web: http://www.jamal.es
Alamin

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

Message: 3
Date: Mon, 28 Nov 2016 18:20:36 +0000
From: Gregory Sorkin <G.B.Sorkin@lse.ac.uk>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD positions in Mathematics at the London School of
Economics and Political Science (LSE)
Message-ID: <82406252-0007-3472-8a4c-bc3fd48530a7@lse.ac.uk>
Content-Type: text/plain; charset="utf-8"; format=flowed

PhD positions in Mathematics at the London School of Economics and
Political Science

The Department of Mathematics at LSE has openings for PhD students,
including in the areas of Discrete Mathematics, Operations Research and
Analytics, and Game Theory. We are seeking exceptionally talented and
motivated students with a strong mathematical background and interest in
combinatorics and random structures, mathematical foundations of
operations research, discrete optimisation, algorithms, mathematical and
algorithmic game theory, and related areas.

For further information about the PhD programme, application procedures,
and faculty please see
http://www.lse.ac.uk/maths/Degrees/PhD_and_MPhil.aspx

Applicants will automatically be considered for funding covering fees
and paying GBP 18,000/year (currently about EUR 21,000 or USD 22,000)
for up to 4 years. The award of these scholarships is competitive, based
on academic performance (typically in an MSc or equivalent) and
suitability of the proposed research. Application deadlines for funding
are 9 January and 26 April 2017; we strongly encourage submission by the
earlier deadline.

Prospective applicants are encouraged to contact the following
department faculty members to discuss their qualifications and research
interests before submitting a formal application:
Discrete Mathematics: Prof Graham Brightwell <j.van-den-heuvel@lse.ac.uk>
Operations Research: Prof Gregory Sorkin <g.b.sorkin@lse.ac.uk>
Game Theory: Prof Bernhard von Stengel <stengel@nash.lse.ac.uk>


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

Message: 4
Date: Tue, 29 Nov 2016 05:16:01 +0300
From: Gerhard-Wilhelm Weber <gweber@metu.edu.tr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IFORS Developing Countries OR Resources Website
Message-ID: <20161129051601.19882wfgcl8nbeg1@horde.metu.edu.tr>
Content-Type: text/plain; charset=ISO-8859-1; DelSp="Yes";
format="flowed"

Dear ladies and gentlemen,
dear friends,

on IFORS Developing Countries OR Resources Website, its regular
updates - and your possible own submission of "free" (not copyright
protected) material, you might occasionally visit

http://ifors.org/developing_countries/index.php?title=Main_Page.

Thank you very much for your attention.

With kind regards,
best wishes,
Gerhard-Wilhelm Weber


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

Message: 5
Date: Tue, 29 Nov 2016 15:55:06 +0100
From: Friedrich Eisenbrand <friedrich.eisenbrand@epfl.ch>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] PostDoc Position in Discrete Optimization at EPFL
Message-ID: <1480431306.12503.7.camel@epfl.ch>
Content-Type: text/plain; charset="UTF-8"

The "Discrete Optimization Group" at EPFL, Switzerland
http://disopt.epfl.ch/ invites applications for a Postdoc position.

The research interests of the group are in integer programming, 
combinatorial optimization, computational and discrete geometry, 
and approximation algorithms.

The appointment is for 12 months. The earliest possible start date is
April 2017, and the latest possible start date is end of June 2017.
The salary will be 7,000 Swiss Francs (currently $6,900) per month.
The position can be renewed by one year.

The Postdoc position comes with teaching obligations. This either
means that the prospective holder of the position serves as a teaching
assistant or teaches one 2h-course per semester at the doctoral level.

Applications (including curriculum vitae, list of publications,
research plan, names of three references with their e-mail addresses,
and intended period of stay) should be sent to 

Jocelyne Blanc  (jocelyne.blanc@epfl.ch).

Electronic applications are welcome and should consist of one single
PDF-file.
We will start evaluating applications January 1, 2017, and will
continue accepting applications until the position is filled.


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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 25
***************************************

Saturday, November 26, 2016

dmanet Digest, Vol 105, Issue 24

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. Two open positions at Zuse Institute Berlin, Mathematical
Optimization Methods (Ambros Gleixner)
2. CFP: Ieee CEC2017 Special
SessiononModelReductioninMulti-Objective and Robust Design
Optimization (Hou Liqiang)
3. CfP: LION 11, Eleventh Learning and Intelligent Optimization
Conference (Thomas Stuetzle)
4. Two postdoc positions in Warwick (Dan Kral)


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

Message: 1
Date: Fri, 25 Nov 2016 02:38:09 +0100
From: Ambros Gleixner <gleixner@zib.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Two open positions at Zuse Institute Berlin,
Mathematical Optimization Methods
Message-ID: <1c5b375e-8ec2-2761-1b3d-84c6f7700306@zib.de>
Content-Type: text/plain; charset=utf-8; format=flowed


PostDoc and PhD positions available at Zuse Institute Berlin

The research group Mathematical Optimization Methods at Zuse Institute
Berlin is currently looking for outstanding candidates to fill two open
positions:


*** WA 28/16: a PhD track research position (100% TV-L E13) ***

on the topic of high-precision mixed-integer programming over the
rational numbers, see http://www.zib.de/node/2664


*** WA 29/16: a PostDoc researcher position (100% TV-L E14) ***

with self-defined research agenda in the context of computational
mixed-integer linear programming, see http://www.zib.de/node/2688


Our group holds longstanding expertise in the design and implementation
of mathematical optimization solvers and you will be part of the
research team around the SCIP Optimization Suite (http://scip.zib.de/).

We expect creativity and a high degree of team spirit and commitment to
problem solving. We offer a friendly working atmosphere, excellent
equipment, and a challenging professional environment. Due to our
involvement in major regional cooperative projects, such as the Einstein
Center for Mathematics (ECMath), the Matheon Research Center, the Berlin
Mathematical School (BMS) or the Berlin Big Data Center (BBDC), we have
close ties to universities and research institutes in the region. We
offer scientists in all career stages opportunities for further
qualification and strongly support research on top level with
international visibility.

We are committed to an active onboarding process to facilitate new
members with all the tools and the knowledge they need for success in
our institute and their career. We provide a family-friendly work
environment through flexible working hours and meeting times and the
opportunity for part-time working arrangements.

The starting date is from March 1, 2017, and can be negotiated. For more
details, please consult the official job postings at

http://www.zib.de/node/2664

and

http://www.zib.de/node/2688

Please don't hesitate to contact me if you have any questions regarding
the positions.

Best regards,
Ambros Gleixner


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

Message: 2
Date: Fri, 25 Nov 2016 10:45:30 +0800 (CST)
From: Hou Liqiang <houliqiang2008@139.com>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CFP: Ieee CEC2017 Special
SessiononModelReductioninMulti-Objective and Robust Design
Optimization
Message-ID:
<2b165837a480cc1-00013.Richmail.00007215005027891531@139.com>
Content-Type: text/plain;charset=UTF-8


* Apologies if you received multiple copies



* Please kindly forward to those who may be interested.


***


IEEE Congress on Evolutionary Computation 2017, Donostia - San Sebastián, Spain, June 5-8, 2017


http://cec2017.org/


***


Special Session on Model Reduction in Multi-Objective and Robust Design Optimization


https://sites.google.com/site/adloptimization/home


***


Submission deadline: January 16, 2017.


***


IEEE CEC 2017 is a world-class conference that aims to bring together researchers and practitioners in the field of evolutionary computation and computational intelligence from all around the globe. The special session aims to promote research on theoretical and practical aspects of multi-objective optimization, surrogate assisted optimization and robust design optimization, etc.



*Scope and Motivations*


With model reduction, e.g. Proper Orthogonal Decomposition (POD, also called Principal Components Analysis, PCA) based model reduction, expenses of optimization process can be greatly reduced. Take the standard ZDT series test functions for example, it takes around 20 iterations for the MOO with POD model reduction to search the true Pareto front. The model reduction can also be used in surrogate assisted optimization and evidence approximation. With model reduction, surrogate and evidence computation can be constructed on a reduced data set, thus the sample size can be greatly reduced.



The optimization with model reduction shows advantages over conventional MOOs and can be potentially extended to the scenarios such as optimization problems with many objectives. However, to implement successfully the methods in design optimization with expensive model under uncertainty, a series of issues such as evidence approximation, model fidelity management, optimization algorithm and the strategy to integrate them, etc. should be resolved. We therefore propose the special issue on Model Reduction in Multi-objective and Robust Optimization.



Scope and Topic:


The session seeks to promote discussion and presentation of related novel works. Topics may include, but are not limited to:

Multi-objective optimization Many-objective optimization Robust design optimization Multi-Fidelity optimization Uncertainty modeling Parameter reduction Data mining in Multi-objective and Many-objective Optimization Model fidelity management Surrogate of expensive model Model reduction in Multi-objective and Many-objective Optimization Infill strategy of surrogate Surrogate assisted optimization Evidence approximation of epistemic uncertainty Multi-objective robust optimization under uncertainty Applications of design optimization with model reduction, particularly the aerospace engineering design Preliminary space mission design under uncertainty Multi-objective optimization in preliminary space mission design


Important date

Deadline for contribution paper submission: January 16, 2017. Notification of acceptance: February 26, 2017 Final paper submission: March 12, 2017 Conference dates: June 5-8, 2017
Organizers

Dr. Liqiang Hou, State Key Laoratory of Astronautic Dynamics, Xi'an Staellite Control Center, Xi'an, China Dr. Tapabrata Ray, School of Engineering and Information Technology University of New South Wales, Canberra, Australia Dr. Edmondo Minisci, Department of Mechanical & Aerospace Engineering  of University of Strathclyde, Glasgow, UK








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

Message: 3
Date: Fri, 25 Nov 2016 13:53:26 +0100
From: Thomas Stuetzle <stuetzle@ulb.ac.be>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CfP: LION 11, Eleventh Learning and Intelligent
Optimization Conference
Message-ID: <C865C1B4-D9A8-4E11-8EBB-FD7340BC8EDC@ulb.ac.be>
Content-Type: text/plain; charset=us-ascii



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

LION 11, Eleventh Learning and Intelligent Optimization Conference

Submission deadline: December 18, 2016

Conference dates: 19-21 June, 2017

Conference location: Nizhny Novgorod, Russia

More info: http://intelligent-optimization.org/lion11/


===== Scope =====


Practitioners using heuristic algorithms for hard optimization problems are confronted with the burden of selecting the most appropriate method, in many cases through expensive algorithm configuration and parameter tuning. Scientists seek theoretical insights and demand a sound experimental methodology for evaluating algorithms and assessing strengths and weaknesses. This effort requires a clear separation between the algorithm and the experimenter, who, in too many cases, is "in the loop" as a motivated intelligent learning component. LION deals with designing and engineering ways of "learning" about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained online or offline can improve the algorithm design process and simplify the applications of high-performance optimization methods. Combinations of different algorithms can further improve the robustness and performance of the individual components.

This meeting, which continues the successful LION series, explores the intersections and uncharted territories between machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems. Russia has a long tradition in optimization theory, computational mathematics and "intelligent learning techniques" (in particular cybernetics and statistics). The location of LION11 in Nizhny is an occasion to meet researchers and consolidate research and human links. In internet time the value of a conference must go well beyond presenting scientific papers. In particular, we are discussing and planning:


- Contests in continuous and discrete optimization.
- Sessions dedicated to commercial software and open source initiatives.
- Parallel computing, supercomputing, and cloud for "big optimization".
- Elevator pitches about new and crazy ideas (also by PhD students).
- Tutorials about methods and software.


===== Submission Instructions =====


Please prepare your paper in English using the Lecture Notes in Computer Science (LNCS) template. Papers must be submitted in PDF.

Types of Submissions

When submitting a paper to LION11, authors are required to select one of the following three types of papers:

* Long paper: original novel and unpublished work (max. 15 pages in LNCS format);
* Short paper: an extended abstract of novel work (max. 6 pages in LNCS format);
* Work for oral presentation only (no page restriction; any format). For example, work already published elsewhere, which is relevant and which may solicit fruitful discussion at the conference.


===== Publication Details =====


Post-conference proceedings are published by Springer-Verlag in its LNCS series. A special issue of a scientific journal with invited extended version of the best papers is being planned.


===== Further Information =====


Up-to-date information will be published on the web site
http://intelligent-optimization.org/lion11/. For information
about local arrangements, registration forms, etc., please refer to the
above-mentioned web site or contact the local organizers.

LION 11 will be collocated with the 7th International Conference on Network Analysis (June 22-24, 2017).


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


Submission deadline December 18, 2016
Notification of acceptance March 10, 2017
Conference June 19-21, 2017


===== LION 11 Committee =====


General Chair

Yaroslav Sergeyev, University of Calabria (Italy) and Lobachevsky University, Nizhny (Russia).

Local organization committee

Roman Strongin (Chair), Victor Kasantsev (Vice-Chair), Victor Gergel (Vice-Chair), Vladimir Grishagin, Dmitri Balandin, Konstantin Barkalov, Dmitri Kvasov.

Steering committee

Roberto Battiti (head), Holger Hoos, Youssef Hamadi, Mauro Brunato, Thomas Stuetzle, Christian Blum, Martin Charles Golumbic, Marc Schoenauer, Xin Yao, Benjamin W. Wah.

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

Message: 4
Date: Fri, 25 Nov 2016 14:06:56 +0000
From: Dan Kral <D.Kral@warwick.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Two postdoc positions in Warwick
Message-ID:
<CAO6OfRFH2DWdteNe2BprLbxBNJbHq+4TLgSM1PSN1Fn1ZKQcKQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Dear colleagues,

we are advertising two postdoc positions in combinatorics with a particular
focus on combinatorial limits and extremal combinatorics. However no
previous experience with research in these areas is required; applications
from recent PhD graduates are particularly welcome.

One of the positions is EPSRC-funded and the other is ERC-funded. The
expected starting date is October 2017 but the exact starting date of the
24-month ERC-funded position can be negotiated. The closing date for
applications to the positions is January 5, 2017. I enclose links with
further details.

http://www.jobs.ac.uk/job/AVS801/research-fellow-78754-116/
http://www.jobs.ac.uk/job/AVS865/research-fellow-78755-116/

Best regards,

Dan Kral

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 24
***************************************

Friday, November 25, 2016

dmanet Digest, Vol 105, Issue 23

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. 14th ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms: Call for Participation (Dirk Sudholt)
2. CPM 2017 (Combinatorial Pattern Matching), Warsaw, Poland -
Call for Papers (Jakub Radoszewski)
3. PhD position Graph Theory in Ilmenau (Matthias Kriesell)


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

Message: 1
Date: Tue, 22 Nov 2016 16:30:18 +0000
From: Dirk Sudholt <d.sudholt@sheffield.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 14th ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms: Call for Participation
Message-ID: <24cb398c-6b27-cbf2-2f16-c719ef833fff@sheffield.ac.uk>
Content-Type: text/plain; charset=utf-8; format=flowed

We would like to invite you to the 14th ACM/SIGEVO Workshop on
Foundations of Genetic Algorithms (FOGA XIV)
12-15 January 2017, Copenhagen, Denmark
http://foga-2017.sigevo.org

FOGA is the premier event on the theoretical foundations of evolutionary
computation and randomised search heuristics in general.

Please find the list of papers selected for presentation, information on
social events and the keynote lecture by Mikkel Thorup, as well as the
online registration on the conference homepage:
http://foga-2017.sigevo.org/

We have a limited sum of money for student travel support thanks to ACM
SIGEVO. Students wishing to apply are asked to send an email to
foga@list.ku.dk. Priority will be given to students with accepted papers.

We look forward to seeing you in Copenhagen!
Christian Igel, Dirk Sudholt, and Carsten Witt


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

Message: 2
Date: Wed, 23 Nov 2016 19:46:28 +0100
From: Jakub Radoszewski <jrad@mimuw.edu.pl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CPM 2017 (Combinatorial Pattern Matching), Warsaw,
Poland - Call for Papers
Message-ID:
<CAN1s7XKnd=Kjme8szfYqbSD4TCcKLr8bw5sk41KRtpd=JrSdDg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

First Call for Papers

CPM 2017
28th Annual Symposium on Combinatorial Pattern Matching
July 4-6, 2017, Warsaw, Poland

http://cpm2017.mimuw.edu.pl/

SCOPE: Papers on original research unpublished elsewhere in all areas
related to combinatorial pattern matching and its applications are welcome,
including, but not limited to: Bioinformatics and computational biology,
Coding and data compression, Combinatorics on words, Data mining,
Information retrieval, Natural language processing, Pattern discovery,
String algorithms, String processing in databases, Symbolic computing, and
Text searching and indexing.

The authors should submit an extended abstract not exceeding 10 pages in
LIPIcs (Dagstuhl series) format, including figures, title, authors,
affiliations, e-mail addresses, and a short abstract. References will not
be counted in the page limit. At least 10-point font should be used.
Additional material intended for the referee but not for publication in the
final version—for example details of proofs—may be placed in a clearly
marked appendix that is not included in the page limit.

An Alberto Apostolico best paper award will be presented during the
conference.

IMPORTANT DATES:

Deadline: Tuesday February 7, 2017, anywhere on Earth
Notification: March 23, 2017
Camera-Ready: April 13, 2017
Symposium: July 4-6, 2017

INVITED SPEAKERS:

Artur Jeż (University of Wrocław, Poland)
Giovanni Manzini (University of Piemonte Orientale, Italy)
Marcin Mucha (University of Warsaw, Poland)

PROGRAMME COMMITTEE:

Hideo Bannai (Kyushu University, Japan)
Philip Bille (Technical University of Denmark, Denmark)
Maxime Crochemore (King's College London, UK, and Université Paris-Est,
France)
Gabriele Fici (University of Palermo, Italy)
Johannes Fischer (TU Dortmund, Germany)
Jan Holub (Czech Technical University in Prague, Czech Republic)
Stepan Holub (Charles University in Prague, Czech Republic)
Juha Kärkkäinen (University of Helsinki, Finland), Co-Chair
Moshe Lewenstein (Bar Ilan University, Israel)
Gonzalo Navarro (University of Chile, Chile)
Kunsoo Park (Seoul National University, South Korea)
Marcin Piątkowski (Nicolaus Copernicus University in Toruń, Poland)
Nadia Pisanti (University of Pisa, Italy, and Erable Team INRIA, France)
Simon Puglisi (University of Helsinki, Finland)
Jakub Radoszewski (King's College London, UK, and University of Warsaw,
Poland), Co-Chair
Eric Rivals (CNRS and Université de Montpellier, France)
Wojciech Rytter (University of Warsaw, Poland), Co-Chair
Cenk Sahinalp (Indiana University, Bloomington, USA)
Rahul Shah (Louisiana State University, USA)
Ayumi Shinohara (Tohoku University, Japan)
Arseny Shur (Ural Federal University, Russia)
Tatiana Starikovskaya (Paris Diderot University, France)
Gabriel Valiente (Technical University of Catalonia, Spain)

ORGANIZING COMMITTEE:

Tomasz Kociumaka
Jakub Radoszewski
Wojciech Rytter
Tomasz Waleń

STEERING COMMITTEE:

Amihood Amir (Bar-Ilan University, Israel)
Maxime Crochemore (King's College London, UK, and Université Paris-Est,
France)
Zvi Galil (Georgia Institute of Technology, USA)
Roberto Grossi (University of Pisa, Italy)
Gad M. Landau (University of Haifa, Israel)
Esko Ukkonen (University of Helsinki, Finland)

Further details are available at the symposium website:
http://cpm2017.mimuw.edu.pl
Contact: cpm2017@mimuw.edu.pl

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

Message: 3
Date: Thu, 24 Nov 2016 15:13:49 +0100
From: Matthias Kriesell <matthias.kriesell@tu-ilmenau.de>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] PhD position Graph Theory in Ilmenau
Message-ID: <46F384AB-3128-46AE-8C80-0FE9D603CC8D@tu-ilmenau.de>
Content-Type: text/plain; charset=utf-8

(For the official job advertisement, see
http://www.tu-ilmenau.de/fileadmin/media/jobundkarriere/Mitarbeiterstellen/89-2016_engl..pdf
http://www.tu-ilmenau.de/fileadmin/media/jobundkarriere/Mitarbeiterstellen/89-2016_TU_Ilmenau.pdf (german) )


The Faculty of Mathematics and Natural Sciences, Chair Discrete Mathematics and Algebra, offers a temporary

Researcher / PhD position (Graph Theory)

part time (75%) for 3 years in the context of a DFG funded research project. Payment is according to TV-L E 13.

Field of activity: Scientific research within the project "Minors in Graphs with only a few colorings" (PI Prof. Dr. Matthias Kriesell) in the area of graph theory, focusing Hadwiger's Conjecture. The successful candidate should have an excellent background in combinatorics, in particular structural graph theory.

Conditions of employment:
- Degree in Mathematics (MSc or higher)
- Excellent background in combinatorics, in particular structural graph theory

We aim at establishing gender equality and hence encourage women to apply. Handicapped people with identical qualification, suitability, and competency will be considered with priority. Applications including complete curriculum vitae, diplomas, references (names and contact data, including thesis advisor), summary of the thesis, publication list if applicable should be send until

6th of January 2017

under the reference number 89 /2016 to:

Technische Universität Ilmenau
Dezernat für Personalangelegenheiten
Postfach 10 05 65
98684 Ilmenau
Germany

or, preferably, in electronic form to: bewerbung@tu-ilmenau.de

For further questions concerning the field of activity please contact:
Univ.-Prof. Dr. rer. nat. Matthias Kriesell, e-mail matthias.kriesell@tu-ilmenau.de


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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 23
***************************************

Wednesday, November 23, 2016

dmanet Digest, Vol 105, Issue 22

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. ICIST 2017 (Da Nang, Vietnam, April 16-19, 2017) Deadline
Extension Until Nov. 25, 2016! (Zhang, Nian)
2. CFP: 11th ACM International Conference on Distributed and
Event‐based Systems, ACM DEBS 2017 (Vinay Setty)
3. CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE SCPA 2017 -
May 21-25, 2017. Paris, France (Sandra Sendra)


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

Message: 1
Date: Mon, 21 Nov 2016 13:38:09 -0500
From: "Zhang, Nian" <nzhang@udc.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ICIST 2017 (Da Nang, Vietnam, April 16-19, 2017)
Deadline Extension Until Nov. 25, 2016!
Message-ID:
<32596A4A154B2442BF6312975C518D00048B8BAD0819@UDCMSGSTAFF-M.firebirds.udc.edu>

Content-Type: text/plain; charset="utf-8"

Call for Papers



The Seventh International Conference on Information Science and Technology (ICIST 2017), Da Nang, Vietnam, April 16-19, 2017



http://conference.cs.cityu.edu.hk/icist/



IMPORTANT: The paper submission deadline has been extended by 10 days - to Friday November 25, 2016!



The Seventh International Conference on Information Science and Technology (ICIST 2017) will be held in Da Nang, Vietnam during April 16-19, 2017, following the successes of previous events. Located at the central Vietnam, Da Nang is a popular beach resort and the second largest seaport in Vietnam, with three UNESCO heritage sites (Huế, Hội An, and Mỹ Sơn) nearby. ICIST 2017 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of research and applications in related fields. The conference will feature plenary speeches given by world renowned scholars, regular sessions with broad coverage, and special sessions focusing on popular topics.



Authors are invited to submit full-length papers by the submission deadline through the online submission system. The submission of a paper implies that the paper is original and has not been submitted under review or is not copyright-protected elsewhere and will be presented by an author if accepted. All submitted papers will be refereed by experts in the field based on the criteria of originality, significance, quality, and clarity. The Proceedings has been contracted to be included in IEEE Xplore Digital Library and will be submitted for EI indexing.



Important Dates

Paper submission deadline (updated): November 25, 2016

Notification of acceptance: December 15, 2016

Camera-ready copy and author registration: January 15, 2017

Conference: April 16-19, 2017


Contact: Dr. Nian Ashlee Zhang, Publications Chair of ICIST2017, nzhang@udc.edu<mailto:nzhang@udc.edu>

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

Message: 2
Date: Tue, 22 Nov 2016 11:09:53 +0100
From: Vinay Setty <vsetty@mpi-inf.mpg.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: 11th ACM International Conference on
Distributed and Event‐based Systems, ACM DEBS 2017
Message-ID: <825bb186-3655-20ed-21bd-b29af702e358@mpi-inf.mpg.de>
Content-Type: text/plain; charset=UTF-8

Call for Papers:
DEBS 2017: 11th ACM International Conference on Distributed and
Event‐based Systems
Co-Located with PLDI and ECOOP 2017@ Barcelona, Spain (June 19 - 23, 2017)

http://www.debs2017.org

Over the past decade, the ACM International Conference on Distributed
and Event‐based Systems (DEBS) has become the premier venue for
contributions in the fields of distributed and event‐based systems. The
objectives of the ACM International Conference on Distributed and
Event‐Based Systems (DEBS) are to provide a forum dedicated to the
dissemination of original research, the discussion of practical
insights, and the reporting of experiences relevant to distributed
systems and event‐based computing. The conference aims at providing a
forum for academia and industry to exchange ideas.

Scope
The DEBS conference covers topics in distributed and event-based
computing. The scope of the conference includes systems dealing with
detecting, processing and responding to events and with massively
distributed middleware and applications. Examples of application domains
covered by the conference include the Internet of Things, sensor
networks, social networking, finance, healthcare and logistics.
Technologies discussed include real-time analytics, complex-event
detection, security, reliability and resilience, energy management and
green computing, stream processing, embedded systems, and cloud,
peer-to-peer, ubiquitous and mobile computing. Topics relevant to
enterprise-level computing include enterprise application integration,
real-time enterprises, Web services and support for enterprises to
respond in timely fashion to changing situations.

Topics covered include, but are not limited to:
1. Models, Architectures and Paradigms: Event-driven architectures,
event processing in big data, complex event processing, rule-based
systems, logic-based event recognition, event correlation and pattern
languages.
2. Middleware infrastructures: Distributed data processing,
distributed programming, federated event-based systems,
information-centric networking, fault tolerance, reliability,
availability and scalability.
3. Applications, Experience and Requirements: Use cases and
applications of distributed and event-based systems in various domains
including Internet of Things, Smart Cities, Smart Grids, Finance, Logistics.
Structure
1. The Research Track presents original research contributions.
Submissions will be evaluated by an experienced program committee
consisting of eminent researchers from all over the world.
2. The Industry and Experience Reports Track is meant to report on
innovative deployments of event‐based systems. Contributions will be
reviewed by researchers and industry practitioners working in
distributed and event‐based computing.
3. In the Tutorial Track recognized experts in the field will present
their tutorials on relevant emerging areas of research.
4. In the Poster and Demo Track authors report on work in progress
and/or arrange to demonstrate interesting ideas and applications
pertaining to distributed and event‐based systems.
5. The Doctoral Symposium Track is meant for doctoral candidates
whose research area overlaps with distributed and event‐based systems.
6. The Grand Challenge Track: Here the committee will set out a grand
challenge problem and then judge the most innovative approaches to its
solution.

Important Dates

Abstract submission research track: Feb 21st, 2017
Research and industry paper submission: Feb 26th, 2017
Tutorial proposal submission: Mar 6th, 2017
Grand Challenge solution submission: Mar 29th, 2017
Author Notification: Apr 17th, 2017
Poster, Demo, Doctoral Workshop submission Apr 29th, 2017
Camera Ready Versions of Paper: May 19th, 2017

Proceedings

Accepted papers will appear in the conference proceedings, which will be
published in the ACM Digital Library. The authors of accepted papers
will be given a choice between different copyright agreements, in
accordance with the recent changes in the ACM policy. The options will
include new opportunities for open access as well as the traditional ACM
copyright agreement.

AUTHORS TAKE NOTE: A new policy by ACM will allow DEBS 2017 to make the
proceedings available ahead of the conference via the ACM Digital
Library. Thus, the official publication date is the date the proceedings
appear in the ACM Digital Library. This date may be up to two weeks
prior to the first day of the conference. The official publication date
affects the deadline for any patent filings related to published work.

Organizing Committee

General Chair:
Marta Patiño, Universidad Politécnica de Madrid, Spain

Research Track Co-Chairs:
Mani Chandy, Caltech, USA
Boris Koldehofe, TU Darmstadt, Germany

Industry Chair:
Mohammad Sadoghi, Purdue, USA

Doctoral Symposium Chairs:
Buğra Gedik, Bilkent, University, Turkey
Leonardo Querzoni, University Roma La Sapienza, Italy

Tutorial Chairs:
Annika Hinze University of Waikato, New Zealand
Dave Eyers University of Otago, New Zealand
Proceedings Chair Alessandro Margara, Politecnico di Milano, Italy

Grand Challenge Chairs:
Vincenzo Gulisano, Chalmers University of Technology, Sweden
Zbigniew Jerzak, SAP Research, Germany
Holger Ziekow, HS Furtwangen, Germany
Spyros Voulgaris, Vrije Universiteit Amsterdam, Netherlands

Demo and Poster Track Chairs:
Valerio Vianello, Universidad Politécnica de Madrid, Spain
Kaiwen Zhang TU Munich, Germany

Publicity Chairs:
Vinay Setty, Aalborg University, Denmark
Jatinder Singh, Cambridge, UK
Annie Liu, Facebook, USA

Web Chair:
David Jiménez-Peris, Universidad Politécnica de Madrid, Spain

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

Message: 3
Date: Tue, 22 Nov 2016 12:30:20 +0100
From: Sandra Sendra<sandra.sendra.upv@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE
SCPA 2017 - May 21-25, 2017. Paris, France
Message-ID: <201611221130.uAMBUJeu029374@smtp.upv.es>
Content-Type: text/plain; charset=us-ascii

-------------------- CALL FOR PAPERS (DEADLINE EXTENDED) -----------------
5th IEEE International Workshop on Smart Communication Protocols and Algorithms (SCPA 2017)
May 21-25, 2017. Paris, France
In conjunction with IEEE ICC 2017
http://scpa.it.ubi.pt/2017/
------------------------------------------------------------------------------------------------

Selected papers will be invited to the Special Issue on Smart Protocols and Algorithms of the International Journal Network Protocols and Algorithms (ISSN: 1943-3581) or to the Special Issue on Recent Advances on Communications and Networking Technology Journal (ISSN: 2215-082X (Online); ISSN: 2215-0811 (Print)).


Communication protocols and algorithms are needed to communicate network devices and exchange data between them. The appearance of new technologies usually comes with a protocol procedure and communication rules that allows data communication while taking profit of this new technology. Recent advances in hardware and communication mediums allow proposing new rules, conventions and data structures which could be used by network devices to communicate across the network. Moreover, devices with higher processing capacity let us include more complex algorithms that can be used by the network device to enhance the communication procedure.
Smart communication protocols and algorithms make use of several methods and techniques (such as machine learning techniques, decision making techniques, knowledge representation, network management, network optimization, problem solution techniques, and so on), to communicate the network devices to transfer data between them. They can be used to perceive the network conditions, or the user behavior, in order to dynamically plan, adapt, decide, take the appropriate actions, and learn from the consequences of its actions. The algorithms can make use of the information gathered from the protocol in order to sense the environment, plan actions according to the input, take consciousness of what is happening in the environment, and take the appropriate decisions using a reasoning engine. Goals such as decide which scenario fits best its end-to-end purpose, or environment prediction, can be achieved with smart protocols and algorithms. Moreover, they could learn from the pas!
t and use this knowledge to improve
future decisions.
In this workshop, researchers are encouraged to submit papers focused on the design, development, analysis or optimization of smart communication protocols or algorithms at any communication layer. Algorithms and protocols based on artificial intelligence techniques for network management, network monitoring, quality of service enhancement, performance optimization and network secure are included in the workshop.
We welcome technical papers presenting analytical research, simulations, practical results, position papers addressing the pros and cons of specific proposals, and papers addressing the key problems and solutions. The topics suggested by the conference can be discussed in term of concepts, state of the art, standards, deployments, implementations, running experiments and applications.

Topics of interest:
------------------------------------------------------------------------------------------------
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal, including, but are not limited to, the following topic areas:
- Smart network protocols and algorithms for multimedia delivery
- Application layer, transport layer and network layer cognitive protocols
- Cognitive radio network protocols and algorithms
- Automatic protocols and algorithms for environment prediction
- Algorithms and protocols to predict data network states
- Intelligent synchronization techniques for network protocols and algorithms
- Smart protocols and algorithms for e-health
- Software applications for smart algorithms design and development
- Dynamic protocols based on the perception of their performance
- Smart protocols and algorithms for Smartgrids
- Protocols and algorithms focused on building conclusions for taking the appropriate actions
- Smart Automatic and self-autonomous ad-hoc and sensor networks
- Artificial intelligence applied in protocols and algorithms for wireless, mobile and dynamic networks
- Smart security protocols and algorithms
- Smart cryptographic algorithms for communication
- Artificial intelligence applied to power efficiency and energy saving protocols and algorithms
- Smart routing and switching protocols and algorithms
- Cognitive protocol and algorithm models for saving communication costs
- Any kind of intelligent technique applied to QoS, content delivery, network Monitoring and network management
- Smart collaborative protocols and algorithms
- Problem recognition and problem solving protocols
- Genetic algorithms, fuzzy logic and neural networks applied to communication protocols and algorithms

Important Dates:
------------------------------------------------------------------------------------------------
Submission Deadline: 2nd December, 2016 (Extended deadline)
Acceptance Notification: 17th February, 2016
Camera Ready Deadline: 10th March, 2016

Submission guidelines:
------------------------------------------------------------------------------------------------
All submissions must be full papers in PDF format and uploaded on EDAS: (https://edas.info/newPaper.php?c=22957&track=82208)

All submissions should be written in English with a maximum paper length of five (5) printed pages (10-point font) including figures without incurring additional page charges.

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

General Chairs:
Jaime Lloret Mauri, Universitat Politecnica Val�ncia, Spain
Joel Rodrigues, National Institute of Telecommunications (Inatel), Brazil;
Instituto de Telecomunica��es, Univ. of Beira Interior, Portugal

TPC Chairs:
Sandra Sendra, Universidad de Granada, Spain
Kashif A. Saleem, Kind Saud University, Saudi Arabia
Bruno Silva, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal

Keynote Chairs:
Danda B. Rawat, Georgia Southern University, USA

Panel Chairs:
Raimir Filho, University of Fortaleza, Brazil
Pascal Lorenz, University of Haute Alsace, France

Industry Chair:
Antonio S�nchez-Esguevillas, Telefonica R&D, Spain

Publicity Chairs:
Sofiane Hamrioui, University of Haute Alsace, France
Jose M. Jimenez, Universidad Polit�cnica de Valencia, Spain

Web Chair:
Jo�o N. Isento, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal


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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 22
***************************************

Tuesday, November 22, 2016

dmanet Digest, Vol 105, Issue 21

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. CFP: Special Track Game AI at IEA/AIE 2017 (abstract Dec. 08,
paper Dec. 15) (Florian Richoux)


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

Message: 1
Date: Mon, 21 Nov 2016 15:39:36 +0100
From: Florian Richoux <florian.richoux@univ-nantes.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: Special Track Game AI at IEA/AIE 2017 (abstract
Dec. 08, paper Dec. 15)
Message-ID: <a5f0810d-5385-fa1c-1df0-df43bf58c1ab@univ-nantes.fr>
Content-Type: text/plain; charset=utf-8


Special Track Game AI at IEA/AIE 2017, June 27-30, 2017 Arras (near
Paris, France)


Context

Among numerous possibles applications of Artificial Intelligence, games
are convenient and efficient testbeds to develop innovating techniques
and methods. By games, we mean every game playable through a computer:
video games, board games, serious games, etc.

Behind the fun side, games propose a simplified environment regarding to
the real world, while remaining rich enough to also propose
scientifically pertinent problems: understanding of a dynamic
environment, knowledge extraction, decision-making upon incomplete
information, planning, cooperation, learning or mimicking credible
behaviors, optimization, path-finding, etc.

Many of these problems are common to others research fields such as
robotics, but games offer a greater flexibility: thanks to their
dematerialized nature, these environments are inexpensive,
transportable, need no physical maintenance and propose a highly
controllable time flow (accelerated, paused, etc).


Scope

Topics of interest for this special track on Game AI include, but are
not limited to:

* Planning;
* Decision-making in a dynamic and/or incomplete information environment;
* Data-mining;
* CSP/SAT, combinatorial optimization;
* Cooperative or competitive multi-agent systems;
* Game rules and/or behaviors learning;
* Spacial and temporal reasoning;
* Credible behaviors (emotion, personality), player immersion;
* Storytelling generation;
* User experience;
* Path-finding;
* Game play programming;
* Engine programming;
* Serious games/applications, Game with A Purpose (GWAP).


Important dates

*


Abstract Submission Deadline: December 8th 2016

*


Paper Submission Deadline: December 15th 2016


Preliminary Program Committee

Carole Adam (Universite de Grenoble)
Stephane Cardon (Saint-Cyr Coetquidan)
Tristan Cazenave (Universite Paris Dauphine), Chair
Eric Jacopin (Saint-Cyr Coetquidan)
Mehdi Kaytoue (Insa Lyon)
Philippe Mathieu (Universite Lille 1)
Eric Piette (Universite d'Artois)
Chedy Raissi (Inria Nancy Grand-Est)
Florian Richoux (Universite de Nantes), Chair
Abdallah Saffidine (University of New South Wales)
...

--
Florian RICHOUX - Associate Professor
www.richoux.fr | LINA - Université de Nantes
florian.richoux@univ-nantes.fr | 2 chemin de la Houssinière, BP92208
+33 (0)2 51 12 58 44 | 44322 NANTES cedex 3, FRANCE


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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 21
***************************************

Monday, November 21, 2016

dmanet Digest, Vol 105, Issue 20

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."


Today's Topics:

1. CanaDAM 2017 - Preliminary Announcement (Pawel Pralat)
2. Research chairs, postdocs, doctoral and master scholarships
in paris (Communication FSMP)
3. 15th EUROPT Workshop on Advances in Continuous Optimization
(Andrea Lodi)
4. Postdoc and PhD positions in "Distributed and Dynamic Graph
Algorithms and Complexity" at KTH, Sweden (Danupon Nanongkai)
5. faculty position in Athens, Greece (last call)
(Stavros Kolliopoulos)
6. 2nd CfP: ICFCA'17 — 14th International Conference on Formal
Concept Analysis (Daniel Borchmann)


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

Message: 1
Date: Fri, 18 Nov 2016 11:14:48 -0500
From: Pawel Pralat <pralat@ryerson.ca>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CanaDAM 2017 - Preliminary Announcement
Message-ID: <1F02EA4B-25C3-43A2-9BCA-F1792EA02FAB@ryerson.ca>
Content-Type: text/plain; charset=utf-8

CanaDAM 2017 - Preliminary Announcement

The sixth Canadian Discrete and Algorithmic Mathematics conference (CanaDAM) https://canadam.math.ca/2017/ <https://canadam.math.ca/2017/> will be held June 12-15, 2017 at Ryerson University in Toronto, Ontario, Canada.

The general topic of the conference is the theory and application of discrete structures. Its goal is to highlight the most salient trends in the field. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. The CanaDAM conference is held in odd numbered years using a format similar to the SIAM conference on Discrete Mathematics. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, communication networks and information processing.

Invited Speakers:
Tanya Berger-Wolf (U. Illinois at Chicago)
Peter Keevash (Oxford)
Robert Kleinberg (Cornell)
Bojan Mohar (Simon Fraser)
Shubhangi Saraf (Rutgers)
Andrew Suk (U Illinois at Chicago)
Lauren Williams (Berkeley)
Julia Wolf (Bristol)

Submission deadlines (instructions for making submissions will be available once submissions are open in December):
• Contributed minisymposia proposals, including titles and abstracts for all speakers: March 1, 2017 (acceptance notification by March 8, 2017).
• Titles and abstracts of contributed talks: March 1, 2017 (acceptance notification by March 8, 2017).
• Abstracts of invited talks: February 7, 2017 (acceptance notification by February 14, 2017).
• Abstracts of invited minisymposia: February 7, 2017 (acceptance notification by February 14, 2017).

Registration deadlines:
• Early registration deadline: April 15, 2017 at 23:59 (11:59 pm) eastern daylight time.
• Full fees apply beginning April 16, 2015.
• Early registration fee (until April 15): $260; Students and Post-docs: $100.
• Regular registration fee (after April 15): $360; Students and Post-docs: $200.
• Online registration deadline: May 25, 2017 at 23:59 (11:59 pm) eastern daylight time.
• Student / Post-doctoral funding application deadline: March 15, 2017 (notification by April 5, 2017).

For information about accommodation, including booking deadlines, please see the Accommodation page on the website.

CanaDAM acknowledges the generous support of our sponsors: AARMS, CRM, Fields, PIMS, and Ryerson University.

Thank you,
— Pawel Pralat
————————————
http://www.math.ryerson.ca/~pralat/
Assistant Director for Industry Liaison, The Fields Institute for Research in Mathematical Sciences
Associate Professor, Department of Mathematics, Ryerson University


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

Message: 2
Date: Fri, 18 Nov 2016 17:25:09 +0100
From: Communication FSMP <communication@fsmp.fr>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Research chairs, postdocs, doctoral and master
scholarships in paris
Message-ID: <2C3408BE-EB01-4015-B260-8204928FA57C@fsmp.fr>
Content-Type: text/plain; charset=utf-8

The Foundation Sciences Mathématiques de Paris is pleased to offer the following opportunities in Paris to outstanding scientists and excellent students in mathematics or in fundamental computer science:
- Research chairs
- Postdoctoral positions
- Doctoral allowances
- Masters scholarships

Procedures of applications are available at:
www.sciencesmaths-paris.fr <http://www.sciencesmaths-paris.fr/>

Contact: contact@fsmp.fr

Best regards,

Gaël Octavia
Responsable de la communication
Fondation Sciences Mathématiques de Paris
www.sciencesmaths-paris.fr <http://www.sciencesmaths-paris.fr/>
IHP - 11 rue Pierre et Marie Curie
75231 Paris Cedex 05
communication@fsmp.fr
Tél : 33 (0)1 44 27 67 70
Fax : 33 (0)1 44 27 68 04


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

Message: 3
Date: Sun, 20 Nov 2016 03:52:16 +0000
From: Andrea Lodi <andrea.lodi@unibo.it>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 15th EUROPT Workshop on Advances in Continuous
Optimization
Message-ID: <9BEB4D18-3E6D-469B-A0C5-40AB4EE1C23F@unibo.it>
Content-Type: text/plain; charset="utf-8"

Dear colleagues,

We are pleased to announce the 15th EUROPT Workshop on Advances in Continuous Optimization, to be held in Montreal, Quebec, Canada, on July 12-14, 2017:
https://www.gerad.ca/colloques/europt2017/

The EUROPT Workshop on Advances in Continuous Optimization is the annual event of the EUROPT continuous optimization working group of EURO (The Association of European Operational Research Societies). This 15th edition will take place in Montreal just before the 21st IFORS conference that will be held in Quebec City.

The workshop will take place during Montreal's 375th anniversary celebrations. Activities and special events are advertised at http://www.375mtl.com/en <http://www.375mtl.com/en/.>

Plenary Speakers
* Shabbir Ahmed (Georgia Institute of Technology, U.S.A.)
* Timothy C.Y. Chan (University of Toronto, Canada)
* Francisco Facchinei (University of Rome La Sapienza, Italy)

Special Sessions In Memoriam
The scientific program will include special sessions in memory of Jonathan M. Borwein, Roger Fletcher, and Christodoulos A. Floudas.

Abstract Submission is online and is already open at https://symposia.gerad.ca/europt2017/en/submit

Important Dates:
Abstract submission deadline: March 15, 2017
Abstract acceptance: March 31, 2017
Early bird registration deadline: May 1st, 2017

Please see the workshop webpage https://www.gerad.ca/colloques/europt2017/ for more information.

We look forward to seeing you in Montreal next year!

Sébastien Le Digabel, Miguel Anjos, Fabian Bastin and Andrea Lodi, organizers

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

Message: 4
Date: Sun, 20 Nov 2016 11:48:16 +0100
From: Danupon Nanongkai <danupon@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc and PhD positions in "Distributed and
Dynamic Graph Algorithms and Complexity" at KTH, Sweden
Message-ID:
<CAMmtLngiWqm9Q+3u1F1ua6=S8k7Y4KpiteAnDeV8xKwdJYhyAg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

Applications are invited for Postdoc and PhD positions in the group of
Danupon
Nanongkai at the Theoretical Computer Science department, KTH Royal
Institute of Technology, Stockholm, Sweden. We are looking for people who
want to work on one or more aspects of the project "Distributed and Dynamic
Graph Algorithms and Complexity", supported by the ERC starting grant and
the Swedish Research Council grant.

Candidates who have strong interests in exploring the impact of the
following techniques in the fields of distributed and dynamic graph
algorithms are especially desired: (i) algebraic techniques (e.g. fast
algorithms for matrix multiplication and computing ranks), (ii) spectral
techniques (e.g. fast algorithms for computing maximum flow, sparsest cut,
and tree embedding), (iii) communication complexity, (iv) fine-grained
complexity.

For more information and how to apply, please visit
https://sites.google.com/site/dannanongkai/vacancies.

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

Message: 5
Date: Mon, 21 Nov 2016 14:28:38 +0200
From: Stavros Kolliopoulos <sgk@di.uoa.gr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] faculty position in Athens, Greece (last call)
Message-ID: <51EAC2D3-13FA-40C6-8A32-D7F5F1A41C5D@di.uoa.gr>
Content-Type: text/plain; charset=us-ascii


The Department of Informatics and Telecommunications at the National
and Kapodistrian University of Athens has an opening for a
tenure-track faculty position in "Algorithms and Complexity", at the
rank of Assistant Professor. Candidates must have established a strong
theory research record and demonstrate a clear potential for further
academic advancement. The language of instruction in the department is
Greek.


The hard deadline for applying is December 12, 2016. Details for
the application procedure can be found here (in Greek):

http://www.di.uoa.gr/announcements/faculty/1883

Further enquiries may be directed to Stavros Kolliopoulos
(sgk@di.uoa.gr).


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

Message: 6
Date: Mon, 21 Nov 2016 15:30:47 +0100
From: Daniel Borchmann <daniel.borchmann@tu-dresden.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CfP: ICFCA'17 — 14th International Conference
on Formal Concept Analysis
Message-ID: <87twb09a7c.fsf@tu-dresden.de>
Content-Type: text/plain; charset=utf-8

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

ICFCA 2017

14th International Conference on Formal Concept Analysis

June 12—16, 2017, Rennes, France

Web: <http://icfca2017.irisa.fr/>
Mail: icfca2017@inria.fr

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

* Overview

Formal Concept Analysis emerged in the 1980's from attempts to restructure
lattice theory in order to promote better communication between lattice
theorists and potential users of lattice theory. Since its early years, Formal
Concept Analysis has developed into a research field in its own right with a
thriving theoretical community and a rapidly expanding range of applications in
information and knowledge processing including visualization, data analysis
(mining) and knowledge management and discovery.

The ICFCA conference series aims at bringing together researchers and
practitioners working on theoretical or applied aspects of Formal Concept
Analysis within major related areas such as Mathematics and Computer and
Information Sciences and their diverse applications to fields like Software
Engineering, Linguistics, Life and Social Sciences, etc.

All accepted submissions will be refereed, and the conference proceedings will
be published by Springer in the LNCS/LNAI series.

* Topics

Main topics of interest include, but are not limited to:

** Fundamental aspects of FCA

- FCA theory
- Lattice theory
- Lattice drawing
- Philosophical foundations
- Algorithms and complexity theory

** Bridging FCA to information sciences and artificial intelligence

- FCA and logic, e.g., semantic web, description logics
- FCA and conceptual structures, e.g., concept graphs, knowledge spaces
- FCA and data analysis, e.g., hierarchical classification, data organization
- FCA and data mining, e.g., pattern mining
- FCA and information retrieval, e.g. exploratory search, navigation, querying
- FCA and machine learning, e.g., learning with hypothesis, feature selection
- FCA and database theory, e.g., dependencies, rules, data cubes
- FCA and software engineering
- FCA and morphological mathematics

** Understanding, modelling real-world data and phenomena with FCA

- Analysis of "big data" with FCA, e.g., sampling, parallel computing
- Analysis of social networks and their dynamics
- Applications for scientific data analysis, e.g., in biology or health care
- Applications for sensors data and user interactions traces
- Other FCA applications

* Submission Details

We invite scientific publications on theory and applications of Formal Concept
Analysis. Papers of up to sixteen pages may be submitted in the PDF format via
the Easychair system

<https://easychair.org/conferences/?conf=icfca2017>.

Authors are requested to follow the formatting instructions for the Springer
LNCS style.[1] Submissions in LaTeX2e are preferred. Authors are encouraged to
provide an ORCID alongside their submission.[2]

Accepted papers have to be presented at the conference. Therefore, at least one
author per paper has to register timely.

[1]: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
[2]: https://www.springer.com/gp/authors-editors/orcid

* Important Dates

Submission of abstract: December 12, 2016
Submission of full paper: December 19, 2016
Notification of acceptance: February 6, 2017
Camera ready due: February 27, 2017
Conference: June 12—16, 2017

* Organization

The conference will be hosted by IRISA[3] and Centre de Recherche Inria Bretagne
Atlantique[4].

[3]: https://www.irisa.fr/en
[4]: https://www.inria.fr/centre/rennes

** Conference Chairs

Peggy Cellier, IRISA, INSA Rennes, France
Sébastien Ferré, IRISA, University Rennes 1, France

** Program Chairs

Karell Bertet, L3I, Université de La Rochelle, France
Daniel Borchmann, Technische Universität Dresden, Germany

** Editorial Board

Jaume Baixeries, Polytechnic University of Catalonia, Catalonia
Peggy Cellier, IRISA lab, Rennes, France
Florent Domenach, Akita International University, Japan
Peter Eklund, IT University of Copenhagen, Denmark
Sebastien Ferré, Université de Rennes 1, France
Bernhard Ganter, Technische Universität Dresden, Germany
Cynthia Vera Glodeanu
Mehdi Kaytoue, INSA-Lyon, LIRIS, France
Sergei Kuznetsov, Higher School of Economics, Moscow, Russia
Leonard Kwuida, Bern University of Applied Sciences
Rokia Missaoui, Université du Québec en Outaouais (UQO), Canada
Amedeo Napoli, LORIA, Nancy, France
Sergei Obiedkov, Higher School of Economics, Moscow, Russia
Manuel Ojeda-Aciego, University of Malaga, Spain
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany
Sebastian Rudolph, Technische Universität Dresden, Germany
Christian Sacarea, Babes-Bolyai University of Cluj-Napoca, Romania
Stefan E. Schmidt, Technische Universität Dresden, Germany
Gerd Stumme, Universität Kassel, Germany
Petko Valtchev, Université du Québec à Montréal, Canada
Karl Erich Wolff, University of Applied Sciences, Darmstadt, Germany

** Honorary Members

Vincent Duquenne, ECP6-CNRS, Université Paris 6, France
Rudolf Wille, Technische Universität Darmstadt, Germany

** Program Committee

Simon Andrews, Sheffield Hallam University, United Kingdom
François Brucker, Centrale Marseille, France
Claudio Carpineto, Fondazione Ugo Bordoni, Italy
Pablo Cordero, University of Málaga, Spain
Jean Diatta, Université de la Réunion, France
Felix Distel, d-fine GmbH, Germany
Christophe Demko, L3I lab, Université de La Rochelle, France
Stephan Doerfel, MICROMATA GmbH, Germany
Alain Gély, Université Paul Verlaine, Metz, France
Robert Godin, Université du Québec à Montréal, Canada
Marianne Huchard, LIRMM, Université Montpellier, France
Dmitry Ignatov, Higher School of Economics, Moscow, Russia
Robert Jäschke, University of Sheffield, England
Michal Krupka, Palacky University, Olomouc, Czech Republic
Marzena Kryszkiewicz, Warsaw University of Technology, Poland
Wilfried Lex, Universität Clausthal, Germany
Jesús Medina, Cadiz University, Spain
Engelbert Mephu Nguifo, LIMOS, Université de Clermont Ferrand 2, France
Lhouari Nourine, LIMOS, Université de Clermont Ferrand 2, France
Jan Outrata, Palacky University of Olomouc, Czech Republic
Jean-Marc Petit, LIRIS, INSA Lyon, France
Sandor Radeleczki, University of Miskolc, Hungary
Barış Sertkaya, Frankfurt University of Applied Sciences
Laszlo Szathmary, University of Debrecen, Hungary
Andreja Tepavčević, University of Novi Sad, Serbia
Jean-François Viaud, L3I lab, Université de La Rochelle, France

--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. rer. nat. Daniel Borchmann
Postdoctoral Research Associate

Technische Universität Dresden
Fakultät Informatik
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie
01062 Dresden
Tel.: +49 351 463-38351
E-Mail: daniel.borchmann@tu-dresden.de
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet


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

End of dmanet Digest, Vol 105, Issue 20
***************************************