A New General Allometric Biomass Model

To implement monitoring and assessment of national forest biomass, it is becoming the trend to develop generalized single-tree biomass models suitable for large scale forest biomass estimation. Considering that the theoretical biomass allometric model developed by West et al. [1,2] was statistically different from the empirical one, the two parameters in the most commonly used biomass equation M=aDb were analyzed in this paper. Firstly, based on the knowledge of geometry, the theoretical value of parameter b was deduced, i.e., b=7/3(~2.33), and the comparison with many empirical studies conducted throughout the globe indicated that the theoretical parameter could describe soundly the average allometric relationship between aboveground biomass M and D (diameter on breast height). Secondly, using five datasets of aboveground biomass which consisted of 1441 M-D pairs of sample trees, the new general biomass allometric model was validated. Finally, the relationship between parameter a and wood density p was analyzed, and the linear regression was developed. The new model, which is not only simple but also species-specific, offers a feasible approach on establishment of generalized biomass models for regional and national forest biomass estimation

Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks

Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of human's physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (facebook, coauthor and email social networks), we find that the excitable senor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods

Bias Correction in Logarithmic Regression and Comparison with Weighted Regression for Nonlinear Models

Non-linear models with heteroscedasticity are commonly used in ecological and forestry modeling, and logarithmic regression and weighted regression are usually employed to estimate the parameters. Using the single-tree biomass data of three large samples, the bias correction in logarithmic regression for non-linear models was studied and comparison between logarithmic regression and weighted regression was discussed in this paper. Firstly, the imminent cause producing bias in logarithmic regression was analyzed, and a new correction factor was presented with which three commonly used bias correction factors were examined together, and the results showed that the correction factors presented here and derived by Baskerville (1972) should be recommended, which could insure the corrected model to be asymptotically consistent with that fitted by weighted regression. Secondly, the fitting results of weighted regression for non-linear models, using the weight function based on residual errors of the model estimated by ordinary least squares (OLS) and the general weight function (w=1/ƒ(x)2) presented by Zeng (1998) respectively, were compared with each other that showed two weight functions worked well and the general function was more applicable. It was suggested that the best way to fit non-linear models with heteroscedasticity would be using weighted regression, and if the total relative error of the estimates from the model fitted by the general weight function was more than a special allowance such as ±3%, a better weight function based on residual errors of the model fitted by OLS should be used in weighted regression

Modeling Compatible Single-Tree Aboveground Biomass Equations of Masson Pine (Pinus massoniana) in South China

In the background of facing up to the global climate change, it is becoming the inevitable demand to add forest biomass estimation to national forest resource monitoring. The biomass equations to be developed for forest biomass estimation should be compatible with volume equations. Based on the tree volume and aboveground biomass data of Masson pine (Pinus Massoniana Lamb.) in south China, the one, two and three-variable aboveground biomass equations and biomass conversion functions compatible with tree volume equations were constructed using the error-in-variable simultaneous equations in this paper. The results showed: (i) the prediction precision of aboveground biomass estimates from one variable equation was more than 95%; (ii) the regressions of aboveground biomass equations improved slightly when tree height and crown width were used together with diameter on breast height, although the contributions to regressions were statistically significant; (iii) for biomass conversion function on one variable, the conversion factor was decreased with growing diameter, but for conversion function on two variables, the factor was increased with growing diameter while decreased with growing tree height

End-to-end Learning for Short Text Expansion

Effectively making sense of short texts is a critical task for many real world applications such as search engines, social media services, and recommender systems. The task is particularly challenging as a short text contains very sparse information, often too sparse for a machine learning algorithm to pick up useful signals. A common practice for analyzing short text is to first expand it with external information, which is usually harvested from a large collection of longer texts. In literature, short text expansion has been done with all kinds of heuristics. We propose an end-to-end solution that automatically learns how to expand short text to optimize a given learning task. A novel deep memory network is proposed to automatically find relevant information from a collection of longer documents and reformulate the short text through a gating mechanism. Using short text classification as a demonstrating task, we show that the deep memory network significantly outperforms classical text expansion methods with comprehensive experiments on real world data sets.Comment: KDD'201