32 research outputs found
A two cases clinical report of mandragora poisoning in primary care in Crete, Greece: two case report
Anatomical connectivity patterns predict face selectivity in the fusiform gyrus
A fundamental assumption in neuroscience is that brain structure determines function. Accordingly, functionally distinct regions of cortex should be structurally distinct in their connections to other areas. We tested this hypothesis in relation to face selectivity in the fusiform gyrus. By using only structural connectivity, as measured through diffusion-weighted imaging, we were able to predict functional activation to faces in the fusiform gyrus. These predictions outperformed two control models and a standard group-average benchmark. The structure–function relationship discovered from the initial participants was highly robust in predicting activation in a second group of participants, despite differences in acquisition parameters and stimuli. This approach can thus reliably estimate activation in participants who cannot perform functional imaging tasks and is an alternative to group-activation maps. Additionally, we identified cortical regions whose connectivity was highly influential in predicting face selectivity within the fusiform, suggesting a possible mechanistic architecture underlying face processing in humans.United States. Public Health Service (DA023427)National Institute of Mental Health (U.S.) (F32 MH084488)National Eye Institute (T32 EY013935)Poitras FoundationSimons FoundationEllison Medical Foundatio
Transmembrane signalling in eukaryotes: a comparison between higher and lower eukaryotes
The extreme capsule fiber complex in humans and macaque monkeys: a comparative diffusion MRI tractography study
Transmembrane signalling in eukaryotes: a comparison between higher and lower eukaryotes
Distance constraints solved geometrically
International Symposium on Advances in Robot Kinematics (ARK), 2004, Sestri Levante (Italia)Most geometric constraint problems can be reduced to give coordinates to a set of points from a subset of their pairwise distances. By exploiting this fact, this paper presents an algorithm that solves distance constraint systems by iteratively reducing and expanding the dimension of the problem. In general, these projection/backprojection iterations permit tightening the ranges for the possible solutions but, if at a given point no progress is made, the algorithm bisects the search space and proceeds recursively for both subproblems. This branch-and-prune strategy is shown to converge to all solutions.Peer Reviewe