pinecone/core-2020-05-10-deduplication huggingface dataset:
Automatically Recognising European Portuguese Children's Speech

This paper reports findings from an analysis of errors made by an automatic speech recogniser trained and tested with 3-10-year-old European Portuguese children's speech. We expected and were able to identify frequent pronunciation error patterns in the children's speech. Furthermore, we were able to correlate some of these pronunciation error patterns and automatic speech recognition errors. The findings reported in this paper are of phonetic interest  but will also be useful for improving the performance of automatic speech recognisers aimed at children representing the target population of the study
Comparing Semantic Relatedness between Word Pairs in Portuguese Using  Wikipedia

The growth of available data in digital format has been facilitating the development of new models to automatically infer the semantic similarity between word pairs. However, there are still many natural languages without sufficient resources to evaluate measures of semantic relatedness. In this paper we translated word pairs from a well-known baseline for evaluating semantic relatedness measures into Portuguese and performed a manual evaluation of each pair. We compared the correlation with similar datasets in other languages and generated LSA models from Wikipedia articles in order to verify the pertinence of each dataset and how semantic similarity conveys across languages
Improving Speech Recognition through Automatic Selection of Age Group Specific Acoustic Models

The acoustic models used by automatic speech recognisers are usually trained with speech collected from young to middle-aged adults. As the characteristics of speech change with age, such acoustic models tend to perform poorly on children's and elderly people's speech. In this study, we investigate whether the automatic age group classification of speakers, together with age group -specific acoustic models, could improve automatic speech recognition performance. We train an age group classifier with an accuracy of about 95% and show that using the results of the classifier to select age group -specific acoustic models for children and the elderly leads to considerable gains in automatic speech recognition performance, as compared with using acoustic models trained with young to middle-aged adults' speech for recognising their speech, as well
Corpus Creation and Perceptual Evaluation of Expressive Theatrical Gestures

International audienceWhile human communication involves rich, complex and expressive gestures, available corpora of captured motions used for the animation of virtual characters contain actions ranging from locomotion to everyday life motions. We aim at creating a novel corpus of expressive and meaningful gestures, and we focus on body movements and gestures involved in theatrical scenarios. In this paper we propose a methodology for building a corpus of full-body theatrical gestures based on a magician show enriched with affective content. We then validate the constructed corpus of theatrical gestures and sequences through several perceptual studies focusing on the complexity of the produced movements as well as the recognizability of the additional affective content
Dynamical Systems to Account for Turn-Taking in Spoken Interactions

International audienceTurn management is considered as essential for an Embodied Conversational Agent (ECA) to increase user’s engagement. This article presents a dynamical model for turn management in dyadic interactions. The model is a system of differential equations that mixes two models from the cognitive sciences, the Drift Diffusion Model, and the Behavioral Dynamics. Decision-making and the control of actions are two coupled processes that modulate continuously the behavior of the interacting agent. This conceptual model accounts for the emer- gence of smooth transitions without using neither prediction nor planning of the agent’s behavior. The objective was not to obtain a fully realistic behavior, but to show how the model could account for the main qualitative properties of turn management, such as interrupting the current speaker, signaling its willingness to go on speaking, or yielding the turn to the next speaker
A normal-distribution based reputation model

Rating systems are used by many websites, which allow customers to rate available items according to their own experience. Subsequently, reputation models are used to aggregate available ratings in order to generate reputation scores for items. A problem with current reputation models is that they provide solutions to enhance accuracy of sparse datasets not thinking of their models performance over dense datasets. In this paper, we propose a novel reputation model to generate more accurate reputation scores for items using any dataset; whether it is dense or sparse. Our proposed model is described as a weighted average method, where the weights are generated using the normal distribution. Experiments show promising results for the proposed model over state-of-the-art ones on sparse and dense datasets
SYMMETRIC SPACES AND THE KASHIWARA-VERGNE METHOD

