MEDIC A Multi Task Learning Dataset for Disaster Image Classification

MEDIC (available at:https://crisisnlp.org/medic/index.html) is the largest social media image classification dataset for humanitarian response consisting of 71,198 images . The proposed dataset is an important resource for advancing image-based disaster management and multi-task machinelearning research . MEDIC is the first dataset of its kind: social media images, disaster response, andmulti-task learning research .…

Towards formally analyzed Cyber Physical Systems

Cyber-physical systems (CPS) can be found everywhere: smart homes, autonomous vehicles, aircrafts, healthcare, agriculture and industrial production lines . The paradigm ofmodel-driven design provides a toolkit supporting the design and analysis and by choosing the proper formalisms, the model-driven approach allows usto validate our system at design time.…

Second Order Finite Automata

Traditionally, finite automata theory has been used as a framework for therepresentation of possibly infinite sets of strings . In this work, we show that sets ofsets of strings represented by automata are closed under the usual Boolean operations, such as union, intersection, difference and even a suitable notion of complementation .…

Cirquent calculus in a nutshell

Cirquent calculus is a novel system for resource-conscious logics . It is a refinement of calculus with mechanisms that allow to account for the possibility of sharing of subexpressions/subresources between different resources . This is achieved by dealing with circuit-styleconstructs, termed cirquents, instead of formulas, sequents or other tree-likestructures .…

Parameterizations of Logarithmic Space Reductions Stack State Complexity of Nonuniform Families of Pushdown Automata and a Road to the LOGCFL subseteq LOGDCFL poly Question

The complexity class LOGCFL (resp., LOGDCFL) consists of all languages thatare many-one reducible to context-free languages using logarithmic space . We extend this old subject to stack-statecomplexity (i.e., the total number of inner states plus simultaneously pushablestack symbol series) of nonuniform families of various pushdown automata .…

Feature Analysis for ML based IIoT Intrusion Detection

Industrial Internet of Things (IIoT) networks have become an increasinglyattractive target of cyberattacks . Powerful Machine Learning (ML) models have recently been adopted to implement Network Intrusion Detection Systems (NIDSs), which can protect IIoT networks . For the successful training of such ML models,it is important to select the right set of data features, which maximise thedetection accuracy as well as computational efficiency .…

Parameterizing the Permanent Hardness for K_8 minor free graphs

In the 1960s, statistical physicists discovered a fascinating algorithm forcounting perfect matchings in planar graphs . Valiant later showed that the same problem is #P-hard for general graphs . Since then, the algorithm for planargraphs was extended to bounded-genus graphs, to graphs excluding $K_{3,3}$ or$K_{5}$ and more generally, to any graph class excluding a fixed minor $H$that can be drawn in the plane with a single crossing .…

Second Order Finite Automata

Traditionally, finite automata theory has been used as a framework for therepresentation of possibly infinite sets of strings . In this work, we show that sets ofsets of strings represented by automata are closed under the usual Boolean operations, such as union, intersection, difference and even a suitable notion of complementation .…

Towards Reference Architectures for Trustworthy Collaborative Cyber Physical Systems Reference Architectures as Boundary Objects

This paper presents our work-in-progress study on reference architectures asboundary objects for realizing trustworthy collaborative Cyber-Physical Systems . Furthermore, the preliminary results from interviews with systems engineering experts from industry and academia are also discussed . Theinterview results reveal challenges in using reference architectures during the development process .…

Second Order Finite Automata

Traditionally, finite automata theory has been used as a framework for therepresentation of possibly infinite sets of strings . In this work, we show that sets ofsets of strings represented by automata are closed under the usual Boolean operations, such as union, intersection, difference and even a suitable notion of complementation .…

Certifying One Phase Technology Assisted Reviews

Technology-assisted review (TAR) workflows based on iterative active learning are widely used in document review applications . Most stopping rules for one-phase TAR workflows lack valid statistical guarantees, which has encouraged their use in some legal contexts . Counterintuitively, incurring alarger sampling cost to reduce excess recall leads to lower total cost in almost all scenarios .…

Outlier Detection in Smart Grid Communication

Industrial Control System (ICS) networks transmit control and monitoring datain critical environments such as smart grid . Cyber attacks on smart gridcommunication may cause fatal consequences on energy production, distribution,and eventually the lives of people . Traditional smart grid security tools like firewalls or Intrusion Detection Systems (IDS) are not able to detect internal threats .…

Parameterizing the Permanent Hardness for K_8 minor free graphs

In the 1960s, statistical physicists discovered a fascinating algorithm forcounting perfect matchings in planar graphs . Valiant later showed that the same problem is #P-hard for general graphs . Since then, the algorithm for planargraphs was extended to bounded-genus graphs, to graphs excluding $K_{3,3}$ or$K_{5}$ and more generally, to any graph class excluding a fixed minor $H$that can be drawn in the plane with a single crossing .…

Parameterizations of Logarithmic Space Reductions Stack State Complexity of Nonuniform Families of Pushdown Automata and a Road to the LOGCFL subseteq LOGDCFL poly Question

The complexity class LOGCFL (resp., LOGDCFL) consists of all languages thatare many-one reducible to context-free languages using logarithmic space . We extend this old subject to stack-statecomplexity (i.e., the total number of inner states plus simultaneously pushablestack symbol series) of nonuniform families of various pushdown automata .…

TAR on Social Media A Framework for Online Content Moderation

Content moderation (removing or limiting the distribution of posts based on contents) is one tool social networks use to fight problems such as harassment and disinformation . Manually screening all content is usually impractical given the scale of social media data, and the need for nuancedhuman interpretations makes fully automated approaches infeasible .…

MEDIC A Multi Task Learning Dataset for Disaster Image Classification

MEDIC (available at:https://crisisnlp.org/medic/index.html) is the largest social media image classification dataset for humanitarian response consisting of 71,198 images . The proposed dataset is an important resource for advancing image-based disaster management and multi-task machinelearning research . MEDIC is the first dataset of its kind: social media images, disaster response, andmulti-task learning research .…

Second Order Finite Automata

Traditionally, finite automata theory has been used as a framework for therepresentation of possibly infinite sets of strings . In this work, we show that sets ofsets of strings represented by automata are closed under the usual Boolean operations, such as union, intersection, difference and even a suitable notion of complementation .…

Generating Answer Candidates for Quizzes and Answer Aware Question Generators

In education, open-ended quiz questions have become an important tool for assessing students’ knowledge . Yet, manually preparing such questions is a tedious task, and thus automatic question generation has been proposed as apossible alternative . We propose a model that can generate a specified number of answer candidates for a given passage of text, which can then be used by instructors to write questions manually or can be passed as an input to answer-aware question generators .…

Characterizing Malicious URL Campaigns

URLs are central to a myriad of cyber-security threats, from phishing to the distribution of malware . VirusTotal analysed 311M records containing 77M uniquereal-world URLs submitted to VirusTotal from Dec 2019 to Jan 2020 . From this dataset, 2.6M suspicious campaigns were identified based on their metadata, of which 77,810 were doubly verified as malicious .…

Parameterizing the Permanent Hardness for K_8 minor free graphs

In the 1960s, statistical physicists discovered a fascinating algorithm forcounting perfect matchings in planar graphs . Valiant later showed that the same problem is #P-hard for general graphs . Since then, the algorithm for planargraphs was extended to bounded-genus graphs, to graphs excluding $K_{3,3}$ or$K_{5}$ and more generally, to any graph class excluding a fixed minor $H$that can be drawn in the plane with a single crossing .…

Towards Reference Architectures for Trustworthy Collaborative Cyber Physical Systems Reference Architectures as Boundary Objects

This paper presents our work-in-progress study on reference architectures asboundary objects for realizing trustworthy collaborative Cyber-Physical Systems . Furthermore, the preliminary results from interviews with systems engineering experts from industry and academia are also discussed . Theinterview results reveal challenges in using reference architectures during the development process .…

Towards formally analyzed Cyber Physical Systems

Cyber-physical systems (CPS) can be found everywhere: smart homes, autonomous vehicles, aircrafts, healthcare, agriculture and industrial production lines . The paradigm ofmodel-driven design provides a toolkit supporting the design and analysis and by choosing the proper formalisms, the model-driven approach allows usto validate our system at design time.…

A Survey and Comparative Study on Multi Cloud Architectures Emerging Issues And Challenges For Cloud Federation

Multi-cloud concept has broaden the world of cloud computing and has become abuzzword today . The word multi-cloud envisions utilization of services from multiple heterogeneous cloud providers via a single architecture at customerpremises . Cloud computing has many issues and offers open research challenges, still the academics and industrial research has paved a pathway formulti-cloud environment .…

An Experimental Analysis of Graph Distance Algorithms for Comparing API Usages

Modern software development relies on the reuse of functionalitiesthrough Application Programming Interfaces (APIs) However, client developers have issues identifying the correct usage of a certain API, causing misusesaccompanied by software crashes or usability bugs . Researchers have identified a set of eight graph-based distance algorithms and applied them on two datasets of real-world API usages and misuses .…

Parameterizing the Permanent Hardness for K_8 minor free graphs

In the 1960s, statistical physicists discovered a fascinating algorithm forcounting perfect matchings in planar graphs . Valiant later showed that the same problem is #P-hard for general graphs . Since then, the algorithm for planargraphs was extended to bounded-genus graphs, to graphs excluding $K_{3,3}$ or$K_{5}$ and more generally, to any graph class excluding a fixed minor $H$that can be drawn in the plane with a single crossing .…

Characterizing Malicious URL Campaigns

URLs are central to a myriad of cyber-security threats, from phishing to the distribution of malware . VirusTotal analysed 311M records containing 77M uniquereal-world URLs submitted to VirusTotal from Dec 2019 to Jan 2020 . From this dataset, 2.6M suspicious campaigns were identified based on their metadata, of which 77,810 were doubly verified as malicious .…