Changes in white matter connectivity following therapy for anomia post stroke

Background. The majority of studies investigating the neural mechanisms underlying treatment-induced recovery in aphasia have focused on the cortical regions associated with language processing. However, the integrity of the white matter connecting these regions may also be crucial to understanding treatment mechanisms. Objective. This study investigated the integrity of the arcuate fasciculus (AF) and uncinate fasciculus (UF) before and after treatment for anomia in people with aphasia. Method. Eight people with aphasia received 12 treatment sessions to improve naming; alternating between phonologically-based and semantic-based tasks, with high angular resolution diffusion imaging conducted pre and post treatment. The mean generalized fractional anisotropy (GFA), a measure of fiber integrity, and number of fibers in the AF and UF were compared pre and post treatment, as well as with a group of 14 healthy older controls. Results. Pre treatment, participants with aphasia had significantly fewer fibers and lower mean GFA in the left AF compared with controls. Post treatment, mean GFA increased in the left AF to be statistically equivalent to controls. Additionally, mean GFA in the left AF pre and post treatment positively correlated with maintenance of the phonologically based treatment. No differences were found in the right AF, or the UF in either hemisphere, between participants with aphasia and controls, and no changes were observed in these tracts following treatment. Conclusions. Anomia treatments may improve the integrity of the white matter connecting cortical language regions. These preliminary results add to the understanding of the mechanisms underlying treatment outcomes in people with aphasia post stroke.

Fish mediate high food web connectivity in the lower reaches of a tropical floodplain river

High levels of hydrological connectivity during seasonal flooding provide significant opportunities for movements of fish between rivers and their floodplains, estuaries and the sea, possibly mediating food web subsidies among habitats. To determine the degree of utilisation of food sources from different habitats in a tropical river with a short floodplain inundation duration (similar to 2 months), stable isotope ratios in fishes and their available food were measured from three habitats (inundated floodplain, dry season freshwater, coastal marine) in the lower reaches of the Mitchell River, Queensland (Australia). Floodplain food sources constituted the majority of the diet of large-bodied fishes (barramundi Lates calcarifer, catfish Neoarius graeffei) captured on the floodplain in the wet season and for gonadal tissues of a common herbivorous fish (gizzard shad Nematalosa come), the latter suggesting that critical reproductive phases are fuelled by floodplain production. Floodplain food sources also subsidised barramundi from the recreational fishery in adjacent coastal and estuarine areas, and the broader fish community from a freshwater lagoon. These findings highlight the importance of the floodplain in supporting the production of large fishes in spite of the episodic nature and relatively short duration of inundation compared to large river floodplains of humid tropical regions. They also illustrate the high degree of food web connectivity mediated by mobile fish in this system in the absence of human modification, and point to the potential consequences of water resource development that may reduce or eliminate hydrological connectivity between the river and its floodplain.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

Heritability of the network architecture of intrinsic brain functional connectivity

The brain's functional network exhibits many features facilitating functional specialization, integration, and robustness to attack. Using graph theory to characterize brain networks, studies demonstrate their small-world, modular, and "rich-club" properties, with deviations reported in many common neuropathological conditions. Here we estimate the heritability of five widely used graph theoretical metrics (mean clustering coefficient (γ), modularity (Q), rich-club coefficient (ϕnorm), global efficiency (λ), small-worldness (σ)) over a range of connection densities (k=5-25%) in a large cohort of twins (N=592, 84 MZ and 89 DZ twin pairs, 246 single twins, age 23±2.5). We also considered the effects of global signal regression (GSR). We found that the graph metrics were moderately influenced by genetic factors h2 (γ=47-59%, Q=38-59%, ϕnorm=0-29%, λ=52-64%, σ=51-59%) at lower connection densities (≤15%), and when global signal regression was implemented, heritability estimates decreased substantially h2 (γ=0-26%, Q=0-28%, ϕnorm=0%, λ=23-30%, σ=0-27%). Distinct network features were phenotypically correlated (|r|=0.15-0.81), and γ, Q, and λ were found to be influenced by overlapping genetic factors. Our findings suggest that these metrics may be potential endophenotypes for psychiatric disease and suitable for genetic association studies, but that genetic effects must be interpreted with respect to methodological choices.

Analysis of connectivity map: Control to glutamate injured and phenobarbital treated neuronal network

We study the responses of a cultured neural network when it is exposed to epileptogenesis glutamate injury causing epilepsy and subsequent treatment with phenobarbital by constructing connectivity map of neurons using correlation matrix. This study is particularly useful in understanding the pharmaceutical drug induced changes in the neuronal network properties with insights into changes at the systems biology level. (C) 2010 American Institute of Physics. [doi:10.1063/1.3398025]

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

An Effective Seamless Connectivity Scheme for Ubiquitous Applications

The idea of ubiquity and seamless connectivity in networks is gaining more importance in recent times because of the emergence of mobile devices with added capabilities like multiple interfaces and more processing abilities. The success of ubiquitous applications depends on how effectively the user is provided with seamless connectivity. In a ubiquitous application, seamless connectivity encompasses the smooth migration of a user between networks and providing him/her with context based information automatically at all times. In this work, we propose a seamless connectivity scheme in the true sense of ubiquitous networks by providing smooth migration to a user along with providing information based on his/her contexts automatically without re-registration with the foreign network. The scheme uses Ubi-SubSystems(USS) and Soft-Switches(SS) for maintaining the ubiquitous application resources and the users. The scheme has been tested by considering the ubiquitous touring system with several sets of tourist spots and users.

