Friday, January 8, 2021

CALL FOR PAPERS

CALL FOR PAPERS

18th Conference on Principles of Knowledge Representation and Reasoning (KR2021)

November 6-12, 2021, Hanoi, Vietnam

https://kr2021.kbsg.rwth-aachen.de


Knowledge Representation and Reasoning (KR) is a well-established and lively
field of research. In KR a fundamental assumption is that an agent's knowledge
is explicitly represented in a declarative form, suitable for processing by
dedicated reasoning engines. This assumption, that much of what an agent deals
with is knowledge-based, is common in many modern intelligent systems.
Consequently, KR has contributed to the theory and practice of various areas in
AI, including automated planning and natural language understanding, and to fields
beyond AI, including databases, verification, software engineering, and robotics.
In recent years, KR has contributed also to new and emerging fields, including the
semantic web, computational biology, cyber security, and the development of
software agents.    

The KR conference series is the leading forum for timely in-depth presentation
of progress in the theory and principles underlying the representation and
computational management of knowledge.

SCOPE


We solicit papers presenting novel results on the principles of KR that clearly
contribute to the formal foundations of relevant problems or show the
applicability of results to implemented or implementable systems.  We also
welcome papers from other areas that show clear use of, or contributions to,
the principles or practice of KR.

Topics of interest include, but are not limited to:

- Applications of KR

- Argumentation

- Belief revision and update, belief merging, information fusion

- Commonsense reasoning

- Computational aspects of knowledge representation

- Concept formation, similarity-based reasoning

- Contextual reasoning

- Decision making

- Description logics

- Explanation finding, diagnosis, causal reasoning, abduction

- Geometric, spatial, and temporal reasoning

- Inconsistency- and exception-tolerant reasoning, paraconsistent logics

- KR and autonomous agents and multi-agent systems

- KR and cognitive robotics

- KR and cyber security

- KR and education

- KR and game theory

- KR and machine learning, inductive logic programming, knowledge acquisition

- KR and natural language processing and understanding

- KR and the Web, Semantic Web

- Knowledge graphs and open linked data

- Knowledge representation languages

- Logic programming, answer set programming

- Modeling and reasoning about preferences

- Multi- and order-sorted representations and reasoning

- Nonmonotonic logics, default logics, conditional logics

- Ontology formalisms and models

- Ontology-based data access, integration, and exchange

- Philosophical foundations of KR

- Qualitative reasoning, reasoning about physical systems

- Reasoning about actions and change, action languages

- Reasoning about constraints, constraint programming

- Reasoning about knowledge, beliefs, and other mental attitudes
- Uncertainty, vagueness, many-valued and fuzzy logics


The KR2021 program will also feature workshops and tutorials, solicited by means
of an open call, as well as a doctoral consortium.


TRACKS

In addition to the main conference track, KR2021 will host the following tracks
and sessions:

* Applications and Systems Track

* Recently Published Research Track

* Special Session on KR and Machine Learning

* Special Session on KR and Robotics

IMPORTANT DATES

Submission of title and abstract: March 24, 2021

Paper submission deadline: March 31, 2021

Author response period: May 24-26, 2021

Notification: June 15, 2021

Camera-ready papers: July 14, 2021

Conference dates: November 6-12, 2021

The Recently Published Research track, workshops, tutorials, and the doctoral
consortium will have different submission and notification dates, which will
be announced separately.

AUTHOR GUIDELINES

All submissions must be written in English and in AAAI style. Papers must be
submitted in PDF format, through the EasyChair conference system:

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

For the main conference track and additional tracks/sessions (except for
the Recently Published Research track), we invite  

- Full papers of up to 9 pages, including abstract, figures, and appendices
  (if any), but excluding references and acknowledgements.

- Short papers of up to 4 pages, excluding references and acknowledgements.  

Both full and short papers must describe original, previously unpublished
research, and must not simultaneously be submitted for publication elsewhere.
These restrictions do not apply to previously accepted workshop papers with
a limited audience and/or without archival proceedings, and to papers uploaded at
public repositories (e.g., arXiv).

Accepted full papers and short papers will be published in the KR2021 proceedings.

Authors may optionally submit a separate PDF containing additional information
that substantiates the claims made in their paper, such as proof details, additional
experimental results, further details on experimental design, etc. If authors wish
to make such material available to reviewers, they should do so by submitting a
file through Easy Chair, rather than by including links or references in their paper.
Please note that the main paper must be self-contained, as the supplementary material
will not be published.  Moreover, reviewers will have the option but not the
obligation to consult the supplementary material.  

The preceding submission guidelines apply to the main track, as well as to the
Applications and Systems track, the KR & Machine Learning special session, and the
KR & Robotics special session. By contrast, different submission guidelines apply
to the Recently Published Research track, workshops, tutorials, and the doctoral
consortium, which will be announced separately.


CONFERENCE CHAIRS:

General:
   Esra Erdem (Sabanci University, Turkey)

Program:
   Meghyn Bienvenu (CNRS & University of Bordeaux, France)
   Gerhard Lakemeyer (RWTH Aachen University, Germany)


Applications and Systems Track:
   Martin Gebser (University of Klagenfurt, Austria)
   Ulrike Sattler (University of Manchester, UK)


Recently Published Research Track:
   Vladimir Lifschitz (University of Texas at Austin, USA)
   Pierre Marquis (Artois University & Institut Universitaire de France, France)


Special Session on KR & Machine Learning:
   Vaishak Belle (University of Edinburgh, UK)
   Luc de Raedt (KU Leuven, Belgium)


Special Session on KR & Robotics:
   Alessandro Saffioti (University of Örebro, Sweden)
   Mary-Anne Williams (University of Technology Sydney, Australia)


Workshop and Tutorials:
   Markus Kroetzsch (TU Dresden, Germany)
   Yongmei Liu (Sun Yat-sen University, China)


Doctoral Consortium:
   Jens Classen (Simon Fraser University)
   Magdalena Ortiz (TU Vienna, Austria)


Local Organization:
   Giuseppe De Giacomo (Sapienza University, Italy)
   Son Tran (New Mexico State University, USA)
   Long Tran-Thanh (University of Warwick, UK)
   Thanh Van Dinh (East Asia University of Technology, Vietnam)


Virtual Conference Arrangements:
   Stefan Borgwardt (TU Dresden, Germany)
   Marco Console (Sapienza University Italy)
   Long Tran-Thanh (University of Warwick, UK)


Sponsorship:
   Kuldeep S. Meel (NUS, Singapore)
   Zeynep G. Saribatur (TU Wien, Austria)


Publicity:
   Thanh Van Dinh (East Asia University of Technology, Vietnam)
   Paolo Felli (Free University of Bozen-Bolzano, Italy)

 


--
Hong Thom

International Training and Cooperation Institute

East Asia University of Technology

Add: Polyco Group Building, Tran Huu Duc St, Nam Tu Liem Dist, Ha Noi

Mobile: + 84 939411986

Website:https://duhoc.eaut.edu.vn/#





Thursday, January 7, 2021

[DMANET] SAMSI Combinatorial Probability Virtual Opening Workshop

SAMSI Combinatorial Probability Virtual Opening Workshop
========================================================
January 14-15 and 19, 2021
10:00 am – 2:00 pm Each Day / Eastern Standard Time (NY)

