pinecone/core-2020-05-10-deduplication huggingface dataset:
Unified Pairwise Spatial Relations: An Application to Graphical Symbol Retrieval

The original publication is available at www.springerlink.com. 8th International Workshop, GREC 2009, La Rochelle, France, July 22-23, 2009. Selected PapersIn this paper, we present a novel unifying concept of pairwise spatial relations. We develop two way directional relations with respect to a unique point set, based on topology of the studied objects and thus avoids problems related to erroneous choices of reference objects while preserving symmetry. The method is robust to any type of image configuration since the directional relations are topologically guided. An automatic prototype graphical symbol retrieval is presented in order to establish its expressiveness
Optimal Exploration of Terrains with Obstacles

A mobile robot represented by a point moving in the plane has to explore an
unknown terrain with obstacles. Both the terrain and the obstacles are modeled
as arbitrary polygons. We consider two scenarios: the unlimited vision, when
the robot situated at a point p of the terrain explores (sees) all points q of
the terrain for which the segment pq belongs to the terrain, and the limited
vision, when we require additionally that the distance between p and q be at
most 1. All points of the terrain (except obstacles) have to be explored and
the performance of an exploration algorithm is measured by the length of the
trajectory of the robot. For unlimited vision we show an exploration algorithm
with complexity O(P + D?k), where P is the total perimeter of the terrain
(including perimeters of obstacles), D is the diameter of the convex hull of
the terrain, and k is the number of obstacles. We do not assume knowledge of
these parameters. We also prove a matching lower bound showing that the above
complexity is optimal, even if the terrain is known to the robot. For limited
vision we show exploration algorithms with complexity O(P + A + ?Ak), where A
is the area of the terrain (excluding obstacles). Our algorithms work either
for arbitrary terrains, if one of the parameters A or k is known, or for c-fat
terrains, where c is any constant (unknown to the robot) and no additional
knowledge is assumed. (A terrain T with obstacles is c-fat if R/r ? c, where R
is the radius of the smallest disc containing T and r is the radius of the
largest disc contained in T .) We also prove a matching lower bound ?(P + A +
?Ak) on the complexity of exploration for limited vision, even if the terrain
is known to the robot
Conflict-Free Coloring Made Stronger

In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can
be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is,
it can be colored with $O(\log n)$ colors such that for any (covered) point $p$
there is some disc whose color is distinct from all other colors of discs
containing $p$. They also showed that this bound is asymptotically tight. In
this paper we prove the following stronger results:
  \begin{enumerate} \item [(i)] Any set of $n$ discs in the plane can be
colored with a total of at most $O(k \log n)$ colors such that (a) for any
point $p$ that is covered by at least $k$ discs, there are at least $k$
distinct discs each of which is colored by a color distinct from all other
discs containing $p$ and (b) for any point $p$ covered by at most $k$ discs,
all discs covering $p$ are colored distinctively. We call such a coloring a
{\em $k$-Strong Conflict-Free} coloring. We extend this result to pseudo-discs
and arbitrary regions with linear union-complexity.
  \item [(ii)] More generally, for families of $n$ simple closed Jordan regions
with union-complexity bounded by $O(n^{1+\alpha})$, we prove that there exists
a $k$-Strong Conflict-Free coloring with at most $O(k n^\alpha)$ colors.
  \item [(iii)] We prove that any set of $n$ axis-parallel rectangles can be
$k$-Strong Conflict-Free colored with at most $O(k \log^2 n)$ colors.
  \item [(iv)] We provide a general framework for $k$-Strong Conflict-Free
coloring arbitrary hypergraphs. This framework relates the notion of $k$-Strong
Conflict-Free coloring and the recently studied notion of $k$-colorful
coloring. \end{enumerate}
  All of our proofs are constructive. That is, there exist polynomial time
algorithms for computing such colorings
Polychromatic Coloring for Half-Planes

