Search results for "coding"
showing 10 items of 920 documents
La Cualidad del apego infantil y sensibilidad materna desde la perspectiva microsofial [The quality of attachment in childhood and maternal sensivity…
2011
Research in the area of early mother-child interaction and the development of attachment, points to the importance of advancing the study of the maternal sensitivity construct. In this pa per we describe the process followed to opera cionalise and analyze “maternal sensitivity” us ing microsocial approach. This approach can reveal empirical sequential patterns in the in teractional dyadic context that cannot be cap tured with rating scales. To describe the re search process used, this paper presents: the CITMI-R ( Codigos de Interaccion Temprana Materno-Infantil , Early Mother ‐Child Interac tion Codes) coding system and its developments, some relevant findings using sequential analyses in …
Space counts! Brain correlates of spatial and numerical representations in synaesthesia
2018
Over-learned semantic representations, such as numbers, are strongly associated with space in normal cognition, and in the phenomenon called number-space synaesthesia. In number-space synaesthesia, numbers are linked to spatial locations in an idiosyncratic way. Synaesthetes report numbers as belonging to a specific location, or feelings that a specific location is the right location for that number. What does really differentiate synaesthetes from non-synaesthetes with respect to their number-space representation? Here we present a number-space synaesthete, MkM, whose number-space representation dramatically differs from that of controls. We examined the impact of spatial distance with res…
Active spike transmission in the neuron model with a winding threshold manifold
2012
International audience; We analyze spiking responses of excitable neuron model with a winding threshold manifold on a pulse stimulation. The model is stimulated with external pulse stimuli and can generate nonlinear integrate-and-fire and resonant responses typical for excitable neuronal cells (all-or-none). In addition we show that for certain parameter range there is a possibility to trigger a spiking sequence with a finite number of spikes (a spiking message) in the response on a short stimulus pulse. So active transformation of N incoming pulses to M (with M>N) outgoing spikes is possible. At the level of single neuron computations such property can provide an active "spike source" comp…
Do Grading Gray Stimuli Help to Encode Letter Position?
2021
Numerous experiments in the past decades recurrently showed that a transposed-letter pseudoword (e.g., JUGDE) is much more wordlike than a replacement-letter control (e.g., JUPTE). Critically, there is an ongoing debate as to whether this effect arises at a perceptual level (e.g., perceptual uncertainty at assigning letter position of an array of visual objects) or at an abstract language-specific level (e.g., via a level of “open bigrams” between the letter and word levels). Here, we designed an experiment to test the limits of perceptual accounts of letter position coding. The stimuli in a lexical decision task were presented either with a homogeneous letter intensity or with a graded gra…
Distributed Pseudo-Gossip Algorithm and Finite-Length Computational Codes for Efficient In-Network Subspace Projection
2013
In this paper, we design a practical power-efficient algorithm for Wireless Sensor Networks (WSN) in order to obtain, in a distributed manner, the projection of an observed sampled spatial field on a subspace of lower dimension. This is an important problem that is motivated in various applications where there are well defined subspaces of interest (e.g., spectral maps in cognitive radios). As opposed to traditional Gossip Algorithms used for subspace projection, where separation of channel coding and computation is assumed, our algorithm combines binary finite-length Computational Coding and a novel gossip-like protocol with certain communication rules, achieving important savings in conve…
Whatever next? Predictive brains, situated agents, and the future of cognitive science
2012
In the target article, Andy Clark addresses the question of how a probabilistic predictive coding model of the mind relates to our personal level mental lives. This question, he suggests, is “potentially the most important” (MS46). The question is important indeed, but Clark’s answer fails to capitalize on another possible advantage of this approach. Clark suggests that there is a disconnect between the way the world appears to us, on one hand, and the way that it is represented in the brain, on the other. He deals with this disconnect by limiting the scope of the theory, by pointing out that he is discussing a theory of how brains encode and process information, not a theory about how thin…
In Defense of Position Uncertainty
2015
The authors comments on the article "Orthographic coding in illiterates," by J. A. Dunabeitia, et al. There is a high degree of flexibility in letter-position coding during visual word recognition and reading. This phenomenon is explained based on the presence of perceptual noise in the information used for locating the positions of objects, namely, letters, across space.
Coding Partitions: Regularity, Maximality and Global Ambiguity
2007
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite sequences. We firstly prove that the canonical coding partition of a regular set contains a finite number of regular classes. We give an algorithm for computing this partition. We then investigate maximality conditions in a coding partition and we prove, in the regular case, the equivalence between two different notions of maximality. As an ap…
A simple proof of the polylog counting ability of first-order logic
2007
The counting ability of weak formalisms (e.g., determining the number of 1's in a string of length N ) is of interest as a measure of their expressive power, and also resorts to complexity-theoretic motivations: the more we can count the closer we get to real computing power. The question was investigated in several papers in complexity theory and in weak arithmetic around 1985. In each case, the considered formalism (AC 0 -circuits, first-order logic, Δ 0 ) was shown to be able to count up to a polylogarithmic number. An essential part of the proofs is the construction of a 1-1 mapping from a small subset of {0, ..., N - 1} into a small initial segment. In each case the expressibility of …
Ranking and unrankingk-ary trees with a 4k –4 letter alphabet
1997
Abstract The problem of the direct generation in A-order of binary trees was stated by Zaks in 1980. In 1988 Roelants van Baronaigien and Ruskey gave a solution for k-ary trees with n internal nodes using an encoding sequence of kn+1 integers between 1 and n. Vajnovszki and Pallo improved this result for binary trees in 1994 using words of length n–1 on a four letter alphabet. Recently Korsh generalized the Vajnovszki and Pallo’s generating algorithm to k-ary trees using an alphabet whose cardinality depends on k but not on n. We give in this paper ranking and unranking algorithms for k-ary trees using the Korsh’s encoding scheme.