Exploring the psychological rewards of a familiar semirural landscape: connecting to local nature through a mindful approach

This study analyses a 53,000 word diary of a year engaging with nature through over 200 trips to a semi-rural landscape. Thematic analysis revealed two themes; the transition from observer to nature connectedness and the ways in which the natural environment was experienced once a connection was made. These themes are discussed in relation to theories that seek to explain the positive effect of nature and nature connectedness. The findings are important as they suggest that repeated engagement with local semi-rural countryside can lead to a mindful approach and psychological rewards that do not require travel into the wilderness. The work informs further research into outcomes and processes of nature based interventions such as: trip frequency, duration and diary keeping

On two problems in graph Ramsey theory

We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every two-coloring of the edges of the complete graph $K_N$ contains a monochromatic copy of H. A famous result of Chv\'atal, R\"{o}dl, Szemer\'edi and Trotter states that there exists a constant c(\Delta) such that r(H) \leq c(\Delta) n for every graph H with n vertices and maximum degree \Delta. The important open question is to determine the constant c(\Delta). The best results, both due to Graham, R\"{o}dl and Ruci\'nski, state that there are constants c and c' such that 2^{c' \Delta} \leq c(\Delta) \leq 2^{c \Delta \log^2 \Delta}. We improve this upper bound, showing that there is a constant c for which c(\Delta) \leq 2^{c \Delta \log \Delta}. The induced Ramsey number r_{ind}(H) of a graph H is the least positive integer N for which there exists a graph G on N vertices such that every two-coloring of the edges of G contains an induced monochromatic copy of H. Erd\H{o}s conjectured the existence of a constant c such that, for any graph H on n vertices, r_{ind}(H) \leq 2^{c n}. We move a step closer to proving this conjecture, showing that r_{ind} (H) \leq 2^{c n \log n}. This improves upon an earlier result of Kohayakawa, Pr\"{o}mel and R\"{o}dl by a factor of \log n in the exponent.Comment: 18 page

Ambient particulate pollution and the world-wide prevalence of asthma, rhinoconjunctivitis and eczema in children: Phase One of the International Study of Asthma and Allergies in Childhood (ISAAC)

Objectives: To investigate the effect of ambient particulate matter on variation in childhood prevalence of asthma, rhinoconjunctivitis and eczema. Methods: Prevalences of asthma, rhinoconjunctivitis and eczema obtained in Phase One of the International Study of Asthma and Allergies in Childhood (ISAAC) were matched with city-level estimates of residential PM10 obtained from a World Bank model. Associations were investigated using binomial regression adjusting for GNP per capita and for clustering within country. For countries with more than one centre, a two stage meta-analysis was carried out. The results were compared with a meta-analysis of published multi-centre studies. Results: Annual concentrations of PM₁₀ at city level were obtained for 105 ISAAC centres in 51 countries. After controlling for GNP per capita, there was a weak negative association between PM₁₀ and various outcomes. For severe wheeze in 13-14-year-olds, the OR for a 10 μg/m³ increase in PM₁₀ was 0.92 (95 CI 0.84 to 1.00). In 24 countries with more than one centre, most summary estimates for within-country associations were weakly positive. For severe wheeze in 13-14-year-olds, the summary OR for a 10 μg/m³ increase in PM₁₀ was 1.01 (0.92 to 1.10). This result was close to a summary OR of 0.99 (0.91 to 1.06) obtained from published multi-centre studies. Conclusions: Modelled estimates of particulate matter at city level are imprecise and incomplete estimates of personal exposure to ambient air pollutants. Nevertheless, our results together with those of previous multi-centre studies, suggest that urban background PM₁₀ has little or no association with the prevalence of childhood asthma, rhinoconjunctivitis or eczema either within or between countries

Improving Phase Change Memory Performance with Data Content Aware Access

A prominent characteristic of write operation in Phase-Change Memory (PCM) is that its latency and energy are sensitive to the data to be written as well as the content that is overwritten. We observe that overwriting unknown memory content can incur significantly higher latency and energy compared to overwriting known all-zeros or all-ones content. This is because all-zeros or all-ones content is overwritten by programming the PCM cells only in one direction, i.e., using either SET or RESET operations, not both. In this paper, we propose data content aware PCM writes (DATACON), a new mechanism that reduces the latency and energy of PCM writes by redirecting these requests to overwrite memory locations containing all-zeros or all-ones. DATACON operates in three steps. First, it estimates how much a PCM write access would benefit from overwriting known content (e.g., all-zeros, or all-ones) by comprehensively considering the number of set bits in the data to be written, and the energy-latency trade-offs for SET and RESET operations in PCM. Second, it translates the write address to a physical address within memory that contains the best type of content to overwrite, and records this translation in a table for future accesses. We exploit data access locality in workloads to minimize the address translation overhead. Third, it re-initializes unused memory locations with known all-zeros or all-ones content in a manner that does not interfere with regular read and write accesses. DATACON overwrites unknown content only when it is absolutely necessary to do so. We evaluate DATACON with workloads from state-of-the-art machine learning applications, SPEC CPU2017, and NAS Parallel Benchmarks. Results demonstrate that DATACON significantly improves system performance and memory system energy consumption compared to the best of performance-oriented state-of-the-art techniques.Comment: 18 pages, 21 figures, accepted at ACM SIGPLAN International Symposium on Memory Management (ISMM

Dynamics of multi-stage infections on networks

This paper investigates the dynamics of infectious diseases with a nonexponentially distributed infectious period. This is achieved by considering a multistage infection model on networks. Using pairwise approximation with a standard closure, a number of important characteristics of disease dynamics are derived analytically, including the final size of an epidemic and a threshold for epidemic outbreaks, and it is shown how these quantities depend on disease characteristics, as well as the number of disease stages. Stochastic simulations of dynamics on networks are performed and compared to output of pairwise models for several realistic examples of infectious diseases to illustrate the role played by the number of stages in the disease dynamics. These results show that a higher number of disease stages results in faster epidemic outbreaks with a higher peak prevalence and a larger final size of the epidemic. The agreement between the pairwise and simulation models is excellent in the cases we consider