International audienceAbstractThe Kashiwara-Vergne method reduces the proof of a deep result in analysison a Lie group (transferring convolution of invariant distributions from thegroup to its Lie algebra, by means of the exponential mapping) to checkingtwo formal Lie brackets identities linked to the Campbell-Hausdor§ formula.First, we expound this method and a proof, for quadratic or solvable Liealgebras, of the Kashiwara-Vergne conjecture allowing to apply the methodto those cases.We then extend it to a general symmetric spaceS=G=H. This leads tointroduce a functione(X;Y)of two tangent vectorsX;Yat the origin ofS,allowing to make explicit, in the exponential chart,G-invariant di§erentialoperators ofS, the structure of the algebra of all such operators, and anexpansion of mean value operators and spherical functions. For Riemanniansymmetric spaces of the noncompact type, otherwise well-known from thework of Harish-Chandra and Helgason, we compare this approach with theclassical one. For rank one spaces (the hyperbolic spaces), we give an explicitformula fore(X;Y).Finally, we explain a construction ofefor a general symmetric space bymeans of Lie series linked to the Campbell-Hausdor§ formula, in the spirit ofthe original Kashiwara-Vergne method. Proved from this construction, themain properties ofethus link the fundamental tools ofH-invariant analysison a symmetric space to its inÖnitesimal structure.The results extend to line bundles over symmetric space
Cleft Extensions and Quotients of Twisted Quantum Doubles

