462 research outputs found

    Lessons from obesity prevention for the prevention of mental disorders: The primordial prevention approach

    Get PDF
    Background: Emerging evidence supports a relationship between risk factors for obesity and the genesis of the common mental disorders, depression and anxiety. This suggests common mental disorders should be considered as a form of non-communicable disease, preventable through the modification of lifestyle behaviours, particularly diet and physical activity.Discussion: Obesity prevention research since the 1970\u27s represents a considerable body of knowledge regarding strategies to modify diet and physical activity and so there may be clear lessons from obesity prevention that apply to the prevention of mental disorders. For obesity, as for common mental disorders, adolescence represents a key period of vulnerability. In this paper we briefly discuss relationships between modifiable lifestyle risk factors and mental health, lifestyle risk factor interventions in obesity prevention research, the current state of mental health prevention, and the implications of current applications of systems thinking in obesity prevention research for lifestyle interventions.Summary: We propose a potential focus for future mental health promotion interventions and emphasise the importance of lessons available from other lifestyle modification intervention programmes

    Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

    Get PDF
    We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max(min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/epsilon), where epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We establish this result using a generalization of Newton's method which applies to maxPPSs and minPPSs, even though the underlying functions are only piecewise-differentiable. This generalizes our recent work which provided a P-time algorithm for purely probabilistic PPSs. These equations form the Bellman optimality equations for several important classes of infinite-state Markov Decision Processes (MDPs). Thus, as a corollary, we obtain the first polynomial time algorithms for computing to within arbitrary desired precision the optimal value vector for several classes of infinite-state MDPs which arise as extensions of classic, and heavily studied, purely stochastic processes. These include both the problem of maximizing and mininizing the termination (extinction) probability of multi-type branching MDPs, stochastic context-free MDPs, and 1-exit Recursive MDPs. Furthermore, we also show that we can compute in P-time an epsilon-optimal policy for both maximizing and minimizing branching, context-free, and 1-exit-Recursive MDPs, for any given desired epsilon > 0. This is despite the fact that actually computing optimal strategies is Sqrt-Sum-hard and PosSLP-hard in this setting. We also derive, as an easy consequence of these results, an FNP upper bound on the complexity of computing the value (within arbitrary desired precision) of branching simple stochastic games (BSSGs)

    Improved bounds for reduction to depth 4 and depth 3

    Full text link
    Koiran showed that if a nn-variate polynomial of degree dd (with d=nO(1)d=n^{O(1)}) is computed by a circuit of size ss, then it is also computed by a homogeneous circuit of depth four and of size 2O(dlog⁥(d)log⁥(s))2^{O(\sqrt{d}\log(d)\log(s))}. Using this result, Gupta, Kamath, Kayal and Saptharishi gave a exp⁥(O(dlog⁥(d)log⁥(n)log⁥(s)))\exp(O(\sqrt{d\log(d)\log(n)\log(s)})) upper bound for the size of the smallest depth three circuit computing a nn-variate polynomial of degree d=nO(1)d=n^{O(1)} given by a circuit of size ss. We improve here Koiran's bound. Indeed, we show that if we reduce an arithmetic circuit to depth four, then the size becomes exp⁥(O(dlog⁥(ds)log⁥(n)))\exp(O(\sqrt{d\log(ds)\log(n)})). Mimicking Gupta, Kamath, Kayal and Saptharishi's proof, it also implies the same upper bound for depth three circuits. This new bound is not far from optimal in the sense that Gupta, Kamath, Kayal and Saptharishi also showed a 2Ω(d)2^{\Omega(\sqrt{d})} lower bound for the size of homogeneous depth four circuits such that gates at the bottom have fan-in at most d\sqrt{d}. Finally, we show that this last lower bound also holds if the fan-in is at least d\sqrt{d}

    The accuracy of breast volume measurement methods: a systematic review

    Get PDF
    Breast volume is a key metric in breast surgery and there are a number of different methods which measure it. However, a lack of knowledge regarding a method’s accuracy and comparability has made it difficult to establish a clinical standard. We have performed a systematic review of the literature to examine the various techniques for measurement of breast volume and to assess their accuracy and usefulness in clinical practice. Each of the fifteen studies we identified had more than ten live participants and assessed volume measurement accuracy using a gold-standard based on the volume, or mass, of a mastectomy specimen. Many of the studies from this review report large (> 200 ml) uncertainty in breast volume and many fail to assess measurement accuracy using appropriate statistical tools. Of the methods assessed, MRI scanning consistently demonstrated the highest accuracy with three studies reporting errors lower than 10% for small (250 ml), medium (500 ml) and large (1,000 ml) breasts. However, as a high-cost, non-routine assessment other methods may be more appropriate

    The Impatient May Use Limited Optimism to Minimize Regret

    Full text link
    Discounted-sum games provide a formal model for the study of reinforcement learning, where the agent is enticed to get rewards early since later rewards are discounted. When the agent interacts with the environment, she may regret her actions, realizing that a previous choice was suboptimal given the behavior of the environment. The main contribution of this paper is a PSPACE algorithm for computing the minimum possible regret of a given game. To this end, several results of independent interest are shown. (1) We identify a class of regret-minimizing and admissible strategies that first assume that the environment is collaborating, then assume it is adversarial---the precise timing of the switch is key here. (2) Disregarding the computational cost of numerical analysis, we provide an NP algorithm that checks that the regret entailed by a given time-switching strategy exceeds a given value. (3) We show that determining whether a strategy minimizes regret is decidable in PSPACE

    The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

    Get PDF
    We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In particular, we prove that the following problem is undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1. Moreover, this problem remains undecidable if it is restricted to strategies with (unbounded) finite memory. However, if mixed strategies are allowed, decidability remains an open problem. One way to obtain a provably decidable variant of the problem is restricting the strategies to be positional or stationary. For the complexity of these two problems, we obtain a common lower bound of NP and upper bounds of NP and PSPACE respectively.Comment: 23 pages; revised versio

    The development and validation of an urbanicity scale in a multi-country study

    Get PDF
    Background : Although urban residence is consistently identified as one of the primary correlates of non-communicable disease in low- and middle-income countries, it is not clear why or how urban settings predispose individuals and populations to non-communicable disease (NCD), or how this relationship could be modified to slow the spread of NCD. The urban–rural dichotomy used in most population health research lacks the nuance and specificity necessary to understand the complex relationship between urbanicity and NCD risk. Previous studies have developed and validated quantitative tools to measure urbanicity continuously along several dimensions but all have been isolated to a single country. The purposes of this study were 1) To assess the feasibility and validity of a multi-country urbanicity scale; 2) To report some of the considerations that arise in applying such a scale in different countries; and, 3) To assess how this scale compares with previously validated scales of urbanicity. Methods : Household and community-level data from the Young Lives longitudinal study of childhood poverty in 59 communities in Ethiopia, India and Peru collected in 2006/2007 were used. Household-level data include parents’ occupations and education level, household possessions and access to resources. Community-level data include population size, availability of health facilities and types of roads. Variables were selected for inclusion in the urbanicity scale based on inspection of the data and a review of literature on urbanicity and health. Seven domains were constructed within the scale: Population Size, Economic Activity, Built Environment, Communication, Education, Diversity and Health Services. Results : The scale ranged from 11 to 61 (mean 35) with significant between country differences in mean urbanicity; Ethiopia (30.7), India (33.2), Peru (39.4). Construct validity was supported by factor analysis and high corrected item-scale correlations suggest good internal consistency. High agreement was observed between this scale and a dichotomized version of the urbanicity scale (Kappa 0.76; Spearman’s rank-correlation coefficient 0.84 (p < 0.0001). Linear regression of socioeconomic indicators on the urbanicity scale supported construct validity in all three countries (p < 0.05). Conclusions : This study demonstrates and validates a robust multidimensional, multi-country urbanicity scale. It is an important step on the path to creating a tool to assess complex processes like urbanization. This scale provides the means to understand which elements of urbanization have the greatest impact on health

    Optimizing ExoMars rover remote sensing multispectral science : cross-rover comparison using laboratory and orbital data

    Get PDF
    PMG, RBS, CRC, and EJA thank the UK Space Agency for support (grant ST/T001747/1). SM acknowledges a UK Science and Technology Facilities Council (STFC) PhD studentship (grant ST/R504961/1).Multispectral imaging instruments have been core payload components of Mars lander and rover missions for several decades. In order to place into context the future performance of the ExoMars Rosalind Franklin rover, we have carried out a detailed analysis of the spectral performance of three visible and near-infrared (VNIR) multispectral instruments. We have determined the root mean square error (RMSE) between the expected multispectral sampling of the instruments and high-resolution spectral reflectance data, using both laboratory spectral libraries and Mars orbital hyperspectral data. ExoMars Panoramic Camera (PanCam) and Mars2020 Perseverance Mastcam-Z instruments have similar values of RMSE, and are consistently lower than for Mars Science Laboratory Mastcam, across both laboratory and orbital remote sensing data sets. The performance across mineral groups is similar across all instruments, with the lowest RMSE values for hematite, basalt, and basaltic soil. Minerals with broader, or absent, absorption features in these visible wavelengths, such as olivine, saponite, and vermiculite have overall larger RMSE values. Instrument RMSE as a function of filter wavelength and bandwidth suggests that spectral parameters that use shorter wavelengths are likely to perform better. Our simulations of the spectral performance of the PanCam instrument will allow the future use of targeted filter selection during ExoMars 2022 Rosalind Franklin operations on Mars.Publisher PDFPeer reviewe
    • 

    corecore