The topic of the contribution is to characterize the inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph in such a way that it can be used eeciently in a method of local search for maximization of a quality criterion. One can distinguish two kinds of inclusion neighbours: upper and lower ones. A previous paper 15] gave a character...

Neighbourhood Effects Research at a Crossroads: Ten Challenges for Future Research Neighbourhood effects research is at a crossroads since current theoretical and empirical approaches do not seem to be moving the debate forward. In this paper, we present a set of ten challenges as a basis for a new research agenda which will give new direction to the neighbourhood effects debate. The ten challe...

OBJECTIVES To examine the extent to which individual and ecological-level cognitive and structural social capital are associated with common mental disorder (CMD), the role played by physical characteristics of the neighbourhood in moderating this association, and the longitudinal change of the association between ecological level cognitive and structural social capital and CMD. DESIGN Cross-...

proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. this paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. with respect to the probability o...

Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, and show that any polygon from this family cannot be convexified by pop operations. This family contains simple, as well as non-simple (i.e., self-intersecting) polygons, as desired. We thereby answer in the negative an...

The pebbling number f(G) of a graphG is the least p such that, no matter how p pebbles are placed on the vertices of G, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and placing one on an adjacent vertex. It is conjectured that for all graphs G and H , we have f(G × H) ≤ f(G)f(H). If the graph G satisfies the odd 2-pebbling property, we w...

OBJECTIVE To provide a richer understanding of food access and purchasing practices among US urban food desert residents and their association with diet and BMI. DESIGN Data on food purchasing practices, dietary intake, height and weight from the primary food shopper in randomly selected households (n 1372) were collected. Audits of all neighbourhood food stores (n 24) and the most-frequented...

This article investigates the interconnectedness between neighbourhood diversity and local business structures. For this purpose, interviews with residents entrepreneurs were conducted in three European cities: Budapest, Copenhagen, Milan. The results show that economic structure of urban neighbourhoods is equally important regards to residents’ quality life, image neighbourhood, social cohesio...

Past studies in the UK and the Netherlands indicate that loneliness varies significantly according to characteristics of older people's residential environment. This raises questions regarding potential neighbourhood influences on individuals' social relationships in later life. This article examines neighbourhood influences on loneliness, using multiple classification analysis on comparable em...