pinecone/core-2020-05-10-deduplication huggingface dataset:
A dynamic logic for every season

This paper introduces a method to build dynamic logics with a graded semantics. The construction is parametrized by a structure to support both the spaces of truth and of the domain of computations. Possible instantiations of the method range from classical assertional) dynamic logic to less common graded logics suitable to deal with programs whose transitional semantics exhibits fuzzy or weighted behaviour.This leads to the systematic derivation of program logics tailored to specific program classes
Completeness and decidability results for hybrid(ised) logics

Adding to the modal description of transition structures the ability to refer to specific states, hybrid(ised) logics provide an interesting framework for the specification of reconfigurable systems. The qualifier ‘hybrid(ised)’ refers to a generic method of developing, on top of whatever specification logic is used to model software configurations, the elements of an hybrid language, including nominals and modalities. In such a context, this paper shows how a calculus for a hybrid(ised) logic can be generated from a calculus of the base logic and that, moreover, it preserves soundness and completeness. A second contribution establishes that hybridising a decidable logic also gives rise to a decidable hybrid(ised) one. These results pave the way to the development of dedicated proof tools for such logics used in the design of reconfigurable systems
A dynamic logic for every season

This paper introduces a method to build dynamic logics with a graded semantics. The construction is parametrized by a structure to support both the spaces of truth and of the domain of computations. Possible instantiations of the method range from classical (assertional) dynamic logic to less common graded logics suitable to deal with programs whose transitional semantics exhibits fuzzy or weighted behaviour. This leads to the systematic derivation of program logics tailored to specific program classes
Secure pseudo-random linear binary sequences generators based on
  arithmetic polynoms

We present a new approach to constructing of pseudo-random binary sequences
(PRS) generators for the purpose of cryptographic data protection, secured from
the perpetrator's attacks, caused by generation of masses of hardware errors
and faults. The new method is based on use of linear polynomial arithmetic for
the realization of systems of boolean characteristic functions of PRS'
generators. "Arithmetizatio" of systems of logic formulas has allowed to apply
mathematical apparatus of residue systems for multisequencing of the process of
PRS generation and organizing control of computing errors, caused by hardware
faults. This has guaranteed high security of PRS generator's functioning and,
consequently, security of tools for cryptographic data protection based on
those PRSs
Evaluating the Applicability of Multi-Agent Software for Implementing Distributed Industrial Data Management Approaches

Distributed approaches to industrial control or information management problems are often tackled using Multi-agent methods. Multi-Agent systems – solutions resulting from taking a Multi-agent based approaches - often come with a certain amount of “overhead” such as communication systems, but can provide a helpful tool with the design and implementation. In this paper, a distributed data management problem is addressed with both a bespoke approach developed specifically for this problem and a more general Multi-agent approach. The two approaches are compared using architecture and software metrics. The software metric results show similar results, although overall the bespoke approach was more appropriate for the particular application examined. The architectural analysis indicates that the main reason for this difference is the communication and computation overhead associated with the agent-based system. It was not within the scope of this study to compare the two approaches under multiple application scenarios.BoeingThis is the author accepted manuscript. The final version is available from Springer via http://dx.doi.org/10.1007/978-3-319-15159-5_1
Self-interested service-oriented agents based on trust and QoS for dynamic reconfiguration

Progressively increasing complexity of dynamic environments, in which services and applications are demanded by potential clients, requires a high level of reconfiguration of the offer to better match that ever changing demand. In particular, the dynamic change of the client’s needs, leading to higher exigency, may require a smart and flexible automatic composition of more elementary services. By leveraging the service-oriented architectures and multi-agent system benefits, the paper proposes a method to explore the flexibility of the decision support for the services’ reconfiguration based on several pillars, such as trust, reputation and QoS models, which allows the selection based on measuring the expected performance of the agents. Preliminary experimental results, extracted from a real case scenario, allow highlighting the benefits of the proposed distributed and flexible solution to balance the workload of service providers in a simple and fast manner. The proposed solution includes the agents’ intelligent decision-making capability to dynamically and autonomously change services selection on the fly, towards more trustworthy services with better quality when unexpected events happen, e.g. broken machines. We then propose the use of competitive self-interested agents to provide services that best suits to the client through dynamic service composition.info:eu-repo/semantics/publishedVersio
Digital Chronofiles of Life Experience

