Change in walking for transport : a longitudinal study of the influence of neighbourhood disadvantage and individual-level socioeconomic position in mid-aged adults

Background Unlike leisure time physical activity, knowledge of the socioeconomic determinants of active transport is limited, research on this topic has produced mixed and inconsistent findings, and it remains unknown if peoples’ engagement in active transport declines as they age. This longitudinal study examined relationships between neighbourhood disadvantage, individual-level socioeconomic position and walking for transport (WfT) during mid- and early old-age (40 – 70 years). Three questions were addressed: (i) which socioeconomic groups walk for transport, (ii) does the amount of walking change over time as people age, and (iii) is the change socioeconomically patterned? Methods The data come from the HABITAT study of physical activity, a bi-annual multilevel longitudinal survey of 11,036 residents of 200 neighbourhoods in Brisbane, Australia. At each wave (2007, 2009 and 2011) respondents estimated the duration (minutes) of WfT in the previous 7 days. Neighbourhood disadvantage was measured using a census-derived index comprising 17 different socioeconomic components, and individual-level socioeconomic position was measured using education, occupation, and household income. The data were analysed using multilevel mixed-effects logistic and linear regression. Results The odds of being defined as a ‘never walker’ were significantly lower for residents of disadvantaged neighbourhoods, but significantly higher for the less educated, blue collar employees, and members of lower income households. WfT declined significantly over time as people aged and the declines were more precipitous for older persons. Average minutes of WfT declined for all neighbourhoods and most socioeconomic groups; however, the declines were steeper for the retired and members of low income households. Conclusions Designing age-friendly neighbourhoods might slow or delay age-related declines in WfT and should be a priority. Steeper declines in WfT among residents of low income households may reflect their poorer health status and the impact of adverse socioeconomic exposures over the life course. Each of these declines represents a significant challenge to public health advocates, urban designers, and planners in their attempts to keep people active and healthy in their later years of life.

Associations between individual socioeconomic position, neighbourhood disadvantage, and transport mode: Baseline results from the HABITAT multilevel study

Background Understanding how different socioeconomic indicators are associated with transport modes provide insight into which interventions might contribute to reducing socioeconomic inequalities in health. The purpose of this study was to examine associations between neighbourhood-level socioeconomic disadvantage, individual-level socioeconomic position (SEP) and usual transport mode. Methods This investigation included 11,036 residents from 200 neighbourhoods in Brisbane, Australia. Respondents self-reported their usual transport mode (car or motorbike, public transport, walking or cycling). Indicators for individual-level SEP were education, occupation, and household income; and neighbourhood disadvantage was measured using a census-derived index. Data were analysed using multilevel multinomial logistic regression. High SEP respondents and residents of the most advantaged neighbourhoods who used a private motor vehicle as their usual form of transport was the reference category. Results Compared with driving a motor vehicle, the odds of using public transport were higher for white collar employees (OR1.68, 95%CrI 1.41-2.01), members of lower income households (OR 1.71 95%CrI 1.25-2.30), and residents of more disadvantaged neighbourhoods (OR 1.93, 95%CrI 1.46-2.54); and lower for respondents with a certificate-level education (OR 0.60, 95%CrI 0.49-0.74) and blue collar workers (OR 0.63, 95%CrI 0.50-0.81). The odds of walking for transport were higher for the least educated (OR 1.58, 95%CrI 1.18-2.11), those not in the labour force (OR 1.94, 95%CrI 1.38-2.72), members of lower income households (OR 2.10, 95%CrI 1.23-3.64), and residents of more disadvantaged neighbourhoods (OR 2.73, 95%CrI 1.46-5.24). The odds of cycling were lower among less educated groups (OR 0.31, 95% CrI 0.19-0.48). Conclusion The relationships between socioeconomic characteristics and transport modes are complex, and provide challenges for those attempting to encourage active forms of transportation. Further work is required exploring the individual- and neighbourhood-level mechanisms behind transport mode choice, and what factors might influence individuals from different socioeconomic backgrounds to change to more active transport modes.

A preference-based semantics for CTD reasoning

In [8] the authors developed a logical system based on the definition of a new non-classical connective ⊗ capturing the notion of reparative obligation. The system proved to be appropriate for handling well-known contrary-to-duty paradoxes but no model-theoretic semantics was presented. In this paper we fill the gap and define a suitable possible-world semantics for the system for which we can prove soundness and completeness. The semantics is a preference-based non-normal one extending and generalizing semantics for classical modal logics.

Urban growth and development of contemporary neighbourhood public space in Kathmandu Valley, Nepal

