Associations between BMI and home, school and route environmental exposures estimated using GPS and GIS: do we see evidence of selective daily mobility bias in children?

BACKGROUND: This study examined whether objective measures of food, physical activity and built environment exposures, in home and non-home settings, contribute to children's body weight. Further, comparing GPS and GIS measures of environmental exposures along routes to and from school, we tested for evidence of selective daily mobility bias when using GPS data. METHODS: This study is a cross-sectional analysis, using objective assessments of body weight in relation to multiple environmental exposures. Data presented are from a sample of 94 school-aged children, aged 5-11 years. Children's heights and weights were measured by trained researchers, and used to calculate BMI z-scores. Participants wore a GPS device for one full week. Environmental exposures were estimated within home and school neighbourhoods, and along GIS (modelled) and GPS (actual) routes from home to school. We directly compared associations between BMI and GIS-modelled versus GPS-derived environmental exposures. The study was conducted in Mebane and Mount Airy, North Carolina, USA, in 2011. RESULTS: In adjusted regression models, greater school walkability was associated with significantly lower mean BMI. Greater home walkability was associated with increased BMI, as was greater school access to green space. Adjusted associations between BMI and route exposure characteristics were null. The use of GPS-actual route exposures did not appear to confound associations between environmental exposures and BMI in this sample. CONCLUSIONS: This study found few associations between environmental exposures in home, school and commuting domains and body weight in children. However, walkability of the school neighbourhood may be important. Of the other significant associations observed, some were in unexpected directions. Importantly, we found no evidence of selective daily mobility bias in this sample, although our study design is in need of replication in a free-living adult sample.

Algorithms for Geometric Matching, Clustering, and Covering

With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.

The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.

The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this

shortest-path cover problem.