IT HAS BEEN PROPOSED THAT TWO RELATIVELY INDEPENDENT COGNITIVE CONTROL NETWORKS EXIST IN THE BRAIN: the cingulo-opercular network (CO) and the fronto-parietal network (FP). Past work has shown that chronic brain lesions affect these networks independently. It remains unclear, however, how these two networks are affected by acute brain disruptions. To examine this, we conducted a within-subject ...

Structural parameters of raw and pre-treated viscose, modal and lyocell fibres were determined using X-ray diffraction, and compared with data obtained from iodine adsorption and tenacity measurements. A good correlation was found between iodine adsorption and structural changes. These structural parameters are correlated with surface thermodynamic parameters obtained by surface tension experim...

In order to help State ensure food security of the populations, technologies for substituting wheat flour with from local resources such as rice are used in bread making. The aim this study was determine rheological behavior pastes obtained by incorporating parboiled and non-parboiled bread-making process. results revealed that parboiling improves tenacity mixed (85%) (15%) paste. Indeed, Sahel...

solute transport processes are affected by soil pore water velocity distribution. pore size distribution, which can be used to infer pore water velocity distribution, can be estimated from a soil water retention curve (n). in this study, a solute breakthrough curve was simulated using soil hydraulic parameters in four different soils. to evaluate the proposed model, predictions were compared to...

The super connectivity κ ′ and the super edge-connectivity λ′ are more refined network reliability indices than connectivity κ and edge-connectivity λ. This paper shows that for a connected graph G with order at least four rather than a star and its line graph L(G), κ ′(L(G))= λ′(G) if and only if G is not super-λ′. As a consequence, we obtain the result of Hellwig et al. [Note on the connectiv...

A graph G = (V,E) is called l-mixed p-connected if G−S−L is connected for all pairs S, L with S ⊆ V , L ⊆ E, and l|S|+ |L| < p. This notion is a common generalisation of m-vertex-connectivity (l = 1, p = m) and m-edge-connectivity (l ≥ m, p = m). If p = kl then we obtain (k, l)-connectivity, introduced earlier by Kaneko and Ota, as a special case. We show that by using maximum adjacency orderin...

We examined the longitudinal genetic architecture of three parameters of functional brain connectivity. One parameter described overall connectivity (synchronization likelihood, SL). The two others were derived from graph theory and described local (clustering coefficient, CC) and global (average path length, L) aspects of connectivity. We measured resting state EEG in 1,438 subjects from four ...