Friday, September 24, 2021

[DMANET] ETAPS 2022 2nd joint call for papers

Why choose ETAPS?

- ETAPS is one of the world's leading fora for research on software
science, with a history of more than 25 years.
- The proceedings of ETAPS appear in gold open access, with no article
processing charge for the authors specifically.
- ETAPS has low participation fees for all and for students in
particular.

New in 2022:

- Like FASE for several years already, ESOP will also use double-blind
review this time.
- FASE has a new paper category of new ideas and emerging results
(NIER) papers.
- The pre-paper-acceptance artifact submission deadline for TACAS is
now a little later than the paper submission deadline.
- ESOP and FASE welcome voluntary submission of artifacts for
evaluation after paper acceptance; the outcome will not change the
paper acceptance decision.
- Among the satellite events, there is a PhD student mentoring
workshop.


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

JOINT CALL FOR PAPERS

25th European Joint Conferences on Theory and Practice of Software
ETAPS 2022

Munich, Germany, 2-7 April 2022

https://etaps.org/2022

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

-- ABOUT ETAPS --

ETAPS is the primary European forum for academic and industrial
researchers working on topics relating to software science. ETAPS,
established in 1998, is a confederation of four annual conferences,
accompanied by satellite workshops. ETAPS 2022 is the twenty-fifth
event in the series.


-- MAIN CONFERENCES (4-7 April) --

* ESOP: European Symposium on Programming
(PC chair: Ilya Sergey, Yale-NUS College and
National University of Singapore, Singapore)
* FASE: Fundamental Approaches to Software Engineering
(PC chairs:Einar Broch Johnsen, University of Oslo, Norway,
and Manuel Wimmer, Johannes Kepler Universität Linz, Austria)
* FoSSaCS: Foundations of Software Science
and Computation Structures
(PC chairs: Patricia Bouyer, CNRS, LMF, France,
and Lutz Schröder, FAU Erlangen-Nürnberg, Germany)
* TACAS: Tools and Algorithms for
the Construction and Analysis of Systems
(PC chairs: Dana Fisman, Ben-Gurion University of the Negev,
Israel, and Grigore Rosu, University of Illinois at
Urbana-Champaign, USA)
TACAS '22 will host the 11th Competition on Software Verification
(SV-COMP).


-- INVITED SPEAKERS --

* Unifying speakers:
Alexandra Silva (University College London, UK /
Cornell University, USA)
Tomáš Vojnar (Brno University of Technology, Czechia)
* FoSSaCS invited speaker:
Nathalie Bertrand (Inria Rennes, France)
* TACAS invited speaker:
Lenore Zuck (University of Illinois at Chicago, USA)

* Tutorial speakers:
Stacey Jeffery (CWI and QuSoft, The Netherlands)
a further tutorial speaker tba


-- IMPORTANT DATES

* Paper submission
(also, pre-paper-acceptance artifact registration (TACAS)):
14 October 2021 23:59 AoE
* Pre-paper-acceptance artifact submission (TACAS):
4 November 2021 23:59 AoE
* Rebuttal (ESOP, FoSSaCS and, partially, TACAS):
7 December 00:01 AoE - 9 December 2021 23:59 AoE
* Paper notification: 23 December 2021
* Post-paper-acceptance artifact submission (ESOP, FASE, TACAS):
5 January 2022 23:59 AoE
* Paper final versions: 26 January 2022
* Artifact notification: 16 February 2022


-- SUBMISSION INSTRUCTIONS --

The four main conferences of ETAPS 2022 solicit contributions of the
following types. All page limits are given **excluding the
bibliography**.

* ESOP: regular research papers of max 25 pp
* FASE: regular research papers and empirical evaluation papers of
max 18 pp,
new ideas and emerging results (NIER) papers of max 8 pp,
tool demonstration papers of max 6 pp (+ mandatory appendix of max
6 pp),
* FoSSaCS: regular research papers of max 18 pp
* TACAS: regular research papers, case study papers and regular tool
papers of max 16 pp,
tool demonstration papers of max 6 pp

For definitions of the different paper types and specific
instructions, where they are present, see the webpages of the
individual conferences.

All accepted papers will appear in the proceedings and have
presentations during the conference. A condition of submission is
that, if the submission is accepted, one of the authors attends the
conference to give the presentation. We plan ETAPS 2022 as a hybrid
conference; remote attendance and presentation will be possible.

Submitted papers must be in English presenting original research. They
must be unpublished and not submitted for publication elsewhere. In
particular, simultaneous submission of the same contribution to
multiple ETAPS conferences is also forbidden.

Submissions must follow the formatting guidelines of Springer's LNCS
(use the llncs.cls class) and be submitted electronically in pdf
through the Easychair author interface of the respective
conference. Submissions not adhering to the specified format and
length may be rejected immediately.

ESOP and FASE will use **double-blind reviewing**. Authors are asked
to omit their names and institutions; refer to prior work in the third
person, just as prior work by others; not to include acknowledgements
that might identify them.

ESOP and FoSSaCS will use an **author rebuttal phase**. TACAS will use
rebuttal for selected submissions (those in the gray zone).


Artifact submission and evaluation

Regular tool paper and tool demonstration paper submissions to TACAS
must be accompanied by an artifact submitted shortly after the
paper. The artifact will be evaluated and the outcome will be taken
into account in the acceptance decision of the paper.

For research paper and case study paper submissions,
pre-paper-acceptance submission of an artifact is optional; if an
artifact is submitted at this point, it will be handled like described
above.

Alternatively, authors of papers of these categories may submit an
artifact for evaluation after the paper has been accepted. The outcome
of the artifact evaluation will then not change the paper acceptance
decision.

ESOP and FASE will also have artifact evaluation, but participation in
it is voluntary; the artifact submission deadline is after the paper
notification deadline. The outcome will not alter the paper acceptance
decision.

For specific instructions regarding artifacts, see the webpages of the
individual conferences.


-- PUBLICATION

The proceedings will be published in the Advanced Research in
Computing and Software Science (ARCoSS) subline of Springer's LNCS
series. The proceedings volumes will appear in gold open access, so
the published versions of all papers will be available for everyone to
download from the publisher's website freely, from the date of online
publication, perpetually. The copyright of the papers will remain with
the authors.


-- BEST PAPER AWARDS

The strongest papers of the four conferences will be nominated for the
ETAPS best paper awards of EAPLS, EASST and EATCS.

The ETAPS test of time award recognizes outstanding papers
published at ETAPS more than 10 years in the past.


-- SATELLITE EVENTS (2-3 April) --

A number of satellite workshops and other events will take place
before the main conferences:

CMCS, COOP, HCVS, LiVe, MARS, MSFP, PLACES, QAVS, RRRR, Rust Workshop,
SynCop, VerifyThis, VPT, WRLA

Also in the satellite events program is a Mentoring Workshop.

For closer information, check https://etaps.org/2022/workshops .


-- CITY AND HOST INSTITUTION --

Munich, Germany, is the capital and most populous city of
Bavaria. Nowadays, the city is a global center of art, science,
technology, finance, publishing, culture, innovation, education,
business, and tourism. It is home to Ludwig Maximilian's University
(LMU) and Technische Universität München (TUM), many scientific
institutions, and world-class technology and science museums such as
Deutsches Museum and BMW Museum.

Iconic places to visit in Munich include the Munich Residenz,
Marienplatz, the Old Town Hall, the famous Glockenspiel on the New
Town Hall, the Frauenkirche, the English Garden, the Olympic Park and
Nymphenburg Palace.

