35 resultados para Task complexity

em Chinese Academy of Sciences Institutional Repositories Grid Portal


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Understanding the dynamics of eukaryotic transcriptome is essential for studying the complexity of transcriptional regulation and its impact on phenotype. However, comprehensive studies of transcriptomes at single base resolution are rare, even for modern organisms, and lacking for rice. Here, we present the first transcriptome atlas for eight organs of cultivated rice. Using high-throughput paired-end RNA-seq, we unambiguously detected transcripts expressing at an extremely low level, as well as a substantial number of novel transcripts, exons, and untranslated regions. An analysis of alternative splicing in the rice transcriptome revealed that alternative cis-splicing occurred in similar to 33% of all rice genes. This is far more than previously reported. In addition, we also identified 234 putative chimeric transcripts that seem to be produced by trans-splicing, indicating that transcript fusion events are more common than expected. In-depth analysis revealed a multitude of fusion transcripts that might be by-products of alternative splicing. Validation and chimeric transcript structural analysis provided evidence that some of these transcripts are likely to be functional in the cell. Taken together, our data provide extensive evidence that transcriptional regulation in rice is vastly more complex than previously believed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The objective of this study was to determine if the responses of basal forebrain neurons are related to the cognitive processes necessary for the performance of behavioural tasks, or to the hedonic attributes of the reinforcers delivered to the monkey as

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Rationale: Discriminating right from left is an everyday cognitive ability. Repeated exposure to certain drugs, such as heroin, can produce poor performance on many cognitive tasks. However, it is yet unclear whether drug abuse impairs the ability of right-left discrimination. Objectives: The aim of the present study is to examine whether the spatial ability measured by the right-left discrimination task can be affected by heroin abuse and whether such drug effect, if it exists, is gender related. Methods: A paper-and-pen test was used. The test consists of line drawings of a person with no arm, one arm, or both arms crossing the vertical body axis of the figure. The line drawings are viewed from the back, from the front, or randomly alternating between the back and front drawings. The subjects task is to mark which is the right or left hand in the figure as fast as possible. Results: A main finding in this study was that the ability to discriminate between left and right in visual space was impaired in heroin-dependent patients. Especially, heroin-dependent females performed poorer than control females in all conditions but heroin-dependent males only performed poorly in part of conditions. Conclusions: Recent heroin abuse impairs the ability of right-left discrimination and such impairment is gender related: heroin-dependent females demonstrated greater performance deficits than males.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the present study, we examined the effects of exposure to an extremely low-frequency magnetic field of 1 mT intensity on learning and memory in Lohmann brown domestic chicks using detour learning task. These results show that 20 h/day exposure to a low

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Behavioral stress can either block or facilitate memory and affect the induction of long-term potentiation (LTP) and long-term depression (LTD). However, the relevance of the stress experience-dependent long-term depression (SLTD) to spatial memory task is unknown. Here we have investigated the effects of acute and sub-acute elevated platform (EP) and foot shock (FS) stress on LTD induction in CA1 region of the hippocampus of anesthetized rats and spatial memory in Morris water maze. We found that LTD was facilitated by acute EP stress, but not by sub-acute EP stress that may be due to the fast adaptation of the animals to this naturalistic mild stress. However, FS stress, an inadaptable strong stress, facilitated LTD induction both in acute and sub-acute treatment. In addition, with the same stress protocols, acute EP stress impaired spatial memory but the sub-acute EP stressed animals performed the spatial memory task as well as the controls, may due to the same reason of adaptation. However, acute FS stress slightly impaired learning but sub-acute FS even enhanced memory retrieval. Our results showed that SLTD was disassociated with the effect of stress on memory task but might be related to stress experience-dependent form of aberrant memory. (C) 2003 Elsevier Science Ireland Ltd. and the Japan Neuroscience Society. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.