pinecone/core-2020-05-10-deduplication huggingface dataset:
Recent Advances in Semiparametric Bayesian Function Estimation

Common nonparametric curve fitting methods such as spline smoothing, local polynomial regression and basis function approaches are now well developed and widely applied. More recently, Bayesian function estimation has become a useful supplementary or alternative tool for practical data analysis, mainly due to breakthroughs in computerintensive inference via Markov chain Monte Carlo simulation. This paper surveys recent developments in semiparametric Bayesian inference for generalized regression and outlines some directions in current research.
Making Operation-based CRDTs Operation-based

Conflict-free Replicated Datatypes can simplify the design of predictable eventual consistency. They can be classified into state-based or operation-based. Operation-based approaches have the potential for allowing compact designs in both the sent message and the object state size, but cur- rent approaches are still far from this objective. Here we explore the design space for operation-based solutions, and we leverage the interaction with the middleware by offering a technique that delivers very compact solutions, while only broadcasting operation names and arguments
Autonomous multi-dimensional slicing for large-scale distributed systems

Slicing is a distributed systems primitive that allows to autonomously partition a large set of nodes based on node-local attributes. Slicing is decisive for automatically provisioning system resources for different services, based on their requirements or importance. One of the main limitations of existing slicing protocols is that only single dimension attributes are considered for partitioning. In practical settings, it is often necessary to consider best compromises for an ensemble of metrics.
In this paper we propose an extension of the slicing primitive that allows multi-attribute distributed systems slicing. Our protocol employs a gossip-based approach that does not require centralized knowledge and allows self-organization. It leverages the notion of domination between nodes, forming a partial order between multi-dimensional points, in a similar way to SkyLine queries for databases. We evaluate and demonstrate the interest of our approach using large-scale simulations.This work received support from the Portuguese Foundation for Science and Technology under grant SFRH/BD/71476/2010
Distributed exact deduplication for primary storage infrastructures

Lecture Notes in Computer Science, Volume 8460, 2014Deduplication of primary storage volumes in a cloud computing environment is increasingly desirable, as the resulting space savings contribute to the cost effectiveness of a large scale multi-tenant infrastructure. However, traditional archival and backup deduplication systems impose prohibitive overhead for latency-sensitive applications deployed at these infrastructures while, current primary deduplication systems rely on special cluster filesystems, centralized components, or restrictive workload assumptions. 
We present DEDIS, a fully-distributed and dependable system that performs exact and cluster-wide background deduplication of primary storage. DEDIS does not depend on data locality and works on top of any unsophisticated storage backend, centralized or distributed, that exports a basic shared block device interface. The evaluation of an open-source prototype shows that DEDIS scales out and adds negligible overhead even when deduplication and intensive storage I/O run simultaneously
Scalable and accurate causality tracking for eventually consistent stores

Lecture Notes in Computer Science 8460, 2014In cloud computing environments, data storage systems often rely on optimistic replication to provide good performance and availability even in the presence of failures or network partitions. In this scenario, it is important to be able to accurately and efficiently identify updates executed concurrently. Current approaches to causality tracking in optimistic replication have problems with concurrent updates: they either (1) do not scale, as they require replicas to maintain information that grows linearly with the number of writes or unique clients; (2) lose information about causality, either by removing entries from client-id based version vectors or using server-id based version vectors, which cause false conflicts. We propose a new logical clock mechanism and a logical clock framework that together support a traditional key-value store API, while capturing causality in an accurate and scalable way, avoiding false conflicts. It maintains concise information per data replica, only linear on the number of replica servers, and allows data replicas to be compared and merged linear with the number of replica servers and versions
Behave: Behavioral Cache for Web Content

International audienceWe propose Behave: a novel approach for peer-to-peer cache-oriented applications such as CDNs. Behave relies on the principle of Behavioral Locality inspired from collaborative filtering. Users that have visited sim-ilar websites in the past will have local caches that provide interesting content for one another. Behave exploits epidemic protocols to build overlapping communities of peers with similar interests. Peers in the same one-hop community federate their cache indexes in a Behavioral cache. Extensive simulations on a real data trace show that Behave can provide zero-hop lookup latency for about 50% of the content available in a DHT-based CDN
Encoding Synchronous Interactions Using Labelled Petri Nets

