[Om-announce] CFP: ICLP 2019 - Application Track

[Fioretto, Ferdinando]

Apologies for cross-posting

** CALL FOR PAPERS **

The 35th International Conference on Logic Programming (ICLP 2019)
Applications Track

September 21-25, 2019
Las Cruces, New Mexico (USA)
https://www.cs.nmsu.edu/ALP/iclp2019/
-

Objectives

Logic programming (LP) has been widely adopted as a powerful declarative 
programming paradigm to build a variety of applications from research projects 
to industrial products, including bioinformatics, natural language 
understanding, robotics, etc. Motivated by such a wide range of applications, 
this year ICLP will have a special track dedicated to Applications of LP, to 
bring together LP researchers and practitioners from both academia and industry 
communities to share the recent advancement, challenge and insight for LP 
applications.

The goal of the Application Track is two-folded.  On the one side, it aims at 
providing a fresh impulse for the LP community to recast its interests towards 
solving practical problems and applications. On the other side, its goal is to 
attract representatives from the wider academia and industrial communities to 
discuss their challenges related to using LP in practical problems, 
applications and industrial products and their expectations of the development 
of theory and tools from LP community.


Expected contributions

The Applications Track at ICLP 2019 invites submissions of papers on emerging 
and deployed applications of LP, describing all aspects of the development, 
deployment, and evaluation of LP systems to solve real-world problems, 
including interesting case studies and benchmarks, and discussing lessons 
learned.

We welcome LP applications in a wide range of areas, including but not limited 
to:


  *   industrial applications
  *   commonsense reasoning, knowledge representation
  *   declarative problem solving
  *   education
  *   bioinformatics, computational biology
  *   life sciences, genetics, medicine, pharmacology
  *   cognitive robotics, social robotics, human-robot interactions
  *   intelligent transportation, logistics
  *   computer vision, sensing, internet of things
  *   data analysis, machine learning
  *   creative computing
  *   digital forensics, cybersecurity, blockchain
  *   economics, game theory, social choice
  *   software engineering, intelligent user interfaces
  *   multi-agent systems, argumentation, epistemic reasoning
  *   constraint programming, SAT, SMT
  *   natural language understanding, story telling, question answering
  *   explanation generation, diagnosis
  *   spatial/temporal/probabilistic reasoning
  *   planning and scheduling
  *   databases, ontologies, knowledge bases, Semantic Web


Evaluation Criteria

In this track, selection process of the highest quality papers will apply the 
following criteria:


  *   Significance of the real-world problem being addressed
  *   Importance and novelty of using logic programming technologies to solve 
this problem
  *   Evaluation and applicability of the system in real-world
  *   Reusability of datasets, case studies and benchmarks


Important Dates


  *   Abstract registration: April 27, 2019
  *   Paper submission: May 4, 2019
  *   Notification: June 19, 2019
  *   TPLP revision submission: July 3, 2019
  *   TPLP final notifications: July 17, 2019
  *   Camera-ready copy: July 31, 2017
  *   Conference: September 21-25, 2019


Submission Details

All submissions must be written in English.


  *   Regular papers (14 pages in TPLP format, including references) must 
describe original, previously unpublished research, and must not simultaneously 
be submitted for publication elsewhere. These restrictions do not apply to 
previously accepted workshop papers with a limited audience and/or without 
archival proceedings. The accepted regular papers will be published in TPLP, 
along with the selected ICLP-TPLP papers.

The program committee may recommend some regular papers to be published as 
technical communications (TCs), along with the selected ICLP-TC papers. The 
authors of the TCs can also elect to convert their submissions into extended 
abstracts (2 or 3 pages) for inclusion in the OASIcs proceedings. This should 
allow authors to submit a long version elsewhere.


  *   Short papers (7 pages in OASIcs format, including references) can 
describe published research. The accepted short papers that describe original 
and previously unpublished work will be published as TCs, along with the 
selected ICLP-TC papers. The accepted short papers that describe published 
research will be made available at the conference webpage, with the permission 
of the authors.

All accepted regular papers and technical communications will be presented 
during the conference. Authors of accepted papers will, by default, be 
automatically included in the list of ALP members, who will receive quarterly 
updates from the Logic Programming Newsletter at no 

[Om-announce] CFP: ICLP 2019 - Sister Conferences and Journal Presentation Track

[Fioretto, Ferdinando]

Apologies for cross-posting