Rapid and unplanned growth of Kathmandu Valley towns over the past decades has resulted in the haphazard development of new neighbourhoods with significant consequences on their public space. This paper examines the development of public space in the valley’s new neighbourhoods in the context of the current urban growth. A case study approach of three new neighbourhoods was developed to examine the provision of public space with data collected from site observations, interviews with neighbourhood residents and other secondary sources. The cases studies consist of both planned and unplanned new neighbourhoods. Findings reveal a severe loss of public space in the unplanned new neighbourhoods. In planned new neighbourhoods, the provision of public space remains poor in terms of physical features, and thus, does not support community activities and needs. Several factors, which are an outcome of the lack of proper urban growth initiatives and control measures, such as an overall drawback in the formation of new neighbourhoods, the poor capacity of local community-based organisations and the encroachment of public land are responsible for the present development of neighbourhood public space. The problems with ongoing management of public spaces are a significant issue in both unplanned and planned new neighbourhoods.

Dependence Logic: Investigations into Higher-Order Semantics Defined on Teams

This thesis is a study of a rather new logic called dependence logic and its closure under classical negation, team logic. In this thesis, dependence logic is investigated from several aspects. Some rules are presented for quantifier swapping in dependence logic and team logic. Such rules are among the basic tools one must be familiar with in order to gain the required intuition for using the logic for practical purposes. The thesis compares Ehrenfeucht-Fraïssé (EF) games of first order logic and dependence logic and defines a third EF game that characterises a mixed case where first order formulas are measured in the formula rank of dependence logic. The thesis contains detailed proofs of several translations between dependence logic, team logic, second order logic and its existential fragment. Translations are useful for showing relationships between the expressive powers of logics. Also, by inspecting the form of the translated formulas, one can see how an aspect of one logic can be expressed in the other logic. The thesis makes preliminary investigations into proof theory of dependence logic. Attempts focus on finding a complete proof system for a modest yet nontrivial fragment of dependence logic. A key problem is identified and addressed in adapting a known proof system of classical propositional logic to become a proof system for the fragment, namely that the rule of contraction is needed but is unsound in its unrestricted form. A proof system is suggested for the fragment and its completeness conjectured. Finally, the thesis investigates the very foundation of dependence logic. An alternative semantics called 1-semantics is suggested for the syntax of dependence logic. There are several key differences between 1-semantics and other semantics of dependence logic. 1-semantics is derived from first order semantics by a natural type shift. Therefore 1-semantics reflects an established semantics in a coherent manner. Negation in 1-semantics is a semantic operation and satisfies the law of excluded middle. A translation is provided from unrestricted formulas of existential second order logic into 1-semantics. Also game theoretic semantics are considerd in the light of 1-semantics.

A denotational semantics for the generalized ER model and a simple ER algebra

The recent spurt of research activities in Entity-Relationship Approach to databases calls for a close scrutiny of the semantics of the underlying Entity-Relationship models, data manipulation languages, data definition languages, etc. For reasons well known, it is very desirable and sometimes imperative to give formal description of the semantics. In this paper, we consider a specific ER model, the generalized Entity-Relationship model (without attributes on relationships) and give denotational semantics for the model as well as a simple ER algebra based on the model. Our formalism is based on the Vienna Development Method—the meta language (VDM). We also discuss the salient features of the given semantics in detail and suggest directions for further work.

Agglomerative clustering using the concept of mutual nearest neighbourhood

A method for determining the mutual nearest neighbours (MNN) and mutual neighbourhood value (mnv) of a sample point, using the conventional nearest neighbours, is suggested. A nonparametric, hierarchical, agglomerative clustering algorithm is developed using the above concepts. The algorithm is simple, deterministic, noniterative, requires low storage and is able to discern spherical and nonspherical clusters. The method is applicable to a wide class of data of arbitrary shape, large size and high dimensionality. The algorithm can discern mutually homogenous clusters. Strong or weak patterns can be discerned by properly choosing the neighbourhood width.

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose–accept rounds executed by the Gale–Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at an almost stable matching even without full information about the problem instance; for each participant, knowing only its local neighbourhood is enough. In distributed-systems parlance, this means that if each person has only a constant number of acceptable partners, an almost stable matching emerges after a constant number of synchronous communication rounds. We apply our results to give a distributed (2 + ε)-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching.

The Linear Ordering Problem Revisited

The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an instance of the problem, and proposes a method to incorporate the obtained knowledge in order to improve the performance of local search-based algorithms. The procedure introduced identifies the positions where the indexes cannot generate local optima for the insert neighbourhood, and thus global optima solutions. This information is then used to propose a restricted insert neighbourhood that discards the insert operations which move indexes to positions where optimal solutions are not generated. In order to measure the efficiency of the proposed restricted insert neighbourhood system, two state-of-the-art algorithms for the LOP that include local search procedures have been modified. Conducted experiments confirm that the restricted versions of the algorithms outperform the classical designs systematically. The statistical test included in the experimentation reports significant differences in all the cases, which validates the efficiency of our proposal.