Accepted manuscript version. The final publication is available at Springer via <a href=http://dx.doi.org/10.1007/978-3-319-15168-7_33>http://dx.doi.org/10.1007/978-3-319-15168-7_33</a>.Technology has brought us to the point where we are able to digitally sample life experience in rich multimedia detail, often referred to as lifelogging. In this paper we explore the potential of lifelogging for the digitisation and archiving of life experience into a longitudinal media archive for an individual. We motivate the historical archive potential for rich digital memories, enabling individuals’ digital footprints to contribute to societal memories, and propose a data framework to gather and organise the lifetime of the subject
Reconstructing topological properties of complex networks using the fitness model

A major problem in the study of complex socioeconomic systems is represented by privacy issues—that can put severe limitations on the amount of accessible information, forcing to build models on the basis of incomplete knowledge. In this paper we investigate a novel method to reconstruct global topological properties of a complex network starting from limited information. This method uses the knowledge of an intrinsic property of the nodes (indicated as fitness), and the number of connections of only a limited subset of nodes, in order to generate an ensemble of exponential random graphs that are representative of the real systems and that can be used to estimate its topological properties. Here we focus in particular on reconstructing the most basic properties that are commonly used to describe a network: density of links, assortativity, clustering. We test the method on both benchmark synthetic networks and real economic and financial systems, finding a remarkable robustness with respect to the number of nodes used for calibration. The method thus represents a valuable tool for gaining insights on privacy-protected systems
Detection of coupling misalignment by extended orbits

In this paper a ‘SpectraQuest’ demonstrator is used to introduce misalignment into a rotating machinery set-up. Depending on the coupling used in the set-up, angular and/or parallel misalignment can be brought in the rotating system. Traditionally, the data captured by accelerometers is transferred into the frequency domain in order to interpret the vibrations measured by the accelerometers. The frequency domain has proven its usefulness but even the time domain can come in handy to draw the right conclusions regarding to misalignment in a rotating set-up. Orbit plots display the integrated data captured by accelerometers, in order to display the movement of the rotating shaft. The influence of the misalignment and imbalance on these orbits will be discussed
Artificial intelligence and pro-social behaviour

If artificial intelligence (AI) were achievable, what would the consequences be for human society?1 Perhaps surprisingly, the answer to this question is already at hand. We are achieving rapid and accelerating success in our quest to build AI. That very success — and the slowness with which both the academic community and the general public have come to recognise it — has shown how little we understand our own intelligence, and its role in our lives and culture. Here I attempt to address this problem of understanding, exploiting a variety of scientific evidence, including social simulation. I begin by reviewing current progress in AI, which is profound but underestimated. I suggest this lack of recognition is due to the mistaken belief that intelligence implies agency. I next examine the related question of human uniqueness: why do only we have language and extensive built culture? I use models and data to show that the propensities to use culture, share information and behave altruistically are neither unique to humans nor inexplicable to biology, but rather our uniqueness hinges on the extent of our capacities for communication and memory. Finally, I apply the impact of AI on extending our intelligence to these theories, to predict—and observe—consequences of AI on human societies and individual human lives. I make and support policy recommendations based on these predictions
Fault detection of wind turbine drivetrain utilizing power-speed characteristics

Wind energy, being the fastest growing renewable energy source in the present world, requires a large number of wind turbines to transform wind energy into electricity. One factor driving the cost of this energy is the reliable operation of these turbines. Therefore, it is a growing requirement within the wind farm community, to monitor the operation of the wind turbines on a continuous basis so that a possible fault can be detected ahead of time. As the wind turbine operates in an environment of constantly changing wind speed, it is a challenging task to design a fault detection technique which can accommodate the stochastic operational behavior of the turbines. Addressing this issue, this paper proposes a novel fault detection criterion which is robust against operational uncertainty, as well as having the ability to quantify severity level specifically of the drivetrain abnormality within an operating wind turbine. A benchmark model of wind turbine has been utilized to simulate drivetrain fault condition and effectiveness of the proposed technique has been tested accordingly. From the simulation result it can be concluded that the proposed criterion exhibits consistent performance for drivetrain faults for varying wind speed and has linear relationship with the fault severity level
A decision support framework for prioritization of engineering asset management activities under uncertainty

