pinecone/core-2020-05-10-deduplication huggingface dataset:
ω-rational Languages: High Complexity Classes vs. Borel Hierarchy

International audienceThe paper investigates classes of languages of innite words with respect to the acceptance conditions of the nite automata recognizing them. Some new natural classes are compared with the Borel hierachy. In particular, it is proved that (fin, =) is as high as F R σ and G R δ. As a side eect, it is also proved that in this last case, considering or not considering the initial state of the FA makes a substantial dierence. Languages over innite words have been used since the very introduction of symbolic dynamics. Afterwards, they have spread in a multitude of scientic elds. Computer science is more directly concerned for example by their application in formal specication and verication, game theory, logics, etc.. ω-rational languages have been introduced as a natural extension of languages of nite words recognized by nite automata. Indeed, a nite automaton accepts some input u if at the end of the reading of u, the automaton reaches a nal state. Clearly, when generalizing to innite words, this accepting condition has to be changed. For this reason, new accepting conditions have been introduced in literature. For example, an innite word w is accepted by a nite automaton A under the Büchi acceptance condition if and only if there exists a run of A which passes innitely often through a set of accepting states while reading w. Indeed, this was introduced by Richard Büchi in the seminal work [1] in 1960. Later on, David Muller characterized runs that pass through all elements of a given set of accepting states and visit them innitely often [8]. Afterwards, more acceptance conditions appeared in a series of papers [4,5,11,7,6]. Each of thes
On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the
two-element field (aka xor- or parity-constraints) via conjunctive normal forms
F (boolean clause-sets). First we consider the problem of finding an
"arc-consistent" representation ("AC"), meaning that unit-clause propagation
will fix all forced assignments for all possible instantiations of the
xor-variables. Our main negative result is that there is no polysize
AC-representation in general. On the positive side we show that finding such an
AC-representation is fixed-parameter tractable (fpt) in the number of
equations. Then we turn to a stronger criterion of representation, namely
propagation completeness ("PC") --- while AC only covers the variables of S,
now all the variables in F (the variables in S plus auxiliary variables) are
considered for PC. We show that the standard translation actually yields a PC
representation for one equation, but fails so for two equations (in fact
arbitrarily badly). We show that with a more intelligent translation we can
also easily compute a translation to PC for two equations. We conjecture that
computing a representation in PC is fpt in the number of equations.Comment: 39 pages; 2nd v. improved handling of acyclic systems, free-standing
  proof of the transformation from AC-representations to monotone circuits,
  improved wording and literature review; 3rd v. updated literature,
  strengthened treatment of monotonisation, improved discussions; 4th v. update
  of literature, discussions and formulations, more details and examples;
  conference v. to appear LATA 201
Belief Revision in Structured Probabilistic Argumentation

In real-world applications, knowledge bases consisting of all the information at hand for a specific domain, along with the current state of affairs, are bound to contain contradictory data coming from different sources, as well as data with varying degrees of uncertainty attached. Likewise, an important aspect of the effort associated with maintaining knowledge bases is deciding what information is no longer useful; pieces of information (such as intelligence reports) may be outdated, may come from sources that have recently been discovered to be of low quality, or abundant evidence may be available that contradicts them. In this paper, we propose a probabilistic structured argumentation framework that arises from the extension of Presumptive Defeasible Logic Programming (PreDeLP) with probabilistic models, and argue that this formalism is capable of addressing the basic issues of handling contradictory and uncertain data. Then, to address the last issue, we focus on the study of non-prioritized belief revision operations over probabilistic PreDeLP programs. We propose a set of rationality postulates – based on well-known ones developed for classical knowledge bases – that characterize how such operations should behave, and study a class of operators along with theoretical relationships with the proposed postulates, including a representation theorem stating the equivalence between this class and the class of operators characterized by the postulates.Fil: Shakarian, Paulo . U.S. Military Academy. Department of Electrical Engineering and Computer Science; Estados UnidosFil: Simari, Gerardo . University of Oxford; Reino UnidoFil: Falappa, Marcelo Alejandro. Universidad Nacional del Sur. Departamento de Ciencia e Ingeniería de la Computación. Laboratorio de Investigación y Desarrollo en Inteligencia Artificial; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin
Belief merging in Dynamic Logic of Propositional Assignments