We prove that for every integer $k$, every finite set of points in the plane
can be $k$-colored so that every half-plane that contains at least $2k-1$
points, also contains at least one point from every color class. We also show
that the bound $2k-1$ is best possible. This improves the best previously known
lower and upper bounds of $\frac{4}{3}k$ and $4k-1$ respectively. We also show
that every finite set of half-planes can be $k$ colored so that if a point $p$
belongs to a subset $H_p$ of at least $3k-2$ of the half-planes then $H_p$
contains a half-plane from every color class. This improves the best previously
known upper bound of $8k-3$. Another corollary of our first result is a new
proof of the existence of small size $\eps$-nets for points in the plane with
respect to half-planes.Comment: 11 pages, 5 figure
Minimum and maximum against k lies

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient,
and also necessary in the worst case, for finding both the minimum and the
maximum of an n-element totally ordered set. The set is accessed via an oracle
for pairwise comparisons. More recently, the problem has been studied in the
context of the Renyi-Ulam liar games, where the oracle may give up to k false
answers. For large k, an upper bound due to Aigner shows that (k+O(\sqrt{k}))n
comparisons suffice. We improve on this by providing an algorithm with at most
(k+1+C)n+O(k^3) comparisons for some constant C. The known lower bounds are of
the form (k+1+c_k)n-D, for some constant D, where c_0=0.5, c_1=23/32=0.71875,
and c_k=\Omega(2^{-5k/4}) as k goes to infinity.Comment: 11 pages, 3 figure
Vector Bin Packing with Multiple-Choice

We consider a variant of bin packing called multiple-choice vector bin
packing. In this problem we are given a set of items, where each item can be
selected in one of several $D$-dimensional incarnations. We are also given $T$
bin types, each with its own cost and $D$-dimensional size. Our goal is to pack
the items in a set of bins of minimum overall cost. The problem is motivated by
scheduling in networks with guaranteed quality of service (QoS), but due to its
general formulation it has many other applications as well. We present an
approximation algorithm that is guaranteed to produce a solution whose cost is
about $\ln D$ times the optimum. For the running time to be polynomial we
require $D=O(1)$ and $T=O(\log n)$. This extends previous results for vector
bin packing, in which each item has a single incarnation and there is only one
bin type. To obtain our result we also present a PTAS for the multiple-choice
version of multidimensional knapsack, where we are given only one bin and the
goal is to pack a maximum weight set of (incarnations of) items in that bin
Improved Algorithm for Degree Bounded Survivable Network Design Problem

We consider the Degree-Bounded Survivable Network Design Problem: the
objective is to find a minimum cost subgraph satisfying the given connectivity
requirements as well as the degree bounds on the vertices. If we denote the
upper bound on the degree of a vertex v by b(v), then we present an algorithm
that finds a solution whose cost is at most twice the cost of the optimal
solution while the degree of a degree constrained vertex v is at most 2b(v) +
2. This improves upon the results of Lau and Singh and that of Lau, Naor,
Salavatipour and Singh
fQuery: SPARQL Query Rewriting to Enforce Data Confidentiality

International audienceRDF is an increasingly used framework for describing Web resources, including sensitive and confidential resources. In this context, we need an expressive language to query RDF databases. SPARQL has been defined to easily localize and extract data in an RDF graph. Since confidential data are accessed, SPARQL queries must be filtered so that only authorized data are returned with respect to some confidentiality policy. In this paper, we model a confidentiality policy as a set of positive and negative filters (corresponding respectively to permissions and prohibitions) that apply to SPARQL queries. We then define rewriting algorithms that transform the queries so that the results returned by transformed queries are compliant with the confidentiality policy
Recognition of Facial Expressions by Cortical Multi-scale Line and Edge Coding