The conference will be hosted by Technische Universität München.


-- ORGANIZERS --

General chair: Jan Křetínský (Technische Universität München, Germany)

Workshops chair: Dirk Beyer (Ludwig-Maximilians Universität München,
Germany)

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

[DMANET] FINAL CFP - 13th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2021) - Springer LNNS Series (SCOPUS Indexed)

** FINAL Call for Papers - please circulate this CFP to your colleagues and
networks **

-- 13th International Conference on Soft Computing and Pattern Recognition
(SoCPaR 2021) --

http://www.mirlabs.org/socpar21
http://www.mirlabs.net/socpar21

On the World Wide Web

December 15-17,2021

Proceedings of SoCPaR'21 will be published in Lecture Notes in Networks and
Systems, Springer (Indexed in SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH,
SCImago).
<https://www.springer.com/series/15179>

SoCPaR 2020 Proceedings:https://www.springer.com/gp/book/9783030736880
History of SoCPaR series: http://www.mirlabs.net/socpar20/previous.php

**Important Dates**
---------------------
Paper submission due: September 30, 2021
Notification of paper acceptance: October 31, 2021
Registration and Final manuscript due: November 15, 2021
Conference: December 15-17, 2020

**About SoCPaR 2021**
---------------------
After the success of the 12th International Conference on Soft Computing
and Pattern Recognition (SoCPaR 2020), SoCPaR 2021 is organized to bring
together worldwide leading researchers and practitioners interested in
advancing the state-of-the-art in Soft Computing and Pattern Recognition,
for exchanging knowledge that encompasses a broad range of disciplines
among various distinct communities. It is hoped that researchers and
practitioners will bring new prospects for collaboration across disciplines
and gain inspiration to facilitate novel breakthroughs. The themes for this
conference are thus focused on "Innovating and Inspiring Soft Computing and
Intelligent Pattern Recognition".

**Topics (not limited to)**
---------------------------
Soft Computing and Applications (but not limited to):
Evolutionary computing
Swarm intelligence
Artificial immune systems
Fuzzy Sets
Uncertainty analysis
Fractals
Rough Sets
Support vector machines
Artificial neural networks
Case Based Reasoning
Wavelets
Hybrid intelligent systems
Nature inspired computing techniques
Machine learning
Ambient intelligence
Hardware implementations

Pattern Recognition and Applications (but not limited to):
Information retrieval
Data Mining
Web Mining
Image Processing
Computer Vision
Bio-informatics
Information security
Network security
Steganography
Biometry
Remote sensing
Medical Informatics
E-commerce
Signal Processing
Control systems

**Submission Guidelines**
-------------------------
Submission of paper should be made through the submission page from the
conference web page.
Please refer to the conference website for guidelines to prepare your
manuscript.

Paper format templates:
https://www.springer.com/de/authors-editors/book-authors-editors/manuscript-preparation/5636#c3324

SoCPaR'21 Submission Link:
https://easychair.org/conferences/?conf=socpar2021

**Plenary Talks**
-----------------------------
You are welcome to attend 8 Keynote Talks offerred by world-renowned
professors and industry leaders. The detailed information is available on
conference website.

Speaker 1: Antônio de Padua Braga, Federal University of Minas Gerais,
Brazil
Title: Large margin classification with graph-based models

Speaker 2: Juergen Branke, University of Warwick, Coventry, United Kingdom
Title: Learning to optimise – optimal learning

Speaker 3: Oscar Cordon, University of Granada, Spain
Title: Hybrid Intelligent Systems for Forensic Anthropology and Human
Identification

Speaker 4: Kalyanmoy Deb, Michigan State University, USA
Title: TBA

Speaker 5: Marco Dorigo, Université Libre de Bruxelles, Belgium
Title: TBA

Speaker 6: Frédéric Guinand, Le Havre Normandy University, France
Title: Swarms of Unmanned Aerial Vehicles

Speaker 7: Günther Raidl, Technische Universität Wien, Austria
Title: Combinatorial Optimization Meets (Reinforcement) Learning

Speaker 8: Cengiz Toklu, Beykent University, Istanbul, Turkey
Title: Hybrid Algorithms. Applications to Structural Mechanics

** SoCPaR 2021 Organization **
------------------------------
General Chairs
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Andries Engelbrecht, Stellenbosch University, South Africa
Fabio Scotti, Universita' degli Studi di Milano, Italy

Program Chairs
Giancarlo Fortino, Università della Calabria, Italy
Virgilijus Sakalauskas, Vilnius University, Lithuania
Sabri Pllana, Linnaeus University, Sweden

**Technical Contact**
---------------------
Dr. Ajith Abraham
Email: ajith.abraham@ieee.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] CfP: Special Issue on Data-driven optimization and analytics for maritime logistics (FSM, Springer)

CALL FOR PAPERS - FLEXIBLE SERVICES AND MANUFACTURING
https://www.springer.com/journal/10696
Special Issue on Data-driven optimization and analytics for maritime
logistics
----------------------------------------------------------------------------------------------------
New Submission Deadline: October 31, 2021

Like many other industries, maritime logistics is more and more driven by
optimization and analytics to make the best out of the wealth of data that
is generated through modern technologies. This opens up lots of research
questions in areas such as the operations management of autonomous ships
and port equipment, a better understanding of markets through the analysis
of demands and price data, new forms of collaborations and many more.
Emerging innovations can support all kinds of actors from the maritime
logistics industry in making better decisions, reaching higher levels of
performance, becoming more sustainable and, eventually, improving their
competitiveness. Research has to support and advance this by the
development of novel models and algorithms for analyzing the available data
and using it to provide valuable decision support.

This special issue of the Flexible Services and Manufacturing (FSM) Journal
aims to address challenges and explore the opportunities related to
maritime logistics from such perspectives. We are especially seeking papers
introducing new concepts, defining new problems, and developing new
methodologies and models to exploit the wealth of data generated by the
maritime logistics industry.

The special issue includes, but is not limited to, the following topics.

• Analytics in maritime logistics systems, especially predictive and
prescriptive analytics
• Data science and engineering, cloud technologies in maritime logistics
systems
• Optimization modeling and simulation analysis of maritime logistics
systems
• Robust optimization in maritime logistics systems
• Performance measures and efficiency analysis in maritime logistics systems
• Scheduling in maritime logistics systems
• Automation in port operations
• Terminal design and operations
• Real-time control of logistics activities in container terminals
• Stowage planning in maritime transportation
• Multimodal transportation systems
• Onshore transportation of containers
• Design of maritime transportation networks
• Freight rates and markets
• Carrier alliances and collaborative logistics
• Ship routing and fleet management
• Empty container management
• Autonomous ship operations
• Shipping maintenance and warehouse services
• Shipping revenue management
• Risk and resilience in maritime transportation
• Environmental and sustainability issues in maritime transportation
• Theoretical and/or empirical analysis of data-driven applications in
maritime transportation

Submission Guidelines:
Papers must clearly address research issues of logistics and maritime
transportation chains. Please submit your paper online via
http://www.editorialmanager.com/flex/ and select "Data-driven optimization
and analytics for maritime logistics" when being asked for additional
information. The target print publication date is December 2022.

The submitted papers must not have been previously published or be
currently under consideration for publication elsewhere. All papers will be
reviewed according to the standards of the FSM journal. We will adopt a
rapid and fair review process in order to meet the target publication date.
Please feel free to contact the editors with any questions.

