pinecone/core-2020-05-10-deduplication huggingface dataset:
Interplay between security providers, consumers, and attackers: a weighted congestion game approach

International audienceNetwork users can choose among different security solutions to protect their data. Those solutions are offered by competing providers, with possibly different performance and price levels. In this paper, we model the interactions among users as a noncooperative game, with a negative externality coming from the fact that attackers target popular systems to maximize their expected gain. Using a nonatomic weighted congestion game model for user interactions, we prove the existence and uniqueness of a user equilibrium, compute the corresponding Price of Anarchy, that is the loss of efficiency due to user selfishness, and investigate some consequences for the (higher-level) pricing game played by security providers
HIP-storytelling: hand interactive projection for storytelling

We have created an interactive storytelling system for public spaces that is collaborative, easy and entertaining to use, and allows for a natural inte-raction. The system consists of a table, a ceiling mounted projector that projects onto the table, and a 3D camera for tracking hands and for object recognition. The main feature of the system is the projection on top of the palm of the hand of the users; thus, the hand becomes also a viewing surface. This allows for very natural gestural interaction, such as holding and passing objects between users. For example, in the course of narrative, users can hand over a story cha-racter or object to each other. We also employ projection based augmented real-ity to animate real objects on the table. Apart from entertainment, the system shall be employed for concrete educational interactive storytelling applications in public spaces
Modular Abstractions of Reactive Nodes using Disjunctive Invariants

International audienceWe wish to abstract nodes in a reactive programming language, such as Lustre, into nodes with a simpler control structure, with a bound on the number of control states. In order to do so, we compute disjunctive invariants in predicate abstraction, with a bounded number of disjuncts, then we abstract the node, each disjunct representing an abstract state. The computation of the disjunctive invariant is performed by a form of quantifier elimination expressed using SMT-solving. The same method can also be used to obtain disjunctive loop invariants
Estimating Probability of Failure of a Complex System Based on Inexact Information about Subsystems and Components, with Potential Applications to Aircraft Maintenance

In many real-life applications (e.g., in aircraft maintenance), we need to estimate the probability of failure of a complex system (such as an aircraft as a whole or one of its subsystems). Complex systems are usually built with redundancy allowing them to withstand the failure of a small number of components. In this paper, we assume that we know the structure of the system, and, as a result, for each possible set of failed components, we can tell whether this set will lead to a system failure. For each component A, we know the probability P(A) of its failure with some uncertainty: e.g., we know the lower and upper bounds P(A) and P(A) for this probability. Usually, it is assumed that failures of different components are independent events. Our objective is to use all this information to estimate the probability of failure of the entire the complex system. In this paper, we describe several methods for solving this problem, including a new efficient method for such estimation based on Cauchy deviates
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses

International audienceWe present a way to enjoy the power of SAT and SMT provers in Coq without compromising soundness. This requires these provers to return not only a yes/no answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in Coq. It is conceived in a modular way, in order to tame the proofs' complexity and to be extendable. It can currently check witnesses from the SAT solver ZChaff and from the SMT solver veriT. Experiments highlight the efficiency of this checker. On top of it, new reflexive Coq tactics have been built that can decide a subset of Coq's logic by calling external provers and carefully checking their answers
Tactics for Reasoning modulo AC in Coq

16pInternational audienceWe present a set of tools for rewriting modulo associativity and commutativity (AC) in Coq, solving a long-standing practical problem. We use two building blocks: first, an extensible reflexive decision procedure for equality modulo AC; second, an OCaml plug-in for pattern matching modulo AC. We handle associative only operations, neutral elements, uninterpreted function symbols, and user-defined equivalence relations. By relying on type-classes for the reification phase, we can infer these properties automatically, so that end-users do not need to specify which operation is A or AC, or which constant is a neutral element
First steps towards the certification of an ARM simulator using Compcert

International audienceThe simulation of Systems-on-Chip (SoC) is nowadays a hot topic because, beyond providing many debugging facilities, it allows the development of dedicated software before the hardware is available. Low-consumption CPUs such as ARM play a central role in SoC. However, the effectiveness of simulation depends on the faithfulness of the simulator. To this effect, we propose here to prove significant parts of such a simulator, SimSoC. Basically, on one hand, we develop a Coq formal model of the ARM architecture while on the other hand, we consider a version of the simulator including components written in Compcert-C. Then we prove that the simulation of ARM operations, according to Compcert-C formal semantics, conforms to the expected formal model of ARM. Size issues are partly dealt with using automatic generation of significant parts of the Coq model and of SimSoC from the official textual definition of ARM. However, this is still a long-term project. We report here the current stage of our efforts and discuss in particular the use of Compcert-C in this framework
Oblivious RAM with O((log N)3) worst-case cost