Website: https://www.samsi.info/programs-and-activities/semester-long-programs/program-on-combinatorial-probability/combinatorial-probability-virtual-opening-workshop/

Register Here: https://duke.qualtrics.com/jfe/form/SV_0lDfn4vtxHtHgAB
Deadline for Registrations is January 8, 2021

Questions: cp@samsi.info

Confirmed Speakers:
===================
Louigi Addario-Berry (McGill University)
Persi Diaconis (Stanford University)
Christopher Hoffman (University of Washington)
Matthew Kahle (Ohio State University)
Elchanan Mossel (MIT)
Oanh Nguyen (University of Illinois)
Robin Pemantle (University of Pennsylvania)
Gabriele Sicuro (EPFL)
Allan Sly (Princeton University)
Prasad Tetali (Georgia Tech)
Yun Wei (SAMSI)
Peter Winkler (Dartmouth)
Lenka Zdeborova (EPFL)

Organizers:
===========
Nicolas Fraiman (University of North Carolina at Chapel Hill)
Sayan Mukherjee (Duke University)
Evita Nestoridi (Princeton University)

**********************************************************
*
* 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] Research Assistant and Postdoc positions available at IIT-CNR, Pisa, Italy

Research positions are open @ IIT-CNR, Pisa, Italy, on the following
topics:

#1: Big Data Analysis and Decision Support Systems for Smart Healthcare
applications
==========================================================
** Position type: Research Assistant, 12 months
** Scientific Supervisor: Franca Delmastro -
https://www.iit.cnr.it/franca.delmastro/
https://scholar.google.it/citations?user=fiw73vIAAAAJ
** Net salary: ~ EUR 1500 per month
==========================================================

#2: Cooperative Ubiquitous Opportunistic Charging with Intelligent
Battery Aging Mitigation
==========================================================
** Position type: Postdoctoral Fellowship, 12 months
** Scientific Supervisor: Theofanis Raptis -
https://www.iit.cnr.it/theofanis.raptis/
https://scholar.google.com/citations?user=aDoDo_kAAAAJ
** Net salary: ~ EUR 1625 per month
==========================================================

** Starting date: Q1 2021
** Location: Ubiquitous Internet Research Unit (RU) @ IIT-CNR, Pisa,
Italy - http://www.iit.cnr.it/
** RU Leader: Andrea Passarella -
https://scholar.google.it/citations?user=sesKnygAAAAJ
** Application deadline: continuous evaluation, up until mid-February
2021


Position #1: Big Data Analysis and Decision Support Systems for Smart
Healthcare applications
==========================================================

Job description
---------------
Smart Healthcare applications represent today a hot research field,
including remote health monitoring solutions enriched with AI algorithms
for the automatic detection and prediction of risky and adverse health
conditions of specific user categories (e.g., frail older adults,
subjects affected by chronic diseases). To this aim, data derived from
IoT systems are enriched with sensing data derived from personal and
wearable devices in order to provide a complete picture of the user's
health status, including physical, cognitive and social conditions, on a
long-term period.

A research assistant position is open in this area for the definition
and evaluation of AI algorithms for anomalous behaviour detection and
risk prediction both in specific health domains (mainly nutrition, sleep
disorders, and stress conditions) and integrated in a multidimensional
evaluation of frailty condition in older adults. These algorithms should
also be designed to be integrated in a mobile health (m-health) solution
to guarantee the processing of sensitive data directly on the personal
mobile device and to provide a personalised and motivational feedback to
the monitored subject. The algorithms will be validated both on
available datasets and on new datasets collected through the application
of prototype solutions in real scenarios and pilot studies based on the
collaboration with medical units.

The Research assistant will work on the following topics:
(i) Design and evaluation of AI algorithms for anomalous behaviour
detection and risk prediction based on heterogeneous sensing data.
(ii) Integration of the proposed algorithms in a prototype m-health
application.
(iii) Participation in the definition and deployment of pilot studies
with real subjects.

Candidate profile
---------------
Candidates should have a MSc degree in Computer Science, Computer
Engineering, or closely related disciplines, and a proven track record
of excellent University grades. Preferably, the topic of the MSc thesis
should be in one of the relevant research areas (Artificial
Intelligence, BigData analytics, distributed systems, e-health
applications).
Good written and spoken communication skills in English are required.

The selected candidate could also be interested in applying to a PhD
program in Fall 2021.

