Associations of neighbourhood greenness with physical and mental health : do walking, social coherence and local social interaction explain the relationships?

Background: Studies have shown associations between health indices and access to “green” environments but the underlying mechanisms of this association are not clear.

Objectives: To examine associations of perceived neighbourhood “greenness” with perceived physical and mental health and to investigate whether walking and social factors account for the relationships.

Methods: A mailed survey collected the following data from adults (n  =  1895) in Adelaide, Australia: physical and mental health scores (12-item short-form health survey); perceived neighbourhood greenness; walking for recreation and for transport; social coherence; local social interaction and sociodemographic variables.

Results: After adjusting for sociodemographic variables, those who perceived their neighbourhood as highly green had 1.37 and 1.60 times higher odds of better physical and mental health, respectively, compared with those who perceived the lowest greenness. Perceived greenness was also correlated with recreational walking and social factors. When walking for recreation and social factors were added to the regression models, recreational walking was a significant predictor of physical health; however, the association between greenness and physical health became non-significant. Recreational walking and social coherence were associated with mental health and the relationship between greenness and mental health remained significant.

Conclusions: Perceived neighbourhood greenness was more strongly associated with mental health than it was with physical health. Recreational walking seemed to explain the link between greenness and physical health, whereas the relationship between greenness and mental health was only partly accounted for by recreational walking and social coherence. The restorative effects of natural environments may be involved in the residual association of this latter relationship.

Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.

Refractive index tomography of turbid media by bifocal optical coherence refractometry

We demonstrate tomographic imaging of the refractive index of turbid media using bifocal optical coherence refractometry (BOCR). The technique, which is a variant of optical coherence tomography, is based on the measurement of the optical pathlength difference between two foci simultaneously present in a medium of interest. We describe a new method to axially shift the bifocal optical pathlength that avoids the need to physically relocate the objective lens or the sample during an axial scan, and present an experimental realization based on an adaptive liquid-crystal lens. We present experimental results, including video clips, which demonstrate refractive index tomography of a range of turbid liquid phantoms, as well as of human skin in vivo.

Manual on application of molecular tools in aquaculture and inland fisheries management. Part I : laboratory protocols, data management and analysis

The aim of this manual is to provide a comprehensive practical tool for the generation and analysis of genetic data for subsequent application in aquatic resources management in relation to genetic stock identification in inland fisheries and aquaculture. The material only covers general background on genetics in relation to aquaculture and fisheries resource management, the techniques and relevant methods of data analysis that are commonly used to address questions relating to genetic resource characterisation and population genetic analyses. No attempt is made to include applications of genetic improvement techniques e.g. selective breeding or producing genetically modified organisms (GMOs). The manual includes two ‘stand-alone’ parts, of which this is the second volume: Part 1 – Conceptual basis of population genetic approaches: will provide a basic foundation on genetics in general, and concepts of population genetics. Issues on the choices of molecular markers and project design are also discussed. Part 2 – Laboratory protocols, data management and analysis: will provide step-by-step protocols of the most commonly used molecular genetic techniques utilised in population genetics and systematic studies. In addition, a brief discussion and explanation of how these data are managed and analysed is also included. This manual is expected to enable NACA member country personnel to be trained to undertake molecular genetic studies in their own institutions, and as such is aimed at middle and higher level technical grades. The manual can also provide useful teaching material for specialised advanced level university courses in the region and postgraduate students. The manual has gone through two development/improvement stages. The initial material was tested at a regional workshop and at the second stage feedback from participants was used to improve the contents.

Anycast services and its applications

Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work.

Cache and replica lookup, indexing and synchronization in P2P environments

The major outcomes of this research project were the development of a set of decentralized algorithms to index, locate and synchronize replicated information in a networked environment. This study exploits the application specific design constraints of networked systems to improve performance, instead of relying on data structures and algorithms best suited to centralized systems.

High functional coherence in k-partite protein cliques of protein interaction networks