Engineers and asset managers must often make decisions on how to best allocate limited resources amongst different interrelated activities, including repair, renewal, inspection, and procurement of new assets. The presence of project interdependencies and the lack of sufficient information on the true value of an activity often produce complex problems and leave the decision maker guessing about the quality and robustness of their decision. In this paper, a decision support framework for uncertain interrelated activities is presented. The framework employs a methodology for multi-criteria ranking in the presence of uncertainty, detailing the effect that uncertain valuations may have on the priority of a particular activity. The framework employs employing semi-quantitative risk measures that can be tailored to an organisation and enable a transparent and simple-to-use uncertainty specification by the decision maker. The framework is then demonstrated on a real world project set from a major Australian utility provider
Abstract constraint data types

Martin Wirsing is one of the earliest contributors to the area of Algebraic Specification (e.g., [2]), which he explored in a variety of domains over many years. Throughout his career, he has also inspired countless researchers in related areas. This paper is inspired by one of the domains that he explored thirty years or so after his first contributions when leading the FET Integrated Project SENSORIA [14]: the use of constraint systems to deal with non-functional requirements and preferences [13,8]. Following in his footsteps, we provide an extension of the traditional notion of algebraic data type specification to encompass soft-constraints as formalised in [1]. Finally, we relate this extension with institutions [6] and recent work on graded consequence in institutions [3].Peer ReviewedPostprint (author’s final draft
Bounding clique-width via perfect graphs.

Given two graphs H1 and H2, a graph G is (H1,H2)-free if it contains no subgraph isomorphic to H1 or H2. We continue a recent study into the clique-width of (H1,H2)-free graphs and present three new classes of (H1,H2)-free graphs that have bounded clique-width. We also show the implications of our results for the computational complexity of the Colouring problem restricted to (H1,H2)-free graphs. The three new graph classes have in common that one of their two forbidden induced subgraphs is the diamond (the graph obtained from a clique on four vertices by deleting one edge). To prove boundedness of their clique-width we develop a technique based on bounding clique covering number in combination with reduction to subclasses of perfect graphs
Improving the Performance of Trickle-Based Data Dissemination in
  Low-Power Networks

Trickle is a polite gossip algorithm for managing communication traffic. It
is of particular interest in low-power wireless networks for reducing the
amount of control traffic, as in routing protocols (RPL), or reducing network
congestion, as in multicast protocols (MPL). Trickle is used at the network or
application level, and relies on up-to-date information on the activity of
neighbors. This makes it vulnerable to interference from the media access
control layer, which we explore in this paper. We present several scenarios how
the MAC layer in low-power radios violates Trickle timing. As a case study, we
analyze the impact of CSMA/CA with ContikiMAC on Trickle's performance.
Additionally, we propose a solution called Cleansing that resolves these
issues
Encoding Data Structures

Abstract of invited talk.In recent years, there has been an explosion of interest in\ud
succinct data structures, which store the given data in compact or compressed\ud
formats and answer queries on the data rapidly while it is still\ud
in its compressed format. Our focus in this talk is to introduce encoding\ud
data structures. Encoding data structures consider the data together\ud
with the queries and aim to store only as much information about the\ud
data as is needed to store the queries. Once this is done, the original data\ud
can be deleted. In many cases, one can obtain space-efficient encoding\ud
data structures even when the original data is incompressible.Peer-reviewedPost-printAlgorithms and Computation - 9th International Workshop, WALCOM 2015. Dhaka, Banglades
Improving reuse of attribute-based access control policies using policy templates

Access control is key to limiting the actions of users in an application and attribute-based policy languages such as XACML allow to express a wide range of access rules. As these policy languages become more widely used, policies grow both in size and complexity. Modularity and reuse are key to specifying and managing such policies effectively. Ideally, complex or domain-specific policy patterns are defined once and afterwards instantiated by security experts in their application-specific policies. However, current policy languages such as XACML provide only limited features for modularity and reuse. To address this issue, we introduce policy templates as part of a novel attribute-based policy language called STAPL. Policy templates are policies containing unbound variables that can be specified when instantiating the template in another policy later on. STAPL supports four types of policy templates with increasing complexity and expressiveness. This paper illustrates how these policy templates can be used to define reusable policy patterns and validates that policy templates are an effective means to simplify the specification of large and complex attribute-based policies.status: publishe
A Security Ontology for Security Requirements Elicitation

International audienceSecurity is an important issue that needs to be taken into account at all stages of information system development, including early requirements elicitation. Early analysis of security makes it possible to predict threats and their impacts and define adequate security requirements before the system is in place. Security requirements are difficult to elicit, analyze, and manage. The fact that analysts' knowledge about security is often tacit makes the task of security requirements elicitation even harder. Ontologies are known for being a good way to formalize knowledge. Ontologies, in particular, have been proved useful to support reusability. Requirements engineering based on predefined ontologies can make the job of requirement engineering much easier and faster. However, this very much depends on the quality of the ontology that is used. Some security ontologies for security requirements have been proposed in the literature. None of them stands out as complete. This paper presents a core and generic security ontology for security requirements engineering. Its core and generic status is attained thanks to its coverage of wide and high-level security concepts and relationships. We implemented the ontology and developed an interactive environment to facilitate the use of the ontology during the security requirements engineering process. The proposed security ontology was evaluated by checking its validity and completeness compared to other ontologies. Moreover, a controlled experiment with end-users was performed to evaluate its usability
The atomic-scale structure of network glass-forming materials

A prerequisite for understanding the physico-chemical properties of network glass-forming materials is knowledge about their atomic-scale structure. The desired information is not, however, easy to obtain because structural disorder in a liquid or glass leads to complexity. It is therefore important to design experiments to give site-specific information on the structure of a given material in order to test the validity of different molecular dynamics models. In turn, once a molecular dynamics scheme contains the correct theoretical ingredients, it can be used both to enrich the information obtained from experiment and to predict the composition and temperature/pressure dependence of a material’s properties, a first step in using the principles of rational design to prepare glasses with novel functional properties. In this chapter the symbiotic relationship between experiment and simulation is explored by focussing on the structures of liquid and glassy ZnCl2 and GeSe2, and on the structure of glassy GeO2 under pressure. Issues to be addressed include extended range ordering on a nanometre scale, the formation of homopolar (like-atom) bonds, and the density-driven mechanisms of network collapse
Computational Modeling of Silicate Glasses: A Quantitative Structure-Property Relationship Perspective

This article reviews the present state of Quantitative Structure-Property\ud
Relationships (QSPR) in glass design and gives an outlook into future developments.\ud
First an overview is given of the statistical methodology, with particular emphasis\ud
to the integration of QSPR with molecular dynamics simulations to derive informative\ud
structural descriptors. Then, the potentiality of this approach as a tool for\ud
interpretative and predictive purposes is highlighted by a number of recent inspiring\ud
applications
Minimization of Costs and Energy Consumption in a Data Center by a Workload-Based Capacity Management

In this paper we present an approach to improve power and cooling capacity management in a data center by taking into account knowledge about applications and workloads. We apply power capping techniques and proper cooling infrastructure configuration to achieve savings in energy and costs. To estimate values of a total energy consumption and costs we simulate both IT software/hardware and cooling infrastructure at once using the CoolEmAll SVD Toolkit. We also investigated the use of power capping to adjust data center operation to variable power supply and pricing. By better adjusting cooling infrastructure to specific types of workloads, we were able to find a configuration which resulted in energy, OPEX and CAPEX savings in the range of 4–25 %
A model for the decision-maker preferences in
a polymer extrusion process

The NN-DM is a method developed to find a mathematical model that represents the Decision-Maker (DM) by employing an artificial neural network (NN) in situations in which the preferences can be represented by a utility function. This paper presents further developments to the NN-DM method to find a model in a polymer extrusion process. The form of the DM's interaction, the domain assignment, the ranking process, and the performance assessment are adapted to a real context of a multi-objective optimization problem followed by a design decision. The DM is then requested to fill a matrix expressing his preferences considering pairwise comparisons expressing ordinal relations only. Two multi-objective optimization problems are tested, each one with three estimates of different Pareto-optimal fronts. The adapted NN-DM method is able to provide a model which sorts the available solutions from the best to the worst according to the DM's preferences.info:eu-repo/semantics/publishedVersio
A multi-criteria decision support system for a routing problem in waste collection

Autor proofThis work presents a decision support system for route planning of vehicles performing waste collection for recycling. We propose a prototype system that includes three modules: route optimization, waste generation prediction, and multiple-criteria decision analysis (MCDA). In this work we focus on the application of MCDA in route optimization. The structure and functioning of the DSS is also presented.
We modelled the waste collection procedure as a routing problem, more specifically as a team orienteering problem with capacity constraints and time windows. To solve the route optimization problem we developed a cellular genetic algorithm. For the MCDA module, we employed three methods: SMART, ValueFn and Analytic Hierarchy Process (AHP).
The decision support system was tested with real-world data from a waste management company that collects recyclables, and the capabilities of the system are discussed.FCT Fundação para a Ciência e Tecnologia,  Project Scope: PEst-OE/EEI/UI0319/2