pinecone/core-2020-05-10-deduplication huggingface dataset:
A Statistical Approach to Analyzing Sound Tracings

This paper presents an experiment on sound tracing, meaning an experiment on how people relate motion to sound. 38 participants were presented with 18 short sounds, and instructed to move their hands in the air while acting as though the sound was created by their hand motion. The hand motion of the participants was recorded, and has been analyzed using statistical tests, comparing results between different sounds, between different subjects, and between different sound classes. We have identified several relationships between sound and motion which are present in the majority of the subjects. A clear distinction was found in onset acceleration for motion to sounds with an impulsive dynamic envelope compared to non-impulsive sounds. Furthermore, vertical movement has been shown to be related to sound frequency, both in terms of spectral centroid and pitch. Moreover, a significantly higher amount of overall acceleration was observed for non-pitched sounds as compared to pitched sounds.

The original publication is available at www.springerlink.com.
Lecture Notes in Computer Science, 2012, Volume 7172/2012, 120-145
Navigating the wrench-feasible C-space of cable-driven hexapods

Motion paths of cable-driven hexapods must carefully be planned to ensure that the lengths and tensions of all cables remain within acceptable limits, for a given wrench applied to the platform. The cables cannot go slack –to keep the control of the platform– nor excessively tight –to prevent cable breakage– even in the presence of bounded perturbations of the wrench. This paper proposes a path planning method that accommodates such constraints simultaneously. Given two configurations of the platform, the method attempts to connect them through a path that, at any point, allows the cables to counteract any wrench lying inside a predefined uncertainty region. The resulting C-space is placed in correspondence with a smooth manifold, which allows defining a continuation strategy to search this space systematically from one configuration, until the second configuration is found, or path non-existence is proved by exhaustion of the search. The approach is illustrated on the NIST Robocrane hexapod, but it remains applicable to general cable-driven hexapods, either to navigate their full six-dimensional C-space, or any of its slices.Preprin
Differential Privacy with Imperfect Randomness

In this work we revisit the question of basing cryptogra- phy on imperfect randomness. Bosley and Dodis (TCC’07) showed that if a source of randomness R is “good enough” to generate a secret key capable of encrypting k bits, then one can deterministically extract nearly k almost uniform bits from R, suggesting that traditional privacy notions (namely, indistinguishability of encryption) requires an “extractable” source of randomness. Other, even stronger impossibility results are known for achieving privacy under specific “non-extractable” sources of randomness, such as the γ-Santha-Vazirani (SV) source, where each next bit has fresh entropy, but is allowed to have a small bias γ < 1 (possibly depending on prior bits).
We ask whether similar negative results also hold for a more recent notion of privacy called differential privacy (Dwork et al., TCC’06), concentrating, in particular, on achieving differential privacy with the Santha-Vazirani source. We show that the answer is no. Specifically, we give a differentially private mechanism for approximating arbitrary “low sensitivity” functions that works even with randomness coming from a γ-Santha-Vazirani source, for any γ < 1. This provides a somewhat surprising “separation” between traditional privacy and differential privacy with respect to imperfect randomness.
Interestingly, the design of our mechanism is quite different from the traditional “additive-noise” mechanisms (e.g., Laplace mechanism) successfully utilized to achieve differential privacy with perfect randomness. Indeed, we show that any (non-trivial) “SV-robust” mechanism for our problem requires a demanding property called consistent sampling, which is strictly stronger than differential privacy, and cannot be satisfied by any additive-noise mechanism.Engineering and Applied Science
A technology acceptance model for e-health services for the elderly population in China

A human-centered e-health service model for elderly people is proposed as one of the measures to help meet the challenges of an ageing society in China. Most of the research in this field to date has been limited to qualitative research, the paper puts forward a proposal to build a technology acceptance model to extend e-health services for elderly people; this is expected to obtain more quantitative data on acceptance. The purpose of this paper is to explore a suitable research analysis model for China's aging e-health service, as well as to enrich related researches in this area.
Catadioptric system optimisation for omnidirectional Robocup MSL robots

Omnidirectional Robocup MSL robots often use catadioptric vision
systems in order to enable 360º of field view. It comprises an upright camera
facing a convex mirror, commonly spherical, parabolic or hyperbolic, that
reflects the entire space around the robot. This technique is being used for more
than a decade and in a similar way by most teams. Teams upgrade their cameras
in order to obtain more and better information of the captured area in pixel
quantity and quality, but a large image area outside the convex mirror is black
and unusable. The same happens on the image centre where the robot shows
itself. Some efficiency though, can be improved in this technique by the
methods presented in this paper such as developing a new convex mirror and by
repositioning the camera viewpoint. Using 3D modelling CAD/CAM software
for the simulation and CNC lathe mirror construction, some results are
presented and discussed
Robot orientation with histograms on MSL

