Responsiveness of the interrenal tissue of Jundia (Rhamdia quelen) to an in vivo ACTH test following acute exposure to sublethal concentrations of agrichemicals

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

A modified Primal-Dual Logarithmic-Barrier Method for solving the Optimal Power Flow problem with discrete and continuous control variables

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

Esquemas alternativos para o passo de parametrização do método da continuação baseados em parâmetros físicos

O método de fluxo de carga convencional é considerado inadequado para se obter o ponto de máximo carregamento (PMC) de sistemas de potência, devido à singularidade da matriz Jacobiana neste ponto. Os métodos da continuação são ferramentas eficientes para a solução deste tipo de problema, visto que técnicas de parametrização podem ser utilizadas para evitar a singularidade da matriz Jacobiana. Neste trabalho, novas opções para a etapa de parametrização do método da continuação são apresentadas. Mostra-se que variáveis com claro significado físico podem ser utilizadas na etapa de parametrização. As seguintes variáveis foram testadas: perda total de potência ativa e reativa, potência ativa e reativa na barra de referência, potência reativa das barras de geração, e as perdas de potência ativa e reativa nas linhas de transmissão (LT). Além de facilitar a implementação computacional do método de continuação, as técnicas de parametrização apresentadas simplificam a definição matemática e o entendimento do método por parte de engenheiros de potência, visto que os métodos de continuação existentes na literatura sempre utilizam técnicas de parametrização complexas, e de interpretação puramente geométrica. Resultados obtidos com a nova metodologia para os sistemas testes do IEEE (14, 30, 57 e 118 barras) mostram que as características de convergência do método de fluxo de carga convencional são melhoradas na região do PMC. Além disso, durante o traçado das curvas PV, as diversas técnicas de parametrização podem ser comutadas entre si possibilitando o cálculo de todos os pontos da curva com um número reduzido de iterações. Diversos testes são realizados para proporcionar a comparação do desempenho dos esquemas de parametrização propostos.

An effortless hybrid method to solve economic load dispatch problem in power systems

This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time. (C) 2011 Elsevier Ltd. All rights reserved.

A Strategy to Solve the Multistage Transmission Expansion Planning Problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Multi Objective Evolutionary Algorithm Applied to the Optimal Power Flow Problem

This work presents the application of a multiobjective evolutionary algorithm (MOEA) for optimal power flow (OPF) solution. The OPF is modeled as a constrained nonlinear optimization problem, non-convex of large-scale, with continuous and discrete variables. The violated inequality constraints are treated as objective function of the problem. This strategy allows attending the physical and operational restrictions without compromise the quality of the found solutions. The developed MOEA is based on the theory of Pareto and employs a diversity-preserving mechanism to overcome the premature convergence of algorithm and local optimal solutions. Fuzzy set theory is employed to extract the best compromises of the Pareto set. Results for the IEEE-30, RTS-96 and IEEE-354 test systems are presents to validate the efficiency of proposed model and solution technique.

Comparative evaluation of an indirect ELISA test for diagnosis of swine cysticercosis employing antigen from Taenia solium and Taenia crassiceps metacestodes

Taenia solium cysticercosis is still a serious public health problem in several countries where poverty and lack of hygiene favor transmission. Because pigs are the primary intermediate hosts, prevalence of porcine cysticercosis is a reliable indicator of active transmission zones. Serological diagnostic methods are important tools for epidemiological studies since they can be applied to living animals on a large scale. Four antigen preparations (cyst fluid and crude) from T. solium and T. crassiceps metacestodes were compared for swine cysticercosis diagnosis by indirect ELISA (IE). Twenty-eight serum samples from swine naturally and experimentally infected by cysticerci of T. solium and 56 serum samples from swine reared in commercial herds were tested. Best results of overall sensitivity were obtained by the use of cyst fluid and crude antigen of T. crassiceps metacestode (100 and 96.4%, respectively). Using homologous antigen preparations we have observed higher specificity percentage (98.2% for cyst fluid and 96.4% for crude metacestode T. solium antigen). We concluded that sensitivity is of far more importance than specificity for identification of endemic areas in order to prevent transmission to man. We conclude, therefore, that IE performed with cyst fluid antigen of T. crassiceps metacestode is a better tool for that purpose. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Comparison between RT-PCR and the mouse inoculation test for detection of rabies virus in samples kept for long periods under different conditions

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

Designing a modified Hopfield network to solve an Economic Dispatch problem with nonlinear cost function

Economic Dispatch (ED) problems have recently been solved by artificial neural networks approaches. In most of these dispatch models, the cost function must be linear or quadratic. Therefore, functions that have several minimum points represent a problem to the simulation since these approaches have not accepted nonlinear cost function. Another drawback pointed out in the literature is that some of these neural approaches fail to converge efficiently towards feasible equilibrium points. This paper discusses the application of a modified Hopfield architecture for solving ED problems defined by nonlinear cost function. The internal parameters of the neural network adopted here are computed using the valid-subspace technique, which guarantees convergence to equilibrium points that represent a solution for the ED problem. Simulation results and a comparative analysis involving a 3-bus test system are presented to illustrate efficiency of the proposed approach.

Logarithmic barrier-augmented Lagrangian function to the optimal power flow problem

This paper presents a new approach to solve the Optimal Power Flow problem. This approach considers the application of logarithmic barrier method to voltage magnitude and tap-changing transformer variables and the other constraints are treated by augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. (C) 2005 Elsevier Ltd. All rights reserved.

A new approach to the solution of the optimal power flow problem based on the modified Newton's method associated to an augmented Lagrangian function

This paper presents a new algorithm for optimal power flow problem. The algorithm is based on Newton's method which it works with an Augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints and is solved using the modified-Newton method. The test results have shown the effectiveness of the approach using the IEEE 30 and 638 bus systems.

Simple heuristics for the assembly line worker assignment and balancing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

TWO DECOMPOSITION APPROACHES APPLIED TO THE MULTI-AREA OPTIMAL REACTIVE POWER FLOW PROBLEM

This paper applies two methods of mathematical decomposition to carry out an optimal reactive power flow (ORPF) in a coordinated decentralized way in the context of an interconnected multi-area power system. The first method is based on an augmented Lagrangian approach using the auxiliary problem principle (APP). The second method uses a decomposition technique based on the Karush-Kuhn-Tucker (KKT) first-order optimality conditions. The viability of each method to be used in the decomposition of multi-area ORPF is studied and the corresponding mathematical models are presented. The IEEE RTS-96, the IEEE 118-bus test systems and a 9-bus didactic system are used in order to show the operation and effectiveness of the decomposition methods.

A new solution to the optimal power flow problem

A new approach to solving the Optimal Power Flow problem is described, making use of some recent findings, especially in the area of primal-dual methods for complex programming. In this approach, equality constraints are handled by Newton's method inequality constraints for voltage and transformer taps by the logarithmic barrier method and the other inequality constraints by the augmented Lagrangian method. Numerical test results are presented, showing the effective performance of this algorithm. © 2001 IEEE.