Search results for "Memory."
showing 10 items of 1949 documents
The effects of associative and semantic priming in the lexical decision task.
2001
Four lexical decision experiments were conducted to examine under which conditions automatic semantic priming effects can be obtained. Experiments 1 and 2 analyzed associative/semantic effects at several very short stimulus-onset asynchronies (SOAs), whereas Experiments 3 and 4 used a single-presentation paradigm at two response-stimulus intervals (RSIs). Experiment 1 tested associatively related pairs from three semantic categories (synonyms, antonyms, and category coordinates). The results showed reliable associative priming effects at all SOAs. In addition, the correlation between associative strength and magnitude of priming was significant only at the shortest SOA (66 ms). When prime-t…
Probabilistic Logic under Coherence‚ Model−Theoretic Probabilistic Logic‚ and Default Reasoning in System P
2016
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System P. In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System P. That is, we provide a new probabilistic semantics for System P, which neither uses infinitesimal probabilities nor atomic bound (or bi…
Conceptual design of the TRACE detector readout using a compact, dead time-less analog memory ASIC
2015
[EN] The new TRacking Array for light Charged particle Ejectiles (TRACE) detector system requires monitorization and sampling of all pulses in a large number of channels with very strict space and power consumption restrictions for the front-end electronics and cabling. Its readout system is to be based on analog memory ASICs with 64 channels each that sample a View the MathML source window of the waveform of any valid pulses at 200 MHz while discarding any other signals and are read out at 50 MHz with external ADC digitization. For this purpose, a new, compact analog memory architecture is described that allows pulse capture with zero dead time in any channel while vastly reducing the tota…
Dimensions of executive functioning: Evidence from children
2003
This study investigated dimensions of executive functioning in 8- to 13-year-old children. Three tasks from the Cambridge Neuropsychological Test Automated Battery (CANTAB), two tasks from the NEPSY battery and some additional executive function (EF) tests were administered to 108 children. In line with earlier work, modest correlations among EF measures were obtained (r < .4). Both exploratory and confirmatory factor analyses yielded three interrelated factors, which resembled those obtained by Miyake et al. (2000) and which were—with some reservations—labelled Working Memory (WM), Inhibition and Shifting. Age correlated with performance on most individual EF measures as well as Shifting a…
Skulls, Tree Bark, Fossils
2021
AbstractStudies of material objects in the field of memory studies have followed diverse epistemological and disciplinary trajectories, but their shared characteristic has been the questioning of philosophical assumptions concerning human relations with inanimate things and lower-level organic objects, such as plants, within the Aristotelian hierarchy of beings. Rather than accept at face value their categorizations as passive or deficient in comparison to the human subject, critical scholarship has reformulated the place and role of nonhuman entities in culture. This essay examines the nexus of materiality and memory in the work of the French philosopher and art historian Georges Didi-Hube…
Time multiplexing super-resolved imaging without a priori knowledge of the spatial distribution of the encoding structured illumination
2021
Time multiplexing is a super-resolution technique that sacrifices time to overcome the resolution reduction obtained because of diffraction. There are many super resolution methods based on time multiplexing, but all of them require a priori knowledge of the time changing encoding mask, which is projected on the object and used to encode and decode the high-resolution information. In this paper, we present a time multiplexing technique that does not require the a priori knowledge on the projected encoding mask. First, the theoretical concept of the technique is demonstrated; then, numerical simulations and experimental results are presented.
Hippocampal reversible lesions in a case of transient global amnesia
2018
We report the case of 55-year-old man that after an emotional stress showed retrograde and anterograde amnesia with impairment of orientation in space and time but undisturbed consciousness. A neurological examination excluded other neurological signs or symptoms. The amnesic syndrome resolved spontaneously within 24 hours and the hypothesis of transient global amnesia was placed. Brain CT scan and conventional MRI sequences did not show any relevant pathological findings but diffusion-weighted imaging (DWI) showed two millimetric bright spot of restricted diffusion in the right hippocampus; in a brain MRI follow-up those findings were no more appreciable. The diagnosis of transient global …
Application of kolmogorov complexity to inductive inference with limited memory
1995
A b s t r a c t . We consider inductive inference with limited memory[l]. We show that there exists a set U of total recursive functions such that U can be learned with linear long-term memory (and no short-term memory); U can be learned with logarithmic long-term memory (and some amount of short-term memory); if U is learned with sublinear long-term memory, then the short-term memory exceeds arbitrary recursive function. Thus an open problem posed by Freivalds, Kinber and Smith[l] is solved. To prove our result, we use Kolmogorov complexity.
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs
2017
Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…
Analysis of properties of recombination operators proposed for the node-depth encoding
2011
The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list. The original formulation of the node-depth encoding has only mutation operators as the search mechanism. Although it is computationally efficient, the exclusive use of mutation restricts the exploration of the search space and the algorithm convergence. Then, this work proposes two specific recombination operators to improve the convergence of the algorithm using the node-depth encoding representation. These operators are based on recombination operators for permutation representations. Analysis of the proposed …