564 research outputs found

    Recognizing Speech in a Novel Accent: The Motor Theory of Speech Perception Reframed

    Get PDF
    The motor theory of speech perception holds that we perceive the speech of another in terms of a motor representation of that speech. However, when we have learned to recognize a foreign accent, it seems plausible that recognition of a word rarely involves reconstruction of the speech gestures of the speaker rather than the listener. To better assess the motor theory and this observation, we proceed in three stages. Part 1 places the motor theory of speech perception in a larger framework based on our earlier models of the adaptive formation of mirror neurons for grasping, and for viewing extensions of that mirror system as part of a larger system for neuro-linguistic processing, augmented by the present consideration of recognizing speech in a novel accent. Part 2 then offers a novel computational model of how a listener comes to understand the speech of someone speaking the listener's native language with a foreign accent. The core tenet of the model is that the listener uses hypotheses about the word the speaker is currently uttering to update probabilities linking the sound produced by the speaker to phonemes in the native language repertoire of the listener. This, on average, improves the recognition of later words. This model is neutral regarding the nature of the representations it uses (motor vs. auditory). It serve as a reference point for the discussion in Part 3, which proposes a dual-stream neuro-linguistic architecture to revisits claims for and against the motor theory of speech perception and the relevance of mirror neurons, and extracts some implications for the reframing of the motor theory

    A bilevel uncapacitated location/pricing problem with Hotelling access costs in one-dimensional space

    Get PDF
    We formulate a spatial pricing problem as bilevel non-capacitated location: A leader first decides which facilities to open and sets service prices taking competing offers into account; then, customers make individual decisions minimizing individual costs that include access charges in the spirit of Hotelling. Both leader and customers are assumed to be risk-neutral. For non-metric costs (i.e., when access costs do not satisfy the triangle inequality), the problem is NP-hard even if facilities can be opened at no fixed cost. We describe an algorithm for solving the Euclidean 1-dimensional case (i.e., with access cost defined by the Euclidean norm on a line) with fixed opening costs and a single competing facility

    Random Walks in Local Dynamics of Network Losses

    Get PDF
    We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt transition from exponentially small to finite losses as the data arrival rate increases. The critical point is characterized by strong fluctuations of the loss rate. Although we consider the packet arrival being a Markovian process, the loss rate exhibits non-Markovian power-law correlations in time at the critical point.Comment: 4 pages, 2 figure

    Temporal Correlations of Local Network Losses

    Get PDF
    We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {\em By construction}, the model has critical behavior with a sharp transition from exponentially small to finite losses with increasing data arrival rate. We show that such a model exhibits strong fluctuations in the loss rate at the critical point and non-Markovian power-law correlations in time, in spite of the Markovian character of the data arrival process. The continuum model allows for rather general incoming data packet distributions and can be naturally generalized to consider the buffer server idleness statistics

    Analysis of Oscillator Neural Networks for Sparsely Coded Phase Patterns

    Full text link
    We study a simple extended model of oscillator neural networks capable of storing sparsely coded phase patterns, in which information is encoded both in the mean firing rate and in the timing of spikes. Applying the methods of statistical neurodynamics to our model, we theoretically investigate the model's associative memory capability by evaluating its maximum storage capacities and deriving its basins of attraction. It is shown that, as in the Hopfield model, the storage capacity diverges as the activity level decreases. We consider various practically and theoretically important cases. For example, it is revealed that a dynamically adjusted threshold mechanism enhances the retrieval ability of the associative memory. It is also found that, under suitable conditions, the network can recall patterns even in the case that patterns with different activity levels are stored at the same time. In addition, we examine the robustness with respect to damage of the synaptic connections. The validity of these theoretical results is confirmed by reasonable agreement with numerical simulations.Comment: 23 pages, 11 figure

    On Multifractal Structure in Non-Representational Art

    Get PDF
    Multifractal analysis techniques are applied to patterns in several abstract expressionist artworks, paintined by various artists. The analysis is carried out on two distinct types of structures: the physical patterns formed by a specific color (``blobs''), as well as patterns formed by the luminance gradient between adjacent colors (``edges''). It is found that the analysis method applied to ``blobs'' cannot distinguish between artists of the same movement, yielding a multifractal spectrum of dimensions between about 1.5-1.8. The method can distinguish between different types of images, however, as demonstrated by studying a radically different type of art. The data suggests that the ``edge'' method can distinguish between artists in the same movement, and is proposed to represent a toy model of visual discrimination. A ``fractal reconstruction'' analysis technique is also applied to the images, in order to determine whether or not a specific signature can be extracted which might serve as a type of fingerprint for the movement. However, these results are vague and no direct conclusions may be drawn.Comment: 53 pp LaTeX, 10 figures (ps/eps

    Neurophysiology

    Get PDF
    Contains reports on seven research projects.Bell Telephone Laboratories, IncorporatedNational Institutes of HealthTeagle Foundation, IncorporatedUnited States Air Force (WADD Contract AF33(616)-7783

    Toward a Motor Theory of Sign Language Perception

    Get PDF
    Researches on signed languages still strongly dissociate lin- guistic issues related on phonological and phonetic aspects, and gesture studies for recognition and synthesis purposes. This paper focuses on the imbrication of motion and meaning for the analysis, synthesis and evaluation of sign language gestures. We discuss the relevance and interest of a motor theory of perception in sign language communication. According to this theory, we consider that linguistic knowledge is mapped on sensory-motor processes, and propose a methodology based on the principle of a synthesis-by-analysis approach, guided by an evaluation process that aims to validate some hypothesis and concepts of this theory. Examples from existing studies illustrate the di erent concepts and provide avenues for future work.Comment: 12 pages Partiellement financ\'e par le projet ANR SignCo

    A Markovian event-based framework for stochastic spiking neural networks

    Full text link
    In spiking neural networks, the information is conveyed by the spike times, that depend on the intrinsic dynamics of each neuron, the input they receive and on the connections between neurons. In this article we study the Markovian nature of the sequence of spike times in stochastic neural networks, and in particular the ability to deduce from a spike train the next spike time, and therefore produce a description of the network activity only based on the spike times regardless of the membrane potential process. To study this question in a rigorous manner, we introduce and study an event-based description of networks of noisy integrate-and-fire neurons, i.e. that is based on the computation of the spike times. We show that the firing times of the neurons in the networks constitute a Markov chain, whose transition probability is related to the probability distribution of the interspike interval of the neurons in the network. In the cases where the Markovian model can be developed, the transition probability is explicitly derived in such classical cases of neural networks as the linear integrate-and-fire neuron models with excitatory and inhibitory interactions, for different types of synapses, possibly featuring noisy synaptic integration, transmission delays and absolute and relative refractory period. This covers most of the cases that have been investigated in the event-based description of spiking deterministic neural networks
    • …
    corecore