pinecone/core-2020-05-10-deduplication huggingface dataset:
Constructive Interval Disjunction

International audienceThis paper presents two new filtering operators for numerical CSPs (systems with constraints over the reals) based on constructive disjunction, as well as a new splitting heuristic. The fist operator (CID) is a generic algorithm enforcing constructive disjunction with intervals. The second one (3BCID) is a hybrid algorithm mixing constructive disjunction and shaving, another technique already used with numerical CSPs through the algorithm 3B. Finally, the splitting strategy learns from the CID filtering step the next variable to be split, with no overhead. Experiments have been conducted with 20 benchmarks. On several benchmarks, CID and 3BCID produce a gain in performance of orders of magnitude over a standard strategy. CID compares advantageously to the 3B operator while being simpler to implement. Experiments suggest to fix the CID-related parameter in 3BCID, offering thus to the user a promising variant of 3B
Exploiting single-cycle symmetries in branch-and-prune algorithms

Presentado a la 13th International Conference on Principles celebrada en Providence (USA) del 23 al 27 de septiembre de 2007.As a ﬁrst attempt to exploit symmetries in continuous con- straint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cube at the same point in all dimensions at the same time. We quantify these classes as a function of n. Moreover, we propose a simple algorithm to generate the representatives of all these classes for any number of variables at very high rates. A problem example from the chemical ﬁeld and a kinematics solver are used to show the performance of the approach in practice.This work was supported by projects: 'Planificador de trayectorias para sistemas robotizados de arquitectura arbitraria' (J-00930), 'Reconstrucció i anàlisi del moviment de grans estructures robòtiques i bioquímiques.' (J-05265).This work has been partially supported by the Spanish Ministry of Education and Science through the contract DPI2004-07358 and by the “Comunitat de Treball dels Pirineus” under contract 2006ITT-10004.Peer Reviewe
Experiment databases: Towards an improved experimental methodology in machine learning

Machine learning research often has a large experimental
component. While the experimental methodology employed in machine learning has improved much over the years, repeatability of experiments and generalizability of results remain a concern. In this paper we propose a methodology based on the use of experiment databases. Experiment
databases facilitate large-scale experimentation, guarantee repeatability of experiments, improve reusability of experiments, help explicitating the conditions under which certain results are valid, and support quick hypothesis
testing as well as hypothesis generation. We show that they have the potential to significantly increase the ease with which new results in machine learning can be obtained and correctly interpreted.status: publishe
Applying logic forms and statistical methods to CL-SR performance

This paper describes a CL-SR system that employs two different techniques: the first one is based on NLP rules that consist on applying logic forms to the topic processing while the second one basically consists on applying the IR-n statistical search engine to the spoken document collection. The application of logic forms to the topics allows to increase the weight of topic terms according to a set of syntactic rules. Thus, the weights of the topic terms are used by IR-n system in the information retrieval process.This work has been partially supported by the Spanish Government (CICYT) with grant TIC2003-07158-C04-01
A simple method of multiple camera calibration for the joint top view projection

Presentado al CORES-2007 celebrado en Wroclaw (Poland).A simple method for multiple camera calibration based on a novel geometric derivation is presented. The main advantage of this method is that it uses only three points in the world coordinate system to achieve the calibration. Rotation matrix and translation vector for each camera coordinate system are obtained via the given distance between the vertices of the marker triangle formed by the three points. Therefore, the different views from the different cameras can be converted into one top view in the world coordinate system. Eventually, the different trajectories traced by certain tracked agents on the floor plane can be obtained from different viewpoints and can be matched in a joint scene plane.This work was supported by the project 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929).This work is supported by EC grants IST-027110 for the HERMES project and IST-045547 for the VIDI\ud
-video project, and by the Spanish MEC under\ud
projects TIN2006-14606 and DPI-2004-5414. M. Mozerov and Jordi Gonzàlez also acknowledge the support of a Ramon y Cajal and Juan de la Cierva\ud
Postdoctoral fellowships from the Spanish MEC, respectively.Peer Reviewe
Trajectory fusion for multiple camera tracking

