Search results for " Speech"
showing 10 items of 519 documents
Measurement of ultra-low heating rates of a single antiproton in a cryogenic Penning trap
2019
Physical review letters 122(4), 043201 (2019). doi:10.1103/PhysRevLett.122.043201
Bearing fault detection for drivetrains using adaptive filters based wavelet transform
2017
Predicting a localized defect on a rolling bearing during the degradation process before a complete failure is crucial to prevent system failures, unscheduled downtimes and substantial loss of productivity. During this process, impulses associated with the fault are weak, nonstationary or time-frequency varying, and contaminated by noises, which render the problem of extracting these impulses very difficult. This work investigates the effectiveness of common signal processing techniques on predicting incipient faults, e.g. Fast Fourier transform, Short-Time Fourier transform, Wavelet transform. It was found that an adaptive filter is required to enhance and reconstruct the signals during th…
Sarraute's plays : poplyphony and enunciation
2014
The corpus is formed of six plays of Nathalie Sarraute; it hides a duplication of enunciation types in the characters’ dialogue. This duplication is latent due to personal pronouns and verb tenses’ neutralization. The transition from an enunciation layer to another is not marked at all or not traditionally marked. Therefore, deciphering will be more complicated to any reader, listener or spectator. These works of art are also highly polyphonic in terms of enunciation as in semantics, as several voices are intertwined and as the characters resort to authorities of point of view. Thus, readers, listeners and spectators should identify enunciation sources and “other” authorities of point of vi…
Genre-adaptive Semantic Computing and Audio-based Modelling for Music Mood Annotation
2016
This study investigates whether taking genre into account is beneficial for automatic music mood annotation in terms of core affects valence, arousal, and tension, as well as several other mood scales. Novel techniques employing genre-adaptive semantic computing and audio-based modelling are proposed. A technique called the ACTwg employs genre-adaptive semantic computing of mood-related social tags, whereas ACTwg-SLPwg combines semantic computing and audio-based modelling, both in a genre-adaptive manner. The proposed techniques are experimentally evaluated at predicting listener ratings related to a set of 600 popular music tracks spanning multiple genres. The results show that ACTwg outpe…
METALANG. Protocolo franco-español de exploración de habilidades metalingüísticas en niños de 6 a 9 años: un estudio preliminar
2012
International audience; In this work are described the principles of functional-pragmatic and the reasons for developing an exploration protocol for natural metalinguistic abilities. This study explains the base hypothesis and structure of METALANG protocol. This protocol consists in a Test and a Questionnaire for parents with two different scales: A = Ability, B = Frequency. Each element of the protocol has 6 sections and 40 items. It is performed a preliminary contrast with 12 subjects aged 6 to 9 years. Among the 12 subjects, 4 were diagnosed with dysphasia. METALANG shows high scores in reliability and internal consistency. This result confirms the hypothesis that it is possible a joint…
Inducing the Lyndon Array
2019
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space, where $n$ is the length of the text and $\sigma$ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use $O(n)$ words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not onl…
Environment Sound Classification using Multiple Feature Channels and Attention based Deep Convolutional Neural Network
2020
In this paper, we propose a model for the Environment Sound Classification Task (ESC) that consists of multiple feature channels given as input to a Deep Convolutional Neural Network (CNN) with Attention mechanism. The novelty of the paper lies in using multiple feature channels consisting of Mel-Frequency Cepstral Coefficients (MFCC), Gammatone Frequency Cepstral Coefficients (GFCC), the Constant Q-transform (CQT) and Chromagram. Such multiple features have never been used before for signal or audio processing. And, we employ a deeper CNN (DCNN) compared to previous models, consisting of spatially separable convolutions working on time and feature domain separately. Alongside, we use atten…
An Open-set Recognition and Few-Shot Learning Dataset for Audio Event Classification in Domestic Environments
2020
The problem of training with a small set of positive samples is known as few-shot learning (FSL). It is widely known that traditional deep learning (DL) algorithms usually show very good performance when trained with large datasets. However, in many applications, it is not possible to obtain such a high number of samples. In the image domain, typical FSL applications include those related to face recognition. In the audio domain, music fraud or speaker recognition can be clearly benefited from FSL methods. This paper deals with the application of FSL to the detection of specific and intentional acoustic events given by different types of sound alarms, such as door bells or fire alarms, usin…
Cyclic Complexity of Words
2014
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem to the setting of cyclic complexity by showing that a word is ultimately periodic if and only if it has bounded cyclic complexity. Unlike most complexity functions, cyclic complexity distinguishes between Sturmian words of different slopes. We prove that if $x$ is a Sturmian word and $y$ is a word having the same cyclic complexity of $x,$ then up to renaming letters, $x$ and $y$ have the same set of factors. In particular, $y$ is also Sturmian of slope equ…
Quantum, stochastic, and pseudo stochastic languages with few states
2014
Stochastic languages are the languages recognized by probabilistic finite automata (PFAs) with cutpoint over the field of real numbers. More general computational models over the same field such as generalized finite automata (GFAs) and quantum finite automata (QFAs) define the same class. In 1963, Rabin proved the set of stochastic languages to be uncountable presenting a single 2-state PFA over the binary alphabet recognizing uncountably many languages depending on the cutpoint. In this paper, we show the same result for unary stochastic languages. Namely, we exhibit a 2-state unary GFA, a 2-state unary QFA, and a family of 3-state unary PFAs recognizing uncountably many languages; all th…