Fluxo de carga continuado utilizando estratégia de parametrização geométrica baseada em parâmetros físicos

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

An efficient geometric parameterization technique for the continuation power flow

Continuation methods have been shown as efficient tools for solving ill-conditioned cases, with close to singular Jacobian matrices, such as the maximum loading point of power systems. Some parameterization techniques have been proposed to avoid matrix singularity and successfully solve those cases. This paper presents a new geometric parameterization scheme that allows the complete tracing of the P-V curves without ill-conditioning problems. The proposed technique associates robustness to simplicity and, it is of easy understanding. The Jacobian matrix singularity is avoided by the addition of a line equation, which passes through a point in the plane determined by the total real power losses and loading factor. These two parameters have clear physical meaning. The application of this new technique to the IEEE systems (14, 30, 57, 118 and 300 buses) shows that the best characteristics of the conventional Newton's method are not only preserved but also improved. (C) 2006 Elsevier B.V. All rights reserved.

Parameterization technique for the continuation power flow using the trivial and tangent predictor

This paper presents efficient geometric parameterization techniques using the tangent and the trivial predictors for the continuation power flow, developed from observation of the trajectories of the load flow solution. The parameterization technique eliminates the Jacobian matrix singularity of load flow, and therefore all the consequent problems of ill-conditioning, by the addition of the line equations which pass through the points in the plane determined by the variables loading factor and the real power generated by the slack bus, two parameters with clear physical meaning. This paper also provides an automatic step size control around the maximum loading point. Thus, the resulting method enables not only the calculation of the maximum loading point, but also the complete tracing of P-V curves of electric power systems. The technique combines robustness with ease of understanding. The results to the IEEE 300-bus system and of large real systems show the effectiveness of the proposed method. © 2012 IEEE.

Geração automática de modelos digitais de superfícies utilizando múltiplas imagens

Pós-graduação em Ciências Cartográficas - FCT

Proposição de uma técnica de parametrização geométrica para o fluxo de carga continuado

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Geração e otimização de trajetórias de um manipulador robótico utilizando algoritmos genéticos

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

ZTD em tempo quase real via Estações GNSS Terrestres: estratégia de processamento para o GIPSY-OASIS II e combinação das séries temporais

Pós-graduação em Ciências Cartográficas - FCT

Mapeamento da cinemática inversa de um manipulador robótico utilizando redes neurais artificiais configuradas em paralelo

Pós-graduação em Engenharia Elétrica - FEIS

El problema del rozamiento en el análisis de estructuras de fábrica mediante modelos de sólidos rígidos

