pinecone/core-2020-05-10-deduplication huggingface dataset:
Data driven Xpath generation

The XPath query language offers a standard for information extraction from HTML documents. Therefore, the DOM tree represen- tation is typically used, which models the hierarchical structure of the document. One of the key aspects of HTML is the separation of data and the structure that is used to represent it. A consequence thereof is that data extraction algorithms usually fail to identify data if the structure of a document is changed. In this paper, it is investigated how a set of tab- ular oriented XPath queries can be adapted in such a way it deals with modifications in the DOM tree of an HTML document. The basic idea is hereby that if data has already been extracted in the past, it could be used to reconstruct XPath queries that retrieve the data from a different DOM tree. Experimental results show the accuracy of our method
Superpixel based retinal area detection in SLO images

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-11331-9_31Distinguishing true retinal area from artefacts in SLO images is a challenging task, which is the first important step towards computeraided disease diagnosis. In this paper, we have developed a new method based on superpixel feature analysis and classification approaches for determination of retinal area scanned by Scanning Laser Ophthalmoscope(SLO). Our prototype has achieved the accuracy of 90% on healthy as well as diseased retinal images. To the best of our knowledge, this is the first work on retinal area detection in SLO images
Overview of INEX 2014

INEX investigates focused retrieval from structured documents by providing large test collections of structured documents, uniform evaluation measures, and a forum for organizations to compare their results. This paper reports on the INEX 2014 evaluation campaign, which consisted of three tracks: The Interactive Social Book Search Track investigated user information seeking behavior when interacting with various sources of information, for realistic task scenarios, and how the user interface impacts search and the search experience. The Social Book Search Track investigated the relative value of authoritative metadata and user generated content for search and recommendation using a test collection with data from Amazon and LibraryThing, and user profiles and personal catalogues. The Tweet Contextualization Track investigated tweet contextualization, helping a user to understand a tweet by providing him with a short background summary generated from relevant Wikipedia passages aggregated into a coherent summary. INEX 2014 was an exciting year for INEX in which we for the third time ran our workshop as part of the CLEF labs in order to facilitate knowledge transfer between evaluation forums. This paper gives an overview of all the INEX 2014 tracks, their aims and task, the built test-collections, the participants, and gives an initial analysis of the results
Towards Automatic Evaluation of Health-Related CQA Data

The paper reports on evaluation of Russian community question answering (CQA) data in health domain. About 1,500 question-answer pairs were manually evaluated by medical professionals, in addition automatic evaluation based on reference disease-medicine pairs was performed. Although the results of the manual and automatic evaluation do not fully match, we find the method still promising and propose several improvements. Automatic processing can be used to dynamically monitor the quality of the CQA content and to compare different data sources. Moreover, the approach can be useful for symptomatic surveillance and health education campaigns.This work is partially supported by the Russian Foundation for Basic Research, project #14-07-00589 “Data Analysis and User Modelling in Narrow-Domain Social Media”. We also thank assessors who volunteered for the evaluation and Mail.Ru for granting us access to the data
Inhibited effects in CP-logic

An important goal of statistical relational learning formalisms is to develop representations that are compact and expressive but also easy to read and maintain. This is can be achieved by exploiting the modularity of rule-based structures and is related to the noisy-or structure where parents independently influence a joint effect. Typically, these rules are combined in an additive manner where a new rule increases the probability of the effect. In this paper, we present a new language feature for CP-logic, where we allow negation in the head of rules to express the inhibition of an effect in a modular manner. This is a generalization of the inhibited noisy-or structure that can deal with cycles and, foremost, is non-conflicting. We introduce syntax and semantics for this feature and show how this is a natural counterpart to the standard noisy-or. Experimentally, we illustrate that in practice there is no additional cost when performing inference compared to a noisy-or structure.status: publishe
Complexity Bounds for Ordinal-Based Termination

