The roles of marginal lagoons in the maintenance of genetic diversity in the Brazilian migratory fishes Prochilodus argenteus and P. costatus

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

Optimization of the sampling scheme for maps of physical and chemical properties estimated by kriging

The sampling scheme is essential in the investigation of the spatial variability of soil properties in Soil Science studies. The high costs of sampling schemes optimized with additional sampling points for each physical and chemical soil property, prevent their use in precision agriculture. The purpose of this study was to obtain an optimal sampling scheme for physical and chemical property sets and investigate its effect on the quality of soil sampling. Soil was sampled on a 42-ha area, with 206 geo-referenced points arranged in a regular grid spaced 50 m from each other, in a depth range of 0.00-0.20 m. In order to obtain an optimal sampling scheme for every physical and chemical property, a sample grid, a medium-scale variogram and the extended Spatial Simulated Annealing (SSA) method were used to minimize kriging variance. The optimization procedure was validated by constructing maps of relative improvement comparing the sample configuration before and after the process. A greater concentration of recommended points in specific areas (NW-SE direction) was observed, which also reflects a greater estimate variance at these locations. The addition of optimal samples, for specific regions, increased the accuracy up to 2 % for chemical and 1 % for physical properties. The use of a sample grid and medium-scale variogram, as previous information for the conception of additional sampling schemes, was very promising to determine the locations of these additional points for all physical and chemical soil properties, enhancing the accuracy of kriging estimates of the physical-chemical properties.

Genetic Correlation for Pre-Weaning and Post-Weaning Traits of Mediterranean Buffaloes from Brazil, Estimated By Bayesian Inference

The aim of this study was to estimate genetic, environmental and phenotypic correlation between birth weight (BW) and weight at 205 days age (W205), BW and weight at 365 days age (W365) and W205-W365, using Bayesian inference. The Brazilian Program for Genetic Improvement of Buffaloes provided the data that included 3,883 observations from Mediterranean breed buffaloes. With the purpose to estimate variance and covariance, bivariate analyses were performed using Gibbs sampler that is included in the MTGSAM software. The model for BW, W205 and W365 included additive direct and maternal genetic random effects, maternal environmental random effect and contemporary group as fixed effect. The convergence diagnosis was achieved using Geweke, a method that uses an algorithm implemented in R software through the package Bayesian Output Analysis. The calculated direct genetic correlations were 0.34 (BW-W205), 0.25 (BW-W365) and 0.74 (W205-W365). The environmental correlations were 0.12, 0.11 and 0.72 between BW-W205, BW-W365 and W205-W365, respectively. The phenotypic correlations were low for BW-W205 (0.01) and BW-W365 (0.04), differently than the obtained for W205-W365 with a value of 0.67. The results indicate that BW trait have low genetic, environmental and phenotypic association with the two others traits. The genetic correlation between W205 and W365 was high and suggests that the selection for weight at around 205 days could be beneficial to accelerate the genetic gain.

Genetic Parameters for Milk Yield and Lactation Length of Crossbred Buffaloes from Brazil by Bayesian Inference

The objective of the study was to estimate heritability and repeatability for milk yield (MY) and lactation length (LL) in buffaloes using Bayesian inference. The Brazilian genetic improvement program of buffalo provided the data that included 628 females, from four herds, born between 1980 and 2003. In order to obtain the estimates of variance, univariate analyses were performed with the Gibbs sampler, using the MTGSAM software. The model for MY and LL included direct genetic additive and permanent environment as random effects, and contemporary groups, milking frequency and calving number as fixed effects. The convergence diagnosis was performed with the Geweke method using an algorithm implemented in R software through the package Bayesian Output Analysis. Average for milk yield and lactation length was 1,546.1 +/- 483.8 kg and 252.3 +/- 42.5 days, respectively. The heritability coefficients were 0.31 (mode), 0.35 (mean) and 0.34 (median) for MY and 0.11 (mode), 0.10 (mean) and 0.10 (median) for LL. The repeatability coefficient (mode) were 0.50 and 0.15 for MY and LL, respectively. Milk yield is the only trait with clear potential for genetic improvement by direct genetic selection. The repeatability for MY indicates that selection based on the first lactation could contribute for an improvement in this trait.

Genetic Identification of F1 and Post-F1 Serrasalmid Juvenile Hybrids in Brazilian Aquaculture

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

A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem

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

A genetic algorithm for the one-dimensional cutting stock problem with setups

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

Obtenção de um ataque químico padrão, zona de annealing parcial e temperatura de fechamento para o epídoto através do método dos traços de fissão

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

Genetic parameter estimation for pre- and post-weaning traits in Brahman cattle in Brazil

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

Genetic parameter estimates for feed efficiency and dry matter intake and their association with growth and carcass traits in Nellore cattle

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

Jatrophidin I, a cyclic peptide from Brazilian Jatropha curcas L.: Isolation, characterization, conformational studies and biological activity

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

Ribifolin, an orbitide from jatropha ribifolia, and its potential antimalarial activity

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

Algoritmo neurogenético com vistas para o planejamento de rotas de robôs móveis autônomos

Pós-graduação em Ciência da Computação - IBILCE

An algorithm for the strip packing problem using collision free region and exact fitting placement

The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a placement heuristic. Simulated annealing is the adopted metaheuristic to solve the optimization problem. A two-level algorithm is used to minimize the open dimension of the container. To ensure feasible layouts, the concept of collision free region is used. A collision free region represents all possible translations for an item to be placed and may be degenerated. For a moving item, the proposed placement heuristic detects the presence of exact fits (when the item is fully constrained by its surroundings) and exact slides (when the item position is constrained in all but one direction). The relevance of these positions is analyzed and a new placement heuristic is proposed. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results. (C) 2012 Elsevier Ltd. All rights reserved.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

The design of a network is a solution to several engineering and science problems. Several network design problems are known to be NP-hard, and population-based metaheuristics like evolutionary algorithms (EAs) have been largely investigated for such problems. Such optimization methods simultaneously generate a large number of potential solutions to investigate the search space in breadth and, consequently, to avoid local optima. Obtaining a potential solution usually involves the construction and maintenance of several spanning trees, or more generally, spanning forests. To efficiently explore the search space, special data structures have been developed to provide operations that manipulate a set of spanning trees (population). For a tree with n nodes, the most efficient data structures available in the literature require time O(n) to generate a new spanning tree that modifies an existing one and to store the new solution. We propose a new data structure, called node-depth-degree representation (NDDR), and we demonstrate that using this encoding, generating a new spanning forest requires average time O(root n). Experiments with an EA based on NDDR applied to large-scale instances of the degree-constrained minimum spanning tree problem have shown that the implementation adds small constants and lower order terms to the theoretical bound.