Multiobjective short-term planning of electric power distribution systems using NSGA-II

This paper presents a mixed integer nonlinear programming multiobjective model for short-term planning of distribution networks that considers in an integrated manner the following planning activities: allocation of capacitor banks; voltage regulators; the cable replacement of branches and feeders. The objective functions considered in the proposed model are: to minimize operational and investment costs and minimize the voltage deviations in the the network buses, subject to a set of technical and operational constraints. A multiobjective genetic algorithm based on a Non-Dominated Sorting Genetic Algorithm (NSGA-II) is proposed to solve this model. The proposed mathematical model and solution methodology is validated testing a medium voltage distribution system with 135 buses. © 2013 Brazilian Society for Automatics - SBA.

Estudio preliminar sobre la técnica de programación del desarrollo económico = Preliminary study of the technique of programming economic development

Incluye Bibliografía

Orientaciones metodológicas para la programación a corto plazo = Methodological principles for short-term programming

Incluye Bibliografía

A method for improving the code rate and error correction capability of a cyclic code

Currently, there has been an increasing demand for operational and trustworthy digital data transmission and storage systems. This demand has been augmented by the appearance of large-scale, high-speed data networks for the exchange, processing and storage of digital information in the different spheres. In this paper, we explore a way to achieve this goal. For given positive integers n,r, we establish that corresponding to a binary cyclic code C0[n,n-r], there is a binary cyclic code C[(n+1)3k-1,(n+1)3k-1-3kr], where k is a nonnegative integer, which plays a role in enhancing code rate and error correction capability. In the given scheme, the new code C is in fact responsible to carry data transmitted by C0. Consequently, a codeword of the code C0 can be encoded by the generator matrix of C and therefore this arrangement for transferring data offers a safe and swift mode. © 2013 SBMAC - Sociedade Brasileira de Matemática Aplicada e Computacional.

Irregular satellites of Jupiter: Three-dimensional study of binary-asteroid captures

Among the hidden pieces of the giant puzzle, which is our Solar system, the origins of irregularsatellites of the giant planets stand to be explained, while the origins of regular satellites arewell explained by the in situ formation model through matter accretion. Once they are notlocally formed, the most acceptable theory predicts that they had been formed elsewhere andbecame captured later, most likely during the last stage of planet formation. However, underthe restricted three-body problem theory, captures are temporary and there is still no assistedcapture mechanism which is well established. In a previous work, we showed that the capturemechanism of a binary asteroid under the co-planar four-body scenario yielded permanentcaptured objects with an orbital shape which is very similar to those of the actual progradeirregular Jovian satellites. By extending our previous study to a 3D case, here we demonstratethat the capture mechanism of a binary asteroid can produce permanent captures of objects byitself which have very similar orbits to irregular Jovian satellites. Some of the captured objectswithout aid of gas drag or other mechanisms present a triplet: semi-major axis, eccentricityand inclination, which is comparable to the already known irregular Jovian objects. © 2013 The Authors Published by Oxford University Press on behalf of the Royal Astronomical Society.