`What more than its truth do we know if we have a proof of a theorem in a
given formal system?' We examine Kreisel's question in the particular context
of program termination proofs, with an eye to deriving complexity bounds on
program running times.
  Our main tool for this are length function theorems, which provide complexity
bounds on the use of well quasi orders. We illustrate how to prove such
theorems in the simple yet until now untreated case of ordinals. We show how to
apply this new theorem to derive complexity bounds on programs when they are
proven to terminate thanks to a ranking function into some ordinal.Comment: Invited talk at the 8th International Workshop on Reachability
  Problems (RP 2014, 22-24 September 2014, Oxford
Integer Vector Addition Systems with States

This paper studies reachability, coverability and inclusion problems for
Integer Vector Addition Systems with States (ZVASS) and extensions and
restrictions thereof. A ZVASS comprises a finite-state controller with a finite
number of counters ranging over the integers. Although it is folklore that
reachability in ZVASS is NP-complete, it turns out that despite their
naturalness, from a complexity point of view this class has received little
attention in the literature. We fill this gap by providing an in-depth analysis
of the computational complexity of the aforementioned decision problems. Most
interestingly, it turns out that while the addition of reset operations to
ordinary VASS leads to undecidability and Ackermann-hardness of reachability
and coverability, respectively, they can be added to ZVASS while retaining
NP-completness of both coverability and reachability.Comment: 17 pages, 2 figure
Task-parallel reductions in OpenMP and OmpSs

The wide adoption of parallel processing hardware in mainstream computing as well as the raising interest for efficient parallel programming in the developer community increase the demand for parallel programming model support for common algorithmic patterns. In this work we present an extension to the OpenMP task construct to add support for reductions in while-loops and general-recursive algorithms. Further we discuss implications on the OpenMP standard and present a prototype implementation in OmpSs. Benchmark results confirm applicability of this approach and scalability on current SMP systems.Peer ReviewedPostprint (author’s final draft
Towards transactional memory for OpenMP

The OpenMP specification lacks a composable shared memory concurrency mechanism: the current OpenMP concurrency mechanisms, such as OMP critical, locks, or atomics, do not support composition. In this paper, we motivate the need for transactional memory (TM) in OpenMP. The chief reason is to support composition of realistic programs, but we also consider whether TM is easier to program than locks, the use case for TM, and whether a software-only TM can outperform traditional locking through a survey of recent publications. This paper advances upon previous proposals of OpenMP TM by introducing a new construct specifically to handle irrevocable actions, which is also composable. It also proposes a pure atomic transaction construct as well as the concept of transaction safety. Further, we examine how our proposed construct integrates with current OpenMP constructs.Peer ReviewedPostprint (published version
On the roles of the programmer, the compiler and the runtime system when programming accelerators in OpenMP

OpenMP includes in its latest 4.0 specification the accelerator model. In this paper we present a partial implementation of this specification in the OmpSs programming model developed at the Barcelona Supercomputing Center with the aim of identifying which should be the roles of the programmer, the compiler and the runtime system in order to facilitate the asynchronous execution of tasks in architectures with multiple accelerator devices and processors. The design of OmpSs is highly biassed to delegate most of the decisions to the runtime system, which based on the task graph built at runtime (depend clauses) is able to schedule tasks in a data flow way to the available processors and accelerator devices and orchestrate data transfers and reuse among multiple address spaces. For this reason our implementation is partial, just considering from 4.0 those directives that enable the compiler the generation of the so called “kernels” to be executed on the target device. Several extensions to the current specification are also presented, such as the specification of tasks in “native” CUDA and OpenCL or how to specify the device and data privatization in the target construct. Finally, the paper also discusses some challenges found in code generation and a preliminary performance evaluation with some kernel applications.Peer ReviewedPostprint (author’s final draft
Evaluation of OpenMP Dependent Tasks with the KASTORS Benchmark Suite

International audienceThe recent introduction of task dependencies in the OpenMP specifi-cation provides new ways of synchronizing tasks. Application programmers can now describe the data a task will read as input and write as output, letting the runtime system resolve fine-grain dependencies between tasks to decide which task should execute next. Such an approach should scale better than the excessive global synchronization found in most OpenMP 3.0 applications. As promising as it looks however, any new feature needs proper evaluation to encourage applica-tion programmers to embrace it. This paper introduces the KASTORS benchmark suite designed to evaluate OpenMP tasks dependencies. We modified state-of-the-art OpenMP 3.0 benchmarks and data-flow parallel linear algebra kernels to make use of tasks dependencies. Learning from this experience, we propose extensions to the current OpenMP specification to improve the expressiveness of dependen-cies. We eventually evaluate both the GCC/libGOMP and the CLANG/libIOMP implementations of OpenMP 4.0 on our KASTORS suite, demonstrating the in-terest of task dependencies compared to taskwait-based approaches
Static Validation of Barriers and Worksharing Constructs in OpenMP Applications

International audienceThe OpenMP specification requires that all threads in a team execute the same sequence of worksharing and barrier regions. An improper use of such directive may lead to deadlocks. In this paper we propose a static analysis to ensure this property is verified. The well-defined semantic of OpenMP programs makes compiler analysis more effective. We propose a new compile-time method to identify in OpenMP codes the potential improper uses of barriers and work-sharing constructs, and the execution paths that are responsible for these issues. We implemented our method in a GCC compiler plugin and show the small im-pact of our analysis on performance for NAS-OMP benchmarks and a test case for a production industrial code
Parametrisation in electrostatic DPD Dynamics and Applications

A brief overview of mesoscopic modelling via dissipative particle dynamics is
presented, with emphasis on the appropriate parametrisation and how to
calculate the relevant parameters for given realistic systems. The dependence
on concentration and temperature of the interaction parameters is also
considered, as well as some applications.Comment: 28 pages, 12 figures in Selected Topics of Computational and
  Experimental Fluid Mechanics, Environmental Science and Engineering, J. Klapp
  et al. (eds.), Springer Verlag 201
Four-winged flapping flyer in forward flight

We study experimentally a four-winged flapping flyer with chord-wise flexible
wings in a self-propelled setup. For a given physical configuration of the
flyer (i.e. fixed distance between the forewing and hindwing pairs and fixed
wing flexibility), we explore the kinematic parameter space constituted by the
flapping frequency and the forewing-hindwing phase lag. Cruising speed and
consumed electric power measurements are performed for each point in the
$(f,\varphi)$ parameter space and allow us to discuss the problem of
performance and efficiency in four-winged flapping flight. We show that
different phase-lags are needed for the system to be optimised for fastest
flight or lowest energy consumption. A conjecture of the underlying mechanism
is proposed in terms of the coupled dynamics of the forewing-hindwing phase lag
and the deformation kinematics of the flexible wings.Comment: 12 pages, Invited lecture presented at the Seminario Enzo Levi 2013,
  Centro Abacus, CINVESTAV, Mexic
Effects of Boundary Conditions on Single-File Pedestrian Flow

In this paper we investigate effects of boundary conditions on one
dimensional pedestrian flow which involves purely longitudinal interactions.
Qualitatively, stop-and-go waves are observed under closed boundary condition
and dissolve when the boundary is open. To get more detailed information the
fundamental diagrams of the open and closed systems are compared using
Voronoi-based measurement method. Higher maximal specific flow is observed from
the pedestrian movement at open boundary condition
Kansei information processes in early design : design cognition and computation

This chapter considers the Kansei information processes involved in the early design process. It emphasizes the necessity of formalizing the earliest phases of design, i. e. the information phase. After a longitudinal research led since 1997, a theoretical model of the information phase of design was proposed. This model was then refined through experiments that we led from various research projects that were developed during the last years thanks to national and European supports. In the framework of the research presented here, the objective was to refine the model especially by considering the cognitive implicit operations which occur in the early generative phases, i. e. between the inspirational phases and the sketching ones. The paper starts with the definition of the following terms: design process, design information, sectors of analogy, kansei information, kansei structures and kansei rules. Kansei information characterizes the whole corpus of information which the designers deal with in the early design process. Especially, from the information phase, the creative process based on metaphors and analogies is decrypted and formalized, with the extraction of generic rules that, after understanding, may be used more systematically in the generative phase of design through future computer aided design tools. Finally we discuss some advances related to cognition and computation of Kansei processes in design.AN
Possibilistic Boolean games: strategic reasoning under incomplete information

Boolean games offer a compact alternative to normal-form games, by encoding the goal of each agent as a propositional formula. In this paper, we show how this framework can be naturally extended to model situations in which agents are uncertain about other agents' goals. We first use uncertainty measures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity
A dynamic view of active integrity constraints

Active integrity constraints have been introduced in the database community as a way to restore integrity. We view active integrity constraints as programs of Dynamic Logic of Propositional Assignments DL-PA and show how several semantics of database repair that were proposed in the literature can be characterised by DL-PA formulas. We moreover propose a new definition of repair. For all these definitions we provide DL-PA counterparts of decision problems such as the existence of a repair or the existence of a unique repair
Psychometric Assessment Using Classic Neuropsychological and Virtual Reality Based Test: A Study in Obsessive-Compulsive Disorder (OCD) and Schizophrenic Patients

Assessment of neurocognitive functioning is a critical task in clinical settings. In many disorders, cognitive impairment precedes the onset of behavioral symptoms, and cognitive decline is a major factor contributing to functional disability. The purpose of the current study was to evaluate the executive functions by comparing the evaluations obtained using a neuropsychological battery with the one obtained using the virtual reality version of the Multiple Errands Test (V-MET). The study population included three groups: 10 patients affected by Obsessive Compulsive Disorder (OCD); 10 Schizophrenic patients; 10 healthy Controls. The results identified executive problems in clinical samples. By contrast, controls have higher level of efficiency and better performance. The correlation across the two assessment support the validity of V-Met, as a neurocognitive assessment
Types in their prime: sub-typing of data in resource constrained environments

Sub-typing of data improves reuse and allows for reasoning at different levels of abstraction; however, it is seldom applied in resource constrained environments. The key reason behind this is the increase in overhead that is caused by including hierarchical information in data types as compared to a flat list. Where hierarchical data typing is used, it is often represented using verbose textual identifiers or numerical encodings that are suboptimal with regards to space. In this paper, we present an encoding function for hierarchically typed information, based on the properties of prime numbers. It provides a compact representation of types, fast subsumption testing even on resource constrained platforms and support for the evolution of the data type hierarchy. We demonstrate the feasibility of our approach on two representative communication models in constrained environments; a publish/subscribe event bus and a RESTful application protocol. We evaluate the performance of our encoding function and show that it has limited overhead compared to a flat list of data types and that this overhead is outweighed by reduced memory and communication overhead once applied.status: publishe
Using multi-attribute combinatorial auctions for resource allocation

Publicat dins del llibre d'actes del congrés: Müller, J. P., Weyrich, Michael, Bazzan, Ana L.C. (Eds.) (2014). 'Multiagent System Technologies : 12th German Conference, MATES 2014, Stuttgart, Germany, September 23-25, 2014 : Proceedings'Social concerns about the environment and global warming suggest that industries must focus on reducing energy consumption, due to its social impact and changing laws. Furthermore, the smart grid will bring time-dependent tariffs that pose new challenges to the optimisation of resource allocation. In this paper we address the problem of optimising energy consumption in manufacturing processes by means of multi-attribute combinatorial auctions, so that resource price, delivery time, and energy consumed (and therefore environmental impact) are minimised. The proposed mechanism is tested with simulated data based on real examples, showing the impact of incorporating energy into task allocation problems. It is then compared with a sequential auction metho
A Methodology and Tool for Rapid Prototyping of Data Warehouses using Data Mining: Application to Birds Biodiversity

International audienceData Warehouses (DWs) are large repositories of data aimed at supporting the decision-making process by enabling flexible and interactive analyses via OLAP systems. Rapid prototyping of DWs is necessary when OLAP applications are complex. Some work about the integration of Data Mining and OLAP systems has been done to enhance OLAP operators with mined indicators, and/or to define the DW schema. However, to best of our knowledge, prototyping methods for DWs do not support this kind of integration. Then, in this paper we present a new prototyping methodology for DWs, extending [3], where DM methods are used to define the DW schema. We validate our approach on a real data set concerning bird biodiversity
A novel multidimensional model for the OLAP on documents : modeling, generation and implementation

As the amount of textual information grows explosively in various kinds of business systems, it becomes more and more essential to analyze both structured data and unstructured textual data simultaneously. However information contained in non structured data (documents and so on) is only partially used in business intelligence (BI). Indeed On-Line Analytical Processing (OLAP) cubes which are the main support of BI analysis in decision support systems have focused on structured data. This is the reason why OLAP is being extended to unstructured textual data. In this paper we introduce the innovative “Diamond” multidimensional model that will serve as a basis for semantic OLAP on XML documents and then we describe the meta modeling, generation and implementation of a the Diamond multidimensional model
Wayfinding decision situations: a conceptual model and evaluation

Humans engage in wayfinding many times a day. We try to find our way in urban environments when walking towards our work places or when visiting a city as tourists. In order to reach the targeted destination, we have to make a series of wayfinding decisions of varying complexity. Previous research has focused on classifying the complexity of these wayfinding decisions, primarily looking at the complexity of the decision point itself (e.g., the number of possible routes or branches). In this paper, we proceed one step further by incorporating the user, instructions, and environmental factors into a model that assesses the complexity of a wayfinding decision. We constructed and evaluated three models using data collected from an outdoor wayfinding study. Our results suggest that additional factors approximate the complexity of a wayfinding decision better than the simple model using only the number of branches as a criterion
Spatial weights : constructing weight-compatible exchange matrices from proximity matrices

Exchange matrices represent spatial weights as symmetric probability distributions on pairs of regions, whose margins yield regional weights,  generally well-specified and known in most contexts. This contribution proposes a  mechanism for constructing  exchange matrices, derived from quite general symmetric proximity matrices,  in such a way that  the margin of the exchange matrix coincides with the regional weights. Exchange matrices generate in turn diffusive squared Euclidean dissimilarities, measuring spatial remoteness between pairs of regions.
Unweighted and weighted spatial frameworks are reviewed and compared, regarding in particular their impact on permutation and normal tests of spatial autocorrelation. Applications include tests of spatial autocorrelation with diagonal weights, factorial visualization of the  network of regions, multivariate generalizations of Moran's I, as well as "landscape clustering", aimed at creating regional aggregates both spatially contiguous and endowed with similar features