Presentado al CORES-2007 celebrado en Wroclaw (Poland).In this paper we present a robust and efficient method to overcome the negative effects of occlusion in the tracking process of multiple agents. The proposed approach is based on the matching of multiple trajectories from multiple views using spatial and temporal information. These trajectories are represented as consecutive points of a joint ground plane in the world coordinate system that belong to the same tracked agent. We introduce an integral distance between compared trajectories, which allows us to avoid mismatches, due to the possible measurement outliers in one frame. The proposed method can also be considered as an interpolation algorithm of a disconnected trajectory during the time of occlusion. This technique solves one of the most difficult problems of occlusion handling, which is a matching of two unconnected parts of the same trajectory.This work was supported by the project 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929).This work is supported by EC grants IST-027110 for the HERMES project and IST-045547 for the VIDI\ud
-video project, and by the Spanish MEC under projects TIN2006-14606 and DPI-2004-5414. Jordi Gonzàlez also acknowledges the support of a Juan de la Cierva Postdoctoral fellowship from the\ud
Spanish MEC.Peer Reviewe
Enhancing real-time human detection based on histograms of oriented gradients

Presentado al CORES-2007 celebrado en Wroclaw (Poland).In this paper we propose a human detection framework based on an enhanced version of Histogram of Oriented Gradients (HOG) features. These feature descriptors are computed with the help of a precalculated histogram of square-blocks. This novel method outperforms the integral of oriented histograms allowing the calculation of a single feature four times faster. Using Adaboost for HOG feature selection and Support Vector Machine as weak classifier, we build up a real-time human classifier with an excellent detection rate.This work was supported by the project 'Integration of robust perception, learning, and navigation systems in mobile robotics' (J-0929).This work is supported by EC grants IST-027110 for the HERMES project and IST-045547 for the VIDI\ud
-video project, and by the Spanish MEC under projects TIN2006-14606 and DPI-2004-5414. Jordi Gonzàlez also acknowledges the support of a Juan de la Cierva Postdoctoral fellowship from the\ud
Spanish MEC.Peer Reviewe
Modeling control objectives for business process compliance

Business process design is primarily driven by process improvement objectives. However, the role of control objectives stemming from regulations and standards is becoming increasingly important for businesses in light of recent events that led to some of the largest scandals in corporate history. As organizations strive to meet compliance agendas, there is an evident need to provide systematic approaches that assist in the understanding of the interplay between (often conflicting) business and control objectives during business process design. In this paper, our objective is twofold. We will firstly present a research agenda in the space of business process compliance, identifying major technical and organizational challenges. We then tackle a part of the overall problem space, which deals with the effective modeling of control objectives and subsequently their propagation onto business process models. Control objective modeling is proposed through a specialized modal logic based on normative systems theory, and the visualization of control objectives on business process models is achieved procedurally. The proposed approach is demonstrated in the context of a purchase-to-pay scenario
Numerical approximation of a steady MHD problem

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-75199-1_37We consider a magnetohydrodynamic (MHD) problem which models\ud
the steady flow of a conductive incompressible fluid confined in a bounded region and subject to the Lorentz force exerted by the interaction of electric currents and magnetic fields. We present an iterative method inspired to operator splitting to solve this nonlinear coupled problem, and a discretization based on conforming finite elements
Semantics Preservation in Model-based Composition

Separation of concerns is an important factor in the development of complex software systems. Being able to reason about system concerns in isolation and compose them to a whole are key elements for succeeding with the specification and implementation of such systems. In software product line engineering, management of features is an essential activity in the product development process. Features represent concerns, or parts of concerns, which are composed into products. 
The mechanisms supporting separation of concerns become increasingly more sophisticated, e.g. through aspect-oriented tools and techniques featuring flexible composition of crosscutting concerns in programming and modelling. 
Composition of concerns do not come without challenges; in current aspect-oriented composition languages, the syntactic nature of pointcut expressions leads to vulnerable relationships between aspects and base systems. When multiple concerns are involved, in the form of an aspect-oriented design, a product line feature design, or other, these may be in conflict with each other. In many cases, the state-of-the-art composition technologies leave little control for constraining the effects imposed on a system by compositions. 
This thesis defines theoretical and practical solutions for detecting and solving conflicting or problematic situations when composing software systems. First, it gives a definition for semantics preservation for sequence diagram aspect composition, which is a tool that helps ensuring consistent application of scenario – or trace-based – aspects even if the base model changes. Second, it defines mechanisms for composing and analysing product line features, which help toward ensuring consistency of feature composition by addressing confluence and conflict situations. Third, it defines a technique for defining and associating composition contracts with models. It allows constraining the model composition by pre- and post-conditions, which gives increased control over changes that can be imposed by model composition, e.g. by aspects. These aspects all contribute toward the overall goal of the thesis – semantics preservation of systems during model composition
Forensic debugging of model transformations