One of the most important tasks on robot soccer is localization. The team robots should self-localize on the 18 x 12 meters soccer field. Since a few years ago the soccer field has increased and the corner posts were removed and that increased the localization task complexity. One important aspect to take care for a proper localization is to find out the robot orientation. This paper proposes a new technique to calculate the robot orientation. The proposed method consists of using a histogram of white-green transitions (to detect the lines on the field) to know the robot orientation. This technique does not take much computational time and proves to be very reliable
Designing Smooth Communication Environment for Telemedicine for General Practitioner

Today’s rapid advancement of the information and communication technologies enables us to perform telemedicine over the information networks. However, the realtime telemedicine is still not widely performed as a routine clinical activity. The authors developed a prototype multimedia communication system to support the realtime telemedicine and evaluated communication and technical barriers through protocol analysis. The results tell that ill synchronization and lack of non-verbal information may harm diagnostic process although the prototype enables general practitioners to diagnose a new patient from a remote site
Discovering novel knowledge using granule mining

This paper presents an extended granule mining based methodology, to effectively describe the relationships between granules not only by traditional support and confidence, but by diversity and condition diversity as well. Diversity measures how diverse of a granule associated with the other granules, it provides a kind of novel knowledge in databases. We also provide an algorithm to implement the proposed methodology. The experiments conducted to characterize a real network traffic data collection show that the proposed concepts and algorithm are promising
A user's guide to optimal transport

This text is an expanded version of the lectures given by the first author in the 2009 CIME summer school of Cetraro. It provides a quick and reasonably account of the classical theory of optimal mass transportation and of its more recent developments, including the metric theory of gradient flows, geometric and functional inequalities related to optimal transportation, the first and second order differential calculus in the Wasserstein space and the synthetic theory of metric measure spaces with Ricci curvature bounded from below
Collaborative dynamic decision making: a case study from B2B supplier selection

The problem of supplier selection can be easily modeled as a multiple-criteria decision making (MCDM) problem: businesses express their preferences with respect to suppliers, which can then be ranked and selected. This approach has two major pitfalls: first, it does not consider a dynamic scenario, in which suppliers and their ratings are constantly changing; second, it only addressed the problem from the point of view of a single business, and cannot be easily applied when considering more than one business. To overcome these problems, we introduce a method for supplier selection that builds upon the dynamic MCDM framework of Campanella and Ribeiro [1] and, by means of a linear programming model, can be used in the case of multiple collaborating businesses plan- ning their next batch of orders together.Fundação para a Ciência e a Tecnologia, Portugal, under contract CONT DOUT/49/UNINOVA/0/5902/1/200
Image Forensics of High Dynamic Range Imaging

This paper introduces a novel area of research to the Image Forensic ﬁeld; identifying High Dynamic Range (HDR) digital images. We create a test set of images that are a combination of HDR and standard images of similar scenes. We also propose a scheme to isolate ﬁngerprints of the HDR-induced haloing artifact at “strong” edge positions, and present experimental results in extracting suitable features for a successful SVM-driven classiﬁcation of edges from HDR and standard images. A majority vote of this output is then utilised to complete a highly accurate classiﬁcation system
Improved termination analysis of CHR using self-sustainability analysis

Abstract. In the past few years, several successful approaches to termination
analysis of Constraint Handling Rules (CHR) have been proposed.
In parallel to these developments, for termination analysis of Logic Programs
(LP), recent work has shown that a stronger focus on the analysis
of the cycles in the strongly connected components (SCC) of the program
is very beneficial, both for precision and efficiency of the analysis.
In this paper we investigate the benefit of using the cycles of the SCCs of
CHR programs for termination analysis. It is a non-trivial task to define
the notion of a cycle for a CHR program. We introduce the notion of
a self-sustaining set of CHR rules and show that it provides a natural
counterpart for the notion of a cycle in LP. We prove that non-selfsustainability
of an SCC in a CHR program entails termination for all
queries to that SCC. Then, we provide an efficient way to prove that an
SCC of a CHR program is non-self-sustainable, providing an additional,
new way of proving termination of (part of) the program.
We integrate these ideas into the CHR termination analyser CHRisTA
and demonstrate by means of experiments that this extension signifi-
cantly improves both the efficiency and the performance of the analyser.status: publishe
Probabilistic termination of CHRiSM programs

Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog, and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is required. As far as we know, the termination of probabilistic logical programs has not received any attention in the community so far.

Termination of a probabilistic program is not a crisp notion. Given a query, such a program does not simply either terminate or not terminate, but it terminates with a certain probability.

