Theory Announcements: September 2018

Monday, September 24, 2018

ALT 2019 CfP - submission deadline Sep 28

ALT 2019 CALL FOR PAPERS

The ALT 2019 conference is dedicated to all theoretical and algorithmic aspects of machine learning. We invite submissions with contributions to new or existing learning problems including, but not limited to:

* Design and analysis of learning algorithms.
* Statistical and computational learning theory.
* Online learning algorithms and theory.
* Optimization methods for learning.
* Unsupervised, semi-supervised, online and active learning.
* Connections of learning with other mathematical fields.
* Artificial neural networks, including deep learning.
* High-dimensional and non-parametric statistics.
* Learning with algebraic or combinatorial structure.
* Bayesian methods in learning.
* Planning and control, including reinforcement learning.
* Learning with system constraints: e.g. privacy, memory or communication budget.
* Learning from complex data: e.g., networks, time series, etc.
* Interactions with statistical physics.
* Learning in other settings: e.g. social, economic, and game-theoretic.

We are also interested in papers that include viewpoints that are new to the ALT community. We welcome experimental and algorithmic papers provided they are relevant to the focus of the conference by elucidating theoretical results, or by pointing out an interesting and not well understood behavior that could stimulate theoretical analysis.
Paper submission deadline : Friday, September 28, 2018, 4:59PM EST.

Authors can submit their papers electronically via the submission page https://easychair.org/conferences/?conf=alt2019 which will be opened a few weeks before the conference submission deadline.

AWARDS
ALT 2018 will have both a best student paper award (E.M. Gold Award) and a best paper award. Authors must indicate at submission time if they wish their paper to be eligible for a student award. This does not preclude the paper to be eligible for the best paper award. The paper can be co-authored by other researchers.

TUTORIALS
We also invite proposals for a tutorial presentation. These should be dealing with a learning theory topic covered within two hours. Proposals are limited to 2 pages and should include a one page abstract as well as links to any relevant material such as existing slides or other teaching material.
Tutorials Submission Deadline : October 19, 2018.

SUBMISSION GUIDELINES
* POLICY
Each submitted paper will be reviewed by the members of the program committee and be judged on clarity, significance and originality. Joint submissions to other conferences with published proceedings are not allowed. Papers that have appeared in or are under review for other conferences are not appropriate for ALT 2019. The same policy applies to journals, unless the submission is a shorter version of a paper submitted to a journal and has not yet been published. It is, however, acceptable to submit to ALT work that has been made available as a technical report or similar, for example on https://arxiv.org/.

* FORMATTING
There is no page limit for submissions, and submissions should include all proofs and technical details necessary to understand the results. However, referees are not required to read beyond the first 12 pages when reviewing submissions. Therefore, it is recommended that the first 12 pages contain a clear presentation of the papers main contributions and at least sketches of the main arguments. All accepted papers will be published as a volume in the Proceedings of Machine Learning Research series, and will be available online during the conference. Submissions should be formatted according to the instructions on the following page: http://www.jmlr.org/format/format.html.

* REVIEW
The reviewing process is not double-blind. Authors should list their names and affiliations in their submissions.

VENUE
The conference will be held in Chicago, IL, USA from March 22-24, 2019.

CONTACT
All questions about submissions should be emailed to the PC chairs at alt2019pc@gmail.com.

CONFERENCE WEBSITE
http://alt2019.algorithmiclearningtheory.org/

Friday, September 21, 2018

TAMC 2019 - Call for Papers

CALL FOR PAPERS:

15th Annual Conference on Theory and Applications of Models of Computation
[TAMC 2019]
13-16 April 2019
Kitakyushu International Conference Center, Kokura Station, Kitakyushu
(City), Japan
https://drive.google.com/open?idMYAEUR1pRw9PBLcvVnm7bRgZ0hk1G5EV

Important Dates:

Paper Submission Deadline: November 15, 2018
Notification of Acceptance: December 15, 2018
Final Camera Ready Version: January 15, 2019

Proceedings:

Springer Lecture Notes in Computer Science

In Association With:

International Society of Management Engineers [ISME], Japan

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

Scope and Topics

TAMC 2019 aims at bringing together a wide range of researchers with
interest in computational theory and its applications. The main themes of
the conference are computability, computer science logic, complexity,
algorithms, models of computation and systems theory. There are special
sessions on "Soft Computing and AI Models".

Typical but not exclusive topics of interest include:

algebraic computation
algorithmic coding and number theory
approximation algorithms
automata theory
computational biology and biological computing
computational (e.g. circuit, structural) complexity
computational game theory
computational geometry
computer science logic
cryptography
domain models
learning theory
modal and temporal logics
model theory for computing (e.g. specification and verification)
natural computation
networks in nature and society
online algorithms
optimization
privacy and security
process models
proof complexity
property testing
quantum computing
randomness and pseudo-randomness
space-time tradeoffs
streaming algorithms
systems theory (e.g. concurrent, timed, hybrid)
VLSI models of computation

All papers must be original and not simultaneously submitted to
another journal or conference. Submitted papers should be Full papers
[10-20 Pages] where a page constitutes 300-400 words. Please
read carefully all the other guidelines hosted at:

https://www.springer.com/de/it-informatik/lncs/conference-proceedings-guidelines

Steering Committee

M. Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin, USA)
J. Hopcroft (Cornell University, USA)
A. Li (Beihang University, Beijing, China)
Z. Liu (Institute of Computing Technology, Chinese Academy of Sciences, China)

Programme Committee

Chair: Professor Junzo Watada, Waseda University, Japan
Co-chair: Professor T V Gopal, Anna University, India

Finance Committee:

Chair: Professor Yoshiyuki Matsumoto, Shimonoseki City University, Japan

The programme committee has 33 Eminent Experts from 20 Countries.

Aaron D. Jaggard, U.S. Naval Research Laboratory, USA
Abdulmunem M Artoli, King Saud University, Saudi Arabia
Anthony Bonato, Ryerson University, Canada
Antonio Fernandez Anta, IMDEA Networks Institute, Spain
Cristian S. Calude, University of Auckland, New Zealand
Frank Stephan, National University of Singapore, Singapore
Hans Bodlaender, Utrecht University/ Eindhoven University of
Technology, Netherlands
Hiroshi Sakai, Kyushu Institute of Technology, Japan
Jan Kratochvil, Charles University, Czech Republic
Johann A. Makowsky, Technion - Israel Institute of Technology, Israel
Jose Rolim, University of Geneva, Switzerland
Kawano Tomonori, Kitakyushu City University, Japan
Kenichi Asami, Kyushu Institute of Technology, Japan
Klaus Ambos-Spies, University of Heidelberg, Germany
Klaus Meer, Brandenburg University of Technology (BTU) Cottbus
Senftenberg, Germany
Maya Dimitrova, Institute of Robotics, Bulgarian Academy of Sciences, Bulgaria
Naijun Zhan, Institute of Software Chinese Academy of Sciences, China
Pan Peng, University of Sheffield, United Kingdom
Pandu Rangan Chandrasekaran, Indian Institute of Technology, Madras, India
Philippe Moser, National University of Ireland, Ireland
Pushkar S. Joglekar, Vishwakarma Institute of Technology, India
Roman Kuznets, Technical University Wien, Austria
Shyamasundar R.K, Indian Institute of Technology Bombay, India
Steffen Lempp, University of Wisconsin, Madison, USA
Toshihide Yoshimura, Kitakyushu City University, Japan
Thomas Zeugmann, Hokkaido University, Japan
Valentina Emilia Balas, Aurel Vlaicu University of Arad, Romania
Venkat Chakravarthy, IBM, India
Toshihiro Fujito, Toyohashi University of Technology, Japan
Wu Guohua, Nanyang Technological University, Singapore
Yaroslav D. Sergeyev, Universita della Calabria, Italy
Yoshiyuki Matsumoto, Shimonoseki City University, Japan
Yoshiyuki Yabuuchi, Shimonoseki City University, Japan

Monday, September 17, 2018

[DMANET] Ph.D. Program in Industrial and Systems Engineering (ISE) at Lehigh University

The Department of Industrial and Systems Engineering (ISE) at Lehigh
University invites applications for its Ph.D. program.

Faculty and students in the department are involved in cutting-edge
research in a variety of extremely active areas including

- mathematical optimization,

- data science and machine learning,

- energy and service systems, and

- high-performance computing.

Our PhD alumni have been recruited by top universities, research
institutions, and companies. For more information, please see our website:
http://ise.lehigh.edu

Financial support is guaranteed for first-year students. Subsequent
support is available through research advisors and their federal, state,
and industry grants.

Please direct any questions to Frank E. Curtis <frank.e.curtis@gmail.com>

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

