Many arid grassland communities are changing from grass dominance to shrub dominance, but the mechanisms involved in this conversion process are not completely understood. Aeolian processes likely contribute to this conversion from grassland to shrubland. The purpose of this research is to provide information regarding how vegetation changes occur in an arid grassland as a result of aeolian sed...

Land cover plays a major role in many biogeochemical models that represent processes and connections with terrestrial systems; hence, it is a key component for public decisions in ecosystems management. The advance of remote sensing technology, combined with the emergence of new operational products, offers alternatives to improve the accuracy of environmental monitoring and analysis. This work...

Loss of tropical forests and changes in land-use/land-cover are of growing concern worldwide. Although knowledge exists about the institutional context in which tropical forest loss is embedded, little is known about the role of social institutions in influencing regeneration of tropical forests. In the present study we used Landsat images from southern Madagascar from three different years (19...

In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...

Vegetation structure and density affect the dynamics of snow accumulation and ablation. Vegetation also affects our ability to estimate snow-covered area accurately from satellite-based sensors. The objective of this case study is to demonstrate how the angular pattern of reflectance from vegetation over snow can provide information on forest cover density. Imagery from the Multi-angle Imaging ...

Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...

Article history: Received 21 October 2013 Received in revised form 30 September 2014 Accepted 21 October 2014 Available online 28 October 2014 Communicated by G. Ausiello