pinecone/core-2020-05-10-deduplication huggingface dataset:
TRECVID: benchmarking the effectiveness of information retrieval tasks on digital video

Many research groups worldwide are now investigating techniques which can support information retrieval on archives of digital video and as groups move on to implement these techniques they inevitably try to evaluate the performance of their techniques in practical situations. The difficulty with doing this is that there is no test collection or any environment in which the effectiveness of video IR or video IR sub-tasks, can be evaluated and compared. The annual series of TREC exercises has, for over a decade, been benchmarking the effectiveness of systems in carrying out various information retrieval tasks on text and audio and has contributed to a huge improvement in many of these. Two years ago, a track was introduced which covers shot boundary detection, feature extraction and searching through archives of digital video. In this paper we present a summary of the activities in the TREC Video track in 2002 where 17 teams from across the world took part
Directed Explicit Model Checking with HSF-SPIN

We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols.\u
Non-transformational termination analysis of logic programs, based on general term-orderings

Logic Based Program Synthesis and Transformation 10th International Workshop, Selected PapersWe present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general term-orderings, and show how they axe equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple term-orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together.status: publishe
Quality Analysis of Dependable Systems: A Developer Oriented Approach

The quality of dependable systems (DS) is characterized by a number of non-functional properties (e.g., performance, reliability, availability, etc.). Assessing the DS quality against these properties imposes the application of quality analysis and evaluation. Quality analysis consists of checking, analytically solving, or simulating models of the system, which are specified using formalisms like CSP, CCS, Markov-chains, Petri-nets, Queuing-nets, etc. However, developers are usually not keen on using such formalisms for modeling and evaluating DS quality. On the other hand, they are familiar with using architecture description languages and object-oriented notations for building DS models. Based on the previous and to render the use of traditional quality analysis techniques more tractable, this paper proposes an architecture-based environment that facilitates the specification and quality analysis of DS at the architectural level
Implementation and analysis of several keyframe-based browsing interfaces to digital video

In this paper we present a variety of browsing interfaces for digital video information. The six interfaces are implemented on top of Físchlár, an operational recording, indexing, browsing and playback system for broadcast TV programmes. In developing the six browsing interfaces, we have been informed by the various dimensions which can be used to distinguish one interface from another. For this we include layeredness (the number of “layers” of abstraction which can be used in browsing a programme), the provision or omission of temporal information (varying from full timestamp information to nothing at all on time) and visualisation of spatial vs. temporal aspects of the video. After introducing and defining these dimensions we then locate some common browsing interfaces from the literature in this 3-dimensional “space” and then we locate our own six interfaces in this same space. We then present an outline of the interfaces and include some user feedback
DEBORA: Developing an interface to support collaboration in digital library

Interfaces to library systems have largely failed to represent the in-herently collaborative nature of information work. This paper describes how collaborative functionality is being implemented as part of the DEBORA project to provide access to digitised Renaissance documents. Work practices of users of Renaissance documents are described and the collaborative features of the client software are outlined. Functionalities discussed include annotation, the creation of virtual books and the inclusion of user-supplied metadata
Volumetric Warping for Voxel Coloring on an Infinite Domain

Starting with a set of calibrated photographs taken of a scene, voxel coloring algorithms reconstruct three-dimensional surface models on a finite spatial domain. In this paper, we present a method that warps the voxel space, so that the domain of the reconstruction extends to an infinite or semi-infinite volume. Doing so enables the reconstruction of objects far away from the cameras, as well as reconstruction of a background environment. New views synthesized using the warped voxel space have improved photo-realism
Pseudo-Random Bit Generator Based on Couple Chaotic Systems and its Application in Stream-Ciphers Cryptography

Chaotic cryptology is widely investigated recently. This paper reviews the progress in this area and points out some existent problems in digital chaotic ciphers. As a comprehensive solution to these problems, a novel pseudo-random bit generator based on a couple of chaotic systems called CCS-PRBG is presented. Detailed theoretical analyses show that it has perfect cryptographic properties, and can be used to construct stream ciphers with higher security than other chaotic ciphers. Some experiments are made for confirmation. Finally, several examples of stream ciphers based on digital CCS-PRBG are given, and their security is discussed
VQQL. Applying vector quantization to reinforcement learning

