pinecone/core-2020-05-10-deduplication huggingface dataset:
Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms

International audienceDevelopment and deployment of interactive evolutionary multiobjective optimization algorithms (EMOAs) have recently gained broad interest. In this study, first steps towards a theory of interactive EMOAs are made by deriving bounds on the expected number of function evaluations and queries to a decision maker. We analyze randomized local search and the (1+1)-EA on the biobjective problems LOTZ and COCZ under the scenario that the decision maker interacts with these algorithms by providing a subjective preference whenever solutions are incomparable. It is assumed that this decision is based on the decision maker's internal utility function. We show that the performance of the interactive EMOAs may dramatically worsen if the utility function is non-linear instead of linear
Spatial and Epistemic Modalities in Constraint-Based Process Calculi

International audienceWe introduce spatial and epistemic process calculi for reasoning about spatial information and knowledge distributed among the agents of a system. We introduce domain-theoretical structures to represent spatial and epistemic information. We provide operational and denotational techniques for reasoning about the potentially infinite behaviour of spatial and epistemic processes. We also give compact representations of infinite objects that can be used by processes to simulate announcements of common knowledge and global informatio
Privacy-preserving stream aggregation with fault tolerance

LNCS v. 7397 entitled: Financial cryptography and data security : 16th International Conference, FC 2012 ... Revised selected papersWe consider applications where an untrusted aggregator would like to collect privacy sensitive data from users, and compute aggregate statistics periodically. For example, imagine a smart grid operator who wishes to aggregate the total power consumption of a neighborhood every ten minutes; or a market researcher who wishes to track the fraction of population watching ESPN on an hourly basis. We design novel mechanisms that allow an aggregator to accurately estimate such statistics, while offering provable guarantees of user privacy against the untrusted aggregator. Our constructions are resilient to user failure and compromise, and can efficiently support dynamic joins and leaves. Our constructions also exemplify the clear advantage of combining applied cryptography and differential privacy techniques. © 2012 Springer-Verlag.postprin
CTL: A Platform-Independent Crypto Tools Library Based on Dataflow Programming Paradigm

The diversity of computing platforms is increasing rapidly. In order to allow security applications to run on such diverse platforms, implementing and optimizing the same cryptographic primitives for multiple target platforms and heterogeneous systems can result in high costs. In this paper, we report our efforts in developing and benchmarking a platform-independent Crypto Tools Library (CTL). CTL is based on a dataflow programming framework called Reconfigurable Video Coding (RVC), which was recently standardized by ISO/IEC for building complicated reconfigurable video codecs. CTL benefits from various properties of the RVC framework including tools to 1) simulate the platform-independent designs, 2) automatically generate implementations in different target programming languages (e.g., C/C++, Java, LLVM, and Verilog/VHDL) for deployment on different platforms as software and/or hardware modules, and 3) design space exploitation such as automatic parallelization for multi- and many-core systems. We benchmarked the performance of the SHA-256 implementation in CTL on single-core target platforms and demonstrated that implementations automatically generated from platform-independent RVC applications can achieve a run-time performance comparable to reference implementations manually written in C and Java. For a quad-core target platform, we benchmarked a 4-adic hash tree application based on SHA-256 that achieves a performance gain of up to 300% for hashing messages of size 8 MB
Recent developments in planet migration theory

Planetary migration is the process by which a forming planet undergoes a
drift of its semi-major axis caused by the tidal interaction with its parent
protoplanetary disc. One of the key quantities to assess the migration of
embedded planets is the tidal torque between the disc and planet, which has two
components: the Lindblad torque and the corotation torque. We review the latest
results on both torque components for planets on circular orbits, with a
special emphasis on the various processes that give rise to additional, large
components of the corotation torque, and those contributing to the saturation
of this torque. These additional components of the corotation torque could help
address the shortcomings that have recently been exposed by models of planet
population syntheses. We also review recent results concerning the migration of
giant planets that carve gaps in the disc (type II migration) and the migration
of sub-giant planets that open partial gaps in massive discs (type III
migration).Comment: 52 pages, 18 figures. Review article to be published in "Tidal
  effects in Astronomy and Astrophysics", Lecture Notes in Physic
A parallel cooperative co-evolutionary genetic algorithm for the composite SaaS placement problem in Cloud computing