La evaluación de la seguridad de estructuras antiguas de fábrica es un problema abierto.El material es heterogéneo y anisótropo, el estado previo de tensiones difícil de conocer y las condiciones de contorno inciertas. A comienzos de los años 50 se demostró que el análisis límite era aplicable a este tipo de estructuras, considerándose desde entonces como una herramienta adecuada. En los casos en los que no se produce deslizamiento la aplicación de los teoremas del análisis límite estándar constituye una herramienta formidable por su simplicidad y robustez. No es necesario conocer el estado real de tensiones. Basta con encontrar cualquier solución de equilibrio, y que satisfaga las condiciones de límite del material, en la seguridad de que su carga será igual o inferior a la carga real de inicio de colapso. Además esta carga de inicio de colapso es única (teorema de la unicidad) y se puede obtener como el óptimo de uno cualquiera entre un par de programas matemáticos convexos duales. Sin embargo, cuando puedan existir mecanismos de inicio de colapso que impliquen deslizamientos, cualquier solución debe satisfacer tanto las restricciones estáticas como las cinemáticas, así como un tipo especial de restricciones disyuntivas que ligan las anteriores y que pueden plantearse como de complementariedad. En este último caso no está asegurada la existencia de una solución única, por lo que es necesaria la búsqueda de otros métodos para tratar la incertidumbre asociada a su multiplicidad. En los últimos años, la investigación se ha centrado en la búsqueda de un mínimo absoluto por debajo del cual el colapso sea imposible. Este método es fácil de plantear desde el punto de vista matemático, pero intratable computacionalmente, debido a las restricciones de complementariedad 0 y z 0 que no son ni convexas ni suaves. El problema de decisión resultante es de complejidad computacional No determinista Polinomial (NP)- completo y el problema de optimización global NP-difícil. A pesar de ello, obtener una solución (sin garantía de exito) es un problema asequible. La presente tesis propone resolver el problema mediante Programación Lineal Secuencial, aprovechando las especiales características de las restricciones de complementariedad, que escritas en forma bilineal son del tipo y z = 0; y 0; z 0 , y aprovechando que el error de complementariedad (en forma bilineal) es una función de penalización exacta. Pero cuando se trata de encontrar la peor solución, el problema de optimización global equivalente es intratable (NP-difícil). Además, en tanto no se demuestre la existencia de un principio de máximo o mínimo, existe la duda de que el esfuerzo empleado en aproximar este mínimo esté justificado. En el capítulo 5, se propone hallar la distribución de frecuencias del factor de carga, para todas las soluciones de inicio de colapso posibles, sobre un sencillo ejemplo. Para ello, se realiza un muestreo de soluciones mediante el método de Monte Carlo, utilizando como contraste un método exacto de computación de politopos. El objetivo final es plantear hasta que punto está justificada la busqueda del mínimo absoluto y proponer un método alternativo de evaluación de la seguridad basado en probabilidades. Las distribuciones de frecuencias, de los factores de carga correspondientes a las soluciones de inicio de colapso obtenidas para el caso estudiado, muestran que tanto el valor máximo como el mínimo de los factores de carga son muy infrecuentes, y tanto más, cuanto más perfecto y contínuo es el contacto. Los resultados obtenidos confirman el interés de desarrollar nuevos métodos probabilistas. En el capítulo 6, se propone un método de este tipo basado en la obtención de múltiples soluciones, desde puntos de partida aleatorios y calificando los resultados mediante la Estadística de Orden. El propósito es determinar la probabilidad de inicio de colapso para cada solución.El método se aplica (de acuerdo a la reducción de expectativas propuesta por la Optimización Ordinal) para obtener una solución que se encuentre en un porcentaje determinado de las peores. Finalmente, en el capítulo 7, se proponen métodos híbridos, incorporando metaheurísticas, para los casos en que la búsqueda del mínimo global esté justificada. Abstract Safety assessment of the historic masonry structures is an open problem. The material is heterogeneous and anisotropic, the previous state of stress is hard to know and the boundary conditions are uncertain. In the early 50's it was proven that limit analysis was applicable to this kind of structures, being considered a suitable tool since then. In cases where no slip occurs, the application of the standard limit analysis theorems constitutes an excellent tool due to its simplicity and robustness. It is enough find any equilibrium solution which satisfy the limit constraints of the material. As we are certain that this load will be equal to or less than the actual load of the onset of collapse, it is not necessary to know the actual stresses state. Furthermore this load for the onset of collapse is unique (uniqueness theorem), and it can be obtained as the optimal from any of two mathematical convex duals programs However, if the mechanisms of the onset of collapse involve sliding, any solution must satisfy both static and kinematic constraints, and also a special kind of disjunctive constraints linking the previous ones, which can be formulated as complementarity constraints. In the latter case, it is not guaranted the existence of a single solution, so it is necessary to look for other ways to treat the uncertainty associated with its multiplicity. In recent years, research has been focused on finding an absolute minimum below which collapse is impossible. This method is easy to set from a mathematical point of view, but computationally intractable. This is due to the complementarity constraints 0 y z 0 , which are neither convex nor smooth. The computational complexity of the resulting decision problem is "Not-deterministic Polynomialcomplete" (NP-complete), and the corresponding global optimization problem is NP-hard. However, obtaining a solution (success is not guaranteed) is an affordable problem. This thesis proposes solve that problem through Successive Linear Programming: taking advantage of the special characteristics of complementarity constraints, which written in bilinear form are y z = 0; y 0; z 0 ; and taking advantage of the fact that the complementarity error (bilinear form) is an exact penalty function. But when it comes to finding the worst solution, the (equivalent) global optimization problem is intractable (NP-hard). Furthermore, until a minimum or maximum principle is not demonstrated, it is questionable that the effort expended in approximating this minimum is justified. XIV In chapter 5, it is proposed find the frequency distribution of the load factor, for all possible solutions of the onset of collapse, on a simple example. For this purpose, a Monte Carlo sampling of solutions is performed using a contrast method "exact computation of polytopes". The ultimate goal is to determine to which extent the search of the global minimum is justified, and to propose an alternative approach to safety assessment based on probabilities. The frequency distributions for the case study show that both the maximum and the minimum load factors are very infrequent, especially when the contact gets more perfect and more continuous. The results indicates the interest of developing new probabilistic methods. In Chapter 6, is proposed a method based on multiple solutions obtained from random starting points, and qualifying the results through Order Statistics. The purpose is to determine the probability for each solution of the onset of collapse. The method is applied (according to expectations reduction given by the Ordinal Optimization) to obtain a solution that is in a certain percentage of the worst. Finally, in Chapter 7, hybrid methods incorporating metaheuristics are proposed for cases in which the search for the global minimum is justified.

Meiotic recombination and chromosome segregation in Schizosaccharomyces pombe

In most organisms homologous recombination is vital for the proper segregation of chromosomes during meiosis, the formation of haploid sex cells from diploid precursors. This review compares meiotic recombination and chromosome segregation in the fission yeast Schizosaccharomyces pombe and the distantly related budding yeast Saccharomyces cerevisiae, two especially tractable microorganisms. Certain features, such as the occurrence of DNA breaks associated with recombination, appear similar, suggesting that these features may be common in eukaryotes. Other features, such as the role of these breaks and the ability of chromosomes to segregate faithfully in the absence of recombination, appear different, suggesting multiple solutions to the problems faced in meiosis.

Padrões alimentares praticados por adolescentes: influência de fatores socioeconômicos e relação com o estado nutricional

