3 resultados para static random access memory

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

40.00% 40.00%

Publicador:

Resumo:

The Prospective and Retrospective Memory Questionnaire (PRMQ) has been shown to have acceptable reliability and factorial, predictive, and concurrent validity. However, the PRMQ has never been administered to a probability sample survey representative of all ages in adulthood, nor have previous studies controlled for factors that are known to influence metamemory, such as affective status. Here, the PRMQ was applied in a survey adopting a probabilistic three-stage cluster sample representative of the population of Sao Paulo, Brazil, according to gender, age (20-80 years), and economic status (n=1042). After excluding participants who had conditions that impair memory (depression, anxiety, used psychotropics, and/or had neurological/psychiatric disorders), in the remaining 664 individuals we (a) used confirmatory factor analyses to test competing models of the latent structure of the PRMQ, and (b) studied effects of gender, age, schooling, and economic status on prospective and retrospective memory complaints. The model with the best fit confirmed the same tripartite structure (general memory factor and two orthogonal prospective and retrospective memory factors) previously reported. Women complained more of general memory slips, especially those in the first 5 years after menopause, and there were more complaints of prospective than retrospective memory, except in participants with lower family income.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Voluntary physical activity improves memory and learning ability in rodents, whereas status epilepticus has been associated with memory impairment. Physical activity and seizures have been associated with enhanced hippocampal expression of BDNF, indicating that this protein may have a dual role in epilepsy. The influence of voluntary physical activity on memory and BDNF expression has been poorly studied in experimental models of epilepsy. In this paper, we have investigated the effect of voluntary physical activity on memory and BDNF expression in mice with pilocarpine-incluced epilepsy. Male Swiss mice were assigned to four experimental groups: pilocarpine sedentary (PS), pilocarpine runners (PRs), saline sedentary (SS) and saline runners (SRs). Two days after pilocarpine-induced status epilepticus, the affected mice (PR) and their running controls (SR) were housed with access to a running wheel for 28 days. After that, the spatial memory and the expression of the precursor and mature forms of hippocampal BDNF were assessed. PR mice performed better than PS mice in the water maze test. In addition, PR mice had a higher amount of mature BDNF (14 kDa) relative to the total BDNF (14 kDa + 28 kDa + 32 kDa forms) content when compared with PS mice. These results show that voluntary physical activity improved the spatial memory and increased the hippocampal content of mature BDNF of mice with pilocarpine-induced status epilepticus. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.