1 This is one of three background papers commissioned by the United Nations Forum for Forests. Background paper 1: Focuses on economic contributions of forests, by Agrawal, Shepherd and Cashore; Background Paper 2: Forests and crosssectorial linkages, by Lele, Karsenty, Benson, Fétiveau, Agarwal and Goswami; and Background paper 3: The role of forests in a future world, by Agrawal et al. Deline...

1 This is one of three background papers commissioned by the United Nations Forum for Forests. Background paper 1: Focuses on economic contributions of forests, by Agrawal, Shepherd and Cashore; Background Paper 2: Forests and cross-sectorial linkages, by Lele, Karsenty, Benson, Fétiveau, Agarwal and Goswami; and Background paper 3: The role of forests in a future world, by Agrawal et al. This ...

This study explores a semi-supervised classification approach using random forest as a base classifier to classify the low-back disorders (LBDs) risk associated with the industrial jobs. Semi-supervised classification approach uses unlabeled data together with the small number of labelled data to create a better classifier. The results obtained by the proposed approach are compared with those o...

The loop-erased random walk (LERW) in three dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.

The loop-erased random walk (LERW) in Zd, d ≥ 2, dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.

forest types mapping, is one of the most necessary elements in the forest management and silviculture treatments. traditional methods such as field surveys are almost time-consuming and cost-intensive. improvements in remote sensing data sources and classification –estimation methods are preparing new opportunities for obtaining more accurate forest biophysical attributes maps. this research co...

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to c log t, where t is the number of vertices, and c = c(k) is given as the solution to a t...