Specifically, IIT-CNR is part of several PhD programs including:
- the PhD program in Data Science (https://datasciencephd.eu/) hosted by
the Scuola Normale Superiore (https://www.sns.it/en)
- the PhD programs in Computer Engineering
(https://phd.dii.unipi.it/en/) and Computer Science
(https://dottorato.di.unipi.it/), hosted by the University of Pisa
- the PhD program in Smart Computing, jointly organised by the
Universities of Florence, Pisa, Siena, CNR, FBK
(https://smartcomputing.unifi.it/)

The selection for PhD programs is managed by the related hosting
university and applicants will apply directly to the official call of
the specific PhD.

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

Position #2: Cooperative Ubiquitous Opportunistic Charging with
Intelligent Battery Aging Mitigation
==========================================================

Job description
---------------
Battery aging (the loss of battery's capacity and internal resistance
growth) is an emerging challenge for portable devices carried by mobile
users. Due to the fact that newer devices are becoming more feature-rich
and resource demanding, they are subjected to more charge-discharge
cycles compared to their older counterparts; a pattern which increases
their battery aging, and enables them to require higher power and more
expensive and bigger batteries. Individualized battery aging mitigation
and user profiling, which do not take into account neither other users
in the networked population nor emerging energy sharing technologies
like peer-to-peer wireless power transfer, are not uncovering the full
potential of intelligent charging.

One post-doc position is open in this area, for the design and
deployment of ubiquitous charging intelligence in order to cooperatively
mitigate battery aging, radically optimize energy redistributions, and
unorthodoxically increase user quality of experience. The envisioned
approach will deliver fine-grained modelling and algorithmic
exploitation of not only static wired charging but also wireless energy
sharing technologies, and will provide a novel combination of
theoretical tools, socio-technical extensions, practical simulations and
(potentially) limited field trials.

The Postdoctoral Fellow will work on the following topics:
(i) Rigorous socio-technical modelling for populations of cooperative
mobile users
(ii) Algorithmic development for intelligent, network-wide,
wired/wireless charging with battery aging mitigation
(iii) Performance evaluation through large scale simulations and/or real
device experimentation

Candidate profile
---------------
Ideal candidates should have (or are about to obtain) a PhD in Computer
Science, Computer Engineering, or closely related disciplines, and a
proven track record of publications in relevant top-tier journals and
conferences. Preferably, the topic of the PhD should have been in one of
the related research areas (mobile computing, WSNs, opportunistic
networks, IoT). Good written and spoken communication skills in English
are required.

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

Research Unit (RU)
---------------
The positions will be in the Ubiquitous Internet (UI) RU of IIT-CNR in
Pisa, Italy (http://cnd.iit.cnr.it). UI activities range over multiple
topics related to the design and analysis of the Next Generation
Internet networking and computing systems, including edge computing,
Internet of People, decentralised AI, human-centric networked systems,
online/mobile social networks, data centric and self-organising
networks.  Verticals of interest include Industry 4.0, e-health, energy
efficiency, smart mobility. The RU has a strong track record of
successful activities in national and European projects, from FP6 to
H2020, which is reflected in the many international collaborations in EU
and USA activated by the researchers of the RU.

Application procedure
---------------
Applications should consist of (all documents in English):
- a complete CV, with a complete transcript of the university grades,
both at the MSc and PhD levels
- a 1-page research statement showing motivation, understanding and
knowledge on the topic of the position
- contact details of 1-2 persons who could act as reference(s)

The applications and any request of information should be sent to:
** Position #1: franca.delmastro@iit.cnr.it with subject "Research
assistant application: smart healthcare"
** Position #2: theofanis.raptis@iit.cnr.it with subject "Post-doc
application: cuochi.bam"

Applications will be continuously evaluated upon reception. Interviews
will be organized with selected candidates. Applications will be
considered until suitable candidates are identified up to mid-February
2021. Interested candidates are thus strongly encouraged to send their
application as soon as possible.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, January 6, 2021

[DMANET] PODC 2021 - Final Call for Workshop and Tutorial Proposals

PODC 2021, July 26 - July 30, Salerno, Italy

https://www.podc.org<https://www.podc.org/>

The 40th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2021) invites proposals for full-day and half-day workshops and tutorials. They will take place on Monday, July 26 and Friday, July 30.

A proposal should include:

* Title of the workshop or tutorial
* A description of the subject matter and why it would be of interest to the PODC community
* Name(s) and contact information of the organizer(s)
* Proposed format (e.g., invited speakers only, or peer-reviewed papers with proceedings, etc.)
* Length: half-day or full-day
* Estimated number of speakers and attendees
* Information about previous editions of the same workshop

The proposals should be sent by e-mail to the Workshop Chair, Hsin-Hao Su <suhx@bc.edu<mailto:suhx@bc.edu>>

We will be accepting proposals until the end of January. We cannot guarantee to give consideration to proposals arriving after January 31 as we will begin the process of setting the schedule soon after that point.

With regards to potential topics, we are looking for proposals related to the current scope of PODC or are new emerging research fields complementing or extending it, including but not restricted to:

* distributed algorithms: design, analysis, and complexity
* communication networks: algorithms, architectures, services, protocols, applications
* multiprocessor and multi-core architectures and algorithms
* shared and transactional memory, synchronization protocols, concurrent programming
* fault-tolerance, reliability, availability, self-organization, self-stabilization
* codes and reliable communication
* Internet applications, social networks, recommendation systems
* dynamic, adaptive and machine learning-based distributed algorithms
* distributed operating systems, middleware platforms, databases
* game-theoretic approaches to distributed computing
* distributed mechanisms design
* peer-to-peer systems, overlay networks, distributed data management
* high-performance, cluster, cloud and grid computing
* wireless networks, mobile computing, autonomous agents and robots
* context-aware distributed systems
* security in distributed computing, cryptographic protocols
* distributed cryptocurrencies and blockchain protocols
* quantum and optics-based distributed algorithms
* nanonetworks
* biological distributed algorithms
* sensor, mesh, and ad hoc networks
* specification, semantics, verification of concurrent systems


------
Regards,
William K. Moses Jr.
Publicity Chair, PODC 2021
https://sites.google.com/view/wkmjr

**********************************************************
*
* 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] Three-year postdoc position in graph limits at the Czech Academy of Sciences

The Institute of Computer Science of the Czech Academy of Sciences has an
opening for a postdoctoral position for a tentative period July 2021-August
2024 within a project "Graph limits and beyond'' with Jan Hladky as the
principal investigator. Starting salary is 47000CZK/month. See
https://www.numbeo.com/cost-of-living/comparison.jsp

There are no teaching duties and support for travel is available.

The candidate should have a strong background in theory of graph limits,
extremal graph theory, or random discrete structures. Motivated candidates
from other fields of combinatorics, probability, real analysis or
theoretical computer science will be also considered.

For informal inquiries, please contact Jan Hladky (hladky@math.cas.cz). The
full text of the announcement including application instructions is
available at https://www.cs.cas.cz/job-offer/Graph-limits-Hladky/cs. The
closing date is February 10, 2021, or until the position is filled.

**********************************************************
*
* 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] WG 2021: First Call for Papers

==== 47th International Workshop on Graph-Theoretic Concepts in Computer
Science, WG 2021 ====

The WG 2021 conference is the 47th edition of the WG series and will take
place from Wednesday 23rd June to Friday 25th June 2021. Depending on the
pandemic situation, the event will be organized at Old Library of
University of Warsaw in Poland or as an online conference. Some hybrid form
is also possible and even if the conference takes place in Warsaw, it will
be possible to give an online talk and participate online. The final
decision about the form of the conference will be announced in February
2021, before the submission deadline.

Conference website: https://wg2021.mimuw.edu.pl

== IMPORTANT DATES ==

Submission of papers: 3 March 2021
Acceptance notification: TBA (late April 2021)
Conference: 23-25 June 2021
Final version: TBA (middle of July 2021)

== AIMS AND SCOPE ==

WG conferences aim to connect theory and applications by demonstrating how
graph-theoretic concepts can be applied in various areas of computer
science. The goal is to present recent results and to identify and explore
directions for future research. Submitted papers should describe original
results in any aspects of graph theory related to computer science,
including but not restricted to:
- design and analysis of sequential, parallel, randomized, parameterized,
and distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modelling,
- graph drawing and layouts,
- computational geometry,
- computational biology,
- random graphs and models of the web and scale-free networks, and support
of these concepts by suitable implementations and applications.

== INVITED SPEAKERS ==

Édouard Bonnet (CNRS, ENS Lyon, France)
Vida Dujmović (University of Ottawa, Canada)
Wojciech Samotij (Tel Aviv University, Israel)

== PROGRAM COMMITTEE ==

Akanksha Agrawal (Indian Institute of Technology Madras, Chennai, India)
Therese Biedl (University of Waterloo, Canada)
Sergio Cabello (University of Ljubljana, Slovenia)
Steven Chaplick (Maastricht University, The Netherlands)
Vincent Cohen-Addad (Google Zürich, Switzerland)
Jiří Fiala (Charles University, Czech Republic)
Robert Ganian (Technische Universität Wien, Austria)
Gwenaël Joret (Université Libre de Bruxelles, Belgium)
Eun Jung Kim (Université Paris-Dauphine, France)
Sándor Kisfaludi-Bak (Max Planck Institute for Informatics, Saarbrücken,
Germany)
Łukasz Kowalik (University of Warsaw, Poland, co-chair)
Marvin Künnemann (Max Planck Institute for Informatics, Saarbrücken,
Germany)
O-joung Kwon (Incheon National University, South Korea)
Erik Jan van Leeuwen (Utrecht University, The Netherlands)
Martin Milanič (University of Primorska, Slovenia)
Michał Pilipczuk (University of Warsaw, Poland, co-chair)
Paweł Rzążewski (Warsaw University of Technology and University of Warsaw,
Poland, co-chair)
Sophie Spirkl (University of Waterloo, Canada)
Kavitha Telikepalli (Tata Institute of Fundamental Research, Mumbai, India)
Przemysław Uznański (University of Wrocław, Poland)
Birgit Vogtenhuber (Graz University of Technology, Austria)

== ORGANISING COMMITTEE ==

Łukasz Kowalik (University of Warsaw, Poland)
Marcin Pilipczuk (University of Warsaw, Poland)
Michał Pilipczuk (University of Warsaw, Poland)
Paweł Rzążewski (Warsaw University of Technology and University of Warsaw,
Poland)

== SUBMISSIONS AND PROCEEDINGS ==

Contributors are invited to submit an extended abstract of at most 12 pages
Springer LNCS format including title, abstract, and references, without
changes to the settings of margins and vertical spacing, and with numbered
pages. To submissions with more than one page of references a bound of 11
LNCS-pages applies, including title and abstract, but excluding references.
Proofs omitted due to space restrictions must be placed in an appendix, to
be read by program committee members at their discretion. Simultaneous
submission of papers to any other conference with proceedings published or
made publicly available, or submitting papers previously accepted for
journal publication is not allowed. Accepted contributions will be
published in the conference proceedings in the Lecture Notes in Computer
Science (LNCS) series of Springer-Verlag.

Please submit your paper using EasyChair:
https://easychair.org/conferences/?conf=wg2021

== BEST PAPER AND BEST STUDENT PAPER AWARD ==

Thanks to the support of Springer Verlag, WG 2021 is able to offer awards
of 500 Euro for the best paper and the best student paper. The awards will
be decided by the program committee. The committee can decide to split the
awards over multiple papers, or not to offer an award. Papers eligible for
the best student paper can have non-student co-authors, but the main work
in a paper that is a candidate for the best student paper award must be
done by co-authors that were students at the time of submission, and the
award can be received only by such co-authors. It must be indicated at the
time of submission whether a paper is a candidate for this award.

== CONTACT ==

All inquiries about the conference, including submissions, can be directed
to the organising committee: wg2021@mimuw.edu.pl

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

[DMANET] Full Professor position in Operations Research at Tilburg University

The Department of Econometrics and Operations Research of Tilburg School of Economics and Management (Tilburg University) is looking for a Full Professor in a central area of Operations Research (OR).

The position will be embedded in the Department of Econometrics and Operations Research (EOR) in the Tilburg School of Economics and Management (TiSEM) at Tilburg University - more about this department at the weblink:
https://www.tilburguniversity.edu/about/schools/economics-and-management/organization/departments/eor

Details about the position and on how to apply can be found at the website:
https://www.tiu.nu/17020

The deadline for applications will be January 30, 2021, but the hiring committee will review applications as they arrive, and may schedule interviews before the deadline. We therefore encourage applicants to submit their documents as soon as possible.

All applications should be submitted online at the website:
https://www.tilburguniversity.edu/about/working

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

Tuesday, January 5, 2021

[DMANET] SODA21: SIAM Reopens Application Portal for Student Registration Fee Waiver

*****

*Dear TCS Students:*

*SIAM has today reopened the application portal for SODA21 Student
Registration Waiver. **The new deadline will be this Friday, January 8 at
11:59pm EST.*

*SODA21 will be held virtually on Jan. 10 - Jan. 13, 2021.*

*Please note that having paper(s) in SODA and its associated Symposiums is
not a requirement. For this year's application, the letter of
recommendation from advisors is not required as well. **The goal of the
support from Google, Microsoft, and ACM is to increase opportunity for
students to attend this premier TCS conference. *

*Looking forward to seeing you in SODA'21.*

*Shang-Hua Teng *
*On Behalf of SODA Steering Committee*

******

**********************************************************
*
* 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] Researcher Positions (Algorithms, Learning and Optimization) at Amazon Transporation Services Luxembourg (Full-Time or 6 Month Internship)

Hello everyone,
Amazon Transportation Services (ATS) has full-time and 6 months internship positions for researchers in middle-mile logistics!

Have you ever wondered how Amazon delivers timely and reliably hundreds of millions of packages to customer's doorsteps? Are you passionate about data and mathematics, and hope to impact the experience of millions of customers? Are you obsessed with designing simple algorithmic solutions to very challenging problems?

The Research Science team of ATS EU is looking for candidates who are looking to impact the world with their mathematical and data-driven skills.

Amazon Transportation Service is responsible for middle-mile logistics: we carry the packages from the warehouses to the cities in a limited amount of time to enable the "Amazon experience". As the core research team, we grow at the same rate with ATS business to support decision making in an increasingly complex ecosystem of the largest data-driven supply chain and e-commerce business.

We take pride in our algorithmic solutions:

(a) We schedule more than 1 million trucks of Amazon yearly, holding the key to reducing CO2 emissions, protecting sites from being overwhelmed during peak days, and ensuring a smile on Amazon's customer lips.

(b) We do not shy away from responsibility. Our mathematical algorithms provide confidence in leadership to invest in programs of several hundreds millions euros every year.

(c) Above all, we are having fun solving real-world problems, in real-world speed, while learning along the way.

We employ the most sophisticated tools:

(a) We use sophisticated modular algorithmic designs in the domain of combinatorial optimization, solving complicated generalizations of core OR problems with the right level of decomposition, employing parallelization and approximation algorithms.

(b) We use deep learning, bandits, and reinforcement learning to put data into the loop of decision making.

(c) We like to learn new techniques to surprise business stakeholders by making possible what they cannot anticipate.

We are obsessed with the highest standards of customer-oriented research:

(a) We target publications at the most prestigious conferences such as (INFORMS and NeurIPS)

(b) We code our prototypes to be production-ready

(c) We prefer provably optimal solutions than heuristics, though we settle for heuristics when performance dictates it. Overall, we appreciate the value of correct modeling.

To apply for a position, send me your CV stating whether you are applying for a full-time or an internship position. Applications for full-time positions can also be submitted through Amazon Jobs: https://www.amazon.jobs/en/jobs/1385686/research-scientist-algorithms-learning-and-optimization?no_int_redir=1

Feel free to contact me in case of questions!

Looking forward to hear from you,
Martin Gross
______________________________________
Senior Research Scientist
Amazon Transportation Services
Amazon EU Sarl




Amazon EU societe a responsabilite limitee, 38 avenue John F. Kennedy, L-1855 Luxembourg, R.C.S. Luxembourg n
B101818, autorisation d'etablissement en qualite de commercante n 134248, TVA LU 20260743




**********************************************************
*
* 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] Last Call for Nominations: ACM SIGAI Autonomous Agents Research Award 2021

Please nominate individuals for the AA Award! Note that we are interested
in individuals whose past and *current work* is important to the field! We
encourage mid-career nominations!

Nominations are solicited for the 2021 ACM SIGAI Autonomous Agents Research
Award. This award is made for excellence in research in the area of
autonomous agents. It is intended to recognize researchers in autonomous
agents whose current work is an important influence on the field. The award
is an official ACM award, funded by an endowment created by ACM SIGAI from
the proceeds of previous Autonomous Agents conferences. The recipient of
the award will receive a monetary prize and a certificate, and will be
invited to present a plenary talk at the AAMAS 2021 conference in London,
United Kingdom.

Anyone can make a nomination. Nominations should be made by email to the
chair of the award committee, Stacy Marsella (stacymarsella@gmail.com), and
should consist of a short (< 1 page) *statement that emphasizes not only
the research contributions that the individual has made that merit the
award but also how the individual's current work is an important influence
on the field.*

* 15 January 2021 -- Deadline for nominations
* 12 February 2021 -- Announcement of winner
* 3-7 May 2021 -- AAMAS-2021 conference in London, United Kingdom

Call as a PDF: https://rebrand.ly/SIGAI-AA-Award

--
*Nicholas Mattei*
Assistant Professor, Tulane University
nsmattei@tulane.edu | www.nickmattei.net

Stanley Thomas Hall | 402B
+1 504 862 8391
Department of Computer Science
Tulane University
6823 St Charles Ave
New Orleans, LA 70118

**********************************************************
*
* 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] Assistant professorship, postdoc, and PhD positions in Copenhagen

