Self-dual super-Yang-Mills as a string theory in (x, θ) space

Different string theories in twistor space have recently been proposed for describing N = 4 super-Yang-Mills. In this paper, a string theory in (x, θ) space is constructed for self-dual N = 4 super-Yang-Mills. It is hoped that these results will be useful for understanding the twistor-string proposals and their possible relation with the pure spinor formalism of the D = 10 superstring. © SISSA/ISAS 2004.

Conformal supergravity in twistor-string theory

Conformal supergravity arises in presently known formulations of twistor-string theory either via closed strings or via gauge-singlet open strings. We explore this sector of twistor-string theory, relating the relevant string modes to the particles and fields of conformal supergravity. We use the twistor-string theory to compute some tree level scattering amplitudes with supergravitons. Since the supergravitons interact with the same coupling constant as the Yang-Mills fields, conformal supergravity states will contribute to loop amplitudes of Yang-Mills gluons in these theories. Those loop amplitudes will therefore not coincide with the loop amplitudes of pure super Yang-Mills theory. © SISSA/ISAS 2004.

WZW-like action for heterotic string field theory

We complete the construction of the Neveu-Schwarz sector of heterotic string field theory begun in [9] by giving a closed-form expression for the action and gauge transformations. Just as the Wess-Zumino-Witten (WZW) action for open superstring field theory can be constructed from pure-gauge fields in bosonic open string field theory, our heterotic string field theory action is constructed from pure-gauge fields in bosonic closed string field theory. The construction involves a simple alternative form of the WZW action which is consistent with the algebraic structures of closed string field theory. © SISSA/ISAS 2004.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Defects location in power systems components through a dedicated genetic algorithm

In this work the problem of defects location in power systems is formulated through a binary linear programming (BLP) model based on alarms historical database of control and protection devices from the system control center, sets theory of minimal coverage (AI) and protection philosophy adopted by the electric utility. In this model, circuit breaker operations are compared to their expected states in a strictly mathematical manner. For solving this BLP problem, which presents a great number of decision variables, a dedicated Genetic Algorithm (GA), is proposed. Control parameters of the GA, such as crossing over and mutation rates, population size, iterations number and population diversification, are calibrated in order to obtain efficiency and robustness. Results for a test system found in literature, are presented and discussed. © 2004 IEEE.

PMUs optimized allocation using a tabu search algorithm for fault location in electric power distribution system

Phasor Measurement Units (PMUs) optimized allocation allows control, monitoring and accurate operation of electric power distribution systems, improving reliability and service quality. Good quality and considerable results are obtained for transmission systems using fault location techniques based on voltage measurements. Based on these techniques and performing PMUs optimized allocation it is possible to develop an electric power distribution system fault locator, which provides accurate results. The PMUs allocation problem presents combinatorial features related to devices number that can be allocated, and also probably places for allocation. Tabu search algorithm is the proposed technique to carry out PMUs allocation. This technique applied in a 141 buses real-life distribution urban feeder improved significantly the fault location results. © 2004 IEEE.

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 ĉ ≤ 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-Poincaré 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. © SISSA 2005.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

Genetic algorithm of chu and beasley for static and multistage transmission expansion planning

In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, to efficiently solve the problem described above are also presented. Results using some known systems show that the GACB is very efficient. To validate the GACB, we compare the results achieved using it with the results using other meta-heuristics like tabu-search, simulated annealing, extended genetic algorithm and hibrid algorithms. © 2006 IEEE.

3-Dimensional hopf bifurcation via averaging theory

We consider the Lorenz system ẋ = σ(y - x), ẏ = rx - y - xz and ż = -bz + xy; and the Rössler system ẋ = -(y + z), ẏ = x + ay and ż = b - cz + xz. Here, we study the Hopf bifurcation which takes place at q± = (±√br - b,±√br - b, r - 1), in the Lorenz case, and at s± = (c+√c2-4ab/2, -c+√c2-4ab/2a, c±√c2-4ab/2a) in the Rössler case. As usual this Hopf bifurcation is in the sense that an one-parameter family in ε of limit cycles bifurcates from the singular point when ε = 0. Moreover, we can determine the kind of stability of these limit cycles. In fact, for both systems we can prove that all the bifurcated limit cycles in a neighborhood of the singular point are either a local attractor, or a local repeller, or they have two invariant manifolds, one stable and the other unstable, which locally are formed by two 2-dimensional cylinders. These results are proved using averaging theory. The method of studying the Hopf bifurcation using the averaging theory is relatively general and can be applied to other 3- or n-dimensional differential systems.

Risk-assessment algorithm and recommendations for venous thromboembolism prophylaxis in medical patients

The risk for venous thromboembolism (VTE) in medical patients is high, but risk assessment is rarely performed because there is not yet a good method to identify candidates for prophylaxis. Purpose: To perform a systematic review about VTE risk factors (RFs) in hospitalized medical patients and generate recommendations (RECs) for prophylaxis that can be implemented into practice. Data sources: A multidisciplinary group of experts from 12 Brazilian Medical Societies searched MEDLINE, Cochrane, and LILACS. Study selection: Two experts independently classified the evidence for each RF by its scientific quality in a standardized manner. A risk-assessment algorithm was created based on the results of the review. Data synthesis: Several VTE RFs have enough evidence to support RECs for prophylaxis in hospitalized medical patients (eg, increasing age, heart failure, and stroke). Other factors are considered adjuncts of risk (eg, varices, obesity, and infections). According to the algorithm, hospitalized medical patients ≥40 years-old with decreased mobility, and ≥1 RFs should receive chemoprophylaxis with heparin, provided they don't have contraindications. High prophylactic doses of unfractionated heparin or low-molecular-weight-heparin must be administered and maintained for 6-14 days. Conclusions: A multidisciplinary group generated evidence-based RECs and an easy-to-use algorithm to facilitate VTE prophylaxis in medical patients. © 2007 Rocha et al, publisher and licensee Dove Medical Press Ltd.

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 IEEE.

Branch and bound algorithm for transmission network expansion planning using DC model

This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.

Heuristic algorithm to solve the short term transmission network expansion planning

In this paper, a method for solving the short term transmission network expansion planning problem is presented. This is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In order to And a solution of excellent quality for this problem, a constructive heuristic algorithm is presented in this paper. In each step of the algorithm, a sensitivity index is used to add a circuit (transmission line or transformer) or a capacitor bank (fixed or variable) to the system. This sensitivity index is obtained solving the problem considering the numbers of circuits and capacitors banks to be added (relaxed problem), as continuous variables. The relaxed problem is a large and complex nonlinear programming and was solved through a higher order interior point method. The paper shows results of several tests that were performed using three well-known electric energy systems in order to show the possibility and the advantages of using the AC model. ©2007 IEEE.