Special issue editors:
Prof. Dr. Kjetil Fagerholt, Norwegian University of Science and Technology,
Norway
Email: kjetil.fagerholt@iot.ntnu.no

Dr. Leonard Heilig, University of Hamburg, Germany
Email: leonard.heilig@uni-hamburg.de

Dr. Eduardo Lalla-Ruiz University of Twente
Email: e.a.lalla@utwente.nl

Prof. Dr. Frank Meisel, Kiel University, Germany (leading editor)
Email: meisel@bwl.uni-kiel.de

Dr Shuaian (Hans) Wang, The Hong Kong Polytechnic University, Hong Kong
Email: wangshuaian@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/
*
**********************************************************

Thursday, September 23, 2021

[DMANET] PhD position at TU Berlin

Institute of Mathematics
Technische Universität Berlin

PhD position in Discrete Mathematics
Research Assistant (75% TV-L 13)
for 36 months

A PhD position is available in the "Discrete Mathematics Group"
at TU Berlin. The position is in the DFG-NCN project "Order and Geometry".
This is a joint project between the groups of Stefan Felsner in Berlin
and the group of Piotr Micek at Jagiellonian University Krakow.
The research within the project ranges from coloring problems
to encodings mostly in relation to graphs and orders defined in a
geometric setting. For a more detailed description see
(page.math.tu-berlin.de/~felsner/o+g-short.pdf).

Candidates should have an excellent academic degree in mathematics,
computer science or a related area, and must have very good knowledge
in discrete mathematics. Communication skills and solid English
writing skills are expected. Special knowledge in combinatorial geometry or
combinatorics of partially ordered sets are desirable.

Besides its many cultural attractions, Berlin offers a strong
scientific landscape including three major universities. The MATH+
cluster promoted by the German Excellence Initiative, and the DFG
research training group "Facets of Complexity" offer
opportunities for joint research and support for PhD students and
postdocs (e.g., meetings, lecture series, summer schools etc.).

Applicants should send their application as *a single pdf* file containing:
- cover and motivation letter
- curriculum vitae
- copies of diplomas
- summary of thesis (max. 2 pages)
- names and contact details of a referee e.g. a thesis advisor

by

October 8, 2021

to

Prof. Dr. Stefan Felsner
felsner@math.tu-berlin.de
http://page.math.tu-berlin.de/~felsner
................................................................


**********************************************************
*
* 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] WALCOM 2022 - Submission Deadline is Approaching

The 16th International Conference and Workshops on Algorithms and Computation
March 24 - March 26, 2022
University of Jember, Indonesia

Call for papers
================

The 16th International Conference and Workshops on Algorithms and Computation
(WALCOM 2022) is intended to provide an international forum for researchers working
in the areas of algorithms and computation. WALCOM 2022 will be held during
March 24 - 26, 2022 at the University of Jember, Jember, East Java, Indonesia. Based on
the COVID-19 situation at the time of the conference, the event will be held physically or in
hybrid mode or fully virtually.

SCOPE
======

The range of topics within the scope of WALCOM includes but is not limited to:
- Approximation Algorithms
- Algorithmic Data Science
- Algorithm Engineering and Experimental Algorithmics
- Algorithmic Graph Theory and Combinatorics
- Combinatorial Algorithms
- Combinatorial Optimization
- Computational Biology
- Computational Complexity
- Computational Geometry
- Computational Network Science
- Cryptographic Algorithms
- Data Compression Algorithms
- Data Structures
- Discrete Geometry
- Enumeration Algorithms
- Graph Algorithms
- Graph Drawing
- Graph Labeling
- Parallel and Distributed Algorithms
- Parameterized Algorithms
- Parameterized Complexity
- Network Optimization
- Online Algorithms
- Randomized Algorithms
- String Algorithms
- Visualization Algorithms


INSTRUCTIONS FOR AUTHORS
========================

Authors are invited to submit papers (extended abstracts) describing original research
of theoretical or practical significance to algorithms and computation. Papers should
not exceed 12 pages in LNCS style. Papers significantly shorter than 12 pages are also
welcome. If the authors feel that more details are essential to substantiate the main
claim of the paper, they may include a clearly marked appendix that will be read at
the discretion of the Program Committee.
Only electronic submissions via EasyChair will be allowed (https://easychair.org/conferences/?conf=walcom2022).

Papers submitted for review should represent original, previously unpublished work or
surveys of important results. At the time the paper is submitted to WALCOM 2022, and
for the entire review period, the paper (or essentially the same paper) should not be
under review by any other conference with published proceedings or by a scientific journal.
At least one author of each accepted paper will be expected to register at the conference and
present the paper.

AWARDS
=======

Two awards, namely, "The Best Paper" and "The Best Student Paper" will be awarded.
A paper is eligible for the Best Student Paper if the paper is presented by an author, who is a full-time student.
The best paper awards will be sponsored by Springer.

PROCEEDINGS AND JOURNAL SPECIAL ISSUES
=====================================

Accepted papers will be published in the conference proceedings. Following the tradition of
the previous editions of WALCOM the proceedings will be included in the Springer-Verlag series,
Lecture Notes in Computer Science.
Authors of selected papers will be invited to submit extended versions of their papers to
Journal special issues in Algorithmica, Theoretical Computer Science (TCS) and Journal of Graph Algorithms
and Applications (JGAA).


IMPORTANT DATES
================

Paper submission deadline: September 28, 2021 (Anywhere on Earth)
Notification of Acceptance/Rejection: November 09, 2021
Camera-ready Submission and Author Registration: November 30, 2021
Conference Dates: March 24 - 26, 2022

INVITED SPEAKERS
====================

Prof. Hans L. Bodlaender
Utrecht University and Technical University Eindhoven, The Netherlands

Prof. Tiziana Calamoneri
University of Rome "Sapienza", Italy

Prof. Takehiro Ito
Tohoku University, Japan


PROGRAM COMMITTEE
====================

Arijit Bishnu, ISI Kolkata, India
Aritra Banik, NISER, India
Hans Bodlaender; Utrecht University, the Netherlands
Siu-Wing Cheng, Hong Kong University of Science and Technology, Hong Kong
Marek Chrobak, University of California, Riverside, USA
D. Dafik, Universitas Jember, Indonesia
Minati De, IIT Delhi, India
Mark de Berg,; TU Eindhoven, the Netherlands
Henning Fernau,; University of Trier, Germany
Guillaume Fertin, University of Nantes; France
Fedor V. Fomin, University of Bergen, Norway
Neelima Gupta, Delhi University, India
Xin Han, Dalian University of Technology, China
Seok-hee Hong, University of Sydney, Australia
Stephen Kobourov, University of Arizona, USA
Jan Kratochvil, Charles University in Prague, Czeck Republic
Giuseppe Liotta, University of Perugia, Italy
Debajyoti Mondal, University of Saskatchewan, Canada
Petra Mutzel (Chair), University of Bonn, Germany
Shinichi Nakano, Gunma University, Japan
Maurizio Patrignani, Universita Roma Tre, Italy
M. Sohel Rahman, BUET, Bangladesh
Md. Saidur Rahman (Chair), BUET, Bangladesh
S. Slamin (Chair), Universitas Jember, Indonesia
Kiki Ariyanti Sugeng, University of Indonesia, Indonesia
Wing-Kin Sung, NUS, Singapore
Etsuji Tomita, The University of Electro-Communications, Japan
Ryuhei Uehara, Japan Advanced Institute of Science and Technology (JAIST), Japan
Sue Whitesides, University of Victoria, Canada
Mingyu Xiao, University of Electronic Science and Technology of China
Hsu-Chun Yen, National Taiwan University, Taiwan
Xiao Zhou, Tohoku University, Japan


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

Contact: slamin@unej.ac.id, saidurrahman@cse.buet.ac.bd
Conference website: https://walcom2022.unej.ac.id/
Submission link: https://easychair.org/conferences/?conf=walcom2022
Log in to EasyChair for WALCOM 2022<https://easychair.org/conferences/?conf=walcom2022>
EasyChair uses cookies for user authentication. To use EasyChair, you should allow your browser to save cookies from easychair.org.
easychair.org


--------------------------------------------------------
Dr. Md. Saidur Rahman
Professor
Department of Computer Science and Engineering
Bangladesh University of Engineering and Technology (BUET)
ECE Building, BUET
West Palashi
Dhaka-1205, Bangladesh
https://saidurrahman.buet.ac.bd/



**********************************************************
*
* 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] IoTNAT 2021 CFP:The 7th International Workshop on Internet of Things: Networking Applications and Technologies , Gandia, Spain. December 6-9, 2021

