Substrate specificity of the Chamaerops excelsa palm tree peroxidase. A steady-state kinetic study

The steady state kinetic mechanism of the H(2)O(2)-supported oxidation of different organic substrates by peroxidase from leaves of Chamaerops excelsa palm trees (CEP) has been investigated. An analysis of the initial rates vs. H(2)O(2) and reducing substrate concentrations is consistent with a substrate-inhibited Ping-Pong Bi Bi reaction mechanism. The phenomenological approach expresses the peroxidase Ping-Pong mechanism in the form of the Michaelis-Menten equation and leads to an interpretation of the effects in terms of the kinetic parameters K(m)(H2O2)center dot K(m)(AH2)center dot k(cat)center dot K(SI)(AH2) and of the microscopic rate constants k(1) and k(3) of the shared three-step catalytic cycle of peroxidases. (C) 2011 Elsevier B.V. All rights reserved.

A new eriophyoid mite genus and species, Gymnaceria cupuassu (Acari: Eriophyidae), described from the cupuacu tree in Brazil

A new eriophyoid mite genus and species, Gymnaceria cupuassu n. sp. et n. gen. (Acari: Eriophyidae: Eriophyinae: Aceriini), is described from young fruits and other plant parts of the cupuacu tree, Theobroma grandiflorum (Willd. Ex Spreng.) K. Schum. (Sterculiaceae), from the State of Bahia, northeastern Brazil. No visible damage symptoms were observed.

Tree species richness, does it play a key role on a forest restoration plantation?

The Brazilian Atlantic forest is considered one of the world's biodiversity conservation hotspot. Today there is less than ten percent remaining. Therefore it is necessary to restore these ecosystems. There are many ways of achieving restoration's main goals, but there is a lack of ecological studies that analyzes tree species richness as a variable. Thus, this study's goal is to investigate if there is a difference between a forest restoration in a gradient of tree species richness that varies from 20, 60 to 120 species, by using the litterfall as an indicator. Every month, for one year the forest litter was collected from litter traps that were previously installed. Results revealed that stands produced litterfall by the increasing gradient of species was of 5,370, 5,909 and 6,432 kg ha(-1) yr(-1). The statistical analyses revealed no significant difference among them. Therefore this six-year-old forest restoration plantation shows no difference on the litter production by the tree species richness.

Partial projective representations and partial actions II

This paper is a continuation of Dokuchaev and Novikov (2010) [8]. The interaction between partial projective representations and twisted partial actions of groups considered in Dokuchaev and Novikov (2010) [8] is treated now in a categorical language. In the case of a finite group G, a structural result on the domains of factor sets of partial projective representations of G is obtained in terms of elementary partial actions. For arbitrary G we study the component pM'(G) of totally-defined factor sets in the partial Schur multiplier pM(G) using the structure of Exel's semigroup. A complete characterization of the elements of pM'(G) is obtained for algebraically closed fields. (C) 2011 Elsevier B.V. All rights reserved.

Yield mapping, soil fertility and tree gaps in an orange orchard

The current high competition on Citrus industry demands from growers new management technologies for superior efficiency and sustainability. In this context, precision agriculture (PA) has developed techniques based on yield mapping and management systems that recognize field spatial variability, which contribute to increase profitability of commercial crops. Because spatial variability is often not perceived the orange orchards are still managed as uniform and adoption of PA technology on citrus farms is low. Thus, the objective of the present study was to characterize the spatial variability of three factors: fruit yield, soil fertility and occurrence of plant gaps caused by either citrus blight or huanglongbing (HLB) in a commercial Valencia orchard in Brotas, São Paulo State, Brazil. Data from volume, geographic coordinates and representative area of the bags used on harvest were recorded to generate yield points that were then interpolated to produce the yield map. Soil chemical characteristics were studied by analyzing samples collected along planting rows and inter-rows in 24 points distributed in the field. A map of density of tree gaps was produced by georeferencing individual gaps and later by counting the number of gaps within 500 m² cells. Data were submitted to statistical and geostatistical analyses. A t test was used to compare means of soil chemical characteristics between sampling regions. High variation on yield and density of tree gaps was observed from the maps. It was also demonstrated overlapping regions of high density of plant absence and low fruit yield. Soil fertility varied depending on the sampling region in the orchard. The spatial variability found on yield, soil fertility and on disease occurrence demonstrated the importance to adopt site specific nutrient management and disease control as tools to guarantee efficiency of fruit production.