The Department of Computer Science (DIKU) at the University of Copenhagen invites applications for:
- A tenure-track assistant professorship in computational complexity theory https://employment.ku.dk/faculty/?show=152981
- Postdocs in theoretical computer science https://employment.ku.dk/faculty/?show=153103
- A postdoc in combinatorial optimization https://employment.ku.dk/faculty/?show=153126
- PhD positions in theoretical computer science and/or combinatorial optimization https://employment.ku.dk/phd/?show=153104

The application deadline for the assistant professorship is January 17, 2021, and for all the other positions the deadline is January 24, 2021.

These positions are in the Algorithms and Complexity Section at DIKU, which is part of an exciting environment including the Basic Algorithms Research Copenhagen (BARC) centre, joint with the IT University of Copenhagen, and involving extensive collaborations with the Technical University of Denmark (DTU) and Lund University on the Swedish side of the Oresund Bridge. We aim to attract top talent from around the world to an ambitious, creative, collaborative, and fun environment. Using the power of mathematics, we strive to create fundamental breakthroughs in algorithms and complexity theory, but we also have a track record of start-ups and surprising algorithmic discoveries leading to major industrial applications.

The University of Copenhagen was founded in 1479 and is the oldest and largest university in Denmark. It is often ranked as the best university in Scandinavia and consistently as one of the top places in Europe. Within computer science, it is currently number 1 in the European Union (post-Brexit) according to the Shanghai Ranking.

