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.

Global optimization using a genetic algorithm with hierarchically structured population

This paper applies a genetic algorithm with hierarchically structured population to solve unconstrained optimization problems. The population has individuals distributed in several overlapping clusters, each one with a leader and a variable number of support individuals. The hierarchy establishes that leaders must be fitter than its supporters with the topological organization of the clusters following a tree. Computational tests evaluate different population structures, population sizes and crossover operators for better algorithm performance. A set of known benchmark test problems is solved and the results found are compared with those obtained from other methods described in the literature, namely, two genetic algorithms, a simulated annealing, a differential evolution and a particle swarm optimization. The results indicate that the method employed is capable of achieving better performance than the previous approaches in regard as the two criteria usually employed for comparisons: the number of function evaluations and rate of success. The method also has a superior performance if the number of problems solved is taken into account. (C) 2013 Elsevier B.V. All rights reserved.

Modelagem e otimização por metodologia de superfícies de resposta: um estudo em arames de aço SAE 9254 para molas automobilísticas

Pós-graduação em Engenharia Mecânica - FEG

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)

Desenvolvimento de extensões para um sistema de carregamento e descarregamento de navios

One of the reasons that influences the efficience of a port terminal that is especialized in movement of containers is in the process of their loading and unloading. The fundamental idea is to determine a plan, to each port in order to decrease the number of total movement of loading and unloading that are necessary during the ship route to every port so that they save time and consequently reduce costs. The goal of this research was to present improvement in the program, written in language C, used to solve to problem of loading and unloading of ships, a NP-complete problem, through the meta-heuristics Simulated Annealing. With the improvement made, an average of 50% reduction of necessary time was gotten to solve the problem in 45 analised instances and in a specific group of these instances the average reduction reached 77 and in 10 instances there was even an improvement in the solution

Estudo dos efeitos do tamanho e comensurabilidade nas correntes críticas em fitas supercondutoras do tipo II com redes periódicas de pinnings à temperatura finita

Pós-graduação em Ciência e Tecnologia de Materiais - FC

Improvements in the sensibility of MSA-GA tool using COFFEE objective function

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

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

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

A radial basis function network (RBFN) for function approximation

A radial basis function network (RBFN) circuit for function approximation is presented. Simulation and experimental results show that the network has good approximation capabilities. The RBFN was a squared hyperbolic secant with three adjustable parameters amplitude, width and center. To test the network a sinusoidal and sine function,vas approximated.

Diferentes métodos de aglutinação para melhoria de processos com múltiplas respostas

Pós-graduação em Engenharia Mecânica - FEG

Metaheuristics for a crop rotation problem

This paper presents a mathematical model adapted from literature for the crop rotation problem with demand constraints (CRP-D). The main aim of the present work is to study metaheuristics and their performance in a real context. The proposed algorithms for solution of the CRP-D are a genetic algorithm, a simulated annealing and hybrid approaches: a genetic algorithm with simulated annealing and a genetic algorithm with local search algorithm. A new constructive heuristic was also developed to provide initial solutions for the metaheuristics. Computational experiments were performed using a real planting area and semi-randomly generated instances created by varying the number, positions and dimensions of the lots. The computational results showed that these algorithms determined good feasible solutions in a short computing time as compared with the time spent to get optimal solutions, thus proving their efficacy for dealing with this practical application of the CRP-D.

Correntes críticas e comportamento dinâmico dos vórtices em fitas supercondutoras do tipo II com arranjos conformes de centros de aprisionamento

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)