Distributed Source Coding for Sensor Data Model and Estimation of Cluster Head Errors Using Bayesian and K-Near Neighborhood Classifiers in Deployment of Dense Wireless Sensor Networks

The lifetime calculation of large dense sensor networks with fixed energy resources and the remaining residual energy have shown that for a constant energy resource in a sensor network the fault rate at the cluster head is network size invariant when using the network layer with no MAC losses.Even after increasing the battery capacities in the nodes the total lifetime does not increase after a max limit of 8 times. As this is a serious limitation lots of research has been done at the MAC layer which allows to adapt to the specific connectivity, traffic and channel polling needs for sensor networks. There have been lots of MAC protocols which allow to control the channel polling of new radios which are available to sensor nodes to communicate. This further reduces the communication overhead by idling and sleep scheduling thus extending the lifetime of the monitoring application. We address the two issues which effects the distributed characteristics and performance of connected MAC nodes. (1) To determine the theoretical minimum rate based on joint coding for a correlated data source at the singlehop, (2a) to estimate cluster head errors using Bayesian rule for routing using persistence clustering when node densities are the same and stored using prior probability at the network layer, (2b) to estimate the upper bound of routing errors when using passive clustering were the node densities at the multi-hop MACS are unknown and not stored at the multi-hop nodes a priori. In this paper we evaluate many MAC based sensor network protocols and study the effects on sensor network lifetime. A renewable energy MAC routing protocol is designed when the probabilities of active nodes are not known a priori. From theoretical derivations we show that for a Bayesian rule with known class densities of omega1, omega2 with expected error P* is bounded by max error rate of P=2P* for single-hop. We study the effects of energy losses using cross-layer simulation of - large sensor network MACS setup, the error rate which effect finding sufficient node densities to have reliable multi-hop communications due to unknown node densities. The simulation results show that even though the lifetime is comparable the expected Bayesian posterior probability error bound is close or higher than Pges2P*.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.

Connectivity analysis of multichannel EEG signals using recurrence based phase synchronization technique

Real world biological systems such as the human brain are inherently nonlinear and difficult to model. However, most of the previous studies have either employed linear models or parametric nonlinear models for investigating brain function. In this paper, a novel application of a nonlinear measure of phase synchronization based on recurrences, correlation between probabilities of recurrence (CPR), to study connectivity in the brain has been proposed. Being non-parametric, this method makes very few assumptions, making it suitable for investigating brain function in a data-driven way. CPR's utility with application to multichannel electroencephalographic (EEG) signals has been demonstrated. Brain connectivity obtained using thresholded CPR matrix of multichannel EEG signals showed clear differences in the number and pattern of connections in brain connectivity between (a) epileptic seizure and pre-seizure and (b) eyes open and eyes closed states. Corresponding brain headmaps provide meaningful insights about synchronization in the brain in those states. K-means clustering of connectivity parameters of CPR and linear correlation obtained from global epileptic seizure and pre-seizure showed significantly larger cluster centroid distances for CPR as opposed to linear correlation, thereby demonstrating the superior ability of CPR for discriminating seizure from pre-seizure. The headmap in the case of focal epilepsy clearly enables us to identify the focus of the epilepsy which provides certain diagnostic value. (C) 2013 Elsevier Ltd. All rights reserved.

Preschool anxiety disorders predict different patterns of amygdala-prefrontal connectivity at school-age.

OBJECTIVE: In this prospective, longitudinal study of young children, we examined whether a history of preschool generalized anxiety, separation anxiety, and/or social phobia is associated with amygdala-prefrontal dysregulation at school-age. As an exploratory analysis, we investigated whether distinct anxiety disorders differ in the patterns of this amygdala-prefrontal dysregulation. METHODS: Participants were children taking part in a 5-year study of early childhood brain development and anxiety disorders. Preschool symptoms of generalized anxiety, separation anxiety, and social phobia were assessed with the Preschool Age Psychiatric Assessment (PAPA) in the first wave of the study when the children were between 2 and 5 years old. The PAPA was repeated at age 6. We conducted functional MRIs when the children were 5.5 to 9.5 year old to assess neural responses to viewing of angry and fearful faces. RESULTS: A history of preschool social phobia predicted less school-age functional connectivity between the amygdala and the ventral prefrontal cortices to angry faces. Preschool generalized anxiety predicted less functional connectivity between the amygdala and dorsal prefrontal cortices in response to fearful faces. Finally, a history of preschool separation anxiety predicted less school-age functional connectivity between the amygdala and the ventral prefrontal cortices to angry faces and greater school-age functional connectivity between the amygdala and dorsal prefrontal cortices to angry faces. CONCLUSIONS: Our results suggest that there are enduring neurobiological effects associated with a history of preschool anxiety, which occur over-and-above the effect of subsequent emotional symptoms. Our results also provide preliminary evidence for the neurobiological differentiation of specific preschool anxiety disorders.