439 research outputs found

    Helping smallholder farmers mitigate climate change

    Get PDF
    Key messages - Smallholder farmers can contribute significantly to climate change mitigation but will need incentives to adapt their practices. - Incentives from selling carbon credits are limited by low returns to farmers, high transaction costs, and the need for farmers to invest in mitigation activities long before they receive payments. - Improved food security, economic benefits and adaptation to climate change are more fundamental incentives that should accompany mitigation. - Designing agricultural investment and policy to provide up-front finance and longer term rewards for mitigation practices will help reach larger numbers of farmers than specialized mitigation interventions

    A simple group of order 44,352,000

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46258/1/209_2005_Article_BF01110435.pd

    Largeness and SQ-universality of cyclically presented groups

    Get PDF
    Largeness, SQ-universality, and the existence of free subgroups of rank 2 are measures of the complexity of a finitely presented group. We obtain conditions under which a cyclically presented group possesses one or more of these properties. We apply our results to a class of groups introduced by Prishchepov which contains, amongst others, the various generalizations of Fibonacci groups introduced by Campbell and Robertson

    Characterization of families of rank 3 permutation groups by the subdegrees II

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46712/1/13_2005_Article_BF01220928.pd

    Abstract Learning Frameworks for Synthesis

    Full text link
    We develop abstract learning frameworks (ALFs) for synthesis that embody the principles of CEGIS (counter-example based inductive synthesis) strategies that have become widely applicable in recent years. Our framework defines a general abstract framework of iterative learning, based on a hypothesis space that captures the synthesized objects, a sample space that forms the space on which induction is performed, and a concept space that abstractly defines the semantics of the learning process. We show that a variety of synthesis algorithms in current literature can be embedded in this general framework. While studying these embeddings, we also generalize some of the synthesis problems these instances are of, resulting in new ways of looking at synthesis problems using learning. We also investigate convergence issues for the general framework, and exhibit three recipes for convergence in finite time. The first two recipes generalize current techniques for convergence used by existing synthesis engines. The third technique is a more involved technique of which we know of no existing instantiation, and we instantiate it to concrete synthesis problems

    Peripheral fillings of relatively hyperbolic groups

    Full text link
    A group theoretic version of Dehn surgery is studied. Starting with an arbitrary relatively hyperbolic group GG we define a peripheral filling procedure, which produces quotients of GG by imitating the effect of the Dehn filling of a complete finite volume hyperbolic 3--manifold MM on the fundamental group π1(M)\pi_1(M). The main result of the paper is an algebraic counterpart of Thurston's hyperbolic Dehn surgery theorem. We also show that peripheral subgroups of GG 'almost' have the Congruence Extension Property and the group GG is approximated (in an algebraic sense) by its quotients obtained by peripheral fillings. Various applications of these results are discussed.Comment: The difference with the previous version is that Proposition 3.2 is proved for quasi--geodesics instead of geodesics. This allows to simplify the exposition in the last section. To appear in Invent. Mat

    Integrating Comprehensive Geriatric Assessment for people with COPD and frailty starting pulmonary rehabilitation: the Breathe Plus feasibility trial protocol.

    Get PDF
    One in five people with COPD also lives with frailty. People living with both COPD and frailty are at increased risk of poorer health and outcomes, and face challenges to completing pulmonary rehabilitation. Integrated approaches that are adapted to the additional context of frailty are required. The aim of the present study is to determine the feasibility of conducting a randomised controlled trial of an integrated Comprehensive Geriatric Assessment for people with COPD and frailty starting pulmonary rehabilitation. This is a multicentre, mixed-methods, assessor-blinded, randomised, parallel group, controlled feasibility trial ("Breathe Plus"; ISRCTN13051922). We aim to recruit 60 people aged ≥50 with both COPD and frailty referred for pulmonary rehabilitation. Participants will be randomised 1:1 to receive usual pulmonary rehabilitation, or pulmonary rehabilitation with an additional Comprehensive Geriatric Assessment. Outcomes (physical, psycho-social and service use) will be measured at baseline, 90 days and 180 days. We will also collect service and trial process data, and conduct qualitative interviews with a sub-group of participants and staff. We will undertake descriptive analysis of quantitative feasibility outcomes (recruitment, retention, missing data, blinding, contamination, fidelity), and framework analysis of qualitative feasibility outcomes (intervention acceptability and theory, outcome acceptability). Recommendations on progression to a full trial will comprise integration of quantitative and qualitative data, with input from relevant stakeholders. This study has been approved by a UK Research Ethics Committee (ref.: 19/LO/1402). This protocol describes the first study testing the feasibility of integrating a Comprehensive Geriatric Assessment alongside pulmonary rehabilitation, and testing this intervention within a mixed-methods randomised controlled trial

    On Measuring Non-Recursive Trade-Offs

    Full text link
    We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences in the decidability status of basic decision problems on the other. We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems

    An antiproton driver for ICF propulsion

    Get PDF
    Inertial confinement fusion (ICF) utilizing an anitprotoncatalyzed target is discussed as a possible source of propulsion for rapid interplanetary manned space missions. The relevant compression, ignition, and thrust mechanisms are presented. Progress on an experiment presently in progress at the Phillips Laboratory, Kirtland AFB, NM to demonstrate proof-of-principle is reviewed
    • …
    corecore