We study syntactical merging operations that are defined semantically by means of the Hamming distance between valuations; more precisely, we investigate the Σ-semantics, Gmax-semantics and max-semantics. We work with a logical language containing merging operators as connectives, as opposed to the metalanguage operations of the literature. We capture these merging operators as programs of Dynamic Logic of Propositional Assignments DL-PA. This provides a syntactical characterisation of the three semantically defined merging operators, and a proof system for DL-PA therefore also provides a proof system for these merging operators. We explain how PSPACE membership of the model checking and satisfiability problem of star-free DL-PA can be extended to the variant of DL-PA where symbolic disjunctions that are parametrised by sets (that are not defined as abbreviations, but are proper connectives) are built into the language. As our merging operators can be polynomially embedded into this variant of DL-PA, we obtain that both the model checking and the satisfiability problem of a formula containing possibly nested merging operators is in PSPACE
On the Semantics of Partially Ordered Bases

This paper presents first results toward the extension of possibilistic logic when the total order on formulas is replaced by a partial preorder. Few works have dealt with this matter in the past but they include some by Halpern, and Benferhat et al. Here we focus on semantic aspects, namely the construction of a partial order on interpretations from a partial order on formulas and conversely. It requires the capability of inducing a partial order on subsets of a set from a partial order on its elements. The difficult point lies in the fact that equivalent definitions in the totally ordered case are no longer equivalent in the partially ordered one. We give arguments for selecting one approach extending comparative possibility and its preadditive refinement, pursuing some previous works by Halpern. It comes close to non-monotonic inference relations in the style of Kraus Lehmann and Magidor. We define an intuitively appealing notion of closure of a partially ordered belief base from a semantic standpoint, and show its limitations in terms of expressiveness, due to the fact that a partial ordering on subsets of a set cannot be expressed by means of a single partial order on the sets of elements. We also discuss several existing languages and syntactic inference techniques devised for reasoning from partially ordered belief bases in the light of this difficulty. The long term purpose is to find a proof method adapted to partially ordered formulas, liable of capturing a suitable notion of semantic closure
The Structure of Oppositions in Rough Set Theory and Formal Concept Analysis - Toward a New Bridge between the Two Settings

Rough set theory (RST) and formal concept analysis (FCA) are two formal settings in information management, which have found applications in learning and in data mining. Both rely on a binary relation. FCA starts with a formal context, which is a relation linking a set of objects with their properties. Besides, a rough set is a pair of lower and upper approximations of a set of objects induced by an indistinguishability relation; in the simplest case, this relation expresses that two objects are indistinguishable because their known properties are exactly the same. It has been recently noticed, with different concerns, that any binary relation on a Cartesian product of two possibly equal sets induces a cube of oppositions, which extends the classical Aristotelian square of oppositions structure, and has remarkable properties. Indeed, a relation applied to a given subset gives birth to four subsets, and to their complements, that can be organized into a cube. These four subsets are nothing but the usual image of the subset by the relation, together with similar expressions where the subset and / or the relation are replaced by their complements. The eight subsets corresponding to the vertices of the cube can receive remarkable interpretations, both in the RST and the FCA settings. One facet of the cube corresponds to the core of RST, while basic FCA operators are found on another facet. The proposed approach both provides an extended view of RST and FCA, and suggests a unified view of both of them
Molecular basis for intracranial aneurysm formation.

<Book Title> Neurovascular Events After Subarachnoid HemorrhageIntracranial aneurysm (IA) is a socially important disease both because it has a high prevalence and because of the severity of resultant subarachnoid hemorrhages after IA rupture. The major concern of current IA treatment is the lack medical therapies that are less invasive than surgical procedures for many patients. The current situation is mostly caused by a lack of knowledge regarding the regulating mechanisms of IA formation. Hemodynamic stress, especially high wall shear stress, loaded on arterial bifurcation sites is recognized as a trigger of IA formation from studies performed in the field of fluid dynamics. On the other hand, many studies using human specimens have also revealed the presence of active inflammatory responses, such as the infiltration of macrophages, in the pathogenesis of IA. Because of these findings, recent experimental studies, mainly using animal models of IA, have revealed some of the molecular mechanisms linking hemodynamic stress and long-lasting inflammation in IA walls. Currently, we propose that IA is a chronic inflammatory disease regulated by a positive feedback loop consisting of the cyclooxygenase (COX)-2 - prostaglandin (PG) E2 - prostaglandin E receptor 2 (EP2) - nuclear factor (NF)-κB signaling pathway triggered under hemodynamic stress and macrophage infiltration via NF-κB-mediated monocyte chemoattractant protein (MCP)-1 induction. These findings indicate future directions for the development of therapeutic drugs for IAs
Mouse Model of Subarachnoid Hemorrhage: Technical Note on the Filament Perforation Model

