An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

COMPLEX KOHN VARIATIONAL PRINCIPLE FOR 2-NUCLEON BOUND-STATE AND SCATTERING WITH THE TENSOR POTENTIAL

Complex Kohn variational principle is applied to the numerical solution of the fully off-shell Lippmann-Schwinger equation for nucleon-nucleon scattering for various partial waves including the coupled S-3(1), D-3(1), channel. Analytic expressions are obtained for all the integrals in the method for a suitable choice of expansion functions. Calculations with the partial waves S-1(0), P-1(1), D-1(2), and S-3(1)-D-3(1) of the Reid soft core potential show that the method converges faster than other solution schemes not only for the phase shift but also for the off-shell t matrix elements. We also show that it is trivial to modify this variational principle in order to make it suitable for bound-state calculation. The bound-state approach is illustrated for the S-3(1)-D-3(1) channel of the Reid soft-core potential for calculating the deuteron binding, wave function, and the D state asymptotic parameters. (c) 1995 Academic Press, Inc.

Effect of the bound nucleon form factors on charged-current neutrino-nucleus scattering

We study the effect of bound nucleon form factors on charged-current neutrino-nucleus scattering. The bound nucleon form factors of the vector and axial-vector currents are calculated in the quark-meson coupling model. We compute the inclusive C-12(nu(mu),mu(-))X cross sections using a relativistic Fermi gas model with the calculated bound nucleon form factors. The effect of the bound nucleon form factors for this reaction is a reduction of similar to8% for the total cross section, relative to that calculated with the free nucleon form factors.

Bound states of the barium atom by the hyperspherical approach

We present a nonadiabatic hyperspherical calculation of the highly excited and low lying doubly excited states of the barium atom using effective potentials for the two optically active electrons' interactions. Within the hyperspherical adiabatic approach the investigation of the spectra is performed with potential curves and nonadiabatic couplings of a unique radial variable, which allows clear identification of the states. The convergence of energy is obtained within well established bound limits, and the precision is comparable to accurate configuration interaction calculations. A very good agreement with experimental results is obtained with only few nonadiabatic couplings. (C) 2004 American Institute of Physics.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

UNITARY POLE APPROXIMATION FOR THE COULOMB-PLUS-YAMAGUCHI POTENTIAL AND APPLICATION TO A 3-BODY BOUND-STATE CALCULATION

The unitary pole approximation is used to construct a separable representation for a potential U which consists of a Coulomb repulsion plus an attractive potential of the Yamaguchi type. The exact bound-state wave function is employed. U is chosen as the potential which binds the proton in the 1d5/2 single-particle orbit in F-17. Using the separable representation derived for U, and assuming a separable Yamaguchi potential to describe the 1d5/2 neutron in O-17, the energies and wave functions of the ground state (1+) and the lowest 0+ state of F-18 are calculated in the Gore-plus-two-nucleons model solving the Faddeev equations.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

An alternative approach to solve convergence problems in the backpropagation algorithm

The multilayer perceptron network has become one of the most used in the solution of a wide variety of problems. The training process is based on the supervised method where the inputs are presented to the neural network and the output is compared with a desired value. However, the algorithm presents convergence problems when the desired output of the network has small slope in the discrete time samples or the output is a quasi-constant value. The proposal of this paper is presenting an alternative approach to solve this convergence problem with a pre-conditioning method of the desired output data set before the training process and a post-conditioning when the generalization results are obtained. Simulations results are presented in order to validate the proposed approach.

Self-bound droplet of Bose and Fermi atoms in one dimension: Collective properties in mean-field and Tonks-Girardeau regimes

We investigate a dilute mixture of bosons and spin-polarized fermions in one dimension. With an attractive Bose-Fermi scattering length the ground state is a self-bound droplet, i.e., a Bose-Fermi bright soliton where the Bose and Fermi clouds are superimposed. We find that the quantum fluctuations stabilize the Bose-Fermi soliton such that the one-dimensional bright soliton exists for any finite attractive Bose-Fermi scattering length. We study density profile and collective excitations of the atomic bright soliton showing that they depend on the bosonic regime involved: mean-field or Tonks-Girardeau.

Simple orbit determination using GPS based on a least-squares algorithm employing sequential givens rotations

A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.

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.