Prosopis, an Alien among the Sacred Trees of South India

The problematic of invasive species in an alien environment has aroused the attention of scientists all over the world for quite some time. One of the exotic tree species that has provoked special attention in the tropical drylands is Prosopis juliflora. Originating in South America, prosopis (hereafter referred to as prosopis) has been introduced in the hot and semi-arid zones of the world particularly to provide fuelwood, to stabilize sand dunes and to combat desertification. The tree has become an essential source for fuelwood and a provider of several other products and services in areas where it has become established. However, despite the numerous benefits the tree provides to rural people, in several regions prosopis has become a noxious weed with a negative impact on the environment and to the economy of farmers and landowners. In India, prosopis was introduced in Andhra Pradesh in 1877. The tree was then proclaimed as the precious child of the plant world by scientists and local people alike. The purpose of this study was to investigate the overall impact of prosopis on local rural livelihoods in the drylands of South India. Of particular interest was the examination of the different usages of the tree, especially as fuelwood, and people s perceptions of it. Furthermore, the study examined the negative impacts of the uncontrolled invasion of prosopis on croplands, and its occupation of the banks of irrigation canals and other water sources. As another central theme, this study analysed the Hindu classification system for nature and for trees in particular. In India, several tree species are regarded as sacred. This study examined the position of the exotic prosopis among sacred trees, such as the bodhi, banyan and neem trees. The principle method for collecting the field data was by using individual and thematic group interviews. These interviews were semi-structured with open ended questions. Moreover, unstructured interviews as well as general observations provided complementary information. The data were gathered during two fieldwork periods in the states of Andhra Pradesh and Tamil Nadu, in South India. The results confirmed that prosopis both provides benefits and causes hazards to different stakeholders. Farmers and agriculturalists suffer economic losses in areas where prosopis has invaded crop fields and competes with other plants for water and nutrients. On the other hand, for a significant number of poor rural people, prosopis has become an important source of livelihood benefits. This tree, which grows on government wastelands, is commonly a free resource for all and has thus become a major local source of fuelwood. It also provides several other goods and services and cash income that contributes to improve livelihoods in rural communities. Prosopis ranked lowest in the tree classificatioin system of the Hindus of South India. Although it is appreciated for many benefits it provides for poor people, it has remained an outsider compared with the indigenous tree species. On the other hand, the most sacred trees, such as the bodhi or the banyan, are completely excluded from extraction and it is seen as a sacrilege to even cut branches from any of these trees. An unexpected finding was that, in a few cases, prosopis had also been elevated to the status of a sacred tree. Goods and services from prosopis are not utilized in the most beneficial way. Silvicultural management practices are suggested that would provide additional income and employment opportunities. Interventions are recommended to control further invasion of the tree that might cause serious negative effects in the future. For Hindus, the sacred always ranks highest, even above economic gain. The conservation of sacred groves and sacred trees is a tradition that has its roots in ancient history. These socio-religious practices need to be respected and continued. Successful management of tree and forest resources depends on the willingness of the local people to manage their natural resources, and this willingness exists and has always existed in South India. Keywords: South India, drylands, livelihood, fuelwood, invasive, resource, silviculture.

A Geometric Algorithm for Learning Oblique Decision Trees

In this paper we present a novel algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess goodness of hyperplanes at each node. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy, based on some recent variants of SVM, to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. We show through empirical studies that our method is effective.

Reducing the babel in plant volatile communication: using the forest to see the trees

