pinecone/core-2020-05-10-deduplication huggingface dataset:
Appearance-Based Tracking and Face Identification in Video Sequences.

We present a technique for face recognition in videos. We are able to recognise a face in a video sequence, given a single gallery image. By assuming that the face is in an approximately frontal position, we jointly model changes in facial appearance caused by identity and illumination. The identity of a face is described by a vector of appearance parameters. We use an angular distance to measure the similarity of faces and a probabilistic procedure to accumulate evidence for recognition along the sequence. We achieve 93.8% recognition success in a set of 65 sequences of 6 subjects from the La Cascia and Sclaroff database
Programming Languages for Scientific Computing

Scientific computation is a discipline that combines numerical analysis,
physical understanding, algorithm development, and structured programming.
Several yottacycles per year on the world's largest computers are spent
simulating problems as diverse as weather prediction, the properties of
material composites, the behavior of biomolecules in solution, and the quantum
nature of chemical compounds. This article is intended to review specfic
languages features and their use in computational science. We will review the
strengths and weaknesses of different programming styles, with examples taken
from widely used scientific codes.Comment: 21 page
Eye Tracking Impact on Quality-of-Life of ALS Patients

Chronic neurological disorders in their advanced phase are characterized by a progressive loss of mobility (use of upper and lower limbs), speech and social life. Some of these pathologies, such as amyotrophic lateral sclerosis and multiple sclerosis, are paradigmatic of these deficits. High technology communication instruments, such as eye tracking, can be an extremely important possibility to reintroduce these patients in their family and social life, in particular when they suffer severe disability. This paper reports and describes the results of an ongoing experimentation about Eye Tracking impact on the quality of life of amyotrophic lateral sclerosis patients. The aim of the experimentation is to evaluate if and when eye tracking technologies have a positive impact on patients' live
Preliminary analysis of the cell BE processor limitations for sequence alignment applications