Software bugs occur in model-driven development, just as\ud
they do with traditional development techniques. We explore the types\ud
of bugs that occur in model transformations and identify debugging ap-\ud
proaches that can be applied or adapted to a model-driven context. In-\ud
vestigation shows that the detailed source-to-target traceability avail-\ud
able with model transformations enables effective post-hoc, or forensic,\ud
debugging. Forensic debugging techniques are introduced for automated\ud
bug localisation in model transformations. The methods discussed are\ud
grounded with examples using the Eclipse Modeling Framework (EMF)\ud
and Tefkat, a declarative model transformation engine
Performance measuring framework for grid market middleware

Current implementations of Grid infrastructures provide frameworks which aim at achieve on-demand computing. In such a scenario, contribution and use of resources will be governed by business models. The challenge is to provide multi-level performance information which enables the participation of the different actors in such a system. In this paper we describe the performance measuring framework developed for Grid Market Middleware, a middleware which supports economic-model based selection of service-oriented Grid applications. This middleware is a distributed infrastructure, which we have implemented for providing a market of services and resources to be assigned to Grid applications. The objectives of the performance measuring framework is first to assess the behaviour of the middleware and the used economic models in a deployed system, and secondly allow the provision of metrics for the components of the middleware itself. We describe the design of the performance measuring framework, its implementation and show its capability and usefulness for our objectives by experiments.Peer Reviewe
Testing finite state machines presenting stochastic time and timeouts

In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [10]. In fact, the current paper together with [10] constitute a complete formal theory to specify and test the class of systems covered by the before mentioned stochastic finite state machines
Scalar Decay in Chaotic Mixing

I review the local theory of mixing, which focuses on infinitesimal blobs of
scalar being advected and stretched by a random velocity field. An advantage of
this theory is that it provides elegant analytical results. A disadvantage is
that it is highly idealised. Nevertheless, it provides insight into the
mechanism of chaotic mixing and the effect of random fluctuations on the rate
of decay of the concentration field of a passive scalar.Comment: 35 pages, 15 figures. Springer-Verlag conference style svmult.cls
  (included). Published in "Transport in Geophysical Flows: Ten Years After,"
  Proceedings of the Grand Combin Summer School, 14-24 June 2004, Valle
  d'Aosta, Italy. Fixed some typo
Editors’ Introduction

Learning theory is an active research area that incorporates ideas,
                  problems, and techniques from a wide range of disciplines including
                  statistics, artificial intelligence, information theory, pattern
                  recognition, and theoretical computer science. The research reported
                  at the 18th International Conference on Algorithmic Learning Theory
                  (ALT 2007) ranges over areas such as unsupervised learning,
                  inductive inference, complexity and learning, boosting and
                  reinforcement learning, query learning models, grammatical
                  inference, online learning and defensive forecasting, and kernel
                  methods. In this introduction we give an overview of the five
                  invited talks and the regular contributions of ALT 2007
Cautious Conjunctive Merging of Belief Functions

International audienceWhen merging belief functions, Dempster rule of combination is justified only when information sources can be considered as independent. When this is not the case, one must find out a cautious merging rule that adds a minimal amount of information to the inputs. Such a rule is said to follow the principle of minimal commitment. Some conditions it should comply with are studied. A cautious merging rule based on maximizing expected cardinality of the resulting belief function is proposed. It recovers the minimum operation when specialized to possibility distributions. This form of the minimal commitment principle is discussed, in particular its discriminating power and its justification when some conflict is present between the belief functions
Interest point detectors for visual SLAM

