The influence of dietary fatty acids (FA) on intestinal brush border FA composition and nutrient transport functions was studied in broiler chickens. Ross chicks (2 wk old) were fed for 14 d a standard diet (CTL) or diets enriched with saturated fatty acids (SFA; 60 g/kg lard, LAR diet), (n-3) PUFA (60 g/kg linseed oil, LSO diet) and (n-6) PUFA (60 g/kg sunflower oil, SFO diet). The SFA of the ...

Maximum velocity of the actomyosin ATPase reaction (V(max) ATPase) and ATP consumption rate during maximum isometric activation (ATP(iso)) were determined in human vastus lateralis (VL) muscle fibers expressing different myosin heavy chain (MHC) isoforms. We hypothesized that the reserve capacity for ATP consumption [1 -- (ratio of ATP(iso) to V(max) ATPase)] varies across VL muscle fibers expr...

The effects of habitual cigarette smoking on cardiorespiratory responses to sub-maximal and maximal work were evaluated in nine adult nonsmokers and nine smokers with a mean age of 33 yr. A maximal treadmill test was followed by three tests at 45, 60 and 75% of each subject's VO(2)max. Compared to nonsmokers, the habitual smokers had a non-significantly lower VO(2)max in L/min and per lean body...

Let G(V,E1) and G (V,E2) be two networks on the same vertex set V and consider the union of edges G(V,E1 ∪ E2). This paper studies the stability of the Degree, Betweenness and Eigenvector Centrality of the resultant network, G(V,E1 ∪ E2). Specifically assume v max and v max are the highest centrality vertices of G(V,E1) and G(V,E1 ∪ E2) respectively, we want to find Pr(v max = v max). ar X iv :...

Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+, and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v)...

Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+, and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v)...

THEOREM 9: For each i, let a be a pure action profile in the stage game. If aii is a best response to ai−i for both i and (π2 −π1) · (u(a2)− u(a1)) > 0, then the following two-state automaton strategy, with states 1 and 2, yields a BSG set for δ sufficiently high: • Disagreement: In state i, make no transfers and play a in the action phase. If player j = i deviates unilaterally, go to state j; ...

MAX CUT is the problem of partitioning the vertices of a graph into two sets max imizing the number of edges joining these sets This problem is NP hard Goemans and Williamson proposed an algorithm that rst uses a semide nite programming relaxation of MAX CUT to embed the vertices of the graph on the surface of an n dimensional sphere and then uses a random hyperplane to cut the sphere in two gi...

This study compared strategies to define final and initial speeds for designing ramp protocols. V(O(2)max ) was directly assessed in 117 subjects (29 ± 8 yrs) and estimated by three nonexercise models: (1) Veterans Specific Activity Questionnaire (VSAQ); (2) Rating of Perceived Capacity (RPC); (3) Questionnaire of Cardiorespiratory Fitness (CRF). Thirty seven subjects (30 ± 9 yrs) performed thr...

Let G = (V,E) be a graph and let v ∈ V. Let γ(v,G) denote the minimum cardinality of a minimal dominating set of G containing v. Then γ(G) = max{γ(v,G) : v ∈ V (G)} is called the min-max dom-saturation number of G. In this paper we present a dynamic programming algorithm for determining the min-max domsaturation number of a tree.