In this paper, we explore this problem in the context of CHRiSM, a probabilistic extension of CHR. We formally introduce the notion of probabilistic termination. We study this concept on the basis of a number of case studies. We provide some initial sufficient conditions to characterize probabilistically terminating programs and queries. We also discuss some challenging examples that reveal the complexity and interest of more general settings. The paper is intended as a first step in a challenging and important new area in the analysis of Logic Programs.status: publishe
The Significance of the long lived (>400 Years) bivalve Arctica islandica as a high-resolution bioarchive

Information about past environmental conditions is preserved in the elemental signature of biogenic marine carbonates. Thus, trace element to calcium ratios (Me/Ca) of biogenic calcium carbonates, such as bivalve shells, are often used to reconstruct past environmental conditions at the time of carbonate formation (Foster et al., 2008). In this study, we examine the suitability of the long-lived (> 400 years) bivalve Arctica islandica as a high-resolution bioarchive by measuring Me/Ca ratios in the shell carbonate. Pb/Ca concentrations in A. islandica shells reflect anthropogenic gasoline lead consumption and further provide a centennial record of lead pollution for the collection site off the coast of Virginia, USA. With A. islandica shells from the North Sea we test the hypothesis that Ba/Ca and Mn/Ca ratios are indicators of the diatom abundance. Our results indicate that statistically both ratios correlate well with the diatom abundance, and yet, on a year-to-year base, there is no consistent reflection of diatom abundance patterns in the Ba/Ca and Mn/Ca annual profiles. These findings indicate that primary production affects Ba/Ca and Mn/Ca shell ratios, though we suggest that both elements are coupled to primary production through different processes and are affected by further, yet unknown processes
Geodesic Order Types

The geodesic between two points $a$ and $b$ in the interior of a simple
polygon~$P$ is the shortest polygonal path inside $P$ that connects $a$ to $b$.
It is thus the natural generalization of straight line segments on
unconstrained point sets to polygonal environments. In this paper we use this
extension to generalize the concept of the order type of a set of points in the
Euclidean plane to geodesic order types. In particular, we show that, for any
set $S$ of points and an ordered subset $\mathcal{B} \subseteq S$ of at least
four points, one can always construct a polygon $P$ such that the points of
$\mathcal{B}$ define the geodesic hull of~$S$ w.r.t.~$P$, in the specified
order. Moreover, we show that an abstract order type derived from the dual of
the Pappus arrangement can be realized as a geodesic order type.Comment: This paper was published in Algorithmica, September 2014, Volume 70,
  Issue 1, pp 112-12
Succinct Representations of Binary Trees for Range Minimum Queries

We provide two succinct representations of binary trees that can be used to represent the Cartesian tree of an array A of size n. Both the representations take the optimal 2n + o(n) bits of space in the worst case and support range minimum queries (RMQs) in O(1) time. The first one is a modification of the representation of Farzan and Munro (SWAT 2008); a consequence of this result is that we can represent the Cartesian tree of a random permutation in 1.92n + o(n) bits in expectation. The second one uses a well-known transformation between binary trees and ordinal trees, and ordinal tree operations to effect operations on the Cartesian tree. This provides an alternative, and more natural, way to view the 2D-Min-Heap of Fischer and Huen (SICOMP 2011). Furthermore, we show that the pre-processing needed to output the data structure can be performed in linear time using o(n) bits of extra working space, improving the result of Fischer and Heun who use n + o(n) bits working space.Peer-reviewedPost-print18th Annual International Computing and Combinatorics Conference (COCOON 2012), Sydney, Australi
Complementary vertices and adjacency testing in polytopes

