Transaction costs of farmers’ participation in forest management: Policy implications of payments for environmental services schemes in Vietnam

Recent research on payments for environmental services (PES) has observed that high transaction costs (TCs) are incurred through the implementation of PES schemes and farmer participation. TCs incurred by households are considered to be an obstacle to the participation in and efficiency of PES policies. This study aims to understand transactions related to previous forest plantation programmes and to estimate the actual TCs incurred by farmers who participated in these programmes in a mountainous area of northwestern Vietnam. In addition, this study examines determinants of households’ TCs to test the hypothesis of whether the amount of TCs varies according to household characteristics. Results show that average TCs are not likely to be a constraint for participation since they are about 200,000 VND (USD 10) per household per contract, which is equivalent to one person’s average earnings for about two days of labour. However, TCs amount to more than one-third of the programmes’ benefits, which is relatively high compared to PES programmes in developed countries. This implies that rather than aiming to reduce TCs, an appropriate agenda for policy improvement is to balance the level of TCs with PES programme benefits to enhance the overall attractiveness of afforestation programmes for smallholder farmers. Regression analysis reveals that education, gender and perception towards PES programmes have significant effects on the magnitude of TCs. The analyses also points out the importance of local conditions on the level of TCs, with some unexpected results.

CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions

We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-system M of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-system M' of restarting automata of the same type as M that, working in the new mode ed, accepts the language that M accepts in mode m. Further, we prove that in mode ed, a locally deterministic CD-system of restarting automata of type RR(W)(W) can be simulated by a locally deterministic CD-system of restarting automata of the more restricted type R(W)(W). This is the first time that a non-monotone type of R-automaton without auxiliary symbols is shown to be as expressive as the corresponding type of RR-automaton.

Semi-algebraic methods for symbolic analysis of complex reaction networks

The identification of chemical mechanism that can exhibit oscillatory phenomena in reaction networks are currently of intense interest. In particular, the parametric question of the existence of Hopf bifurcations has gained increasing popularity due to its relation to the oscillatory behavior around the fixed points. However, the detection of oscillations in high-dimensional systems and systems with constraints by the available symbolic methods has proven to be difficult. The development of new efficient methods are therefore required to tackle the complexity caused by the high-dimensionality and non-linearity of these systems. In this thesis, we mainly present efficient algorithmic methods to detect Hopf bifurcation fixed points in (bio)-chemical reaction networks with symbolic rate constants, thereby yielding information about their oscillatory behavior of the networks. The methods use the representations of the systems on convex coordinates that arise from stoichiometric network analysis. One of the methods called HoCoQ reduces the problem of determining the existence of Hopf bifurcation fixed points to a first-order formula over the ordered field of the reals that can then be solved using computational-logic packages. The second method called HoCaT uses ideas from tropical geometry to formulate a more efficient method that is incomplete in theory but worked very well for the attempted high-dimensional models involving more than 20 chemical species. The instability of reaction networks may lead to the oscillatory behaviour. Therefore, we investigate some criterions for their stability using convex coordinates and quantifier elimination techniques. We also study Muldowney's extension of the classical Bendixson-Dulac criterion for excluding periodic orbits to higher dimensions for polynomial vector fields and we discuss the use of simple conservation constraints and the use of parametric constraints for describing simple convex polytopes on which periodic orbits can be excluded by Muldowney's criteria. All developed algorithms have been integrated into a common software framework called PoCaB (platform to explore bio- chemical reaction networks by algebraic methods) allowing for automated computation workflows from the problem descriptions. PoCaB also contains a database for the algebraic entities computed from the models of chemical reaction networks.