ICLP 2019 Sister Conferences and Journal Presentation Track - Call for Papers

The program committee of the 35th International Conference on Logic Programming 
(ICLP) invites submissions of published journal papers and papers presented at 
related conferences for the Sister Conferences and Journal Presentation Track.
The track is designed to provide a forum to discuss important results related 
to logic programming that appeared since 2017 in selective journals or were 
presented recently at related conferences but, but that have not been 
previously presented at ICLP.
The goal of this track is twofold:

  *   To provide authors an opportunity to present at the conference important 
results published in journals that might otherwise not be submitted to the 
conference due to their length and complexity. Papers that differ from 
traditional ICLP format and topics are welcome.
  *   To broaden the program with lines of work at the intersection between 
logic programming and related fields such as for example constraint 
programming, operations research, control, knowledge representation and 
reasoning, machine learning, multi-agent systems, robotics, computer games, and 
cognitive science. Papers that use logic programming in some innovative way are 
welcome.

Paper Presentation
All accepted submissions will be presented orally during the conference - at 
least one author is expected to register to ICLP 2019 and to present the paper 
in person. Complete citations and URLs of the original papers (if available 
from the publisher) will be published on the ICLP 2019 web site as a permanent 
reference. A 2-page extended abstract summarizing the line of research leading 
to the presented results can optionally be submitted for presentation in the 
technical communications of ICLP.

Submission Requirements
Submissions must meet the following criteria:

  *   Candidate papers must be published in a journal such as (but not limited 
to) AIJ, ACM TOCL, JAIR, or other leading journals or in the proceedings of 
related conferences such as KR, LPNMR, AAMAS, AAAI, IJCAI, ECAI, ICAPS, SAT, 
ICML, ICDT, PODS, VLDB, WWW, ISWC, ESWC, DL, JELIA, …
  *   Candidate papers must have appeared since 2017.
  *   Papers that are in press may be submitted as long as the final 
camera-ready version is available.
  *   Extensions of papers that have been previously presented at ICLP are not 
eligible for this track.

