4 resultados para tree size classes
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
In mussels, stress signals such as heat, osmotic shock and hypoxia lead to the activation of the phosphorylated p38 mitogen activated protein kinase (pp38-MAPK). This stress activated protein has been efficiently used as a biomarker to several natural and anthropogenic stresses. However, what has not been tested is whether differences in gender or size can affect the response of this biomarker. The present study tested whether there was variation in the expression of pp38-MAPK in mussels Perna perna of different gender and size classes when exposed to natural stress conditions, such as air exposure. The results show that gender does not affect the expression of pp38-MAPK. However, size does have an effect, where mussels smaller than 6.5 cm displayed significantly (p < 0.05) lower levels of pp38-MAPK when compared to those larger than 7 cm. Mussels are one of the most used bioindicator species and the use of biomarkers to determine the health status of an ecosystem has been greatly increasing over the years. The present study highlights the importance of using mussels of similar size classes when performing experiments using stress-related biomarkers.
Resumo:
A variety of human-induced disturbances such as forest fragmentation and recovery after deforestation for pasture or agricultural activities have resulted in a complex landscape mosaic in the Una region of northeastern Brazil. Using a set of vegetation descriptors, we investigated the main structural changes observed in forest categories that comprise the major components of the regional landscape and searched for potential key descriptors that could be used to discriminate among different forest categories. We assessed the forest structure of five habitat categories defined as (I) interiors and (2) edges of large fragments of old-growth forest (>1000 ha), (3) interiors and (4) edges of small forest fragments (<100 ha), and (5) early secondary forests. Forest descriptors used here were: frequency of herbaceous lianas and woody climbers, number of standing dead trees, number of fallen trunks, litter depth, number of pioneer plants (early secondary and shade-intolerant species), vertical foliage stratification profile and distribution Of trees in different diameter classes. Edges and interiors of forest fragments were significantly different only in the number of standing dead trees. Secondary forests and edges of fragments showed differences in litter depth, fallen trunks and number of pioneer trees, and secondary forests were significantly different from fragment interiors in the number of standing dead trees and the number of pioneer trees. Horizontal and vertical structure evaluated via ordination analysis showed that fragment interiors, compared to secondary forests, were characterized by a greater number of medium (25-35 cm) and large (35-50 cm) trees and smaller numbers of thin trees (5-10 cm). There was great heterogeneity at the edges of small and large fragments, as these sites were distributed along almost the entire gradient. Most interiors of large and small fragments presented higher values of foliage densities at higher strata ( 15-20 m and at 20-25 m height), and lower densities at 1-5 m. All secondary forests and some fragment edge sites showed an opposite tendency. A discriminant function highlighted differences among forest categories, with transects of large fragment interiors and secondary forests representing two extremes along a disturbance gradient determined by foliage structure (densities at 15-20 m and 20-25 m), with the edges of both large and small fragments and the interiors of small fragments scattered across the gradient. The major underlying processes determining patterns of forest disturbance in the study region are discussed, highlighting the importance of forest fragments, independently of its size, as forests recovery after clear cut show a greatly distinct structure, with profound implications on fauna movements. (C) 2009 Elsevier BY. All rights reserved.
Resumo:
Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than two classes. A common approach to generalize binary learning techniques to solve problems with more than two classes, also known as multiclass classification problems, consists of hierarchically decomposing the multiclass problem into multiple binary sub-problems, whose outputs are combined to define the predicted class. This strategy results in a tree of binary classifiers, where each internal node corresponds to a binary classifier distinguishing two groups of classes and the leaf nodes correspond to the problem classes. This paper investigates how measures of the separability between classes can be employed in the construction of binary-tree-based multiclass classifiers, adapting the decompositions performed to each particular multiclass problem. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Model trees are a particular case of decision trees employed to solve regression problems. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed. Moreover, model trees present an acceptable level of predictive performance in comparison to most techniques used for solving regression problems. Since generating the optimal model tree is an NP-Complete problem, traditional model tree induction algorithms make use of a greedy top-down divide-and-conquer strategy, which may not converge to the global optimal solution. In this paper, we propose a novel algorithm based on the use of the evolutionary algorithms paradigm as an alternate heuristic to generate model trees in order to improve the convergence to globally near-optimal solutions. We call our new approach evolutionary model tree induction (E-Motion). We test its predictive performance using public UCI data sets, and we compare the results to traditional greedy regression/model trees induction algorithms, as well as to other evolutionary approaches. Results show that our method presents a good trade-off between predictive performance and model comprehensibility, which may be crucial in many machine learning applications. (C) 2010 Elsevier Inc. All rights reserved.