A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Allocation of protective devices in distribution circuits using nonlinear programming models and genetic algorithms

The optimized allocation of protective devices in strategic points of the circuit improves the quality of the energy supply and the system reliability index. This paper presents a nonlinear integer programming (NLIP) model with binary variables, to deal with the problem of protective device allocation in the main feeder and all branches of an overhead distribution circuit, to improve the reliability index and to provide customers with service of high quality and reliability. The constraints considered in the problem take into account technical and economical limitations, such as coordination problems of serial protective devices, available equipment, the importance of the feeder and the circuit topology. The use of genetic algorithms (GAs) is proposed to solve this problem, using a binary representation that does (1) or does not (0) show allocation of protective devices (reclosers, sectionalizers and fuses) in predefined points of the circuit. Results are presented for a real circuit (134 busses), with the possibility of protective device allocation in 29 points. Also the ability of the algorithm in finding good solutions while improving significantly the indicators of reliability is shown. (C) 2003 Elsevier B.V. All rights reserved.

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

On relaxed LMI-based design for fuzzy controllers

Relaxed conditions for stability of nonlinear continuous-time systems given by fuzzy models axe presented. A theoretical analysis shows that the proposed method provides better or at least the same results of the methods presented in the literature. Digital simulations exemplify this fact. This result is also used for fuzzy regulators design. The nonlinear systems are represented by fuzzy models proposed by Takagi and Sugeno. The stability analysis and the design of controllers axe described by LMIs (Linear Matrix Inequalities), that can be solved efficiently using convex programming techniques.

On relaxed LMI-based designs for fuzzy regulators and fuzzy observers

Relaxed conditions for stability of nonlinear, continuous and discrete-time systems given by fuzzy models are presented. A theoretical analysis shows that the proposed methods provide better or at least the same results of the methods presented in the literature. Numerical results exemplify this fact. These results are also used for fuzzy regulators and observers designs. The nonlinear systems are represented by fuzzy models proposed by Takagi and Sugeno. The stability analysis and the design of controllers are described by linear matrix inequalities, that can be solved efficiently using convex programming techniques. The specification of the decay rate, constrains on control input and output are also discussed.

Determination of the optimal quantity of crop residues for energy in sugarcane crop management using linear programming in variety selection and planting strategy

The aim of this work was to present organizational models for optimizing the reduction of crop residue generated by the sugarcane culture. The first model consisted of the selection of varieties of sugarcane to be planted meeting the mill requirements and, at the same time, to minimize the quantity of residue produced. The second model discussed the use of residue to produce energy. This is related to the selection of variety and quantity to be planted, in order to meet the requirements of the mill, to reduce the quantity of residue, and to maximize as much as possible the energy production. The use of linear programming was proposed. The two models presented similar results in this study, and both may be used to define the varieties and areas to be cultivated. (C) 2001 Published by Elsevier B.V. Ltd.

Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration

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

Heterogeneity correction in the construction of optimized planning in radiotherapy using linear programming

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

A simplified Fermi Accelerator Model under quadratic frictional force

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

A class of reversible quadratic polynomial vector fields on S-2

We study a class of quadratic reversible polynomial vector fields on S-2. We classify all the centers of this class of vector fields and we characterize its global phase portrait. (C) 2010 Elsevier B.V. All rights reserved.

On the reversible quadratic polynomial vector fields on S-2

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

Quadratic gravity in (2+1)D with a topological Chern-Simons term

Three-dimensional quadratic gravity, unlike general relativity in (2+1)D, is dynamically nontrivial and has a well behaved nonrelativistic potential. Here we analyse the changes that occur when a topological Chem-Simons term is added to this theory. It is found that the harmless massive scalar mode of the latter gives rise to a troublesome massive spin-0 ghost, while the massive spin-2 ghost is replaced by two massive physical particles both of spin 2. We also found that light deflection does not have the 'wrong sign' such as in the framework of three-dimensional quadratic gravity.

Can one cure the nommitarity of three-dimensional quadratic gravity using a topological Chern-Simons term?

Quadratic gravity in (2+1)D is nonunitarity at the tree level. When a topological Chern-Simons term is added to this theory, the harmless massive scalar mode of the former gives rise to a troublesome massive spin-0 ghost, while the massive spin-2 ghost is replaced by two massive physical particles both of spin-2. Therefore, unlike what it is claimed in the literature, quadratic Chern-Simons gravity in (2+1)D is nonunitary at the tree level.

The quadratic spinor Lagrangian, axial torsion current and generalizations

We show that the Einstein-Hilbert, the Einstein-Palatini, and the Holst actions can be derived from the Quadratic Spinor Lagrangian (QSL), when the three classes of Dirac spinor fields, under Lounesto spinor field classification, are considered. To each one of these classes, there corresponds an unique kind of action for a covariant gravity theory. In other words, it is shown to exist a one-to-one correspondence between the three classes of non-equivalent solutions of the Dirac equation, and Einstein-Hilbert, Einstein-Palatini, and Holst actions. Furthermore, it arises naturally, from Lounesto spinor field classification, that any other class of spinor field-Weyl, Majorana, flagpole, or flag-dipole spinor fields-yields a trivial (zero) QSL, up to a boundary term. To investigate this boundary term, we do not impose any constraint on the Dirac spinor field, and consequently we obtain new terms in the boundary component of the QSL. In the particular case of a teleparallel connection, an axial torsion one-form current density is obtained. New terms are also obtained in the corresponding Hamiltonian formalism. We then discuss how these new terms could shed new light on more general investigations.

Linear to quadratic crossover of Cooper-pair dispersion relation

Cooper pairing is studied in three dimensions to determine its binding energy for all coupling using a general separable interfermion interaction. Also considered are Cooper pairs (CPs) with nonzero center-of-mass momentum (CMM). A coupling-independent linear term in the CMM dominates the pair excitation energy in weak coupling and/or high fermion density, while the more familiar quadratic term prevails only in the extreme low-density (i.e., vacuum) limit for any nonzero coupling. The linear-to-quadratic crossover of the CP dispersion relation is analyzed numerically, and is expected to play a central role in a model of superconductivity (and superfluidity) simultaneously accommodating a Bardeen-Cooper-Schrieffer condensate as well as a Bose-Einstein condensate of CP bosons. (C) 2001 Elsevier B.V. B,V. All rights reserved.