Experiments using genetically engineered mice are regarded as indispensable to gaining a better understanding of the molecular pathophysiology in neuronal injury after subarachnoid hemorrhage (SAH). Therefore, mouse SAH models are becoming increasingly important. The circle of Willis perforation (cWp) model is the most frequently used mouse SAH model. We report and discuss the technical surgical approach, results, and difficulties associated with the cWp model, with reference to the existing literature. Our results largely confirmed previously published results. This model may be the first choice at present, because important pathologies can be reproduced in this model and most findings in the literature are based on it
Modelling the influence of tree removal on embankment slope hydrology

Trees cover the slopes of many railway earthworks supporting the UK’s transport network. Root water uptake by trees can cause seasonal shrinkage and swelling of the embankment soil, affecting the line and level of the railway track. This requires continual maintenance to maintain the serviceability of the track and reduce train speed restrictions. However, the removal of trees from railway embankment slopes and the loss of soil suctions generated by root water uptake may negatively impact embankment stability, particularly during periods of wet weather. An improved understanding of the influence of tree removal on embankment hydrology is required so that infrastructure owners can develop a managed system of vegetation clearance. Hydrological field monitoring data from an instrumented railway embankment are presented and compared with a finite element model of root water uptake incorporating daily weather data. It is shown that trees maintain persistent suctions within their root zone which are unaffected by seasonal wetting and drying at the soil surface. However, the removal of trees from the embankment slope causes wetting of the soil from the soil surface as persistent soil suctions within the root zone are lost
Soundness and Completeness of the NRB Verification Logic

This short paper gives a model for and a proof of completeness of the NRB
verification logic for deterministic imperative programs, the logic having been
used in the past as the basis for automated semantic checks of large,
fast-changing, open source C code archives, such as that of the Linux kernel
source. The model is a colored state transitions model that approximates from
above the set of transitions possible for a program. Correspondingly, the logic
catches all traces that may trigger a particular defect at a given point in the
program, but may also flag false positives.Comment: To appear in OpenCert 2013 Workshop, Sept 23, Madrid, 15
Development of dependable controllers in the context of machines design

Proceedings of ICMD 2013In the domain of machines' design, one of the most important issues to solve is related with the controller's design, mainly, guaranteeing that the machine will behave as expected. In order to achieve a dependable controller, some steps can be considered, such as the formalization of its specification - before being translated to the program that will be inserted in the controller device - and the respective analysis and verification. Nowadays, some formal analysis techniques, such as formal verification, are used to achieve this purpose. The dependability of a controller, however, is impacted by its execution context. This paper proposes an approach for the formal verification of the specification of mechatronic system's controllers, which considers, on the formal verification tasks, the behavior of the plant and the behavior of the Human Machine Interface of the Mechatronic system. Some conclusions are extrapolated for other systems of the same kind
Mobility Support in User-Centric Networks

In this paper, an overview of challenges and requirements for mobility management in user-centric networks is given, and a new distributed and dynamic per-application mobility management solution is presented. After a brief summary of generic mobility management concepts, existing approaches from the distributed and peer-to-peer mobility management literature are introduced, along with their applicability or shortcomings in the UCN environment. Possible approaches to deal with the decentralized and highly dynamic nature of UCNs are also provided with a discussion and an introduction to potential future work
Traversing the k-mer Landscape of NGS Read Datasets for Quality Score Sparsification

It is becoming increasingly impractical to indefinitely store raw sequencing data for later processing in an uncompressed state. In this paper, we describe a scalable compressive framework, Read-Quality-Sparsifier (RQS), which substantially outperforms the compression ratio and speed of other de novo quality score compression methods while maintaining SNP-calling accuracy. Surprisingly, RQS also improves the SNP-calling accuracy on a gold-standard, real-life sequencing dataset (NA12878) using a k-mer density profile constructed from 77 other individuals from the 1000 Genomes Project. This improvement in downstream accuracy emerges from the observation that quality score values within NGS datasets are inherently encoded in the k-mer landscape of the genomic sequences. To our knowledge, RQS is the first scalable sequence-based quality compression method that can efficiently compress quality scores of terabyte-sized and larger sequencing datasets. Availability: An implementation of our method, RQS, is available for download at: http://rqs.csail.mit.edu/. © 2014 Springer International Publishing Switzerland. Keywords: RQS; quality score; sparsification; compression; accuracy; variant callingHertz FoundationNational Institutes of Health (U.S.) (R01GM108348
Model-based Specification and Validation of Security and Dependability Patterns

