Evaluating the annual nature of juvenile rings in Bolivian tropical rainforest trees

Knowledge on juvenile tree growth is crucial to understand how trees reach the canopy in tropical forests. However, long-term data on juvenile tree growth are usually unavailable. Annual tree rings provide growth information for the entire life of trees and their analysis has become more popular in tropical forest regions over the past decades. Nonetheless, tree ring studies mainly deal with adult rings as the annual character of juvenile rings has been questioned. We evaluated whether juvenile tree rings can be used for three Bolivian rainforest species. First, we characterized the rings of juvenile and adult trees anatomically. We then evaluated the annual nature of tree rings by a combination of three indirect methods: evaluation of synchronous growth patterns in the tree- ring series, (14)C bomb peak dating and correlations with rainfall. Our results indicate that rings of juvenile and adult trees are defined by similar ring-boundary elements. We built juvenile tree-ring chronologies and verified the ring age of several samples using (14)C bomb peak dating. We found that ring width was correlated with rainfall in all species, but in different ways. In all, the chronology, rainfall correlations and (14)C dating suggest that rings in our study species are formed annually.

Anthocyanins and tannins in ozone-fumigated guava trees

Psidium guajava ""Paluma"", a tropical tree species, is known to be an efficient ozone indicator in tropical countries. When exposed to ozone, this species displays a characteristic leaf injury identified by inter-veinal red stippling on adaxial leaf surfaces. Following 30 days of three ozone treatments consisting of carbon filtered air (CF - AOT40 = 17 ppb h), ambient non-filtered air (NF - AOT40 = 542 ppb h) and ambient non-filtered air + 40 ppb ozone (NF + O(3) - AOT40 - 7802 ppb h), the amounts of residual anthocyanins and tannins present in 10 P. guajava (""Paluma"") saplings were quantified. Higher amounts of anthocyanins were found in the NF + O(3) treatment (1.6%) when compared to the CF (0.97%) and NF (1.30%) (p < 0.05), and of total tannins in the NF + O(3) treatment (0.16%) compared to the CIF (0.14%). Condensed tannins showed the same tendency as enhanced amounts. Regression analyses using amounts of tannins and anthocyanins, AOT40 and the leaf injury index (LII), showed a correlation between the leaf injury index and quantities of anthocyanins and total tannins. These results are in accordance with the association between the incidence of red-stippled leaves and ozone polluted environments. (C) 2009 Elsevier Ltd. All rights reserved.

Fiedler trees for multiscale surface analysis

In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace-Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales. Published by Elsevier Ltd.

Evolutionary model trees for handling continuous classes in machine learning

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.

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

Orthogonal packing of identical rectangles within isotropic convex regions

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Limit theorems for sequences of random trees

We consider a random tree and introduce a metric in the space of trees to define the ""mean tree"" as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose tests to check if two samples of random trees have the same law.

Bootstrap percolation on homogeneous trees has 2 phase transitions

We study the threshold theta bootstrap percolation model on the homogeneous tree with degree b + 1, 2 <= theta <= b, and initial density p. It is known that there exists a nontrivial critical value for p, which we call p(f), such that a) for p > p(f), the final bootstrapped configuration is fully occupied for almost every initial configuration, and b) if p < p(f) , then for almost every initial configuration, the final bootstrapped configuration has density of occupied vertices less than 1. In this paper, we establish the existence of a distinct critical value for p, p(c), such that 0 < p(c) < p(f), with the following properties: 1) if p <= p(c), then for almost every initial configuration there is no infinite cluster of occupied vertices in the final bootstrapped configuration; 2) if p > p(c), then for almost every initial configuration there are infinite clusters of occupied vertices in the final bootstrapped configuration. Moreover, we show that 3) for p < p(c), the distribution of the occupied cluster size in the final bootstrapped configuration has an exponential tail; 4) at p = p(c), the expected occupied cluster size in the final bootstrapped configuration is infinite; 5) the probability of percolation of occupied vertices in the final bootstrapped configuration is continuous on [0, p(f)] and analytic on (p(c), p(f) ), admitting an analytic continuation from the right at p (c) and, only in the case theta = b, also from the left at p(f).

The C(K, X) spaces for compact metric spaces K and X with a uniformly convex maximal factor

In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.

Examples from trees, related to discrete subsets, pseudo-radiality and omega-boundedness

We construct some examples using trees. Some of them are consistent counterexamples for the discrete reflection of certain topological properties. All the properties dealt with here were already known to be non-discretely reflexive if we assume CH and we show that the same is true assuming the existence of a Suslin tree. In some cases we actually get some ZFC results. We construct also, using a Suslin tree, a compact space that is pseudo-radial but it is not discretely generated. With a similar construction, but using an Aronszajn tree, we present a ZFC space that is first countable, omega-bounded but is not strongly w-bounded, answering a question of Peter Nyikos. (C) 2008 Elsevier B.V. All rights reserved.

Nuclear magnetic resonance characterization of metabolite disorder in orange trees caused by citrus sudden death disease

Citrus sudden death (CSD) is a new disease of sweet orange and mandarin trees grafted on Rangpur lime and Citrus volkameriana rootstocks. It was first seen in Brazil in 1999, and has since been detected in more than four million trees. The CSD causal agent is unknown and the current hypothesis involves a virus similar to Citrus tristeza virus or a new virus named Citrus sudden death-associated virus. CSD symptoms include generalized foliar discoloration, defoliation and root death, and, in most cases, it can cause tree death. One of the unique characteristics of CSD disease is the presence of a yellow stain in the rootstock bark near the bud union. This region also undergoes profound anatomical changes. In this study, we analyse the metabolic disorder caused by CSD in the bark of sweet orange grafted on Rangpur lime by nuclear magnetic resonance (NMR) spectroscopy and imaging. The imaging results show the presence of a large amount of non-functional phloem in the rootstock bark of affected plants. The spectroscopic analysis shows a high content of triacylglyceride and sucrose, which may be related to phloem blockage close to the bud union. We also propose that, without knowing the causal CSD agent, the determination of oil content in rootstock bark by low-resolution NMR can be used as a complementary method for CSD diagnosis, screening about 300 samples per hour.