LNCS v. 7073 entitled: Advances in Cryptology – ASIACRYPT 2011Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost. Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete.
This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. To achieve the desired worst-case asymptotic performance, we propose a novel technique in which we organize the O-RAM storage into a binary tree over data buckets, while moving data blocks obliviously along tree edges.postprin
Program Obfuscation with Leaky Hardware

We consider general program obfuscation mechanisms using “somewhat trusted” hardware devices, with the goal of minimizing the usage of the hardware, its complexity, and the required trust. Specifically, our solution has the following properties:

(i) The obfuscation remains secure even if all the hardware devices in use are leaky. That is, the adversary can obtain the result of evaluating any function on the local state of the device, as long as this function has short output. In addition the adversary also controls the communication between the devices.

(ii) The number of hardware devices used in an obfuscation and the amount of work they perform are polynomial in the security parameter independently of the obfuscated function’s complexity.

(iii) A (universal) set of hardware components, owned by the user, is initialized only once and from that point on can be used with multiple “software-based” obfuscations sent by different vendors.European Commission (Marie Curie International Reintegration Grant)Israel Science Foundation (Grant)Check Point Institute for Information SecurityNational Science Foundation (U.S.) (NSF grant CCF-0832797)Computing Research Association (Computing Innovation Fellowship
Introducing Knowledge-Enrichment Techniques for Complex Event Processing

Complex event processing received an increasing interest during  the last years with the adoption of event-driven architectures in various  application domains. Despite a number of solutions that can process  events in near real-time, their effectiveness for decision support relies  heavily upon human domain knowledge. This poses a problem in areas  that require vast amounts of specialized knowledge and background information,  such as medical environments. We propose four techniques to  enrich complex event processing with domain knowledge from ontologies  to overcome this limitation. These techniques focus on preserving the  strengths of state-of-the-art systems and enhancing them with existing  ontologies to increase accuracy and effectiveness. The viability of our  approach is demonstrated in a multifaceted experiment.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Application of wavelet networks to adaptive control of robotic manipulators

Published version of a chapter in the book: Intelligent Robotics and Applications. Also available from the publisher at; http://dx.doi.org/10.1007/978-3-642-25489-5_39In this paper, a wavelet-based adaptive control is proposed for a class of robotic manipulators, which consist of nonlinearities for friction effects and uncertain terms as disturbances. The controller is calculated by using a mixed of feedback linearization technique, supervisory control and H∞ control. In addition, the parameter adaptive laws of the wavelet network are developed using a Lyapunov-based design. It is also shown that both system tracking stability and convergence of the error estimation can be guaranteed in the closed-loop system. Simulation results on a three-link robot manipulator show the satisfactory performance of the proposed control schemes even in the presence of large modeling uncertainties and external disturbances
Communities unfolding in multislice networks

Discovering communities in complex networks helps to understand the behaviour
of the network. Some works in this promising research area exist, but
communities uncovering in time-dependent and/or multiplex networks has not
deeply investigated yet. In this paper, we propose a communities detection
approach for multislice networks based on modularity optimization. We first
present a method to reduce the network size that still preserves modularity.
Then we introduce an algorithm that approximates modularity optimization (as
usually adopted) for multislice networks, thus finding communities. The network
size reduction allows us to maintain acceptable performances without affecting
the effectiveness of the proposed approach.Comment: 8 pages, 4 figure
Examining the Frankenstein Syndrome :
                    An open-ended cross-cultural survey

This paper reports findings from an open-ended survey on attitudes towards humanoid robots collected from samples in the United Kingdom and Japan. 335 participants were asked how they felt about humanoid robots becoming widespread in society and what tasks they wanted humanoid robots to perform. While the UK sample was overall less negative towards humanoid robots than their Japanese counterparts, the UK sample did not want robots to perform tasks that required capabilities deemed as human qualities, such as empathy, caring, or independent decision making
Children interpretation of emotional body language displayed by a robot

Previous results show that adults are able to interpret different key poses displayed by the robot and also that changing the head position affects the expressiveness of the key poses in a consistent way. Moving the head down leads to decreased arousal (the level of energy), valence (positive or negative) and stance (approaching or avoiding) whereas moving the head up produces an increase along these dimensions [1]. Hence, changing the head position during an interaction should send intuitive signals which could be used during an interaction. The ALIZ-E target group are children between the age of 8 and 11. Existing results suggest that they would be able to interpret human emotional body language [2, 3]. Based on these results, an experiment was conducted to test whether the results of [1] can be applied to children. If yes body postures and head position could be used to convey emotions during an interaction
Simple, optimal and efficient auctions

We study the extent to which simple auctions can simultaneously achieve good revenue and efficiency guarantees in single-item settings. Motivated by the optimality of the second price auction with monopoly reserves when the bidders’ values are drawn i.i.d. from regular distributions [12], and its approximate optimality when they are drawn from independent regular distributions [11], we focus our attention to the second price auction with general (not necessarily monopoly) reserve prices, arguably one of the simplest and most intuitive auction formats. As our main result, we show that for a carefully chosen set of reserve prices this auction guarantees at least 20% of both the optimal welfare and the optimal revenue, when the bidders’ values are distributed according to independent, not necessarily identical, regular distributions. We also prove a similar guarantee, when the values are drawn i.i.d. from a—possibly irregular—distribution.Proceedings of the 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011.National Science Foundation (U.S.) (award CCF-0953960)National Science Foundation (U.S.) (CCF-1101491
Natural models for evolution on networks.

Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described by the Moran process [15]. Recently, this approach has been generalized in [13] by arranging individuals on the nodes of a network (in general, directed). In this setting, the existence of directed arcs enables the simulation of extreme phenomena, where the fixation probability of a randomly placed mutant (i.e. the probability that the offsprings of the mutant eventually spread over the whole population) is arbitrarily small or large. On the other hand, undirected networks (i.e. undirected graphs) seem to have a smoother behavior, and thus it is more challenging to find suppressors/amplifiers of selection, that is, graphs with smaller/greater fixation probability than the complete graph (i.e. the homogeneous population). In this paper we focus on undirected graphs. We present the first class of undirected graphs which act as suppressors of selection, by achieving a fixation probability that is at most one half of that of the complete graph, as the number of vertices increases. Moreover, we provide some generic upper and lower bounds for the fixation probability of general undirected graphs. As our main contribution, we introduce the natural alternative of the model proposed in [13]. In our new evolutionary model, all individuals interact simultaneously and the result is a compromise between aggressive and non-aggressive individuals. That is, the behavior of the individuals in our new model and in the model of [13] can be interpreted as an “aggregation” vs. an “all-or-nothing” strategy, respectively. We prove that our new model of mutual influences admits a potential function, which guarantees the convergence of the system for any graph topology and any initial fitness vector of the individuals. Furthermore, we prove fast convergence to the stable state for the case of the complete graph, as well as we provide almost tight bounds on the limit fitness of the individuals. Apart from being important on its own, this new evolutionary model appears to be useful also in the abstract modeling of control mechanisms over invading populations in networks. We demonstrate this by introducing and analyzing two alternative control approaches, for which we bound the time needed to stabilize to the “healthy” state of the system. \u
Decision Markets with Good Incentives

Decision markets both predict and decide the future.  They allow experts to predict the effects of each of a set of possible actions, and after reviewing these predictions a decision maker selects an action to perform.  When the future is independent of the market, strictly proper scoring rules myopically incentivize experts to predict consistent with their beliefs, but this is not generally true when a decision is to be made.  When deciding, only predictions for the chosen action can be evaluated for their accuracy since the other predictions become counterfactuals.  This limitation can make some actions more valuable than others for an expert, incentivizing the expert to mislead the decision maker.  We construct and characterize decision markets that are – like prediction markets using strictly proper scoring rules – myopic incentive compatible.  These markets require the decision maker always risk taking every available action, and reducing this risk increases the decision maker’s worst-case loss.  We also show a correspondence between strictly proper decision markets and strictly proper sets of prediction markets, creating a formal connection between the incentives of prediction and decision markets.Engineering and Applied Science
On the stability of m-sequences

The original publication is available at www.springerlink.comWe study the stability of m-sequences in the sense of determining\ud
the number of errors needed for decreasing the period of the\ud
sequences, as well as giving lower bounds on the k-error linear complexity\ud
of the sequences. For prime periods the results are straightforward\ud
so we concentrate on composite periods. We give exact results for the\ud
case when the period is reduced by a factor which is a Mersenne number\ud
and for the case when it is reduced by a prime p such that the order\ud
of 2 modulo p equals p \u100000 1. The general case is believed to be di cult\ud
due to its similarity to a well studied problem in coding theory. We also\ud
provide results about the relative frequencies of the di erent cases. We\ud
formulate a conjecture regarding the minimum number of errors needed\ud
for reducing the period at all. Finally we apply our results to the LFSR\ud
components of several well known stream ciphers
A note on the dual codes of module skew codes

In [4], starting from an automorphism theta of a finite field F_q and a skew polynomial ring R=F_q[X;theta], module theta-codes are defined as left R-submodules of R/Rf where f in R. In [4] it is conjectured that an Euclidean self-dual module theta-code is a theta-constacyclic code and a proof is given in the special case when the order of theta divides the length of the code. In this paper we prove that this conjecture holds in general by showing that the dual of a module theta-code is a module theta-code if and only if it is a theta-constacyclic code. Furthermore, we establish that a module theta-code which is not theta-constacyclic is a shortened theta-constacyclic code and that its dual is a punctured theta-constacyclic code. This enables us to give the general form of a parity-check matrix for module theta-codes and for module (theta,delta)-codes over F_q[X;theta,delta] where delta is a derivation over F_q . We also prove the conjecture for module theta-codes who are defined over a ring A[X;theta] where A is a finite ring. Lastly we construct self-dual theta-cyclic codes of length 2^s over F_4 for s ≥ 3 which are asymptotically bad and conjecture that there exists no other self-dual module theta-code of this length over F_4
On forward secrecy in one-round key exchange

Most one-round key exchange protocols provide only weak forward secrecy at best. \ud
Furthermore, one-round protocols with strong forward secrecy often break badly when faced with an adversary who can obtain ephemeral keys. We provide a characterisation of how strong forward secrecy can be achieved in one-round key exchange. Moreover, we show that protocols exist which provide strong forward secrecy and remain secure with weak forward secrecy even when the adversary is allowed to obtain ephemeral keys. We provide a compiler to achieve this for any existing secure protocol with weak forward secrecy
On Constructing Homomorphic Encryption Schemes from Coding Theory

International audienceWe introduce a generic construction principle for homomorphic encryption schemes based on coding theory. These possess several non-standard positive features. First, they are not restricted to linear homomorphism but allow for evaluating multivariate polynomials up to a fixed (but arbitrary) degree μ on encrypted field elements. Second, they can be instantiated with various error correcting codes, even for codes with poor correcting capabilities. Third, depending on the deployed code, one can achieve very efficient schemes. As a concrete example, we present an instantiation based on Reed-Muller codes where for μ = 2 and μ = 3 and security levels between 80 and 128 bits, all operations take less than a second (after some pre-computation). However, our analysis reveals also limitations on this approach. For structural reasons, such schemes cannot be public-key, allow for a limited number of fresh encryptions only, and cannot be combined with the bootstrapping technique. We argue why such schemes are nonetheless useful in certain application scenarios and discuss possible directions on how to overcome these issues
Towards a service system ontology for service science

Service Science is a new interdisciplinary approach to the study, design, implementation, and innovation of service systems. However due to the variety in service research, there is no consensus yet about the theoretical foundation of this domain. In this paper we clarify the service systems worldview proposed by Service Science researchers Spohrer and Kwan by investigating its foundational concepts from the perspective of established service theories and frameworks. By mapping the proposed service system concepts on the selected service theories and frameworks, we investigate their theoretical foundations, examine their proposed definitions and possible conflicting interpretations, discover their likely relationships and general structure, and identify a number of issues that need further discussion and elaboration. This analysis is visualised in a multi-view conceptual model (in the form of a UML class diagram) which we regard as a first step towards an explicitly and formally defined service system ontology
Importance Sampling of Probabilistic Contracts in Web Services

International audienceWith web services quality of service (QoS) modeled as random variables, the accuracy of sampled values for precise service level agreements (SLAs) come into question. Samples with lower spread are more accurate for calculating contractual obligations, which is typically not the case for web services QoS. Moreover, the extreme values in case of heavy-tailed distributions (eg. 99.99 percentile) are seldom observed through limited sampling schemes. To improve the accuracy of contracts, we propose the use of variance reduction techniques such as importance sampling. We demonstrate this for contracts involving demand and refuel operations within the Dell supply chain example. Using measured values, efficient forecasting of future deviation of contracts may also be performed. A consequence of this is a more precise definition of sampling, measurement and variance tolerance in SLA declarations