Informal enquiries about these positions are welcome and may be sent to jn@di.ku.dk.


**********************************************************
*
* 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 Contributions: [Algorithms, MDPI] Special Issue "Scalable Graph Algorithms and Applications"

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

We are pleased to announce the launch of a new Special Issue dedicated to
"Scalable Graph Algorithms and Applications" in the journal Algorithms,
an *EI-*, *ESCI-*, and *Scopus-indexed* open access journal.

---------------------------------------------------------------------------------------------
Journal: Algorithms (https://www.mdpi.com/journal/algorithms)

Special issue on "Scalable Graph Algorithms and Applications"
https://www.mdpi.com/journal/algorithms/special_issues/Scalable_Graph_Algorithms


Guest Editors: Dr. Deepak Ajwani, Dr. Sabine Storandt and Dr. Darren Strash

Submission deadline: 31 March 2021. Papers will be published
on an ongoing basis, so you can submit your paper at any point before
the deadline.
---------------------------------------------------------------------------------------------

We invite you to submit your latest research in the area of scalable graph
algorithms to the Special Issue, "Scalable Graph Algorithms and
Applications". We solicit high-quality papers to address both algorithm
design and algorithm engineering issues related to the processing of large
graphs. We consider scalability in a broad sense: (i) for near linear-time
graph algorithms such as those related to traversal and shortest-paths,
scalability refers to algorithms that address issues of cache-efficiency,
I/O-efficiency, GPU parallelism, shared memory parallelism, and distributed
algorithms; (ii) for polynomial-time graph algorithms such as those related
to matching, flow and centrality computation, scalability refers to the
exact and approximate algorithms that scale to millions of nodes and edges;
(iii) For NP-hard graph problems such as those related to subgraph pattern
matching, scalability refers to the design and engineering of heuristics
that are capable of dealing with graphs that have thousands of nodes and
tens of thousands of edges. We also invite submissions related to
applications of scalable graph algorithms in areas such as social network
analysis, navigation systems and sustainable transportation, querying and
mining knowledge graphs, semantic web, recommendation systems, financial
and economic networks, network epidemic models, bioinformatics, and earth
sciences applications.

Topics of interest include (but are not limited to) the following:

- Cache-efficient graph algorithms
- I/O-efficient graph algorithms
- Shared-memory multicore graph algorithms
- Distributed memory graph algorithms
- Graph algorithms for GPUs
- Streaming graph algorithms
- Randomized graph algorithms
- Approximate graph algorithms
- Dynamic graph algorithms
- Algorithms for large-scale network analytics
- Scalable graph mining
- Efficient heuristics for NP-hard graph problems
- Models for real-world graphs
- Generation of large graph instances
- Simulations involving large graphs
- Applications of large graphs in social network analysis, navigation
systems and sustainable transportation, querying and mining knowledge
graphs, etc.

Prospective authors are encouraged to contact the guest-editors as soon as
possible.

Manuscript Submission Information
---------------------------------
Submitted manuscripts should not have been published previously, nor be
under consideration for publication elsewhere, except conference
proceedings papers. In the latter case (of conference proceedings papers),
the submitted manuscript should provide enough new content.

All manuscripts are thoroughly refereed through a single-blind peer-review
process. A guide for authors and other relevant information for submission
of manuscripts is available on the Instructions for Authors page (
https://www.mdpi.com/journal/algorithms/instructions). Algorithms is an
international
peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page (https://www.mdpi
.com/journal/algorithms/instructions) before submitting a manuscript. The
Article Processing Charge (APC - https://www.mdpi.com/about/apc) for
publication in this open access (https://www.mdpi.com/about/openaccess)
journal is 1400 CHF (Swiss Francs). Submitted papers should be well
formatted and use good English. Authors may use
MDPI's English editing service (https://www.mdpi.com/authors/english) prior
to publication or during author revisions.

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

[DMANET] Special Issue on "Side-Channel Attacks on Mobile and IoT Devices for Cyber-Physical Systems" - Deadline Extended!

Special Issue on "Side-Channel Attacks on Mobile and IoT Devices for Cyber-Physical Systems", Computer Networks

CFP:https://www.journals.elsevier.com/computer-networks/call-for-papers/side-channel-attacks-on-mobile-and-iot-devices

Submission deadline: January, 20 2021

Guest Editors
*Mauro Conti*, University of Padua, Italy,conti@math.unipd.it
*Radha Poovendran*, University of Washington, Seattle, USA,rp3@uw.edu
*Eleonora Losiouk*, University of Padua, Italy,elosiouk@math.unipd.it
*Riccardo Spolaor*, Shandong University, Qingdao, China,rspolaor@sdu.edu.cn

Best regards,
Eleonora Losiouk


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

[DMANET] CFP - MDPI Journal of Imaging special issue on "Fine Art Pattern Extraction and Recognition"

__________________________________________________________________________

                     Call for Papers - Special Issue
                    of the MDPI Journal of Imaging on
              _____________________________________________

               Fine Art Pattern Extraction and Recognition
              _____________________________________________

-->>> https://www.mdpi.com/journal/jimaging/special_issues/faper2020 <<<--
__________________________________________________________________________

___________
Aim & Scope

Cultural heritage, in particular fine art, has invaluable importance for
the cultural, historic, and economic growth of our societies. Fine art
is developed primarily for aesthetic purposes, and it is mainly
concerned with paintings, sculptures, and architectures. In the last few
years, due to technology improvements and drastically declining costs, a
large-scale digitization effort has been made, leading to a growing
availability of large digitized fine art collections. This availability,
along with the recent advancements in pattern recognition and computer
vision, has opened new opportunities for computer science researchers to
assist the art community with automatic tools to analyse and further
understand fine arts. Among the other benefits, a deeper understanding
of fine arts has the potential to make them more accessible to a wider
population, both in terms of fruition and creation, thus supporting the
spread of culture.

The ability to recognize meaningful patterns in fine art inherently
falls within the domain of human perception, and this perception can be
extremely hard to conceptualize. Thus, visual-related features, such as
those automatically learned by deep learning models, can be the key to
tackling problems of extracting useful representations from low-level
colour and texture features. These representations can assist in various
art-related tasks, ranging from object detection in paintings to
artistic style categorization, useful for examples in museum and art
gallery websites.

This special issue will provide the researchers from diverse areas such
as pattern recognition, computer vision, artificial intelligence, and
image processing, with the opportunity to present advancements in the
state of the art, innovative research, ongoing projects, and academic
and industrial reports on the application of visual pattern extraction
and recognition for the better understanding and fruition of fine arts.

_______________________________________
Topics include, but are not limited to:
- Application of machine learning and deep learning to cultural heritage
- Computer vision and multimedia data
- Generative adversarial networks for artistic data
- Augmented and virtual reality for cultural heritage
- 3D reconstruction of historical artifacts
- Historical document analysis
- Content-based retrieval in the art domain
- Speech, audio, and music analysis from historical archives
- Digitally enriched museum visits
- Smart interactive experiences in cultural sites
- Projects, products, or prototypes for cultural heritage restoration,
preservation, and fruition

_______________________________________

Submission Deadline:  28 February 2021
_______________________________________

Submit your paper to manuscript submission and peer review site via the
following link:
->> https://www.mdpi.com/journal/jimaging/special_issues/faper2020 <<-

The Article Processing Charge (APC) for publication in the MDPI Journal
of Imaging is 1000 CHF (Swiss Francs).

________________

Editor-in-Chief
________________

Prof. Gonzalo Pajares Martinsanz, Universitad Complutense de Madrid, Spain

______________

Guest Editors
______________

Giovanna Castellano, Universita' di Bari, Italy
Gennaro Vessio, Universita' di Bari, Italy
Fabio Bellavia, Universita' di Palermo, Italy





**********************************************************
*
* 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 studentships at the School of Computing Science, University of Glasgow

The School of Computing Science at the University of Glasgow is offering up to 17 studentships to support PhD research for students starting in 2021. Funding is available to support tuition fees for both home and international students, and in most cases to support living expenses at the recommended UKRI rate (currently £15,285 per annum) in addition.

Whilst the above funding is open to students in all areas of computing science, applications in the area of algorithms and complexity are welcomed. Available supervisors in this area at the School include:

* Dr Jessica Enright (graph theory, optimisation, algorithms, network epidemiology), email jessica.enright@glasgow.ac.uk
* Dr Gramoz Goranci (dynamic graph algorithms, graph sparsification, numerical linear algebra, metric embeddings), email ggoranci@cs.toronto.edu
* Prof David Manlove (combinatorial and graph algorithms, optimisation, matching problems), email david.manlove@glasgow.ac.uk
* Dr Ciaran McCreesh (constraint programming, algorithm engineering, empirical algorithmics), email ciaran.mccreesh@glasgow.ac.uk
* Dr Kitty Meeks (graph theory, algorithms, parameterised complexity, counting complexity), email kitty.meeks@glasgow.ac.uk

Students can apply for admission to PhD study at any time, but to be considered for the studentships we are offering at this round, we must receive your application by 31 January 2021. For more information about how to apply, see https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents. This web page includes information about the research proposal, which is required as part of your application.

Applicants are strongly encouraged to contact a potential supervisor and discuss an application before the submission deadline. See https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/studentshipinformation and https://www.gla.ac.uk/schools/computing/postgraduateresearch/prospectivestudents/phd-projects for more details about the funding available.

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

Monday, January 4, 2021

[DMANET] A postdoc position at Computer Science Institute, Charles University, Prague

A one-year postdoc position (with a possibility of extension) is offered at
Computer Science Institute of Charles University (https://www.mff.cuni.cz/en/iuuk).
The (negotiable) starting date: September 1, 2021.

The position is funded by the "Algorithms and Complexity within and beyond
Bounded Expansion" project; the candidates are expected to have a background in
structural, geometric, and/or algorithmic graph theory.

The candidates must have a Ph.D. degree in mathematics or theoretical computer
science completed within the last 4 years (with exceptions for individual
circumstances such as parental leave) or be expected to obtain the degree by
the starting date of the position.

The application should contain:

* A short letter of motivation.
* Professional CV (including the list of publications).
* Two letters of recommendation.

Application deadline: March 1, 2021.

Inquiries and applications should be sent to Zdeněk Dvořák <rakdver@iuuk.mff.cuni.cz>
**********************************************************
*
* 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] metaheuristics for optimization

Dear Colleague,

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

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

Topics

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

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

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

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


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

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

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


Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

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

[DMANET] compuatational optimization

Call for Papers

14th International Workshop on Computational Optimization (WCO21)
Sofia, Bulgaria, September 2-5, 2021

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

IEEE CS is a technical co-sponsor of FedCSIS 2021

https://fedcsis.org/2021/wco

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

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

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

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

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

Best paper award

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

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

Submission and Publication

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

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

Important dates:


+ Paper submission (strict deadline): May 24, 2021, 23:59:59 pm HST (there
will be no extension)
+ Position paper submission: June 14, 2021
+ Author notification: July 5, 2021
+ Final paper submission and registration: August 2, 2021
+ Conference date: September 2-5, 2021

===============================================================================
Organizing Committee

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

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

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

--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

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

Sunday, January 3, 2021

[DMANET] Postdoc positions in Parallel/Distributed Algorithms, University of Warwick

-------------------------------------------------------------------
Postdocs in Parallel and Distributed Algorithms
University of Warwick
https://warwick.ac.uk/dcs/people/artur_czumaj/postdoc-advert-jan-2021
-------------------------------------------------------------------

In connection with a research grant of Professor Artur Czumaj, we are
seeking excellent candidates for a postdoctoral fellow position in the
area of the design and theoretical analysis of parallel and distributed
algorithms. The main objective is to pursue cutting edge research in the
broadly understood area of design and mathematical analysis of parallel
and distributed algorithms, focusing on fundamental research in this area.

The position is for up to 2 years.

The applicants are expected to have a strong interest and background in
the mathematical analysis of algorithms or discrete mathematics, and
theoretical computer science. Being familiar with distributed (local,
congested clique, congest, etc) or parallel (PRAM, MPC, MapReduce, etc)
computing is preferred but not required. This is a theory-focused
project, and hence programming skills are not required - even though
they would be a bonus.

The postdoctoral fellow will join a team of internationally renowned
researchers at the Centre for Discrete Mathematics and its Applications
(DIMAP, http://www2.warwick.ac.uk/dimap/) and the Foundations of
Computer Science Research Group
(http://www.dcs.warwick.ac.uk/research/focs/) in the Department of
Computer Science at the University of Warwick.

Closing date for receipt of applications: Closing date: January 13, 2021.

Formal applications, which include CV with a list of publications, a
research statement, and a short statement highlighting your suitability
for this post, should be made following the link at
https://www.jobs.ac.uk/job/CDE153/research-fellow-103545-1220.

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

[DMANET] Call for Papers :: SMARTCOMP 2021, Aug 23-27, 2021, Irvine, CA, USAs

CALL FOR PAPERS
******************************************************************
The 7th IEEE International Conference on Smart Computing (SMARTCOMP 2021), August 23-27, 2021 in Irvine, Orange County, California, USA
https://www.smart-comp.info
******************************************************************

SMARTCOMP 2021, the 7th edition of the conference, will be held in Irvine, Orange County, California, USA. SMARTCOMP is the premier conference on smart computing. Smart computing, a multidisciplinary domain is based on the synergistic influence of advances in Sensor-based technologies, the Internet of Things (IoT), Cyber-Physical Systems, Edge computing, Big Data analytics, Machine Learning, Cognitive Computing, and Artificial Intelligence.

Applications of smart computing can be found in different societal domains including, but not limited to, transportation, energy, environmental protection, smart and connected communities, healthcare, banking, entertainment, and social media. Algorithmic and system advancements of cloud computing, mobile/pervasive computing, cyber-physical systems, sensor networking and social computing are taking smart computing to a new dimension and improving our ways of living. Selected papers from SMARTCOMP 2021 will be considered for publication in Elsevier's Journal of Pervasive and Mobile Computing.

It is planned to have the conference in Irvine, Orange County, California, USA. However, there is a possibility of moving to either a hybrid or fully online mode depending on the pandemic situation. 


TOPICS
SMARTCOMP 2021 solicits submissions that address the fundamental questions of smart computing, namely how to design and build scalable and reliable smart computing systems, and how to use computing technology for resource sustainability to improve the human experience. Topics include, but not limited to the following:

* Future Smart Computing Paradigms
* Models of Smart Environments
* Algorithms for Smart Computing
* AI and Machine Learning in Smart Computing
* Security, Privacy, and Trust issues in Smart Computing
* Fairness and Socio-technical issues of Smart Computing
* Cyber-physical System Platforms for Smart Environments
* Middleware Platforms for Smart Environments
* Mobile and Ubiquitous Platforms for Smart Environments
* Cloud, Edge and Fog Computing Platforms for Smart Systems
* Data Architectures and Analytics for Smart Computing
* Applications of Smart Computing

SUBMISSION GUIDELINES
Paper submissions must be no longer than 8 pages (the page count limit includes the references list) and formatted according to the two-column IEEE proceedings template. IEEE provides corresponding formatting templates at *IEEE conference template*. Make sure to use the conference mode of the template, i.e., LaTeX users must use the conference option of the IEEEtran document class.

Papers must be submitted electronically as a single PDF file on US Letter size paper (not A4), with all fonts embedded (the PDF-A standard complies with that), through EDAS. Prior to submission, ensure that any running headers/footers, page numbering, as well as blue underlining for URLs and email addresses has been removed.

All submitted papers will be subject to peer reviews by Technical Program Committee members and other experts in the field. All presented papers will be published in the conference proceedings and submitted to the IEEE Xplore Digital Library.

Extended versions of selected high quality papers accepted in IEEE SMARTCOMP 2021 will be considered for publication in the Elsevier's Pervasive and Mobile Computing journal.

IMPORTANT DATES:
* Paper Registration Deadline: 24 January 2021
* Paper Submission Deadline: February 1 2021
* Acceptance Notification: April 15, 2021
* Camera Ready Deadline: May 15, 2021
* Registration Deadline: TBD

ORGANIZATION COMMITTEE:
* General Co-Chairs
- Marco Conti, IIT-CNR, Italy
- Nalini Venkatasubramanian, University of California, Irvine, USA

* Technical Program Co-Chairs
- Mohan Kumar, Rochester Institute of Technology, USA
- Valerie Issarny, INRIA Paris, France

* Workshop Co-Chairs
- Carlo Giannelli, University of Ferrara, Italy
- Flora Salim, RMIT University, Australia

* Publicity Co-Chairs
- Yusuf Sarwar, University of Missouri, Kansas City, USA
- Mattia Campana, IIT-CNR, Italy

* Publication Chair
- Francesco Longo, University of Messina, Italy
- Chenghsin Hsu, National Tsinghua University, Taiwan

* Web Co-Chairs
- Georgios Bouloukakis, Telecom SudParis, France
- Shantanu Sharma, University of California, Irvine, USA

* Online Session Coordination Chairs
- Carlo Vallati, University of Pisa, Italy

* Steering Committee Co-Chairs
- Jiannong Cao, Hong Kong Polytechnic University, Hong Kong
- Sajal K. Das, Missouri University of Science and Technology, USA

* PhD Forum Co-Chairs
- Paolo Bellavista, University of Bologna, Italy
- Qi Han, Colorado School of Mines, USA

* Finance and Registration Chair
- Maciej Zawoeniok, Missouri University of Science & Tech, USA

* WiP and Demo Co-Chairs
- Franca Delmastro, IIT-CNR, Italy
- Simone Silvestri, University of Kentucky, USA

* ​Industry Track Co-Chairs
- Bhaskar Krishnamachari, University of Southern California, USA
- Mallik Tatipamula, Ericsson Silicon Valley, USA

* Panel Chair
- Nikil Dutt, University of California, Irvine, USA

* Registration Chair
- Qi Alfred Chen, University of California, Irvine, USA

* Local Arrangements Committee
- Yasser Shoukry, University of California, Irvine, USA
- Salma Elmalaki, University of California, Irvine, USA

CONTACTS
For any Information about the conference, please contact the TPC Co-Chairs, Mohan Kumar (mjkvcs@rit.edu) and Valerie Issarny (Valerie.ISSARNY@inria.fr).

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

[DMANET] CFP ICAPAI 2021 : International Conference on APplied Artificial Intelligence 2021

International Conference on APplied Artificial Intelligence (ICAPAI
2020) <*www.icapai.org
<http://www.icapai.org>* >

Halden, Norway. 19 - 21 May 2021, Halden, Norway

(Technically Co-Sponsored by IEEE CIS Norway Section)

**** *Due to this pandemic situation, ICAPAI 2021 will be a digital
conference *****


The International Conference on Applied Artificial Intelligence (ICAPAI
2021) will provide an excellent international forum for sharing knowledge
and results in theory, methodology and applications of Artificial
Intelligence and Machine Learning in Industrial/Real-World settings. ICAPAI
2021 welcomes papers in all sub-areas of artificial intelligence and
machine learning. The conference aims to provide a platform to researchers
and practitioners from both academia and industry to meet and share
information about cutting-edge developments in the field. ICAPAI 2021 is
the rescheduled edition of ICAPAI 2020 which has been postponed due to the
pandemic situation for the COVID-19 outbreak.


Authors are welcome to contribute to the conference by submitting articles
that illustrate on-going research results, projects, surveying works and
industrial experiences that describe significant advances in all of the
related areas. Papers submitted to ICAPAI 2021 will undergo a double-blind
review process. All papers that are accepted and presented in ICAPAI 2021
will be published in the ICAPAI 2021 Conference Proceedings and included in
IEEE Xplore®. For papers that are accepted but not presented will not be
included in IEEE Xplore®, following IEEE No-Show Policy.


*There will be a special track on on-going research/applications of AI and
ML.* There will be a special track on on-going research/applications of AI
and ML. The goal of this track is to report on-going
developments/applications, as well as the associated research and
challenges in applying AI and ML to real-world and industrial problems.
ICAPAI 2021 seeks well-motivated and specific problems for which AI and ML
technology have already been deployed (maybe partial). Authors can report
the partial results with the motivation and idea behind such application.
Based on the quality of the submitted paper, it will be accepted as a
Full/Short paper. There will be (oral) presentation session for all of the
accepted papers as well as with posters.


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

- Development and deployment of AI applications to important domains
(i.e., healthcare, transportation, finance, cyber-physical systems,
manufacturing, business, government applications);
- Big data, data mining and machine learning tools;
- AI and ML based optimization methods for industrial/practical
applications;
- Deep learning, fuzzy and neural systems;
- AI/ML techniques in robotics;
- AI/ML methods for computer vision, image processing, pattern
recognition;
- Natural language processing, speech understanding;
- Evolutionary/bio-inspired algorithms;
- Explainable AI;
- Hybrid intelligent systems;
- Bioinformatics;
- Recent trends of AI in programming languages;
- Applied AI for cyber security;
- Heuristic and AI planning strategies and tools;
- Standards, ethics, legal implications and challenges of AI
implications in government and public organizations.


**** Important Dates ****

Submission deadline: January 18, 2021

Author notification: March 21, 2021

Camera ready due: April 15, 2021

Conference: May 19 – 21, 2021


*** The information and CFP are also available at www.icapai.org ***

Please send any inquiry on ICAPAI 2020 to the Organizing Committee:

General chair: Ricardo Colomo-Palacios (ricardo.colomo-palacios@hiof.no)

Program chair: Kazi Shah Nawaz Ripon (ksripon@hiof.no)

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

Saturday, January 2, 2021

[DMANET] CFP: Diagrams 2021

Hi,

The Twelfth conference DIAGRAMS will take place online with FREE registration in September 2021.

It accepts papers and abstracts from all areas of diagram research.
Please find its CFP bellow and at the following page:
http://www.diagrams-conference.org/2021/

The deadline for the pre-submission of all abstracts is April 1, 2021.

Best,
Mikkel

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

*** Call for Papers: Diagrams 2021 ***

12th International Conference on the Theory and Application of Diagrams
September 28 – 30, 2021
Virtual Event
www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021>

*** Highlights ***

- FREE REGISTRATION
- Proceedings published by Springer
- Three Tracks: Main, Philosophy, and Psychology and Education.
- Graduate Symposium
- Best Paper and Best Student Paper awards
- Submission dates in April 2021.
*****************************************************************
Diagrams is the only conference series that provides a united forum for all areas that are concerned with the study of diagrams and has a multidisciplinary emphasis.
For 2021, *MAIN TRACK* conference topics include, but are not limited to:
– applications of diagrams,
– computational models of reasoning with, and interpretation of, diagrams,
– design of diagrammatic notations,
– diagram understanding by humans or machines,
– diagram aesthetics and layout,– evaluation of diagrammatic notations,
– graphical communication and literacy,
– heterogeneous notations involving diagrams,
– history of diagrammatic notations,
– information visualization using diagrams,
– nature of diagrams and diagramming,
– novel technologies for diagram use,
– reasoning with diagrams,
– semiotics of diagrams,
– software to support the use of diagrams, and
– usability and human-computer interaction issues concerning diagrams.
In addition to the main track, Diagrams 2021 will have two further tracks: Philosophy, and Psychology and Education; for their topics of interest, see
http://www.diagrams-conference.org/2021/index.php/calls/main-track/
http://www.diagrams-conference.org/2021/index.php/calls/philosophy/
http://www.diagrams-conference.org/2021/index.php/calls/psychology-of-diagrams/.

If the main research contribution of your submission is considered to fit either of the other tracks then you are strongly encouraged to submit to the respective special track, each of which has a dedicated program committee.
Authors of accepted submissions will be expected to be in attendance at the virtual conference to present their research and respond to questions presented by delegates.
*****************************************************************
Submission Categories
The conference will include presentations of refereed Papers, Abstracts, and Posters, alongside a graduate symposium.
We invite submissions for peer review that focus on any aspect of diagrams research, as follows:
- Long Papers (16 pages),
- Abstracts (3 pages),
- Short Papers (8 pages),
- Posters (4 pages – this is both a maximum and minimum requirement).
More details and all important dates can be found on at www.diagrams-conference.org/2021<http://www.diagrams-conference.org/2021>.
*****************************************************************

________________________________
Mikkel Willum Johansen
Associate professor
Department of Science Education
University of Copenhagen
Tlf: (+45) 28 72 84 41



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

Friday, January 1, 2021

[DMANET] novel contributions for DCs - OR, Optimization, and Creativity (online, IFORS)

With best wishes for a Healthy and Happy Year of 2021


Novel documents joined - yours are welcome
IFORS Developing Countries Online Resources


The aim of the IFORS Developing Countries Online Resources page is to offer the OR worker all publicly-available materials on the topic of OR for Development. It also aims to provide a venue for people who are working in the area to share their completed or in-process work, learn from others, and stimulate comments and discussions on the work. Regarding IFORS Developing Countries OR resources website, its regular updates - and your possible submission of "free" (not copyright protected) material, you might occasionally visit

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

With this open resources page we aim to make research and application results better accessible to the many friends in the Developing Countries. We would be glad about interest.

Contributions from art and science, communication and education sectors are warmly welcome by our community which has very little access to emerging documents on arts and sciences, research, design and development.

"Operational Research" (OR) is the discipline of applying advanced analytical methods to help make better decisions. By using techniques such as problem structuring methods and mathematical modelling to analyze nontrivial situations, Operational Research gives executives the power to make more effective decisions and build more productive systems.

The International Federation of Operational Research Societies (IFORS; http://ifors.org/) is an almost 60-year old organization which is currently composed of 51 national societies. Regional Groups of IFORS are: ALIO (The Latin American Ibero Association on Operations Research), APORS (The Association of Asian-Pacific Operational Research Societies), EURO (The Association of European Operational Research Societies), NORAM (The Association of North American Operations Research Societies). IFORS conferences are taking place every three years. On IFORS 2021, Seoul, South Korea, August 22-27, 2021, please refer to http://www.ifors2020.kr/.

Thank you very much for your attention.

With kind regards,
best wishes

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