OBJECTIVE Although the sociodemographic characteristics of food-insecure households have been well documented, there has been little examination of neighbourhood characteristics in relation to this problem. In the present study we examined the association between household food security and neighbourhood features including geographic food access and perceived neighbourhood social capital. DES...

BACKGROUND Perceived and objectively-assessed aspects of the neighbourhood physical environment have been postulated to be key contributors to regular engagement in active travel (AT) in older adults. We systematically reviewed the literature on neighbourhood physical environmental correlates of AT in older adults and applied a novel meta-analytic approach to statistically quantify the strength...

The paper describes decomposition of gray medical images. Pixels of the image are assigned with the variable values derived from a neighbourhood of the pixel. Then Grade Correspondence Cluster Analysis is used to order set of pixels according to their grade differentiation and to divide pixels into subsets. Subsets are visualized in separate subimages and regions are extracted on principle of s...

The two-player game of Nim on graphs is played on a regular graph with positively weighted edges by moving alternately from a fixed starting vertex to an adjacent vertex, decreasing the weight of the incident edge to a strictly smaller non-negative integer. The game ends when a player is unable to move since all edges incident with the vertex from which the player is to move have weight zero. I...

In the perpetual gossiping problem, introduced by Liestman and Richards, information may be generated at any time and at any vertex of a graph G; adjacent vertices can communicate by telephone calls. We define Wk(G) to be the minimum w such that, placing at most k calls each time unit, we can ensure that every piece of information is known to every vertex within w time units of its generation. ...

Support Vector Machines (SVM) are a machine learning technique that has been used for segmentation and classification of medical images, including segmentation of white matter hyper-intensities (WMH). Current approaches using SVM for WMH segmentation extract features from the brain and classify these followed by complex post-processing steps to remove false positives. The method presented in th...

We study the minimum number of weights assigned to the edges of a graph G with no component K2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.

We show that the number of points with pairwise different sets of neighbors in a graph is O(2) where r is the rank of the adjacency matrix. We also give an example that achieves this bound.