Search results for "DPR"
showing 10 items of 303 documents
Combining gestures and vocalizations to imitate sounds
2015
International audience; Communicating about sounds is a difficult task without a technical language, and naïve speakers often rely on different kinds of non-linguistic vocalizations and body gestures (Lemaitre et al. 2014). Previous work has independently studied how effectively people describe sounds with gestures or vocalizations (Caramiaux, 2014, Lemaitre and Rocchesso, 2014). However, speech communication studies suggest a more intimate link between the two processes (Kendon, 2004). Our study thus focused on the combination of manual gestures and non-speech vocalizations in the communication of sounds. We first collected a large database of vocal and gestural imitations of a variety of …
Technical Note: Prediction Models of Airborne Sound Insulation of Multilayer Materials with Viscoelastic Thin Sheets
2008
The growing introduction of new insulation materials in building acoustics has caused an increase of the importance of the prediction tools. Appropriate simulations allow strictly necessary laboratory measurements to be identified. In this way, costs are reduced. The demands of new legislation has resulted in the appearance of various software designed to facilitate prediction. The prediction models are based on different hypotheses: adaptation of impedances, spatial behaviour of spectral components, statistical energy distribution, the Finite Element Method (FEM), etc. Each of these models and methods offer advantages and contain limitations. In this paper, different models for prediction…
Path Following in Non-Visual Conditions.
2018
Path-following tasks have been investigated mostly under visual conditions, that is when subjects are able to see both the path and the tool, or limb, used for navigation. Moreover, only basic path shapes are usually adopted. In the present experiment, participants must rely exclusively on continuous, non-speech, and ecological auditory and vibrotactile cues to follow a path on a flat surface. Two different, asymmetric path shapes were tested. Participants navigated by moving their index finger over a surface sensing position and force. Results show that the different non-visual feedback modes did not affect the task's accuracy, yet they affected its speed, with vibrotactile feedback causin…
Temporal Structure of Human Gaze Dynamics Is Invariant During Free Viewing.
2015
We investigate the dynamic structure of human gaze and present an experimental study of the frequency components of the change in gaze position over time during free viewing of computer-generated fractal images. We show that changes in gaze position are scale-invariant in time with statistical properties that are characteristic of a random walk process. We quantify and track changes in the temporal structure using a well-defined scaling parameter called the Hurst exponent, H. We find H is robust regardless of the spatial complexity generated by the fractal images. In addition, we find the Hurst exponent is invariant across all participants, including those with distinct changes to higher or…
Daudznacionālu uzņēmumu ietekme uz personu privātumu
2021
Šī pētījuma mērķis ir izpētīt korelāciju starp patērētāju datu privātumu un starptautisko uzņēmumu priekšrocībām un to, kā tas ietekmē patērētāju privātumu. Autors apkopo un analizē teorētisko pamatu, izmantojot daudzus zinātniskus rakstus un žurnālus. Pēc tam pētnieka mērķis ir veikt aptauju starp 109 respondentiem, lai apkopotu ieskatu par to, cik plaši patērētāji rūpējas par savu vispārējo privātumu no starptautiskiem uzņēmumiem un cik labi starptautiski uzņēmumi respektē vai aizsargā savu klientu privātumu no digitālās attīstības. Tehnoloģijas patērētāji ir izrādījuši mazāku interesi aizsargāt savu privātumu, jo liela daļa informācijas tiek saglabāta internetā un citos avotos, pamatojot…
Dynamic 2- and 3-connectivity on planar graphs
1992
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).
Anion Recognition by a Bioactive Diureidodecalin Anionophore: Solid-State, Solution, and Computational Studies
2018
Recent work has identified a bis-(p-nitrophenyl)ureidodecalin anion carrier as a promising candidate for biomedical applications, showing good activity for chloride transport in cells yet almost no cytotoxicity. To underpin further development of this and related compounds, a detailed structural and binding investigation is reported. Crystal structures of the transporter as five solvates confirm the diaxial positioning of urea groups while revealing a degree of conformational flexibility. Structures of complexes with Cl−, Br−, NO3 −, SO4 2− and AcO−, supported by computational studies, show how the binding site can adapt to accommodate these anions. 1H NMR binding studies revealed exception…
Children’s Engagement with Mathematics in Kindergarten Mediated by the Use of Digital Tools
2013
The purpose of this chapter is to study children’s engagement with mathematics in kindergarten mediated by digital tools within the context of interactive whiteboard (IWB). Our study reports from a research project aiming at analysing in what ways digital tools may nurture children’s appropriation processes relative to mathematics. In adopting a sociocultural perspective on learning and development, observations together with video recordings have been analysed. Our study shows that the children make sense of the digital tools and are able to apply the tools purposefully due to the interaction with an adult within the zone of proximal development (ZPD). The children externalise their reason…
Optimal Guard Placement Problem Under L-Visibility
2006
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al [4]. addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
Dance to your own drum: Identification of musical genre and individual dancer from motion capture using machine learning
2020
Machine learning has been used to accurately classify musical genre using features derived from audio signals. Musical genre, as well as lower-level audio features of music, have also been shown to...