In this paper we present several interest points detectors and we analyze their suitability when used as landmark extractors for vision-based simultaneous localization and mapping (vSLAM). For this purpose, we evaluate the detectors according to their repeatability under changes in viewpoint and scale. These are the desired requirements for visual landmarks. Several experiments were carried out using sequence of images captured with high precision. The sequences represent planar objects as well as 3D scenes
Fitness function comparison for GA-based feature construction

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-75271-4_26Selected Papers of the 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007When primitive data representation yields attribute interactions, learning requires feature construction. MFE2/GA, a GA-based feature construction has been shown to learn more accurately than others when there exist several complex attribute interactions. A new fitness function, based on the principle of Minimum Description Length (MDL), is proposed and implemented as part of the MFE3/GA system. Since the individuals of the GA population are collections of new features constructed to change the representation of data, an MDL-based fitness considers not only the part of data left unexplained by the constructed features (errors), but also the complexity of the constructed features as a new representation (theory). An empirical study shows the advantage of the new fitness over other fitness not based on MDL, and both are compared to the performance baselines provided by relevant systems.Work has been partially supported by the Spanish Ministry of Science and Technology, under Grant number TSI2005-08225-C07-0
Model based Statistics for Protein Sequence Families

The papers of this thesis are not available in Munin: <br/>1. Said H. Ahmed and Tor Flå: 'Estimation of Evolutionary Average Hydrophobicity Profile from a Family of Protein Sequences', Lecture Notes in Computer Science (2007) Volume 4774/2007, 158-165. Available at <a href=http://dx.doi.org/10.1007/978-3-540-75286-8_16>http://dx.doi.org/10.1007/978-3-540-75286-8_16</a> <br/>2. Said H. Ahmed and Tor Flå: 'Evolutionary Parameters in Sequence Families : Cold adaptation of enzymes', Lecture Notes in Computer Science (2009) Volume 5780/2009, 1-12. Available at <a href=http://dx.doi.org/10.1007/978-3-642-04031-3_1>http://dx.doi.org/10.1007/978-3-642-04031-3_1</a> <br/>3. Tor Flå and Said H. Ahmed: 'Evolution of cold-adapted protein sequences', in Sequence and Genome analytics : methods and application II (ed. Gabriel Fung), Concept Press Ltd (2010), ISBN 9780-9807330-6-8<br/>4. Said H. Ahmed and Tor Flå: 'Position dependent mean hydrophobicity and structural profiles' (unpublished paper
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations

Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of bisimulation is the classical one, while for simulations we use that proposed by Hughes and Jacobs. As for properties, we start by using a generalization of linear temporal logic to arbitrary coalgebras suggested by Jacobs, and then an extension by Kurtz which includes atomic propositions too
COWS: A Timed Service-Oriented Calculus

COWS (Calculus for Orchestration of Web Services) is a foundational language for Service Oriented Computing that combines in an original way a number of ingredients borrowed from well-known process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while resulting different from any of them. In this paper, we extend COWS with timed orchestration constructs, this way we obtain a language capable of completely formalizing the semantics of WS-BPEL, the ‘de facto’ standard language for orchestration of web services. We present the semantics of the extended language and illustrate its peculiarities and expressiveness by means of several examples
Anonymity Protocols as Noisy Channels

International audienceWe consider a framework in which anonymity protocols are interpreted as noisy channels in the information-theoretic sense, and we explore the idea of using the notion of capacity as a measure of the loss of anonymity. Such idea was already suggested by Moskowitz, Newman and Syverson, in their analysis of the covert channel that can be created as a result of non-perfect anonymity. We consider the case in which some leak of information is intended by design, and we introduce the notion of conditional capacity to rule out this factor, thus retrieving a natural correspondence with the notion of anonymity. Furthermore, we show how to compute the capacity and the conditional capacity when the anonymity protocol satisfies certain symmetries. We also investigate how the adversary can test the system to try to infer the user's identity, and we study how his probability of success depends on the characteristics of the channel. We then illustrate how various notions of anonymity can be expressed in this framework, and show the relation with some definitions of probabilistic anonymity in literature. Finally, we show how to compute the matrix of the channel (and hence the capacity and conditional capacity) using model checking
Using a mobile robot to test a theory of cognitive mapping

This paper describes using a mobile robot, equipped with some sonar sensors and an odometer, to test navigation through the use of a cognitive map. The robot explores an office environment, computes a cognitive map, which is a network of ASRs [36, 35], and attempts to find its way home. Ten trials were conducted and the robot found its way home each time. From four random positions in two trials, the robot estimated the home position relative to its current position reasonably accurately. Our robot does not solve the simultaneous localization and mapping problem and the map computed is fuzzy and inaccurate with much of the details missing. In each homeward journey, it computes a new cognitive map of the same part of the environment, as seen from the perspective of the homeward journey. We show how the robot uses distance information from both maps to find its way home. © 2007 Springer-Verlag Berlin Heidelberg