pinecone/core-2020-05-10-deduplication huggingface dataset:
Learning Graph Model for Different Dimensions Image Matching

Hyperspectral imagery has been widely used in real applications such as remote sensing, agriculture, surveillance, and geological analysis. Matching hyperspectral images is a challenge task due to the high dimensional nature of the data. The matching task becomes more difficult when images with different dimensions, such as a hyperspectral image and an RGB image, have to be matched. In this paper, we address this problem by investigating structured support vector machine to learn graph model for each type of image. The graph model incorporates both low-level features and stable correspondences within images. The inherent characteristics are depicted by using graph matching algorithm on weighted graph models. We validate the effectiveness of our method through experiments on matching hyperspectral images to RGB images, and hyperspectral images with different dimensions.Full Tex
Isometric Mapping Hashing

Hashing is a popular solution to Approximate Nearest Neighbor (ANN) problems. Many hashing schemes aim at preserving the Euclidean distance of the original data. However, it is the geodesic distance rather than the Euclidean distance that more accurately characterizes the semantic similarity of data, especially in a high dimensional space. Consequently, manifold based hashing methods have achieved higher accuracy than conventional hashing schemes. To compute the geodesic distance, one should construct a nearest neighbor graph and invoke the shortest path algorithm, which is too expensive for a retrieval task. In this paper, we present a hashing scheme that preserves the geodesic distance and use a feasible out-of-sample method to generate the binary codes efficiently. The experiments show that our method outperforms several alternative hashing methods.Full Tex
A Subpath Kernel for Learning Hierarchical Image Representations

Tree kernels have demonstrated their ability to deal with hierarchical data,
as the intrinsic tree structure often plays a discriminative role. While such
kernels have been successfully applied to various domains such as nature
language processing and bioinformatics, they mostly concentrate on ordered
trees and whose nodes are described by symbolic data. Meanwhile, hierarchical
representations have gained increasing interest to describe image content. This
is particularly true in remote sensing, where such representations allow for
revealing different objects of interest at various scales through a tree
structure. However, the induced trees are unordered and the nodes are equipped
with numerical features. In this paper, we propose a new structured kernel for
hierarchical image representations which is built on the concept of subpath
kernel. Experimental results on both artificial and remote sensing datasets
show that the proposed kernel manages to deal with the hierarchical nature of
the data, leading to better classification rates.Comment: 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China,
  May 13-15, 2015. Proceeding
A mobile application for a user-generated collection of landmarks

Landmarks are crucial elements in how people understand and communicate about space. In wayfinding they provide references that are preferred and easier to follow than distances or street names alone. Thus, the inclusion of landmarks into navigation services is a long-held goal, but its implementation has largely failed so far. To a large part this is due to significant difficulties in obtaining a sufficient data set of landmark candidates. In this paper, we introduce a mobile application, which enables a user-generated collection of landmarks. Employing a photo-based interface, the application calculates and ranks potential landmark candidates based on the current visible area and presents them to the user, who then may choose the intended one. We use OpenStreetMap as data source; the app allows tagging OSM objects as potential landmarks. Integrating users into the landmark selection process keeps data requirements low, while a simple interface lowers the burden on the users
On packet scheduling with adversarial jamming and speedup

