A Lagrangian bound for many-to-many assignment problems

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

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)

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.

On Duffin-Kemmer-Petiau particles with a mixed minimal-nonminimal vector coupling and the nondegenerate bound-states for the one-dimensional inversely linear background

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

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)

Bound state solution of the grassmannian nonlinear sigma model with fermions

We construct the S-matrix for bound state (gauge-invariant) scattering for nonlinear sigma models defined on the manifold SU(n) S(U(p)⊗U(n-p)) with fermions. It is not possible to compute gauge non-singlet matrix elements. In the present language, constraints from higher conservation laws determine the bound state solution. An alternative derivation is also presented. © 1988.

Soluble and bound peroxidases from papaya fruit

Soluble and bound peroxidases were isolated from the pulp of ripening papaya fruit. During papaya ripening, soluble and bound peroxidase activities increased 2.5- and 4.2-fold, respectively. Soluble peroxidase was purified 59-fold by ammonium sulphate precipitation and chromatography on Sephadex G-25, DEAE-cellulose and Sephadex G-100. Bound peroxidase was purified 140-fold by ammonium sulphate precipitation and chromatography on Sephadex G-100 and DEAE-cellulose. Polyacrylamide gel electrophoresis of the purified preparations revealed that both enzymes were highly purified by the procedures adopted. The soluble and bound forms had a Mr of 41 000 and 54 000, respectively. Soluble and bound peroxidases showed optimum activity at pH 6.0 and 5.5, respectively, and were inhibited by p-chloromercuribenzoate, iodoacetamide, N-ethylmaleimide, potassium cyanide and Fe2+. Soluble peroxidase was activated by ammonium sulphate and this activation was prevented by cyanide. © 1990.

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.

New results on bound excitons in quantum wells

The formation of bound excitons (BE) is investigated for a GaAs/GaAlAs multiple quantum well (QW) system. The photoluminescence (PL) spectra are analysed as a function of the excitation energy. It was found that the carriers photogeneration, either in the barrier or directly in the well, do not play an important role on the BE formation. We conclude that defects localized at interfaces are ionized by of capture charges which in turn bound the free exciton (FE).

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.

Absence of Cooper-type bound states in three- and few-electron systems

It is shown that the appearance of a fixed-point singularity in the kernel of the two-electron Cooper problem is responsible for the formation of the Cooper pair for an arbitrarily weak attractive interaction between two electrons. This singularity is absent in the problem of three and few superconducting electrons at zero temperature on the full Fermi sea. Consequently, such three- and few-electron systems on the full Fermi sea do not form Cooper-type bound states for an arbitrarily weak attractive pair interaction.

Two definitions of the electric polarizability of a bound system in relativistic quantum theory

For the electric polarizability of a bound system in relativistic quantum theory, there are two definitions that have appeared in the literature. They differ depending on whether or not the vacuum background is included in the system. A recent confusion in this connection is clarified. © 1999 American Associations of Physics Teachers.

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].