International audienceWe present an encoding of (bound) CSP processes with replication into Petri nets with labelled transitions. Through the encoding, the firing semantics of Petri nets models the standard operational semantics of CSP processes, which is both preserved and reflected. This correspondence allows for describing by net semantics the standard CSP observational equivalences. Since the encoding is modular with respect to process syntax, the paper puts on a firm ground the technology transfer between the two formalisms, e.g. recasting into the CSP framework well-established results like decidability of coverability for nets. This work complements previous results concerning the encoding of asynchronous interactions, thus witnessing the expressiveness of (open) labelled nets in modelling process calculi with alternative communication patterns
Typing liveness in multiparty communicating systems

Session type systems are an effective tool to prove that communicating programs do not go wrong, ensuring that the participants of a session follow the protocols described by the types. In a previous work we introduced a typing discipline for the analysis of progress in binary sessions. In this paper we generalize the approach to multiparty sessions following the conversation type approach, while strengthening progress to liveness. We combine the usual session-like fidelity analysis with the liveness analysis and devise an original treatment of recursive types allowing us to address challenging configurations that are out of the reach of existing approaches
Coordination of ECA Rules by Verification and Control

International audienceEvent-Condition-Action (ECA) rules are a widely used language for the high level specification of controllers in adaptive systems, such as Cyber-Physical Systems and smart environments, where devices equipped with sensors and actuators are controlled according to a set of rules. The evaluation and execution of every ECA rule is considered to be independent from the others, but interactions of rule actions can cause the system behaviors to be unpredictable or unsafe. Typical problems are in redundancy of rules, inconsistencies, circularity, or application-dependent safety issues. Hence, there is a need for coordination of ECA rule-based systems in order to ensure safety objectives. We propose a tool-supported method for verifying and controlling the correct interactions of rules, relying on formal models related to reactive systems, and Discrete Controller Synthesis (DCS) to generate correct rule controllers
LINC: A Compact Yet Powerful Coordination Environment

International audienceThis paper presents LINC, a coordination programming environment. It is an evolution of earlier middlewares (the Coordination Language Facility (CLF) and Stitch). The aim is to provide a more flexible and expressive language correcting several of their limitations and an improved run-time environment. LINC provides a compact yet powerful coordination language and an optimised run-time which executes rules. This paper describes the intrinsic properties brought by the LINC environment and how it helps the coordination aspects in a distributed system. This paper also emphasises on the reflexivity of LINC and its usage at system level. Finally, it illustrates through several case studies, how LINC can manage a wide range of application domains
The regulation of IL-10 expression

Interleukin (IL)-10 is an important immunoregulatory cytokine and an understanding of how IL-10 expression is controlled is critical in the design of immune intervention strategies. IL-10 is produced by almost all cell types within the innate (including macrophages, monocytes, dendritic cells (DCs), mast cells, neutrophils, eosinophils and natural killer cells) and adaptive (including CD4(+) T cells, CD8(+) T cells and B cells) immune systems. The mechanisms of IL-10 regulation operate at several stages including chromatin remodelling at the Il10 locus, transcriptional regulation of Il10 expression and post-transcriptional regulation of Il10 mRNA. In addition, whereas some aspects of Il10 gene regulation are conserved between different immune cell types, several are cell type- or stimulus-specific. Here, we outline the complexity of IL-10 production by discussing what is known about its regulation in macrophages, monocytes, DCs and CD4(+) T helper cells
Mind the Cultural Gap: Bridging Language-Specific DBpedia Chapters for Question Answering

International audienceIn order to publish information extracted from language specific pages of Wikipedia in a structured way, the Semantic Web community has started an effort of internationalization of DBpedia. Language specific DBpedia chapters can contain very different information from one language to another, in particular they provide more details on certain topics, or fill information gaps. Language specific DBpedia chapters are well connected through instance interlinking, extracted from Wikipedia. An alignment between properties is also carried out by DBpedia contributors as a mapping from the terms in Wikipedia to a common ontology, enabling the exploitation of information coming from language specific DBpedia chapters. However, the mapping process is currently incomplete, it is time-consuming as it is performed manually, and it may lead to the introduction of redundant terms in the ontology. In this chapter we first propose an approach to automatically extend the existing alignments, and we then present an extension of QAKiS, a system for Question Answering over Linked Data that allows to query language specific DB-pedia chapters relying on the above mentioned property alignment. In the current version of QAKiS, English, French and German DBpedia chapters are queried using a natural language interface
An empirical cognitive model of the development of shared understanding of requirements