A composite SaaS (Software as a Service) is a software that is comprised of several software components and data components. The composite SaaS placement problem is to determine where each of the components should be deployed in a cloud computing environment such that the performance of the composite SaaS is optimal. From the computational point of view, the composite SaaS placement problem is a large-scale combinatorial optimization problem. Thus, an Iterative Cooperative Co-evolutionary Genetic Algorithm (ICCGA) was proposed. The ICCGA can find reasonable quality of solutions. However, its computation time is noticeably slow. Aiming at improving the computation time, we propose an unsynchronized Parallel Cooperative Co-evolutionary Genetic Algorithm (PCCGA) in this paper. Experimental results have shown that the PCCGA not only has quicker computation time, but also generates better quality of solutions than the ICCGA
A Note on the Space Complexity of Fast D-Finite Function Evaluation

We state and analyze a generalization of the "truncation trick" suggested by
Gourdon and Sebah to improve the performance of power series evaluation by
binary splitting. It follows from our analysis that the values of D-finite
functions (i.e., functions described as solutions of linear differential
equations with polynomial coefficients) may be computed with error bounded by
2^(-p) in time O(p*(lg p)^(3+o(1))) and space O(p). The standard fast algorithm
for this task, due to Chudnovsky and Chudnovsky, achieves the same time
complexity bound but requires \Theta(p*lg p) bits of memory
Attacking RSA–CRT Signatures with Faults on Montgomery Multiplication

International audienceIn this paper, we present several efficient fault attacks against implementations of RSA–CRT signatures that use modular exponentia-tion algorithms based on Montgomery multiplication. They apply to any padding function, including randomized paddings, and as such are the first fault attacks effective against RSA–PSS. The new attacks work provided that a small register can be forced to either zero, or a constant value, or a value with zero high-order bits. We show that these models are quite realistic, as such faults can be achieved against many proposed hardware designs for RSA signatures
Unconventional Cosmology

I review two cosmological paradigms which are alternative to the current
inflationary scenario. The first alternative is the "matter bounce", a
non-singular bouncing cosmology with a matter-dominated phase of contraction.
The second is an "emergent" scenario, which can be implemented in the context
of "string gas cosmology". I will compare these scenarios with the inflationary
one and demonstrate that all three lead to an approximately scale-invariant
spectrum of cosmological perturbations.Comment: 45 pages, 10 figures; invited lectures at the 6th Aegean Summer
  School "Quantum Gravity and Quantum Cosmology", Chora, Naxos, Greece, Sept.
  12 - 17 2012, to be publ. in the proceedings; these lecture notes form an
  updated version of arXiv:1003.1745 and arXiv:1103.227
The CONEstrip algorithm

Uncertainty models such as sets of desirable gambles and (conditional) lower previsions can be represented as convex cones. Checking the consistency of and drawing inferences from such models requires solving feasibility and optimization problems. We consider finitely generated such models. For closed cones, we can use linear programming; for conditional lower prevision-based cones, there is an efficient algorithm using an iteration of linear programs. We present an efficient algorithm for general cones that also uses an iteration of linear programs
Towards Multi-Level Adaptation for Distributed Operating Systems and Applications

International audienceDistributed operating systems simplify building and executing applications on large-scale infrastructures, such as clusters, grids and clouds. These systems operate in a constantly changing environment characterized by varying application needs and varying physical infrastructure capabilities. To handle the diversity and dynamism of both the applications and the underlying infrastructures, the distributed Operating System (OS) should continually adapt to its changing environment. Two challenges arise in this context: how to design the distributed OS in order to facilitate dynamic adaptation, and how to ensure that OS-level adaptation does not conflict with application-level adaptation. This paper proposes to address these challenges by: (1) building the distributed OS as an assembly of adaptable services following the service-oriented architecture; and (2) using a common multi-level adaptation framework to adapt both the OS and the application layers in a coordinated way. Moreover, the paper presents experimental evidence of the usefulness of this approach in adapting the distributed shared memory service of a specific distributed OS
The impact of global communication latency at extreme scales on Krylov methods

Krylov Subspace Methods (KSMs) are popular numerical tools for solving large linear systems of equations. We consider their role in solving sparse systems on future massively parallel distributed memory machines, by estimating future performance of their constituent operations. To this end we construct a model that is simple, but which takes topology and network acceleration into account as they are important considerations. We show that, as the number of nodes of a parallel machine increases to very large numbers, the increasing latency cost of reductions may well become a problematic bottleneck for traditional formulations of these methods. Finally, we discuss how pipelined KSMs can be used to tackle the potential problem, and appropriate pipeline depths
Span programs and quantum algorithms for st-connectivity and claw
  detection