We introduce a new topological concept called k-partite protein cliques to study protein interaction (PPI) networks. In particular, we examine functional coherence of proteins in k-partite protein cliques. A k-partite protein clique is a k-partite maximal clique comprising two or more nonoverlapping protein subsets between any two of which full interactions are exhibited. In the detection of PPI’s k-partite maximal cliques, we propose to transform PPI networks into induced K-partite graphs with proteins as vertices where edges only exist among the graph’s partites. Then, we present a k-partite maximal clique mining (MaCMik) algorithm to enumerate k-partite maximal cliques from K-partite graphs. Our MaCMik algorithm is applied to a yeast PPI network. We observe that there does exist interesting and unusually high functional coherence in k-partite protein cliques—most proteins in k-partite protein cliques, especially those in the same partites, share the same functions. Therefore, the idea of k-partite protein cliques suggests a novel approach to characterizing PPI networks, and may help function prediction for unknown proteins.

Adjacency cache : an efficient P2P web cache indexing and lookup system

This paper describes the design and evaluation of an efficient per-to-peer (P2P) web cache indexing and lookup system, which can be used to integrate the resources of locally available web pages into globally addressable index using a distributed hash table. The salient feature of the indexing system’s design is the efficient dissemination of cache index information using a next-url index which allows cache clients to determine ahead of time whether linked content is also available at a remote cache. In addition, conventional optimizations such as in browser caching and batching of index write requests are also used. These optimizations are evaluated using trace-driven simulation and the results show that these design trade-offs improve cache lookup performance.

Multidisciplinary team developed and implemented protocols to assist mechanical ventilation weaning : a systematic review of literature

Aim: The aim of this review was to determine if ventilation-weaning protocols developed and implemented by multidisciplinary teams (MDTs) reduced the duration of mechanical ventilation in adult intensive care patients compared to usual care.

Method: A systematic review was conducted to review published research studies from January 1999 to June 2009 to identify and analyse the best available evidence on MDT-based weaning protocols in adult intensive care patients. All relevant studies based on electronic searches of MEDLINE, EMBASE, CINAHL, the Cochrane Controlled Trials Registry and the Cochrane Database of Systematic Reviews were included. Where possible data were pooled and a meta-analysis performed. A narrative synthesis of data was conducted to provide a critical appraisal of nonrandomised controlled trials included in the review.

Results: Three pre- and postinterventional studies were identified for inclusion in this review. Results show equivocal support for weaning protocols developed and implemented by MDTs for reducing duration of mechanical ventilation.

Conclusion: Communication and organizational processes must be addressed for multidisciplinary protocols to be effective. Due to methodological limitations of included studies, large randomised controlled trials are required to provide high-level evidence of the effects of MDT-based protocols on duration of mechanical ventilation.

A locality aware cache diffusion system

Web caching is a widely deployed technique to reduce the load to web servers and to reduce the latency for web browsers. Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack locality awareness. In this paper, we present the development of a locality aware cache diffusion system that makes use of routing table locality, aggregation, and soft state to overcome these limitations. The analysis and experiments show that our cache diffusion system reduces the amount of information processed by nodes, reduces the number of index messages sent by nodes, and improves the locality of cache pointers.

Further observations on optimistic fair exchange protocols in the multi-user setting

Recent research has shown that the single-user security of optimistic fair exchange cannot guarantee the multi-user security. This paper investigates the conditions under which the security of optimistic fair exchange in the single-user setting is preserved in the multi-user setting. We first introduce and define a property called “Strong Resolution-Ambiguity”. Then we prove that in the certified-key model, an optimistic fair exchange protocol is secure in the multi-user setting if it is secure in the single-user setting and has the property of strong resolution-ambiguity. Finally we provide a new construction of optimistic fair exchange with strong resolution-ambiguity. The new protocol is setup-free, stand-alone and multi-user secure without random oracles.