949 resultados para Dynamic faces
Resumo:
We unfold a profound relationship between the dynamics of finite-size perturbations in spatially extended chaotic systems and the universality class of Kardar-Parisi-Zhang (KPZ). We show how this relationship can be exploited to obtain a complete theoretical description of the bred vectors dynamics. The existence of characteristic length/time scales, the spatial extent of spatial correlations and how to time it, and the role of the breeding amplitude are all analyzed in the light of our theory. Implications to weather forecasting based on ensembles of initial conditions are also discussed.
Variations in the human cannabinoid receptor (CNR1) gene modulate striatal responses to happy faces.
Resumo:
Happy facial expressions are innate social rewards and evoke a response in the striatum, a region known for its role in reward processing in rats, primates and humans. The cannabinoid receptor 1 (CNR1) is the best-characterized molecule of the endocannabinoid system, involved in processing rewards. We hypothesized that genetic variation in human CNR1 gene would predict differences in the striatal response to happy faces. In a 3T functional magnetic resonance imaging (fMRI) scanning study on 19 Caucasian volunteers, we report that four single nucleotide polymorphisms (SNPs) in the CNR1 locus modulate differential striatal response to happy but not to disgust faces. This suggests a role for the variations of the CNR1 gene in underlying social reward responsivity. Future studies should aim to replicate this finding with a balanced design in a larger sample, but these preliminary results suggest neural responsivity to emotional and socially rewarding stimuli varies as a function of CNR1 genotype. This has implications for medical conditions involving hypo-responsivity to emotional and social stimuli, such as autism.
Resumo:
One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.
Resumo:
How do organizations previously dominated by the state develop dynamic capabilities that would support their growth in a competitive market economy? We develop a theoretical framework of organizational transformation that explains the processes by which organizations learn and develop dynamic capabilities in transition economies. Specifically, the framework theorizes about the importance of, and inter-relationships between, leadership, organizational learning, dynamic capabilities, and performance over three stages of transformation. Propositions derived from this framework explain the pre-conditions enabling organizational learning, the linkages between types of learning and functions of dynamic capabilities, and the feedback from dynamic capabilities to organizational learning that allows firms in transition economies to regain their footing and build long-term competitive advantage. We focus on transition contexts, where these processes have been magnified and thus offer new insights into strategizing in radically altered environments.
Resumo:
Sensitivity, specificity, and reproducibility are vital to interpret neuroscientific results from functional magnetic resonance imaging (fMRI) experiments. Here we examine the scan–rescan reliability of the percent signal change (PSC) and parameters estimated using Dynamic Causal Modeling (DCM) in scans taken in the same scan session, less than 5 min apart. We find fair to good reliability of PSC in regions that are involved with the task, and fair to excellent reliability with DCM. Also, the DCM analysis uncovers group differences that were not present in the analysis of PSC, which implies that DCM may be more sensitive to the nuances of signal changes in fMRI data.