The 7th International Workshop on Internet of Things: Networking
Applications and Technologies (IoTNAT 2021)
<http://emergingtechnet.org/IOTNAT2021/index.php>

in conjunction with

The 6th International Conference on Fog and Mobile Edge Computing (FMEC
2021) <http://emergingtechnet.org/FMEC2021/index.php>

Gandia, Spain. December 6-9, 2021

*IoTNAT 2021 CFP*

The Internet of Things (IoT) technology offers unprecedented opportunities
to interconnect human beings as well as Machine-to-Machine (M2M), whereby
sensors and networks allow all 'things' to communicate directly with each
other to share vital information allowing us to have an instrumented
universe where accurate data is readily available to inform optimal
decision making. The IoT is about to enable a range of new capabilities and
services far beyond today's offerings. It will fundamentally change how
people go about their lives. According to Gartner, the number of objects
connected to the Internet is set to reach 20 billion by 2021. Cisco
estimates the number will be close to 26 billion objects by 2021. Others
believe the actual number will be even higher with the assumption that any
object with a simple micro controller and on-off switch will be connected
to the Internet in the near feature. The scale of the IoT is set to have a
major economic, social and environmental impacts; the intersection of which
forms the future sustainable growth. The IEEE International Workshop on
Internet of Things: Networking Applications and Technologies (IoTNAT 2021)
Symposium will be held in conjunction with The Fifth International
Conference on Fog and Mobile Edge Computing (FMEC 2021). The IoTNAT 2021
Symposium aims at soliciting original ideas on the broad area of IoT
including challenges and opportunities, concepts and applications and
future trends. The Symposium aims to facilitate discussions among academics
and IoT practitioners and make positive contributions to the field. Authors
are invited to submit original, unpublished manuscripts. Submitted papers
should be in accordance with IEEE format, and will be reviewed by at least
two expert reviewers in terms of relevance, originality, contribution,
correctness, and presentation.

The topics of interest include but are not limited to:

Emerging concepts of IoT

Design methodologies for IoT

Novel services and applications of IoT to facilitate environmental
responsibility

Green by Internet of Things

IoT and Social benefits/impact

IoT Economics

Emerging Internet of Things business models and process changes

Communication systems and network architectures for the IoT

IoT and Data Management

Security and privacy of IoT

Reliability of IoT

Disaster recovery in IoT

Applications of Internet of things

Emerging applications and interaction paradigms for everyday citizens

Big data and IoT

Self-organizing IoT

Cloud Computing and IoT

IoT and sustainable Growth

*Submission*

Papers selected for presentation will appear in the FMEC Proceedings, which
will be submitted to IEEE Xplore for inclusion. Papers must be 6 pages max
in IEEE format, 10pt font using the IEEE 8.5" x 11" two-column format,
single space, A4 format. All papers should be in PDF format, and submitted
electronically at Paper Submission Link. A full paper must not exceed the
stated length (including all figures, tables and references).

Submitted papers must present original unpublished research that is not
currently under review for any other conference or journal. Papers not
following these guidelines may be rejected without review. Also submissions
received after the due date, exceeding length limit, or not appropriately
structured may also not be considered. Authors may contact the Program
Chair for further information or clarification.

*Important Dates:*

Submission Date: 5 Oct, 2021

Notification to Authors: 21 Oct, 2021

Camera Ready Submission: 30th Oct, 2021

Please send any inquiry to Emerging Tech. Network Team at:
emergingtechnetwork@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/
*
**********************************************************

Wednesday, September 22, 2021

[DMANET] Metabolism and mathematical models: Two for a tango

Dear all,

This is the 1st announcement for a workshop titled "Metabolism and mathematical
models: Two for a tango" that will take place in a virtual way on November 18-19, 2021.

As the title indicates, the topic of the workshop is metabolism in general, with a special
focus, although not exclusive, on parasitology. Besides an exploration of the biological,
biochemical and biomedical aspects, the workshop will also aim at presenting some of
the mathematical modelling, algorithmic theory and software development that have
become crucial to explore such aspects.

More details will be provided soon but initial information may be already found on
this page:
https://team.inria.fr/erable/en/events/metabolism-and-mathematical-models-two-for-a-tango/.

As you can see, we'll be very happy to have six Keynote speakers:
Michael Barrett, University of Glasgow, Scotland;
Frédéric Bringaud, University of Bordeaux, France;
Fabien Jourdan, Inrae Toulouse, MetaboHUB, France;
Daniel Merkle, University of Southern Denmark, Denmark;
Daniel Segrè, Boston University, US;
Alena Zikova, Institute of Parasitology, Czech Academy of Sciences, Czech Republic.

The workshop will take place in the afternoons, from 2pm to 5:30pm CET time.
Registration is free but is required. To register, go to this link:
https://www.eventbrite.com/e/workshop-metabolism-and-mathematical-models-two-for-a-tango-tickets-175493324257

If you are interested, keep tuned, both on your mails for the 2nd announcement
with all information, and on the web page of the workshop.

Cheers from the organisers,
Ariel Silber (Dept. of Parasitology, Institute of Biomedical Sciences, Univ. of São Paulo, Brazil)
and Marie-France Sagot (Inria, CNRS and Univ. of Lyon 1, France)
**********************************************************
*
* 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: "Surveys in Algorithm Analysis and Complexity Theory" special issue of Algorithms

CALL FOR PAPERS:
"Surveys in Algorithm Analysis and Complexity Theory" -- A special issue of
Algorithms (ISSN 1999-4893)

This is a special issue consisting of surveys in theoretical computer science.
We invite original articles summarizing recent breakthroughs and/or describing
the state of the art in any currently active research area related to
algorithms, data structures, or computational complexity.
Articles should be well-structured, and each article should focus on a clearly
defined topic.
In addition, sufficient background, definitions, and figures should be provided
to ensure that the text will be accessible to anyone interested in theoretical
computer science.
Implementation-based surveys that compare the practical performance of various
algorithms for a particular computational problem are also invited.
We hope that the surveys published in this special issue will be useful for
other researchers and become highly cited in the near future.

Guest Editor:
Dr. Jesper Jansson, Kyoto University, Japan

