Species-area and species-individual relationships for tropical trees: A comparison of three 50-ha plots

1 Species-accumulation curves for woody plants were calculated in three tropical forests, based on fully mapped 50-ha plots in wet, old-growth forest in Peninsular Malaysia, in moist, old-growth forest in central Panama, and in dry, previously logged forest in southern India. A total of 610 000 stems were identified to species and mapped to < Im accuracy. Mean species number and stem number were calculated in quadrats as small as 5 m x 5 m to as large as 1000 m x 500 m, for a variety of stem sizes above 10 mm in diameter. Species-area curves were generated by plotting species number as a function of quadrat size; species-individual curves were generated from the same data, but using stem number as the independent variable rather than area. 2 Species-area curves had different forms for stems of different diameters, but species-individual curves were nearly independent of diameter class. With < 10(4) stems, species-individual curves were concave downward on log-log plots, with curves from different forests diverging, but beyond about 104 stems, the log-log curves became nearly linear, with all three sites having a similar slope. This indicates an asymptotic difference in richness between forests: the Malaysian site had 2.7 times as many species as Panama, which in turn was 3.3 times as rich as India. 3 Other details of the species-accumulation relationship were remarkably similar between the three sites. Rectangular quadrats had 5-27% more species than square quadrats of the same area, with longer and narrower quadrats increasingly diverse. Random samples of stems drawn from the entire 50 ha had 10-30% more species than square quadrats with the same number of stems. At both Pasoh and BCI, but not Mudumalai. species richness was slightly higher among intermediate-sized stems (50-100mm in diameter) than in either smaller or larger sizes, These patterns reflect aggregated distributions of individual species, plus weak density-dependent forces that tend to smooth the species abundance distribution and 'loosen' aggregations as stems grow. 4 The results provide support for the view that within each tree community, many species have their abundance and distribution guided more by random drift than deterministic interactions. The drift model predicts that the species-accumulation curve will have a declining slope on a log-log plot, reaching a slope of O.1 in about 50 ha. No other model of community structure can make such a precise prediction. 5 The results demonstrate that diversity studies based on different stem diameters can be compared by sampling identical numbers of stems. Moreover, they indicate that stem counts < 1000 in tropical forests will underestimate the percentage difference in species richness between two diverse sites. Fortunately, standard diversity indices (Fisher's sc, Shannon-Wiener) captured diversity differences in small stem samples more effectively than raw species richness, but both were sample size dependent. Two nonparametric richness estimators (Chao. jackknife) performed poorly, greatly underestimating true species richness.

Bounds on isoperimetric values of trees

Let G = (V, E) be a finite, simple and undirected graph. For S subset of V, let delta(S, G) = {(u, v) is an element of E : u is an element of S and v is an element of V - S} be the edge boundary of S. Given an integer i, 1 <= i <= vertical bar V vertical bar, let the edge isoperimetric value of G at i be defined as b(e)(i, G) = min(S subset of V:vertical bar S vertical bar=i)vertical bar delta(S, G)vertical bar. The edge isoperimetric peak of G is defined as b(e)(G) = max(1 <= j <=vertical bar V vertical bar)b(e)(j, G). Let b(v)(G) denote the vertex isoperimetric peak defined in a corresponding way. The problem of determining a lower bound for the vertex isoperimetric peak in complete t-ary trees was recently considered in [Y. Otachi, K. Yamazaki, A lower bound for the vertex boundary-width of complete k-ary trees, Discrete Mathematics, in press (doi: 10.1016/j.disc.2007.05.014)]. In this paper we provide bounds which improve those in the above cited paper. Our results can be generalized to arbitrary (rooted) trees. The depth d of a tree is the number of nodes on the longest path starting from the root and ending at a leaf. In this paper we show that for a complete binary tree of depth d (denoted as T-d(2)), c(1)d <= b(e) (T-d(2)) <= d and c(2)d <= b(v)(T-d(2)) <= d where c(1), c(2) are constants. For a complete t-ary tree of depth d (denoted as T-d(t)) and d >= c log t where c is a constant, we show that c(1)root td <= b(e)(T-d(t)) <= td and c(2)d/root t <= b(v) (T-d(t)) <= d where c(1), c(2) are constants. At the heart of our proof we have the following theorem which works for an arbitrary rooted tree and not just for a complete t-ary tree. Let T = (V, E, r) be a finite, connected and rooted tree - the root being the vertex r. Define a weight function w : V -> N where the weight w(u) of a vertex u is the number of its successors (including itself) and let the weight index eta(T) be defined as the number of distinct weights in the tree, i.e eta(T) vertical bar{w(u) : u is an element of V}vertical bar. For a positive integer k, let l(k) = vertical bar{i is an element of N : 1 <= i <= vertical bar V vertical bar, b(e)(i, G) <= k}vertical bar. We show that l(k) <= 2(2 eta+k k)

Tissue culture of forest trees: Clonal multiplication of Eucalyptus grandis L

Axillary shoot proliferation was obtained using explants of Eucalyptus grandis L. juvenile and mature stages on a defined medium. Murashige and Skoog medium (MS) supplemented with benzyladenine (BA), naphthalene acetic acid (NAA) and additional thiamine. Excised shoots were induced to root on a sequence of three media: (1) White's medium containing indoleacetic acid (IAA), NAA and indole butyric acid; (IBA), (2) half-strength MS medium with charcoal and (3) half-strength MS liquid medium. The two types of explants differed in rooting response, with juvenile-derived shoots giving 60% rooting and adult-derived ones only 35%. Thus, the factors limiting cloning of selected trees in vitro are determined to be those controlling rooting of shoots in E. grandis.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

Mapping of fuelwood trees using geoinformatics

Rural population of India constitutes about 70% of the total population and traditional fuels account for 75% of the rural energy needs. Depletion of woodlands coupled with the persistent dependency on fuel wood has posed a serious problem for household energy provision in many parts. This study highlights that the traditional fuels still meet 85-95% of fuel needs in rural areas of Kolar district: people prefer fuel wood for cooking and agriculture residues for water heating and other purposes. However, rapid changes in land cover and land use in recent times have affected these traditional fuels availability necessitating inventorying, mapping and monitoring of bioresources for sustainable management of bioresources. Remote sensing data (Multispectal and Panchromatic), Geographic Information System (GIS), field surveys and non-destructive sampling were used to assess spatially the availability and demand of energy. Field surveys indicate that rural household depends on species such as Prosopis juliflora, Acacia nilotica, Acacia auriculiformis to meet fuel wood requirement for domestic activities. Hence, to take stock of fuel wood availability, mapping was done at species level (with 88% accuracy) considering villages as sampling units using fused multispectral and panchromatic data. (C) 2009 Elsevier Ltd. All rights reserved.

Branch-branch connections in trees analogous to hyphal fusions in fungal colonies

the leopard tree Caesalpinia ferrea (Leguminosae) a native of eastern Brazil-some of the leader branches connect to and fuse with neighbouring branches of the same tree. The bridge initials project out as pegs or protuberances and apparently extend in a coordinated manner, connecting branches up to 4 ft apart. The fusion of two branches of the same tree implies intra-plant communication involving signaling factor(s). The bridges resemble fusions between hyphae in a fungal colony. Whereas hyphal fusions are common and the process is apparently completed in <1 h, branch fusions in C. ferrea tree are limited and a slow process, apparently requiring several months to years to complete. Branch fusions in C. ferrea are in accord with Claus Mattheck's analysis that tree branches actually seek contact rather than avoid contacts.

Pollinator limitation and the effect of breeding systems on plant reproduction in forest fragments

Reproduction of plants in fragmented habitats may be limited because of lower diversity or abundance of pollinators, and/or variation in local plant density. We assessed natural fruit set and pollinator limitation in ten species of woody plants in natural and restored fragments in the Pondicherry region of southern India, to see whether breeding system of plants (self-compatible and self-incompatible) affected fruit set. We tested whether the number of flowering individuals in the fragments affected the fruit set and further examined the adult and sapling densities of self-compatible (SC) and self-incompatible (SI) species. We measured the natural level of fruit set and pollinator limitation (calculated as the difference in fruit set between hand cross-pollinated and naturally pollinated flowers). Our results demonstrate that there was a higher level of pollinator limitation and hence lower levels of natural fruit set in self-incompatible species as compared to self-compatible species. However, the hand cross-pollinated flowers in SC and SI species produced similar levels of fruit set,further indicating that lower fruit set was due to pollinator limitation and not due to lack of cross-compatible individuals in the fragments. There was no significant relation between number of flowering individuals and the levels of natural fruit set, except for two species Derris ovalifolia, Ixora pavetta. In these species the natural fruit set decreased with increasing population size, again indicating pollinator limitation. The adult and sapling densities in self-compatible species were significantly higher than inself-incompatible species. These findings indicate that the low reproductive output in self-incompatible species may eventually lead to lower population sizes. Restoration of pollinator services along with plant species in fragmented habitats is important for the long-term conservation of biodiversity. (C) 2009 Elsevier Masson SAS. All rights reserved.

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.

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.

Male-biased adult sex ratios and their significance for cooperative breeding in dhole, Cuon alpinus, packs

Two free-ranging packs of dholes (Asiatic wild dog, Cuon alpinus) were monitored for a period of 6 yr (Sep. 1990-Sep. 1996) in the Mudumalai sanctuary, southern India. Demographic data on age structure, litter-size, sex ratio and age and sex specific dispersal were collected. Behavioural data on social interactions and reproductive behaviour among pack members were obtained to determine the frequencies of dominant and subordinate behaviours shown by malt: and female pack members and a measure of each male's reproductive access to females. Behaviours displayed by pack members at dens were recorded to determine whether any age- or sex-specific role specialization existed during pup care. Tenures for dominant males and females within the pack were calculated to ascertain the rate of breeding vacancies occurring within packs. Approximate levels of genetic relatedness within packs were determined by studying pedigrees. In most years one study pack had a male-biased adult sex ratio. This was caused by almost twofold higher dispersal of adult females over adult males. A considerable variance existed in the percentage of sub-adults dispersing from the two packs. Differences existed in the frequencies of dominant and subordinate behaviours shown by males. For males, dominance ranks and ranks based on submissive behaviours were not correlated with frequencies of reproductive behaviours. Subordinate males also displayed reproductive behaviours. In packs, dominant males had lower tenures than dominant females indicating that among males breeding vacancies arose more quickly. The litter size was found to be negatively correlated with the age of the breeding female. There were no significant differences across individuals of varying age or sex classes in the display of pup care behaviours. Significant differences did exist among individual adults. Genetic relatedness among packs tended to vary temporally as a consequence of possible mating by subordinate animals and immigration of new males into the pack. In conclusion, it appears that males delay dispersal and cooperate within their natal packs because of the variety of reproductive strategies they could pursue within. A combination of ecological constraints and the difficulties of achieving breeding status within non-natal packs may make early dispersal and independent breeding less beneficial.

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.