Proceeding of: RoboCup-99: Robot Soccer World Cup III, July 27 to August 6, 1999, Stockholm, SwedenReinforcement learning has proven to be a set of successful techniques for finding optimal policies on uncertain and/or dynamic domains, such as the RoboCup. One of the problems on using such techniques appears with large state and action spaces, as it is the case of input information coming from the Robosoccer simulator. In this paper, we describe a new mechanism for solving the states generalization problem in reinforcement learning algorithms. This clustering mechanism is based on the vector quantization technique for signal analog-to-digital conversion and compression, and on the Generalized Lloyd Algorithm for the design of vector quantizers. Furthermore, we present the VQQL model, that integrates Q-Learning as reinforcement learning technique and vector quantization as state generalization technique. We show some results on applying this model to learning the interception task skill for Robosoccer agents.Publicad
An authoring tool for building adaptive learning guidance systems on the web

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-45336-9_31Proceedings of 6th International Computer Science Conference, AMT 2001 Hong Kong, China, December 18–20, 2001In the field of guided learning on the Internet we present, in this paper, an interactive tool for designing intelligent tutoring systems on the web. Our tool makes easier the creation of an ontology describing the content model for a given course. Such ontology contains information about classes and instances, reflecting the structure and components for the later creation of an adaptive course, using our web-based runtime course manager system. Our authoring tool generates XML code to improve course understanding as well as transportability and processing by our runtime system, which means that the generated code will reflect, in an easier way, the course structure and contents, being readable for most of users and course designers.The work reported in this paper is being partially supported by the Spanish Interdepartmental Commission of Science and Technology (CICYT), project number TEL1999-018
Bose-Einstein condensates in atomic gases: simple theoretical results

These notes present simple theoretical approaches to study Bose-Einstein
condensation in trapped atomic gases and their comparison to recent
experimental results : - the ideal Bose gas model - Fermi pseudopotential to
model the atomic interaction potential - finite temperature Hartree-Fock
approximation - Gross-Pitaevskii equation for the condensate wavefunction -
what we learn from a linearization of the Gross-Pitaevskii equation -
Bogoliubov approach and thermodynamical stability - phase coherence properties
of Bose-Einstein condensates - symmetry breaking description of condensatesComment: 146 pages, 17 figures, Lecture Notes of Les Houches Summer School
  199
Spinor condensates and light scattering from Bose-Einstein condensates

These notes discuss two aspects of the physics of atomic Bose-Einstein
condensates: optical properties and spinor condensates. The first topic
includes light scattering experiments which probe the excitations of a
condensate in both the free-particle and phonon regime. At higher light
intensity, a new form of superradiance and phase-coherent matter wave
amplification were observed. We also discuss properties of spinor condensates
and describe studies of ground--state spin domain structures and dynamical
studies which revealed metastable excited states and quantum tunneling.Comment: 58 pages, 33 figures, to appear in Proceedings of Les Houches 1999
  Summer School, Session LXXI
Environment-Induced Decoherence and the Transition From Quantum to
  Classical

We study dynamics of quantum open systems, paying special attention to those
aspects of their evolution which are relevant to the transition from quantum to
classical. We begin with a discussion of the conditional dynamics of simple
systems. The resulting models are straightforward but suffice to illustrate
basic physical ideas behind quantum measurements and decoherence. To discuss
decoherence and environment-induced superselection einselection in a more
general setting, we sketch perturbative as well as exact derivations of several
master equations valid for various systems. Using these equations we study
einselection employing the general strategy of the predictability sieve.
Assumptions that are usually made in the discussion of decoherence are
critically reexamined along with the ``standard lore'' to which they lead.
Restoration of quantum-classical correspondence in systems that are classically
chaotic is discussed. The dynamical second law -it is shown- can be traced to
the same phenomena that allow for the restoration of the correspondence
principle in decohering chaotic systems (where it is otherwise lost on a very
short time-scale). Quantum error correction is discussed as an example of an
anti-decoherence strategy. Implications of decoherence and einselection for the
interpretation of quantum theory are briefly pointed out.Comment: 80 pages, 7 figures included, Lectures given by both authors at the
  72nd Les Houches Summer School on "Coherent Matter Waves", July-August 199
Multi-relational data mining, using UML for ILP

Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic programming (ILP) has been limited. In our view this is mainly due to the variation in ILP engines, especially with respect to input specification, as well as the limited attention for relational database issues. In this paper we describe an approach which uses UML as the common specification language for a large range of ILP engines. Having such a common language will enable a wide range of users, including non-experts, to model problems and apply different engines without any extra effort. The process involves transformation of UML into a language called CDBL, that is then translated to a variety of input formats for different engines.status: publishe
A generic greedy algorithm, partially-ordered graphs and NP-completeness.