Keywords:
* algorithm analysis
* modern data structures
* computational complexity
* fixed-parameter tractability
* approximation algorithms
* lower bounds
* bioinformatics algorithms
* computational geometry
* parallel and distributed computing
* quantum computing

Submission information:
Submitted manuscripts should not have been published previously nor be under
consideration for publication elsewhere.
All submissions will be thoroughly refereed through a peer-review process.
Manuscripts should be submitted online after registering and logging in.
Accepted articles will be published continuously in the journal (as soon as
accepted) and will be listed together on the special issue website.
A guide for authors and other information related to the submission of
manuscripts is available on the "Instructions for Authors"-page.
The article processing charges for publication in this open-access journal are
also listed on the journal's webpage.
We are glad to announce that the journal is offering an exceptional "early bird
discount" (100% discount) on the article processing charges for articles
submitted by 2021-11-15.

Deadline:
The deadline for manuscript submissions is 2022-06-30.

About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is an open-access journal of
computer science, computational mathematics, artificial intelligence,
automation and control systems, theory, methods and interdisciplinary
applications, data and information systems, and software engineering.
It is published online monthly by MDPI.

Journal webpage:
https://www.mdpi.com/journal/algorithms

Special issue main webpage:
https://www.mdpi.com/journal/algorithms/special_issues/survey_algorithm_complexity

Instructions for authors:
https://www.mdpi.com/journal/algorithms/instructions

Submission:
https://susy.mdpi.com/user/manuscripts/upload/?journal=algorithms



**********************************************************
*
* 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] [Scheduling seminar] Leah Epstein (University of Haifa) | September 29 | The benefit of preemption

We are delighted to announce the talk given by Leah Epstein (University
of Haifa).

The title is "The benefit of preemption".

The seminar will take place on Zoom on Wednesday, September 29 at 13:00 UTC.

Join Zoom Meeting
https://cesnet.zoom.us/j/97989356749?pwd=T2NzMkszN2Y1RDNNZExTc3p0SjJDdz09
<https://cesnet.zoom.us/j/97989356749?pwd=T2NzMkszN2Y1RDNNZExTc3p0SjJDdz09>

Meeting ID: 979 8935 6749
Passcode: 307940

You can follow the seminar online or offline on our Youtube channel as
well:

https://www.youtube.com/channel/UCUoCNnaAfw5NAntItILFn4A

The abstract follows.

Given an input of a scheduling problem, any non-preemptive solution for
it can be used as a preemptive solution. Thus, the optimal cost of a
preemptive solution is not larger than that of an optimal non-preemptive
solution. As preemption comes at a cost in real-life applications, it is
of interest to find the worst-case ratio between the two costs. For a
given problem, the supremum ratio over all possible inputs of the ratio
between the two costs (of an optimal solution without preemption and an
optimal solution that possibly uses preemption) is called the power or
benefit of preemption. While many scheduling variants can be studied
with respect to this measure, we will focus on the cases of a single
machine, parallel identical machines, and uniformly related machines,
and we will discuss the objectives of makespan and total (weighted)
completion time. We will exhibit how one can benefit from preemption,
and we will analyze the resulting worst case ratios for several basic
models.

The next talk in our series will be given by

Federico Della Croce (DIGEP - Polito.it) | October 13 | The Longest
Processing Time Rule for Identical Parallel Machines Revisited.

For more details, please visit https://schedulingseminar.com/

With kind regards

Zdenek, Mike and Guohua

--
Zdenek Hanzalek
Industrial Informatics Department,
Czech Institute of Informatics, Robotics and Cybernetics,
Czech Technical University in Prague,
Jugoslavskych partyzanu 1580/3, 160 00 Prague 6, Czech Republic
https://rtime.ciirc.cvut.cz/~hanzalek/


**********************************************************
*
* 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, September 21, 2021

[DMANET] Denes Konig Prize Call for Nomination

Do you know a colleague in the early stages of their career who has made an outstanding contribution to the field of discrete mathematics? SIAM is currently accepting nominations for the Denes Konig Prize!

This prize will be awarded in 2022 at the next SIAM Conference on Discrete Mathematics.


Click the link below for the full prize specifications and requirements.


DENES KONIG PRIZE<https://www.siam.org/prizes-recognition/activity-group-prizes/detail/siag-dm-denes-konig-prize>

This prize is awarded every two years to an individual or individuals in their early career for outstanding research contributions in an area of discrete mathematics, as evidenced by a publication in a peer-reviewed journal within the three calendar years prior to the award year.

To qualify for the 2022 award, the following criteria must be met:

* Key paper published in English between January 1, 2019 - December 31, 2021.
* Paper must be published in a peer-reviewed journal in the 3 years prior to the award year.
* Each candidate must be a graduate student or have been awarded PhD no earlier than 2018.

Click Here to Submit a Nomination!<https://siam2022.secure-platform.com/a/solicitations/9/home>


**********************************************************
*
* 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] Faculty positions in Industrial and Operations Engineering, University of Michigan

The Department of Industrial and Operations Engineering at the University
of Michigan invites applications and nominations for faculty positions
beginning September 2022.

We seek outstanding candidates for faculty positions at all levels
including assistant, associate, and full professor. Our department is
highly multidisciplinary, with a balance of theoretical and methodological
research and applied research interests. From a methodological perspective,
we will be considering candidates in all areas related to Industrial and
Operations Engineering, including Operations Research, Human-System
Integration, Data Analytics, and related disciplines. The many application
areas in the department include operations management, health and human
safety, energy and sustainability, mobility and transportation, public
policy, manufacturing, and robotics. Candidates must have, or be near
completion of a Ph.D., and must demonstrate a strong commitment to
high-quality research and evidence of teaching potential.

Please submit your application to the following:
https://ioe.engin.umich.edu/about/careers/

Candidates should provide (i) a current C.V., (ii) a list of at least three
references, and three summary statements of up to two pages each
describing, respectively: (iii) career teaching plans; (iv) research plans;
and (v) activities, contributions, or plans related to supporting
diversity, equity, and inclusion. For candidates with prior teaching
experience, please provide (vi) a summary of course (teaching) evaluations.
Candidates should also have their references send three letters of
recommendation to us directly at IOEFacultySearch@umich.edu .

Applications will be reviewed on a rolling basis until appointments are
finalized. For full consideration, candidates are encouraged to apply by
October 15, 2021.

Michigan Engineering's vision is to be the world's preeminent college of
engineering serving the common good. This global outlook, leadership focus,
and service commitment permeate our culture. Our vision is supported by a
mission and values that, together, provide the framework for all that we
do. Information about our vision, mission, and values can be found at:
http://strategicvision.engin.umich.edu/

We seek faculty members who commit to excellence in graduate and
undergraduate education, will develop impactful, productive and novel
research programs, and will contribute to the department's goal of
eliminating systemic racism and sexism by embracing our culture of
Diversity, Equity and Inclusion (DEI). We are especially interested in
candidates who can build collaborative ties with other departments within
the College of Engineering and the University. The University of Michigan
is responsive to the needs of dual career families.

If you have any questions regarding the web application submittal process
or other inquiries, please contact Akosua Dow, akosuad@umich.edu .

U-M COVID-19 Vaccination Policy: COVID-19 vaccinations are now required for
all University of Michigan students, faculty and staff across all three
campuses, including Michigan Medicine, by the start of the fall term on
August 30, 2021. This includes those working or learning remotely.

The University of Michigan is a non-discriminatory, affirmative action
employer.