[DMANET] ICDCN 2019 Workshops Call for Papers

[Apologies if you received multiple copies of this announcement]

ICDCN 2019 is hosting several associated workshops. The details 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 for submission are as follows:

- Submission Deadline: 1st October 2018 AoE

- Acceptance Notification: 1st November 2018 AoE

- Camera Ready Version: 15th November 2017 AoE

- Workshop Dates: 4th & 7th January 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] STACS 2019 in Berlin --- Second and Last Call for Papers

STACS 2019 - Call for papers

36th International Symposium on Theoretical Aspects of Computer Science
March 13—16, 2019, TU Berlin, Berlin, Germany

Authors are invited to submit papers presenting original and unpublished
research on theoretical aspects of computer science. Typical areas
include (but are not limited to):

* algorithms and data structures,
including: design of parallel, distributed, approximation,
parameterized and randomized algorithms; analysis of algorithms and
combinatorics of data structures; computational geometry,
cryptography, algorithmic learning theory, algorithmic game theory;
* automata and formal languages,
including: algebraic and categorical methods, coding theory;
* complexity and computability,
including: computational and structural complexity theory,
parameterized complexity, randomness in computation;
* logic in computer science,
including: finite model theory, database theory, semantics,
specification verification, rewriting and deduction;
* current challenges,
for example: natural computing, quantum computing, mobile and net
computing, computational social choice.

INVITED SPEAKERS

Leslie Ann Goldberg (Oxford),
"Computational Complexity and the Independence Polynomial"

Anca Muscholl (Bordeaux),
"The Many Facets of String Transducers"

Petra Mutzel (Dortmund),
"Algorithmic Data Analysis"

PROGRAM COMMITTEE

Christoph Berkholz (Berlin)
Benedikt Bollig (Cachan)
Karl Bringmann (Saarbrücken)
Gerth Stølting Brodal (Aarhus)
Maike Buchin (Bochum)
David Eppstein (Irvine)
Serge Gaspers (Sydney)
Edward Hirsch (St. Petersburg)
Telikepalli Kavitha (Mumbai)
Hartmut Klauck (Singapore)
Antonín Kučera (Brno)
K Narayan Kumar (Chennai)
Dietrich Kuske (Ilmenau)
Jérôme Lang (Paris)
Sophie Laplante (Paris)
Kazuhisa Makino (Kyoto)
Barnaby Martin (Durham)
Cyril Nicaud (Marne-la-Vallée)
Rolf Niedermeier (Berlin, co-chair)
Jakob Nordström (Stockholm)
Christophe Paul (Montpellier, co-chair)
Pascal Schweitzer (Kaiserslautern)
Shinnosuke Seki (Tokyo)
Michał Skrzypczak (Warsaw)
Srikanth Srinivasan (Mumbai)
Jan Arne Telle (Bergen)
Denis Trystram (Grenoble)
Takeaki Uno (Tokyo)
Mikhail Volkov (Ekaterinburg)
Stefan Woltran (Wien)

TUTORIALS

There will be the following two tutorials taking place on March 13, 2019:

Tobias Friedrich (HPI Potsdam):
"Network Science"

Karl Bringmann (MPI Saarbrücken):
"Fine-Grained Complexity Theory"

SUBMISSIONS

Submissions can be uploaded to EasyChair:
https://easychair.org/conferences/?conf=stacs2019.

Authors are invited to submit a draft of a full paper with at most 12
pages (excluding the title page and the references section).
The title page consists exclusively of the title of the paper, author
information, and abstract.

