Search results for "Memory."
showing 10 items of 1949 documents
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Three-page encoding and complexity theory for spatial graphs
2004
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
New Encodings of Pseudo-Boolean Constraints into CNF
2009
International audience; This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
Letter Position Coding Across Modalities: The Case of Braille Readers
2012
BackgroundThe question of how the brain encodes letter position in written words has attracted increasing attention in recent years. A number of models have recently been proposed to accommodate the fact that transposed-letter stimuli like jugde or caniso are perceptually very close to their base words.MethodologyHere we examined how letter position coding is attained in the tactile modality via Braille reading. The idea is that Braille word recognition may provide more serial processing than the visual modality, and this may produce differences in the input coding schemes employed to encode letters in written words. To that end, we conducted a lexical decision experiment with adult Braille…
Memory Resource Management for Real-Time Systems
2007
Dynamic memory storage has been widely used for years in computer science. However, its use in real-time systems has not been considered as an important issue, and memory management has not receive much consideration, whereas today's real-time applications are often characterized by highly fluctuating memory requirements. In this paper we present an approach to dynamic memory management for real-time systems. In response to application behavior and requests, the underlying memory management system adjusts resources to meet changing demands and user needs. The architectural framework that realizes this approach allows adaptive allocation of memory resources to applications involving both per…
The differences between distributed shared memory caching and proxy caching
2000
The authors discuss the similarities in caching between the extensively studied distributed shared memory systems and the emerging proxy systems. They believe that several of the techniques used in distributed shared memory systems can be adapted and applied to proxy systems.
El color del camaleón: un testimonio valiente para la sociedad chilena
2017
The film El color del camaleón (2017) by Andrés Lübbert, which has great cinematic and content merits, can be considered as an important part of Chilean films on memory and post-memory. I focus on its contribution to Chilean memory and the reconstruction of the truth through the unveiling, in particular, of cruel methods of forced recruitment used by the dictatorship’s secret services. They were used as a further tool to instill terror in society, and as a way of submission and control of the population.
Effects of several degrees of chronic social defeat stress on emotional and spatial memory in CD1 mice
2015
In the present study, the effects of several degrees of CSDS (Chronic Social Defeat Stress) on emotional and spatial memory in mice were evaluated in separate experiments. Male CD1 mice were randomly assigned to four experimental groups (n=10-12) for each experiment: NS (non-stressed), S5, S10 and S20 (5, 10 and 20 sessions of CSDS, respectively). The S groups underwent the corresponding number of agonistic encounters (10min each) over a 20-day period. 24h after the last session of CSDS, mice performed the inhibitory avoidance (Experiment 1) or the Morris water maze test (Experiment 2). In both experiments, animals were also evaluated in the elevated plus maze for 5min to obtain complementa…
Inhibitory avoidance learning in CD1 mice: Effects of chronic social defeat stress
2015
Chronic social defeat stress (CSDS) is an animal model widely used to determine the neurobiological mechanisms of stress and its associated pathologies. In this study, the effects of CSDS on inhibitory avoidance (IA) were evaluated in post-pubertal and adult male CD1 mice, instead of the C57BL/6J strain used in the CSDS standard protocol. CSDS consisted of daily 5-min (experiments 1 and 2) or 10-min (experiment 3) agonistic encounters on 21 consecutive days. Twenty four hours after the last session of CSDS, all the mice were tested for IA. They were also evaluated in an elevated plus-maze, obtaining complementary measures of locomotor activity and emotionality. In experiments 1 and 2, IA le…