Submission Process
All submissions will be done via EasyChair 
(https://easychair.org/conferences/overview.cgi?a=20693669). The submission 
will be in the following format:

  *   Title of the original journal paper (to be published on the Web);
  *   Complete reference of the original paper (to be published on the Web);
  *   URL where the paper can be downloaded from the publisher (if available) 
(to be published on the Web);
  *   An accompanying letter containing an explanation of why this paper is 
interesting to the logic programming community (in PDF);
  *   A copy of the paper with its final camera-ready contents (in PDF).
  *   A 2-page extended abstract of the paper (in PDF, LNCS format) (optional: 
only if the authors wish to publish such an extended abstract in the technical 
communications of ICLP).

Submissions will go through a selection process. Selection criteria include 
significance of the results and relevance to the logic programming community.

Important Dates

  *   Submission deadline: June 27th, 2019
  *   Notification of acceptance: July 15, 2019
  *   Conference: September 21-25, 2019

Journal Presentation Track Chairs

  *   Bart Bogaerts, Vrije Universiteit Brussel, 
bart.bogae...@vub.be
  *   Giovambattista Ianni, University of Calabria, 
ia...@unical.it
  *
___
Om-announce mailing list
Om-announce@openmath.org
http://mailman.openmath.org/cgi-bin/mailman/listinfo/om-announce

[Om-announce] CADE-27: Second Call for Papers

[geoff]

The 27th International Conference on Automated Deduction (CADE-27)
Natal, Brazil
25-30 August 2019
http://www.cade-27.info

CALL FOR PAPERS

CADE is the major international forum for presenting research on all aspects 
of automated deduction. High-quality submissions on the general topic of 
automated deduction, including foundations, applications, implementations, 
theoretical results, practical experiences and user studies are solicited.

Key dates:
  Abstract deadline (extended):20 February 2019
  Submission deadline (extended):  27 February 2019

* Logics of interest include propositional, first-order, equational, 
  higher-order, classical, description, modal, temporal, many-valued, 
  constructive, other non-classical, meta-logics, logical frameworks, type 
  theory, set theory, as well as any combination thereof.

* Paradigms of interest include theorem proving, model building, constraint 
  solving, computer algebra, model checking, proof checking, and their 
  integration.

* Methods of interest include resolution, superposition, completion, 
  saturation, term rewriting, decision procedures, model elimination, 
  connection methods, tableaux, sequent calculi, natural deduction, as 
  well as their supporting algorithms and data structures, including 
  matching, unification, orderings, induction, indexing techniques, proof 
  presentation and explanation, proof planning.

* Applications of interest include program analysis, verification and 
  synthesis of software and hardware, formal methods, computational logic, 
  computer mathematics, natural language processing, computational 
  linguistics, knowledge representation, ontology reasoning, deductive 
  databases, declarative programming, robotics, planning, and other areas 
  of artificial intelligence.

Submissions can be made in two categories: regular papers and system 
descriptions. The page limit in Springer LNCS style is 15 pages excluding 
references for regular papers and 10 pages excluding references for system 
descriptions. Submissions must be unpublished and not submitted for 
publication elsewhere. They will be judged on relevance, originality, 
significance, correctness, and readability.  System descriptions must 
contain a link to a working system and will also be judged on usefulness 
and design. Proofs of theoretical results that do not fit in the page limit, 
executables of systems, and input data of experiments should be made 
available, via a reference to a website or in an appendix of the paper. 
For papers containing experimental evaluations, all data needed to rerun 
the experiments must be available. Reviewers will be encouraged to consider 
this additional material, but submissions must be self-contained within the 
respective page limit; considering the additional material should not be 
necessary to assess the merits of a submission. The review process will 
include a feedback/rebuttal period where authors will have the option to 
respond to reviewer comments. The PC chair may solicit further reviews after 
the rebuttal period.

The proceedings of the conference will be published in the Springer LNCS/LNAI 
series. Formatting instructions and the LNCS style files can be obtained at

http://www.springer.de/comp/lncs/authors.html

At every CADE conference the Program Committee selects one of the accepted 
papers to receive the CADE Best Paper Award. The award recognizes a paper 
that the Program Committee collegially evaluates as the best in terms of 
originality and significance, having substantial confidence in its correctness. 
Overall technical quality, completeness, scholarly accuracy, and readability 
are also considered. Characteristics associated with a best paper include, 
for instance, introduction of a strong new technique or approach, solution 
of a long-standing open problem, introduction and solution of an interesting 
and important new problem, highly innovative application of known ideas or 
existing techniques, and presentation of a new system of outstanding power. 
Under exceptional circumstances, the Program Committee may give two awards 
(ex aequo) or give no award.

IMPORTANT DATES
  Abstract deadline:20 February 2019
  Submission deadline:  27 February 2019
  Rebuttal phase:   2  April2019
  Notification: 15 April2019
  Final version:27 May  2019

SUBMISSION INSTRUCTIONS

Papers should be submitted via

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

CADE-27 ASSOCIATED EVENTS

Automated Reasoning: Challenges, Applications, Directions, Exemplary
Achievements (ARCADE), http://cl-informatik.uibk.ac.at/users/swinkler/arcade/
The CADE ATP System Competition, http://www.tptp.org/CASC/27/
Deduction Mentoring Workshop
Logical and Semantic Frameworks, with Applications (LSFA),
https://sites.google.com/view/lsfa2019
Proof eXchange for Theorem Proving (PxTP), http://pxtp.gforge.inria.fr/2019/
Theorem Prover Components for Educational 

[Om-announce] Call for Papers: ARES 2019

[res.mb.conference]

ARES 2019 - CALL FOR PAPERS

**
The 14th International Conference on Availability, Reliability and Security 
(ARES 2019)
August 26 - August 29, 2019, Canterbury, UK
http://www.ares-conference.eu
**

CD-MAKE 2019 (https://cd-make.net/) will be co-located with ARES!

***
ARES CONFERENCE

The 14th International Conference on Availability, Reliability and Security 
("ARES - The International Dependability Conference") will bring together 
researchers and practitioners in the area of dependability. ARES will highlight 
the various aspects of dependability - with special focus on the crucial 
linkage between availability, reliability and security.

ARES aims at a full and detailed discussion of the research issues of 
dependability as an integrative concept that covers amongst others 
availability, safety, confidentiality, integrity, maintainability and security 
in the different fields of applications.

ARES will emphasize the interplay between foundations and practical issues of 
dependability in emerging areas such as e-government, m-government, 
location-based applications, ubiquitous computing, autonomous computing, 
chances of grid computing etc. ARES is devoted to the critical examination and 
research challenges of the various aspects of Dependable Computing and the 
definition of a future road map.

Selected papers that are accepted by and presented at the ARES Conference will 
be published, after further revision, in special issues of international 
journals (e.g. Springer EURASIP Journal on Information Security). The 
acceptance rate of the ARES 2018 conference was 22,3% (full papers only). ARES 
2018 was published by the International Conference Proceedings Series published 
by ACM (ACM ICPS).
ARES is ranked as B-conference in CORE.

Qualis (backed by Brazilian Ministry) ranked ARES and ESORICS as leading 
security conference in Europe (A2)


CONFERENCE OFFICERS

General Chair 2019
Shujun Li, University of Kent

Program Committee Chair 2019
Steven Furnell, University of Plymouth


IMPORTANT DATES

Submission Deadline: March 15, 2019
Author Notification: May 24, 2019
Proceedings Version: June 23, 2019
Conference: August 26 - August 29, 2019


SUBMISSION

ARES 2019 will be published by the International Conference Proceedings Series 
published by ACM (ACM ICPS).

Authors are invited to submit research and application papers according the 
following guidelines: two columns, single-spaced, including figures and 
references, using 10 pt fonts and number each page.

For the main conference as well as the workshops submission papers are 
classified into 3 categorizes representing original, previously unpublished 
work:
-full paper (10 pages)
-short paper (6 pages)
-workshop paper (8 pages, a maximum of 10 pages is tolerated)

The ARES submission system (EasyChair) is available here: 
https://easychair.org/conferences/?conf=ares2019
More information can be found here:

***
TOPCIS of interest include, but are not limited to:

Authorization, Authentication, and Access Control
Availability, Dependability, and Resilience
Botnets and Botnet Monitoring
Business Continuity & Resilience
Cost/Benefit Analysis
Cryptography
Dependability Aspects for Special Applications
Dependability Aspects of e-Government
Dependability and Resilience in Open Source Software
Designing Security Requirements
Digital Forensics
E-Commerce Dependability
Identity Management
IPR of Security Technology
Incident Response and Prevention
Information Flow Control
Information Hiding and Steganograhpy
Interoperability Aspects
Intrusion Detection and Fraud Detection
Legal Issues related to Security and Privacy
Mobile Security
Network and Organizational Vulnerability Analysis
Network Security
Privacy-Enhancing Technologies
Process based Security Models and Methods
Resilience and Security for Critical Infrastructures
Resilience of Computing Systems
Resilience, Security, and Privacy for Smart Grids
Resilience, Security, and Privacy for the Internet of Things
RFID Security and Privacy
Risk planning, Analysis & Awareness
Safety Critical Systems
Secure Enterprise Architectures
Security and Privacy for Ubiquitous Systems
Security and Privacy in E-Health
Security and Trust Management in P2P and Grid applications
Security and Privacy for Sensor Networks, Wireless/Mobile Devices and 
Applications
Security and Usability
Security as Quality of Service
Security in Distributed Systems / Distributed Databases
Security in Electronic Payments
Security in Electronic Voting
Software Engineering of Dependable Systems
Software Security
Threats and Attack Modelling
Trusted Computing
Tools for Dependable System Design and Evaluation
Trust Models and Trust Management
Wireless Security

[Om-announce] LATA 2019: call for participation

[IRDTA]

LATA 2019: call for participation*To be removed from our mailing list, please 
respond to this message with UNSUBSCRIBE in the subject line*


*

13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS


LATA 2019


Saint Petersburg, Russia


March 26-29, 2019


Organized by:

    

Saint Petersburg State University

and

Institute for Research Development, Training and Advice, Brussels/London


http://lata2019.irdta.eu/

*


PROGRAM


Tuesday, March 26


09:00 - 09:30    Registration


09:30 - 09:40    Opening


09:40 - 10:30    Edward A. Lee. Observation and Interaction - Invited lecture


10:30 - 11:00    Break


11:00 - 12:15


Malek Anabtawi, Sabit Hassan, Christos Kapoutsis and Mohammad Zakzok. An Oracle 
Hierarchy for Small One-way Finite Automata


Tim Becker and Klaus Sutner. Orbits of Abelian Automaton Groups


Alex Bishop and Murray Elder. Bounded Automata Groups Are co-ET0L


12:15 - 13:45    Lunch


13:45 - 15:00


Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara and Antonio 
E. Porreca. Decidability of Sensitivity and Equicontinuity for Linear 
Higher-order Cellular Automata


Ondrej Klíma and Libor Polak. On Varieties of Ordered Automata


Klaus Meer and Ameen Naif. Automata over Infinite Sequences of Reals


15:00 - 15:30    Break


15:30 - 17:10


Tomoyuki Yamakami. Non-uniform State Complexity of Quantum Finite Automata and 
Quantum Polynomial-time Logarithmic-space Computation with Quantum Advice


Vladimir Zakharov. Equivalence Checking of Prefix-free Transducers and 
Deterministic Two-tape Automata


Ilya Zakirzyanov, Antonio Morgado, Alexey Ignatiev, Vladimir Ulyantsev and Joao 
Marques-Silva. Efficient Symmetry Breaking for SAT-based Minimum DFA Inference


Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon and Daniel Rubery. Closure 
and Nonclosure Properties of the Compressible and Rankable Sets


---


Wednesday, March 27


09:00 - 09:50    Henning Fernau. Modern Aspects of Complexity within Formal 
Languages - Invited lecture


09:50 - 10:20    Break


10:20 - 11:35


Markus Holzer and Michal Hospodár. The Range of State Complexities of Languages 
Resulting from the Cut Operation


Lila Kari and Timothy Ng. State Complexity of Pseudocatenation


Daniel Padé and Stephen Fenner. Complexity of (R,C)-crosswords


11:35 - 12:05    Break and Group photo


12:05 - 13:20


Berthold Hoffmann and Mark Minas. Generalized Predictive Shift-reduce Parsing 
for Hyperedge Replacement Graph Grammars


Hans-Joerg Kreowski, Sabine Kuske and Aaron Lye. Transformation of Petri Nets 
into Context-dependent Fusion Grammars


Ryoma Senda, Yoshiaki Takata and Hiroyuki Seki. Generalized Register 
Context-free Grammars


13:20 -    14:50    Lunch


15:00        Touristic visit


---


Thursday, March 28


09:00 - 09:50    Pawel Gawrychowski. Searching and Indexing Compressed Text - 
Invited lecture


09:50 - 10:20    Break


10:20 - 11:35


Amazigh Amrane and Nicolas Bedon. Logic and Rational Languages of Scattered and 
Countable Series-parallel Posets


Marcella Anselmo, Maria Madonia and Carla Selmi. Toroidal Codes and Conjugate 
Pictures


Jean-Philippe Dubernard, Giovanna Guaiana and Ludovic Mignot. Geometrical 
Closure of Binary V3/2 Languages


11:35 - 12:05    Break


12:05 - 13:20


Galina Jirásková and Ondrej Klíma. Deterministic Biautomata and Subclasses of 
Deterministic Linear Languages


Alexis Linard, Colin de la Higuera and Frits Vaandrager. Learning Unions of 
k-Testable Languages


Iovka Boneva, Joachim Niehren and Momar Sakho. Regular Matching and Inclusion 
on Compressed Tree Patterns with Context Variables


13:20 -    14:50    Lunch


14:50 - 15:40    Vadim Lozin. From Words to Graphs, and back - Invited lecture


15:40 - 16:10    Break


16:10 - 17:25


Ajay K. Eeralla, Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. 
Rule-based Unification in Combined Theories and the Finite Variant Property


Pawel Parys. Extensions of the Caucal Hierarchy?


Ahad N. Zehmakan. Tight Bounds on the Minimum Size of a Dynamic Monopoly


---


Friday, March 29


09:00 - 09:50    Esko Ukkonen. Pattern Discovery in Biological Sequences - 
Invited lecture


09:50 - 10:20    Break


10:20 - 11:35


Emilie Charlier, Svetlana Puzynina and Elise Vandomme. Recurrence in 
Multidimensional Words


Christophe Cordero. A Note with Computer Exploration of the Triangle Conjecture


Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, 
Tomasz Walen and Wiktor Zuba. Efficient Representation and Counting of 
Antipower Factors in Words


11:35 - 12:05    Break


12:05 - 13:20


Kalpana Mahalingam and Palak Pandoh. On the Maximum Number of Distinct 
Palindromic Sub-arrays


Wojciech Rytter and Wiktor Zuba. Syntactic View of Sigma-Tau Generation of 
Permutations


Andrew Ryzhikov and Clemens Mullner. 

[Om-announce] Call for Papers: 5th IEEE Workshop on Security and Privacy in the Cloud (SPC 2019)

[lpham6]

CALL FOR PAPERS

5th IEEE Workshop on Security and Privacy in the Cloud (SPC 2019)

Washington, DC, USA, June 12, 2019

https://cns2019.ieee-cns.org/workshop/spc-5th-ieee-workshop-security-and-privacy-cloud-2019



Cloud computing is today the reference paradigm for large-scale data

storage and processing due to the convenient and efficient network

access to configurable resources that can be easily adjusted according

to the users’ needs. Although the benefits of cloud computing are

tremendous, security and privacy concerns have still a detrimental

impact on the adoption and acceptability of cloud services.

In fact, users as well as companies that rely on cloud storage and

computation services lose the direct control over the systems

managing their data and applications, thus putting the

confidentiality, integrity and availability of the data at risk.

The goal of this workshop is to bring together researchers and

practitioners who are interested in discussing the security,

privacy, and data protection issues emerging in cloud scenarios,

and possible solutions to them.



SPC 2019 is the fifth workshop in this series and will be held

in Washington, DC, USA, on June 12, in conjunction with the

IEEE Conference on Communications and Network Security

(IEEE CNS 2019).



The workshop seeks submissions from academia, industry, and

government presenting novel research, as well as experimental

studies, on all theoretical and practical aspects of security,

privacy, and data protection in cloud scenarios.

Topics of interest include, but are not limited to:

- Anonymity in cloud scenarios

- Applied cryptography in cloud scenarios

- Cloud-based biometric systems

- Data and application security

- Data and system integrity

- Data availability in outsourcing scenarios

- Data protection

- Efficient access to outsourced data

- Key management in cloud scenarios

- Privacy

- Privacy of accesses

- Secure computation over encrypted data

- Security and trust metrics

- Security and privacy in crowdsourcing

- Security and privacy in multi-clouds and federated clouds

- Security and privacy in data outsourcing

- Security and privacy in the Internet of Things

- Security and privacy of big data

- Security and privacy of distributed computations

- Security and privacy of fog computing

- Security and privacy policies

- Selective information sharing

- Threats, vulnerabilities, and risk management





PAPER SUBMISSIONS

Submitted papers must not substantially overlap papers that have

been published or that are simultaneously submitted to a journal

or a conference with proceedings. Submissions should be at most

9 pages in the IEEE 8,5"x11" two-column format

(http://cns2019.ieee-cns.org/authors/submission-instructions).

Font size should be no smaller than 10 points.

Submissions should not be anonymized.

The workshop will also consider short submissions of up to 4 pages

for results that are preliminary or that simply require few pages.



Papers should be submitted for review through EDAS

(https://edas.info/). Only PDF files will be accepted.

Submissions not meeting these guidelines risk rejection without

consideration of their merits. Papers must be received by the

deadline of March 7, 2019 (11:59 p.m. American Samoa time).

Authors of accepted papers must guarantee that their papers

will be presented at the workshop. Accepted and presented

papers will be included in the IEEE CNS 2019 conference

proceedings and also in IEEE Xplore as well as other Abstracting

and Indexing (A) databases.





IMPORTANT DATES

Paper submission due: March 7, 2019

Notification to authors: April 5, 2019

Camera ready due: April 12, 2019





PC CHAIRS

Massimiliano Albanese

George Mason University, USA



Pierangela Samarati

Università degli Studi di Milano, Italy



PUBLICITY CHAIR

Luan (Keith) Pham

George Mason University, USA



PROGRAM COMMITTEE

To be announced
___
Om-announce mailing list
Om-announce@openmath.org
http://mailman.openmath.org/cgi-bin/mailman/listinfo/om-announce

[Om-announce] [CFP] 2019 IEEE SERVICES Workshop on Cyber Security and Resilience in the Internet of Things

[Nicholas Kolokotronis]

Dear colleagues, please accept our apologies for cross-postings.

===
C a l l   F o r   P a p e r s

IEEE SERVICES Workshop on Cyber Security and Resilience in the Internet of
Things
Milan, Italy, July 8-13, 2019

http://conferences.computer.org/services/2019/workshops/cybersecurity_workshop.html
===

DESCRIPTION & SCOPE
---
The technological and industrial revolution brought by the Internet of
Things (IoT) comes with new forms of threats and attacks that exploit the
inherent complexity and heterogeneity of IoT networks. There are many
recent examples of attacks that exploit IoT devices to perform large-scale
distributed denial of service attacks, to spy on people, and to hijack
communication links, therefore delivering full control of anything that is
remotely accessible to an attacker. Those attacks deeply affect the
operation of a number of services that are vital for the society
functioning as energy, transport, communications, and so on. Moreover, IoT
is largely used in monitoring activities of complex systems as smart city,
industrial plant, health systems, bridges, and so forth. Because of that,
if an IoT system experiences an attack, it should still exhibit resilience
in the form of grateful degradation and/or survival and fast recovery
(bounce-back/bounce-forward) of the functionality from the eventual failure
or misbehavior. IoT resilience is here to understand the strategies and
methods for a cyber-attack absorption and infrastructure operational
recovery and needs to be considered as an integral part of the IOT Cyber
Security landscape. The workshop focuses on both the theoretical &
practical aspects of the security, privacy, trust and resilience of IoT
networks, devices, applications, and services as well as novel ways of
dealing with their vulnerabilities and mitigating sophisticated
cyber-attacks.

TOPICS OF INTEREST
--
Topics of interest include but are not limited to:

* Blockchain applications in IoT
* Cyber-threat intelligence
* Game-theoretic security for IoT
* Identity management and access control for IoT
* IoT and cloud forensics
* Lightweight cryptography for IoT
* Malware detection and mitigation
* Network intrusion detection/mitigation
* Privacy and data protection in IoT
* Security in mobile applications
* System and data integrity
* Trust management for IOT
* Operation recovery and continuity in IOT
* Cyber-attack resiliency IoT architecture
* Cyber Threat adaptive capacity in IOT

IMPORTANT DATES
---
Paper Submission Deadline: March 23, 2019
Notification to Author: April 15, 2019
Camera-ready & Registration: 1 May 2019

SUBMISSION GUIDELINES
-
We call for original and unpublished papers no longer than 6 pages (up to 2
additional pages may be purchased subject to approval by the Publication
Chair). All papers will be reviewed with a minimum of 3 good-quality
reviews per paper. The manuscripts should be formatted in standard IEEE
camera-ready format (double-column, 10-pt font) and be submitted as PDF
files (formatted for 8.5x11-inch paper). The submission URL is
https://easychair.org/conferences/?conf=ieeeservices2019. Authors wishing
to submit a paper to this workshop must select the track entitled IEEE
SERVICES Workshop on Cyber Security and Resilience in the Internet of
Things in order to be considered.

WORKSHOP CHAIRS
---
Emanuele Bellini, Khalifa University (emanuele.bell...@ieee.org)
Stavros Shiaeles, University of Plymouth (stavros.shiae...@plymouth.ac.uk)
Nicholas Kolokotronis, University of Peloponnese (nko...@uop.gr)
___
Om-announce mailing list
Om-announce@openmath.org
http://mailman.openmath.org/cgi-bin/mailman/listinfo/om-announce

[Om-announce] 1st World Logic Day, 14 January 2019 - Report on the Celebrations

[jean-yves beziau]

One month ago was organized the 1st World Logic Day.
It was celebrated in about 60 locations all over the world including
Warsaw,  Kolkata, Mecca, St Petersburg, Athens, Berlin,  Vatican, Montréal,
Rio de Janeiro,
as reported in the following paper in open access:
1st World Logic Day: 14 January 2019
https://link.springer.com/article/10.1007/s11787-019-00221-5

As explained, January 14 is the day of death  of Gödel and birth of Tarski.
The collected papers of Tarski (4 volumes) have just been re-edited by
Birkhäuser:
https://www.springer.com/us/book/9783319953656
We will release soon a 5th volume with unpublished documents and letters.

In the recent published Birkhäuser book
The Lvov-Warsaw School - Past and Present
https://link.springer.com/book/10.1007/978-3-319-65430-0
there are three papers about Tarski:
Alfred Tarski: Auxiliary Notes on His Legacy, by Jan Zygmunt
https://link.springer.com/chapter/10.1007/978-3-319-65430-0_31
Alfred Tarski (1901–1983), by Jan Wolenski
https://link.springer.com/chapter/10.1007/978-3-319-65430-0_27
Tarski’s Influence on Computer Science, by Solomon Feferman
https://link.springer.com/chapter/10.1007/978-3-319-65430-0_29

Jean-Yves Beziau - Editor-in-Chief
Logica Universalis (Journal)
Studies in Universal Logic (Book Series)
Birkhäuser / Springer Nature, Basel, Switzerland
___
Om-announce mailing list
Om-announce@openmath.org
http://mailman.openmath.org/cgi-bin/mailman/listinfo/om-announce