Results 1  10
of
950
Visual properties of neurons in a polysensory area in superior temporal sulcus of the macaque
 Journal of Neurophysiology
, 1981
"... dorsal bank and fundus of the anterior portion of the superior temporal sulcus, an area we term the superior temporal polysensory area (STP). Five macaques were studied under anesthesia ( N20) and immobilization in repeated recording sessions. 2. Almost all of the neurons were visually responsive, ..."
Abstract

Cited by 237 (3 self)
 Add to MetaCart
dorsal bank and fundus of the anterior portion of the superior temporal sulcus, an area we term the superior temporal polysensory area (STP). Five macaques were studied under anesthesia ( N20) and immobilization in repeated recording sessions. 2. Almost all of the neurons were visually responsive
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
position, is the net encoding function composed of harmonic modulation and the complex spatial sensitivity s ␥ of coil ␥, and c results from tissue and sequence parameters. The effects of nonuniform kspace weighting due to relaxation shall be neglected in the scope of this work. From the linearity
Longerterm effects of Head Start
 American Economic Review
, 2002
"... Abstract Public early intervention programs like Head Start are often justified as investments in children. Yet nothing is known about the longterm effects of Head Start. This paper draws on unique data from the Panel Study of Income Dynamics to provide new evidence on the effects of Head Start on ..."
Abstract

Cited by 131 (5 self)
 Add to MetaCart
effects of Head Start. I. Background Head Start began as a summer program in 1965 with 561,000 predominantly African American children. It expanded to serve almost threequarters of a million African American and white children in the summer of 1966 at which time about $1,000 (in 1999 prices) was spent
1 The biogeochemistry of carbon at Hubbard Brook
, 2004
"... piration Abstract. The biogeochemical behavior of carbon in the forested watersheds of the Hubbard Brook Experimental Forest (HBEF) was analyzed in longterm studies. The largest pools of C in the reference watershed (W6) reside in mineral soil organic matter (43 % of total ecosystem C) and living b ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
piration Abstract. The biogeochemical behavior of carbon in the forested watersheds of the Hubbard Brook Experimental Forest (HBEF) was analyzed in longterm studies. The largest pools of C in the reference watershed (W6) reside in mineral soil organic matter (43 % of total ecosystem C) and living
Brooks’ theorem for Bernoulli shifts
, 2013
"... If Γ is an infinite group with finite symmetric generating set S, we consider the graph G(Γ, S) on [0, 1]Γ by relating two distinct points if an element of s sends one to the other via the shift action. We show that, aside from the cases Γ = Z and Γ = (Z/2Z) ∗ (Z/2Z), G(Γ, S) satisfies a measureth ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
theoretic version of Brooks ’ theorem: there is a G(Γ, S)invariant conull Borel set B ⊆ [0, 1]Γ and a Borel coloring c: B → d of G(Γ, S) B, where d = S  is the degree of G(Γ, S). As a corollary we obtain a translationinvariant random dcoloring of the Cayley graph Cay(Γ, S) which is a factor of IID
A Fractional Analogue of Brooks’ Theorem
"... Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G)+1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fracti ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
such that the fractional chromatic number χf(G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2 8, C5 ⊠K2, and graphs whose clique number ω(G) equals the maximum degree ∆(G). Among the two sporadic graphs, the graph C 2 8 is the square graph of cycle C8 while the other graph C5 ⊠ K2 is the strong
A Fractional Analogue of Brooks’ Theorem
, 2011
"... Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G) +1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fract ..."
Abstract
 Add to MetaCart
such that the fractional chromatic number χf(G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2 8, C5 ⊠ K2, and graphs whose clique number ω(G) equals the maximum degree ∆(G). Among the two sporadic graphs, the graph C 2 8 is the square graph of cycle C8 while the other graph C5 ⊠ K2 is the strong
Nondegenerate colorings in the Brook’s Theorem
, 812
"... Let c ≥ 2 and p ≥ c be two integers. We will call a proper coloring of the graph G a (c, p)nondegenerate, if for any vertex of G with degree at least p there are at least c vertices of different colors adjacent to it. In our work we prove the following result, which generalizes Brook’s Theorem. Let ..."
Abstract
 Add to MetaCart
Let c ≥ 2 and p ≥ c be two integers. We will call a proper coloring of the graph G a (c, p)nondegenerate, if for any vertex of G with degree at least p there are at least c vertices of different colors adjacent to it. In our work we prove the following result, which generalizes Brook’s Theorem
A dual version of Brook’s coloring theorem
, 2003
"... Let G = (V, E) be a graph with a fixed orientation and let A be an abelian group. Let F (G, A) denote the set of all functions from E(G) to A. The graph G is Aconnected if for any function ¯ f ∈ F (G, A), there exists an Aflow f such that f(e) = ¯ f(e) for any e ∈ E(G). The graph G is Acolorabl ..."
Abstract
 Add to MetaCart
), 299317], Lai et al. proved the group analogue which states that χg(G) ≤ ∆(G) + 1, where equality holds if and only if G is a cycle or a complete graph. Let P2 denote a path with 2 edges. Define g2(P2) = min{C: C is a cycle containing P2} and g2(G) = max{g2(P2): P2 ⊂ G}. In this paper we prove a
TEXed on 1/21/1999 Almost All Rooted Maps Have Large Representativity
"... Let M be a map on a surface S. The edgewidth of M is the length of a shortest noncontractible cycle of M. The facewidth (or, representativity) of M is the smallest number of intersections a noncontractible curve inShas with M. (The edgewidth and facewidth of a planar map may be de ned to be in ..."
Abstract
 Add to MetaCart
to be in nity.) A map is an LEWembedding if its maximum face valency is less than its edgewidth. For several families of rooted maps on a given surface, we prove that there are positive constants c1 and c2, depending on the family and the surface, such that 1. almost all maps with n edges have face
Results 1  10
of
950