Vegetation mapping in an area of Ombrophilous Dense Forest at Parque Estadual da Serra do Mar, São Paulo State, Brazil, and floristic composition of the tree component of some physiognomies*

This study aimed to map phytophysiognomies of an area of Ombrophilous Dense Forest at Parque Estadual da Serra do Mar and characterize their floristic composition. Photointerpretation of aerial photographs in scale of 1:35,000 was realized in association with field work. Thirteen physiognomies were mapped and they were classified as Montane Ombrophilous Dense Forest, Alluvial Ombrophilous Dense Forest or Secondary System. Three physiognomies identified at Casa de Pedra streamlet's basin were studied with more details. Riparian forest (RF), valley forest (VF), and hill forest (HF) presented some floristic distinction, as confirmed by Detrended Correspondence Analysis (DCA) and Indicator Species Analysis (ISA) conducted here. Anthropic or natural disturbances and heterogeneity of environmental conditions may be the causes of physiognomic variation in the vegetation of the region. The results presented here may be useful to decisions related to management and conservation of Núcleo Santa Virgínia forests, in general.

Representations as tools of appropriation, creating meaning through activities.

Based on some constructs of the Activity Theory (Leontiev, 1978), we point to the need to develop activities that reveal the meaning of representations. We examine use of representations in teaching and propose some suggestions. Shaaron Ainsworth (1999) asserted that, in order to learn from engaging with multiple representations of scientific concepts, students need to be able to (a) understand the codes and signifiers in a representation, (b) understand the links between the representation and the target concept or process, (c) translate key features of the concept across representations and (d) know which features to emphasize in designing their own representations.

3D reconstruction from a vascular tree model

[EN] In this paper, we present a vascular tree model made with synthetic materials and which allows us to obtain images to make a 3D reconstruction.We have used PVC tubes of several diameters and lengths that will let us evaluate the accuracy of our 3D reconstruction. In order to calibrate the camera we have used a corner detector. Also we have used Optical Flow techniques to follow the points through the images going and going back. We describe two general techniques to extract a sequence of corresponding points from multiple views of an object. The resulting sequence of points will be used later to reconstruct a set of 3D points representing the object surfaces on the scene. We have made the 3D reconstruction choosing by chance a couple of images and we have calculated the projection error. After several repetitions, we have found the best 3D location for the point.

Experimentation and thermodynamic representations of binaries containing compounds of low boiling points: pentane and alkyl methanoates

[EN]This work presents experimental mixing properties, hEand vE, at several temperatures and the iso-baric vapor–liquid equilibria (iso-p VLE) at 101.32 kPa for four binaries containing pentane and four alkyl(methyl to butyl) methanoates. Particular conditions are established to work with these solutions withhighly volatile compounds, especially for the case of methyl methanoate + pentane system, for whicha continuous feeding device is designed and constructed for measuring the densities.

Kernel Methods for Tree Structured Data