While plants of a single species emit a diversity of volatile organic compounds (VOCs) to attract or repel interacting organisms, these specific messages may be lost in the midst of the hundreds of VOCs produced by sympatric plants of different species, many of which may have no signal content. Receivers must be able to reduce the babel or noise in these VOCs in order to correctly identify the message. For chemical ecologists faced with vast amounts of data on volatile signatures of plants in different ecological contexts, it is imperative to employ accurate methods of classifying messages, so that suitable bioassays may then be designed to understand message content. We demonstrate the utility of `Random Forests' (RF), a machine-learning algorithm, for the task of classifying volatile signatures and choosing the minimum set of volatiles for accurate discrimination, using datam from sympatric Ficus species as a case study. We demonstrate the advantages of RF over conventional classification methods such as principal component analysis (PCA), as well as data-mining algorithms such as support vector machines (SVM), diagonal linear discriminant analysis (DLDA) and k-nearest neighbour (KNN) analysis. We show why a tree-building method such as RF, which is increasingly being used by the bioinformatics, food technology and medical community, is particularly advantageous for the study of plant communication using volatiles, dealing, as it must, with abundant noise.

Evaluation of the profitability of fast-growing tropical trees.

The profitability of fast-growing trees was investigated in the northeastern and eastern provinces of Thailand. The financial, economic, and tentative environmental-economic profitability was determined separately for three fast-growing plantation tree species and for three categories of plantation managers: the private industry, the state (the Royal Forest Department) and the farmers. Fast-growing tree crops were also compared with teak (Tectona grandis), a traditional medium or long rotation species, and Para rubber (Hevea brasiliensis) which presently is the most common cultivated tree in Thailand. The optimal rotation for Eucalyptus camaldulensis pulpwood production was eight years. This was the most profitable species in pulpwood production. In sawlog production Acacia mangium and Melia azedarach showed a better financial profitability. Para rubber was more profitable and teak less profitable than the three fast-growing species. The economic profitability was higher than the financial one, and the tentative environmental-economic profitability was slightly higher than the economic profitability. The profitability of tree growing is sensitive to plantation yields and labour cost changes and especially to wood prices. Management options which aim at pulpwood production are more sensitive to input or output changes than those options which include sawlog production. There is an urgent need to improve the growth and yield data and to study the environmental impacts of tree plantations for all species and plantation types.

Heating values of mature trees.

The effective heating values of the above and below ground biomass components of mature Scots pine (Pinus sylvestris), Norway spruce (Picea abies), downy birch (Betula pubescens), silver birch (Betula pendula), grey alder (Alnus incana), black alder (Alnus glutinosa) and trembling aspen (Populus tremula) were studied. Each sample tree was divided into wood, bark and foliage components. Bomb calorimetry was used to determine the calorimetric heating values. The species is a significant factor in the heating value of individual tree components. The heating value of the wood proper is highest in conifers. Broad-leaved species have a higher heating value of bark than conifers. The species factor diminishes when the weighted heating value of crown, whole stems or stump-root-system are considered. The crown material has a higher heating value per unit weight in comparison with fuelwood from small-sized stems or wholetrees. The additional advantages of coniferous crown material are that it is a non-industrial biomass resource and is readily available. The variability of both the chemical composition and the heating value is small in any given tree component of any species. However, lignin, carbohydrate and extractive content were found to vary from one part of the tree to another and to correlate with the heating value.

Trees of Panama and Costa Rica

Book Review

A divisive scheme for constructing minimal spanning trees in coordinate space

An algorithm to generate a minimal spanning tree is presented when the nodes with their coordinates in some m-dimensional Euclidean space and the corresponding metric are given. This algorithm is tested on manually generated data sets. The worst case time complexity of this algorithm is O(n log2n) for a collection of n data samples.

Scheduling expression trees with reusable registers on delayed-load architectures

In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.

Scheduling expression trees for delayed-load architectures

In this paper we consider the problem of scheduling expression trees on delayed-load architectures. The problem tackled here takes root from the one considered in [Proceedings of the ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation, 1991. p. 256] in which the leaves of the expression trees all refer to memory locations. A generalization of this involves the situation in which the trees may contain register variables, with the registers being used only at the leaves. Solutions to this generalization are given in [ACM Trans. Prog. Lang. Syst. 17 (1995) 740, Microproc. Microprog. 40 (1994) 577]. This paper considers the most general case in which the registers are reusable. This problem is tackled in [Comput. Lang, 21 (1995) 49] which gives an approximate solution to the problem under certain assumptions about the contiguity of the evaluation order: Here we propose an optimal solution (which may involve even a non-contiguous evaluation of the tree). The schedule generated by the algorithm given in this paper is optimal in the sense that it is an interlock-free schedule which uses the minimum number of registers required. An extension to the algorithm incorporates spilling. The problem as stated in this paper is an instruction scheduling problem. However, the problem could also be rephrased as an operations research problem with a difference in terminology. (C) 2002 Elsevier Science B.V. All rights reserved.

Rodent seed predation: effects on seed survival, recruitment, abundance, and dispersion of bird-dispersed tropical trees

Tropical tree species vary widely in their pattern of spatial dispersion. We focus on how seed predation may modify seed deposition patterns and affect the abundance and dispersion of adult trees in a tropical forest in India. Using plots across a range of seed densities, we examined whether seed predation levels by terrestrial rodents varied across six large-seeded, bird-dispersed tree species. Since inter-specific variation in density-dependent seed mortality may have downstream effects on recruitment and adult tree stages, we determined recruitment patterns close to and away from parent trees, along with adult tree abundance and dispersion patterns. Four species (Canarium resiniferum, Dysoxylum binectariferum, Horsfieldia kingii, and Prunus ceylanica) showed high predation levels (78.5-98.7%) and increased mortality with increasing seed density, while two species, Chisocheton cumingianus and Polyalthia simiarum, showed significantly lower seed predation levels and weak density-dependent mortality. The latter two species also had the highest recruitment near parent trees, with most abundant and aggregated adults. The four species that had high seed mortality had low recruitment under parent trees, were rare, and had more spaced adult tree dispersion. Biotic dispersal may be vital for species that suffer density-dependent mortality factors under parent trees. In tropical forests where large vertebrate seed dispersers but not seed predators are hunted, differences in seed vulnerability to rodent seed predation and density-dependent mortality can affect forest structure and composition.

Computing Reeb Graphs as a Union of Contour Trees

The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. This paper describes a fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds. The key idea in the proposed approach is to maximally leverage the efficient contour tree algorithm to compute the Reeb graph. The algorithm proceeds by dividing the input into a set of subvolumes that have loop-free Reeb graphs using the join tree of the scalar function and computes the Reeb graph by combining the contour trees of all the subvolumes. Since the key ingredient of this method is a series of union-find operations, the algorithm is fast in practice. Experimental results demonstrate that it outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input. The algorithm also extends to handle large data that do not fit in memory.

Multispecies coexistence of trees in tropical forests: spatial signals of topographic niche differentiation increase with environmental heterogeneity

Neutral and niche theories give contrasting explanations for the maintenance of tropical tree species diversity. Both have some empirical support, but methods to disentangle their effects have not yet been developed. We applied a statistical measure of spatial structure to data from 14 large tropical forest plots to test a prediction of niche theory that is incompatible with neutral theory: that species in heterogeneous environments should separate out in space according to their niche preferences. We chose plots across a range of topographic heterogeneity, and tested whether pairwise spatial associations among species were more variable in more heterogeneous sites. We found strong support for this prediction, based on a strong positive relationship between variance in the spatial structure of species pairs and topographic heterogeneity across sites. We interpret this pattern as evidence of pervasive niche differentiation, which increases in importance with increasing environmental heterogeneity.

On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.