OBJECTIVE Understanding the mechanisms by which neighbourhood environments influence childhood obesity is needed to facilitate the development of prevention strategies. The objective of this cross-sectional study was to identify the distinct types of neighbourhoods in which Canadian children reside and examine the extent to which physical activity and sedentary behaviour mediate the relationshi...

In this paper, we use the Canadian National Longitudinal Survey of Children and Youth data to examine the links between child well-being and neighbourhood 'quality.' This study adds to the literature by (i) investigating the relationship between neighbourhood quality and child health, (ii) by utilizing subjective assessments by individuals familiar with the neighbourhood (i.e., the survey respo...

Three-neighbourhood Cellular Automata (CA) are widely studied and accepted as suitable cryptographic primitive. Rule 30, a 3-neighbourhood CA rule, was proposed as an ideal candidate for cryptographic primitive by Wolfram. However, rule 30 was shown to be weak against Meier-Staffelbach attack [7]. The cryptographic properties like diffusion and randomness increase with increase in neighbourhood...

A graph G = (V, E) is called (k, k′)-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, and assigns to each edge e a set L(e) of k′ real numbers, there is a mapping f : V ∪ E → R such that f(y) ∈ L(y) for any y ∈ V ∪ E and for any two adjacent vertices x, x′, ∑ e∈E(x) f(e)+f(x) 6= ∑ e∈E(x′) f(e)+f(x ′). We ...

A graph G with a list of colors L(v) and weight w(v) for each vertex v is (L,w)-colorable if one can choose a subset of w(v) colors from L(v) for each vertex v, such that adjacent vertices receive disjoint color sets. In this paper, we give necessary and sufficient conditions for a weighted path to be (L,w)-colorable for some list assignments L. Furthermore, we solve the problem of the free-cho...

A graph G is said to be F-residual if for every point u in G, the graph obtained by removing the closed neighborhood of u from G is isomorphic to F. Similarly, if the remove of m consecutive closed neighborhoods yields Kn, then G is called m-Kn-residual graph. Erdös determine the minimum order of the m-Kn-residual graph for all m and n, the minimum order of the connected Kn-residual graph is fo...

An econometric model is specified in which an individual’s income and the income mix of the neighbourhood in which the individual resides are endogenous, thus providing a holistic model of phenomena that previously have been fragmented into neighbourhood effects and neighbourhood selection literatures. To overcome the biases from selection and endogeneity, the parameters of this model are estim...

STUDY OBJECTIVE To provide reliability information for a brief observational measure of physical disorder and determine its relation with neighbourhood level crime and health variables after controlling for census based measures of concentrated poverty and minority concentration. DESIGN Psychometric analysis of block observation data comprising a brief measure of neighbourhood physical disord...

Study objective: Using a conceptual rather than a mathematical approach, this article proposed a link between multilevel regression analysis (MLRA) and social epidemiological concepts. It has been previously explained that the concept of clustering of individual health status within neighbourhoods is useful for operationalising contextual phenomena in social epidemiology. It has been shown that...