Given a pair of finite groups $F, G$ and a normalized 3-cocycle $\omega$ of
$G$, where $F$ acts on $G$ as automorphisms, we consider quasi-Hopf algebras
defined as a cleft extension $\Bbbk^G_\omega\#_c\,\Bbbk F$ where $c$ denotes
some suitable cohomological data. When $F\rightarrow \overline{F}:=F/A$ is a
quotient of $F$ by a central subgroup $A$ acting trivially on $G$, we give
necessary and sufficient conditions for the existence of a surjection of
quasi-Hopf algebras and cleft extensions of the type $\Bbbk^G_\omega\#_c\,
\Bbbk F\rightarrow \Bbbk^G_\omega\#_{\overline{c}} \, \Bbbk \overline{F}$. Our
construction is particularly natural when $F=G$ acts on $G$ by conjugation, and
$\Bbbk^G_\omega\#_c \Bbbk G$ is a twisted quantum double $D^{\omega}(G)$. In
this case, we give necessary and sufficient conditions that
Rep($\Bbbk^G_\omega\#_{\overline{c}} \, \Bbbk \overline{G}$) is a modular
tensor category.Comment: LaTex; 14 page
Key management for onion routing in a true peer to peer setting

Onion routing is a technique for anonymous and privacy preserving communication at the base of popular Internet anonymity tools such as Tor. In onion routing, traffic is relayed by a number of intermediary nodes (called relays) before it reaches the intended destination. To guarantee privacy and prevent tampering, each packet is encrypted multiple times in a layered manner, using the public keys of the relays. Therefore, this mechanism makes two important assumptions: first, that the relays are able to communicate with each other; second, that the user knows the list of available relays and their respective public keys. Tor implements therefore a distributed directory listing the relays and their keys. When a user is not able to communicate with relays directly, he has to use special bridge servers to connect to the onion network. This construction, however, does not work in a fully peer to peer setting, where each peer only knows a limited number of other peers and may not be able to communicate with some of them due, for instance, to NAT or firewalls. In this paper we propose a key management scheme for onion routing that overcomes these problems. The proposed solution does not need a directory system and does not imply knowledge of all active relays, while it guarantees the secure distribution of public keys. We also present an alternative strategy for building circuit of relays based on bloom filters. The proposed construction overcomes some of the structural inefficiencies of the Tor design, and opens the way for implementing onion routing over a true peer to peer overlay network
Robust and efficient large-large table outer joins on distributed infrastructures.

Outer joins are ubiquitous in many workloads but are sensitive to load-balancing problems. Current approaches mitigate such problems caused by data skew by using (partial) replication. However, contemporary replication-based approaches (1) introduce overhead, since they usually result in redundant data movement, (2) are sensitive to parameter tuning and value of data skew and (3) typically require that one side is small. In this paper, we propose a novel parallel algorithm, Redistribution and Efficient Query with Counters (REQC), aimed at robustness in terms of size of join sides, variation in skew and parameter tuning. Experimental results demonstrate that our algorithm is faster, more robust and less demanding in terms of network bandwidth, compared to the state-of-the-art
Performance Measurement and Analysis of Transactional Memory and Speculative Execution on IBM Blue Gene/Q

The core count of modern processors is steadily increasing, forcing programmers to use more concurrent threads or tasks to effectively use the available hardware. This in turn makes it increasingly challenging to achieve correct and efficient thread synchronization. To support the programmer in this task, IBM introduced hardware transactional memory (TM) and speculative execution (SE) in their Blue Gene/Q system with its 16-core processor, which permits to run 64 simultaneous hardware threads in SMT mode. TM and SE allow for parallelization when race conditions may happen, however upon their detection the respective parts of the execution are rolled back and re-executed serially. This incurs some overhead and therefore usage must be well justified. In this paper, we describe extensions to the community instrumentation and measurement infrastructure Score-P, allowing developers to instrument, measure, and analyze applications. To our knowledge, this is the first integrated performance tool framework allowing to analyze TM/SE programs. We demonstrate its usefulness and effectiveness by describing experiments with benchmarks and a real-world application
Generic Deterministic Random Number Generation in Dynamic-Multithreaded Platforms

International audienceOn dynamic multithreaded platforms with on-line scheduling such as work-stealing, randomized computations raise the issue of repro-ducibility. Compliant with de facto standard sequential Deterministic Random Number Generators (DRNGs) noted R, we propose a parallel DRNG implementation for finite computations that provides determinis-tic parallel execution. It uses the stateless sub-stream approach, enabling the use of efficient DRNG such as Mersenne Twister or Linear Congru-ential. We demonstrate that if R provides fast jump ahead in the random sequence, the re-seeding overhead is small, polylog in expectation, inde-pendently from the parallel computation's depth. Experiments bench-mark the performance of randomized algorithms employing our solution against the stateful DRNG DotMix, tailored to the Cilk Plus dynamic multithreading runtime. The overhead of our implementation ParDRNG<R> compares favorably to the linear overhead of DotMix re-seedings
GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics

Large scale graph processing is a major research area for Big Data
exploration. Vertex centric programming models like Pregel are gaining traction
due to their simple abstraction that allows for scalable execution on
distributed systems naturally. However, there are limitations to this approach
which cause vertex centric algorithms to under-perform due to poor compute to
communication overhead ratio and slow convergence of iterative superstep. In
this paper we introduce GoFFish a scalable sub-graph centric framework
co-designed with a distributed persistent graph storage for large scale graph
analytics on commodity clusters. We introduce a sub-graph centric programming
abstraction that combines the scalability of a vertex centric approach with the
flexibility of shared memory sub-graph computation. We map Connected
Components, SSSP and PageRank algorithms to this model to illustrate its
flexibility. Further, we empirically analyze GoFFish using several real world
graphs and demonstrate its significant performance improvement, orders of
magnitude in some cases, compared to Apache Giraph, the leading open source
vertex centric implementation.Comment: Under review by a conference, 201
Power-aware replica placement in tree networks with multiple servers per client

International audienceIn this paper, we revisit the well-studied problem of replica placement in tree networks. Rather than minimizing the number of servers needed to serve all client requests, we aim at minimizing the total power consumed by these servers. In addition, we use the most general (and powerful) server assignment policy, where the requests of a client can be served by multiple servers located in the (unique) path from this client to the root of the tree. We consider multi-modal servers that can operate at a set of discrete speeds, using the dynamic voltage and frequency scaling (DVFS) technique. The optimization problem is to determine an optimal location of the servers in the tree, as well as the speed at which each server is operated. A major result is the NP-completeness of this problem, to be contrasted with the minimization of the number of servers, which has polynomial complexity. Another important contribution is the formulation of a Mixed Integer Linear Program (MILP) for the problem, together with the design of several polynomial-time heuristics. We assess the efficiency of these heuristics by simulation. For mid-size instances (up to 30 nodes in the tree), we evaluate their absolute performance by comparison with the optimal solution (obtained via the MILP). The most efficient heuristics provide satisfactory results, within 20% of the optimal solution
Simulation of L2 Cache Separation Impact in CPU Performance

Cache memory performance is very important in the overall performance of modern CPUs. One of the many techniques used to improve it is the split of on-chip cache memory in two separate Instruction and Data caches. The current CPU organizations usually have per core separate L1 caches and unified L2 caches. This paper presents the results of simulating different CPU organizations with unified and separate L2 Instruction and Data caches using Marss-x86, a Cycle-Accurate full system simulator. The results indicate that separating the L2 cache memory provides higher overall CPU IPC. The highest improvement is 3% and is achieved in a quad-core CPU model with shared L3 cache. Analyzing the hardware costs and complications of separating L2 cache might be an interesting future work direction
Sensing Subjective Well-being from Social Media

Subjective Well-being(SWB), which refers to how people experience the quality
of their lives, is of great use to public policy-makers as well as economic,
sociological research, etc. Traditionally, the measurement of SWB relies on
time-consuming and costly self-report questionnaires. Nowadays, people are
motivated to share their experiences and feelings on social media, so we
propose to sense SWB from the vast user generated data on social media. By
utilizing 1785 users' social media data with SWB labels, we train machine
learning models that are able to "sense" individual SWB from users' social
media. Our model, which attains the state-by-art prediction accuracy, can then
be used to identify SWB of large population of social media users in time with
very low cost.Comment: 12 pages, 1 figures, 2 tables, 10th International Conference, AMT
  2014, Warsaw, Poland, August 11-14, 2014. Proceeding
Analysis of Indirect Measurement of Cutting Forces Turning Metal Cylindrical Shells

Cutting forces measurement is an important component of the ma- chining processes development and control. The use of conventional direct meas- urement systems is often impossible as they interfere in the process’s dynamics. This work proposes a method of cutting force indirect estimation during turning thin-walled cylindrical shells. Calculation of the flexibility matrix has enabled us to relate measured displacements of certain workpiece’s points to the cutting force. An optimization approach for choosing the measurement points location has been proposed, based on the best conditioning of the flexibility matrix
Shintani functions, real spherical manifolds, and symmetry breaking
  operators

For a pair of reductive groups $G \supset G'$, we prove a geometric criterion
for the space $Sh(\lambda, \nu)$ of Shintani functions to be finite-dimensional
in the Archimedean case.
  This criterion leads us to a complete classification of the symmetric pairs
$(G,G')$ having finite-dimensional Shintani spaces.
  A geometric criterion for uniform boundedness of $dim Sh(\lambda, \nu)$ is
also obtained.
  Furthermore, we prove that symmetry breaking operators of the restriction of
smooth admissible representations yield Shintani functions of moderate growth,
of which the dimension is determined for $(G, G') = (O(n+1,1), O(n,1))$.Comment: to appear in Progress in Mathematics, Birkhause
Groupoids, Frobenius algebras and Poisson sigma models

In this paper we discuss some connections between groupoids and Frobenius
algebras specialized in the case of Poisson sigma models with boundary. We
prove a correspondence between groupoids in the category Set and relative
Frobenius algebras in the category Rel, as well as an adjunction between a
special type of semigroupoids and relative H*-algebras. The connection between
groupoids and Frobenius algebras is made explicit by introducing what we called
weak monoids and relational symplectic groupoids, in the context of Poisson
sigma models with boundary and in particular, describing such structures in the
ex- tended symplectic category and the category of Hilbert spaces. This is part
of a joint work with Alberto Cattaneo and Chris Heunen.Comment: 12 pages, 1 figure. To appear in "Mathematical Aspects of Quantum
  Field Theories". Mathematical Physical Studies, Springer. Proceedings of the
  Winter School in Mathematical Physics, Les Houges, 201
Lectures on mathematical aspects of (twisted) supersymmetric gauge
  theories

Supersymmetric gauge theories have played a central role in applications of
quantum field theory to mathematics. Topologically twisted supersymmetric gauge
theories often admit a rigorous mathematical description: for example, the
Donaldson invariants of a 4-manifold can be interpreted as the correlation
functions of a topologically twisted N=2 gauge theory. The aim of these
lectures is to describe a mathematical formulation of partially-twisted
supersymmetric gauge theories (in perturbation theory). These partially twisted
theories are intermediate in complexity between the physical theory and the
topologically twisted theories. Moreover, we will sketch how the operators of
such a theory form a two complex dimensional analog of a vertex algebra.
Finally, we will consider a deformation of the N=1 theory and discuss its
relation to the Yangian, as explained in arXiv:1308.0370 and arXiv:1303.2632.Comment: Notes from a lecture series by the first author at the Les Houches
  Winter School on Mathematical Physics in 2012. To appear in the proceedings
  of this conference. Related to papers arXiv:1308.0370, arXiv:1303.2632, and
  arXiv:1111.423
Snapshots of Conformal Field Theory

In snapshots, this exposition introduces conformal field theory, with a focus
on those perspectives that are relevant for interpreting superconformal field
theory by Calabi-Yau geometry. It includes a detailed discussion of the
elliptic genus as an invariant which certain superconformal field theories
share with the Calabi-Yau manifolds. K3 theories are (re)viewed as prime
examples of superconformal field theories where geometric interpretations are
known. A final snapshot addresses the K3-related Mathieu Moonshine phenomena,
where a lead role is predicted for the chiral de Rham complex.Comment: 43 pages; contribution to "Mathematical Aspects of Quantum Field
  Theories", Mathematical Physics Studies, Springer; v2: typos corrected,
  references added and update
A higher stacky perspective on Chern-Simons theory

The first part of this text is a gentle exposition of some basic
constructions and results in the extended prequantum theory of
Chern-Simons-type gauge field theories. We explain in some detail how the
action functional of ordinary 3d Chern-Simons theory is naturally localized
("extended", "multi-tiered") to a map on the universal moduli stack of
principal connections, a map that itself modulates a circle-principal
3-connection on that moduli stack, and how the iterated transgressions of this
extended Lagrangian unify the action functional with its prequantum bundle and
with the WZW-functional. In the second part we provide a brief review and
outlook of the higher prequantum field theory of which this is a first example.
This includes a higher geometric description of supersymmetric Chern- Simons
theory, Wilson loops and other defects, generalized geometry, higher Spin
structures, anomaly cancellation, and various other aspects of quantum field
theory.Comment: final version; exposition improved; a few typos corrected; 54 page
MACOC: A medoid-based ACO clustering algorithm

Proceedings of 9th International Conference, ANTS 2014, Brussels, Belgium, September 10-12, 2014.he final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09952-1_11The application of ACO-based algorithms in data mining is growing over the last few years and several supervised and unsupervised learning algorithms have been developed using this bio-inspired approach. Most recent works concerning unsupervised learning have been focused on clustering, showing great potential of ACO-based techniques. This work presents an ACO-based clustering algorithm inspired by the ACO Clustering (ACOC) algorithm. The proposed approach restructures ACOC from a centroid-based technique to a medoid-based technique, where the properties of the search space are not necessarily known. Instead, it only relies on the information about the distances amongst data. The new algorithm, called MACOC, has been compared against well-known algorithms (K-means and Partition Around Medoids) and with ACOC. The experiments measure the accuracy of the algorithm for both synthetic datasets and real-world datasets extracted from the UCI Machine Learning Repository.This work has been partly supported by: Spanish Ministry
of Science and Education under project TIN2010-19872 and Savier – an Airbus
Defense & Space project (FUAM-076914 and FUAM-076915)