--
Viswanath Nagarajan
Associate Professor
Industrial and Operations Engineering
University of Michigan
Web: http://viswa.engin.umich.edu/

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

[DMANET] Postdoctoral Fellowship at Edinburgh

A 3-year postdoctoral fellowship in computer science is available in
the School of Informatics, University of Edinburgh. This post is part
of Dr He Sun's EPSRC Early Career Fellowship on Efficient Spectral
Algorithms for Massive and Dynamic Graphs, and the post holder is
expected to work on graph clustering, and graph sparsification. Hence,
we would in particular welcome candidates with research experience in
clustering, spectral graph theory, streaming and sublinear algorithms,
and numerical linear algebra.

The post is available from January 1 2022, and will be for 3 years. An
earlier start date before January 2022 is negotiable. The deadline for
application is 24 September 2021.

More information about the post including the link for application can
be found at https://bit.ly/3zwJLjv

Informal enquiries are welcome and could be sent to He Sun ( h.sun@ed.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] Final CFP - 21st International Conference on Intelligent Systems Design and Applications - Springer LNNS Series (SCOPUS Indexed)

** FINAL Call for Papers


-- The 21st International Conference on Intelligent Systems Design and
Applications (ISDA'21) –-

http://www.mirlabs.org/isda21
http://www.mirlabs.net/isda21

On the World Wide Web

December 13-15, 2021

Proceedings of ISDA'21 will be published in Lecture Notes in Networks and
Systems, Springer (Indexed in SCOPUS, INSPEC, WTI Frankfurt eG, zbMATH,
SCImago).
<https://www.springer.com/series/15179>

Proceedings of ISDA'20:
https://link.springer.com/book/10.1007%2F978-3-030-71187-0
History of ISDA series: https://www.mirlabs.org/isda21/previous.php

**Important Dates**
---------------------
Paper submission due: September 30, 2021
Notification of paper acceptance: October 31, 2021
Registration and Final manuscript due: November 15, 2021
Conference: December 13-15, 2021

**About ISDA 2021**
------------------

The International Conference on Intelligent Systems Design and Applications
(ISDA) is a major international conference bringing together researchers,
engineers, and practitioners who work in the areas of intelligent systems
and their applications in industry and the real world. Every year, ISDA
attracts authors from over 30 countries. After the success of the 20th
conference, which was held online, this year's event will also be held
online during December 13-15, 2021.

ISDA 2021 is expected to provide an opportunity for researchers to meet and
discuss the latest solutions, scientific results, and methods in solving
intriguing problems in the fields of artificial intelligence and its
real-world applications. The conference programme will include workshops,
special sessions, tutorials, prominent keynote speakers, and regular paper
presentations in parallel tracks. All submitted papers will be reviewed by
experts in the field based on the criteria of originality, significance,
quality, and clarity. Conference contents will be submitted for inclusion
in Springer and other Abstracting and Indexing (A&I) databases.

**Topics (not limited to)**
---------------------------

Intelligent Systems Architectures and Applications
Intelligent Image and Signal Processing
Intelligent Internet Modeling
Intelligent Data mining
Intelligent Business Systems
Intelligent Control and Automation
Intelligent Agents
Intelligent Knowledge Management
Innovative Information Security
Innovative Networking and Communication Techniques
Web Intelligence
Intelligent Software Engineering

**Submission Guidelines**
-------------------------
Submission of a paper should be made through the submission page from the
conference web page.
Please refer to the conference website for guidelines to prepare your
manuscript.

Paper format templates:
https://www.springer.com/de/authors-editors/book-authors-editors/manuscript-preparation/5636#c3324

ISDA'21 Submission Link:
https://easychair.org/conferences/?conf=isda2021


**Plenary Talks**
-----------------------------
You are welcome to attend 8 Keynote Talks offerred by world-renowned
professors and industry leaders. The detailed information is available on
conference website.

Speaker 1: Antônio de Padua Braga, Federal University of Minas Gerais,
Brazil
Title: Large margin classification with graph-based models

Speaker 2: Juergen Branke, University of Warwick, Coventry, United Kingdom
Title: Learning to optimise – optimal learning

Speaker 3: Oscar Cordon, University of Granada, Spain
Title: Hybrid Intelligent Systems for Forensic Anthropology and Human
Identification

Speaker 4: Kalyanmoy Deb, Michigan State University, USA
Title: TBA

Speaker 5: Marco Dorigo, Université Libre de Bruxelles, Belgium
Title: TBA

Speaker 6: Andries Engelbrecht, University of Stellenbosch, South Africa
Title: Set-based Particle Swarm Optimization Approach to Portfolio
Optimization

Speaker 7: Frédéric Guinand, Le Havre Normandy University, France
Title: Swarms of Unmanned Aerial Vehicles

Speaker 8: Günther Raidl, Technische Universität Wien, Austria
Title: Combinatorial Optimization Meets (Reinforcement) Learning

Speaker 9: Cengiz Toklu, Beykent University, Istanbul, Turkey
Title: Hybrid Algorithms. Applications to Structural Mechanics

**ISDA 2021 Organization**
-------------------------
General Chairs
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Thomas Hanne, University of Applied Sciences and Arts Northwestern
Switzerland, Switzerland
Weiping Ding, Nantong University, China

Program Chairs
Tzung-Pei Hong, National University of Kaohsiung, Taiwan
Tatiane Nogueira Rios, Universidade Federal da Bahia, Brazil

**Technical Contact**
---------------------
Dr. Ajith Abraham
Email: ajith.abraham@ieee.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/
*
**********************************************************

Monday, September 20, 2021

[DMANET] (CfP) Tools for Stochastic Modelling and Evaluation -- IFIP/PERFORMANCE 2021 workshop

Dear colleague,

Performance 2021 "Tools for Stochastic Modelling and Evaluation"
workshop deadline is approaching. More information are available
below:

Tools for Stochastic Modelling and Evaluation
• Organizers: Susanna Donatelli, Giuliana Franceschinis
• Submission website: https://easychair.org/conferences/?conf=tosme21
• Submission deadline: September 30, 2021

Other workshops:

TeaPACS 2021 – 1st International Workshop on Teaching Performance
Analysis of Computer Systems
• Organizers: Vittoria de Nitto Personè, Y. C. Tay

WAIN 2021 – 3rd International Workshop on AI in Networks and Distributed Systems
• Organizers: Luca Vassio, Danilo Giordano, Jinoh Kim, Jon Crowcroft

**********************************************************
*
* 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] TES Thematic Mini-Conference Computational Topology and Machine Learning, September 28 + 29, 2021

Dear colleagues,


We wish to announce the


Thematic Mini-Conference Computational Topology and Machine Learning,
-------------------------------------------
September 28 + 29, 2021


of the

Thematic Einstein Semester
"Geometric and Topological Structure of Materials"
https://www3.math.tu-berlin.de/mathplus/TES-Summer2021/
TU Berlin, April-September 2021


Tuesday, September 28, 2021
---------------------------
Time Zone: Berlin Time (Central European Summer Time, CEST)

* 04:00 pm to 04:40 pm, Jose Perea (Northeastern U)
* 04:50 pm to 05:30 pm, Bastian Rieck (ETH Zürich)
* 06:00 pm to 06:40 pm, Henry Adams (Colorado State U)
* 06:50 pm to 07:30 pm, Roland Kwitt (U Salzburg)


Wednesday, September 29, 2021
-----------------------------
Time Zone: Berlin Time (Central European Summer Time, CEST)

