Theoretical and Computational Basis for CATNETS - Annual Report Year 3

In this document the developments in defining the computational and theoretical framework for economical resource allocation are described. Accordingly the formal specification of the market mechanisms, bidding strategies of the involved agents and the integration of the market mechanisms into the simulator were refined. --Grid Computing

Theoretical and Computational Basis for CATNETS - Annual Report Year 2

In this work the self-organising potential of the CATNETS allocation mechanism is described to provide a more comprehensive view on the research done in this project. The formal description of either the centralised and decentralised approach is presented. Furthermore the agents' bidding model is described and a comprehensive overview on how the catallactic mechanism is incorporated into the middleware and simulator environments is given. --Decentralized Market Mechanisms,Centralized Market Mechanisms,Catallaxy,Market Engineering,Simulator Integration,Prototype Integration

Provably Total Functions of Arithmetic with Basic Terms

A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and existential introduction.Comment: In Proceedings DICE 2011, arXiv:1201.034

Pointer Analysis for C Programs Through AST Traversal

We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantled intermediate form of the source program, making them difficult to apply to source-to-source tools that generally work on abstract syntax trees to preserve details of the source program. Our pointer analysis algorithm operates directly on the abstract syntax tree of a C program and uses a form of standard dataflow analysis to compute the desired points-to information. We have implemented our algorithm in a source-to-source translation framework and experimental results show that it is practical on real-world examples

Pointer Analysis for Source-to-Source Transformations

We present a pointer analysis algorithm designed for source-to-source transformations. Existing techniques for pointer analysis apply a collection of inference rules to a dismantled intermediate form of the source program, making them difficult to apply to source-to-source tools that generally work on abstract syntax trees to preserve details of the source program. Our pointer analysis algorithm operates directly on the abstract syntax tree of a C program and uses a form of standard dataflow analysis to compute the desired points-to information. We have implemented our algorithm in a source-to-source translation framework and experimental results show that it is practical on real-world examples

Theoretical and computational basis for CATNETS - annual report year 3

In this document the developments in defining the computational and theoretical framework for economical resource allocation are described. Accordingly the formal specification of the market mechanisms, bidding strategies of the involved agents and the integration of the market mechanisms into the simulator were refined

Theoretical and Computation Basis for CATNETS - Annual Report Year 3

In this work the self-organising potential of the CATNETS allocation mechanism is described to provide a more comprehensive view on the research done in this project. The formal description of either the centralised and decentralised approach is presented. Furthermore the agents' bidding model is described and a comprehensive overview on how the catallactic mechanism is incorporated into the middleware and simulator environments is given

Implicit complexity for coinductive data: a characterization of corecurrence

We propose a framework for reasoning about programs that manipulate coinductive data as well as inductive data. Our approach is based on using equational programs, which support a seamless combination of computation and reasoning, and using productivity (fairness) as the fundamental assertion, rather than bi-simulation. The latter is expressible in terms of the former. As an application to this framework, we give an implicit characterization of corecurrence: a function is definable using corecurrence iff its productivity is provable using coinduction for formulas in which data-predicates do not occur negatively. This is an analog, albeit in weaker form, of a characterization of recurrence (i.e. primitive recursion) in [Leivant, Unipolar induction, TCS 318, 2004].Comment: In Proceedings DICE 2011, arXiv:1201.034

Advancing climate change health adaptation through implementation science

To date, there are few examples of implementation science studies that help guide climate-related health adaptation. Implementation science is the study of methods to promote the adoption and integration of evidence-based tools, interventions, and policies into practice to improve population health. These studies can provide the needed empirical evidence to prioritise and inform implementation of health adaptation efforts. This Personal View discusses five case studies that deployed disease early warning systems around the world. These cases studies illustrate challenges to deploying early warning systems and guide recommendations for implementation science approaches to enhance future research. We propose theory-informed approaches to understand multilevel barriers, design strategies to overcome those barriers, and analyse the ability of those strategies to advance the uptake and scale-up of climate-related health interventions. These findings build upon previous theoretical work by grounding implementation science recommendations and guidance in the context of real-world practice, as detailed in the case studies.Peer ReviewedArticle signat per 14 autors/es: Gila Neta, PhD; William Pan, DrPH; Prof Kristie Ebi, PhD; Daniel F Buss, PhD; Trisha Castranio, BS; Prof Rachel Lowe, PhD; Sadie J Ryan, PhD; Anna M Stewart-Ibarra, PhD; Limb K Hapairai, PhD; Meena Sehgal, MPH; Prof Michael C Wimberly, PhD; Leslie Rollock, DrPH; Prof Maureen Lichtveld, MD; John Balbus, MD"Postprint (published version