It is well documented that customers and software development teams need to share and refine understanding of the requirements throughout the software development lifecycle. The development of this shared understand- ing is complex and error-prone however. Techniques and tools to support the development of a shared understanding of requirements (SUR) should be based on a clear conceptualization of the phenomenon, with a basis on relevant theory and analysis of observed practice. This study contributes to this with a detailed conceptualization of SUR development as sequence of group-level state transi- tions based on specializing the Team Mental Model construct. Furthermore it proposes a novel group-level cognitive model as the main result of an analysis of data collected from the observation of an Agile software development team over a period of several months. The initial high-level application of the model shows it has promise for providing new insights into supporting SUR development
Metrics for Differential Privacy in Concurrent Systems

Part 3: Security AnalysisInternational audienceOriginally proposed for privacy protection in the context of statistical databases, differential privacy is now widely adopted in various models of computation. In this paper we investigate techniques for proving differential privacy in the context of concurrent systems. Our motivation stems from the work of Tschantz et al., who proposed a verification method based on proving the existence of a stratified family between states, that can track the privacy leakage, ensuring that it does not exceed a given leakage budget. We improve this technique by investigating a state property which is more permissive and still implies differential privacy. We consider two pseudometrics on probabilistic automata: The first one is essentially a reformulation of the notion proposed by Tschantz et al. The second one is a more liberal variant, relaxing the relation between them by integrating the notion of amortisation, which results into a more parsimonious use of the privacy budget. We show that the metrical closeness of automata guarantees the preservation of differential privacy, which makes the two metrics suitable for verification. Moreover we show that process combinators are non-expansive in this pseudometric framework. We apply the pseudometric framework to reason about the degree of differential privacy of protocols by the example of the Dining Cryptographers Protocol with biased coins
Actor- and Task-Selection Strategies for Pruning\ud
Redundant State-Exploration in Testing

Testing concurrent systems requires exploring all possible non-deterministic interleavings that the concurrent execution may have. This is because any of the interleavings may reveal the erroneous behaviour. In testing of actor systems, we can distinguish two sources of non-determinism: (1) actor-selection, the order in which actors are explored and (2) task-selection, the order in which the tasks within each actor are explored. This paper provides new strategies and heuristics for pruning redundant state-exploration when testing actor systems by reducing the amount of unnecessary non-determinism. First, we propose a method and heuristics for actor-selection based on tracking the amount and the type of interactions among actors. Second, we can avoid further redundant interleavings in task-selection by  taking into account the access to the shared-memory that the tasks make
Efficient and Generalized Decentralized Monitoring of Regular Languages

Part 2: Monitoring and TestingInternational audienceThis paper proposes an efficient and generalized decentralized monitoring algorithm allowing to detect satisfaction or violation of any regular specification by local monitors alone in a system without central observation point. Our algorithm does not assume any form of synchronization between system events and communication of monitors, uses state machines as underlying mechanism for efficiency, and tries to keep the number and size of messages exchanged between monitors to a minimum. We provide a full implementation of the algorithm with an open-source benchmark to evaluate its efficiency in terms of number, size of exchanged messages, and delay induced by communication between monitors. Experimental results demonstrate the effectiveness of our algorithm which outperforms the previous most general one along several (new) monitoring metrics
Verifying Security Policies using Host Attributes

For the formal verification of a network security policy, it is crucial to
express the verification goals. These formal goals, called security invariants,
should be easy to express for the end user. Focusing on access control and
information flow security strategies, this work discovers and proves universal
insights about security invariants. This enables secure and convenient
auto-completion of host attribute configurations. We demonstrate our results in
a civil aviation scenario. All results are machine-verified with the
Isabelle/HOL theorem prover.Comment: In FORTE - 34th IFIP International Conference on Formal Techniques
  for Distributed Objects, Components and Systems, Berlin, Germany, June 201
Sensor Data Fusion using Unscented Kalman Filter for VOR-based Vision Tracking System for Mobile Robots

This paper presents sensor data fusion using Unscented Kalman Filter (UKF) to implement high performance vestibulo-ocular reflex (VOR) based vision tracking system for mobile robots. Information from various sensors is required to be integrated using an efficient sensor fusion algorithm to achieve a continuous and robust vision tracking system. We use data from low cost accelerometer, gyroscope, and encoders to calculate robot motion information. The Unscented Kalman Filter is used as an efficient sensor fusion algorithm. The UKF is an advanced filtering technique which outperforms widely used Extended Kalman Filter (EKF) in many applications. The system is able to compensate for the slip errors by switching between two different UKF models built for slip and no-slip cases. Since the accelerometer error accumulates with time because of the double integration, the system uses accelerometer data only for the slip case UKF model. Using sensor fusion by UKF, the position and orientation of the robot is estimated and is used to rotate the camera mounted on top of the robot towards a fixed target. This concept is derived from the vestibule-ocular reflex (VOR) of the human eye. The experimental results show that the system is able to track the fixed target in various robot motion scenarios including the scenario when an intentional slip is generated during robot navigatio
Emotionally driven robot control architecture for human-robot interaction