Introdução: A caracterização dos padrões alimentares dos adolescentes permite analisar os efeitos da dieta como um todo sobre a saúde. Objetivos: Identificar na literatura científica as múltiplas soluções adotadas nas técnicas multivariadas para obtenção de padrões alimentares; Analisar a relação entre os principais padrões alimentares praticados por adolescentes brasileiros com o excesso de peso e obesidade e Analisar a influência de fatores socioeconômicos sobre os principais padrões alimentares praticados por um grupo multiétnico de adolescentes. Métodos: Esta tese foi composta de três artigos. O primeiro corresponde a uma revisão da literatura sobre padrões alimentares estimados por diferentes técnicas multivariadas. Para os demais artigos duas bases de dados foram utilizadas: a Pesquisa de Orçamentos Familiares (POF) de 2008 09 e o estudo Healthy Lifestyle in Europe by Nutrition in Adolescence (HELENA) conduzido em 2006-07. A análise fatorial exploratória foi utilizada para obtenção dos padrões alimentares. O segundo artigo utilizou modelo de regressão logística para verificar a associação entre os escores dos padrões alimentares e o excesso de peso e obesidade ajustado para variáveis socioeconômicas. O terceiro artigo utilizou o modelo de regressão linear para avaliar a associação entre indicadores de renda e escolaridade e os escores dos padrões alimentares. Resultados: Na revisão da literatura foi verificado grande heterogeneidade na escolha dos critérios adotados durante as múltiplas etapas das técnicas multivariadas. No segundo manuscrito, foi verificado que quanto maior a adesão ao Padrão Lanches e ao Padrão Snacks maior a chance de estar com excesso de peso e obesidade. No terceiro manuscrito, 10 padrões alimentares foram identificados entre adolescentes de áreas urbanas no Brasil e Europa. Entre os adolescentes brasileiros, maiores níveis socioeconômicos e educacionais da pessoa de referência do domicílio foram associados positivamente com o padrão composto por queijo, cereais matinais, frutas e sucos de fruta, leite e derivados. Entre os adolescentes europeus, maiores níveis socioeconômicos e maior educação das mães foram positivamente associados ao padrão composto por bebidas lácteas, cereais matinais; leite e derivados, manteiga e margarina, além disso, maiores níveis socioeconômicos também foram negativamente associados com o padrão composto por óleos vegetais, nozes, sementes, pão, carnes, leguminosas, hortaliças e tubérculos, ovos e os maiores níveis de de educação materna foram associados negativamente com o padrão composto por pão; carne; bebidas açúcaradas e salgadinhos. Conclusão: Os achados mostraram a elevada prática de padrões alimentares baseados em alimentos com altas concentrações de gorduras e açúcares os quais estão sendo responsáveis pelo aumento no excesso de peso e obesidade entre os adolescentes brasileiros. No geral, os adolescentes que possuíram maior renda ou bens materiais e maior nível de escolaridade do adulto responsável praticaram padrões alimentares um pouco mais saudáveis. No entanto, no Brasil a maior escolaridade da pessoa de referência do domicílio por si só não está diretamente associada a melhores práticas alimentares entre os adolescentes, o contrário do que acontece na Europa. Sendo assim, o maior acesso à renda e a maior escolaridade dos responsáveis desempenham um papel importante na adoção de padrões alimentares mais saudáveis entre os adolescentes.

FPGA implementation of a multi-population PBIL algorithm

Evolutionary-based algorithms play an important role in finding solutions to many problems that are not solved by classical methods, and particularly so for those cases where solutions lie within extreme non-convex multidimensional spaces. The intrinsic parallel structure of evolutionary algorithms are amenable to the simultaneous testing of multiple solutions; this has proved essential to the circumvention of local optima, and such robustness comes with high computational overhead, though custom digital processor use may reduce this cost. This paper presents a new implementation of an old, and almost forgotten, evolutionary algorithm: the population-based incremental learning method. We show that the structure of this algorithm is well suited to implementation within programmable logic, as compared with contemporary genetic algorithms. Further, the inherent concurrency of our FPGA implementation facilitates the integration and testing of micro-populations.

Genetic algorithms with applications in wireless communications

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.

Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM

This paper derives the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasi-static frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhaustive search approach can be used for low memory order STTC with small frame size. However with moderate memory order STTC and moderate frame size the computational cost of exhaustive search increases exponentially, and may become impractical for high memory order STTCs. This requires advanced computational techniques such as Genetic Algorithms (GAS). In this paper, a GA with sharing function method is used to locate the multiple solutions of the distance spectrum for high memory order STTCs. Simulation evaluates the performance union bound and the complexity comparison of non-GA aided and GA aided distance spectrum techniques. It shows that the union bound give a close performance measure at high signal-to-noise ratio (SNR). It also shows that GA sharing function method based distance spectrum technique requires much less computational time as compared with exhaustive search approach but with satisfactory accuracy.

Nonlinear periodic problems with a jumping reaction

We consider a periodic problem driven by the scalar $p-$Laplacian and with a jumping (asymmetric) reaction. We prove two multiplicity theorems. The first concerns the nonlinear problem ($1solutions. The second is for the semilinear problem ($p=2$) and produces three solutions. The tools of our analysis are variational and Morse theoretic.