Machine learning comprises a series of techniques for automatic extraction of meaningful information from large collections of noisy data. In many real world applications, data is naturally represented in structured form. Since traditional methods in machine learning deal with vectorial information, they require an a priori form of preprocessing. Among all the learning techniques for dealing with structured data, kernel methods are recognized to have a strong theoretical background and to be effective approaches. They do not require an explicit vectorial representation of the data in terms of features, but rely on a measure of similarity between any pair of objects of a domain, the kernel function. Designing fast and good kernel functions is a challenging problem. In the case of tree structured data two issues become relevant: kernel for trees should not be sparse and should be fast to compute. The sparsity problem arises when, given a dataset and a kernel function, most structures of the dataset are completely dissimilar to one another. In those cases the classifier has too few information for making correct predictions on unseen data. In fact, it tends to produce a discriminating function behaving as the nearest neighbour rule. Sparsity is likely to arise for some standard tree kernel functions, such as the subtree and subset tree kernel, when they are applied to datasets with node labels belonging to a large domain. A second drawback of using tree kernels is the time complexity required both in learning and classification phases. Such a complexity can sometimes prevents the kernel application in scenarios involving large amount of data. This thesis proposes three contributions for resolving the above issues of kernel for trees. A first contribution aims at creating kernel functions which adapt to the statistical properties of the dataset, thus reducing its sparsity with respect to traditional tree kernel functions. Specifically, we propose to encode the input trees by an algorithm able to project the data onto a lower dimensional space with the property that similar structures are mapped similarly. By building kernel functions on the lower dimensional representation, we are able to perform inexact matchings between different inputs in the original space. A second contribution is the proposal of a novel kernel function based on the convolution kernel framework. Convolution kernel measures the similarity of two objects in terms of the similarities of their subparts. Most convolution kernels are based on counting the number of shared substructures, partially discarding information about their position in the original structure. The kernel function we propose is, instead, especially focused on this aspect. A third contribution is devoted at reducing the computational burden related to the calculation of a kernel function between a tree and a forest of trees, which is a typical operation in the classification phase and, for some algorithms, also in the learning phase. We propose a general methodology applicable to convolution kernels. Moreover, we show an instantiation of our technique when kernels such as the subtree and subset tree kernels are employed. In those cases, Direct Acyclic Graphs can be used to compactly represent shared substructures in different trees, thus reducing the computational burden and storage requirements.

A study on set variable representations in constraint programming

Il lavoro presentato in questa tesi si colloca nel contesto della programmazione con vincoli, un paradigma per modellare e risolvere problemi di ricerca combinatoria che richiedono di trovare soluzioni in presenza di vincoli. Una vasta parte di questi problemi trova naturale formulazione attraverso il linguaggio delle variabili insiemistiche. Dal momento che il dominio di tali variabili può essere esponenziale nel numero di elementi, una rappresentazione esplicita è spesso non praticabile. Recenti studi si sono quindi focalizzati nel trovare modi efficienti per rappresentare tali variabili. Pertanto si è soliti rappresentare questi domini mediante l'uso di approssimazioni definite tramite intervalli (d'ora in poi rappresentazioni), specificati da un limite inferiore e un limite superiore secondo un'appropriata relazione d'ordine. La recente evoluzione della ricerca sulla programmazione con vincoli sugli insiemi ha chiaramente indicato che la combinazione di diverse rappresentazioni permette di raggiungere prestazioni di ordini di grandezza superiori rispetto alle tradizionali tecniche di codifica. Numerose proposte sono state fatte volgendosi in questa direzione. Questi lavori si differenziano su come è mantenuta la coerenza tra le diverse rappresentazioni e su come i vincoli vengono propagati al fine di ridurre lo spazio di ricerca. Sfortunatamente non esiste alcun strumento formale per paragonare queste combinazioni. Il principale obiettivo di questo lavoro è quello di fornire tale strumento, nel quale definiamo precisamente la nozione di combinazione di rappresentazioni facendo emergere gli aspetti comuni che hanno caratterizzato i lavori precedenti. In particolare identifichiamo due tipi possibili di combinazioni, una forte ed una debole, definendo le nozioni di coerenza agli estremi sui vincoli e sincronizzazione tra rappresentazioni. Il nostro studio propone alcune interessanti intuizioni sulle combinazioni esistenti, evidenziandone i limiti e svelando alcune sorprese. Inoltre forniamo un'analisi di complessità della sincronizzazione tra minlex, una rappresentazione in grado di propagare in maniera ottimale vincoli lessicografici, e le principali rappresentazioni esistenti.