pinecone/core-2020-05-10-deduplication huggingface dataset:
Security of Cyber-Physical Systems. From Theory to Testbeds and
  Validation

Traditional control environments connected to physical systems are being
upgraded with novel information and communication technologies. The resulting
systems need to be adequately protected. Experimental testbeds are crucial for
the study and analysis of ongoing threats against those resulting
cyber-physical systems. The research presented in this paper discusses some
actions towards the development of a replicable and affordable cyber-physical
testbed for training and research. The architecture of the testbed is based on
real-world components, and emulates cyber-physical scenarios commanded by SCADA
(Supervisory Control And Data Acquisition) technologies. We focus on two
representative protocols, Modbus and DNP3. The paper reports as well the
development of some adversarial scenarios, in order to evaluate the testbed
under cyber-physical threat situations. Some detection strategies are evaluated
using our proposed testbed.Comment: 17 pages, 4 figures, 2 tables, Security of Industrial Control Systems
  & Cyber-Physical Systems , (http://www.ds.unipi.gr/cybericps2016/
Experimentation with a Big-Step Semantics for ATL Model Transformations

Formal semantics is a convenient tool to equip a model transformation language with precise meaning for its model transformations. Hence, clarifying their usage in complex scenarios and helping in the development of robust model transformation engines. In this paper, we focus on the formal specification of a model transformation engine for the declarative part of ATL.\ud
We present an implementation-agnostic, big-step, structural operational semantics for ATL transformation rules and a rule scheduler, which form the specification of an interpreter for ATL. Hence, avoiding a complex compilation phase. The resulting semantics for rules enjoys a compositional nature and we illustrate its advantages by reusing an interpreter for OCL. The semantics discussed has been validated with the implementation of an interpreter in Maude, enabling the execution of model transformations and their formal analysis using Maude’s toolkit. We also present an evaluation of the interpreter’s performance and scalability.Post-printICMT ’17: 10th International Conference on Model Transformation, Marbur
European Research Agenda for Career Guidance and Counselling

In a changing world, there is a need to reflect about the research basis of career guidance and counselling (CGC) as a professional practice, considering the contributions of various disciplines and research traditions. This paper outlines a possible European research agenda (ERA) to further enhance the knowledge foundation of the CGC practice. The proposed lines of research, which are pronounced in the ERA, are based on a literature review involving 45 researchers concerned with the CGC practice. At three events, approximately 150 researchers from across Europe were engaged in the discussion, what kind of research is needed to enhance the knowledge foundation of the CGC practice. The paper provides a systematic overview of the relevant research fields, and links key research questions to current research endeavours. Due to the necessary involvement of diverse types of practitioners, policy makers, and researchers from different disciplines to share the CGC practice and contribute to the development of its knowledge basis, the paper calls for open, cooperative and integrative research approaches, including the combination of different research paradigms and methods. The development of the European Research Agenda was co-funded by the European Union through the Lifelong Learning Programme
Conveying Audience Emotions through Humanoid Robot Gestures to an Orchestra during a Live Musical Exhibition

In the last twenty years, robotics have been applied in many\ud
heterogeneous contexts. Among them, the use of humanoid robots during\ud
musical concerts have been proposed and investigated by many authors.\ud
In this paper, we propose a contribution in the area of robotics application\ud
in music, consisting of a system for conveying audience emotions\ud
during a live musical exhibition, by means of a humanoid robot. In particular,\ud
we provide all spectators with a mobile app, by means of which\ud
they can select a specific color while listening to a piece of music (act).\ud
Each color is mapped to an emotion, and the audience preferences are\ud
then processed in order to select the next act to be played. This decision,\ud
based on the overall emotion felt by the audience, is then communicated\ud
by the robot through body gestures to the orchestra. Our first results\ud
show that spectators enjoy such kind of interactive musical performance,\ud
and are encouraging for further investigations
Learning frequent behaviors patterns in intelligent environments for attentiveness level

Nowadays, when it comes to achieving goals in business environments
or educational environments, the performance successfully has an important
role in performing a task. However, this performance can be affected by
several factors. One of the most common is the lack of attention. The individual’s
attention in performing a task can be determinant for the final quality or
even at the task’s conclusion. In this paper is intended to design a solution that
can reduce or even eliminate the lack of attention on performing a task. The
idea consist on develop an architecture that capture the user behavior through
the mouse and keyboard usage. Furthermore, the system will analyze how the
devices are used.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and
FCT – Fundação para a Ciência e Tecnologia within the Project Scope:
UID/CEC/00319/2013.info:eu-repo/semantics/publishedVersio
Challenges in smart spaces: aware of users, preferences, behaviours and habits

There are new opportunities for research in the field of smart environments that should be explored. The concepts of smart homes and home automation, are currently in growing expansion in the scientific and research point of view, as the market demands for better solutions in this field. Users want that those spaces smartly adapt to their preferences in a transparent way. This paper describes the process of planning, reasoning and modeling of a Smart Environment, using emerging wearable devices on the market (smart watches, fitness trackers, etc.) and newer technologies like NFC, BLE and Wi-Fi Direct. Enabling the user to optimize the efficiency, comfort, and safety at the environments.info:eu-repo/semantics/publishedVersio
BMS Particles in Three Dimensions

This thesis is devoted to the group-theoretic aspects of three-dimensional
quantum gravity on Anti-de Sitter and Minkowskian backgrounds. In particular we
describe the relation between unitary representations of asymptotic symmetry
groups and gravitational perturbations around a space-time metric. In the
asymptotically flat case this leads to "BMS particles", representing standard
relativistic particles dressed with gravitational degrees of freedom accounted
for by coadjoint orbits of the Virasoro group. Their thermodynamics are
described by BMS characters, which coincide with gravitational one-loop
partition functions. We also extend these considerations to higher-spin
theories and supergravity.Comment: 437 pages (including index), 33 figures. Appendix reproduced from
  arXiv:1512.03353 [hep-th]. v2: minor typos corrected; published in Springer
  These
An energy aware cost recovery approach for virtual machine migration

Datacenters provide an IT backbone for today's business and economy, and are the principal electricity consumers for Cloud computing. Various studies suggest that approximately 30% of the running servers in US datacenters are idle and the others are under-utilized, making it possible to save energy and money by using Virtual Machine (VM) consolidation to reduce the number of hosts in use. However, consolidation involves migrations that can be expensive in terms of energy consumption, and sometimes it will be more energy efficient not to consolidate. This paper investigates how migration decisions can be made such that the energy costs involved with the migration are recovered, as only when costs of migration have been recovered will energy start to be saved. We demonstrate through a number of experiments, using the Google workload traces for 12,583 hosts and 1,083,309 tasks, how different VM allocation heuristics, combined with different approaches to migration, will impact on energy effciency. We suggest, using reasonable assumptions for datacenter setup, that a combination of energy-aware ll-up VM allocation and energy-aware migration, and migration only for relatively long running VMs, provides for optimal energy efficiency
About multiplicities and applications to Bezout numbers

Let $(A,\mathfrak{m},\Bbbk)$ denote a local Noetherian ring and
$\mathfrak{q}$ an ideal such that $\ell_A(M/\mathfrak{q}M) < \infty$ for a
finitely generated $A$-module $M$. Let $\au = a_1,\ldots,a_d$ denote a system
of parameters of $M$ such that $a_i \in \mathfrak{q}^{c_i} \setminus
\mathfrak{q}^{c_i+1}$ for $i=1,\ldots,d$. It follows that $ \chi := e_0(\au;M)
- c \cdot e_0(\mathfrak{q};M) \geq 0$, where $c = c_1\cdot \ldots \cdot c_d$.
The main results of the report are a discussion when $\chi = 0$ resp. to
describe the value of $\chi$ in some particular cases. Applications concern
results on the multiplicity $e_0(\au;M)$ and applications to Bezout numbers.Comment: 11 pages, to appear Springer INdAM-Series, Vol. 20 (2017
How to flatten a soccer ball

This is an experimental case study in real algebraic geometry, aimed at
computing the image of a semialgebraic subset of 3-space under a polynomial map
into the plane. For general instances, the boundary of the image is given by
two highly singular curves. We determine these curves and show how they
demarcate the "flattened soccer ball". We explore cylindrical algebraic
decompositions, by working through concrete examples. Maps onto convex polygons
and connections to convex optimization are also discussed.Comment: 21 pages, 8 figures; to appear in Homological and Computational
  Methods in Commutative Algebr
A review of Websites and Mobile Applications for People with Autism Spectrum Disorders: Towards Shared Guidelines

Many studies show the effective positive impact of using computer technologies to support the lives of users with autism spectrum disorders (ASD), for simplifying interaction with other people, for organising daily activities, for improving relation with family and friends. Despite that, only a restricted part of the current websites is accessible for people with ASD. In this paper, we discuss a set of guidelines that should be followed by designers while developing websites or mobile applications for users with ASD. We review many of the existing websites and applications in order to check which comply with all, or parts of these guidelines. We finally highlight current common limitations and address new challenging research directions. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2017
Aspect oriented parallel framework for java

This paper introduces aspect libraries, a unit of modularity in parallel programs with compositional properties. Aspects address the complexity of parallel programs by enabling the composition of (multi-ple) parallelism modules with a given (sequential) base program. This paper illustrates the introduction of parallelism using reusable parallel libraries, coded in AspectJ. These libraries provide performance comparable to traditional parallel programming techniques and enable the composition of multiple parallelism modules (e.g., shared memory with distributed memory) with a given base program.(undefined)info:eu-repo/semantics/publishedVersio
Gaspar data-centric framework

This paper presents the Gaspar data-centric framework to develop high performance parallel applications in Java. Our approach is based on data iterators and on the map pattern of computation. The framework provides an efficient data Application Programming Inter-face(API) that supports flexible data layout and data tiling. Data layout and tiling enable the improvement of data locality, which is essential to foster application scalability in modern multi-core systems. The paper presents the framework data-centric concepts and shows that the performance is comparable to pure Java code.(undefined)info:eu-repo/semantics/publishedVersio
A verified algorithm enumerating event structures

An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to generate or count all the possible event structures over af inite set of events. We present an algorithm to generate such a family, along with a functional implementation verified using Isabelle/HOL. As byproducts, we obtain a verified enumeration of all possible preorders and partial orders. While the integer sequences counting preorders and partial orders are already listed on OEIS (On-line Encyclopedia of Integer Sequences), the one counting event structures is not. We therefore used our algorithm to submit a formally verified addition, which has been successfully reviewed and is now part of the OEIS.Postprin
Reasoning with Concept Diagrams about Antipatterns in Ontologies

Ontologies are notoriously hard to de ne, express and reason about. Many tools have been developed to ease the ontology debugging and reasoning, however they often lack accessibility and formalisation. A visual representation language, concept diagrams, was developed for expressing ontologies, which has been empirically proven to be cognitively more accessible to ontology users. In this paper we answer the question of \How can concept diagrams be used to reason about inconsistencies and incoherence of ontologies?". We do so by formalising a set of inference rules for concept diagrams that enables stepwise veri cation of the inconsistency and incoherence of a set of ontology axioms. The design of inference rules is driven by empirical evidence that concise (merged) diagrams are easier to comprehend for users than a set of lower level diagrams that are a one-to-one translation from OWL ontology axioms. We prove that our inference rules are sound, and exemplify how they can be used to reason about inconsistencies and incoherence
VMEXT: A Visualization Tool for Mathematical Expression Trees

Mathematical expressions can be represented as a tree consisting of terminal
symbols, such as identifiers or numbers (leaf nodes), and functions or
operators (non-leaf nodes). Expression trees are an important mechanism for
storing and processing mathematical expressions as well as the most frequently
used visualization of the structure of mathematical expressions. Typically,
researchers and practitioners manually visualize expression trees using
general-purpose tools. This approach is laborious, redundant, and error-prone.
Manual visualizations represent a user's notion of what the markup of an
expression should be, but not necessarily what the actual markup is. This paper
presents VMEXT - a free and open source tool to directly visualize expression
trees from parallel MathML. VMEXT simultaneously visualizes the presentation
elements and the semantic structure of mathematical expressions to enable users
to quickly spot deficiencies in the Content MathML markup that does not affect
the presentation of the expression. Identifying such discrepancies previously
required reading the verbose and complex MathML markup. VMEXT also allows one
to visualize similar and identical elements of two expressions. Visualizing
expression similarity can support support developers in designing retrieval
approaches and enable improved interaction concepts for users of mathematical
information retrieval systems. We demonstrate VMEXT's visualizations in two
web-based applications. The first application presents the visualizations
alone. The second application shows a possible integration of the
visualizations in systems for mathematical knowledge management and
mathematical information retrieval. The application converts LaTeX input to
parallel MathML, computes basic similarity measures for mathematical
expressions, and visualizes the results using VMEXT.Comment: 15 pages, 4 figures, Intelligent Computer Mathematics - 10th
  International Conference CICM 2017, Edinburgh, UK, July 17-21, 2017,
  Proceeding
Automatically proving equivalence by type-safe reflection

We are also grateful for the support of the Scottish Informatics and Computer Science Alliance (SICSA) and EPSRC grant EP/N024222/1.One difficulty with reasoning and programming with dependent types is that proof obligations arise naturally once programs become even moderately sized. For example, implementing an adder for binary numbers indexed over their natural number equivalents naturally leads to proof obligations for equalities of expressions over natural numbers. The need for these equality proofs comes, in intensional type theories, from the fact that the propositional equality enables us to prove as equal terms that are not judgementally equal, which means that the type checker can’t always obtain equalities by reduction. As far as possible, we would like to solve such proof obligations automatically. In this paper, we show one way to automate these proofs by reflection in the dependently typed programming language Idris. We show how defining reflected terms indexed by the original Idris expression allows us to construct and manipulate proofs. We build a hierarchy of tactics for proving equivalences in semigroups, monoids, commutative monoids, groups, commutative groups,semi-rings and rings. We also show how each tactic reuses those from simpler structures, thus avoiding duplication of code and proofs.Postprin
Sequoia: scalable policy-based access control for search operations in data-driven applications

Policy-based access control is a technology that achieves separation of concerns through evaluating an externalized policy at each access attempt. While this approach has been well-established for request-response applications, it is not supported for database queries of data-driven applications, especially for attribute-based policies. In particular, search operations for such applications involve poor scalability with regard to the data set size for this approach, because they are influenced by dynamic runtime conditions. This paper proposes a scalable application-level middleware solution that performs runtime injection of the appropriate rules into the original search query, so that the result set of the search includes only items to which the subject is entitled. Our evaluation shows that our method scales far better than current state of practice approach that supports policy-based access control.status: publishe
A voucher-based security middleware for secure business process outsourcing

Business Process Outsourcing (BPO) enables the delegation of entire business processes to third party providers. Such scenarios involve communication between federated and heterogeneous workflow engines. However, state-of-the-art workflow engines fall short of a distributed authorisation mechanism for this heterogeneous, federated BPO setting.

In a cross-organisational context, the security requirements involve (i) delegation and verification of privileges in a confidential manner, (ii) secure asynchronous operations during the long-term workflows even when the users are logged-off, and (iii) controlling access to interfaces of the different workflow engines involved.

To address these challenges, we present a voucher-based authorisation architecture and middleware. We extended the WF-Interop middleware with a security module to support this authorisation architecture. We further validated our contributions by prototyping a billing workflow case study on top of the extended WF-Interop middleware and evaluated the performance overhead of the security extensions to the middleware.status: publishe
When can graph hyperbolicity be computed in linear time?

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known practical algorithms for computing the hyperbolicity number of a n-vertex graph have running time  O(n4)O(n4) . Exploiting the framework of parameterized complexity analysis, we explore possibilities for “linear-time FPT” algorithms to compute hyperbolicity. For instance, we show that hyperbolicity can be computed in time  2O(k)+O(n+m)2O(k)+O(n+m)  (m being the number of graph edges, k being the size of a vertex cover) while at the same time, unless the SETH fails, there is no  2o(k)n22o(k)n2 -time algorithm
Conditional Lower Bounds for Space/Time Tradeoffs

In recent years much effort has been concentrated towards achieving
polynomial time lower bounds on algorithms for solving various well-known
problems. A useful technique for showing such lower bounds is to prove them
conditionally based on well-studied hardness assumptions such as 3SUM, APSP,
SETH, etc. This line of research helps to obtain a better understanding of the
complexity inside P.
  A related question asks to prove conditional space lower bounds on data
structures that are constructed to solve certain algorithmic tasks after an
initial preprocessing stage. This question received little attention in
previous research even though it has potential strong impact.
  In this paper we address this question and show that surprisingly many of the
well-studied hard problems that are known to have conditional polynomial time
lower bounds are also hard when concerning space. This hardness is shown as a
tradeoff between the space consumed by the data structure and the time needed
to answer queries. The tradeoff may be either smooth or admit one or more
singularity points.
  We reveal interesting connections between different space hardness
conjectures and present matching upper bounds. We also apply these hardness
conjectures to both static and dynamic problems and prove their conditional
space hardness.
  We believe that this novel framework of polynomial space conjectures can play
an important role in expressing polynomial space lower bounds of many important
algorithmic problems. Moreover, it seems that it can also help in achieving a
better understanding of the hardness of their corresponding problems in terms
of time
Predicting maintenance requirements for school assets in Queensland

In this paper, a maintenance prediction model is developed for school building assets using a large data set provided by the Queensland Department of Education and Training (DET). DET data on the asset condition, historical maintenance expenditure, and asset characteristics, was analyzed to evaluate which characteristics affect the maintenance needs of the school assets. The condition of the assets was quantified using data on the estimated maintenance backlog.  Using statistical methods, models for key building element groups were constructed and the statistical significance of each factor was evaluated. It was found that the school region, the gross floor area, and the maintenance expenditure significantly affected the degradation of key building element groups