The position is hosted by the Algorithms and Complexity Group at the
Vienna University of Technology (TU Wien) and will be supervised by
Robert Ganian. The successful applicant will have the opportunity to
pursue a research career focusing on various aspects of parameterized
complexity and exact algorithms, with a focus on problems that arise
in artificial intelligence research.
We offer the possibility of working on exciting research projects,
ample travel funding, and the option of collaborating with other
postdocs and PhD students within the Algorithms and Complexity Group
(https://www.ac.tuwien.ac.at/). There are no teaching obligations
associated with the position. The starting date is flexible and the
position is offered for 3.5 years, with the possibility of extension.
The salary will follow the FWF's salary tables (see
https://www.fwf.ac.at/en/research-funding/personnel-costs/) and
includes standard bonuses in the form of a 13th and 14h salary,
altogether allowing for a convenient life in Vienna close to the city
center.
Applicants are expected to have excellent mathematical skills as well
as an interest in discrete algorithms.
The application should include the candidate's CV, a short motivation
letter, and a letter of recommendation (all in a single pdf file;
alternatively, letters of recommendation may be sent directly by their
authors). The application should also mention possible starting dates
and should be sent to rganian@gmail.com by 17 September 2021.
Informal enquiries and questions about the position are very welcome
and should also be sent to rganian@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/
*
**********************************************************
Tuesday, August 24, 2021
[DMANET] Call for Lightning Talks on Constraint Modelling and Reformulation (Deadline Extended - Modref 2021)
CALL FOR LIGHTNING TALKS (SLIGHT EXTENSION)
ModRef 2021<https://modref.github.io/ModRef2021.html> is the 20th in a series of workshops on Constraint Modelling and Reformulation. It takes place virtually on October 25, preceding CP2021, the 27th International Conference on Principles and Practice of Constraint Programming.
The main aim of the workshop is to identify recent trends in constraint modelling, including (but not limited to) innovative modelling techniques, reformulation and preprocessing techniques, and understanding search.
The Call
This year, ModRef will host a round-table discussion to identify exciting directions for future improvements in modelling, and model transformation. As a lead-in to this, we will be holding a series of 2-3 minute lightning talks, with the theme What really bugs me about modelling is....
Do you have some favourite problem, that is just really awkward to model? Or a really nice formulation, that somehow becomes garbage by the time it reaches a solver? Some way you really want to use solvers, and they just won't let you? Come along, and vent your spleen! And together, maybe we'll come up with some neat ideas.
Please submit your lightning talk ideas through EasyChair<https://easychair.org/conferences/?conf=modref2021> by submitting a PDF with a few sentences describing the main idea of your talk. The (extended) deadline is September 2.
Half of the workshop is dedicated to the collaborative exercise to identify challenges for the next five years of modelling, with the goal of producing a jointly-written white/research paper to guide future research. The lightning talks play a key role here. The other half of the workshop will have a more conventional format with paper presentations (deadline for submission passed) and invited talks by Professor Torsten Schaub (University of Potsdam) on Answer Set Programming (ASP) and Dr Bart Bogaerts (Vrije Universiteit Brussel, Belgium) on Predicate Logic as a Modelling Language: The IDP System.
Important Dates:
Lightning talk submissions: September 2nd, 2021 (extended)
Notification of acceptance/rejection: September 13th, 2021
Workshop day: October 25th, 2021
For questions about the workshop, please contact the chairs Dr Emir Demirović (TU Delft, The Netherlands) and Dr Graeme Gange (Monash University, Australia): modref2021@tudelft.nl<mailto:modref2021@tudelft.nl>
Best,
Emir
--
Dr Emir Demirović
Assistant Professor
Algorithmics group<https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/>, TU Delft
emirdemirovic.com<http://www.emirdemirovic.com>
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CP 2021 - CALL FOR ABSTRACTS - QCP2021 Workshop on Constraint Solving and Quantum Computing
QCP2021 Workshop on Constraint Solving and Quantum Computing
Website: https://sites.google.com/view/qcp2021workshop <https://sites.google.com/view/qcp2021workshop>
Call for Abstracts
This workshop focuses on research at the intersection of quantum computing and constraint solving. The target audience is members of the CP community (or broader constraint solving community) that have experience with classical constraint solving techniques/algorithms but have little experience with the field of quantum computing. In addition to technical talks given by leaders in this area, the workshop will include pedagogical talks introducing basic concepts in quantum computing to participants.
The workshop is looking for submissions relevant to the following areas: i) the use of classical constraint solving techniques to approach problems in quantum computing and quantum processor development (i.e., circuit compilation, gate synthesis, chip embedding); ii) the use of quantum computing heuristics and algorithms to solve constraint satisfaction/optimization problems.
Format:
The full-day workshop will be a mix of invited talks and presentations based on accepted abstracts.
Submissions:
QCP2021 welcomes the submission of abstracts (1-2 pages in length) that, if accepted, will be presented at the workshop. Abstracts may summarize recently published work, or new and ongoing research. Submissions should be no more than two (2) pages in LNCS format plus references (no explicit abstract section is needed; see workshop website for example format file).
Please send submissions with subject "QCP2021 submission" to kyle [dot] booth [at] nasa [dot] gov.
Dates:
September 15, 2021: Abstract submission deadline
September 17, 2021: Author notification for workshop
September 30, 2021: Recorded video presentation submissions due (for accepted abstracts)
October 25, 2021: Workshop
Organizers:
Kyle E. C. Booth, Quantum AI Lab, NASA Ames Research Center
Eleanor Rieffel, Quantum AI Lab, NASA Ames Research Center
Bryan O'Gorman, Quantum AI Lab, NASA Ames Research Center
**********************************************************
*
* 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/
*
**********************************************************
Website: https://sites.google.com/view/qcp2021workshop <https://sites.google.com/view/qcp2021workshop>
Call for Abstracts
This workshop focuses on research at the intersection of quantum computing and constraint solving. The target audience is members of the CP community (or broader constraint solving community) that have experience with classical constraint solving techniques/algorithms but have little experience with the field of quantum computing. In addition to technical talks given by leaders in this area, the workshop will include pedagogical talks introducing basic concepts in quantum computing to participants.
The workshop is looking for submissions relevant to the following areas: i) the use of classical constraint solving techniques to approach problems in quantum computing and quantum processor development (i.e., circuit compilation, gate synthesis, chip embedding); ii) the use of quantum computing heuristics and algorithms to solve constraint satisfaction/optimization problems.
Format:
The full-day workshop will be a mix of invited talks and presentations based on accepted abstracts.
Submissions:
QCP2021 welcomes the submission of abstracts (1-2 pages in length) that, if accepted, will be presented at the workshop. Abstracts may summarize recently published work, or new and ongoing research. Submissions should be no more than two (2) pages in LNCS format plus references (no explicit abstract section is needed; see workshop website for example format file).
Please send submissions with subject "QCP2021 submission" to kyle [dot] booth [at] nasa [dot] gov.
Dates:
September 15, 2021: Abstract submission deadline
September 17, 2021: Author notification for workshop
September 30, 2021: Recorded video presentation submissions due (for accepted abstracts)
October 25, 2021: Workshop
Organizers:
Kyle E. C. Booth, Quantum AI Lab, NASA Ames Research Center
Eleanor Rieffel, Quantum AI Lab, NASA Ames Research Center
Bryan O'Gorman, Quantum AI Lab, NASA Ames Research Center
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Lecturer position in Computational Finance and Economics (University of Essex, UK)
The School of Computer Science and Electronic Engineering (University of
Essex, UK) is seeking an excellent individual for a Lecturer (Assistant
Professor) position. Areas of expertise include Computational Finance,
Algorithmic Game Theory, Computational Social Choice, and Theoretical
Computer Science.
The deadline for applications is September 13, 2021. More details are
available at:
https://vacancies.essex.ac.uk/tlive_webrecruitment/wrd/run/ETREC107GF.open?VACANCY_ID=977192Obdy&WVID=9918109NEm&LANG=USA
For informal enquiries, you can contact Maria Kyropoulou (
maria.kyropoulou@essex.ac.uk), Panagiotis Kanellopoulos (
panagiotis.kanellopoulos@essex.ac.uk), or Alexandros Voudouris (
voudourisalexandros@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/
*
**********************************************************
Essex, UK) is seeking an excellent individual for a Lecturer (Assistant
Professor) position. Areas of expertise include Computational Finance,
Algorithmic Game Theory, Computational Social Choice, and Theoretical
Computer Science.
The deadline for applications is September 13, 2021. More details are
available at:
https://vacancies.essex.ac.uk/tlive_webrecruitment/wrd/run/ETREC107GF.open?VACANCY_ID=977192Obdy&WVID=9918109NEm&LANG=USA
For informal enquiries, you can contact Maria Kyropoulou (
maria.kyropoulou@essex.ac.uk), Panagiotis Kanellopoulos (
panagiotis.kanellopoulos@essex.ac.uk), or Alexandros Voudouris (
voudourisalexandros@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/
*
**********************************************************
Monday, August 23, 2021
[DMANET] ACAC 2021: Call for Participation (August 26-27)
======================= ACAC 2021 (Virtual) =====================
Call for Participation
16th Athens Colloquium on Algorithms and Complexity
(ACAC 2021)
August 26-27, 2021
National Technical University of Athens
Athens, Greece
https://www.corelab.ntua.gr/acac21
============================================================
The Athens Colloquium on Algorithms and Complexity (ACAC) is an annual
meeting in Athens aiming to bring together researchers working in all areas
of the theory of algorithms and computational complexity. It serves as a
lively forum for presenting research results that are in a preliminary
stage or have been recently accepted / presented in some major conference.
The language of the workshop is English.
ACAC 2021 will be hosted virtually, on the days of August 26 and 27.
We will use the Zoom platform, and further details will be posted on the
ACAC website: https://www.corelab.ntua.gr/acac21
============================================================
PLENARY TALKS
============================================================
Giuseppe Italiano, LUISS University
Manolis Kellis, MIT
Iordanis Kerenidis, University Paris Diderot
Mihalis Yannakakis, Columbia University
============================================================
PROGRAM
============================================================
The program comprises 4 plenary and 20 contributed talks, taking place
between 11:00 and 19:00 Athens time (UTC+3) on each of the two days.
Abstracts of the presentations are available on the website. The program
can be accessed through the ACAC website or via this link:
https://www.corelab.ntua.gr/acac21/#program
============================================================
REGISTRATION
============================================================
The registration is free of charge but compulsory for administration
purposes and also for being able to login and attend the lectures.
Registered participants will receive an email with the meeting link and the
password on August 25. We will also send a reminder with all relevant
information in the morning of August 26. It is therefore important that you
fill in the registration form and provide a valid email address (the
registration will be kept open till August 25).
Please feel free to forward this announcement to other relevant mailing
lists, and do not hesitate to contact us if you have any questions.
We look forward to seeing you all virtually in ACAC 2021!
On behalf of the ACAC 2021 organizing committee
o Dimitris Fotakis
o Evangelos Markakis
o Elias Koutsoupias
o Aris Pagourtzis
o Stathis Zachos
o Vassilis Zissimopoulos
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
<#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
**********************************************************
*
* 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/
*
**********************************************************
Call for Participation
16th Athens Colloquium on Algorithms and Complexity
(ACAC 2021)
August 26-27, 2021
National Technical University of Athens
Athens, Greece
https://www.corelab.ntua.gr/acac21
============================================================
The Athens Colloquium on Algorithms and Complexity (ACAC) is an annual
meeting in Athens aiming to bring together researchers working in all areas
of the theory of algorithms and computational complexity. It serves as a
lively forum for presenting research results that are in a preliminary
stage or have been recently accepted / presented in some major conference.
The language of the workshop is English.
ACAC 2021 will be hosted virtually, on the days of August 26 and 27.
We will use the Zoom platform, and further details will be posted on the
ACAC website: https://www.corelab.ntua.gr/acac21
============================================================
PLENARY TALKS
============================================================
Giuseppe Italiano, LUISS University
Manolis Kellis, MIT
Iordanis Kerenidis, University Paris Diderot
Mihalis Yannakakis, Columbia University
============================================================
PROGRAM
============================================================
The program comprises 4 plenary and 20 contributed talks, taking place
between 11:00 and 19:00 Athens time (UTC+3) on each of the two days.
Abstracts of the presentations are available on the website. The program
can be accessed through the ACAC website or via this link:
https://www.corelab.ntua.gr/acac21/#program
============================================================
REGISTRATION
============================================================
The registration is free of charge but compulsory for administration
purposes and also for being able to login and attend the lectures.
Registered participants will receive an email with the meeting link and the
password on August 25. We will also send a reminder with all relevant
information in the morning of August 26. It is therefore important that you
fill in the registration form and provide a valid email address (the
registration will be kept open till August 25).
Please feel free to forward this announcement to other relevant mailing
lists, and do not hesitate to contact us if you have any questions.
We look forward to seeing you all virtually in ACAC 2021!
On behalf of the ACAC 2021 organizing committee
o Dimitris Fotakis
o Evangelos Markakis
o Elias Koutsoupias
o Aris Pagourtzis
o Stathis Zachos
o Vassilis Zissimopoulos
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
Virus-free.
www.avast.com
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
<#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
**********************************************************
*
* 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] Autumn School on "Optimization and Market Design" (October 3-7, 2021)
Autumn School on "Optimization and Market Design" (October 3-7, 2021)
Data intensive firms like Uber, AirBnB, Deliveroo and the European Electricity
Markets play the role of market makers connecting buyers with sellers. They
must, among other things, monitor quality, standardize offerings so as to
operate at scale, determine prices and facilitate search. Optimization plays a
fundamental role in the design of the rules of a marketplace. What distinguishes
the optimization problems in this setting from classical resource allocation
problems is the role of incentives. How should they be incorporated into
optimization models?
The ALOP (DFG Research Training group 2126 "Algorithmic Optimization") Autumn
School on "Optimization and Market Design" will provide an overview of the
mathematical challenges that such questions present from some of the leading
authorities on the subject:
*Rakesh V. Vohra (UPenn) "Allocating Indivisible Goods"
*Moshe Babaioff (Microsoft Research) "How to Maximize Profit When Selling
Multiple Items?"
*Garrett van Ryzin (Amazon's Supply Chain Optimization Technologies)
"Minimum Earnings Regulation and the Stability of Marketplaces"
*Martin Bichler (TU Munich) "Equilibrium Computation in Markets"
Due to the current circumstances, the autumn school will take place online via
Zoom meetings from October 3-7, 2021. Registration and participation is free of
charge. The registration deadline is August 30th, 2021.
We also plan to have a poster session and a poster award.
All relevant information, updates and registration information can be found at
https://alop.uni-trier.de/event/autumn-school-on-optimization-and-market-design/
Best regards!
Sven de Vries
**********************************************************
*
* 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/
*
**********************************************************
Data intensive firms like Uber, AirBnB, Deliveroo and the European Electricity
Markets play the role of market makers connecting buyers with sellers. They
must, among other things, monitor quality, standardize offerings so as to
operate at scale, determine prices and facilitate search. Optimization plays a
fundamental role in the design of the rules of a marketplace. What distinguishes
the optimization problems in this setting from classical resource allocation
problems is the role of incentives. How should they be incorporated into
optimization models?
The ALOP (DFG Research Training group 2126 "Algorithmic Optimization") Autumn
School on "Optimization and Market Design" will provide an overview of the
mathematical challenges that such questions present from some of the leading
authorities on the subject:
*Rakesh V. Vohra (UPenn) "Allocating Indivisible Goods"
*Moshe Babaioff (Microsoft Research) "How to Maximize Profit When Selling
Multiple Items?"
*Garrett van Ryzin (Amazon's Supply Chain Optimization Technologies)
"Minimum Earnings Regulation and the Stability of Marketplaces"
*Martin Bichler (TU Munich) "Equilibrium Computation in Markets"
Due to the current circumstances, the autumn school will take place online via
Zoom meetings from October 3-7, 2021. Registration and participation is free of
charge. The registration deadline is August 30th, 2021.
We also plan to have a poster session and a poster award.
All relevant information, updates and registration information can be found at
https://alop.uni-trier.de/event/autumn-school-on-optimization-and-market-design/
Best regards!
Sven de Vries
**********************************************************
*
* 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, August 20, 2021
[DMANET] Call for Posters & Workshop Papers - IEEE MSN 2021, Dec 13-15, 2021, Exeter, UK
[Apologies if you receive multiple copies of this Call for Submission]
Call for Posters & Workshop Papers - IEEE MSN 2021
The 17th International Conference on Mobility, Sensing and Networking (MSN 2021)
December 13-15, 2021, Exeter, UK
https://ieee-msn.org/2021
The 17th MSN conference will include poster session and five Workshops. Welcome to submit your papers to the following poster track and workshops.
1. Poster Track
Submission Due: September 22, 2021
https://ieee-msn.org/2021/cf-posters.php
Technical posters showing/presenting innovative and original research are solicited. In general IEEE MSN is interested in posters of technology that validate important research issues or showcase realistic applications in the following topics of interest (but not limited to): Algorithms, Theory, and Protocols, Systems & Tools, Experiments & Applications, Mobile & Wireless Networks, Edge and Fog Computing Network, Security, Privacy, Trust, and Blockchain, Big Data and AI in Networking, Wireless and Ubiquitous Sensing.
2. Workshop on Ubiquitous Electric Internet of Things (UEIoT)
Submission Due: September 17, 2021
http://www.allconfs.org/meeting/index_en.asp?id=8338
This workshop focuses on an emerging and impactful topic, edge information technology and intelligent technology such as Ubiquitous Electric Internet of Things (UEIoT), to provide sufficient and effective information and data to support.
3. Workshop on Edge Computing and Artificial Intelligence based Sensor-Cloud System (ECAISS) Submission Due: September 17, 2021
https://pf-wang.github.io/ecaiss_2021/index.html
This workshop serves as a forum to discuss the original research work, findings, and experiences on the innovations on edge computing, sensor, and cloud system.
4. Workshop on Network Meets Intelligent Computations (NMIC)
Submission Due: September 17, 2021
http://106.53.126.81/nmic
The goal of the workshop is devoted to the most recent developments of the combination of computations with networking for IoT intelligent, trustworthy, and efficient.
5. Workshop on Intelligent Data Collection in Cyber-Physical Systems (IDC)
Submission Due: September: 17, 2021
http://www.ourclass.org.cn/IDC202
The workshop provides a forum for academic researchers and industry practitioners to exchange the most recent progress in intelligent data collection methods and applications in this field.
6. Workshop on Artificial Intelligence Applications in Internet of Things (AI2OT)
Submission Due: September 17, 2021
http://vlab.csu.edu.cn/AI2OT/index.html
The workshop solicits submissions from areas relating to applications of artificial intelligence algorithms/approaches to solve problems in IoT area, including AI-driven IoT applications and solutions for all related fields.
Workshop and poster submissions should be made using this link:
https://easychair.org/conferences/?conf=msn2021
**********************************************************
*
* 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/
*
**********************************************************
Call for Posters & Workshop Papers - IEEE MSN 2021
The 17th International Conference on Mobility, Sensing and Networking (MSN 2021)
December 13-15, 2021, Exeter, UK
https://ieee-msn.org/2021
The 17th MSN conference will include poster session and five Workshops. Welcome to submit your papers to the following poster track and workshops.
1. Poster Track
Submission Due: September 22, 2021
https://ieee-msn.org/2021/cf-posters.php
Technical posters showing/presenting innovative and original research are solicited. In general IEEE MSN is interested in posters of technology that validate important research issues or showcase realistic applications in the following topics of interest (but not limited to): Algorithms, Theory, and Protocols, Systems & Tools, Experiments & Applications, Mobile & Wireless Networks, Edge and Fog Computing Network, Security, Privacy, Trust, and Blockchain, Big Data and AI in Networking, Wireless and Ubiquitous Sensing.
2. Workshop on Ubiquitous Electric Internet of Things (UEIoT)
Submission Due: September 17, 2021
http://www.allconfs.org/meeting/index_en.asp?id=8338
This workshop focuses on an emerging and impactful topic, edge information technology and intelligent technology such as Ubiquitous Electric Internet of Things (UEIoT), to provide sufficient and effective information and data to support.
3. Workshop on Edge Computing and Artificial Intelligence based Sensor-Cloud System (ECAISS) Submission Due: September 17, 2021
https://pf-wang.github.io/ecaiss_2021/index.html
This workshop serves as a forum to discuss the original research work, findings, and experiences on the innovations on edge computing, sensor, and cloud system.
4. Workshop on Network Meets Intelligent Computations (NMIC)
Submission Due: September 17, 2021
http://106.53.126.81/nmic
The goal of the workshop is devoted to the most recent developments of the combination of computations with networking for IoT intelligent, trustworthy, and efficient.
5. Workshop on Intelligent Data Collection in Cyber-Physical Systems (IDC)
Submission Due: September: 17, 2021
http://www.ourclass.org.cn/IDC202
The workshop provides a forum for academic researchers and industry practitioners to exchange the most recent progress in intelligent data collection methods and applications in this field.
6. Workshop on Artificial Intelligence Applications in Internet of Things (AI2OT)
Submission Due: September 17, 2021
http://vlab.csu.edu.cn/AI2OT/index.html
The workshop solicits submissions from areas relating to applications of artificial intelligence algorithms/approaches to solve problems in IoT area, including AI-driven IoT applications and solutions for all related fields.
Workshop and poster submissions should be made using this link:
https://easychair.org/conferences/?conf=msn2021
**********************************************************
*
* 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 Optimization and Geometry at TU Delft
A PhD position is available in the Optimization Group at the Delft
University of Technology in The Netherlands. This is a 4-year
position with lots of benefits and a generous travel budget. As a PhD
student, you will have the opportunity to work on areas such as
semidefinite programming and extremal geometry and should also have a
lot of time to conduct independent research.
The full job call and application procedure can be found via the link below:
https://www.tudelft.nl/over-tu-delft/werken-bij-tu-delft/vacatures/details?jobId=3701
PLEASE NOTE: Applying is simple, but the deadline for application is
close (1st September). If you cannot meet the deadline but are
interested, let me know and we can arrange an exception. If you miss
the deadline, let me know as well.
I am also available via the email below for any other questions about
the position.
Best regards,
Fernando M. de Oliveira Filho
Delft Institute of Technology
F.M.deOliveiraFilho@tudelft.nl
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
University of Technology in The Netherlands. This is a 4-year
position with lots of benefits and a generous travel budget. As a PhD
student, you will have the opportunity to work on areas such as
semidefinite programming and extremal geometry and should also have a
lot of time to conduct independent research.
The full job call and application procedure can be found via the link below:
https://www.tudelft.nl/over-tu-delft/werken-bij-tu-delft/vacatures/details?jobId=3701
PLEASE NOTE: Applying is simple, but the deadline for application is
close (1st September). If you cannot meet the deadline but are
interested, let me know and we can arrange an exception. If you miss
the deadline, let me know as well.
I am also available via the email below for any other questions about
the position.
Best regards,
Fernando M. de Oliveira Filho
Delft Institute of Technology
F.M.deOliveiraFilho@tudelft.nl
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Re: [DMANET] [compgeom-announce] Fourth Computational Geometry Challenge - First Announcement
Dear friends and colleagues,
A first batch of test instances is now online:
https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2022/#instance-format
These are not the contest instances yet, but meant for training purposes,
running first tests, etc. If you encounter any problems, questions or
suggestions, please get in touch - that kind of interaction is an intended
part of this phase, so we can fine-tune the difficulty of the actual challenge.
Best wishes,
Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
> Am 21.07.2021 um 14:02 schrieb Sándor Fekete <s.fekete@tu-bs.de>:
>
> Dear colleagues,
>
> We are happy to announce the Fourth Geometric Optimization Challenge, as
> part of CG Week in Berlin, Germany, June 7-10, 2022.
>
> See https://cgshop.ibr.cs.tu-bs.de/competition/cg-shop-2022/#problem-description
>
> As in the last year, the objective will be to compute good solutions to instances
> of a difficult geometric optimization problem. The specific problem chosen for
> the 2022 Challenge is the following:
>
> Minimum Partition into Plane Subgraphs
> -----------------------------------------------------
>
> Given a geometric graph G=(V,E), with vertices represented by points in the plane,
> and edges by straight-line connections between vertices.
>
> The task is to partition E into as few subsets E_1,…, E_k as possible, such that
> each subgraph G_i=(V,E_i) is plane: In the given geometric representation,
> line segments representing edges my touch at end points if and only if the
> corresponding edges are incident in G_i; no edges my cross, i.e., share
> points that are not segment end points.
>
> The problem is related to a variety of classic problems, ranging from coloring and
> graph partitioning to extremal graph theory. For example, edge coloring in planar
> graphs H (for which it is a long-standing conjecture [2] that it is NP-hard for graphs
> of maximum degree Δ=4 or 5 to decide whether they have an edge coloring with
> Δ colors) is a special case: From a straight-line drawing of H, slightly extend all
> line segments, so that they cross at the vertices of H, and nowhere else.
>
> The related problem of partitioning a geometric graph into a minimum number of
> plane spanning trees has also received considerable attention; see Aichholzer et al. [1]
> for an overview.
>
> Details of the competition (such as benchmark instances, data formats, and rules for
> submission and evaluation) will be announced in coming weeks; see the timeline below.
>
> The contributors with the most outstanding solutions will be recognized at CG Week
> and invited to present their results, both at the event and in the proceedings.
>
> We are looking forward to your contributions and welcome questions and comments!
>
> Challenge Team:
> ----------------------
> Sándor Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
>
> Advisory Board:
> ---------------------
> Bill Cook, Andreas Fabri, Michael Kerber, Philipp Kindermann, Joe Mitchell, Kevin Verbeek
>
> Timeline:
> ------------
> - By August 19, 2020: Release of first test instances
>
> - September 19, 2021: Contest instances, contest opens
>
> - January 19, 2022: Contest closes
>
> - March 15, 2021: Final versions of proceedings contributions due
>
> Credit:
> ---------
> This problem was suggested by Johannes Obenaus, FU Berlin.
>
> References:
> ----------------
>
> [1]
> Marek Chrobak, Takao Nishizeki.
> Improved edge-coloring algorithms for planar graphs.
> Journal of Algorithms, Volume 11, Issue 1, March 1990, Pages 102-116.
>
> [2]
> Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc van Kreveld, Maarten Löffler,
> Alexander Pilz, Bettina Speckmann, Emo Welzl.
> Packing plane spanning trees and paths in complete geometric graphs
> Information Processing Letters, Volume 124, August 2017, Pages 35-41;
> full version available at https://arxiv.org/abs/1707.05440
>
> --
> You are currently subscribed to compgeom-announce.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/compgeom-announce
>
>
>
>
**********************************************************
*
* 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, August 18, 2021
[DMANET] Postdoc Positions in Vienna
DEPARTMENTOFCOMPUTERSCIENCE UNIVERSITY OF VIENNA
POSTDOC POSITIONS IN ALGORITHMS
POSTDOC POSITIONS IN ALGORITHMS
Two full-time postdoc positions are available in the research group
"Theory and Applications of Algorithms" lead by Professor Monika
Henzinger as part of the new ERC Advanced project "The design and
evaluation of modern fully dynamic data structures." See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
<http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/>for
more information on the research group.
Vienna has a very active research community in Computer Science with
departments at the Technical University of Vienna and at the Institute
of Science and Technology Austria in addition to the University of
Vienna.Furthermore there exists a doctoral school on "Computational
Optimization" (which is a collaboration of various universities and
departments in the Vienna area) leading to a large number of visiting
professors and invited lectures on this topic over the next 3 years.
The positions are available starting January 1, 2022 (or later), will be
for 2 years and can be extended.If you are interested, please send your
CV including a list of publications, a 1-page letter of
motivation/research statement, and the names of 2 or more references to
applications.taa@univie.ac.at <mailto:applications.taa@univie.ac.at> .
We will review the applications on a rolling basis, to receive full
consideration please send your application by Sept 15, 2021.
**********************************************************
*
* 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 or Postdoc Position: Discrete Optimization for Machine Learning and Image Analysis
At TU Dresden, the Chair of Machine Learning for Computer Vision invites
applications for a
PhD or Postdoc Position: Discrete Optimization for Machine Learning and
Image Analysis
Salary level: TV-L E13, 100%
Tasks:
- Curiosity-driven basic research of fundamental mathematical
optimization problems in the fields of machine learning and image analysis
- Design and analysis of algorithms for solving these problems, exactly
or approximatively
- Implementation, empirical analysis and comparison of these algorithms
with respect to real data
- Publication of findings and insights in internationally leading
conferences and journals
- Strong contributions to teaching in English in the Masters' Program
Computational Modeling and Simulation, esp. by the design and
co-supervision of exercise groups and tutorials and, for postdocs with
sufficient teaching experience, by own lectures
Requirements:
- A very good university degree in mathematics or computer science or a
related discipline
- Comprehensive education in mathematics, especially in discrete
mathematics and one area of mathematical optimization (e.g. Mathematical
Programming, Convex Optimization)
- Curiosity and strong interest in rigorous mathematical methods
- Very good programming skills in C++
- Very good scientific writing skills in English. (Knowledge of German
is not required for this position).
Further information: https://mlcv.inf.tu-dresden.de/positions.html
Contact: mlcv@tu-dresden.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/
*
**********************************************************
applications for a
PhD or Postdoc Position: Discrete Optimization for Machine Learning and
Image Analysis
Salary level: TV-L E13, 100%
Tasks:
- Curiosity-driven basic research of fundamental mathematical
optimization problems in the fields of machine learning and image analysis
- Design and analysis of algorithms for solving these problems, exactly
or approximatively
- Implementation, empirical analysis and comparison of these algorithms
with respect to real data
- Publication of findings and insights in internationally leading
conferences and journals
- Strong contributions to teaching in English in the Masters' Program
Computational Modeling and Simulation, esp. by the design and
co-supervision of exercise groups and tutorials and, for postdocs with
sufficient teaching experience, by own lectures
Requirements:
- A very good university degree in mathematics or computer science or a
related discipline
- Comprehensive education in mathematics, especially in discrete
mathematics and one area of mathematical optimization (e.g. Mathematical
Programming, Convex Optimization)
- Curiosity and strong interest in rigorous mathematical methods
- Very good programming skills in C++
- Very good scientific writing skills in English. (Knowledge of German
is not required for this position).
Further information: https://mlcv.inf.tu-dresden.de/positions.html
Contact: mlcv@tu-dresden.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] Fully-funded PhD position: Privacy-Preserving Attentive User Interfaces (University of Stuttgart, Germany)
The Institute of Information Security and the Perceptual User Interfaces
Group at the University of Stuttgart, Germany invite applications for a
PhD position on "Privacy-Preserving Attentive User Interfaces" at the
intersection of Security/Privacy/Cryptography, Machine Learning, and
Human-Computer Interaction.
Group at the University of Stuttgart, Germany invite applications for a
PhD position on "Privacy-Preserving Attentive User Interfaces" at the
intersection of Security/Privacy/Cryptography, Machine Learning, and
Human-Computer Interaction.
Apply if you belong to the top 5% of students in your peer group, are
highly motivated and capable of addressing and solving scientifically
challenging problems, and if you are interested in doing research in an
internationally oriented, interdisciplinary, and highly successful team.
We value strong analytical skills. Knowledge of cryptography, in
particular, privacy enhancing technologies such as Multi Party
Computation and Differential Privacy, is an asset. Knowledge of German
is not required.
The University of Stuttgart is an equal opportunity employer.
Applications from women are strongly encouraged. Severely challenged
persons will be given preference in the case of equal qualifications.
To apply, please send email with subject "PhD position:
Privacy-Preserving Attentive User Interfaces" and a single PDF file
containing the following documents to ralf.kuesters@sec.uni-stuttgart.de:
* Cover letter (explaining your scientific background and your
motivation to apply)
* Curriculum Vitae
* List of publications (if any)
* Copies of transcripts and certificates (Bachelor and Master)
* Names and contact addresses of at least two references
The deadline for applications is
September 12th, 2021.
Late applications will be considered until the position is filled.
See https://sec.uni-stuttgart.de/ for more information about the
Institute of Information Security and http://www.perceptualui.org/ for
the Perceptual User Interfaces Group (Prof. Bulling).
For further information please contact: Prof. Dr. Ralf Küsters,
ralf.kuesters@sec.uni-stuttgart.de.
--
Prof. Dr. Ralf Küsters
Institute of Information Security - SEC
University of Stuttgart
Universitätsstraße 38
D-70569 Stuttgart
Germany
https://sec.uni-stuttgart.de
Phone: +49 (0) 711 685 88283
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Lecturer / Senior Lecturer / Reader positions in Cybersecurity, School of Computing Science, University of Glasgow
The School of Computing Science invites applications for the post of Lecturer / Senior Lecturer / Reader (based on experience and qualifications) in Cybersecurity.
We are particularly interested in applicants with outstanding achievements in areas covering embedded and networked systems security and resilience, operating systems security, hardware security, data privacy, and cryptography (the latter may be relevant to some members of this mailing list). We also welcome applications from those working on formal methods for security or applying programming language approaches to security.
We have a long-standing record in areas spanning topics related to the security and resilience of networked systems, and the security and safety for Cyber-Physical Systems (CPS). We have expanded our portfolio into hardware security, software verification, IoT privacy as well as human-centered and usable security. We are currently hosting two out of the nine projects funded nationally by the UKRI digital security by design Industrial Strategy Challenge Fund (ISCF) in 2020 to explore hardware capabilities in designing secure systems. We have also recently been awarded five out of a total of eighteen projects from the 2nd Strategic Research Fund (SRF) Funding Call of the PETRAS National Centre of Excellence for IoT Systems Cybersecurity. We are hosting the Cyber Defence Lab, a unique laboratory facility providing exclusive access to a set of safety-critical network infrastructures, hosting data from digital twins of several UK critical infrastructures.
The postholder will develop, lead and sustain research of international standard in Computing Science; contribute to teaching, assessment, project supervision, and curriculum design at undergraduate and postgraduate levels; and participate in School management and organisation.
For appointment at Reader you will have an outstanding track record of national and international distinction and leadership in research, including publications, income and awards, bringing external recognition and distinction to yourself and the University.
Two positions are available. These positions are equivalent to US tenure track Assistant or Associate Professor.
For more details, see https://www.flipsnack.com/UofGRecruitment/lslr-in-cybersecurity-063667.html and click here to apply: https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=063667.
Vacancy ref: 063667
Closing date: Wednesday 15th September 2021
For informal enquiries please contact:
Professor Dimitris Pezaros
Email: Dimitrios.Pezaros@glasgow.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/
*
**********************************************************
We are particularly interested in applicants with outstanding achievements in areas covering embedded and networked systems security and resilience, operating systems security, hardware security, data privacy, and cryptography (the latter may be relevant to some members of this mailing list). We also welcome applications from those working on formal methods for security or applying programming language approaches to security.
We have a long-standing record in areas spanning topics related to the security and resilience of networked systems, and the security and safety for Cyber-Physical Systems (CPS). We have expanded our portfolio into hardware security, software verification, IoT privacy as well as human-centered and usable security. We are currently hosting two out of the nine projects funded nationally by the UKRI digital security by design Industrial Strategy Challenge Fund (ISCF) in 2020 to explore hardware capabilities in designing secure systems. We have also recently been awarded five out of a total of eighteen projects from the 2nd Strategic Research Fund (SRF) Funding Call of the PETRAS National Centre of Excellence for IoT Systems Cybersecurity. We are hosting the Cyber Defence Lab, a unique laboratory facility providing exclusive access to a set of safety-critical network infrastructures, hosting data from digital twins of several UK critical infrastructures.
The postholder will develop, lead and sustain research of international standard in Computing Science; contribute to teaching, assessment, project supervision, and curriculum design at undergraduate and postgraduate levels; and participate in School management and organisation.
For appointment at Reader you will have an outstanding track record of national and international distinction and leadership in research, including publications, income and awards, bringing external recognition and distinction to yourself and the University.
Two positions are available. These positions are equivalent to US tenure track Assistant or Associate Professor.
For more details, see https://www.flipsnack.com/UofGRecruitment/lslr-in-cybersecurity-063667.html and click here to apply: https://my.corehr.com/pls/uogrecruit/erq_jobspec_version_4.jobspec?p_id=063667.
Vacancy ref: 063667
Closing date: Wednesday 15th September 2021
For informal enquiries please contact:
Professor Dimitris Pezaros
Email: Dimitrios.Pezaros@glasgow.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] Highlights of Logic, Games, and Automata 2021: Call for Participation
********************************************************
HIGHLIGHTS 2021: 9th annual conference on Highlights of LOGIC, GAMES, and
AUTOMATA
HIGHLIGHTS 2021: 9th annual conference on Highlights of LOGIC, GAMES, and
AUTOMATA
15-17 September 2021, online (originally planned to be held in Aachen)
See the full programme:
http://highlights-conference.org
Registration is open and **free**:
http://highlights-conference.org/register/
********************************************************
HIGHLIGHTS 2021 is the 9th conference on Highlights of Logic, Games, and
Automata that aims to integrate the diverse research community working in
the areas of Logic, Finite Model Theory, Automata Theory, Games and
Verification. Individual papers are dispersed across many conferences,
which makes them challenging to follow. Participating in the annual
Highlights conference offers a wide picture of the latest research in the
field and a chance to meet and interact with most of the members of the
research community. The speakers are encouraged to present their best
recent work at Highlights, whether already published elsewhere or not.
The three-day conference (15-17 September) will be preceded by a tutorial
day
(14 September). This year's edition will be held online, with no
registration fees.
TUTORIALS (September 14)
+ Christoph Haase, "A guided tour through Presburger arithmetic and friends"
+ Michał Pilipczuk, "Old and new advances in model checking first order
logic"
KEYNOTES
+ Rajeev Alur
+ Balder ten Cate
+ Karoliina Lehtinen
+ Nutan Limaye
+ Joel Ouaknine
**********************************************************
*
* 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 the project "Empty promises of Thomas Jerome Schaefer"
The Faculty of Mathematics and Computer Science of Jagiellonian University
in Krakow offers a Ph.D. position in the project "Empty promises of Thomas
Jerome Schaefer".
The position is in the research area that employs algebraic tools to
investigate the computational complexity of the Promise Constraint
Satisfaction Problem (PCSP) on a Boolean domain. The computational problems
investigated within the project are usually easy to state, but often
require novel approaches and tools from quite remote branches of computer
science.
We invite all applicants with a strong motivation for research.
Further details can be found at https://marcinkozik.staff.tcs.uj.edu.pl/PhD/
**********************************************************
*
* 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/
*
**********************************************************
in Krakow offers a Ph.D. position in the project "Empty promises of Thomas
Jerome Schaefer".
The position is in the research area that employs algebraic tools to
investigate the computational complexity of the Promise Constraint
Satisfaction Problem (PCSP) on a Boolean domain. The computational problems
investigated within the project are usually easy to state, but often
require novel approaches and tools from quite remote branches of computer
science.
We invite all applicants with a strong motivation for research.
Further details can be found at https://marcinkozik.staff.tcs.uj.edu.pl/PhD/
**********************************************************
*
* 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] Postdoc position in algorithms at University of Warwick, UK (application deadline: September 12, 2021)
In connection with a research grant of Dr. Ramanujan Sridharan and Prof. Graham Cormode at University of Warwick, UK, we are seeking excellent candidates for a postdoctoral fellow position in the area of design and analysis of kernelization and approximation algorithms.
The position is for 2 years and start date can be negotiated (preferably before January 2022). The project comes with a generous travel budget which will enable the project team to closely collaborate with internationally leading research groups in algorithms and complexity.
The applicants are expected to have a strong background in the mathematical analysis of algorithms, with a specialization in one of the following areas: graph algorithms, kernelization or approximation algorithms. You will have (or expect to obtain shortly) a PhD in the relevant area.
You will be formally based in the Department of Computer Science at the University of Warwick, and you will be associated with the Centre for Discrete Mathematics and its Applications (http://www2.warwick.ac.uk/fac/cross_fac/dimap) and the Theory and Foundations research group at the University of Warwick. The Department of Computer Science at the University of Warwick is one of the top-ranking computing departments in the UK. The department is especially renowned for its excellence in theoretical aspects of computer science, in the areas of algorithms and combinatorial optimization.
The Centre for Discrete Mathematics and its Applications (DIMAP) is an internationally renowned centre of excellence in algorithms, discrete mathematics and combinatorics, theoretical computer science and mathematical aspects of operational research. It is led by a number of internationally recognized researchers and has an extensive programme of scientific seminars, international workshops and conferences, and visiting researchers. For further information about DIMAP, please see our website http://www2.warwick.ac.uk/fac/cross_fac/dimap/ .
Formal applications must be submitted by September 12, 2021 at the following link: https://bit.ly/3srPqEH . Informal enquiries are welcome (please contact Dr. Sridharan: r.maadapuzhi-sridharan@warwick.ac.uk<mailto:r.maadapuzhi-sridharan@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/
*
**********************************************************
The position is for 2 years and start date can be negotiated (preferably before January 2022). The project comes with a generous travel budget which will enable the project team to closely collaborate with internationally leading research groups in algorithms and complexity.
The applicants are expected to have a strong background in the mathematical analysis of algorithms, with a specialization in one of the following areas: graph algorithms, kernelization or approximation algorithms. You will have (or expect to obtain shortly) a PhD in the relevant area.
You will be formally based in the Department of Computer Science at the University of Warwick, and you will be associated with the Centre for Discrete Mathematics and its Applications (http://www2.warwick.ac.uk/fac/cross_fac/dimap) and the Theory and Foundations research group at the University of Warwick. The Department of Computer Science at the University of Warwick is one of the top-ranking computing departments in the UK. The department is especially renowned for its excellence in theoretical aspects of computer science, in the areas of algorithms and combinatorial optimization.
The Centre for Discrete Mathematics and its Applications (DIMAP) is an internationally renowned centre of excellence in algorithms, discrete mathematics and combinatorics, theoretical computer science and mathematical aspects of operational research. It is led by a number of internationally recognized researchers and has an extensive programme of scientific seminars, international workshops and conferences, and visiting researchers. For further information about DIMAP, please see our website http://www2.warwick.ac.uk/fac/cross_fac/dimap/ .
Formal applications must be submitted by September 12, 2021 at the following link: https://bit.ly/3srPqEH . Informal enquiries are welcome (please contact Dr. Sridharan: r.maadapuzhi-sridharan@warwick.ac.uk<mailto:r.maadapuzhi-sridharan@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] PhD position in IE & OR at IMT Atlantique in Nantes, France
Call for applications
PhD thesis on /Optimization of assembly lines with collaborative robots/
IMT Atlantique, Nantes, France/Rennes Business School, Rennes, France
Deadlines for applying: *September 9th, 2021*
Start: Nov - Dec 2021, for 3 years PhD Program
Manual assembly line balancing is an NP-hard problem. The inclusion of
possible collaboration with robots makes the problem even harder, since
the operation durations will be different if the operation is performed
by the worker only or in collaboration with a cobot.
Besides, accounting for ergonomics adds another level of difficulty.
Finally, the design of a line with the right balance between
reconfigurability and costs is a challenging task.
*Keywords: *Assembly line balancing, combinatorial optimization, cobots,
human factors
Supervisors:
Prof. Dr. Alexandre Dolgui, Dr. Maher Agi, Dr Öncü Hazir, Dr. Simon Thevenin
*CV, letter of motivation, master grads, and recommendation letters must
be sent to
*
maher.agi@rennes-sb.com <mailto:alexandre.dolgui@imt-atlantique.fr>
alexandre.dolgui@imt-atlantique.fr
<mailto:alexandre.dolgui@imt-atlantique.fr>
oncu.hazir@rennes-sb.com <mailto:alexandre.dolgui@imt-atlantique.fr>
simon.thevenin@imt-atlantique.fr
<mailto:alexandre.dolgui@imt-atlantique.fr><mailto:thomas.yeung@imt-atlantique.fr>
--
____________________________________________________________________________
Alexandre Dolgui, Dr.habil., Ph.D., IISE Fellow,
Professor and Head
Automation, Production and Computer Sciences Dept.
IMT Atlantique, LS2N-CNRS
La Chantrerie, 4, rue Alfred Kastler - B.P. 20722
F-44307 NANTES Cedex 3, France
E-mails:alexandre.dolgui@imt-atlantique.fr
URL:www.researchgate.net/profile/Alexandre_Dolgui
Book:
Supply Chain Engineering: useful methods and techniques, Springer
http://www.springer.com/engineering/production+eng/book/978-1-84996-016-8
Editor-in-Chief
International Journal of Production Research
https://www.tandfonline.com/toc/tprs20/current
60th Anniversary of IJPR at
IFIP APMS 2021, September 5 to 9, Nantes, France:
www.apms-conference.org
https://youtu.be/MUxbjfesy8g
_____________________________________________________________________________
**********************************************************
*
* 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] Senior Algorithm Engineer (near Vienna, Austria)
Untis GmbH
AUT-2000 Stockerau
Belvederegasse 11
The software of Untis is used in more than 25.000 schools around the world to compute timetables. It addresses a range of interesting combinatorial optimization problems arising in this domain. Untis is looking for a Senior Algorithm Engineer (m/f/x) in Stockerau near Vienna (Austria) to work on the algorithmic core of the software.
What you will be doing:
- You'll work in a cross functional team to maintain and improve our timetabling algorithms.
- Analyze and document the optimization algorithms (mainly Heuristics and Metaheuristics) in our product suite
- Design and develop new algorithmic approaches to boost performance and improve functionality
- Develop maintainable software for complex timetabling problems in Java and C++ following clean code principles
- Participate in scientific conferences and keep in contact with the scientific community
What we offer:
- Flexible working hours and home office possibility
- An annual salary starting at 50.000 EUR. We're happy to pay more depending on your qualification and experience.
- For non-native German speakers: support in learning the language
- Modern, brand new offices with a sunny garden and gym
- A garage for parking your car, scooter, or bike at the office can be used
What we expect from you:
- MSc or PhD degree in computer science, mathematics, or a related field
- Expertise in Algorithms and Data Structures, Combinatorial Optimization, and Operations Research
- Several years of experience in research and development of complex algorithms. Published papers in the field will be considered favorably.
- Strong experience in either Java, C++, or both
- You have no problems getting your hands dirty on legacy code
- Fluent English, B1 German
Please apply via: https://jobs.untis.at/o/senior-algorithm-engineer-mfx
For questions please contact: sebastian.knopp@untis.at
**********************************************************
*
* 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/
*
**********************************************************
AUT-2000 Stockerau
Belvederegasse 11
The software of Untis is used in more than 25.000 schools around the world to compute timetables. It addresses a range of interesting combinatorial optimization problems arising in this domain. Untis is looking for a Senior Algorithm Engineer (m/f/x) in Stockerau near Vienna (Austria) to work on the algorithmic core of the software.
What you will be doing:
- You'll work in a cross functional team to maintain and improve our timetabling algorithms.
- Analyze and document the optimization algorithms (mainly Heuristics and Metaheuristics) in our product suite
- Design and develop new algorithmic approaches to boost performance and improve functionality
- Develop maintainable software for complex timetabling problems in Java and C++ following clean code principles
- Participate in scientific conferences and keep in contact with the scientific community
What we offer:
- Flexible working hours and home office possibility
- An annual salary starting at 50.000 EUR. We're happy to pay more depending on your qualification and experience.
- For non-native German speakers: support in learning the language
- Modern, brand new offices with a sunny garden and gym
- A garage for parking your car, scooter, or bike at the office can be used
What we expect from you:
- MSc or PhD degree in computer science, mathematics, or a related field
- Expertise in Algorithms and Data Structures, Combinatorial Optimization, and Operations Research
- Several years of experience in research and development of complex algorithms. Published papers in the field will be considered favorably.
- Strong experience in either Java, C++, or both
- You have no problems getting your hands dirty on legacy code
- Fluent English, B1 German
Please apply via: https://jobs.untis.at/o/senior-algorithm-engineer-mfx
For questions please contact: sebastian.knopp@untis.at
**********************************************************
*
* 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, August 17, 2021
[DMANET] [HIRING] Research/Applied Scientist for Surface Transportation / Sustainability @ Amazon EU in Luxembourg
Hello everyone,
Amazon EU has an opening for a research / applied scientist at the Amazon EU in Luxembourg to work on problems related to surface transportation and sustainability (i.e. the middle-mile logistics part of Amazon's climate pledge).
You will be joining a quickly growing multi-national research team that tackles challenging problems related to logistics and sustainability on a world wide scale. Our team is in the fast growing Amazon EU headquarters in Luxembourg City, which has more than 3000 employees already.
Luxembourg is a small country in the heart of Europe with a very international population and excellent public health care and social security, free public transport and very low crime. It is well connected to all the major European cities. Luxembourg has three official languages (Luxembourgish, French, German) and English is widely spoken as well.
Amazon is committed to a diverse and inclusive workplace. Amazon is an equal opportunity employer and does not discriminate on the basis of race, national origin, gender, gender identity, sexual orientation, protected veteran status, disability, age, or other legally protected status.
We are very willing to sponsor visas!
BASIC QUALIFICATIONS
* PhD in Operations Research, Machine Learning, Statistics, Applied Mathematics, Engineering, Computer Science or other field related to algorithms.
* Excellent written and verbal communication skills. Ability to communicate at a level appropriate to the audience.
* Experience implementing algorithms in traditional programming languages (C++/ Java/ python)
* Comfortable to tradeoff complexity and efficiency of solution methodologies, according to the requirements of the problem. Ability to deal with ambiguity.
* Experience designing and implementing models and algorithms for one or more:
* Combinatorial optimization problems (e.g., scheduling, vehicle routing, and facility location).
* Continuous optimization problems (e.g., linear programming, convex programming, non-convex programming).
* Predictive analytics (e.g., forecasting, time-series, neural networks)
* Prescriptive analytics (e.g., stochastic optimization, bandits, reinforcement learning).
PREFERRED QUALIFICATIONS
* Detailed knowledge of optimization methods including linear and mixed-integer programming, network modeling, constraint programming, approximation algorithms, and advanced heuristic techniques.
* Expertise on MIP strategies to customize and leverage commercial algorithms and adapt them as required.
* Detailed knowledge of forecasting techniques with time-series tools, including ARIMA models, exponential smoothing, LSTM, CNNs.
* Expertise on policy optimization techniques, including reinforcement learning, deep Q-learning, bandits, and online optimization.
* Experience implementing models and analysis tools through the use of high-level modeling languages (e.g. R, Matlab as examples).
* Experience collecting, processing and combining big data with appropriate methodologies (e.g. Hadoop, Map-Reduce)
To apply please use the link:
https://amazon.jobs/en/jobs/1667294/research-scientist
Best regards,
Martin Gross
Amazon Transportation Services
Senior Applied Scientist
Sustainability & Surface Transportation Research
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/
*
**********************************************************
Amazon EU has an opening for a research / applied scientist at the Amazon EU in Luxembourg to work on problems related to surface transportation and sustainability (i.e. the middle-mile logistics part of Amazon's climate pledge).
You will be joining a quickly growing multi-national research team that tackles challenging problems related to logistics and sustainability on a world wide scale. Our team is in the fast growing Amazon EU headquarters in Luxembourg City, which has more than 3000 employees already.
Luxembourg is a small country in the heart of Europe with a very international population and excellent public health care and social security, free public transport and very low crime. It is well connected to all the major European cities. Luxembourg has three official languages (Luxembourgish, French, German) and English is widely spoken as well.
Amazon is committed to a diverse and inclusive workplace. Amazon is an equal opportunity employer and does not discriminate on the basis of race, national origin, gender, gender identity, sexual orientation, protected veteran status, disability, age, or other legally protected status.
We are very willing to sponsor visas!
BASIC QUALIFICATIONS
* PhD in Operations Research, Machine Learning, Statistics, Applied Mathematics, Engineering, Computer Science or other field related to algorithms.
* Excellent written and verbal communication skills. Ability to communicate at a level appropriate to the audience.
* Experience implementing algorithms in traditional programming languages (C++/ Java/ python)
* Comfortable to tradeoff complexity and efficiency of solution methodologies, according to the requirements of the problem. Ability to deal with ambiguity.
* Experience designing and implementing models and algorithms for one or more:
* Combinatorial optimization problems (e.g., scheduling, vehicle routing, and facility location).
* Continuous optimization problems (e.g., linear programming, convex programming, non-convex programming).
* Predictive analytics (e.g., forecasting, time-series, neural networks)
* Prescriptive analytics (e.g., stochastic optimization, bandits, reinforcement learning).
PREFERRED QUALIFICATIONS
* Detailed knowledge of optimization methods including linear and mixed-integer programming, network modeling, constraint programming, approximation algorithms, and advanced heuristic techniques.
* Expertise on MIP strategies to customize and leverage commercial algorithms and adapt them as required.
* Detailed knowledge of forecasting techniques with time-series tools, including ARIMA models, exponential smoothing, LSTM, CNNs.
* Expertise on policy optimization techniques, including reinforcement learning, deep Q-learning, bandits, and online optimization.
* Experience implementing models and analysis tools through the use of high-level modeling languages (e.g. R, Matlab as examples).
* Experience collecting, processing and combining big data with appropriate methodologies (e.g. Hadoop, Map-Reduce)
To apply please use the link:
https://amazon.jobs/en/jobs/1667294/research-scientist
Best regards,
Martin Gross
Amazon Transportation Services
Senior Applied Scientist
Sustainability & Surface Transportation Research
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] 5th Conference on Cloud and Internet of Things - Extended deadline to: September 4th
**********************************************************************************************
CALL FOR PAPERS - CIoT 2021
5th Conference on Cloud and Internet of Things
November 08 - 10, 2021
Marrakech, Morocco
Accepting Virtual Participation
https://ciot2021.dnac.org/
CALL FOR PAPERS - CIoT 2021
5th Conference on Cloud and Internet of Things
November 08 - 10, 2021
Marrakech, Morocco
Accepting Virtual Participation
https://ciot2021.dnac.org/
CIoT 2021 is technically co-sponsored by IEEE, IEEE ComSoc
All accepted & presented papers will be submitted to IEEE Xplore
**********************************************************************************************
MPORTANT DATES
---------------
Paper Submission deadline : *September 4, 2021 (Firm)*
Notification: October 4, 2021
Camera-Ready: October 14, 2021
------------------------------------------------------------
Submission link: https://edas.info/N28114
------------------------------------------------------------
It is with great pleasure to welcome you to The 5th edition of Conference
on Cloud and Internet of Things 2021 will be held from November 8
to November 10, 2021 in Marrakech, Morocco.
CIoT provides a high-quality international academic and industrial exchange
forum for experts and scholars in the field of intelligent systems, cloud
computing and Internet of Things.
The conference will be designed and prepared as a in person event. However,
in the case of perduring traveling restrictions (official or de facto)
during the conference dates due to the COVID-19 pandemic, we will be ready
to convert the conference to a fully on-line event.
We hope the conditions will allow for in-person participation, so we can
enjoy face-to-face discussions and coffee breaks again. It would also give
the opportunity to participants to visit the beautiful city of Marrakech.
CIoT is a conference focusing on the challenges of managing Internet of
Things applications while considering the whole end-to-end architecture
over the sixth generation of mobile networks (6G) and next-generation data
center networking from to cloud to the edge and IoT devices. The next
generation of telecommunication networks is expected to support a growing
number of smart terminals, such as cell phones, sensors and other connected
objects, to provide real-time applications and to provide intelligence and
trust embedded in network infrastructure. To meet these requirements, the
6G envisions the use of artificial intelligence, cloud and edge computing.
The 6G network will absorb the billions of flows generated by things while
considering the requested QoS and the cohabitation of M2M, M2H and H2M
flows. Then, the flows will be processed in data centers and applications
will exploit the extracted knowledge.
The main objective of CIoT'21 is to address challenges of clouds and IoT
systems from the sensors/machines to the end-users attached to the Cloud
while considering the 6G network connecting both IoT and Cloud domains.
Authors are invited to submit original contributions that have not been
published or submitted for publication elsewhere. Papers should be prepared
using the IEEE 2-column conference style and are limited to 8 pages (full
papers). They have to be submitted electronically in PDF format. Papers
exceeding page limits, multiple submissions, and self-plagiarized papers
will be rejected without further review. All other papers will sustain a
thorough single-blind review process.
CIoT'21 will also hold an industrial track. The industrial track gathers
scholars and industrial participants to highlight practical and real-world
studies and applications of cloud and IoT technologies. This track aims to
foster cooperation between participants engaged in scientific research and
practitioners working to improve the development of new cloud and IoT
applications. Each submission should describe the problem addressed, the
approach used, the current state of the project, an evaluation of the
benefits or lessons learned, and future developments. Industrial track
submissions are extended abstracts of 2 pages.
All submissions must be written in English and must use standard IEEE
two-column conference template, available for download from the IEEE
website: https://www.ieee.org/conferences/publishing/templates.html
Only PDF files will be accepted for the review process and all submissions
must be done electronically through EDAS using the following link:
https://edas.info/N28114
The technical papers presented at the conference will be invited to submit
an extended version in the Special Issue Electronics for Agriculture,
MDPI Journal
https://www.mdpi.com/journal/electronics/special_issues/eagriculture_electronics
Best papers will be considered for fast-track publication in a special
issue of Annals of Telecommunications (Springer, ISI-indexed)
The conference covers all research and novel papers tackling the following
topics, but not limited to:
* Cloud, Edge and Fog for the IoT
* Cloud Computing (IAAS, FAAS, PAAS, CAAS, SAAS) for IoT
* Cloud Computing based on IoT technologies
* Cloud Metering and Monitoring
* Security and privacy in Clouds and IoT
* Artificial Intelligence for IoT, Edge IA
* Mobile-Edge Computing, Multi-access Edge Computing
* IoT 5G slice management
* Wireless sensor networks
* Networks for IoT : LoRa, SigFox, NB-IoT, Wi-FI, IEEE 802.11ah, etc.
* Green communication and IoT
* Radio frequency identification
* Cloud Networking for IoT
* Network Function Virtualization (NFV) for IoT
* Architecture and protocols for IoT and Cloud
* Distributed platforms for IoT
* Centralized and distributed system for IoT
* IoT management system
* Open Platforms for IoT
* Commercial platforms for IoT
* Real-time systems for IoT
* Next Generation Infrastructure for IoT
* IoT big data and analytics
* Wearable Devices for IoT
* Participative Internet
* IoT Applications and Services
* Smart Home, Smart City
* Industry 4.0 and Industrial IoT (IIoT)
* IoT-based Enterprise Management
* IoT-based Business Process Management
* Robots and IoT
* Testbeds and experimental platforms for IoT and the Cloud
* IoT Standards and Application Scenarios
* Open topics for future IoT e.g. Digital Twins
* Blockchain for IoT
* Machine/Deep learning for IoT applications, data management, data
processing
*****************************************************************************
General Chairs:
El Amri Hassan (ENS Casablanca, Morocco)
Nidal Nasser (Alfaisal University, Saudi Arabia)
TPC Chairs:
Lei Shu (Nanjing Agricultural University, China)
Thierry Coupaye (Orange Labs, France)
Rachid Saadane (Hassania School of Public Works, Morocco)
*Dr. M.Lahby*
Laboratory of Mathematics and Applications, University Hassan II, Ecole
Normale Supérieure (ENS) Casablanca, Morocco
mlahby@gmail.com
GSM : +212 6 65 29 23 76
In the world of Linux, who needs Windows and Gates
**********************************************************
*
* 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/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
