Abordagem multivariada na análise de diversidade genética em cruzamentos para alto teor de óleo em soja

The soybean crop is considered a high expression around the world. In plant breeding programs, knowledge of genetic diversity is extremely important and in this context, are frequently used multivariate analyzes. Thus, the aim of the present study was to evaluate the genetic divergence between soybean crosses through multivariate techniques. In total, 16 crosses were evaluated, which were in the F2 generation of inbreeding. The evaluated characteristics were plant height at maturity, height of the first pod, number of branches per plant, number of pods per plant, number of nodes per plant, hundred seed weight, grain yield and oil content. For the analyzes was used Euclidean distance, methods of hierarchical clustering UPGMA and Ward and principal component analysis. Genetic distances estimated using Euclidean distance ranged from 1.24 to 8.13, with the smallest distance observed between crosses C1 and C4, and the greatest distance between the C2 crosses and C6. The methods UPGMA clustering and Ward met crossings in five different groups. The principal component analysis explained 86.2% of the variance contained in the original eight variables with three main components. The APM characters, NV, NR, NN, PG% and oil were the main contributors to genetic divergence among traits. Multivariate techniques were crucial to the analysis of genetic diversity, and the methods of Ward and UPGMA clustering and principal components have consistent results in this way, the simultaneous use of these tools in genetic analysis of crosses is indicated

Estimation of Submerged Aquatic Vegetation Height and Distribution in Nova Avanhandava Reservoir (São Paulo State, Brazil) Using Bio-Optical Modeling

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Frequência de ocorrência de doenças crônico-degenerativas em adultos com mais de 50 anos

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Avaliação de novos híbridos de porta-enxertos para a laranjeira 'valência'

Pós-graduação em Agronomia (Horticultura) - FCA

Quasimodular instanton partition function and the elliptic solution of Korteweg-de Vries equations

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Metrics for Association Rule Clustering Assessment

Issues related to association mining have received attention, especially the ones aiming to discover and facilitate the search for interesting patterns. A promising approach, in this context, is the application of clustering in the pre-processing step. In this paper, eleven metrics are proposed to provide an assessment procedure in order to support the evaluation of this kind of approach. To propose the metrics, a subjective evaluation was done. The metrics are important since they provide criteria to: (a) analyze the methodologies, (b) identify their positive and negative aspects, (c) carry out comparisons among them and, therefore, (d) help the users to select the most suitable solution for their problems. Besides, the metrics do the users think about aspects related to the problems and provide a flexible way to solve them. Some experiments were done in order to present how the metrics can be used and their usefulness.

Pure spinor partition function using Padé approximants

In a recent paper, the partition function (character) of ten-dimensional pure spinor worldsheet variables was calculated explicitly up to the fifth mass-level. In this letter, we propose a novel application of Padé approximants as a tool for computing the character of pure spinors. We get results up to the twelfth mass-level. This work is a first step towards an explicit construction of the complete pure spinor partition function.

Urinary flow in children: correlation with age, body height and body surface area

Peak flow rate data (Qmax) are important for diagnosis of lower urinary tract obstruction. However, the lack of uroflowmetry studies in children, makes their interpretation difficult. With this aim, we studied 167 boys classified in four groups according to their age (G1: n = 48, 6-7 years; G2: n = 43, 8-9 years; G3: n = 37, 10-11 years; G4: n = 39, 12-14 years). We studied in all children, weight, height, body surface area, peak flow rate (Qmax) and the correspondant urinary volume (Vol). Means and standard deviations of Qmax (ml/sec) were: 15 +/- 5 (G1), 15 +/- 5 (G2), 17 +/- 5 (G3) and 22 +/- 7 (G4) respectively. Corresponding urinary volumes (Vol) (mean standard deviation-in ml) were: G1 = 123 +/- 75; G2 = 122 +/- 79; G3 = 158 +/- 96 and G4 = 162 +/- 101. We found a significant correlation (p < 0,01) between Qmax and Vol in groups G2, G3 and G4; and between Qmax and height in groups G1 and G4. The authors demonstrated a positive correlation between maximum flow and voided volume, and an increase of Qmax with age.

Effect of the parafunctional occlusal loading and crown height on stress distribution

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Virginiamycin via mineral supplementation and sward height in growing Nelore young bulls

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A comparison about evolutionary algorithms for optimum-path forest clustering optimization

In this paper we deal with the problem of boosting the Optimum-Path Forest (OPF) clustering approach using evolutionary-based optimization techniques. As the OPF classifier performs an exhaustive search to find out the size of sample's neighborhood that allows it to reach the minimum graph cut as a quality measure, we compared several optimization techniques that can obtain close graph cut values to the ones obtained by brute force. Experiments in two public datasets in the context of unsupervised network intrusion detection have showed the evolutionary optimization techniques can find suitable values for the neighborhood faster than the exhaustive search. Additionally, we have showed that it is not necessary to employ many agents for such task, since the neighborhood size is defined by discrete values, with constrain the set of possible solution to a few ones.

Pure spinor superstring partition function

Pós-graduação em Física - IFT