EEPSEA was established in May 1993 to support research and training in environmental and resource economics. Its objective is to enhance local capacity to undertake the economic analysis of environmental problems and policies. It uses a networking approach, involving courses, meetings, technical support, access to literature and opportunities for a competitive research. ACKNOWLEDGEMENTS The aut...

Lidar-derived forest structural diversity (FSD) metrics—including measures of canopy height, vegetation arrangement, cover (CC), complexity and leaf area density—are increasingly used to describe characteristics can be infer many ecosystem functions. Despite broad adoption, the importance spatial resolution (grain extent) over which these metrics are calculated remains largely unconsidered. Oft...

We propose a novel forest reranking algorithm for discriminative dependency parsing based on a variant of Eisner’s generative model. In our framework, we define two kinds of generative model for reranking. One is learned from training data offline and the other from a forest generated by a baseline parser on the fly. The final prediction in the reranking stage is performed using linear interpol...

Recently, dependency grammar has gained renewed attention as empirical methods in parsing have emphasized the importance of relations between words, which is what dependency grammars model explicitly, but context-free phrase-structure grammars do not. While there has been much work on formalizing dependency grammar and on parsing algorithms for dependency grammars in the past, there is not a co...

Over the past five decades, the importance of rain forests has reached beyond their boundaries to play a critical role in national and international trade, economic development, and politics. This increased dependency on rain forests by national governments has to led to extensive deforestation throughout the world. The destruction of rain forests has caused concern among forest dwellers, envir...

This paper explores how to extend the dependency pair technique for proving termination of higher-order rewrite systems. In the first order case, the termination of term rewriting systems are proved by showing the non-existence of an infinite R-chain of the dependency pairs. However, the termination and the non-existence of an infinite R-chain do not coincide in the higher-order case. We introd...