We introduce a span program that decides st-connectivity, and generalize the
span program to develop quantum algorithms for several graph problems. First,
we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries
to the n x n adjacency matrix to decide if vertices s and t are connected,
under the promise that they either are connected by a path of length at most d,
or are disconnected. We also show that if T is a path, a star with two
subdivided legs, or a subdivision of a claw, its presence as a subgraph in the
input graph G can be detected with O(n) quantum queries to the adjacency
matrix. Under the promise that G either contains T as a subgraph or does not
contain T as a minor, we give O(n)-query quantum algorithms for detecting T
either a triangle or a subdivision of a star. All these algorithms can be
implemented time efficiently and, except for the triangle-detection algorithm,
in logarithmic space. One of the main techniques is to modify the
st-connectivity span program to drop along the way "breadcrumbs," which must be
retrieved before the path from s is allowed to enter t.Comment: 18 pages, 4 figure
Optimal lower bound for differentially private multi-party aggregation

LNCS v. 7501 entitled: Algorithms - ESA 2012 : 20th annual European symposium ...  proceedingsWe consider distributed private data analysis, where n parties each holding some sensitive data wish to compute some aggregate statistics over all parties' data. We prove a tight lower bound for the private distributed summation problem. Our lower bound is strictly stronger than the prior lower-bound result by Beimel, Nissim, and Omri published in CRYPTO 2008. In particular, we show that any n-party protocol computing the sum with sparse communication graph must incur an additive error of Ω(√n) with constant probability, in order to defend against potential coalitions of compromised users. Furthermore, we show that in the client-server communication model, where all users communicate solely with an untrusted server, the additive error must be Ω(√n), regardless of the number of messages or rounds. Both of our lower-bounds, for the general setting and the client-to-server communication model, are strictly stronger than those of Beimel, Nissim and Omri, since we remove the assumption on the number of rounds (and also the number of messages in the client-to-server communication model). Our lower bounds generalize to the (ε, δ) differential privacy notion, for reasonably small values of δ. © 2012 Springer-Verlag.postprin
Improved Implementation of Point Location in General Two-Dimensional
  Subdivisions

We present a major revamp of the point-location data structure for general
two-dimensional subdivisions via randomized incremental construction,
implemented in CGAL, the Computational Geometry Algorithms Library. We can now
guarantee that the constructed directed acyclic graph G is of linear size and
provides logarithmic query time. Via the construction of the Voronoi diagram
for a given point set S of size n, this also enables nearest-neighbor queries
in guaranteed O(log n) time. Another major innovation is the support of general
unbounded subdivisions as well as subdivisions of two-dimensional parametric
surfaces such as spheres, tori, cylinders. The implementation is exact,
complete, and general, i.e., it can also handle non-linear subdivisions. Like
the previous version, the data structure supports modifications of the
subdivision, such as insertions and deletions of edges, after the initial
preprocessing. A major challenge is to retain the expected O(n log n)
preprocessing time while providing the above (deterministic) space and
query-time guarantees. We describe an efficient preprocessing algorithm, which
explicitly verifies the length L of the longest query path in O(n log n) time.
However, instead of using L, our implementation is based on the depth D of G.
Although we prove that the worst case ratio of D and L is Theta(n/log n), we
conjecture, based on our experimental results, that this solution achieves
expected O(n log n) preprocessing time.Comment: 21 page
Average Case Analysis of Java 7's Dual Pivot Quicksort

Recently, a new Quicksort variant due to Yaroslavskiy was chosen as standard
sorting method for Oracle's Java 7 runtime library. The decision for the change
was based on empirical studies showing that on average, the new algorithm is
faster than the formerly used classic Quicksort. Surprisingly, the improvement
was achieved by using a dual pivot approach, an idea that was considered not
promising by several theoretical studies in the past. In this paper, we
identify the reason for this unexpected success. Moreover, we present the first
precise average case analysis of the new algorithm showing e.g. that a random
permutation of length $n$ is sorted using $1.9n\ln n-2.46n+\mathcal{O}(\ln n)$
key comparisons and $0.6n\ln n+0.08n+\mathcal{O}(\ln n)$ swaps.Comment: Best paper award at ESA 2012, recorded talk:
  http://www.slideshare.net/sebawild/average-case-analysis-of-java-7s-dual-pivot-quicksor
Natural and Artificial Systems: Compare, Model or Engineer?

Some areas of biological research use artificial means to explore the natural world. But how the natural and artificial are related across wide-ranging research areas is not always clear. Relations differ further for bioengineering fields. We propose a taxonomy which would serve to elucidate distinct relations; there are three ways in which the natural is linked to the artificial, corresponding with distinct methods of investigation: i) a comparative approach (natural vs artificial) in which artificial systems are treated in the same way as natural systems, ii) a modeling approach (natural via artificial) in which we use artificial systems to learn about features of natural ones, and iii) an engineering approach (natural pro artificial) in which natural systems are used to draw inspiration for artefacts. Ambiguities about and between these approaches limit the development of fields and impact negatively on interdisciplinary communication
Towards a neural hierarchy of time scales for motor control

