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...

امروزه استفاده از محرک­های پلاسمایی جریان متناوب نسبت به جریان مستقیم، جهت کنترل فعال جریان، متداول­تر بوده و تقریبأ هیچ کار تحقیقی بر روی پلاسمای جریان مستقیم انجام نگرفته است. در این مقاله با استفاده از یک منبع تغذیه جریان مستقیم و هندسه های گوناگون، خصوصیات پلاسما در هر دو حالت corona و dbd (dielectric barrier discharge)  مورد مطالعه قرار گرفت. با استفاده از نتایج این پژوهش مشخص شد که جریان ...

Microresonators have been utilized to construct optical interconnection networks. One of the drawbacks of these microresonators is that they suffer from intrinsic crosstalk noise and power loss, resulting in Signal-to-Noise Ratio (SNR) reduc-tion and system performance degradation at the network level. The novel contribution of this paper is to systematically study the worst-case crosstalk nois...

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...