Crystal structure of hemoglobin from the maned wolf (Chrysocyon brachyurus) using synchrotron radiation

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

Vortex lattice of a long superconducting wire with a columnar defect

In the present work we study a long superconducting wire with a columnar defect in the presence of an applied magnetic field. The cross section of the cylinder is assumed to be circular. The field is taken uniform and parallel to the cylinder axis. We use the London theory to investigate the vortex lattice inside the wire. Although this theory is valid in the limit of low vortex density, that is, when the nearest neighbor vortex distance is much larger than the coherence length, we can obtain a reasonable qualitative description of lattice properties. We calculate: (1) the vortex lattice structure using the simulated annealing technique; (2) the magnetization curve as a function of the applied field.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Optimal capacitor placement in radial distribution networks

The capacitor placement (replacement) problem for radial distribution networks determines capacitor types, sizes, locations and control schemes. Optimal capacitor placement is a hard combinatorial problem that can be formulated as a mixed integer nonlinear program. Since this is a NP complete problem (Non Polynomial time) the solution approach uses a combinatorial search algorithm. The paper proposes a hybrid method drawn upon the Tabu Search approach, extended with features taken from other combinatorial approaches such as genetic algorithms and simulated annealing, and from practical heuristic approaches. The proposed method has been tested in a range of networks available in the literature with superior results regarding both quality and cost of solutions.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Vortex lattice and matching fields for a long superconducting wire

We investigate the flux penetration patterns and matching fields of a long cylindrical wire of circular cross section in the presence of an external magnetic field. For this study we write the London theory for a long cylinder both for the mixed and Meissner states, with boundary conditions appropriate for this geometry. Using the Monte Carlo simulated annealing method, the free energy of the mixed state is minimized with respect to the vortex position and we obtain the ground state of the vortex lattice for N=3 up to 18 vortices. The free energy of the Meissner and mixed states provides expressions for the matching fields. We find that, as in the case of samples of different geometry, the finite-size effect provokes a delay on the vortex penetration and a vortex accumulation in the center of the sample. The vortex patterns obtained are in good agreement with experimental results.

Size effects in the magnetization of a superconducting wire

The size effects in the magnetization of a long cylindrical wire of circular cross section in the presence of an external magnetic field are investigated. For this study the London theory is used with boundary conditions appropriate for this geometry. Using the Monte Carlo simulated annealing method, the free energy of the mixed state is minimized with respect to the vortex positions. The ground state of the vortex lattice for n = 1 up to 18 vortices for a given radius of the cylinder is obtained. It is found that the finite size of the sample provokes a matching effect in the magnetization, as found in experiments with superconducting samples of finite size but different geometry. © 1999 American Institute of Physics.

Genetic algorithm of chu and beasley for static and multistage transmission expansion planning

In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, to efficiently solve the problem described above are also presented. Results using some known systems show that the GACB is very efficient. To validate the GACB, we compare the results achieved using it with the results using other meta-heuristics like tabu-search, simulated annealing, extended genetic algorithm and hibrid algorithms. © 2006 IEEE.

Building roof contour extraction from LiDAR data

This paper proposes a method for the automatic extraction of building roof contours from a LiDAR-derived digital surface model (DSM). The method is based on two steps. First, to detect aboveground objects (buildings, trees, etc.), the DSM is segmented through a recursive splitting technique followed by a region merging process. Vectorization and polygonization are used to obtain polyline representations of the detected aboveground objects. Second, building roof contours are identified from among the aboveground objects by optimizing a Markov-random-field-based energy function that embodies roof contour attributes and spatial constraints. Preliminary results have shown that the proposed methodology works properly.

Métodos metaheurísticos aplicados a um modelo de planejamento de culturas

Pós-graduação em Biometria - IBB

Perfil de índices de refração do cristalino humano: simulação computacional

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

Metaheurísticas em um problema de rotação de culturas

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

Sequenciamento de linhas de montagem múltiplas em ambiente de produção enxuta utilizando simulação

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

Peptídeos cíclicos em espécies do semiárido brasileiro e uma cultivada: caracterização e atividade biológica

Pós-graduação em Química - IQ