A long-standing contradiction has posed a critical puzzle to urban sociologists: On the one hand, a wealth of ethnographic studies make the point that the kinds of neighborhoods people inhabit profoundly shape their fortunes; on the other hand, statistical analyses of “neighborhood effects” have often failed to confirm that claim. From the earliest studies of the Chicago School, through classic...

Ambiguity preserving representations such as lattices are very useful in a number of NLP tasks, including paraphrase generation, paraphrase recognition, and machine translation evaluation. Lattices compactly represent lexical variation, but word order variation leads to a combinatorial explosion of states. We advocate hypergraphs as compact representations for sets of utterances describing the ...

physical decline and the necessity of redevelopment are never-ending challenges for built communities. neighborhoods undergo cycles of birth, growth, stabilization, decline and rejuvenation. redevelopment is a mechanism that can reduce the time an area is in decline and spur the process of revitalization. furthermore, redevelopment can provide incentives for a developer to build in a community ...

BACKGROUND Differences in availability of recreational resources may contribute to racial and socioeconomic status (SES) disparities in physical activity. Variations in the location and density of recreational resources were examined by SES and racial composition of neighborhoods. METHODS Densities of resources available in recreational facilities and parks were estimated for census tracts be...

This paper presents a dynamic programming inspired metaheuristic called Corridor Method. It can be classified as a method-based iterated local search in that it deploys method-based neighborhoods. By this we mean that the search for a new candidate solution is carried out by a fully-fledged optimization method and generates a global optimal solution over the neighborhood. The neighborhoods are ...

For each k ≥ 2, let ρk ∈ (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (ρk + o(1)) ( n k ) edges as n → ∞. We prove that ρk = 1 − 2 log k/k + Θ(log log k/k) as k → ∞. This disproves a conjecture of Füredi and the last two authors.

In this note, we introduce the new operator Dp(λ, q, η). Using this operator, we define the new subclasses of analytic and multivalent functions and for functions belonging to these classes, certain (n, δ)neighborhood properties are obtained. Mathematics Subject Classification: 30C45

A major challenge in applying the Conley index theory to a given dynamical system is to find isolating neighborhoods of the invariant sets of interest. In this paper we describe a computational method which allows for the efficient construction of isolating neighborhoods. As an example we compute an isolating neighborhood of a heteroclinic orbit connecting a fixed point to a period two point in...

The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of social networks, heavy-tailed degree distributions and large clustering coefficients, imply the existence of vertex neighborhoods (also known as egonets) that are themselves good communities. We evaluate these neighborh...

We show that the map part of the discrete Conley index carries information which can be used to detect the existence of connections in the repeller-attractor decomposition of an isolated invariant set of a homeomorphism. We use this information to provide a characterization of invariant sets which admit a semi-conjugacy onto the space of sequences on K symbols with dynamics given by a subshift....