798 resultados para annealing algorithm


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present work studied the influence of thermal treatment in oxygen rich atmosphere on heterogenous junctions in Mn-doped SnO2 polycrystalline system presenting varistor behavior. The samples were prepared by conventional oxide mixture methodology, and were submitted to heat treatment in oxygen rich atmosphere at 900 degrees C for 2h. The samples were characterized by X-ray diffraction, scanning electron microscopy, dc and ac electrical measurements. The results showed that there is an evident relationship between the microstructure heterogeneity and non-ohmic electrical properties. It was found that for this SnO2 center dot MnO-based varistor system the heat treatment in oxygen rich atmosphere does not necessarily increase the varistors properties, which was related to the decrease in the grain boundary resistance. The results are compared with Co-doped SnO2 varistors and ZnO based varistors. (C) 2008 WILEY-VCH Verlay GmbH & Co. KGaA, Weinheim.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Os Algoritmos Genético (AG) e o Simulated Annealing (SA) são algoritmos construídos para encontrar máximo ou mínimo de uma função que representa alguma característica do processo que está sendo modelado. Esses algoritmos possuem mecanismos que os fazem escapar de ótimos locais, entretanto, a evolução desses algoritmos no tempo se dá de forma completamente diferente. O SA no seu processo de busca trabalha com apenas um ponto, gerando a partir deste sempre um nova solução que é testada e que pode ser aceita ou não, já o AG trabalha com um conjunto de pontos, chamado população, da qual gera outra população que sempre é aceita. Em comum com esses dois algoritmos temos que a forma como o próximo ponto ou a próxima população é gerada obedece propriedades estocásticas. Nesse trabalho mostramos que a teoria matemática que descreve a evolução destes algoritmos é a teoria das cadeias de Markov. O AG é descrito por uma cadeia de Markov homogênea enquanto que o SA é descrito por uma cadeia de Markov não-homogênea, por fim serão feitos alguns exemplos computacionais comparando o desempenho desses dois algoritmos

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications, such as vowel recognition, image classification and fraud detection in power distribution systems are conducted in order to asses the robustness of the proposed technique against Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and a Particle Swarm Optimization (PSO)-based algorithm for feature selection.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An algorithm for deriving a continued fraction that corresponds to two series expansions simultaneously, when there are zero coefficients in one or both series, is given. It is based on using the Q-D algorithm to derive the corresponding fraction for two related series, and then transforming it into the required continued fraction. Two examples are given. (C) 2003 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The study of robust design methodologies and techniques has become a new topical area in design optimizations in nearly all engineering and applied science disciplines in the last 10 years due to inevitable and unavoidable imprecision or uncertainty which is existed in real word design problems. To develop a fast optimizer for robust designs, a methodology based on polynomial chaos and tabu search algorithm is proposed. In the methodology, the polynomial chaos is employed as a stochastic response surface model of the objective function to efficiently evaluate the robust performance parameter while a mechanism to assign expected fitness only to promising solutions is introduced in tabu search algorithm to minimize the requirement for determining robust metrics of intermediate solutions. The proposed methodology is applied to the robust design of a practical inverse problem with satisfactory results.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new version of the relaxation algorithm is proposed in order to obtain the stationary ground-state solutions of nonlinear Schrodinger-type equations, including the hyperbolic solutions. In a first example, the method is applied to the three-dimensional Gross-Pitaevskii equation, describing a condensed atomic system with attractive two-body interaction in a non-symmetrical trap, to obtain results for the unstable branch. Next, the approach is also shown to be very reliable and easy to be implemented in a non-symmetrical case that we have bifurcation, with nonlinear cubic and quintic terms. (c) 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An uncomplicated and easy handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the unitarity of both topologically massive higher-derivative electromagnetism (TMHDE) and topologically massive higher-derivative gravity (TMHDG). The novel and amazing features of these effective field models are also discussed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a methodology based on geostatistical theory for quantifying the risks associated with heavy-metal contamination in the harbor area of Santana, Amapa State, Northern Brazil. In this area there were activities related to the commercialization of manganese ore from Serra do Navio. Manganese and arsenic concentrations at unsampled sites were estimated by postprocessing results from stochastic annealing simulations; the simulations were used to test different criteria for optimization, including average, median, and quantiles. For classifying areas as contaminated or uncontaminated, estimated quantiles based on functions of asymmetric loss showed better results than did estimates based on symmetric loss, such as the average or the median. The use of specific loss functions in the decision-making process can reduce the costs of remediation and health maintenance. The highest global health costs were observed for manganese. (c) 2008 Elsevier B.V. All rights reserved

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Lead lanthanum zirconate titanate (PLZT) thin films with stoichiometry (9/65/35) were prepared by a dip-coating process using a polymeric organic solution. The solution viscosity was adjusted in the range of 15-56 cP. Silicon (100) substrates were previously cleaned and then immersed in the solution. The withdrawal speed of substrate from the solution was adjusted within a range of 5 to 20 mm/min. The coated substrates were thermally treated in the 450-700 degreesC temperature range. Surface roughness and crystallization of these films are strongly dependent on the annealing conditions. Infrared and X-ray diffraction data for PLZT powders heat-treated at 650 degreesC for 3 h show that the material is free of carbonate phases and crystalline. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ba(Zr0.50Ti0.50)O-3 thin films were prepared by the polymeric precursor method using the annealing low temperature of 300 degrees C for 8, 16, 24, 48, 96 and 192 It in a furnace tube with oxygen atmosphere. The X-ray diffraction patterns revealed that the film annealed for 192 h presented some crystallographic planes (1 0 0), (1 1 0) and (2 0 0) in its crystalline lattice. Fourier transformed infrared presented the formation of metal-oxygen stretching at around 756 cm(-1). The atomic force microscopy analysis presented the growth of granules in the Ba(Zr0.50Ti0.50)O-3 films annealed from 8 to 96 h. The crystalline film annealed for 192 h already presents grains in its perovskite structure. It evidenced a reduction in the thickness of the thin films with the increase of the annealing time. (C) 2006 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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