pinecone/core-2020-05-10-deduplication huggingface dataset:
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

International audienceIn a seminal work at EUROCRYPT '96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL reduction of a high-dimensional matrix with extra-large coefficients. We present in this paper the first significant speedups over Coppersmith's algorithm. The first speedup is based on a special property of the matrices used by Coppersmith's algorithm, which allows us to provably speed up the LLL reduction by rounding, and which can also be used to improve the complexity analysis of Coppersmith's original algorithm. The exact speedup depends on the LLL algorithm used: for instance, the speedup is asymptotically quadratic in the bit-size of the small-root bound if one uses the Nguyen-Stehlé L2 algorithm. The second speedup is heuristic and applies whenever one wants to enlarge the root size of Coppersmith's algorithm by exhaustive search. Instead of performing several LLL reductions independently, we exploit hidden relationships between these matrices so that the LLL reductions can be somewhat chained to decrease the global running time. When both speedups are combined, the new algorithm is in practice hundreds of times faster for typical parameters
Functional Signatures and Pseudorandom Functions

We introduce two new cryptographic primitives: functional digital signatures and functional pseudorandom functions.

In a functional signature scheme, in addition to a master signing key that can be used to sign any message, there are signing keys for a function f, which allow one to sign any message in the range of f. As a special case, this implies the ability to generate keys for predicates P, which allow one to sign any message m for which P(m) = 1.

We show applications of functional signatures to constructing succinct non-interactive arguments and delegation schemes. We give several general constructions for this primitive based on different computational hardness assumptions, and describe the trade-offs between them in terms of the assumptions they require and the size of the signatures.