The usage of pdflatex and the LIPIcs style file (see
http://www.dagstuhl.de/en/publications/lipics) are mandatory; no changes
to font size, page geometry, etc. are permitted.
Submissions not in the correct format or submitted after the deadline
will not be considered.

The paper should contain a succinct statement of the issues and of their
motivation, a summary of the main results, and a brief explanation of
their significance, accessible to non-specialist readers.

Proofs omitted due to space constraints must be put into an appendix, to
be read by the program committee members at their discretion.

Simultaneous submission to other conferences with published proceedings
or to journals is not allowed. PC members are excluded from submitting.

There will be a rebuttal period for authors between November 26—29, 2018.
Authors will receive the reviews of their submissions (via EasyChair)
and have three days to submit rebuttals (via EasyChair).
These rebuttals become part of the PC meeting, but entail no specific
responses.

PROCEEDINGS

Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work. With their submission,
authors consent to sign a license authorizing the program committee
chairs to organize the electronic publication of their paper, provided
the paper is accepted.

IMPORTANT DATES

* Deadline for submissions: October 1, 2018 (AoE)
* Rebuttal: November 26–29, 2018
* Author notification: December 20, 2018
* Final version: January 16, 2019
* STACS 2019: March 13–16, 2019

CONTACT INFORMATION

Web: https://stacs2019.akt.tu-berlin.de/
Email: stacs2019@akt.tu-berlin.de
**********************************************************
*
* 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 student position in Geometric Algorithms at TU Eindhoven

We offer a 4-year PhD student position on the topic "Algorithms for Uncertain Trajectories" in the Algorithms Group at the TU Eindhoven, under the supervision of dr. Kevin Buchin. The Algorithms Group (http://www.win.tue.nl/algo/), headed by prof. Mark de Berg, mainly focuses on algorithms and data structures for spatial data, robotics, and optimization problems related to networks.

The project:
Advances in tracking technology have resulted in an explosion of movement data. Existing algorithms to analyze movement data assume that measured trajectories are completely accurate, but this is unrealistic and limits the scope of the analysis.
The project "Algorithms for Uncertain Trajectories", funded by an NWO-TOP grant, attacks this challenge. The goal of the project is to develop efficient geometric algorithms for uncertain trajectories with provable guarantees on the quality of the output. Geometric problems on trajectories include similarity analysis, segmentation, clustering, and computing movement patterns.

Job requirements:
We are looking for candidates that meet the following requirements:
• an excellent background in computer science and/or mathematics, preferably with specialization in algorithms (demonstrated by a relevant Master's degree and project);
• good communication skills in English, both in speaking and in writing.
An ideal candidate also has:
• an affinity with geometric algorithms and/or stochastics;
• programming skills and the willingness to develop research prototypes.

Conditions of employment:
Appointment and salary
We offer:
• A full-time appointment for a period of four years, with an intermediate evaluation after nine months;
• A gross salary of Euros 2,266 per month in the first year increasing up to Euros 2,897 per month in the fourth year;
• Support for your personal development and career planning including courses, summer schools, conference visits, etc.;
• A research position in an enthusiastic and internationally renowned research group;
• A broad package of fringe benefits (e.g. excellent technical infrastructure, saving schemes, excellent sport facilities, and child daycare).
Information and application

More information:
• About the project, please contact dr. K.A. Buchin k.a.buchin@tue.nl
• About employment conditions, please contact drs. M.W. von Reth, email: pzwin@tue.nl.

Application:
The application should consist of the following parts:
• A motivation letter;
• A Curriculum Vitae;
• Copies of diplomas and a list of grades of your studies;
• Names and addresses of two referees;
• Proof of English language skills (if applicable).

The selection process will start in October 2018 and will continue until the position is filled. The position is available immediately. The starting date is somewhat flexible, however, an ideal candidate would be available no later than April 2019.
Please apply via
https://jobs.tue.nl/en/vacancy/phd-project-algorithms-for-uncertain-trajectories-353412.html

[DMANET] [CFP] DCOSS 2019 - 15th International Conference on Distributed Computing in Sensor Systems - deadline January 2019

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

=============================================================
The 15th Annual International Conference on
Distributed Computing in Sensor Systems (DCOSS 2019)

May 29-31, 2019
Santorini Island, Greece
www.dcoss.org
=============================================================

DCOSS 2019 is the 15th International Conference on Distributed Computing
in Sensor Systems to be hosted on Santorini Island in Greece, in May
29-31, 2019. In the last few years, we have witnessed a significant
growth in the use of distributed sensor systems in a number of
application areas, ranging from smart transport, energy and buildings,
to factory automation, smart healthcare and environmental monitoring. In
order for smart sensor systems to truly become useful and pervasive, we
need to address a number of research challenges, including the tight
integration of sensing and machine intelligence, reliable and efficient
networking, interoperability and scalability, the need for dependable
autonomy, interaction with humans, and important aspects of security,
privacy and trust. DCOSS focuses on distributed information processing
issues arising in networked sensor systems, covering aspects of high
level abstractions, models and languages, novel algorithms and
applications, system design approaches and architectures, as well as
tools for simulated and real deployments.

Potential authors are invited to submit original unpublished manuscripts
that demonstrate recent advances in both theoretical and experimental
research. Topics of interest include, but are not limited to, the following:

- Edge and fog computing: distributed computing models from sensor to cloud
- Energy harvesting models and optimisation
- Machine intelligence in distributed sensor systems and real time analytics
- Communication and networking primitives and protocols
- Autonomy: closing the loop between sensing and actuation
- Task allocation, reprogramming, and reconfiguration
- Robustness, resilience and dependability
- Security and privacy issues
- Approaches, tools, and experience of deployment and operation
- Performance analysis: complexity, correctness, scalability
- Mobile and human-centered sensing
- Interoperability, heterogeneity and scalability
- Crowd sensing and social sensing techniques, applications, and systems
- Complex systems comprising wearable, robotic and/or fixed sensor systems
- Novel and compelling applications

******** Main Organizers ********

- General Chair:
Sotiris Nikoletseas (University of Patras and CTI, Greece)

- Technical Program Committee Chairs:
Niki Trigoni (University of Oxford, UK)
Tarek Abdelzaher (University of Illinois at Urbana Champaign, USA)
Gian Pietro Picco (University of Trento, Italy)

- Steering Committee Chair:
Jose Rolim (University of Geneva, Switzerland)

******** Special Issue and Best Paper Awards ********

All accepted papers will be candidate to a "Best Paper Award" that will
be announced at the conference. Also, a best poster/demo award will be
announced.

Further, selected papers will be fast-tracked to a thematic special
issue of the Ad Hoc Networks Journal by Elsevier, on algorithms, systems
and applications for distributed sensing.

******** Collocated Events ********

DCOSS 2019 will collocate with several thematic Workshops and Special
Sessions on emerging topics and technologies.

The event will also feature a poster and demo session

********Important Dates********

Abstract Registration Deadline: January 11, 2019 (11:59 pm AoE)
Paper Submission Deadline: January 18, 2019 (11:59 pm AoE)
Acceptance Notification: March 1, 2019
Camera Ready Submission Deadline: March 15, 2019 (11:59pm AoE)
Early Registration Deadline: April 10, 2019 (11:59 pm AoE)
Conference Dates: May 29-31, 2019

********Submission Guidelines********
Coming soon at the DCOSS website www.dcoss.org
**********************************************************
*
* 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 Candidate Position in Algorithms

PhD Candidate Position in Algorithms
TU Munich

The Department of Computer Science, Technical University of Munich, has a
vacancy for a PhD candidate/researcher position in the area of efficient
algorithms. The position is hosted at the Chair for Algorithms and
Complexity,
headed by Prof. Susanne Albers (http://wwwalbers.in.tum.de/index.html.en).
The dissertation work will involve research in the fields of approximation
and online algorithms, algorithmic game theory or algorithm engineering.

The position is paid according to the German public salary scale TVL-13 and
provides a competitive salary with standard benefits. The initial
appointment
is for a period of two years and can be renewed for another two years.

The successful candidate should have a Master's degree in computer
science or
mathematics. Since the position involves teaching obligations, good
proficiency
in German is required. The application material should include (1) a
cover letter
describing the interest in the position, (2) a CV, and (3) a copy of
the Master's
thesis.

The material should be sent electronically to <albers@in.tum.de>.

Applications will be reviewed starting October 8, 2018.

Susanne Albers
Department of Computer Science
Technical University Munich
Boltzmannstr. 3
85748 Garching (near Munich), Germany
E-mail: albers@in.tum.de

Sunday, September 16, 2018

[DMANET] Final Call for Paper

9th International Conference on

Innovations in Bio-Inspired Computing and Applications

Toc H Institute of Science &Technology

Kochi, India

December 17-19, 2018

http://www.mirlabs.net/ibica18/

****************************************************
CALL FOR PAPERS FOR SPECIAL SESSION
*****************************************************

SS1: Knowledge Engineering in Ontologies and Semantic Web

Papers describing original research work and practical
experiences/experimental results are solicited on topics that tentatively
include, but are not limited to:

o Knowledge Acquisition and Sharing

o Machine Learning for Knowledge Extraction

o Machine Learning and Data Mining methods for the Semantic Web

o Ontology Engineering and Ontology Pattern

o Ontology Mapping, Merging, Modularity and Alignment

o Search, Query, Integration, and Analysis of the Ontology

o Natural Language Processing and Information Extraction

o Multilinguality in Information Retrieval

o Deep Learning for the Semantic Web

o Feature Extraction and Feature Selection for Ontology Mining

o Ontology Mining and Knowledge Discovery

o Supervised Machine Learning in OWL and DL

o Question Answering over Linked Data and Ontologies

o Ontology Management, Maintenance, and Reuse

o Ontology Evaluation and Schema Quality

o Visualizations and user interfaces for Ontology Engineering

o Integration and Interoperability of Domain Ontologies

Pdf version of this cfp: http://www.mirlabs.net/ibica18/cfss.php

Paper Publications

All accepted and registered papers will be published in AISC Series of
Springer, indexed in ISI Proceedings, EI-Compendex, DBLP, SCOPUS, Google
Scholar and Springerlink. (Listed in UGC approved list, please refer List
1- Page 32 - S.No. - 1375)

(http://www.ugc.ac.in/pdfnews/8919877_Journals-1.pdf)

Important Dates

Paper submission due: September 30, 2018
Notification of paper acceptance: October 21, 2018
Registration and Final manuscript due: November 10, 2018
Conference: December 17 - 19, 2018

Special Session Chairs

Sarika Jain, Assistant Professor, Department of Computer Applications,
National Institute of Technology, Kurukshetra, 136119, Haryana, India.

Millie Pant, Associate Professor, Department of Applied Science and
Engineering, IIT Roorkee, Uttarakhand, India.

Sanju Tiwari, Research Associate, Department of Computer Applications,
National Institute of Technology, Kurukshetra, 136119, Haryana, India.

Information Contact: Sanju Tiwari <tiwsanju17@gmail.com>

[DMANET] CFP: IEEE Access Journal Special Section on Wirelessly Powered Networks (deadline 30 September)

IEEE Access Journal - Impact Factor (2017): 3.557
Special Section on Wirelessly Powered Networks: Algorithms, Applications
and Technologies
Submission Deadline: 30 September 2018
Submit manuscript to: http://mc.manuscriptcentral.com/ieee-access

IEEE Access invites manuscript submissions in the area of Wirelessly
Powered Networks: Algorithms, Applications and Technologies.

Wireless Power Transfer (WPT) is, by definition, a process that occurs
in any system where electrical energy is transmitted from a power source
to a load without the connection of electrical conductors. WPT is the
driving technology that will enable the next stage in the current
consumer electronics revolution, including battery-less sensors, passive
RF identification (RFID), passive wireless sensors, the Internet of
Things and 5G, and machine-to-machine solutions. WPT-enabled devices can
be powered by harvesting energy from the surroundings, including
electromagnetic (EM) energy, leading to a new communication networks
paradigm, the Wirelessly Powered Networks.

While recent advances in wireless utensils appear to be unlimited, the
dependence of their operation on batteries remains a weakness, mainly
because batteries come with a limited lifetime and require a fast charge
time to achieve continuous operation. This is where the technologies of
WPT become useful, bringing together wireless energy and data
transmission. WPT technologies substitute the traditional powering
concept, where a cable or a battery is connected to the wireless device,
by the transmission of energy over the air in an efficient way to
power-up the device.

Wirelessly Powered Networks have recently evolved into a very active
research field, as well as a topic of rapid technological progress,
emerging practical developments and standardization activities. However,
a solid foundational, technological, and applied background is still
necessary for Wirelessly Powered Networks to achieve their full
potential. The provisioning of relevant technological models,
algorithmic design and analysis methods, networking principles, circuit
and system design, and application methodologies is a challenging task.
This Special Section in IEEE Access invites academic and industrial
experts to make their contributions on Wirelessly Powered Networks. It
will selectively span a coherent, large spectrum of fundamental aspects
of WPT, and will focus on three main thematic pillars and relevant
themes: Algorithms, Applications and Technologies.

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

Algorithms
- Optimization and approximation algorithms (mobility/energy/data
management)
- Joint operation scheduling (routing, data gathering, ambient
harvesting)
- Precise algorithmic models and efficient distributed protocols
- WPT devices deployment
- Safety provisioning through EM radiation control algorithms
- Peer-to-peer and crowd charging algorithms
- Algorithms for simultaneous wireless information and power transfer
(SWIPT)

Applications
- Medical implants and wearable devices
- Automotive technology and electric vehicles
- Mobile communications, wireless sensor networks and UAVs
- Spacecraft engineering
- Home/Industrial appliances
- Standardization, regulations and biological effects
- Solutions for SWIPT

Technologies
- RF energy harvesting, rectennas and rectenna arrays
- High-frequency rectifying circuits, power transmitters and devices
- Near-field (inductive, resonant) energy transfer
- Microwave transmission and beaming
- Novel materials, fabrication techniques
- Energy storage elements, RFID-related electronics and self-powered
sensors
- Measurement and characterization approaches for WPT components

We also highly recommend the submission of multimedia with each article
as it significantly increases the visibility, downloads, and citations
of articles.

Associate Editor:
- Theofanis P. Raptis, National Research Council, Italy

Guest Editors:
- Nuno Borges Carvalho, University of Aveiro, Portugal
- Diego Masotti, University of Bologna, Italy
- Lei Shu, Nanjing Agricultural University, China / University of
Lincoln, UK
- Cong Wang, Old Dominion University, USA
- Yuanyuan Yang, Stony Brook University, USA

Website:
http://ieeeaccess.ieee.org/special-sections/wirelessly-powered-networks-algorithms-applications-and-technologies/
For inquiries regarding this Special Section, please contact the
Associate Editor.
**********************************************************
*
* 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] CIAC 2019 - Second Call for Papers

CIAC 2019 - Second Call for Papers

11th International Conference on Algorithms and Complexity

May 27-29, 2019, Rome, Italy

http://easyconferences.eu/ciac2019/

The submission server is now open.

----------------------------------
Aims and Scope
----------------------------------

The International Conference on Algorithms and Complexity is intended to
provide a forum for researchers working in all aspects of computational
complexity and the use, design, analysis, and experimentation of efficient
algorithms and data structures.

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

- sequential, parallel and distributed algorithms and data structures
- approximation and randomized algorithms
- graph algorithms and graph drawing
- on-line and streaming algorithms
- analysis of algorithms and computational complexity
- algorithm engineering
- web algorithms
- exact and parameterized computation
- algorithmic game theory
- computational biology
- foundations of communication networks
- computational geometry
- discrete optimization

----------------------------------
Best Paper Award
----------------------------------

There will be a CIAC 2019 Best Paper Award, accompanied by a prize of EUR
1,000 offered by Springer.

----------------------------------
Proceedings
----------------------------------

The conference proceedings will be published by Springer-Verlag in the
Lecture Notes in Computer Science (LNCS) series.

Submission of previously published work, or simultaneous submission to
another conference with published proceedings or to a journal is not
allowed.

----------------------------------
Important Dates
----------------------------------

Paper submission: October 31, 2018, 23:59 AoΕ
Notification of acceptance: December 21, 2018
Camera ready: January 31, 2019
Conference: May 27-29, 2019.

----------------------------------
Program Committee
----------------------------------

- Faisal Abu-Khzam, Lebanese American University, Lebanon
- Isolde Adler, University of Leeds, UK
- Cristina Bazgan, Université Paris Dauphine, France
- Vincenzo Bonifaci, Institute for Systems Analysis and Computer Science,
Rome, Italy
- Tiziana Calamoneri, University of Rome Sapienza, Italy
- Pierluigi Crescenzi, University of Florence, Italy
- Konrad Dabrowski, Durham University, UK
- Lene Favrholdt, University of Southern Denmark
- Henning Fernau, Universtity of Trier, Germany
- Paolo Franciosa, University of Rome Sapienza, Italy
- Pinar Heggernes (chair), University of Bergen, Norway
- Danny Hermelin, Ben-Gurion University, Israel
- Cecilia Holmgren, Uppsala University, Sweden
- Giuseppe Italiano, University of Rome Tor Vergata, Italy
- Mamadou Kanté, Université Clermont Auvergne, France
- Jesper Nederlof, Eindhoven University of Technology, The Netherlands
- Naomi Nishimura, University of Waterloo, Canada
- Nicolas Nisse, INRIA Sophia Antipolis, France
- Yota Otachi, Kumamoto University, Japan
- Sang-il Oum, KAIST, South Korea
- Charis Papadopoulos, University of Ioannina, Greece
- Marie-France Sagot, INRIA Grenoble Rhone-Alpes, France
- Saket Saurabh, University of Bergen, Norway
- Kavitha Telikepalli, Tata Institute of Fundamental Research, India
- Erik Jan van Leeuwen, Utrecht University, The Netherlands

----------------------------------
Invited Speakers
----------------------------------

- Edith Elkind, University of Oxford
- Peter Rossmanith, Aachen University
- Luca Trevisan, U.C. Berkeley

----------------------------------
Steering Committee
----------------------------------

- Giorgio Ausiello, Universita di Roma I, "La Sapienza", Italy
- Vangelis Paschos, University Paris-Dauphine, France
- Rossella Petreschi, Universita di Roma I, "La Sapienza", Italy
- Paul Spirakis, University of Liverpool, UK and CTI, Greece
- Peter Widmayer, ETH Zurich, Switzerland

----------------------------------
Local Organizers
----------------------------------

- Tiziana Calamoneri, Sapienza University of Rome
- Irene Finocchi, Sapienza University of Rome

Friday, September 14, 2018

[DMANET] CFP - ComNet-IoT 2019

[Our apologies if you receive multiple copies of this CFP ]

=== CALL FOR PAPERS - ComNet-IoT 2019 ===

The 8th International Workshop on Computing and Networking for IoT and
Beyond (ComNet-IoT 2019)

In conjunction with The 20th International Conference on Distributed
Computing & Networking (ICDCN 2019)

Indian Institute of Science (IISc), Bangalore, India, January 4, 2019

https://sites.google.com/view/comnet-iot2019/

Internet of Things (IoT) is a paradigm that enables various machines,
physical devices, and objects, denoted as things, to interact
ubiquitously and autonomously such that our surroundings can be
monitored and controlled towards the betterment of human life. A
surrounding can be a home, office, shop, factory floor, even roads.
Thus, the betterment of human life can have different facades in
different situations. The concept has now further been extended to
Industry 4.0 and Tactile Internet, which are acting as catalysts to the
evolution of a new generation of services expected to have an immense
impact on the social and technological eco-system. It can be envisaged
that these next-generation systems and services will encompass several
domains such as e-Governance, Manufacturing, Retail, Health Care,
Transportation, Waste Management, Food Supply Chains, Energy &
Utilities, Insurance, etc. New technologies and applications built on
top of them must be developed in order to fulfill this vision of
Intelligent Infrastructure and Industry 4.0. The evolving Internet
concept poses a number of new challenges and opportunities for
computing, networking, data management and analytics due to the large
scale and complexity of such systems, and heterogeneity of the things
and networks, constrained by limited resources of the things and the
network and the requirement of extreme low latency in both computation
and communication.

Topics of interests include but are not limited to the following issues
related to IoT:

- System and network architectures, e.g., service oriented architecture
(SOA)
- Middleware for heterogeneous sensors, devices and protocols
- Quality of service (QoS) provisioning
- Sensing and sensor signal processing
- Localization and tracking
- RFID and RFID based track and trace
- Wireless networking protocols, e.g., RFID collision avoidance, MAC,
routing, etc.
- Energy harvesting and energy management
- Data management and analytics: data-stream, sharing, mining, semantic
interoperability, etc.
- Deep learning over sensor data to create intelligent systems
- Storage, management and analysis of data in Intelligent Infrastructures
- Business Intelligence from sensor data
- Back-end (cloud and fog/edge based) infrastructure
- Security issues: Data confidentiality, integrity, network resilience, etc.
- Participatory sensing, human behaviour modelling and Mobile Cloud
Computing for IoT/Industry 4.0
- Novel application developments and case studies, e.g., smart grid,
green building, healthcare, intelligent transportation/city, analytics
driven decision support systems, smart warehouse/retail infrastructures etc.
- Evolving technologies for Industry 4.0, tactile internet including new
computation paradigms and communication technologies
- Test-beds and field trials

=== Important Dates ===

Paper Submission Deadline: Sep 30, 2018

Notification of Acceptance: Oct 30, 2018

Camera-ready Due: Nov 15, 2018

Workshop Day: Jan 4, 2019

=== Workshop Co-Organizers ===

Himadri Sekhar Paul, TCS Research & Innovation
Carlo Vallati, University of Pisa
Chayan Sarkar, TCS Research & Innovation

=== Steering Committee Chair ===

Sajal K. Das, Missouri University of Science & Technology

=== Submission Instructions ===

Papers should be at most 6 pages, including title, abstract, figures and
references, and not published or under review elsewhere. Papers should
be prepared as per ACM conference proceedings format. Please submit your
papers through EasyChair
(https://easychair.org/conferences/?conf=comnetiot2019).

All accepted workshop full papers will be included in the ACM Digital
Library.

At least one author of each accepted paper must register for the
conference and present the paper. In addition, no-shows of accepted
papers at the workshop will result in those papers NOT being included in
the proceedings.

[DMANET] Postdoc position in Algorithms and Complexity at Oxford

A postdoc position is available in the Department of Computer Science at the University of Oxford as part of the ERC Starting Grant Power of Algorithms in Discrete Optimisation (PowAlgDO) led by Standa Zivny. The project focuses on establishing the power of convex relaxations (such as linear and semidefinite programming) for various classes of constraint satisfaction problems (CSPs) with respect to exact and approximate solvability. Strong candidates with any background will be considered but the ideal background is approximation algorithms, combinatorics, convex relaxations, or CSPs.

The position is available from 1 December 2018 (although a different start date can be negotiated) and will be for 2 years (with the possibility of extension until December 2021). The position comes with a travel support and no teaching duties. The postholder will be a member of Oxford's Algorithms and Complexity Theory Group. Salary £40,792 - £48,677 p.a.

The deadline is noon 31 October UK time.

More details can be found at http://www.cs.ox.ac.uk/news/1565-full.html
**********************************************************
*
* 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, September 13, 2018

[DMANET] Special Issue SCOPUS Indexed Journal : International Journal of Web-Based Learning and Teaching Technologies (IJWLTT) On: Trends on Semantics Web Analytics

Special Issue On: Trends on Semantics Web Analytics
Submission Due Date
11/25/2018

Guest Editors
Sanju Tiwari, NIT Kurukshetra, India
Rafid Sagban, University of Babylon, Iraq
Niketa Gandhi, MIR Labs, USA

Introduction
Semantic Analytics is considered to be the best technique for analyzing the
content of resources on the Web and finding its relatedness in such
heterogeneous and dynamic systems. It combines text analytics with semantic
web technologies such as RDF and Ontologies. This Special Issue will
highlight the new techniques discovered in exploiting the relatedness among
content in such information systems to support variety of applications such
as aviation safety, provenance and trust of data sources, and the
document-access problem of Insider Threat.

Objective
The aim of this Special Issue is to present latest advances in knowledge
representation, linguistics, information systems, artificial intelligence
and database management and bring theme together. It is expected, thus, our
proposed title will get good attention from such interested communities,
foster wider adoption of Semantic Web technologies, lead to higher quality
results in different applications employing ontologies and proliferate the
consumption of semantic web data.

Recommended Topics
Topics to be discussed in this special issue include (but are not limited
to) the following:
Web Services Composition and Uncertainty
Reasoning-based knowledge extraction Methods
Word embedding in NLP and Deep Learning
Semantic Deep Learning
Ontologies as Training Sets
Ontology learning, i.e. extraction, generation, or acquisition
Text mining using NLP
Personalization in Semantic Web
Semantic data linking, extraction and integration
Bridging structured and unstructured data
Knowledge representation, ranking, generation, and validation
Knowledge representation, querying, and reasoning

Submission Procedure
Researchers and practitioners are invited to submit papers for this special
theme issue on Recent Trends on Semantics Web Analytics on or before 25 Nov
2018. All submissions must be original and may not be under review by
another publication. INTERESTED AUTHORS SHOULD CONSULT THE JOURNAL'S
GUIDELINES FOR MANUSCRIPT SUBMISSIONS at
https://www.igi-global.com/publish/contributor-resources/before-you-write
<http://www.igi-global.com/publish/contributor-resources/before-you-write/>.
All submitted papers will be reviewed on a double-blind, peer review basis.
Papers must follow APA style for reference citations.

All submissions and inquiries should be directed to the attention of:
Sanju Tiwari, Rafid Sagban, Niketa Gandhi
Guest Editors
International Journal of Web-Based Learning and Teaching Technology
Email: sanju.tiwari.2007@gmail.com, rsagban@uobabylon.edu.iq, niketa@g
<niketa@gmail.com>andhi

--
Sanju Mishra Tiwari
Research Associate
Department of Computer Applications
National Institute of Technology
Kurukshetra

[DMANET] 2nd Call for Participation: WENDY - Workshop on Emergent Algorithms and Network Dynamics (Paris, October 10-11)

2nd Call for Participation

Workshop on Emergent Algorithms
and Network Dynamics

https://wendy.paris

Institut Henri-Poincaré, Paris, France
October 10-11, 2018

** Preliminary program available online **

The goal of WENDY is to promote the exchange of ideas between researchers working on distributed computing theory, modeling random structures, and discrete dynamical systems. Central topics include:

Evolving graph models and dynamics on random graphs
Bio-inspired computing and computing with biological agents
Chemical reaction networks
Markovian and non-Markovian processes on networks.

Invited speakers:

Dana Randall (Georgia Tech)
Vincenzo Bonifaci (Rome, IASI-CNR)
Alfonso Jaramillo (Warwick, Jaramillo Lab)
Thomas Sauerwald (Cambridge)
Colin Cooper (London, King's College)
Amaury Pouly (Saarbrucken, MPII)
Benjamin Doerr (Paris Saclay, LIX - Ecole Polytechnique)
Nicolas Behr (Paris, IRIF - CNRS, Paris Diderot)
Vincent Cohen-Addad (Paris, LIP6 - CNRS, Sorbonne)
Amos Korman (Paris, IRIF - CNRS, Paris Diderot)
Florent Krzakala (Paris, LPS - ENS)
Laurent Massoulie (Paris, Microsoft Research - Inria)
Nastassia Pouradier Duteil (Paris, LJLL - Inria, CNRS, UPMC)
Guilhem Semerjian (Paris, LPT - ENS)
Damien Woods (Paris, Inria)

The workshop will be held in Paris in October, during a period rich in events which may be of interest to the broader algorithms community: the FOCS conference with its accompanying workshops, FILOFOCS workshop, French algorithms days GT CoA,...

Registration:

is free but mandatory. Please fill the form provided on the workshop website.

Organizers:

Matthias Függer, LSV
Adrian Kosowski, IRIF and Inria Paris (chair)
Thomas Nowak, LRI
Justin Salez, LPSM

Supported by: Inria, RFSI, ANR, Labex DigiCosme Paris-Saclay, IRIF - CNRS and Paris Diderot University.

For any questions, please write to <contact@wendy.paris> or <adrian.kosowski@inria.fr>.

Wednesday, September 12, 2018

[DMANET] Data Scientist position in Nottingham, UK

Data Scientist position in Nottingham, UK
-------------------------------------------------------------

Microlise, a leading Transport Management solutions provider with HQ in
Nottingham is looking to appoint a "Data Scientist" as part of on-going
expansion of Data Science and Research team.

The successful applicant will be responsible for:

- Applying computational intelligence, machine learning, deep learning,
optimisation and big data analytics techniques
- Performing exploratory, analytical, visualisation and experimental works
- Complete the analysis, design and build of data models, propensity
models, analytical models and business and personal insights
- Preparing technical and scientific reports, presentations and patent
applications
- Framing business problems into questions that can be answered through
data analysis, and translating business needs into requirements that can be
understood by technical teams.

You can find more details and apply online at:
https://www.microlise.com/careers/job/78474/

The application deadline is October 14th, 2018. Telephone interviews will
take place while the advert is still live, face to face interviews will
take place in the 2nd half of October.

This role is eligible for a Certificate of Sponsorship for a UK Visa and
meets the resident labour market test.

Informal enquiries are welcome and may be sent to
mohammad.mesgarpour@microlise.com

Dr Mohammad Mesgarpour
Head of Data Science and Research, Microlise

[DMANET] CFP - Journal of Business Research - Special Issue on "Complexity: challenges and opportunities"

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

Call for Papers

*******************************************************************************
Journal of Business Research
Special Issue on "Complexity: challenges and opportunities"
https://www.journals.elsevier.com/journal-of-business-research/call-for-papers/special-issue-on-complexity-challenges-and-opportunities <https://www.journals.elsevier.com/journal-of-business-research/call-for-papers/special-issue-on-complexity-challenges-and-opportunities>

Guest Co-Editors:

Dr. Giovanna Ferraro, University of Rome Tor Vergata, Italy(giovanna.ferraro@uniroma2.it <mailto:giovanna.ferraro@uniroma2.it>)
Dr. Antonio Iovanella, University of Rome Tor Vergata, Italy (antonio.iovanella@uniroma2.it <mailto:antonio.iovanella@uniroma2.it>)
Dr. Andreas Pyka, University of Hohenheim, Stuttgart, Germany (a.pyka@uni-hohenheim.de <mailto:a.pyka@uni-hohenheim.de>)

During the last two decades, there has been a growing awareness to complexity in business, which fostered the domains of applications and the creative diffusion of knowledge of complexity tools. Complexity studies the consequences of interactions and in particular, it analyses patterns, structures and phenomena that emerge from the interactions (Kirman, 2011).

Complexity is related with both, developments in the external environment where agents operate e.g. markets, countries, the customers base, and internal aspects such as products, processes and the organisational structure. In the literature (Jacobs, 2013; Braun & Hadwich, 2016), four sources of complexity are distinguished:

• Diversity: organizations face a heterogeneity and a variety of the elements across every aspect of the business itself;
• Interdependence: everything is related to everything else to an unprecedented degree of connectivity and interconnectedness;
• Ambiguity: plenty of much information is available, but it is less clear how to interpret, select or acquire it;
• Dynamicity: organizations have to react to fast flux and variability of the environment.

The consequences of a complex environment are several managerial dilemmas relevant for the processes of decision-making (De Toni and De Zan, 2016). Dealing with complexity forces organisations to determine priorities and core activities, and to establish patterns of behaviour over time. Thus, managers need to detect the instabilities and the thresholds triggering contingency strategies.

Facing complex environments requires a complete different mindset: In a complex business world, hierarchy needs to be complemented by heterarchy; thus interdependent and interconnected organisations are required, in which every part reflects a different perspective of the whole (Vasconcellos and Ramirez, 2011).

Organizations need to understand that complexity is not harmful. Instead it should be considered a manageable challenge offering opportunities to generate additional sources of profit and competitive advantages.

Relationship arrangements between organizations' members are well described by means of networks, which are a valuable representation of many real systems and play an important role in their understanding (Borgatti and Halgin, 2011; Wang and Chang, 2003). Networks are flexibly defined as a set of nodes and links, representing agents and interactions, which request an interdisciplinary approach and enables the integration between theories in different research fields, ranging from social and managerial to technological and infrastructural aspects as well as to communication systems.

Networks ubiquity leads to a set of common and most relevant research problems on the role of structures and their impact on network dynamics (Carpenter et al., 2012; Slotte-Kock and Coviello, 2010; Vermeulen and Pyka, 2017; Wang and Chen, 2003). Thus, the analysis of networks' characteristics meanwhile is considered to be a powerful instrument to gain new insights of network performance.

This proposal for a Special Issue addresses research that uses empirical and case study approaches as well as computer simulations to present theories, techniques and practical experiences. All contributions should clearly address the practical and theoretical implications of the research reported, thus articles that have a direct connection to real world problems and lead to more extensive use of complexity concepts are asked for.

Topics of interest include, but are not limited to:

• Community structure and collaboration in complex environments
• Social Network Analysis
• Resilience and robustness
• Assortativity and homophily in social networks
• Management and complexity
• Multilayer networks
• Social Reputation, Influence, and Trust
• Information Spreading, rumours and viral marketing
• Agent based modelling

Submission guidelines and deadlines

When preparing your submission, please check the JBR website for guidelines on style and paper length: http://www.elsevier.com/journals/journal-of-business-research/0148-2963/guide-for-authors <http://www.elsevier.com/journals/journal-of-business-research/0148-2963/guide-for-authors>.

Manuscript submission for the review process will be done in the Elsevier Editorial system at the following website:
http://www.journals.elsevier.com/journal-of-business-research/ <http://www.journals.elsevier.com/journal-of-business-research/>

Submission deadline: 15 February 2019
First revisions due: 1 July 2019
Final revisions due: 1 October 2019
Expected publication date: end of 2019

Inquiries should be sent by email to the coordinating JBR Guest Co-Editor Dr. Antonio Iovanella (antonio.iovanella@uniroma2.it <mailto:antonio.iovanella@uniroma2.it>).

REFERENCES

Borgatti, S. P. and Halgin, D. S. (2011). On network Theory. Organization Science, 22(5), 1168-1181.
Braun, C., and Hadwich, K. (2016). Complexity of internal services: Scale development and validation. Journal of Business Research, 69(9): 3508-3522.
Carpenter, M. A., Li, M., Jiang, H. (2012). Social Network Research in Organizational Context: A Systematic Review of Methodological Issue and Choices. Journal of Management, 38(4), 1328-1361.
De Toni, A. F. and De Zan, G. (2016). The complexity dilemma: Three tips for dealing with complexity in organisations. Emergence: Complexity and Organization, 18(3-4).
Jacobs, M. A. (2013). Complexity: Toward an empirical measure. Technovation, 33(4): 111-118.
Kirman, A. (2011). Complex Economics, Individual and collective rationality, The Graz Schumpeter Lectures.
Slotte-Kock, S. and Coviello, N. (2010). Entrepreneurship research on network processes: a review and ways forward. Entrepreneurship Theory and Practice, 34(1), 31–57.
Vasconcellos, F. C. and Ramirez, R. (2011). Complexity in business environment. Journal of Business Research, 64, 236-241.
Vermeulen, B. and Pyka, A. (2017), The role of network topology and the spatial distribution and structure of knowledge in regional innovation policy. A calibrated agent-based model study, Computational Economics, Vol. 51, 1-36.
Wang, X.F., and Chen, G. (2003). Complex networks: small-world, scale-free and beyond. IEEE Circuit and System Magazine, 3(1), 6-20.

Antonio Iovanella
Dipartimento di Ingegneria dell'Impresa,
Università degli Studi di Roma Tor Vergata
Via del Politecnico, 1
00133 - Roma - Italy

Tel: +39 6 72597788

Email: antonio.iovanella@uniroma2.it
Web: http://www.linkedin.com/in/aiovanella

**************************************************************
**************************************************************
This communication contains information which is confidential and may
also be privileged. It is for the exclusive use of the intended recipients.
If you are not the intended recipient, please note that any distribution,
copying or use of this communication or the information in it is strictly
prohibited. If you have received this communication in error, please notify
the sender immediately and then destroy any copies of it. Moreover, it is no
possible to guarantee that the e-mail or any attachments are free from
viruses.
**************************************************************

[DMANET] ITC 2019: International Timetabling Competition

*** ITC 2019: International Timetabling Competition ***

* https://www.itc2019.org *

NEW UNIVERSITY COURSE TIMETABLING COMPETITION

- Assignment of times and rooms to events
- Student sectioning based on course demands
- Optimization by minimizing penalties of
-- time and room assignments,
-- violated soft constraints,
-- student conflicts
- Course structure for student sectioning
- Rooms with travel times and unavailabilities
- Events not meeting every week

RICH REAL-WORLD DATA INSTANCES

- Diverse characteristics
- 11 institutions from six continents
- Early, middle and late instances, around 8-10 instances each
- 6 test instances including large Purdue sets already available
- Data collected from the UniTime educational scheduling system

NO TIME OR TECHNOLOGY LIMITATIONS

- Commercial solvers allowed
- Looking for the best solutions
- Solution validator as a web service

MID-COMPETITION STANDINGS

- Two milestones during the competition
- Quality of the best solutions published
- 300, 200, 100 EUR for the top three solvers

WINNERS

- Five finalists, prices for the first three
-- 1000, 500, 250 EUR
-- Free PATAT 2020 registrations
- Awards supported by
-- PATAT conference
-- EWG PATAT
- Points awarded for each instance
-- More points for later instances
- Additional prizes also provided during the run of the competition

PATAT 2020 CONFERENCE

- A special track about the competition
- Winners announced
- Journal special issue

IMPORTANT DATES

November 15, 2018: Early data instances are published
February 1, 2019: 1st milestone submission
June 1, 2019: 2nd milestone submission
September 18, 2019: Middle instances published
November 8, 2019: Late instances published
November 18, 2019: Final submission
January 15, 2020: Finalists published
February-March, 2020: PATAT 2020 submissions
August, 2020: Winners announced at PATAT 2020
Autumn, 2020: Journal special issue

AFTER THE COMPETITION

- The ITC 2019 website remains available
- Tracking the best-known solutions and related papers

Tuesday, September 11, 2018

[DMANET] Postdoctoral Position in Discrete Mathematics and Algorithms - Masaryk University, Brno

Dear colleagues,

Several postdoctoral positions to work under my supervision are
available at the Faculty of Informatics, Masaryk University, in Brno,
Czech Republic. The positions are funded by the ERC grant LADIST and
additional university funding. All candidates working in discrete
mathematics and discrete algorithms are welcome to apply.

The preferred starting date is between January and September 2019,
however, both length and exact starting date of each position can be
negotiated. The annual salary starts at approx. 25,000 EUR and
additional funds for travel and other research expenses are available
for each of the positions.

Deadline for applications: October 31, 2018

Further details: https://www.muni.cz/en/about-us/careers/vacancies/42189

Sincerely,

Dan Kral

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

[DMANET] Call for papers: MatBio 2018 Special Issue

MatBio 2018 Special Issue – Call for papers

We warmly invite contributions to a special issue of the Journal of Discrete Algorithms for MatBio 2018.

This special issue of the Journal of Discrete Algorithms (https://www.journals.elsevier.com/journal-of-discrete-algorithms) will be devoted to the topics included in the Mathematical Foundations in Bioinformatics Conference held 02 August 2018 at King's College London. Submissions presenting original research within these areas are invited. This issue will also contain full versions of selected presentations from MatBio 2018: https://nms.kcl.ac.uk/informatics/events/MatBio2018/index.html

Topics of interest include but are not limited to:

Sequence Analysis
Genomic Variation and Disease
Haplotypes and Population Genomics
Protein and RNA Analysis, Structure, and Dynamics
Metagenomics
Cancer Genomics
Systems Biology
Phylogenetics
Biological Networks and Integrative Analysis
Computational Drug Discovery
Biological Modelling
Text Mining and Classification
Advancing Algorithms and Methods
Big Data in Bioinformatics

——————————————————————————————————————————————————————————

** Papers which are pure theory, or theory supported by experimentation, or applied research are all encouraged.

** Papers must contain previously unpublished material; however, full versions of conference manuscripts may be submitted subject to citing the conference paper.

** Survey papers which are relevant to the topics of the special issue are welcome and will be considered at the discretion of the editors.

** Submissions by non-participants will be considered subject to relevance.

** Submissions should be typically 10-20 pages (shorter or longer papers will be considered at the discretion of the editors).

** All submitted papers will be reviewed according to the usual Journal of Discrete Algorithms reviewing standards, with a minimum of two reviews but usually three.

** Instructions to submit the manuscript can be found at: http://www.cas.mcmaster.ca/~pophlin/matbio2018/index.html

The preliminary schedule is:

Deadline for submission: 30th September 2018
Notification to authors: 30th October 2018

We look forward to receiving your submissions!

Best regards from the guest editors,

Neerja Mhaskar, W. F. Smyth, Steven Watts
King's College London and McMaster University

[DMANET] SoCG 2019: Call for Papers

35th SoCG - Portland, Oregon - June 18-21, 2019

******* SoCG 2019, Call for Papers*************

The35th International Symposium on Computational Geometry (SoCG 2019) will be held in Portland, Oregon, June 18-21, 2019, as part of the Computational Geometry (CG) Week. We invite submissions of high quality that describe original research on computational problems in a geometric setting. Topics of interest include, but are not limited to:
• Design, analysis, and implementation of geometric algorithms and data structures;
• Lower bounds on the computational complexity of geometric problems;
• Mathematical, numerical, and algebraic issues arising in the formulation, analysis, implementation, and experimental evaluation of geometric algorithms and heuristics;
• Discrete and combinatorial geometry;
• Computational topology, topological data analysis, and topological combinatorics;
• Applications of computational geometry in any field.

To ensure that a submission is evaluated on its own merits, authors will need to identify the main strengths of their submission, as captured by four possible paper types. Please consult the last section of this CFP (or the conference web-page) for a detailed description of the paper types and associated evaluation criteria. There are no quotas for the paper types and submissions can be labeled with more than one paper type at the
time of submission.

*Conference Web Page*

http://eecs.oregonstate.edu/socg19

*EasyChair Link*

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

*Important Dates*

• November 28, 2018 (Wednesday): Abstracts due (23:59 PST)
• December 5, 2018 (Wednesday): Papers due (23:59 PST)
• February 15, 2019 (Friday): Notification of acceptance/rejection
• March 15, 2019 (Friday): Final versions of accepted papers due
• June 18-21, 2019 (Tuesday-Friday): Symposium

*Submission Guidelines*

Submissions must be formatted in accordance with the LIPIcs proceedings guidelines and not exceed 500 lines, excluding front matter, references, and a clearly marked appendix (further described below). To ensure an
accurate line counting, authors must use the LaTeX class file socg-lipics-v2018, which is a wrapper around the standard class. The class file, as well a document describing the motivation and technicalities behind this class, are available from the SoCG webpage (http://computational-geometry.org). Authors should refrain from putting excessive amounts of texts in parts in which lines are not counted automatically. If authors need constructs that contain large amounts of uncounted text, they should compensate for this by reducing the final count accordingly.

Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, each author's name and affiliation, as well as a short abstract. This should be followed by the main body of the paper that begins with a precise statement of the problem considered, a succinct summary of the results obtained (emphasizing the significance, novelty, and potential impact of the research), and a clear comparison with related work. The remainder of the extended abstract should provide sufficient details to allow the program committee to evaluate the validity, quality, and relevance of the contribution. Clarity of presentation is very important; the entire extended abstract should be written carefully, taking into consideration that it will be read and evaluated by both experts and non-experts, often under tight time constraints. All details needed to verify the results must be provided.

Supporting materials, including proofs of theoretical claims and experimental details, that do not fit in the 500-line limit should be given in an appendix. If more appropriate, the full version may be given as the appendix. In both cases, however, the authors should include in the main part specific pointers to the relevant locations in the appendix. The appendix will be read by the program committee members at their discretion and will not be published as part of the proceedings. Thus, the paper without the appendix should be able to stand on its own.
Experimental and implementation results (independent of paper type) must be reproducible and verifiable. Authors of all types of papers are encouraged to put accompanying software and relevant data, if there are any, in a repository accessible to the reviewers. Authors are asked to indicate which of the supporting material will remain publicly available if their papers are accepted.

Submissions deviating from the above guidelines risk being rejected without further consideration.

Results previously published or accepted for publication in the proceedings of another conference cannot be submitted. Simultaneous submissions of the results to another conference with published proceedings are not allowed. Exempted are workshops and conferences without formal proceedings, but possibly with handouts containing short abstracts. Results that have already been accepted (with or without revision) for publication in a journal at the time of their submission to the symposium are not allowed. A paper submitted to a journal but not yet
accepted for publication can be submitted to the symposium. In such cases, the authors must mention this on the front page of the submission and clearly identify the status of the journal submission as of November
28, 2018.

*Format of Accepted Papers*

Final proceedings versions of accepted papers must be formatted in accordance with the LIPIcs proceedings guidelines and not exceed 500 lines, excluding a title page and references. These final versions must be submitted by March 15, 2019. If any supporting material (including complete proofs of theoretical claims and experimental details) does not fit in the specified limit, then the full version of the paper containing this information must be referenced in the conference version and made available at a public repository, such as arXiv, by March 15, 2018. Where applicable, we encourage authors to make accompanying software and/or data publicly accessible, with proper references in the paper.

An author of each accepted paper will be expected to attend the symposium and present the paper (approximately 20 minutes). An award will be given to the best paper, and if it is of interest to a broad audience, its authors will be invited to submit an extended version of it to the Journal of the ACM. Authors of a selection of papers from the symposium will be invited to submit extended versions of their papers to special issues of Discrete & Computational Geometry and Journal of Computational Geometry.

*Program Committee*

Hee-Kap Ahn, Pohang Univ. of Science and Technology, South Korea
Alexandr Andoni, Columbia University, USA
Sunil Arya, Hong Kong Univ. of Science and Technology, China
Gill Barequet (co-chair), Technion—Israel Inst. of Technology, Israel
Mark de Berg, TU Eindhoven, Netherlands
Prosenjit Bose, Carleton University, Canada
Frédéric Cazals, INRIA Sophia Antipolis-Méditerrané, France
Tamal K. Dey, The Ohio State University, USA
Kyle Fox, Univ. of Texas at Dallas, USA
Joachim Gudmundsson, Univ. of Sydney, Australia
Chaya Keller, Ben Gurion University, Israel
Stephen Kobourov, Univ. of Arizona, USA
Francis Lazarus, CNRS Grenoble, France
Clément Maria, INRIA Sophia Antipolis-Méditerrané, France
Tillmann Miltzow, Utrecht University, Netherlands
Zuzana Patáková, Inst. of Science and Technology, Austria
Amit Patel, Colorado State University, USA
Raimund Seidel, Saarland University, Germany
Christian Sohler, TU Dortmund, Germany, and Google, Switzerland
Noam Solomon, Harvard University, USA
Subhash Suri, Univ. of California at Santa Barbara, USA
Kasturi Varadarajan, Univ. of Iowa, USA
Birgit Vogtenhuber, Graz Univ. of Technology, Austria
Bei Wang, University of Utah, USA
Yusu Wang (co-chair), The Ohio State University, USA

*Paper types*

When writing or evaluating a SoCG paper, it is important to keep in mind that there are different types of contributions, each with their own strengths. Results of all kinds (theoretical and practical) need to be reproducible and verifiable. To ensure that each submission is evaluated on its own merits, authors need to identify the main strengths of their submissions, as captured by four possible paper types. These paper types
are described in detail below, together with their associated evaluation criteria. These criteria will serve as the basis for all reviews, both by PC members and by external subreviewers, and for the subsequent discussion in the PC. There are no quotas for the paper types and submissions can be labeled with more than one paper type at the time of submission.
/__//_Mathematical Foundations_/

A typical paper will contain theorems and proofs describing new results in discrete or combinatorial geometry, or in topological combinatorics. The paper will primarily be evaluated on its technical depth, the importance of the results, the elegance of the solution, the connection of the problem studied to computational geometry and topology, and the potential future impact on algorithm development.

/Algorithmic Complexity/

A typical paper will contain algorithms, data structures, theorems, proofs, or lower bound constructions describing new results on computational geometry problems. The paper will primarily be evaluated on the (mathematical or computational) relevance and importance of the problem studied, its technical depth, the elegance of the solution, and the potential future impact of the results or the proposed new methods and techniques.

/Experimental & Implementation/

A typical paper will make a clear contribution to the implementation and evaluation of geometric algorithms, such as exact, approximate, or algebraic computation, algorithms engineering, or the experimental evaluation of competing algorithmic approaches. The paper will primarily be evaluated on the completeness and the expected impact of the proposed implementation, the soundness of the experiments, the quality and quantity of testing, and on the general amount of knowledge gained.

/Applications/

A typical paper will describe the modeling and algorithmic choices made when developing or adapting computational geometry techniques for an application area. The paper will be primarily evaluated on the soundness of the modeling decisions, the ingenuity of the solution, the effectiveness of the proposed method, and the expected impact in the application area. One might also consider the lesson learned regarding the applicability or suitability of computational geometry tools to the specific area.

[DMANET] New Book: Foundations of Probabilistic Logic Programming

I am pleased to announce my book:
Foundations of Probabilistic Logic Programming
Languages, Semantics, Inference and Learning
Author: Fabrizio Riguzzi, University of Ferrara, Italy
Publisher: River Publishers
Series: River Publishers Series in Software Engineering
ISBN: 9788770220187
e-ISBN: 9788770220170
http://mcs.unife.it/~friguzzi/plp-book.html

Sample content:
Table of contents http://mcs.unife.it/~friguzzi/table-of-contents.pdf
Preface http://mcs.unife.it/~friguzzi/preface.pdf
Chapter 2 http://mcs.unife.it/~friguzzi/chapter2.pdf

Get it from:
the publisher: http://www.riverpublishers.com/book_details.php?book_id=660
Amazon: http://amzn.eu/d/0094M57

Abstract
Probabilistic Logic Programming extends Logic Programming by enabling the representation of uncertain information. Probabilistic Logic Programming is at the intersection of two wider research fields: the integration of logic and probability and Probabilistic Programming.

Logic enables the representation of complex relations among entities while probability theory is useful for model uncertainty over attributes and relations. Combining the two is a very active field of study. Probabilistic Programming extends programming languages with probabilistic primitives that can be used to write complex probabilistic models. Algorithms for the inference and learning tasks are then provided automatically by the system.

Probabilistic Logic programming is at the same time a logic language, with its knowledge representation capabilities, and a Turing complete language, with its computation capabilities, thus providing the best of both worlds.

Since its birth, the field of Probabilistic Logic Programming has seen a steady increase of activity, with many proposals for languages and algorithms for inference and learning. Foundations of Probabilistic Logic Programming aims at providing an overview of the field with a special emphasis on languages under the Distribution Semantics, one of the most influential approaches. The book presents the main ideas for semantics, inference, and learning and highlights connections between the methods.

Many examples of the book include a link to a page of the web application http://cplint.eu where the code can be run online.

Keywords: Probabilistic logic programming, statistical relational learning, statistical relational artificial intelligence, distribution semantics, graphical models, artificial intelligence, machine learning

Monday, September 10, 2018

[DMANET] Special Issue "Modeling Computing and Data Handling for Marine Transportation" - Algorithms, MDPI - Open Access Journal

Dear Colleagues,

Please consider contributing to the following SI of Algorithms, MDPI on
"Modeling Computing and Data Handling for Marine Transportation":

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

**** For high quality articles, the publishing fees will be waived. ****

Deadline for manuscript submissions: October 31, 2018

Special Issue Information

Maritime transportation is the major conduit of international trade. In
terms of cost, maritime transport is very competitive relative to land and
airborne transport, increasing only by a few percent the total product cost.
On the other hand, maritime transportation takes longer or may cause harbor
congestion, which further increases voyage times. Furthermore, there are
difficulties in integrating this transportation mode efficiently with other
transport or distribution options. On top of that, the safety and the
environmental impact of maritime transportation, in particular, in the case
of sea accidents, are always two challenging issues.

As recent advances on maritime transportation require the synergy of both
computer science and maritime science, the main focus in this special issue
will be upon the latest developments on IT methodologies for maritime
transportation. Computational intelligence, data mining and knowledge
discovery/representation, risk assessment methodologies as well as
combinatorial optimization are the IT fields that have gain importance in
maritime studies because of their potential in giving solutions for
effective sea transportation.

Submissions are solicited in, but not limited to, the following areas:

- Graph and Network algorithms for Marine Transportation

- Combinatorial optimization techniques for Marine Transportation

- Weather Routing

- Environmentally Safe Shipping

- Safety and Security of Maritime Shipping

- Risk and Safety Analysis, Assessment and Prediction

- Piracy Protection

- GIS in Maritime Applications

- Spatiotemporal and Marine Data Handling

- Route Planning and Monitoring

- Maritime Data Mining and Knowledge Discovery Applications: surveillance,

maritime traffic control, anomaly detection, emergency management, situation

recognition, etc.

- Decision Support Tools for Marine Transportation

- Integration of Heterogeneous Marine Data Sources

Guest Editors:

Dr. Charalampos Konstantopoulos

Prof. Dr. Grammati Pantziou

Theory Announcements

Monday, September 24, 2018

ALT 2019 CfP - submission deadline Sep 28

Friday, September 21, 2018

TAMC 2019 - Call for Papers

Monday, September 17, 2018

[DMANET] Ph.D. Program in Industrial and Systems Engineering (ISE) at Lehigh University

[DMANET] ICDCN 2019 Workshops Call for Papers

[DMANET] STACS 2019 in Berlin --- Second and Last Call for Papers

[DMANET] PhD student position in Geometric Algorithms at TU Eindhoven

[DMANET] [CFP] DCOSS 2019 - 15th International Conference on Distributed Computing in Sensor Systems - deadline January 2019

[DMANET] PhD Candidate Position in Algorithms

Sunday, September 16, 2018

[DMANET] Final Call for Paper

[DMANET] CFP: IEEE Access Journal Special Section on Wirelessly Powered Networks (deadline 30 September)

[DMANET] CIAC 2019 - Second Call for Papers

Friday, September 14, 2018

[DMANET] CFP - ComNet-IoT 2019

[DMANET] Postdoc position in Algorithms and Complexity at Oxford

Thursday, September 13, 2018

[DMANET] Special Issue SCOPUS Indexed Journal : International Journal of Web-Based Learning and Teaching Technologies (IJWLTT) On: Trends on Semantics Web Analytics

[DMANET] 2nd Call for Participation: WENDY - Workshop on Emergent Algorithms and Network Dynamics (Paris, October 10-11)

Wednesday, September 12, 2018

[DMANET] Data Scientist position in Nottingham, UK

[DMANET] CFP - Journal of Business Research - Special Issue on "Complexity: challenges and opportunities"

[DMANET] ITC 2019: International Timetabling Competition

Tuesday, September 11, 2018

[DMANET] Postdoctoral Position in Discrete Mathematics and Algorithms - Masaryk University, Brno

[DMANET] Call for papers: MatBio 2018 Special Issue

[DMANET] SoCG 2019: Call for Papers

[DMANET] New Book: Foundations of Probabilistic Logic Programming

Monday, September 10, 2018

[DMANET] Special Issue "Modeling Computing and Data Handling for Marine Transportation" - Algorithms, MDPI - Open Access Journal

Mailing Lists

Search This Blog

Blog Archive

Monday, September 24, 2018

Friday, September 21, 2018

Monday, September 17, 2018

Sunday, September 16, 2018

Friday, September 14, 2018

Thursday, September 13, 2018

Wednesday, September 12, 2018

Tuesday, September 11, 2018

Monday, September 10, 2018

Mailing Lists

Subscribe To

Search This Blog

Blog Archive