International audienceThe requirement for higher Security and Dependability (S&D) of systems is continuously increasing, even in domains traditionally not deeply involved in such issues. In our work, we propose a modeling environment for pattern-based secure and dependable embedded system development by design. Here we study a general scheme for representing security and dependability (S&D) design patterns whose intention specification can be defined using a set of local properties. We propose an approach that associates Model Driven Engineering (MDE) and formal validation to get a common representation to specify patterns for several domains. The contribution of this work is twofold. On the one hand, we use model-based techniques to capture a set of artifacts to specify patterns. On the other hand, we introduce a set of artifacts for the formal validation of these patterns in order to guarantee their correctness. As an illustration of the approach, we study the authorization pattern
On the Reverse Engineering of the Citadel Botnet

Citadel is an advanced information-stealing malware which targets financial
information. This malware poses a real threat against the confidentiality and
integrity of personal and business data. A joint operation was recently
conducted by the FBI and the Microsoft Digital Crimes Unit in order to take
down Citadel command-and-control servers. The operation caused some disruption
in the botnet but has not stopped it completely. Due to the complex structure
and advanced anti-reverse engineering techniques, the Citadel malware analysis
process is both challenging and time-consuming. This allows cyber criminals to
carry on with their attacks while the analysis is still in progress. In this
paper, we present the results of the Citadel reverse engineering and provide
additional insight into the functionality, inner workings, and open source
components of the malware. In order to accelerate the reverse engineering
process, we propose a clone-based analysis methodology. Citadel is an offspring
of a previously analyzed malware called Zeus; thus, using the former as a
reference, we can measure and quantify the similarities and differences of the
new variant. Two types of code analysis techniques are provided in the
methodology, namely assembly to source code matching and binary clone
detection. The methodology can help reduce the number of functions requiring
manual analysis. The analysis results prove that the approach is promising in
Citadel malware analysis. Furthermore, the same approach is applicable to
similar malware analysis scenarios.Comment: 10 pages, 17 figures. This is an updated / edited version of a paper
  appeared in FPS 201
A general framework for group authentication and key exchange protocols

Published version of a chapter in the book: Foundations and Practice of Security. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-05302-8_3In this paper, we propose a novel framework for group authentication and key exchange protocols. There are three main advantages of our framework. First, it is a general one, where different cryptographic primitives can be used for different applications. Second, it works in a one-to-multiple mode, where a party can authenticate several parties mutually. Last, it can provide several security features, such as protection against passive adversaries and impersonate attacks, implicit key authentication, forward and backward security. There are two types of protocols in our framework. The main difference between them is that the authenticator in Type II has a certificate while in Type I does not. Under the general framework, we also give the details of protocols based on Diffie-Hellman key exchange system, and discrete logarithm problem (DLP) or elliptic curve discrete logarithm problem (ECDLP) based ElGamal encryption respectively. Session keys will be established at the end of each session and they can be utilized later to protect messages transmitted on the communication channel
Model-based Specification and Validation of Security and Dependability Patterns

The requirement for higher Security and Dependability (S&D) of systems is continuously increasing, even in domains traditionally not deeply involved in such issues. In our work, we propose a modeling environment for pattern-based secure and dependable embedded system development by design. Here we study a general scheme for representing security and dependability (S&D) design patterns whose intention specification can be defined using a set of local properties. We propose an approach that associates Model Driven Engineering (MDE) and formal validation to get a common representation to specify patterns for several domains. The contribution of this work is twofold. On the one hand, we use model-based techniques to capture a set of artifacts to specify patterns. On the other hand, we introduce a set of artifacts for the formal validation of these patterns in order to guarantee their correctness. As an illustration of the approach, we study the authorization pattern
Diffeomorphic Iterative Centroid Methods for Template Estimation on Large Datasets

International audienceA common approach for analysis of anatomical variability relies on the stimation of a template representative of the population. The Large Deformation Diffeomorphic Metric Mapping is an attractive framework for that purpose. However, template estimation using LDDMM is computationally expensive, which is a limitation for the study of large datasets. This paper presents an iterative method which quickly provides a centroid of the population in the shape space. This centroid can be used as a rough template estimate or as initialization of a template estimation method. The approach is evaluated on datasets of real and synthetic hippocampi segmented from brain MRI. The results show that the centroid is correctly centered within the population and is stable for different orderings of subjects. When used as an initialization, the approach allows to substantially reduce the computation time of template estimation