The status and use of tree biomass in a semi-arid village ecosystem

The status of the tree biomass resource was investigated in Ungra, a semi-arid village ecosystem in South India. There were 57 tree species with 12 trees capita−1 and 35 trees ha−1. Multiple benefit yielding local tree species dominated the village ecosystem, while fuel only or single end use trees accounted for a small proportion of trees. The standing tree biomass is adequate to meet the requirement of biomass fuels for cooking only for about two years. Village tree biomass is presently being depleted largely for export to urban areas. Tree regeneration is now characterized by transformation from multiple-use local tree species to a few single-use species. A large potential exists for tree biomass production along field boundaries (bunds), stream banks and roadsides. Biomass estimation equations were developed for 10 species.

The Biocontrol Agent Phlebiopsis gigantea: Efficacy and Impacts on the Stump Bacterial Biota and Conifer tree Defences

Phlebiopsis gigantea has been for a long time known as a strong competitor against Heterobasidion annosum and intensively applied as a biological control agent on stump surfaces of Picea abies in Fennoscandia. However, the mechanism underlying its antagonistic activity is still unknown. A primary concern is the possible impact of P. gigantea treatment on resident non-target microbial biota of conifer stumps. Additional risk factor is the potential of P. gigantea to acquire a necrotrophic habit through adaptation to living wood tissues. This study focused on the differential screening of several P. gigantea isolates from diverse geographical sources as well as the use of breeding approach to enhance the biocontrol efficacy against H. annosum infection. The results showed a significant positive correlation between growth rate in wood and high biocontrol efficacy. Furthermore, with aid of breeding approach, several progeny strains were obtained that had better growth rate and control efficacy than parental isolates. To address the issue of the potential of P. gigantea to acquire necrotrophic capability, a combination of histochemical, molecular and transcript profiling (454 sequencing) were used to investigate the interactions between these two fungi and ten year old P. sylvestris seedlings. The results revealed that both P. gigantea and H. annosum provoked strong necrotic lesions, but after prolonged incubation, P. gigantea lesions shrank and ceased to expand further. Tree seedlings pre-treated with P. gigantea further restricted H. annosum-induced necrosis and had elevated transcript levels of genes important for lignification, cell death regulation and jasmonic acid signalling. These suggest that induced localized resistance is a contributory factor for the biocontrol efficacy of P.gigantea, and it has a comparatively limited necrotrophic capability than H. annosum. Finally, to investigate the potential impact of P. gigantea on the stump bacterial biota, 16S rDNA isolated from tissue samples from stumps of P. abies after 1-, 6- and 13-year post treatment was sequenced using bar-coded 454 Titanium pyrosequencing. Proteobacteria were found to be the most abundant at the initial stages of stump decay but were selectively replaced by Acidobacteria at advanced stages of the decay. Moreover, P. gigantea treatment significantly decreased the bacterial richness at initial decay stage in the stumps. Over time, the bacterial community in the stumps gradually recovered and the negative effects of P. gigantea was attenuated.

Tree mortality, fire scar formation and regeneration 8 years after low-intensity fire in managed Pinus sylvestris stands

Fire is an important driver of the boreal forest ecosystem, and a useful tool for the restoration of degraded forests. However, we lack knowledge on the ecological processes initiated by prescribed fires, and whether they bring about the desired restoration effects. The purpose of this study was to investigate the impacts of low-intensity experimental prescribed fires on four ecological processes in young commercial Scots pine (Pinus sylvestris) stands eight years after the burning. The processes of interest were tree mortality, dead wood creation, regeneration and fire scar formation. These were inventoried in twelve study plots, which were 30 m x 30 m in size. The plots belonged to two different stand age classes: 30-35 years or 45 years old at the time of burning. The study was partly a follow-up of study plots researched by Sidoroff et al. (2007) one year after burning in 2003. Tree mortality increased from 183 stems ha-1 in 2003 to 259 stems ha-1 in 2010, corresponding to 15 % and 21 % of stem number respectively. Most mortality was experienced in the stands of the younger age class, in smaller diameter classes and among species other than Scots pine. By 2010, the average mortality of Scots pine per plot was 18%, but varied greatly ranging from 0% to 63% of stem number. Delayed mortality, i.e. mortality that occurred between 2 and 8 years after fire, seemed to become more important with increasing diameter. The input of dead wood also varied greatly between plots, from none to 72 m3 ha-1, averaging at 12 m3 ha-1. The amount of fire scarred trees per plot ranged from none to 20 %. Four out of twelve plots (43 %) did not have any fire scars. Scars were on average small: 95% of scars were less than 4 cm in width, and 75% less than 40 cm in length. Owing to the light nature of the fire, the remaining overstorey and thick organic layer, regeneration was poor overall. The abundance of pine and other seedlings indicated a viable seed source existed, but the seedlings failed to establish under dense canopy. The number of saplings ranged from 0 to 12 333 stems ha-1. The results of this study indicate that a low intensity fire does not necessarily initiate the ecological processes of tree mortality, dead wood creation and regeneration in the desired scale. Fire scars, which form the basis of fire dating in fire history studies, did not form in all cases.

Mining Land Cover Information Using Multilayer Perceptron and Decision Tree from MODIS Data