Let π be any fixed polynomial-time testable, non-trivial, hereditary property of graphs. Suppose that the vertices of a graph G are not necessarily linearly ordered but partially ordered, where we think of this partial order as a collection of (possibly exponentially many) linear orders in the natural way. We prove that the problem of deciding whether a lexicographically first maximal subgraph of G satisfying π, with respect to one of these linear orders, contains a specified vertex is NP-complete
A QoS-Driven ISP Selection Mechanism for IPv6 Multi-homed Sites

A global solution for the provision of QoS in IPng sites must include ISP selection based on per-application requirements. In this article we present a new site-local architecture for QoS-driven ISP selection in multi-homed domains, performed in a per application basis. This architecture proposes the novel use of existent network services, a new type of routing header, and the modification of address selection mechanisms to take into account QoS requirements. This proposal is an evolution of current technology, and therefore precludes the addition of new protocols, enabling fast deployment. The sitelocal scope of the proposed solution results in ISP transparency and thus in ISP independency.This research was supported by the LONG (Laboratories Over the Next Generation Networks) project IST-1999-20393.Publicad
Hyper-code revisited : unifying program source, executable and data

The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al proposed extending this to hyper-code, in which program source, executable code and data are all represented to the user in exactly the same form. Here we explore the concept of hyper-code in greater detail and present a set of abstract language-independent operations on which various concrete systems can be based. These operations (explode, implode, evaluate, root and edit) are provided by a single user interface tool that subsumes the functions of both an object browser and a program editor. We then describe a particular implementation using PJama (persistent Java) and examine the impact of several language features on the resulting system.Postprin
A Modal Logic for KLAIM

Klaim is an experimental programming language that supports a programming paradigm where both processes and data can be moved across different computing environments. The language relies on the use of explicit localities, and on allocation environments that associate logical localities to physical sites. This paper presents a temporal logic for specifying properties of Klaim programs. The logic is inspired by Hennessy-Milner Logic (HML) and the ν-calculus, but has novel features that permit dealing with state properties to describe the effect of actions over the different sites. The logic is equipped with a consistent and complete proof system that enables one to prove properties of mobile systems
Mobile Processes: A Commented Bibliography

We propose a short bibliographic survey of calculi for mobile
processes. Contrasting with other similar exercises, we consider two related,
but distinct, notions of mobile processes, namely labile processes,
which can exhibit dynamic changes in their interaction structure, as modelled
in the -calculus of Milner, Parrow and Walker for example, and
motile processes, which can exhibit motion, as modelled in the ambient
calculus of Cardelli and Gordon. A common characteristic of the algebraic
frameworks presented in this paper is the use of names as first class
values and the support for the dynamic generation of new, fresh names
The AGEB Algorithm for Solving the Heat Equation in Three Dimensions and Its Parallelization Using PVM

In this paper, a new algorithm in the class of the AGE\ud
method based on the Brian variant (AGEB) of the ADI is developed to solve the heat equation in 3 space dimensions. The method is it-erative, convergent, stable and second order accurate with respect to space and time. It is inherently explicit and is therefore well suited for\ud
parallel implementation on the PVM where data decomposition is run asynchronously and concurrently at every time level. Its performance is assessed in terms of speed-up, efficiency and effectiveness
Shot-noise in non-degenerate semiconductors with energy-dependent
  elastic scattering