Our main theoretical result is that, if a simple polytope has a pair of
complementary vertices (i.e., two vertices with no facets in common), then it
has at least two such pairs, which can be chosen to be disjoint. Using this
result, we improve adjacency testing for vertices in both simple and non-simple
polytopes: given a polytope in the standard form {x \in R^n | Ax = b and x \geq
0} and a list of its V vertices, we describe an O(n) test to identify whether
any two given vertices are adjacent. For simple polytopes this test is perfect;
for non-simple polytopes it may be indeterminate, and instead acts as a filter
to identify non-adjacent pairs. Our test requires an O(n^2 V + n V^2)
precomputation, which is acceptable in settings such as all-pairs adjacency
testing. These results improve upon the more general O(nV) combinatorial and
O(n^3) algebraic adjacency tests from the literature.Comment: 14 pages, 5 figures. v1: published in COCOON 2012. v2: full journal
  version, which strengthens and extends the results in Section 2 (see p1 of
  the paper for details
Understanding and managing process interaction in IS development projects

Published version of an article from the book: Nordic Contributions in IS Research. Also available on SpringerLink:http://dx.doi.org/10.1007/978-3-642-32270-9_2Software-based information systems must
be
developed and
implemented as a part of business change. This is a major challenge, since
business change and the development of software-based information systems
usually are performed in separate processes. Thus, there is a need to understand
and manage the relationship between these two kinds of processes. In this paper
we draw on a longitudinal case study. We suggest a framework to analyze the
case as interaction between software development processes and organizational
change processes. In the analysis we find that the framework enables us to
understand critical events in the case, what led to the events, and what the
consequences are. We discuss the implications for information systems research
and in particular we discuss the contribution to project management of iterative
and incremental software developmen
A Modeling Approach for the Extraction of Semantic Information from a Maritime Corpus

This paper introduces an algorithm for retrieving semantic information from a maritime corpus. The method is based on Natural Language Processing (NPL) and combines a segmentation of large documents with principles of a conceptual vector model (CVM) and synsets of words. This research is applied to the context of intelligent transport systems and maritime navigation. Based on documents regulating maritime traffic, this approach proposes an aid for navigational decision-making while significantly reducing the number of entities and relations required in the modeling process
Sexual Abuse-Current Medico-legal, Forensic and Psychiatric Aspects

Abstract\ud
\ud
\ud
Violence against women and minors is a worldwide problem that has not yet been sufficiently acknowledged. There are many obstacles especially when sexual abuses have to be evaluated. These problems are present both when victims of sexual abuse are evaluated and when sex offenders are dealt with, especially when the offenders are juvenile sex offenders (JSO).\ud
\ud
These issues give cause for great concern about prognosis, and the resulting psychosocial implications, and call for a special effort from the scientific community in identifying appropriate prevention and treatment methods.\ud
\ud
This chapter is divided into two parts. The first part deals with the forensic and psychiatric features, such as diagnostic and therapeutic/rehabilitative strategies for JSO, while the second part analyzes the legal–medicine aspects related to rape/sexual assault in a European context
A language of patterns for subterm selection

International audienceThis paper describes the language of patterns that equips the SSReflect proof shell extension for the Coq system. Patterns are used to focus proof commands on sub expressions of the conjecture under analysis in a declarative manner. They are designed to ease the writing of proof scripts and to increase their readability and maintainability. A pattern can identify the sub expression of interest approximating the sub expression itself, or its enclosing context or both. The user is free to choose the most convenient option. Patterns are matched following an extremely precise and predictable discipline, that is carefully designed to admit an efficient implementation. In this paper we report on the language of patterns, its matching algorithm and its usage in the formal library developed by the Mathematical Components team to support the verification of the Odd Order theorem
The Epoch of Reionization

The Universe's dark ages end with the formation of the first generation of
galaxies. These objects start emitting ultraviolet radiation that carves out
ionized regions around them. After a sufficient number of ionizing sources have
formed, the ionized fraction of the gas in the Universe rapidly increases until
hydrogen becomes fully ionized. This period, during which the cosmic gas went
from neutral to ionized, is known as the Universe's Epoch of Reionization . The
Epoch of Reionization is related to many fundamental questions in cosmology,
such as properties of the first galaxies, physics of (mini-)quasars, formation
of very metal-poor stars and a slew of other important research topics in
astrophysics. Hence uncovering it will have far reaching implications on the
study of structure formation in the early Universe. This chapter reviews the
current observational evidence for the occurrence of this epoch, its key
theoretical aspects and main characteristics, and finally the various
observational probes that promise to uncover it. A special emphasis is put on
the redshifted 21 cm probe, the various experiments that are currently being
either built or designed, and what we can learn from them about the Epoch of
Reionization.Comment: This book chapter provides a review of the current understanding of
  the Epoch of Reionization with emphasis on the redshifted 21 cm probe, 59
  pages, 26 figures, 234 references. To appear in "The First Galaxies -
  Theoretical Predictions and Observational Clues", 2012. Published by
  Springer, eds. T. Wiklind, B. Mobasher and V. Brom
Formation of the First Galaxies: Theory and Simulations

The properties of the first galaxies are shaped in large part by the first
generations of stars, which emit high energy radiation and unleash both large
amounts of mechanical energy and the first heavy elements when they explode as
supernovae. We survey the theory of the formation of the first galaxies in this
context, focusing on the results of cosmological simulations to illustrate a
number of the key processes that define their properties. We first discuss the
evolution of the primordial gas as it is incorporated into the earliest
galaxies under the influence of the high energy radiation emitted by the
earliest stars; we then turn to consider how the injection of heavy elements by
the first supernovae transforms the evolution of the primordial gas and alters
the character of the first galaxies. Finally, we discuss the prospects for the
detection of the first galaxies by future observational missions, in particular
focusing on the possibility that primordial star-forming galaxies may be
uncovered.Comment: 31 pages, 19 figures; chapter to appear in 'The First Galaxies -
  Theoretical Predictions and Observational Clues'; corrected typo in equation
  (32); some figures downgrade