* 04:00 pm to 04:40 pm, Peter Bubenik (U Florida)
* 04:50 pm to 05:30 pm, Chao Chen (Stony Brook)
* 06:00 pm to 06:40 pm, Yusu Wang (UC San Diego)
* 06:50 pm to 07:30 pm, Mathieu Carrière (Inria Sophia Antipolis)


For titles and abstracts please see

https://www3.math.tu-berlin.de/mathplus/TES-Summer2021/



Participation:
-------------

free



Registration:
------------

Please register for the semester activities via this form:

https://docs.google.com/forms/d/e/1FAIpQLSdW_OVSvdTWHsZHdzqrTTvd54pTaCCnu6Snw_ui7TOT4XbHkA/viewform

Registered participants will receive the links for the semester by e-mail.



Organizers:
----------

Myfanwy Evans (U Potsdam)
Kathryn Hess Bellwald (EPFL)
Frank Lutz (TU Berlin)
Dmitriy Morozov (LBNL)
Ileana Streinu (Smith College)


---
**********************************************************
*
* 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] FACS 2021 - Call for Participation

=============================================================================
**
** Call for Participation: FACS 2021
**
** 17th International Conference on Formal Aspects of Component Software
**
** Virtual Event
** October 28-29, 2021
**
** https://facs2021.inria.fr
**
=============================================================================

## OVERVIEW

Component-based software development proposes sound engineering principles
and techniques to cope with the complexity of present-day software systems.
However, many challenging conceptual and technological issues remain in
component-based software development theory and practice. Furthermore, the
advent of service-oriented and cloud computing, cyber-physical systems, and
the Internet of Things has brought to the fore new dimensions, such as
quality of service and robustness to withstand faults, which require
revisiting established concepts and developing new ones.

FACS 2021 is concerned with how formal methods can be applied to
component-based software and system development. Formal methods have
provided foundations for component-based software through research on
mathematical models for components, composition and adaptation, and
rigorous approaches to verification, deployment, testing, and certification.

## REGISTRATION

FACS 2021 is free to attend, but registration is mandatory. Registered
attendees will receive invites to the online event. Registration is open
until Friday, 22 October 2021.

https://facs2021.inria.fr/registration/

## PROGRAMME

TIME GMT+2 (Amsterdam, Berlin, Bern, Brussels, Budapest, Madrid, Oslo,
Paris, Praga, Rome, Sofia, Stockholm, Vienna, Warsaw)

# OCTOBER 28, 2021

# 13h -> 15h - Session 1 (Modelling & Composition)

Component-based Approach Combining UML and BIP for Rigorous System Design.
Salim Chehida, Saddek Bensalem and Abdelhakim Baouya.

Composable Partial Multiparty Session Types.
Claude Stolze, Marino Miculan and Pietro Di Gianantonio.

A Canonical Algebra of Open Transition Systems.
Elena Di Lavore, Alessandro Gianola, Mario Román, Nicoletta Sabadini and
Pawel Sobocinski.

Corinne, a Tool for the Composition of Choreography Automata.
Simone Orlando, Vairo Di Pasquale, Franco Barbanera, Ivan Lanese and Emilio
Tuosto.

# 15h15 -> 16h30 - Session 2 (Invited Talk)

Parametric and Interval Model Checking - Recent Advances and Applications.
Radu Calinescu

# OCTOBER 29, 2021

# 13h -> 15h - Session 3 (Verification)

Specification and Verification of Parametric Systems with Recursive
Architectures.
Marius Bozga and Radu Iosif.

A linear parallel algorithm to compute bisimulation and relational coarsest
partitions.
Jan Martens, Jan Friso Groote, Lars B. van den Haak, Pieter Hijma and Anton
Wijs.

Automated Generation of Initial Configurations for Testing Component
Systems.
Frederic Dadeau, Jean-Philippe Gros and Olga Kouchnarenko.

Monitoring Distributed Component-Based Systems.
Yliès Falcone, Hosein Nazarpour, Saddek Bensalem and Marius Bozga.

# 15h15 -> 16h30 - Session 4 (Invited Talk)

Learning Assumptions for Verifying Cryptographic Protocols Compositionally.
Corina Pasareanu

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

[DMANET] PhD Position in Algorithm Engineering for Scalable Data Reduction

You love algorithms, their analysis and efficient implementation? You
are about to or know somebody who graduates with an excellent Master?s
degree and is looking for a PhD position? Then please read on:

The Algorithm Engineering Group Heidelberg at Heidelberg University
is inviting applications for a full-time position in a DFG funded
project of a

PhD Student (m/f)

starting on November 1st, 2021 (the exact date pu to a couple of months
is negotiable). Starting in the group as a PostDoc is also possible.

Working Area:

A successful candidate will work under the supervision of Prof. Dr.
Christian Schulz on engineering scalable data reduction algorithms.
Over the last two decades, significant advances have been made in the
design and analysis of FPT algorithms for a wide variety of graph
problems. However, these theoretical algorithmic ideas have received
very little attention from the practical perspective. This project aims
to bridge the gap between theory and practice currently observed in FPT
or kernelization approaches.

Further responsibilities as part of the position include the supervision
of bachelor and master students and possibly TA duties.

Requirements:

- Very good university degree (Master or equivalent) in computer science
or a related field
- willingness to learn and later assist teaching in German
- Solid skills in software development and in the theoretical analysis
of algorithms (evidenced by your thesis or relevant courses); knowledge
in combinatorial algorithms and linear algebra is particularly desirable
- Self-motivation, team spirit and willingness to work in
interdisciplinary projects
- Knowledge in parallel programming (in particular MPI) is a plus, but
no requirement

Heidelberg University offers excellent conditions for undergraduate,
graduate, and PhD students. As part of the university we pursue a
non-discriminatory employment policy and value equal opportunities, as
well as diversity (https://www.uni-heidelberg.de/diversity/). The
university lays special emphasis on increasing the number of women in
senior and in academic positions. Given equal qualifications, preference
will be given to female applicants.

Please *forward this email to anyone who may be interested* or send your
application documents (cover letter, CV, copies of certificates) and the
contact information of two references if available to the address below.
To receive full consideration, submit the documents via *email*
by October 15th, 2021 to:

Univ.-Prof. PD. Dr. Christian Schulz

Algorithm Engineering
Heidelberg University
Telephone: +49 (0) 6221 54- 14342
E-Mail: christian.schulz@informatik.uni-heidelberg.de
Web: https://schulzchristian.github.io/
https://ae.ifi.uni-heidelberg.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] IGAFIT panel on ERC grants - 2pm CEST, September 30 - Questions are welcome

Dear all,

We would like to invite you to the IGAFIT panel discussion on ERC grants on
September 30 (detail below).

*Date & Time: *September 30, 2021, 14:00 CEST. The one-hour discussion will
be followed by a short networking session.
*Panelists:* Keren Censor-Hillel, Daniel Marx, David Peleg, Saket Saurabh.
*Location: *Online at
https://www.airmeet.com/e/fe786f10-15f1-11ec-86ea-5b469367924a
*Questions for the panelists* are welcomed at
https://forms.gle/aFWZbd6iqHeHGS1t6.

The goal of the event is to share the panelists' experiences and insights
to help researchers in the algorithms community better prepare for ERC grant
applications. We welcome both beginning researchers who might apply for an
ERC grant in the future and established researchers considering applying
for ERC or other grants. There will be a chance to ask questions during the
event. However, to increase the chance of getting your questions answered,
you are encouraged to use the link above to send questions and comments
ahead of time. You can find more information about events by IGAFIT on
our web page: http://igafit.mimuw.edu.pl/?page_id=483786.

The meeting will be held using the Airmeet platform and to attend please go
to https://www.airmeet.com/e/649d9310-cdc2-11eb-847d-79adba337a09. In order
to access the Airmeet platform, you will need to register, so that others
know who you are. Then before and after the talk, you will be located
inside a Social Lounge, where discussion tables are visible. Most of the
tables can have up to 8 chairs, and you can join a table by clicking the
"Take a Seat" button on a table. This way you will be able to talk to
people seated currently at the table. When the session starts you will be
automatically switched to see the stage. You can find more instructions on
how to use Airmeet here:
https://www.airmeet.com/hub/step-by-step-guide-use-airmeet-for-attendees/.

We invite you to take part in the event. Please advertise broadly and bring
your students/postdocs as well.

Organization Committee:
Nikhil Bansal
Artur Czumaj
Andreas Feldmann
Danupon Nanongkai
Adi Rosén
Eva Rotenberg
Piotr Sankowski
Christian Sohler

**********************************************************
*
* 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 CFP] Parameterized and Approximation Algorithms in Graph Drawing, Journal of Graph Algorithms and Applications (JGAA)