We investigate current fluctuations in non-degenerate semiconductors, on
length scales intermediate between the elastic and inelastic mean free paths.
The shot-noise power P is suppressed below the Poisson value P_{\rm
Poisson}=2e\bar I (at mean current \bar I) by the Coulomb repulsion of the
carriers. We consider a power-law dependence of the elastic scattering time
\tau\propto\epsilon^{\alpha} on kinetic energy \epsilon and present an exact
solution of the non-linear kinetic equations in the regime of space-charge
limited conduction. The ratio P/P_{\rm Poisson} decreases from 0.38 to 0 in the
range -1/2 < \alpha < 1.Comment: 9 pages including 2 ps figures, requires lamuphys.sty, to appear in
  Proceedings of the XVI Sitges Conference (Lecture Notes in Physics, Springer
Learning a Tsume-Go heuristic with Tilde

In Go, an important factor that hinders search is the large branching factor, even in local problems. Human players are strong at recognizing frequently occurring shapes and vital points. This allows them to select the most promising moves and to prune the search tree. In this paper we argue that many of these shapes can be represented as relational concepts. We present an application of the relational learner TILDE in which we learn a heuristic that gives values to candidate-moves in tsume-go (life and death) problems. Such a heuristic can be used to limit the number of evaluated moves. Even if all moves are evaluated, alpha-beta search can be sped up considerably when the candidate-moves are approximately ordered from good to bad.We validate our approach with experiments and analysis.status: publishe
Transient analysis of dependability/performability models by regenerative randomization with Laplace transform inversion

In this paper we develop a variant of a previously proposed method (the regenerative randomization method) for the transient analysis of dependability performability models. The variant is obtained by developing a closed-form expression for the solution of the truncated transformed model obtained in regenerative randomization and using a Laplace transform inversion algorithm. Using models of moderate size of a 5-level RAID architecture we compare the new variant with the original randomization method, with randomization with steady-state detection for irreducible models, and with the standard randomization method for transient models (models with absorbing states).Postprint (published version
When size does matter - Termination analysis for typed logic programs

Proofs of termination typically proceed by mapping program states to a well founded domain and showing that successive states of the computation are mapped to elements decreasing in size. Automated termination analysers for logic programs achieve this by measuring and comparing the sizes of successive calls to recursive predicates. The size of the call is measured by a level mapping that in turn is based on a norm on the arguments of the call. A norm maps a term to a natural number. The choice of the norm is crucial for the ability to prove termination. For some programs a fairly complex norm is required. The automated selection of an appropriate norm is a missing link in this research domain and is addressed in this paper. Our proposal is to use the type of a predicate to generate a number of simple norms and to try them in turn for proving the termination of the predicate. Given a term of a certain type, we consider a norm for each of its subtypes, a norm that counts the number of subterms of the term that are of the considered subtype.status: publishe
On the invariants of the quotients of the Jacobian of a curve of genus 2

The original publication is available at www.springerlink.comInternational audienceLet C be a curve of genus 2 that admits a non-hyperelliptic involution. We show that there are at most 2 isomorphism classes of elliptic curves that are quotients of degree 2 of the Jacobian of C. Our proof is constructive, and we present explicit formulae, classified according to the involutions of C, that give the minimal polynomial of the j-invariant of these curves in terms of the moduli of C. The coefficients of these minimal polynomials are given as rational functions of the moduli
Communicating B Machines.

This paper describes a way of using the process algebra CSP to enable controlled interaction between B machines. This approach supports compositional verification: each of the controlled machines, and the combination of controller processes, can be analysed and verified separately in such a way as to guarantee correctness of the combined communicating system. Reasoning about controlled machines separately is possible due to the introduction of guards and assertions into description of the controller processes in order to capture assumptions about other controlled machines and provide guarantees to the rest of the system. The verification process can be completely supported by difierent tools. The use of separate controller processes facilitates the iterative development and analysis of complex control flows within the system. The approach is motivated and illustrated with a non-trivial running example
SPeeDI - a verification tool for polygonal hybrid systems

Hybrid systems combining discrete and continuous dynamics arise as mathematical models of various artificial and natural systems, and as an approximation to\ud
\ud
complex continuous systems. A very important problem in the analysis of the behavior of hybrid systems is reachability. It is well-known that for most non-trivial\ud
\ud
subclasses of hybrid systems this and all interesting verification problems are undecidable. Most of the proved decidability results rely on stringent hypothesis\ud
\ud
that lead to the existence of a finite and computable partition of the state space\ud
into classes of states which are equivalent with respect to reachability. This is\ud
the case for classes of rectangular automata [1] and hybrid automata with linear\ud
vector fields [2]. Most implemented computational procedures resort to (forward\ud
or backward) propagation of constraints, typically (unions of convex) polyhedra\ud
\ud
or ellipsoids [3, 4, 5]. In general, these techniques provide semi-decision procedures, that is, if the given final set of states is reachable, they will terminate,\ud
\ud
otherwise they may fail to. Maybe the major drawback of set-propagation, reachset approximation procedures is that they pay little attention to the geometric\ud
\ud
properties of the specific (class of) systems under analysis.peer-reviewe