Table 2: Areal distribution and specfic mass budget of Hintereisferner

Results of the direct, glaciological determination of the mass budget of Hintereisferner and Kesselwandferner in the Ötztal Alps are summarized for the years 1977/78-1980/81. Tabulations of budget quantities, accumulation and ablation areas are supplemented by graphs of altitudinal and areal distribution of mass balance and by examples of the seasonal course of ablation.

Global macrozoobenthos production and energy budget data base V150731, with link to database

I developed a new model for estimating annual production-to-biomass ratio P/B and production P of macrobenthic populations in marine and freshwater habitats. Self-learning artificial neural networks (ANN) were used to model the relationships between P/B and twenty easy-to-measure abiotic and biotic parameters in 1252 data sets of population production. Based on log-transformed data, the final predictive model estimates log(P/B) with reasonable accuracy and precision (r2 = 0.801; residual mean square RMS = 0.083). Body mass and water temperature contributed most to the explanatory power of the model. However, as with all least squares models using nonlinearly transformed data, back-transformation to natural scale introduces a bias in the model predictions, i.e., an underestimation of P/B (and P). When estimating production of assemblages of populations by adding up population estimates, accuracy decreases but precision increases with the number of populations in the assemblage.

Table 1: Mass budget of Hintereisferner and Kesselwandferner

Results of the direct, glaciological determination of the mass budget of Hintereisferner and Kesselwandferner in the Ötztal Alps are summarized for the years 1075/76-1977/78. Tabulations of budget quantities, accumulation and ablation areas are supplemented by graphs of altitudinal, and areal distribution of mass balance and by examples of the seasonal course of ablation.

Global and Regional Sea level budget components from GRACE and radar altimetry (2002-2014)

This dataset contains the result of a joint least squares inversion of GRACE and altimetry data. The results are evaluated in terms of sea level change for the global ocean as well as dedicated areas. In addition, some auxiliary data is provided to enable reproducibility of the results in Rietbroek et al. 2016, and a google Earth kmz file is provided which visualizes the trends derived from the inversion results.

Impact of long-term moderate hypercapnia and elevated temperature on the energy budget of isolated gills and branchial in vivo and in vitro enzyme capacities of Atlantic cod (Gadus morhua)

Effects of severe hypercapnia have been extensively studied in marine fishes, while knowledge on the impacts of moderately elevated CO2 levels and their combination with warming is scarce. Here we investigate ion regulation mechanisms and energy budget in gills from Atlantic cod acclimated long-term to elevated PCO2 levels (2500 µatm) and temperature (18 °C). Isolated perfused gill preparations established to determine gill thermal plasticity during acute exposures (10-22 °C) and in vivo costs of Na+/K+-ATPase activity, protein and RNA synthesis. Maximum enzyme capacities of F1Fo-ATPase, H+-ATPase and Na+/K+-ATPase were measured in vitro in crude gill homogenates. After whole animal acclimation to elevated PCO2 and/or warming, branchial oxygen consumption responded more strongly to acute temperature change. The fractions of gill respiration allocated to protein and RNA synthesis remained unchanged. In gills of fish CO2-exposed at both temperatures, energy turnover associated with Na+/K+-ATPase activity was reduced by 30% below rates of control fish. This contrasted in vitro capacities of Na+/K+-ATPase, which remained unchanged under elevated CO2 at 10 °C, and earlier studies which had found a strong upregulation under severe hypercapnia. F1Fo-ATPase capacities increased in hypercapnic gills at both temperatures, whereas Na+/K+ATPase and H+-ATPase capacities only increased in response to elevated CO2 and warming indicating the absence of thermal compensation under CO2. We conclude that in vivo ion regulatory energy demand is lowered under moderately elevated CO2 levels despite the stronger thermal response of total gill respiration and the upregulation of F1Fo-ATPase. This effect is maintained at elevated temperature.

Political institutions and policy outcomes : effects of presidential vetoes on budget making

The article examines how the power distribution between the executive and the legislature under the Presidential system affects policy outcomes. We focus in particular on the presidential veto, both package and partial. Using a simple game theory model, we show that the presidential partial veto generally yields a result in favor of the President, but that such effects vary depending on the reversion points of the package veto and the Congress's possible use of sanctions against the President. The effects of the Presidential partial veto diminish if the reversion point meets certain conditions, or if the Congress has no power to impose sufficient sanctions on the President when the President revises the outcome ex-post. To clarify and explain the model, we present the case of budget making in the Philippines between 1994 and 2008. In the Philippines, the presidential partial veto has been bringing expenditure programs closer to the President's ideal point within what may be called the Congress's indifference curve. The Congress, however, has not always passed budget bills and from time to time has carried over the previous year's budget, in years when the budget deficit increased. This is the situation that the policy makers cannot retrieve from the reversion point.

Restructuring the state budget system for disinflation and exchange rate unification in Myanmar

The installment of a new government has augmented the prospect for implementing disinflation and exchange rate unification in Myanmar. A close look at the state budget shows that the reform of the budget system for state economic enterprises (SEEs) is essential. Reforms need to hold the replacement of controlled prices including the official exchange rate with market prices in SEE operations, and the separation of the SEEs from the state budget. But separating the SEEs from the state budget will necessitate careful planning to cope with SEE bankruptcies which would imposes another fiscal burden on the government. Therefore, economic viability must be a criterion for the continuation of their operations.

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.

Incremental analysis of constraint logic programs

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inecient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the xed-point algorithms used in current generic analysis engines for (constraint) logic programming languages can be extended to support incremental analysis. The possible changes to a program are classied into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benets and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show signicant benets when using the proposed incremental analysis algorithms.

Global analysis of constraint logic programs

This article presents and illustrates a practical approach to the dataow analysis of constraint logic programming languages using abstract interpretation. It is rst argued that from the framework point of view it suces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for exist. This is shown by proposing a simple extension of Bruynooghes traditional framework which allows it to analyze constraint logic programs. Then and using this generalized framework two abstract domains and their required abstract functions are presented the rst abstract domain approximates deniteness information and the second one freeness. Finally an approach for cobining those domains is proposed The two domains and their combination have been implemented and used in the analysis of CLP and Prolog III applications. Results from this implementation showing its performance and accuracy are also presented

Some challenges for constraint programming

We propose a number of challenges for future constraint programming systems, including improvements in implementation technology (using global analysis based optimization and parallelism), debugging facilities, and the extensión of the application domain to distributed, global programming. We also briefly discuss how we are exploring techniques to meet these challenges in the context of the development of the CIAO constraint logic programming system.

Strategic directions in constraint programming

An abstract is not available.

CLP Projection for Constraint Handling Rules

This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demónstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing henee a ten year-old conjecture by Abdenader et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.

Combined static and dynamic assertion-based debugging of constraint logic programs

We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions for expressing properties of programs. We define several assertion schemas for writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs. The framework is aimed at detecting deviations of the program behavior (symptoms) with respect to the given assertions, either at compile-time (i.e., statically) or run-time (i.e., dynamically). We provide techniques for using information from global analysis both to detect at compile-time assertions which do not hold in at least one of the possible executions (i.e., static symptoms) and assertions which hold for all possible executions (i.e., statically proved assertions). We also provide program transformations which introduce tests in the program for checking at run-time those assertions whose status cannot be determined at compile-time. Both the static and the dynamic checking are provably safe in the sense that all errors flagged are definite violations of the pecifications. Finally, we report briefly on the currently implemented instances of the generic framework.