Face-to-face communications between humans involve emotions, which often are unconsciously conveyed by facial expressions and body gestures. Intelligent human-machine interfaces, for example in cognitive robotics, need to recognize emotions. This paper addresses facial expressions and their neural correlates on the basis of a model of the visual cortex: the multi-scale line and edge coding. The recognition model links the cortical representation with Paul Ekman's Action Units which are related to the different facial muscles. The model applies a top-down categorization with trends and magnitudes of displacements of the mouth and eyebrows based on expected displacements relative to a neutral expression. The happy vs. not-happy categorization yielded a. correct recognition rate of 91%, whereas final recognition of the six expressions happy, anger, disgust, fear, sadness and surprise resulted in a. rate of 78%
The analysis of facial beauty: an emerging area of research in pattern analysis

Much research presented recently supports the idea that the human perception of attractiveness is data-driven and largely irrespective of the perceiver. This suggests using pattern analysis techniques for beauty analysis. Several scientific papers on this subject are appearing in image processing, computer vision and pattern analysis contexts, or use techniques of these areas. In this paper, we will survey the recent studies on automatic analysis of facial beauty, and discuss research lines and practical application
Geometrical Characterization of Various Shaped 3D-Aggregates of Primary Spherical Particules by Radial Distribution Functions

International audienceMulti-scale aggregates are composed of particles which results themselves of agglomeration of other primary particles. If particles are modeled by their centers, the geometrical characterization of aggregates refers to point pattern analysis. Radial distribution and function of pairs allow a description of the point pattern to be performed. They describe how points are radially packed around each other. In this paper, the characterization of different simulated aggregates are computed and compared
Session level analysis of P2P television traces

In this study we examine statistical properties of traffic generated by the
popular P2P IPTV application SopCast. The analysis aims at a better
understanding of the mechanisms used by such applications and their impact on
the network. Since the most popular P2P IPTV applications use proprietary
unpublished protocols, we look directly at the generated traffic focusing on a
single session analysis, which is the major contribution of our work. We
present a basic characterisation of the traffic profile generated by SopCast
during every separate session in terms of the intensity, the burstiness, the
distribution of the packet sizes and the correlation. We show that some of
these statistical properties of the analysed traffic may be quite different
depending on the particular session
Over provisioning-centric QoS-routing mechanism for the communication paradigm of future internet 4WARD proposal

The FP7 4WARD clean-slate Project envisions overcoming the limitations of current Internet by redefining it to efficiently support complex value-added sessions and services, such as location-based, health-care, critical-mission, and geo processing. The list of networking innovations from 4WARD’s Future Internet (FI) proposal includes a new connectivity paradigm called Generic Path (GP), a common representation for all communications. From the networking point of view, a GP is mapped to a communication path for data propagation. For that, GP architecture relies on routing mechanism for selecting best communication paths. In order to assure reliable communications, the routing mechanism must efficiently provision QoS-aware multi-party capable paths, with robustness functions, while keeping network performance. Therefore, this paper proposes the QoS-Routing and Resource Control (QoS-RRC) mechanism to deal with the hereinabove requirements by means of an over provisioning-centric (bandwidth and paths) approach. QoS-RRC achieves scalability by avoiding per-flow operations (e.g., signaling, state storage, etc.). Initial QoS-RRC performance evaluation was carried out in Network Simulator v.2 (NS-2), enabling drastic reduction of overall signaling exchanges compared to per-flow solutions
Delaying mismatched field multiplications in pairing computations

Miller’s algorithm for computing pairings involves perform- \ud
ing multiplications between elements that belong to diﬀerent ﬁnite \ud
ﬁelds. Namely, elements in the full extension ﬁeld Fpk are multiplied \ud
by elements contained in proper subﬁelds F \ud
pk/d , and by elements in the \ud
base ﬁeld Fp . We show that signiﬁcant speedups in pairing computations \ud
can be achieved by delaying these “mismatched” multiplications for an \ud
optimal number of iterations. Importantly, we show that our technique \ud
can be easily integrated into traditional pairing algorithms; implementers \ud
can exploit the computational savings herein by applying only minor \ud
changes to existing pairing code
A randomized iterated greedy algorithm for the founder sequence reconstruction problem

The problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a\ud
combinatorial string problem. The main problem of existing techniques, both exact and heuristic, is that their time complexity scales exponentially, which makes them impractical for solving large-scale instances. Basing our work on previous ideas outlined in [1], we developed a randomized\ud
iterated greedy algorithm that is able to provide good solutions in a short time span. The experimental evaluation shows that our algorithm is currently the best approximate technique, especially when large problem instances are concerned.Peer ReviewedPostprint (published version
A Novel Hybrid Approach to Improve Performance on Frequency Division Duplex Systems with Linear Precoding

The final publication is available http://dx.doi.org/DOI: 10.1007/978-3-642-13803-4_31[Abstrtact] Linear precoding is an attractive technique to combat interference in  multiple-input multiple-output systems because it reduces costs and power consumption in the receiver equipment. Most of the frequency division duplex systems with linear precoding acquire the channel state information at the receiver by using supervised algorithms. Such algorithms make use of pilot symbols periodically sent by the transmitter. In a later step, the channel state information is sent to the transmitter side through a limited feedback channel.

In order to reduce the overhead inherent to the periodical transmission of training data, we propose to acquire the channel state information by combining supervised and unsupervised algorithms, leading to a hybrid and more efficient approach. Simulation results show that the performance achieved with the proposed scheme is clearly better than that with standard algorithms.This work was supported by Xunta de Galicia, Ministerio de Educación y Ciencia, Ministerio de Ciencia e Innovación
of Spain and FEDER funds of the European Union under grants number 09TIC008105PR, TEC2007-68020-C04-01, CSD2008-00010 and TIN2009-05736-E/TIN
Detecting Features from Confusion Matrices using Generalized Formal Concept Analysis

We claim that the confusion matrices of multiclass problems can be analyzed by means of a generalization of Formal Concept Analysis to obtain symbolic information about the feature sets of the underlying classification task.We prove our claims by analyzing the confusion matrices of human speech perception experiments and comparing our results to those elicited by experts.This work has been supported by Spanish Government-Comisión Interministerial de Ciencia y Tecnología TEC2008-02473/TEC y TEC2008-06382/TEC.Publicad
Reconciling Knowledge in Social Tagging Web Services

Sometimes we want to search for new information about topics
but we can not find relevant results using our own knowledge (for example,
our personal bookmarks). A potential solution could be the use
of knowledge from other users to find what we are searching for. This solution
implies that we can achieve some agreement on implicit semantics
used by the other users. We call it Reconciliation of Knowledge. The aim
of this paper is to show an agent-based method which lets us reconcile
two different knowledge basis (associated with tagging systems) into a
common language, obtaining a new one that allows the reconcilitiation of
(part of) this knowledge. The agents use Formal Concept Analysis concepts
and tools and it has been implemented on the JADE multiagent
platform.Ministerio de Ciencia e Innovación TIN2009-0949
Fusion of Single View Soft k-NN Classifiers for Multicamera Human Action Recognition

Proceedings of: 5th International Conference on Hybrid Artificial Intelligence Systems (HAIS 2010). San Sebastián, Spain, June 23-25, 2010This paper presents two different classifier fusion algorithms applied in the domain of Human Action Recognition from video. A set of cameras observes a person performing an action from a predefined set. For each camera view a 2D descriptor is computed and a posterior on the performed activity is obtained using a soft classifier. These posteriors are combined using voting and a bayesian network to obtain a single belief measure to use for the final decision on the performed action. Experiments are conducted with different low level frame descriptors on the IXMAS dataset, achieving results comparable to state of the art 3D proposals, but only performing 2D processing.This work was supported in part by Projects CICYT
TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, CAM
CONTEXTS (S2009/TIC-1485) and DPS2008-07029-C02-02Publicad
A simulation framework for UAV sensor fusion

Proceedings of: 5th International Conference, HAIS 2010, San Sebastián, Spain, June 23-25, 2010.he behavior recognition is one of the most prolific lines of research in recent decades in the field of computer vision. Within this field, the majority of researches have focused on the recognition of the activities carried out by a single individual, however this paper deals with the problem of recognizing the behavior of a group of individuals, in which relations between the component elements are of great importance. For this purpose it is exposed a new representation that concentrates all necessary information concerning relations peer to peer present in the group, and the semantics of the different groups formed by individuals and training (or structure) of each one of them. The work is presented with the dataset created in CVBASE06 dealing the European handballThis work was supported in part by Projects ATLANTIDA, CICYT TIN2008-06742-
C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM CONTEXTS
S2009/TIC-1485 and DPS2008-07029-C02-02.Publicad
Towards clausal discovery for stream mining

With the increasing popularity of data streams it has become time to adapt logical and relational learning techniques for dealing with streams.
In this note, we present our preliminary results on upgrading the clausal discovery paradigm towards the mining of streams. In this setting, there is a stream of interpretations and the goal is to learn a clausal theory that is satisfied by these interpretations. Furthermore, in data streams the interpretations can be read (and processed) only once.status: publishe
Don't fear optimality: Sampling for probabilistic-logic sequence models

One of the current challenges in artificial intelligence is modeling dynamic environments that change due to the actions or activities undertaken by people or agents.
The task of inferring hidden states, e.g. the activities or intentions of people, based on observations is called filtering. Standard probabilistic models such as Dynamic Bayesian Networks are able to solve this task efficiently using approximative methods such as particle filters. However, these models do not support logical or relational representations.
The key contribution of this paper is the upgrade of a particle filter algorithm for use with a probabilistic logical representation through the definition of a proposal distribution.
The performance of the algorithm  depends largely on how well this distribution fits the target distribution. We adopt the idea of logical compilation into Binary Decision Diagrams for sampling. This allows us to use the optimal proposal distribution which is normally prohibitively slow.status: publishe
On the relationship between logical Bayesian networks and probabilistic logic programming based on the distribution semantics

A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need for insight into the relationships between all these languages. One kind of languages are those that extend probabilistic models with elements of logic, such as the language of Logical Bayesian Networks (LBNs). Some other languages follow the converse strategy of extending logic programs with a probabilistic semantics, often in a way similar to that of Sato's distribution semantics. 

In this paper we study the relationship between the language of LBNs and languages based on the distribution semantics. Concretely, we define a mapping from LBNs to theories in the Independent Choice Logic (ICL). We also show how this mapping can be used to learn ICL theories from data.status: publishe
GPGPU based simulations for one and two dimensional quantum walks

Simulations of standard 1D and 2D quantum walks have been performed within
Quantum Computer Simulator (QCS system) environment and with the use of GPU
supported by CUDA technology. In particular, simulations of quantum walks may
be seen as an appropriate benchmarks for testing calculational power of the
processors used. It was demonstrated by a series of tests that the use of CUDA
based technology radically increases the computational power compared to the
standard CPU based computations.Comment: 10 page
Performance limitations for sparse matrix-vector multiplications on
  current multicore environments

The increasing importance of multicore processors calls for a reevaluation of
established numerical algorithms in view of their ability to profit from this
new hardware concept. In order to optimize the existent algorithms, a detailed
knowledge of the different performance-limiting factors is mandatory. In this
contribution we investigate sparse matrix-vector multiplication, which is the
dominant operation in many sparse eigenvalue solvers. Two conceptually
different storage schemes and computational kernels have been conceived in the
past to target cache-based and vector architectures, respectively. Starting
from a series of microbenchmarks we apply the gained insight on optimized
sparse MVM implementations, whose serial and OpenMP-parallel performance we
review on state-of-the-art multicore systems.Comment: 16 pages, 9 figure