158 research outputs found

    Correlates of active commuting, transport physical activity, and light rail use in a university setting

    Get PDF
    Introduction: This study identified correlates of active commute mode, transport physical activity (TPA), and intention to use light rail transit (LRT) at a large university in advance of a new LRT connection to campus. Methods: Staff, faculty and students completed a campus-wide travel survey in 2017. Multivariable logistic and linear regression models assessed associations between individual, organizational and environmental correlates with outcomes of interest in a sample of 6894 respondents to identify factors that may encourage a shift from vehicle to active commute modes and increase TPA. Results: Those who biked or walked to campus exceeded weekly physical activity recommendations in TPA alone. Commuting by transit was associated with higher levels of TPA, compared to vehicle commuting. Greater commute mode enjoyment was associated with active modes. Staff were least likely to commute via active transport (AT) and had fewer minutes of TPA. Women and Asian racial groups were less likely to report TPA. Rideshare and discounted transit pass use were positively associated with all outcomes. Conclusions: New LRT presents a critical opportunity to achieve gains in both campus health and environmental sustainability. The factors identified in this study should be further explored as potential intervention or programmatic targets to encourage mode shift

    Erratum to: 36th International Symposium on Intensive Care and Emergency Medicine

    Get PDF
    [This corrects the article DOI: 10.1186/s13054-016-1208-6.]

    Maximal Antichain Lattice Algorithms for Distributed Computations

    No full text
    Abstract. The lattice of maximal antichains of a distributed computation is generally much smaller than its lattice of consistent global states. We show that a useful class of predicates can be detected on the lattice of maximal antichains instead of the lattice of consistent cuts obtaining significant (exponential for many cases) savings. We then propose new online and offline algorithms to construct and enumerate the lattice of maximal antichains. Previously known algorithm by Nourine and Raynoud [NR99,NR02] to construct the lattice takes O(n 2 m) time where n is the number of events in the computation, and m is the size of the lattice of maximal antichains. The algorithm by Jourdan, Rampon and Jard [JRJ94] takes O((n + w 2)wm) time where w is the width of the computation. All these algorithms assume as input the lattice of maximal antichains prior to the arrival of a new event. We present a new online incremental algorithm, OLMA, that computes the newly added elements to the lattice without requiring the prior lattice. Since the lattice may be exponential in the size of the computation, we get a significant reduction in the space complexity. The OLMA algorithm takes O(mw 2 log wL) time and O(wLw log n) space where wL is the width of the lattice of maximal antichains. The lower space complexity makes our algorithm applicable for online global predicate detection in a distributed system. For the purposes of analyzing offline traces, we also propose new enumeration algorithms to traverse the lattice.
    corecore