CALL FOR PAPERS

Special Issue on Parameterized and Approximation Algorithms in Graph Drawing
of
Journal of Graph Algorithms and Applications (JGAA)
Dear Colleagues,

It is a great pleasure to invite you to submit a paper to the Special Issue
of Journal of Graph Algorithms and Applications (JGAA) on "Parameterized
and Approximation Algorithms in Graph Drawing".

In the course of a few decades, the fields of parameterized complexity and
approximation algorithms have emerged as distinguished research areas
providing an impressive collection of broadly usable methodologies and
remarkable theoretical and practical contributions. These branches of
complexity theory provide a framework of powerful techniques that allow us
to tackle hard (often NP-hard) problems, by either considering restricted
graph classes or by seeking solutions "close" to the optimal ones.
Moreover, in recent years, the research efforts in these two fields have
converged into the study of the unified notion of parameterized
approximation algorithms.

CFP on the journal's page:https://jgaa.info/docs/cfp-param-algo.pdf

Submission Deadline: February 28th, 2022


Topics
======

The emphasis of this special issue is on original results in the areas of
fixed-parameter tractable and approximation algorithms in graph drawing and
network visualization. This includes, but is not limited to, theoretical
and combinatorial aspects that arise at the interface of graph drawing with
computational and discrete geometry, combinatorial optimization, visual
computing, VLSI and computer-aided design, computer graphics, and
information visualization. The range of topics includes:

- fixed-parameter tractable and approximation algorithms
- (parameterized) inapproximability
- W[k]-hardness
- parameterized approximations
- (lossy) kernelization
- fine-grained complexity of approximations
- subexponential-time approximations

Other topics that are not listed but that might be of interest for the
study of parameterized and approximation algorithms in graph drawing will
also be evaluated. To bridge the gap between theory and practice, we
welcome contributions dealing with techniques and data structures to obtain
efficient parameterized and approximation algorithms to tackle
graph-visualization problems as well as implementations, experimental
evaluations, and algorithm engineering issues of approximation,
parameterized, and kernelization algorithms that emerge in practice.


Paper Submission
================

We invite authors to submit papers describing original research of
theoretical or practical significance concerned with parameterized and
approximation algorithms in graph drawing and network visualization until
the 28th of February, 2022. We aim for a fast reviewing process in order to
have this special issue available at the end of 2022. Papers should be
submitted to the editors of the special issue in PDF format. All
communications between the editors, authors, and reviewers will be done by
email unless otherwise requested by the author or reviewer. All submissions
must be formatted using the LaTeX style file of Journal of Graph Algorithms
and Applications (http://jgaa.info/authors.jsp). The default margins and
fonts must not be modified. The submission should contain a scholarly
exposition of ideas, techniques, and results, including motivation and a
clear comparison with related work. The claims of the paper should be fully
substantiated, including full proofs or appropriate experimental data.
Papers of good quality that do not fit within the scope of this special
issue might be handled as regular JGAA submissions.


Guest Editors
=============

Giordano Da Lozzo, Roma Tre University; giordano.dalozzo@uniroma3.it
Philipp Kindermann, Universität Trier; kindermann@uni-trier.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/
*
**********************************************************

Friday, September 17, 2021

[DMANET] Membership Drive - Association of Cyber Forensics

The Association of Cyber Forensics and Threat Investigators (ACFTI) is
an ambitious, non-profit technical organisation focusing on the
academics and research of cybersecurity, digital forensics, incident
response, and threat investigations and their influence to the
society. ACFTI started in 2016 as an initiative dedicated to promoting
all areas of cybersecurity, digital forensics, incident response, and
threat investigations in Latin America, but efforts were
systematically consolidated in 2020 to report new developments and
latest proven methodologies and to publish scholarly research
presenting the current research issues and advances in the mentioned
areas. Listed in the Union of International Associations with UIA Org
ID AA1922.

Website: https://www.acfti.org/
Twitter: @acfti
Facebook: https://www.facebook.com/groups/ACFTI/

Association Growth Initiative
----------------------------------

In response to the growing fragmentation of applied knowledge in
cybersecurity, digital forensics, incident response, and threat
investigations, ACFTI has successfully established an international
workshops series, which successfully held two workshops in Dubai and
Germany. ACFTI also maintains a free open-access journal "Journal of
Cyber Forensics and Advanced Threat Investigations". Thanks to our
industry partners, and financial supporters who made this possible.

We are planning to get involved in more projects, events, and
activities more relevant to our areas of interest.

Membership Drive and Volunteers Needed
----------------------------------

To achieve our goals of increasing growth in society, We are seeking
to increase our members and are looking for volunteers to join us and
to establish special interest groups and chapters across different
disciplines and countries. All are welcome (early career researchers,
academics, students, practitioners, experienced researchers, civil
servants), underrepresented groups in cybersecurity are especially
welcome to join us as well.

If you are doing applied research in any of our areas of interest, or
you are simply interested in cybersecurity, feel free to fill out this
Google form as an Expression of Interest in joining the "Association
of Cyber Forensics and Threat Investigators".
https://forms.gle/adUy9cA8yzTzx96z5
After receiving the Expression of Interest, you will be invited to our
communication platform where we can coordinate the community and set
up events and other collaboration opportunities.

What do We Offer
----------------------------------

ACFTI offers the possibility of making an impact by offering
collaboration in joint projects and activities, internships for
students, training and continuing professional education, research
achievement/outstanding service awards to recognize outstanding
individuals who have made a significant contribution to cybersecurity,
digital forensics, incident response, and threat investigations every
year. ACFTI is also in the process of setting up a fellow award to
recognize outstanding leaders of the profession who have made
significant, nationally recognized contributions to cybersecurity,
digital forensics, incident response, and threat investigations. A
fellow is the highest classification of ACFTI membership.

Finally, feel free to forward this email to colleagues or others that
might be interested.

Sent By: Andrew Zayine, on behalf of the President of the association board
Prof. John William Walker
Nottingham Trent University,
Cyber Security Researcher/Consultant, and Practicing Expert Witness,
Cybersec Innovation Partners Ltd, London, SE1 9SG, United Kingdom.
**********************************************************
*
* 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/
*
**********************************************************