Animals show remarkable rich motion skills which are still far from realizable with robots. Inspired by the neural circuits which generate rhythmic motion patterns in the spinal cord of all vertebrates, one main research direction points towards the use of central pattern generators in robots. On of the key advantages of this, is that the dimensionality of the control problem is reduced. In this work we investigate this further by introducing a multi-timescale control hierarchy with at its core a hierarchy of recurrent neural networks. By means of some robot experiments, we demonstrate that this hierarchy can embed any rhythmic motor signal by imitation learning. Furthermore, the proposed hierarchy allows the tracking of several high level motion properties (e.g.: amplitude and offset), which are usually observed at a slower rate than the generated motion. Although these experiments are preliminary, the results are promising and have the potential to open the door for rich motor skills and advanced control
Plastic Representation of the Reachable Space for a Humanoid Robot

Reaching a target object requires accurate estimation of the object spatial position and its further transformation into a suitable arm-motor command. In this paper, we propose a framework that provides a robot with a capacity to represent its reachable space in an adaptive way. The location of the target is represented implicitly by both the gaze direction and the angles of arm joints. Two paired neural networks are used to compute the direct and inverse transformations between the arm position and the head position. These networks allow reaching the target either through a ballistic movement or through visually-guided actions. Thanks to the latter skill, the robot can adapt its sensorimotor transformations so as to reflect changes in its body configuration. The proposed framework was implemented on the NAO humanoid robot, and our experimental results provide evidences for its adaptative capabilities
Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses  predictions

WABI 2012 will be part of ALGO 2012, hosted by the University of Lubljana.International audienceWe propose a reconciliation heuristic accounting for gene duplications, losses and horizontal transfers that specifically takes into account the uncertainties in the gene tree. Rearrangements are tried for gene tree edges that are weakly supported, and are accepted whenever they improve the reconciliation cost. We prove useful properties on the dynamic programming matrix used to compute reconciliations, which allows to speed-up the tree space exploration when rearrangements are generated by Nearest Neighbor Interchanges (NNI) edit operations. Experimental results on simulated and real data confirm that running times are greatly reduced when considering the above-mentioned optimization in comparison to the naïve rearrangement procedure. Results also show that gene trees modified by such NNI rearrangements are closer to the correct (simulated) trees and lead to more correct event predictions on average. The program is available at http://www.atgc-montpellier.fr/ Mowgli
Space-efficient and exact de Bruijn graph representation based on a Bloom filter

International audienceThe de Bruijn graph data structure is widely used in next-generation sequencing (NGS). Many programs, e.g. de novo assemblers, rely on in-memory representation of this graph. However, current techniques for representing the de Bruijn graph of a human genome require a large amount of memory (> 30 GB). We propose a new encoding of the de Bruijn graph, which occupies an order of magnitude less space than current representations. The encoding is based on a Bloom filter, with an additional structure to remove critical false positives. An assembly software implementing this structure, Minia, performed a complete de novo assembly of human genome short reads using 5.7 Gb of memory in 23 hours
Tandem Halving Problems by DCJ

International audienceWe address the problem of reconstructing a non-duplicated ancestor to a partially duplicated genome in a model where duplicated content is caused by several tandem duplications throughout its evolution and the only allowed rearrangement operations are DCJ. As a starting point, we consider a variant of the Genome Halving Problem, aiming at reconstructing a tandem duplicated genome instead of the traditional perfectly duplicated genome. We provide a distance in O(n) time and a scenario in O(n2) time. In an attempt to enhance our model, we consider several problems related to multiple tandem reconstruction. Unfortunately we show that although the problem of reconstructing a single tandem can be solved polynomially, it is already NP-hard for 2 tandems
Loop Leaping with Closures

Loop leaping is the colloquial name given to a form of program analysis in which summaries are derived for nested loops starting from the innermost loop and proceeding in a bottom-up fashion considering one more loop at a time. Loop leaping contrasts with classical approaches to finding loop invariants that are iterative; loop leaping is compositional requiring each stratum in the nest of loops to be considered exactly once. The approach is attractive in predicate abstraction where disjunctive domains are increasingly used that present long ascending chains. This paper proposes a simple and an efficient approach for loop leaping for these domains based on viewing loops as closure operators
Curvature calculations for the level-set method

The present work illustrates a difficulty with the level-set method to
accurately capture the curvature of interfaces in regions that are of equal
distance to two or more interfaces. Such regions are characterized by kinks in
the level-set function where the derivative is discontinuous. Thus the standard
discretization scheme is not suitable. Three discretization schemes are
outlined that are shown to perform better than the standard discretization on
two selected test cases.Comment: 9 pages, 6 figures, conference pape