With the increasing demand for robots to assist humans in shared workspaces and environments designed for humans, research on human-robot interaction (HRI) gains more and more importance. Robots in shared environments must be safe and act in a way understandable by humans, through the way they interact and move. As visual cues such as facial expressions are important in human-human communication, research on emotion recognition, expression, and emotionally enriched communication is of great importance to HRI and has also gained increasing attention during the last two decades [1, 3, 4, 6, 8]. Most of the existing work focuses on the recognition of human emotions or mimicking their expression [1, 6] and emotional action selection [3, 5]. Less work is done on the role of emotions in influencing human behaviour in HRI [4]
Specifying Transaction Control to Serialize Concurrent Program
  Executions

We define a programming language independent transaction controller and an
operator which when applied to concurrent programs with shared locations turns
their behavior with respect to some abstract termination criterion into a
transactional behavior. We prove the correctness property that concurrent runs
under the transaction controller are serialisable. We specify the transaction
controller TaCtl and the operator TA in terms of Abstract State Machines. This
makes TaCtl applicable to a wide range of programs and in particular provides
the possibility to use it as a plug-in when specifying concurrent system
components in terms of Abstract State Machines.Comment: 14 pages, 1 figur
Distributed ASM - Pitfalls and solutions

Published version of a chapter in the book: Abstract State Machines, Alloy, B, TLA, VDM, and Z. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-662-43652-3_18While sequential Abstract State Machines (ASM) capture the essence of sequential computation, it is not clear that this is true of distributed ASM. This paper looks at two kinds of distributed process, one based on a global state and one based on variable access. Their commonalities are extracted and conclusions for the general understanding of distributed computation are drawn, providing integration between global state and variable access
αRby—An Embedding of Alloy in Ruby

We present αRby—an embedding of the Alloy language in Ruby—and demonstrate the benefits of having a declarative modeling language (backed by an automated solver) embedded in a traditional object-oriented imperative programming language. This approach aims to bring these two distinct paradigms (imperative and declarative) together in a novel way. We argue that having the other paradigm available within the same language is beneficial to both the modeling community of Alloy users and the object-oriented community of Ruby programmers. In this paper, we primarily focus on the benefits for the Alloy community, namely, how αRby provides elegant solutions to several well-known, outstanding problems: (1) mixed execution, (2) specifying partial instances, (3) staged model finding
NanoMagnet Logic: an Architectural Level Overview

In recent years Field-Coupled devices, like Quantum dot Cel- lular Automata, are gaining an ever increasing attention from the scien- tific community. The computational paradigm beyond this device topol- ogy is based on the interaction among neighbor cells to propagate in- formation through circuits. Among the various implementations of this theoretical principle, NanoMagnet Logic (NML) is one the most studied, due to some interesting features, like the possibility to combine memory and logic in the same device and the possible low power consumption. Since the working principle of Field-Coupled devices is completely dif- ferent from CMOS technology, it is important to understand all the im- plications that this new computational paradigm has on complex circuit architectures. In this chapter we deeply analyze the major issues encountered in the design of complex circuits using Field-Coupled devices. Problems are analyzed and techniques to solve them and to improve performance are presented. Finally, a realistic analysis of the applications best suited for this technology is presented. While the analysis is performed using Nano- Magnet Logic as target, the results can be applied to all Field-Coupled devices. This chapter therefore supplies researchers and designers with the essential guidelines necessary to design complex circuits using Nano- Magnet Logic and, more in general, Field-Coupled devices
Understanding a Bisferrocene Molecular QCA Wire

Molecular QCA are considered among the most promising beyond CMOS devices. Frequency as well as self-assembly characteristics are the features that make them most attractive. Several challenges restrain them for being exploited from a practical point of view in the near future, not only for the difficulties at the technological level, but for the inappropriateness of the tools used when studying and predicting their behavior. In this chapter we describe our methodology to simulate and model sequences of bisferrocene molecules aimed at understanding the behavior of a realistic MQCA wire. The simulations consider as variables distances between successive molecules, as well as different electric field applied (in terms of input and of clock). The method can be used to simulate and model also other more complex structures, and perspectives are given on the exploitation of the achieved result