The fast growth of bioinformatics field has attracted the attention of computer scientists in the last few years. At the same time the increasing database sizes require greater efforts to improve the computational performance. From a computer architecture point of view, we intend to investigate how bioinformatics applications can benefit from future multi-core processors. In this paper we present a preliminary study of the Cell BE processor limitations when executing two representative sequence alignment applications (Ssearch and ClustalW). The inherent large parallelism of the targeted algorithms makes them ideal for architectures supporting multiple dimensions of parallelism (TLP and DLP). However, in the case of Cell BE we identified several architectural limitations that need a careful study and quantification.Peer ReviewedPostprint (published version
Resources for situated actions

In recent years, advances in software tools have made it easier to analyze interactive system specifications, and the range of their possible behaviors. However, the effort involved in producing the specifications of the system is still substantial, and a difficulty exists regarding the specification of plausible behaviors on the part of the user. Recent trends in technology towards more mobile and distributed systems further exacerbates the issue, as contextual factors come in to play, and less structured, more opportunistic behavior on the part of the user makes purely task-based analysis difficult. In this paper we consider a resourced action approach to specification and analysis. In pursuing this approach we have two aims - firstly, to facilitate a resource-based analysis of user activity, allowing resources to be distributed across a number of artifacts, and secondly to consider within the analysis a wider range of plausible and opportunistic user behaviors without a heavy specification overhead, or requiring commitment to detailed user models.We acknowledge with thanks EPSRC grant EP/F01404X/1 and FCT/FEDER grant POSC/EIA/56646/2004. Michael Harrison is grateful to colleagues in the ReSIST NoE (www.resit-noe.org)
Competitive Weighted Matching in Transversal Matroids

The article of record as published may be located at 10.1007/978-3-540-70575-8_33Consider a bipartite graph with a set of left-vertices and a set of right-vertices. All the edges adjacent to the same left-vertex have the same weight. We present an algorithm that, given the set of right-vertices and the number of left-vertices, processes a uniformly random permutation of the left-vertices, one left-vertex at a time. In processing a particular left-vertex, the algorithm either permanently matches the left-vertex to a thus-far unmatched right-vertex, or decides never to match the left-vertex. The weight of the matching returned by our algorithm is within a constant factor of that of a maximum weight matching, generalizing the recent results of Babaioff et al
Finding Optimal Flows Efficiently

Among the models of quantum computation, the One-way Quantum Computer is one
of the most promising proposals of physical realization, and opens new
perspectives for parallelization by taking advantage of quantum entanglement.
Since a one-way quantum computation is based on quantum measurement, which is a
fundamentally nondeterministic evolution, a sufficient condition of global
determinism has been introduced as the existence of a causal flow in a graph
that underlies the computation. A O(n^3)-algorithm has been introduced for
finding such a causal flow when the numbers of output and input vertices in the
graph are equal, otherwise no polynomial time algorithm was known for deciding
whether a graph has a causal flow or not. Our main contribution is to introduce
a O(n^2)-algorithm for finding a causal flow, if any, whatever the numbers of
input and output vertices are. This answers the open question stated by Danos
and Kashefi and by de Beaudrap. Moreover, we prove that our algorithm produces
an optimal flow (flow of minimal depth.)
  Whereas the existence of a causal flow is a sufficient condition for
determinism, it is not a necessary condition. A weaker version of the causal
flow, called gflow (generalized flow) has been introduced and has been proved
to be a necessary and sufficient condition for a family of deterministic
computations. Moreover the depth of the quantum computation is upper bounded by
the depth of the gflow. However, the existence of a polynomial time algorithm
that finds a gflow has been stated as an open question. In this paper we answer
this positively with a polynomial time algorithm that outputs an optimal gflow
of a given graph and thus finds an optimal correction strategy to the
nondeterministic evolution due to measurements.Comment: 10 pages, 3 figure
Optimal quantum adversary lower bounds for ordered search

The goal of the ordered search problem is to find a particular item in an
ordered list of n items. Using the adversary method, Hoyer, Neerbek, and Shi
proved a quantum lower bound for this problem of (1/pi) ln n + Theta(1). Here,
we find the exact value of the best possible quantum adversary lower bound for
a symmetrized version of ordered search (whose query complexity differs from
that of the original problem by at most 1). Thus we show that the best lower
bound for ordered search that can be proved by the adversary method is (1/pi)
ln n + O(1). Furthermore, we show that this remains true for the generalized
adversary method allowing negative weights.Comment: 13 pages, 2 figure
PSH: A private and shared history-based incentive mechanism

Fully decentralized peer-to-peer (P2P) systems do not have a central control mechanism. Thus, different forms of control mechanisms are required to deal with selfish peers. One type of selfish behavior is the consumption of resources without providing sufficient resources. Therefore, incentive schemes encourage peers to share resources while punishing selfish peers. A well-known example of an incentive scheme is Tit-for-Tat (TFT), as used in BitTorrent. With this scheme, a peer can only consume as much resources as it provides. TFT is resilient to collusion due to relying on private histories only. However, TFT can only be applied to peers with direct reciprocity.\ud
This paper presents a private and shared history (PSH) based incentive mechanism, which supports transitive relations (indirect reciprocity). Furthermore, it is resilient to collusion and it combines private and shared histories in an efficient manner. The PSH approach uses a shared history for identifying transitive relations. Those relations are verified using private histories. Simulations show that the PSH mechanism has a higher transaction success ratio than TFT
Finer is better: Abstraction Refinement for Rewriting Approximations

International audienceTerm rewriting systems are now commonly used as a modeling language for programs or systems. On those rewriting based models, reachability analysis, i.e. proving or disproving that a given term is reachable from a set of input terms, provides an efficient verification technique. For disproving reachability (i.e. proving non reachability of a term) on non terminating and non confluent rewriting models, Knuth-Bendix completion and other usual rewriting techniques do not apply. Using the tree automaton completion technique, it has been shown that the non reachability of a term t can be shown by computing an over-approximation of the set of reachable terms and prove that t is not in the over-approximation. However, when the term t is in the approximation, nothing can be said. In this paper, we improve this approach as follows: given a term t, we try to compute an over-approximation which does not contain t by using an approximation refinement that we propose. If the approximation refinement fails then t is a reachable term. This semi-algorithm has been prototyped in the Timbuk tool. We present some experiments with this prototype showing the interest of such an approach w.r.t. verification on rewriting models
Closure of Hedge-Automata Languages by Hedge Rewriting

International audienceWe consider rewriting systems for unranked ordered terms, i.e. trees where the number of successors of a node is not determined by its label, and is not a priori bounded. The rewriting systems are defined such that variables in the rewrite rules can be substituted by hedges (sequences of terms) instead of just terms. Consequently, this notion of rewriting subsumes both standard term rewriting and word rewriting. We investigate some preservation properties for two classes of languages of unranked ordered terms under this generalization of term rewriting. The considered classes include languages of hedge automata (HA) and some extension (called CF-HA) with context-free languages in transitions, instead of regular languages. In particular, we show that the set of unranked terms reachable from a given HA language, using a so called inverse context-free rewrite system, is a HA language. The proof, based on a HA completion procedure, reuses and combines known techniques with non-trivial adaptations. Moreover, we prove, with different techniques, that the closure of CF-HA languages with respect to restricted context-free rewrite systems, the symmetric case of the above rewrite systems, is a CF-HA language. As a consequence, the problems of ground reachability and regular hedge model checking are decidable in both cases. We give several counter examples showing that we cannot relax the restrictions
A unified framework for verification techniques for object invariants

Object invariants define the consistency of objects. They have subtle semantics, mainly because of call-backs, multi-object invariants, and subclassing. Several verification techniques for object invariants have been proposed. It is difficult to compare these techniques, and to ascertain their soundness, because of their differences in restrictions on programs and invariants, in the use of advanced type systems (e.g., ownership types), in the meaning of invariants, and in proof obligations. We develop a unified framework for such techniques. We distil seven parameters that characterise a verification technique, and identify sufficient conditions on these parameters which guarantee soundness. We instantiate our framework with three verification techniques from the literature, and use it to assess soundness and compare expressiveness.peer-reviewe
Griwes: Generic Model and Preliminary Specifications for a Graph-Based Knowledge Representation Toolkit

International audienceGriwes is an initiative to develop a common model and an open-source freeware platform shared by different graph-based frameworks. We provide an overview of its objectives, architecture and specifications. We detail some of the basic mathematical structures that are used to characterize the primitives for graph-based knowledge representation. We then propose to factorize recurrent knowledge representation primitives that can be shared across specific graph-based languages and we provide a proof of concept by showing how two languages (Simple Conceptual Graphs and RDF) can be described in this framework
Efficient seeding techniques for protein similarity search

International audienceWe apply the concept of subset seeds proposed in [1] to similarity search in protein sequences. The main question studied is the design of efficient seed alphabets to construct seeds with optimal sensitivity/selectivity trade-offs. We propose several different design methods and use them to construct several alphabets.We then perform an analysis of seeds built over those alphabet and compare them with the standard Blastp seeding method [2,3], as well as with the family of vector seeds proposed in [4]. While the formalism of subset seed is less expressive (but less costly to implement) than the accumulative principle used in Blastp and vector seeds, our seeds show a similar or even better performance than Blastp on Bernoulli models of proteins compatible with the common BLOSUM62 matrix
UV and EUV Instruments

We describe telescopes and instruments that were developed and used for
astronomical research in the ultraviolet (UV) and extreme ultraviolet (EUV)
regions of the electromagnetic spectrum. The wavelength ranges covered by these
bands are not uniquely defined. We use the following convention here: The EUV
and UV span the regions ~100-912 and 912-3000 Angstroem respectively. The
limitation between both ranges is a natural choice, because the hydrogen Lyman
absorption edge is located at 912 Angstroem. At smaller wavelengths,
astronomical sources are strongly absorbed by the interstellar medium. It also
marks a technical limit, because telescopes and instruments are of different
design. In the EUV range, the technology is strongly related to that utilized
in X-ray astronomy, while in the UV range the instruments in many cases have
their roots in optical astronomy. We will, therefore, describe the UV and EUV
instruments in appropriate conciseness and refer to the respective chapters of
this volume for more technical details.Comment: To appear in: Landolt-Boernstein, New Series VI/4A, Astronomy,
  Astrophysics, and Cosmology; Instruments and Methods, ed. J.E. Truemper,
  Springer-Verlag, Berlin, 201
Combining metaheuristics for the Job Shop Scheduling Problem with Sequence Dependent Setup Times

The Job Shop Scheduling (JSS) is a hard problem that has interested to researchers in various fields such as Operations Research and Artificial Intelligence during the last decades. Due to its high complexity, only small instances can be solved by exact methods, while instances with a size of practical interest should be solved by means of approximate methods guided by heuristic knowledge. In this paper we confront the Job Shop Scheduling with Sequence Dependent Setup Times (SDJSS). The SDJSS problem models many real situations better than the JSS. Our approach consists in extending a genetic algorithm and a local search method that demonstrated to be efficient in solving the JSS problem. We report results from an experimental study showing that the proposed approaches are more efficient than other genetic algorithm proposed in the literature, and that it is quite competitive with some of the state-of-the-art approache
Comparing topic maps constraint specification languages

Topic Map Constraint Language (TMCL) provides a means to express constraints on topic maps conforming to ISO/IEC 13250. In this article, we will use a test suite and show, step-by-step, the way we handled several kinds of Topic Maps constraints in many diﬀerent instances in order to answer questions like: Do they do the same job? Are there some kinds of Topic Maps constraints that are easier to specify with one of them? Do you need diﬀerent background to use the tools? Is it possible to use them in similar situations (the same topic maps instances)? May we use them to produce an equal result? How do AsTMa!, OSL, Toma, and XTche relate to Topic Maps Constraint Language (TMCL)? What kind of constraints each one of these three can not specify? We will conclude this paper with a summary of the comparisons accomplished between those Topic Maps constraint languages over the use case proposed
Galois Connections between Semimodules and Applications in Data Mining

In [1] a generalisation of Formal Concept Analysis was introduced
with data mining applications in mind, K-Formal Concept Analysis,
where incidences take values in certain kinds of semirings, instead
of the standard Boolean carrier set. A fundamental result was missing
there, namely the second half of the equivalent of the main theorem of
Formal Concept Analysis. In this continuation we introduce the structural
lattice of such generalised contexts, providing a limited equivalent
to the main theorem of K-Formal Concept Analysis which allows to interpret
the standard version as a privileged case in yet another direction.
We motivate our results by providing instances of their use to analyse
the confusion matrices of multiple-input multiple-output classifiers
Weak Fourier-Schur sampling, the hidden subgroup problem, and the
  quantum collision problem

Schur duality decomposes many copies of a quantum state into subspaces
labeled by partitions, a decomposition with applications throughout quantum
information theory. Here we consider applying Schur duality to the problem of
distinguishing coset states in the standard approach to the hidden subgroup
problem. We observe that simply measuring the partition (a procedure we call
weak Schur sampling) provides very little information about the hidden
subgroup. Furthermore, we show that under quite general assumptions, even a
combination of weak Fourier sampling and weak Schur sampling fails to identify
the hidden subgroup. We also prove tight bounds on how many coset states are
required to solve the hidden subgroup problem by weak Schur sampling, and we
relate this question to a quantum version of the collision problem.Comment: 21 page
Quantum Network Coding

Since quantum information is continuous, its handling is sometimes
surprisingly harder than the classical counterpart. A typical example is
cloning; making a copy of digital information is straightforward but it is not
possible exactly for quantum information. The question in this paper is whether
or not quantum network coding is possible. Its classical counterpart is another
good example to show that digital information flow can be done much more
efficiently than conventional (say, liquid) flow.
  Our answer to the question is similar to the case of cloning, namely, it is
shown that quantum network coding is possible if approximation is allowed, by
using a simple network model called Butterfly. In this network, there are two
flow paths, s_1 to t_1 and s_2 to t_2, which shares a single bottleneck channel
of capacity one. In the classical case, we can send two bits simultaneously,
one for each path, in spite of the bottleneck. Our results for quantum network
coding include: (i) We can send any quantum state |psi_1> from s_1 to t_1 and
|psi_2> from s_2 to t_2 simultaneously with a fidelity strictly greater than
1/2. (ii) If one of |psi_1> and |psi_2> is classical, then the fidelity can be
improved to 2/3. (iii) Similar improvement is also possible if |psi_1> and
|psi_2> are restricted to only a finite number of (previously known) states.
(iv) Several impossibility results including the general upper bound of the
fidelity are also given.Comment: 27pages, 11figures. The 12page version will appear in 24th
  International Symposium on Theoretical Aspects of Computer Science (STACS
  2007
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization

International audienceThis paper presents ParadisEO-MOEO, a white-box object-oriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradigm-free software embeds some features and techniques for Pareto-based resolution and aims to provide a set of classes allowing to ease and speed up the development of computationally efficient programs. It is based on a clear conceptual distinction between the solution methods and the multi-objective problems they are intended to solve. This separation confers a maximum design and code reuse. ParadisEO-MOEO provides a broad range of archive-related features (such as elitism or performance metrics) and the most common Pareto-based fitness assignment strategies (MOGA, NSGA, SPEA, IBEA and more). Furthermore, parallel and distributed models as well as hybridization mechanisms can be applied to an algorithm designed within ParadisEO-MOEO using the whole version of ParadisEO. In addition, GUIMOO, a platform-independant free software dedicated to results analysis for multi-objective problems, is briefly introduced
Combinatorial Optimization of Stochastic Multi-objective Problems: an Application to the Flow-shop Scheduling Problem

International audienceThe importance of multi-objective optimization is globably stablished nowadays. Furthermore, a great part of real-world problems are subject to uncertainties due to, e.g., noisy or approximated fitness function(s), varying parameters or dynamic environments. Moreover, although evolutionary algorithms are commonly used to solve multi-objective problems on the one hand and to solve stochastic problems on the other hand, very few approaches combine simultaneously these two aspects. Thus, flow-shop scheduling problems are generally studied in a single-objective deterministic way whereas they are, by nature, multi-objective and are subjected to a wide range of uncertainties. However, these two features have never been investigated at the same time. In this paper, we present and adopt a proactive stochastic approach where processing times are represented by random variables. Then, we propose several multi-objective methods that are able to handle any type of probability distribution. Finally, we experiment these methods on a stochastic bi-objective flow-shop problem