Luchthuishouding van bodem en plant : overzicht processen en kenmerkende grootheden

Geprobeerd is om een zo volledig mogelijk overzicht te geven van processen en relaties, die met het oog op de luchthuishouding van de grond van invloed zijn op de uiteindelijke gewasproduktie

Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice

This paper provides a case-study in the field of metric semantics for probabilistic programming. Both an operational and a denotational semantics are presented for an abstract process language L_pr, which features action refinement and probabilistic choice. The two models are constructed in the setting of complete ultrametric spaces, here based on probability measures of compact support over sequences of actions. It is shown that the standard toolkit for metric semantics works well in the probabilistic context of L_pr, e.g. in establishing the correctness of the denotational semantics with respect to the operational one. In addition, it is shown how the method of proving full abstraction --as proposed recently by the authors for a nondeterministic language with action refinement-- can be adapted to deal with the probabilistic language L_pr as well

Least fixed points revisited

Parameter mechanisms for recursive procedures are investigated. Contrary to the view of Manna et al., it is argued that both call-by-value and call-by-name mechanisms yield the least fixed points of the functionals determined by the bodies of the procedures concerned. These functionals differ, however, according to the mechanism chosen. A careful and detailed presentation of this result is given, along the lines of a simple typed lambda calculus, with interpretation rules modelling program execution in such a way that call-by-value determines a change in the environment and call-by-name a textual substitution in the procedure body

Ex Ante Impact Assessment of Policies Affecting Land Use, Part B: Application of the Analytical Framework

The use of science-based tools for impact assessment has increasingly gained focus in addressing the complexity of interactions between environment, society, and economy. For integrated assessment of policies affecting land use, an analytical framework was developed. The aim of our work was to apply the analytical framework for specific scenario cases and in combination with quantitative and qualitative application methods. The analytical framework was tested for two cases involving the ex ante impact assessment of: (1) a European Common Agricultural Policy (CAP) financial reform scenario employing a modeling approach and combined with a comprehensive indicator analysis and valuation; and (2) a regional bioenergy policy scenario, employing a fully participatory approach. The results showed that European land use in general is less sensitive to changes in the Common Agricultural Policy, but in the context of regions there can be significant impacts on the functions of land use. In general, the implementation of the analytical framework for impact assessment proved to be doable with both methods, i.e., with the quantitative modeling and with the qualitative participatory approach. A key advantage of using the system of linked quantitative models is that it makes possible the simultaneous consideration of all relevant sectors of the economy without abstaining from a great level of detail for sectors of particular interest. Other advantages lie in the incontestable character of the results. Based on neutral, existing data with a fixed set of settings and regions, an absolute comparability and reproducibility throughout Europe can be maintained. Analyzing the pros and cons of both approaches showed that they could be used complementarily rather than be seen as competing alternatives

Four domains for concurrency

AbstractWe give four domains for concurrency in a uniform way by means of domain equations. The domains are intended for modelling the four possible combinations of linear time versus branching time, and of interleaving versus noninterleaving concurrency. We use the linear time, noninterleaved domain to give operational and denotational semantics for a simple concurrent language with recursion, and prove that O = D