ALGORITHM FOR PROBABILISTIC ANALYSIS of DISTRIBUTION SYSTEMS WITH DISTRIBUTED GENERATION

In this paper an efficient algorithm for probabilistic analysis of unbalanced three-phase weakly-meshed distribution systems is presented. This algorithm uses the technique of Two-Point Estimate Method for calculating the probabilistic behavior of the system random variables. Additionally, the deterministic analysis of the state variables is performed by means of a Compensation-Based Radial Load Flow (CBRLF). Such load flow efficiently exploits the topological characteristics of the network. To deal with distributed generation, a strategy to incorporate a simplified model of a generator in the CBRLF is proposed. Thus, depending on the type of control and generator operation conditions, the node with distributed generation can be modeled either as a PV or PQ node. To validate the efficiency of the proposed algorithm, the IEEE 37 bus test system is used. The probabilistic results are compared with those obtained using the Monte Carlo method.

Feature selection through gravitational search algorithm

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.

An algorithm for arranging response surface designs in small blocks

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.

Quantitative comparisons and models of time-averaging in bivalve and brachiopod shell accumulations

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

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

The Q-D algorithm for transforming series expansions into a corresponding continued fraction: an extension to cope with zero coefficients

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.

Efficient robust optimization based on polynomial chaos and tabu search algorithm

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.

Using genetic algorithm to design protein sequence

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.

Relaxation algorithm to hyperbolic states in Gross-Pitaevskii equation

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.

Entropy of bosonic open string and boundary conditions

The entropy of the states associated to the solutions of the equations of motion of the bosonic open string with combinations of Neumann and Dirichlet boundary conditions is given. Also, the entropy of the string in the states \A(i)] = alpha(-1)(i)\0] and \phi(a)]= alpha(-1)(a)\0] that describe the massless fields on the world-volume of the Dp-brane is computed. (C) 2002 Elsevier B.V. B.V. All rights reserved.

The tachyon potential in open Neveu-Schwarz string field theory

A classical action for open superstring field theory has been proposed which does not suffer from contact term problems. After generalizing this action to include the non-GSO projected states of the Neveu-Schwarz string, the pure tachyon contribution to the tachyon potential is explicitly computed. The potential has a minimum of V = 1/32g(2) which is 60% of the predicted exact minimum of V = 1/2 pi(2)g(2) from D-brane arguments.

Closed string thermal torus from thermo field dynamics

In this Letter a topological interpretation for the string thermal vacuum in the thermo field dynamics (TFD) approach is given. As a consequence, the relationship between the imaginary time and TFD formalisms is achieved when both are used to study closed strings at finite temperature. The TFD approach starts by duplicating the system's degrees of freedom, defining an auxiliary (tilde) string. In order to lead the system to finite temperature a Bogoliubov transformation is implemented. We show that the effect of this transformation is to glue together the string and the tilde string to obtain a torus. The thermal vacuum appears as the boundary state for this identification. Also, from the thermal state condition, a Kubo-Martin-Schwinger condition for the torus topology is derived. © 2005 Elsevier B.V. All rights reserved.

Affine Toda model coupled to matter and the string tension in 2D QCD

The sl(2) affine Toda model coupled to matter is shown to describe various features, such as the spectrum and string tension, of the low-energy effective Lagrangian of two-dimensional QCD (one flavor and N colors). The corresponding string tension is computed when the dynamical quarks are in the fundamental representation of SU(N) and in the adjoint representation of SU(2).

Pure spinor formalism as an N=2 topological string

Following suggestions of Nekrasov and Siegel, a non-minimal set of fields are added to the pure spinor formalism for the superstring. Twisted (c) over cap = 3 N = 2 generators are then constructed where the pure spinor BRST operator is the fermionic spin-one generator, and the formalism is interpreted as a critical topological string. Three applications of this topological string theory include the super-Poincare covariant computation of multiloop superstring amplitudes without picture-changing operators, the construction of a cubic open superstring field theory without contact-term problems, and a new four-dimensional version of the pure spinor formalism which computes F-terms in the spacetime action.

Brane cosmic string compactification in Brans-Dicke theory

We investigate an alternative compactification of extra dimensions using local cosmic string in the Brans-Dicke gravity framework. In the context of dynamical systems it is possible to show that there exist a stable field configuration for the Einstein-Brans-Dicke equations. We explore the analogies between this particular model and the Randall-Sundrum scenario.