ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM

Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.

Application of a new reverse Monte Carlo algorithm to polyatomic molecular systems. I. Liquid water

Using a new reverse Monte Carlo algorithm, we present simulations that reproduce very well several structural and thermodynamic properties of liquid water. Both Monte Carlo, molecular dynamics simulations and experimental radial distribution functions used as input are accurately reproduced using a small number of molecules and no external constraints. Ad hoc energy and hydrogen bond analysis show the physical consistency and limitations of the generated RMC configurations. (C) 2001 American Institute of Physics.

An evolutionary algorithm for the one-dimensional cutting stock problem

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

Location and contract pricing of distributed generation using a genetic algorithm

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

Transmission system expansion planning by a branch-and-bound algorithm

A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Spermatogenesis and nucleolar behavior in males of aquatic Heteroptera

Aspects of spermatogenesis and nucleolar behavior were analyzed in Brachymetra albinerva, Cylindrostethus palmaris, Halobatopsis platensis, Limnogonus aduncus (Gerridae), Martarega sp (Notonectidae), Rhagovelia whitei, and Rhagovelia sp (Veliidae). The testicles are rounded (Veliidae), elongated (Gerridae) or spiral (Notonectidae) and have a transparent membrane covering them. The complement chromosome was 2n = 23 (22A + X0, L. aduncus and Rhagovelia sp), 25 (24A + X0, B. albinerva and H. platensis), 26 (22A + 2m + XY, Martarega sp), 29 (28A + X0, C. palmaris), or 39 (38A + X0, R. whitei) chromosomes, and the only species with a different sex chromosome system was Martarega sp, which showed an XY system and m-chromosomes. The meiotic behavior of all species was similar: holocentric chromosomes and heteropyknotic material at prophase, interstitial and/or terminal chiasmata, and first reductional division for the autosomes and the reverse for the sex chromosomes. The only difference observed was related to the very large size of Martarega sp cells in all stages of spermatogenesis. With regard to nucleolar behavior, the species did not show differences, except for Martarega sp with larger nucleoli than the other species. The only species in which it was clearly possible to identify the nucleolar organizer region was L. aduncus, in the region of a terminal autosome. It was also confirmed that the telomeric associations do not occur at random. In the other species, specific staining was very discrete, and the nucleolar organizer region location was not at all evident.

Distribution Transformer Modeling for Application in Three-Phase Power Flow Algorithm

In this paper, it is presented a methodology for three-phase distribution transformer modeling, considering several types of transformer configuration, to be used in algorithms of power flow in three-phase radial distribution networks. The paper provides a detailed discussion about the models and the results from an implementation of the power flow algorithm. The results, taken from three different networks, are presented for several transformer configurations and for voltage regulators as well.

An implementation of modified scatter search algorithm to transmission expansion planning

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

Another prefiltering algorithm for adaptive IIR filtering

An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies the derivation of gradient-based algorithms. Computer simulations show that the proposed structure improves convergence speed.

IgG, IgM and IgA antibody response for the diagnosis and follow-up of paracoccidioidomycosis: Comparison of counterimmunoelectrophoresis and complement fixation

IgG, IgM and IgA antibodies to GP43 (glycoprotein fraction of Paracoccidioides brasiliensis) were measured by ELISA in 63 samples from 23 patients with paracoccidioidomycosis before and twice after chemotherapy was started. Antibodies against P. brasiliensis were detected by indirect immunofluorescence (IF) (IgG, IgM and IgA isotypes), counterimmunoelectrophoresis (CIE) and complement fixation. Two control groups composed of 19 healthy individuals and 12 patients with other diseases (six with histoplasmosis, three with tuberculosis and three with other mycoses). The highest efficiency percentages were found with IgG and IgA- ELISA (100%), IgG-IF (96.2%), CIE (94.4%) and the lowest with CF (75.9%). Highest positive and negative predictive values (100%) were observed for IgG and IgA ELISA. IgG and IgM-ELISA antibodies are more often found in patients with acute than chronic disease (P = 0.01). Four to six months after treatment follow-up showed decreased levels of IgG and IgM-ELISA for acute cases and decreased titres of CIE for chronic cases in relation to pretreatment levels. This study suggests that IgG-ELISA anti-GP43 represents a good marker to monitor clinical response to therapy.

Combining genetic algorithm and simulated annealing: A molecular geometry optimization study

We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si6 and Si10). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system. © 1998 Elsevier Science B.V.

Algorithm for computing the propagator for higher derivative gravity theories

A simple algorithm for computing the propagator for higher derivative gravity theories based on the Barnes-Rivers operators is presented. The prescription is used, among other things, to obtain the propagator for quadratic gravity in an unconventional gauge. We also find the propagator for both gravity and quadratic gravity in an interesting gauge recently baptized the Einstein gauge [Hitzer and Dehnen, Int. J. Theor. Phys. 36 (1997), 559].

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.