In Packet Scheduling with Adversarial Jamming, packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission taking place at the time of jamming is corrupt, and the algorithm learns this fact immediately. An online algorithm maximizes the total size of packets it successfully transmits and the goal is to develop an algorithm with the lowest possible asymptotic competitive ratio, where the additive constant may depend on packet sizes. Our main contribution is a universal algorithm that works for any speedup and packet sizes and, unlike previous algorithms for the problem, it does not need to know these parameters in advance. We show that this algorithm guarantees 1-competitiveness with speedup 4, making it the first known algorithm to maintain 1-competitiveness with a moderate speedup in the general setting of arbitrary packet sizes. We also prove a lower bound of   ϕ+1≈2.618  on the speedup of any 1-competitive deterministic algorithm, showing that our algorithm is close to the optimum. Additionally, we formulate a general framework for analyzing our algorithm locally and use it to show upper bounds on its competitive ratio for speedups in [1, 4) and for several special cases, recovering some previously known results, each of which had a dedicated proof. In particular, our algorithm is 3-competitive without speedup, matching both the (worst-case) performance of the algorithm by Jurdzinski et al. (Proceedings of the 12th workshop on approximation and online algorithms (WAOA), LNCS 8952, pp 193–206, 2015. http://doi.org/10.1007/978-3-319-18263-6_17) and the lower bound by Anta et al. (J Sched 19(2):135–152, 2016. http://doi.org/10.1007/s10951-015-0451-z)
Generalized Hypergraph Matching via Iterated Packing and Local Ratio

In $k$-hypergraph matching, we are given a collection of sets of size at most
$k$, each with an associated weight, and we seek a maximum-weight subcollection
whose sets are pairwise disjoint. More generally, in $k$-hypergraph
$b$-matching, instead of disjointness we require that every element appears in
at most $b$ sets of the subcollection. Our main result is a linear-programming
based $(k-1+\tfrac{1}{k})$-approximation algorithm for $k$-hypergraph
$b$-matching. This settles the integrality gap when $k$ is one more than a
prime power, since it matches a previously-known lower bound. When the
hypergraph is bipartite, we are able to improve the approximation ratio to
$k-1$, which is also best possible relative to the natural LP. These results
are obtained using a more careful application of the \emph{iterated packing}
method.
  Using the bipartite algorithmic integrality gap upper bound, we show that for
the family of combinatorial auctions in which anyone can win at most $t$ items,
there is a truthful-in-expectation polynomial-time auction that
$t$-approximately maximizes social welfare. We also show that our results
directly imply new approximations for a generalization of the recently
introduced bounded-color matching problem.
  We also consider the generalization of $b$-matching to \emph{demand
matching}, where edges have nonuniform demand values. The best known
approximation algorithm for this problem has ratio $2k$ on $k$-hypergraphs. We
give a new algorithm, based on local ratio, that obtains the same approximation
ratio in a much simpler way.Comment: 12 pages. Appeared in the 12th Workshop on Approximation and Online
  Algorithms (WAOA 2014), available at Springer via
  http://dx.doi.org/10.1007/978-3-319-18263-6_1
Better Algorithms for Online Bin Stretching

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-18263-6_3Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly\ud
overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum\ud
size packed into any bin.\ud
We give an algorithm for Online Bin Stretching with a stretching factor of 1:5 for\ud
any number of bins. We also show a specialized algorithm for three bins with a stretching\ud
factor of 11=8 = 1:375.Peer-reviewedPost-prin
All functions g:N-->N which have a single-fold Diophantine
  representation are dominated by a limit-computable function f:N\{0}-->N which
  is implemented in MuPAD and whose computability is an open problem

Let E_n={x_k=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For any
integer n \geq 2214, we define a system T \subseteq E_n which has a unique
integer solution (a_1,...,a_n). We prove that the numbers a_1,...,a_n are
positive and max(a_1,...,a_n)>2^(2^n). For a positive integer n, let f(n)
denote the smallest non-negative integer b such that for each system S
\subseteq E_n with a unique solution in non-negative integers x_1,...,x_n, this
solution belongs to [0,b]^n. We prove that if a function g:N-->N has a
single-fold Diophantine representation, then f dominates g. We present a MuPAD
code which takes as input a positive integer n, performs an infinite loop,
returns a non-negative integer on each iteration, and returns f(n) on each
sufficiently high iteration.Comment: 17 pages, Theorem 3 added. arXiv admin note: substantial text overlap
  with arXiv:1309.2605. text overlap with arXiv:1404.5975, arXiv:1310.536
Level sets of the lapse function in static GR

We present a novel physical interpretation of the level sets of the
(canonical) lapse function in static isolated general relativistic space-times.
Our interpretation uses a notion of 'constrained test particles'. It leads to a
definition of gravitational force on test particles and to a previously unknown
uniqueness result for the lapse function.
  In Section 5, we discuss 'photon spheres' in static isolated relativistic
space-times and relate them to the level sets of the lapse function.Comment: updated to published version. in D. Puetzfeld et al. (eds.),
  Equations of Motion in Relativistic Gravity, Fundamental Theories of Physics
  179, Springer, 201
Motion in classical field theories and the foundations of the self-force
  problem

This article serves as a pedagogical introduction to the problem of motion in
classical field theories. The primary focus is on self-interaction: How does an
object's own field affect its motion? General laws governing the self-force and
self-torque are derived using simple, non-perturbative arguments. The relevant
concepts are developed gradually by considering motion in a series of
increasingly complicated theories. Newtonian gravity is discussed first, then
Klein-Gordon theory, electromagnetism, and finally general relativity. Linear
and angular momenta as well as centers of mass are defined in each of these
cases. Multipole expansions for the force and torque are then derived to all
orders for arbitrarily self-interacting extended objects. These expansions are
found to be structurally identical to the laws of motion satisfied by extended
test bodies, except that all relevant fields are replaced by effective versions
which exclude the self-fields in a particular sense. Regularization methods
traditionally associated with self-interacting point particles arise as
straightforward perturbative limits of these (more fundamental) results.
Additionally, generic mechanisms are discussed which dynamically shift ---
i.e., renormalize --- the apparent multipole moments associated with
self-interacting extended bodies. Although this is primarily a synthesis of
earlier work, several new results and interpretations are included as well.Comment: 68 pages, 1 figur
Self-force: Computational Strategies

Building on substantial foundational progress in understanding the effect of
a small body's self-field on its own motion, the past 15 years has seen the
emergence of several strategies for explicitly computing self-field corrections
to the equations of motion of a small, point-like charge. These approaches
broadly fall into three categories: (i) mode-sum regularization, (ii) effective
source approaches and (iii) worldline convolution methods. This paper reviews
the various approaches and gives details of how each one is implemented in
practice, highlighting some of the key features in each case.Comment: Synchronized with final published version. Review to appear in
  "Equations of Motion in Relativistic Gravity", published as part of the
  Springer "Fundamental Theories of Physics" series. D. Puetzfeld et al.
  (eds.), Equations of Motion in Relativistic Gravity, Fundamental Theories of
  Physics 179, Springer, 201
On geodesic dynamics in deformed black-hole fields

"Almost all" seems to be known about isolated stationary black holes in
asymptotically flat space-times and about the behaviour of {\em test} matter
and fields in their backgrounds. The black holes likely present in galactic
nuclei and in some X-ray binaries are commonly being represented by the Kerr
metric, but actually they are not isolated (they are detected only thanks to a
strong interaction with the surroundings), they are not stationary (black-hole
sources are rather strongly variable) and they also probably do not live in an
asymptotically flat universe. Such "perturbations" may query the classical
black-hole theorems (how robust are the latter against them?) and certainly
affect particles and fields around, which can have observational consequences.
In the present contribution we examine how the geodesic structure of the static
and axially symmetric black-hole space-time responds to the presence of an
additional matter in the form of a thin disc or ring. We use several different
methods to show that geodesic motion may become chaotic, to reveal the strength
and type of this irregularity and its dependence on parameters. The relevance
of such an analysis for galactic nuclei is briefly commented on.Comment: 32 pages, 9 figure
Multipolar test body equations of motion in generalized gravity theories

We give an overview of the derivation of multipolar equations of motion of
extended test bodies for a wide set of gravitational theories beyond the
standard general relativistic framework. The classes of theories covered range
from simple generalizations of General Relativity, e.g. encompassing additional
scalar fields, to theories with additional geometrical structures which are
needed for the description of microstructured matter. Our unified framework
even allows to handle theories with nonminimal coupling to matter, and thereby
for a systematic test of a very broad range of gravitational theories.Comment: 54 pages, 3 figures, to appear in "Equations of Motion in
  Relativistic Gravity", D. Puetzfeld et al. (eds.), Fundamental theories of
  Physics, Springer 2015. arXiv admin note: substantial text overlap with
  arXiv:1408.566
The Galactic Center Black Hole Laboratory

The super-massive 4 million solar mass black hole Sagittarius~A* (SgrA*)
shows flare emission from the millimeter to the X-ray domain. A detailed
analysis of the infrared light curves allows us to address the accretion
phenomenon in a statistical way. The analysis shows that the near-infrared
flare amplitudes are dominated by a single state power law, with the low states
in SgrA* limited by confusion through the unresolved stellar background. There
are several dusty objects in the immediate vicinity of SgrA*. The source G2/DSO
is one of them. Its nature is unclear. It may be comparable to similar stellar
dusty sources in the region or may consist predominantly of gas and dust. In
this case a particularly enhanced accretion activity onto SgrA* may be expected
in the near future. Here the interpretation of recent data and ongoing
observations are discussed.Comment: 30 pages - 7 figures - accepted for publication by Springer's
  "Fundamental Theories of Physics" series; summarizing GC contributions of 2
  conferences: 'Equations of Motion in Relativistic Gravity' at the
  Physikzentrum Bad Honnef, Bad Honnef, Germany, (Feb. 17-23, 2013) and the
  COST MP0905 'The Galactic Center Black Hole Laboratory' Granada, Spain (Nov.
  19 - 22, 2013
Time-domain inspiral templates for spinning compact binaries in
  quasi-circular orbits

We present a prescription to compute the time-domain gravitational wave (GW)
polarization states associated with spinning compact binaries inspiraling along
quasi-circular orbits. We invoke the orbital angular momentum ${\bf L}$ rather
than its Newtonian counterpart ${\bf L_{\rm N}}$ to describe the orbits and the
two spin vectors are freely specified in the source frame associated with the
initial direction of the total angular momentum. We discuss the various
implications of our approach.Comment: 10 pages, 1 figure. Contribution to the proceedings of "Equations of
  Motion in Relativistic Gravity", Bad Honnef, Germany, 17 Feb - 23 Feb 201
ALPHA: an eAsy inteLligent service Platform for Healthy Ageing

Dementia is one of the biggest global public health challenges facing our generation. Alzheimers disease (AD) is the most frequent cause of dementia in elderly people over 65 years of age. The typical characteristic of AD is impairment of memory. As the disease progresses, other cognitive domains such as language, praxis, visuo-spatial and executive functions become involved, eventually resulting in global cognitive decline. Behavioral Psychological Symptoms of Dementia (BPSD) problems are constant in AD and have highly negative impact on the quality of life of patients and their families. ALPHA project aims at developing an intelligent situation-aware system to collect and process information about Alzheimer Disease patients? life style. Starting from various data provided by caregivers and a set of non-invasive sensors and devices. ALPHA will provide clinicians with new quantitative and qualitative information about patients? abnormal behavior which, along with medical data, will enhance the accuracy and reliability of monitoring and assessing the patient?s health status. Clinicians will be supported by a suite of specifically designed tools and interfaces to analyze the metadata captured, improve management of personalized care plans and better interact with patients and caregivers. Studies of antique records of former psychiatric hospital will enable us towiden the knowledge of behavioral disorders thus allowing to compare the ancient ones and the curcurrent and to probabilistically determine relation between type of dementia and behavioral disorders
Design of Cloud Robotic Services for Senior Citizens to Improve Independent Living and Personal Health Management

A cloud robotics solution was designed and initially tested with a mobile robotic platform and a smart environment, in order to provide health-care management services to senior citizens and improve their independent living. The solution was evaluated in terms of Quality of Service (QoS) and tested in the realistic scenario of the DomoCasa Living Lab, Peccioli, Italy. In particular, a medication reminding service, a remote home monitoring and a user indoor localization algorithm were outsourced in the cloud and provided to the robots, users and carers. The system acquired data from a smart environment and addressed the robot to the user for service delivery. Experiments showed a service's Reliability of Response at least of the 0.04 % and a Time of Response of the same order of magnitude of the processing time required by the user localization algorithm
A dramatic landscape

This chapter introduces the story of Pureora Forest Park (PFP), in the central North Island, New Zealand, by describing the extremely violent Taupo eruption of c. AD 232 and its consequences for the surrounding forests and mountains. It gives a broad-scale local geological history, detailing the origins of some important local sedimentary rocks and landforms with a bearing on the story, including limestone caverns and coal deposits. It describes the location of the future PFP on the western edge of the Taupo Volcanic Zone, and how the history of volcanic activity, together with erosion, have determined much of the character of its landscape, the radial drainage pattern and deep entrenchment of its rivers, the distribution of its vegetation, and its long isolation from human access and permanent settlement
Creating Interactive Content in Android Devices: The Mokap Hackaton

We propose the organization of a Mokap hackathon. In this activity participants will have the opportunity to develop interactive content using the Mokap Android app, either individually or in groups. Mokap is a new authoring tool for creating interactive content, developed by the e-UCM research group. It allows composing scenes by combining text, hand drawings, pictures and elements imported from an online repository. Mokap also supports basic animation and interaction. Users can take advantage of this functionality to create presentations, training materials, simulations, postcards and even simple games. We will start the activity with an introduction to Mokap, followed by a quick demo. Then we will help participants design their own mokaps and implement them. At the end of the activity participants will be given the possibility to share their mokaps with the rest of the audience. Participants will vote online to choose the best mokap developed during the session, which will be awarded a symbolic prize
Building and Using Home Automation Systems: A Field Study

International audienceThese last years, several new home automation boxes appeared on the market, the new radio-based protocols facilitating their deployment with respect to previously wired solutions. Coupled with the wider availability of connected objects, these protocols have allowed new users to set up home automation systems by themselves. In this paper, we relate an in situ observational study of these builders in order to understand why and how the smart habitats were developed and used. We led 10 semi-structured interviews in households composed of at least 2 adults and equipped for at least 1 year, and 47 home automation builders answered an online questionnaire at the end of the study. Our study confirms, specifies and exhibits additional insights about usages and means of end-user development in the context of home automation
Sentiment analysis using domain-adaptation and sentence-based analysis

Sentiment analysis aims to automatically estimate the sentiment in a given text as positive, objective or negative, possibly together with the strength of the sentiment. Polarity lexicons that indicate how positive or negative each term is, are often used as the basis of many sentiment analysis approaches. Domain-specific polarity lexicons are expensive and time-consuming to build; hence, researchers often use a general purpose or domain-independent lexicon as the basis of their analysis. In this work, we address two sub-tasks in sentiment analysis. We apply a simple method to adapt a general purpose polarity lexicon to a specific domain [1]. Subsequently, we propose and evaluate new features to be used in a word polarity based approach to sentiment classification. In particular, we analyze sentences as the first step for estimating the overall review polarity. We consider different aspects of sentences, such as length, purity, irrealis content, subjectivity, and position within the opinionated text. This analysis is then used to find sentences that may convey better information about the overall review polarity.We use a subset of hotel reviews from the TripAdvisor database [2] to evaluate the effect of sentence-level features on sentiment classification. Then, we measure the performance of our sentiment analysis engine using the domain-adapted lexicon on a large subset of theTripAdvisor database.European Commission, FP7, under UBIPOL (Ubiquitous Participation Platform for Policy Making) Projec