Land cover (LC) changes play a major role in global as well as at regional scale patterns of the climate and biogeochemistry of the Earth system. LC information presents critical insights in understanding of Earth surface phenomena, particularly useful when obtained synoptically from remote sensing data. However, for developing countries and those with large geographical extent, regular LC mapping is prohibitive with data from commercial sensors (high cost factor) of limited spatial coverage (low temporal resolution and band swath). In this context, free MODIS data with good spectro-temporal resolution meet the purpose. LC mapping from these data has continuously evolved with advances in classification algorithms. This paper presents a comparative study of two robust data mining techniques, the multilayer perceptron (MLP) and decision tree (DT) on different products of MODIS data corresponding to Kolar district, Karnataka, India. The MODIS classified images when compared at three different spatial scales (at district level, taluk level and pixel level) shows that MLP based classification on minimum noise fraction components on MODIS 36 bands provide the most accurate LC mapping with 86% accuracy, while DT on MODIS 36 bands principal components leads to less accurate classification (69%).

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Phenology of tree species of tropical moist forest of Uttara Kannada district, Karnataka, India

Phenological observations on tree species in tropical moist forest of Uttara Kannada district (13ℴ55′ to 15ℴ31′ N lat; 74ℴ9′ to 75ℴ10′ E long) during the years 1983–1985 revealed that there exists a strong seasonality for leaf flush, leaf drop and reproduction. Young leaves were produced in the pre-monsoon dry period with a peak in February, followed by the expansion of leaves which was completed in March. Abscission of leaves occurred in the post-monsoon winter period with a peak in December. There were two peaks for flowering (December and March), while fruit ripening had a single peak in May–June, preceding the monsoon rainfall. The duration of maturation of leaves was the shortest, while that of full ripening of fruits was the longest. Mature flowers of evergreen species lasted longer than those of deciduous species; in contrast the phenophase of ripe fruits of deciduous species was longer than that of evergreen species.

Multi-installment load distribution in tree networks with delays

This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.

Electrical treeing in polyethylene: effect of nano fillers on tree inception and growth

Treeing in polyethylene based nanocomposite samples as well as unfilled polyethylene samples were studied using 50Hz ac voltage. The tree inception voltage was observed for different types of samples. The tree initiation time as well as the tree growth patterns at a fixed ac voltage have also been studied. The results show that there is an improvement in tree inception voltage with nano filler loading in polyethylene. Different tree growth patterns for both the unfilled polyethylene and the polyethylene nanocomposites have been observed. A slower tree growth was observed in polyethylene nanocomposites. The partial discharge characteristics of unfilled and nano filled polyethylene samples during the electrical tree growth period was also studied. Decrease in PD magnitude as well as in the number of pd pulses with electrical tree growth duration in polyethylene nanocomposites has also been observed. The possible reasons for the improvement in electrical tree growth and PD resistance with the addition of nano fillers are discussed.

Matching sender and receiver: poikilothermy and frequency tuning in a tree cricket

Animals communicate in non-ideal and noisy conditions. The primary method they use to improve communication efficiency is sender-receiver matching: the receiver's sensory mechanism filters the impinging signal based on the expected signal. In the context of acoustic communication in crickets, such a match is made in the frequency domain. The males broadcast a mate attraction signal, the calling song, in a narrow frequency band centred on the carrier frequency (CF), and the females are most sensitive to sound close to this frequency. In tree crickets, however, the CF changes with temperature. The mechanisms used by female tree crickets to accommodate this change in CF were investigated at the behavioural and biomechanical level. At the behavioural level, female tree crickets were broadly tuned and responded equally to CFs produced within the naturally occurring range of temperatures (18 to 27 degrees C). To allow such a broad response, however, the transduction mechanisms that convert sound into mechanical and then neural signals must also have a broad response. The tympana of the female tree crickets exhibited a frequency response that was even broader than suggested by the behaviour. Their tympana vibrate with equal amplitude to frequencies spanning nearly an order of magnitude. Such a flat frequency response is unusual in biological systems and cannot be modelled as a simple mechanical system. This feature of the tree cricket auditory system not only has interesting implications for mate choice and species isolation but may also prove exciting for bio-mimetic applications such as the design of miniature low frequency microphones.

Efficient statistical modeling for the compression of tree structured intermediate code

We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.

An O(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V,E). The expected running time of our algorithm is Õ(mc) where |E| = m and c is the maximum u-vedge connectivity, where u,v ∈ V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n-1; so the expected running time of our algorithm for simple unweighted graphs is Õ(mn).All the algorithms currently known for constructing a Gomory-Hu tree [8,9] use n-1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest Õ(n20/9) max flow algorithm due to Karger and Levine [11] yields the current best running time of Õ(n20/9n) for Gomory-Hu tree construction on simpleunweighted graphs with m edges and n vertices. Thus we present the first Õ(mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs.We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S ⊆ V can be reused for computing a minimum Steiner cut for certain Steiner sets S' ⊆ S.

Decision tree design and applications in speech processing

The design and operation of the minimum cost classifier, where the total cost is the sum of the measurement cost and the classification cost, is computationally complex. Noting the difficulties associated with this approach, decision tree design directly from a set of labelled samples is proposed in this paper. The feature space is first partitioned to transform the problem to one of discrete features. The resulting problem is solved by a dynamic programming algorithm over an explicitly ordered state space of all outcomes of all feature subsets. The solution procedure is very general and is applicable to any minimum cost pattern classification problem in which each feature has a finite number of outcomes. These techniques are applied to (i) voiced, unvoiced, and silence classification of speech, and (ii) spoken vowel recognition. The resulting decision trees are operationally very efficient and yield attractive classification accuracies.