In a functional pseudorandom function, in addition to a master secret key that can be used to evaluate the pseudorandom function F on any point in the domain, there are additional secret keys for a function f, which allow one to evaluate F on any y for which there exists an x such that f(x) = y. As a special case, this implies pseudorandom functions with selective access, where one can delegate the ability to evaluate the pseudorandom function on inputs y for which a predicate P(y) = 1 holds. We define and provide a sample construction of a functional pseudorandom function family for prefix-fixing functions. This construction yields, in particular, punctured pseudorandom functions, which have proven an invaluable tool in recent advances in obfuscation (Sahai and Waters ePrint 2013).United States. Air Force Research Laboratory (agreement number FA8750-11-2-0225)National Science Foundation (U.S.) (Trustworthy Computing Program: NSF CCF-1018064)European Union (Tenth Framework Programme (FP10/ 2010-2016), grant agreement no. 259426 ERC-CaC
Operation modes of battery chargers for electric vehicles in the future smart grids

This paper presents an on-board bidirectional battery charger for
Electric Vehicles (EVs), which operates in three different modes: Grid-to-
Vehicle (G2V), Vehicle-to-Grid (V2G), and Vehicle-to-Home (V2H). Through
these three operation modes, using bidirectional communications based on Information
and Communication Technologies (ICT), it will be possible to exchange
data between the EV driver and the future smart grids. This collaboration
with the smart grids will strengthen the collective awareness systems, contributing
to solve and organize issues related with energy resources and power
grids. This paper presents the preliminary studies that results from a PhD work
related with bidirectional battery chargers for EVs. Thus, in this paper is described
the topology of the on-board bidirectional battery charger and the control
algorithms for the three operation modes. To validate the topology it was
developed a laboratory prototype, and were obtained experimental results for
the three operation modes.FEDER Funds, through the Operational Programme for  Competitiveness Factors  –  COMPETE, and by National Funds through FCT  –  Foundation for Science and Technology of Portugal, under the project FCOMP-01-0124- FEDER-022674, and QREN project AAC n.º36/SI/2009  –  1384
Power outage detection methods for theoperation of a shunt active power flter as energy backup system

This paper presents the study of power outage detection methods that can be applied to a Shunt Active Power Filter (SAPF) with energy backup capability. SAPFs can successfully compensate Power Quality problems related with distorted or unbalanced currents and low power factor. Future Smart Grids will combine devices, control strategies and functionalities to increase the grid reliability and the power management capability. One of the main tools necessary to enable these features is the information of what is occurring in all the smart grid parts. In this context the fast detection of power outages is critical, so this paper also contributes for the discussion of the best ways to extract information in the context of future smart grids. The combination of information and flexible devices in a smart grid will enable the implementation of collective awareness systems, which can deal with different electrical grid problems and situations in an organic manner.This work is financed by FEDER Funds, through the Operational Programme for Competitiveness Factors – COMPETE, and by National Funds through FCT – Foundation for Science and Technology of Portugal, under the projects FCOMP 01-0124-FEDER-022674 and PTDC/EEA-EEL/104569/2008. Bruno Exposto is supported by the doctoral scholarship SFRH/BD/87999/2012 granted by FCT – Foundation for Science and Technology of Portugal. 
0info:eu-repo/semantics/publishedVersio
Transformer and LCL Filter Design for DPFCs

Flexible AC Transmission Systems (FACTS) can be used for power flow control in AC transmission grids, allowing simultaneous control of the bus voltage and line active and reactive power. However, due to high costs and reliability concerns, the application of this technology has been limited in such applications. Recently, the concept of Distributed FACTS (DFACTS) and Distributed Power Flow Controller (DPFC) has been introduced as a low cost high reliability alternative for power flow control. This paper presents the design of a coupling transformer and a LCL filter for DPFC devices. To extract the electromagnetic energy from the transmission line a transformer with a single turn primary is designed and optimized. A third-order LCL filter is used to guarantee high order harmonics filtering. Simulations results are presented and discussed
Three-valued logics, uncertainty management and rough sets

This paper is a survey of the connections between three-valued logics and rough sets from the point of view of incomplete information management. Based on the fact that many three-valued logics can be put under a unique algebraic umbrella, we show how to translate three-valued conjunctions and implications into operations on ill-known sets such as rough sets. We then show that while such translations may provide mathematically elegant algebraic settings for rough sets, the interpretability of these connectives in terms of an original set approximated via an equivalence relation is very limited, thus casting doubts on the practical relevance of truth-functional logical renderings of rough sets
The MAELIA multi-agent platform for integrated assessment of low-water management issues

The MAELIA project is developing an agent-based modeling and simulation platform to study the environmental, economic and social impacts of various regulations regarding water use and water management in combination with climate change. It is applied to the case of the French Adour-Garonne Basin, which is the most concerned in France by water scarcity during the low-water period. An integrated approach has been chosen to model this social-ecological system: the model combines spatiotemporal models of ecologic (e.g. rainfall and temperature changes, water flow and plant growth) and socio-economic (e.g. farmer decision-making process, management of low-water flow, demography, land use and land cover changes) processes and sub-models of cognitive sharing among agents (e.g. weather forecast, normative constraints on behaviors
A categorial type logic

In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to semantic proofs. Thereby, logical categorial grammar embodies in a pure logical form the principles of compositionality, lex-icalism, and parsing as deduction. Interest has focused on multimodal versions but the advent of the (dis)placement calculus of Morrill, Valentín and Fadda [21] suggests that the role of structural rules can be reduced, and this facilitates computational implementation. In this paper we specify a comprehensive formalism of (dis) placement logic for the parser/theorem prover CatLog integrating categorial logic connectives proposed to date and illustrate with a cover grammar of the Montague fragment.Postprint (author’s final draft
A Logical Basis for Quantum Evolution and Entanglement

International audienceWe reconsider discrete quantum causal dynamics where quan-tum systems are viewed as discrete structures, namely directed acyclic graphs. In such a graph, events are considered as vertices and edges de-pict propagation between events. Evolution is described as happening between a special family of spacelike slices, which were referred to as locative slices. Such slices are not so large as to result in acausal influ-ences, but large enough to capture nonlocal correlations. In our logical interpretation, edges are assigned logical formulas in a spe-cial logical system, called BV, an instance of a deep inference system. We demonstrate that BV, with its mix of commutative and noncommutative connectives, is precisely the right logic for such analysis. We show that the commutative tensor encodes (possible) entanglement, and the non-commutative seq encodes causal precedence. With this interpretation, the locative slices are precisely the derivable strings of formulas. Several new technical results about BV are developed as part of this analysis
A reduced semantics for deciding trace equivalence using constraint
  systems

Many privacy-type properties of security protocols can be modelled using
trace equivalence properties in suitable process algebras. It has been shown
that such properties can be decided for interesting classes of finite processes
(i.e., without replication) by means of symbolic execution and constraint
solving. However, this does not suffice to obtain practical tools. Current
prototypes suffer from a classical combinatorial explosion problem caused by
the exploration of many interleavings in the behaviour of processes.
M\"odersheim et al. have tackled this problem for reachability properties using
partial order reduction techniques. We revisit their work, generalize it and
adapt it for equivalence checking. We obtain an optimization in the form of a
reduced symbolic semantics that eliminates redundant interleavings on the fly.Comment: Accepted for publication at POST'1
Target oriented relational model finding

Lecture Notes in Computer Science 8411, 2014Model finders are becoming useful in many software engineering problems. Kodkod is one of the most popular, due to its support for relational logic (a combination of first order logic with relational algebra operators and transitive closure), allowing a simpler specification of constraints, and support for partial instances, allowing the specification of a priori (exact, but potentially partial) knowledge about a problem's solution. However, in some software engineering problems, such as model repair or bidirectional model transformation, knowledge about the solution is not exact, but instead there is a known target that the solution should approximate. In this paper we extend Kodkod's partial instances to allow the specification of such targets, and show how its model finding procedure can be adapted to support them (using both PMax-SAT solvers or SAT solvers with cardinality constraints). Two case studies are also presented, including a careful performance evaluation to assess the effectiveness of the proposed extension
Sound Merging and Differencing for Class Diagrams

International audienceClass diagrams are among the most popular modeling lan-guages in industrial use. In a model-driven development process, class diagrams evolve, so it is important to be able to assess differences between revisions, as well as to propagate differences using suitable merge operations. Existing differencing and merging methods are mainly syntactic, concentrating on edit operations applied to model elements, or they are based on sampling: enumerating some examples of instances which characterize the difference between two diagrams. This paper presents the first known (to the best of our knowledge) automatic model merging and differencing operators supported by a formal semantic theory guaranteeing that they are semantically sound. All instances of the merge of a model and its difference with another model are automatically instances of the second model. The differences we synthesize are represented using class diagram notation (not edits, or instances), which allows creation of a simple yet flexible algebra for diffing and merging. It also allows presenting changes comprehensively, in a notation already known to users
The PAPAGENO Parallel-Parser Generator

The increasing use of multicore processors has deeply transformed\ud
computing paradigms and applications. The wide availability of multicore systems had an impact also in the field of compiler technology, although the research on deterministic parsing did not prove to be effective in exploiting the architectural advantages, the main impediment being the inherent sequential nature of traditional LL and LR algorithms. We present PAPAGENO, an automated parser generator relying on operator precedence grammars. We complemented the PAPAGENO-generated parallel parsers with parallel lexing techniques, obtaining\ud
near-linear speedups on multicore machines, and the same speed as Bison\ud
parsers on sequential execution
deGoal a tool to embed dynamic code generators into applications

International audienceThe processing applications that are now being used in mo- bile and embedded platforms require at the same time a fair amount of processing power and a high level of flexibility, due to the nature of the data to process. In this context we propose a lightweight code genera- tion technique that is able to perform data dependent optimizations at run-time for processing kernels. In this paper we present the motivations and how to use deGoal a tool designed to build fast and portable binary code generators called com- pilettes
‘Virtual and Augmented Reality in Healthcare’, Virtual and Augmented Reality in Healthcare 1

There is a tremendous interest among researchers for the development of virtual, augmented reality and games technologies due to their widespread applications in medicine and healthcare. To date the major applications of these technologies include medical simulation, telemedicine, medical and healthcare training, pain control, visualisation aid for surgery, rehabilitation in cases such as stroke, phobia and trauma therapies. Many recent studies have identified the benefits of using Virtual Reality, Augmented Reality or serious games in a variety of medical applications.\ud
This research volume on Virtual, Augmented Reality and Serious Games for Healthcare 1 offers an insightful introduction to the theories, development and applications of virtual, augmented reality and digital games technologies in medical and clinical settings and healthcare in general. It is divided into six sections: section one presents a selection of applications in medical education and healthcare management; Section two relates to the nursing training, health literacy and healthy behaviour; Section three presents the applications of Virtual Reality in neuropsychology; Section four includes a number of applications in motor rehabilitation; Section five aimed at therapeutic games for various diseases; and the final section presents the applications of Virtual Reality in healing and restoration.\ud
This book is directed to the healthcare professionals, scientists, researchers, professors and the students who wish to explore the applications of virtual, augmented reality and serious games in healthcare further
Active diagnosis for probabilistic systems

International audienceThe diagnosis problem amounts to deciding whether some specific ''fault" event occurred or not in a system, given the observations collected on a run of this system. This system is then diagnosable if the fault can always be detected, and the active diagnosis problem consists in controlling the system in order to ensure its diagnosability. We consider here a stochastic framework for this problem: once a control is selected, the system becomes a stochastic process. In this setting, the active diagnosis problem consists in deciding whether there exists some observation-based strategy that makes the system diagnosable with probability one. We prove that this problem is EXPTIME-complete, and that the active diagnosis strategies are belief-based. The {\em safe} active diagnosis problem is similar, but aims at enforcing diagnosability while preserving a positive probability to non faulty runs, i.e. without enforcing the occurrence of a fault. We prove that this problem requires non belief-based strategies, and that it is undecidable. However, it belongs to NEXPTIME when restricted to belief-based strategies. Our work also refines the decidability/undecidability frontier for verification problems on partially observed Markov decision processes
Measurements in Proof Nets as Higher-Order Quantum Circuits

International audienceWe build on the series of work by Dal Lago and coauthors and identify proof nets (of linear logic) as higher-order quantum circuits. By accommodating quantum measurement using additive slices, we obtain a comprehensive frame-work for programming and interpreting quantum computation. Specifically, we introduce a quantum lambda calculus MLLqm and define its geometry of interac-tion (GoI) semantics—in the style of token machines—via the translation of terms into proof nets. Its soundness, i.e. invariance under reduction of proof nets, is es-tablished. The calculus MLLqm attains a pleasant balance between expressivity (it is higher-order and accommodates all quantum operations) and concreteness of models (given as token machines, i.e. in the form of automata)
Resolving non-determinism in choreographies

Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies -called whole-spectrum implementation- that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, it is decidable whether an implementation is whole-spectrum. As a case study, we analyse the POP protocol under the lens of whole-spectrum implementation. © 2014 Springer-Verlag.This work has been partially sponsored by Projects: EU 7FP Grant 295261 (MEALS), ANPCyT BID-PICT-2008-00319, Ocean Observatories Initiative and EPSRC EP/K034413/1.Peer-reviewedPost-print23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 201
Overlapping and order-independent patterns - Definitional equality for all

Dependent pattern matching is a safe and efficient way to write programs and proofs in dependently typed languages. Current languages with dependent pattern matching treat overlapping patterns on a first-match basis, hence the order of the patterns can matter. Perhaps surprisingly, this order-dependence can even occur when the patterns do not overlap. To fix this confusing behavior, we developed a new semantics of pattern matching which treats all clauses as definitional equalities, even when the patterns overlap. A confluence check guarantees correctness in the presence of overlapping patterns. Our new semantics has two advantages. Firstly, it removes the order-dependence and thus makes the meaning of definitions clearer. Secondly, it allows the extension of existing definitions with new (consistent) evaluation rules. Unfortunately it also
makes pattern matching harder to understand theoretically, but we give a theorem that helps to bridge this gap. An experimental implementation in Agda shows that our approach is feasible in practice too.status: publishe
Model-driven Information Flow Security for Component-Based Systems

International audienceThis paper proposes a formal framework for studying information flow security in component-based systems. The security policy is defined and verified from the early steps of the system design. Two kinds of non-interference properties are formally introduced and for both of them, sufficient conditions that ensures and simplifies the automated verification are proposed. The verification is compositional, first locally, by checking the behavior of every atomic component and then globally, by checking the inter-components communication and coordination. The potential benefits are illustrated on a concrete case study about constructing secure heterogeneous distributed systems
Compositional Invariant Generation for Timed Systems

International audienceIn this paper we address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations between components. The method has been implemented as an extension of the D-Finder tool and successfully experimented on several benchmarks
SACO: Static analyzer for concurrent objects

We present the main concepts, usage and implementation of SACO, a static analyzer for concurrent objects. Interestingly, SACO is able to infer both liveness(namely termination and resource boundedness) and safety properties (namely deadlock freedom) of programs based on concurrent objects. The system integrates auxiliary analyses such as points-to and may-happen-in-parallel, which are essential for  increasing the accuracy of the aforementioned more complex properties. SACO provides accurate information about the dependencies which may introduce deadlocks, loops whose termination is not guaranteed, and upper bounds on the resource consumption of methods
Non-formal techniques for early assessment of design ideas for services

Designing systems for multiple stakeholders requires frequent collaboration with multiple stakeholders from the start. In many cases at least some stakeholders lack a professional habit of formal modeling. We report observations from student design teams as well as two case studies, respectively of a prototype for supporting creative communication to design objects, and of stakeholder-involvement in early design. In all observations and case studies we found that non-formal techniques supported strong collaboration resulting in deep understanding of early design ideas, of their value and of the feasibility of solutions