Aplicação da técnica de imunofluorescência direta para o diagnóstico da leishmaniose visceral canina em aspirado de linfonodo

Recentemente, foco de leishmaniose visceral canina (CVL) foi descrito na região noroeste do Estado de São Paulo - Brasil. O Hospital Veterinário - UNESP - Araçatuba, no ano de 2.000, desenvolveu 60 testes citopatológicos de casos suspeitos de leishmaniose usando aspirado por agulha fina (FNA). Os esfregaços de linfonodo foram corados pelo método de Romanowsky (Diff-Quik®) e observados em microscopia de luz. Os casos positivos mostraram formas amastigotas típicas de Leishmania livres ou em vacúolos de macrófagos. Sinais citopatológicos de reatividade do sistema linfo-histiocitário com ausência de parasitos foram também observados. Com o objetivo de implementar o diagnóstico da CVL, detectando parasitos e material antigênico nos esfregaços, aplicou-se a reação de imunofluorescência direta (IFD) usando anticorpo policlonal anti-Leishmania produzido em camundongo. Comparamos o método de IFD com a pesquisa direta do parasito em esfregaços corados pelo método de Romanowsky. Dos 60 cães com sinais clínicos da doença, o exame direto foi positivo em 50% (n=30), duvidoso em 36,7% (n=22) e negativo com reatividade do linfonodo em 13,3% (n=8). Quando os linfonodos foram submetidos a reação de IFD observamos reação positiva em 93,3% (n=56) e reação negativa em 6,7% (n=4). Nossos resultados mostraram que a reação de IFD apresentou alta sensibilidade quando comparada a pesquisa direta do parasito pela coloração de Romanowsky. A reação de IFD pode ser um método útil para confirmar os casos duvidosos da doença, onde as formas amastigotas não são identificadas com facilidade.

Predicting structural models for silicon clusters

This article introduces an efficient method to generate structural models for medium-sized silicon clusters. Geometrical information obtained from previous investigations of small clusters is initially sorted and then introduced into our predictor algorithm in order to generate structural models for large clusters. The method predicts geometries whose binding energies are close (95%) to the corresponding value for the ground-state with very low computational cost. These predictions can be used as a very good initial guess for any global optimization algorithm. As a test case, information from clusters up to 14 atoms was used to predict good models for silicon clusters up to 20 atoms. We believe that the new algorithm may enhance the performance of most optimization methods whenever some previous information is available. (C) 2003 Wiley Periodicals, Inc.

TIME-OPTIMAL GEOMAGNETIC ATTITUDE MANEUVERS OF AN AXISYMMETRICAL SPINNING SATELLITE

A formulation used to determine the time-optimal geomagnetic attitude maneuvers subject to dynamic and geometric constraints is proposed in this paper. This was obtained by a direct search procedure based on a control function parametrization method, using linear programming to obtain numerical suboptimal solutions by linear perturbation. Due to its characteristics it can be used in small computers and to generate computer programs of general application. The dynamic modeling, the magnetic torque model and the suboptimal control procedure are presented. Simulation runs have verified the feasibility of the formulation thus derived and have shown a notable improvement in performance.

Comparison of Reactive Power Support in Distribution Networks Provided by Capacitor Banks and Distributed Generators

This paper presents a comparison of reactive power support in distribution networks provided by switched Capacitor Banks (CBs) and Distributed Generators (DGs). Regarding switched CBs, a Tabu Search metaheuristic algorithm is developed to determine their optimal operation with the objective of reducing the power losses in the lines on the system, while meeting network constraints. on the other hand, the optimal operation of DGs is analyzed through an evolutionary Multi-Objective (MO) programming approach. The objectives of such approach are the minimization of power losses and operation cost of the DGs. The comparison of the reactive power support provided by switched CBs and DGs is carried out using a modified IEEE 34 bus distribution test system.

Analysis of a sub-optimal scheme of drug dosage in the AIDS treatment

Here the results for CD4+T cells count and the viral load obtained from HIV sero-positive patients are compared with results from numerical simulations by computer. Also, the standard scheme of administration of drugs anti HIV (HAART schemes) which uses constant doses is compared with an alternative sub-optimal teatment scheme which uses variable drug dosage according to the evolution of a quantitative measure of the side effects. The quantitative analysis done here shows that it is possible to obtain, using the alternative scheme, the same performance of actual data but using variable dosage and having fewer side effects. Optimal control theory is used to solve and also to provide a prognosis related to the strategies for control of viraemia.

Integrated planning of electric power distribution networks

In this work, a heuristic model for integrated planning of primary distribution network and secondary distribution circuits is proposed. A Tabu Search (TS) algorithm is employed to solve the planning of primary distribution networks. Evolutionary Algorithms (EA) are used to solve the planning model of secondary networks. The planning integration of both networks is carried out by means a constructive heuristic taking into account a set of integration alternatives between these networks. These integration alternatives are treated in a hierarchical way. The planning of primary networks and secondary distribution circuits is carried out based on assessment of the effects of the alternative solutions in the expansion costs of both networks simultaneously. In order to evaluate this methodology, tests were performed for a real-life distribution system taking into account the primary and secondary networks.

Optimal switch allocation for automatic load transfer in distribution substations

This work proposes a methodology for optimized allocation of switches for automatic load transfer in distribution systems in order to improve the reliability indexes by restoring such systems which present voltage classes of 23 to 35 kV and radial topology. The automatic switches must be allocated on the system in order to transfer load remotely among the sources at the substations. The problem of switch allocation is formulated as nonlinear constrained mixed integer programming model subject to a set of economical and physical constraints. A dedicated Tabu Search (TS) algorithm is proposed to solve this model. The proposed methodology is tested for a large real-life distribution system. © 2011 IEEE.

Distributed generators as providers of reactive power support - A market approach

Traditionally, ancillary services are supplied by large conventional generators. However, with the huge penetration of distributed generators (DGs) as a result of the growing interest in satisfying energy requirements, and considering the benefits that they can bring along to the electrical system and to the environment, it appears reasonable to assume that ancillary services could also be provided by DGs in an economical and efficient way. In this paper, a settlement procedure for a reactive power market for DGs in distribution systems is proposed. Attention is directed to wind turbines connected to the network through synchronous generators with permanent magnets and doubly-fed induction generators. The generation uncertainty of this kind of DG is reduced by running a multi-objective optimization algorithm in multiple probabilistic scenarios through the Monte Carlo method and by representing the active power generated by the DGs through Markov models. The objectives to be minimized are the payments of the distribution system operator to the DGs for reactive power, the curtailment of transactions committed in an active power market previously settled, the losses in the lines of the network, and a voltage profile index. The proposed methodology was tested using a modified IEEE 37-bus distribution test system. © 1969-2012 IEEE.

Planejamento e projeto de circuitos secundários de distribuição de energia elétrica por meio de algoritmo busca tabu

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

Extração semi-automática do eixo de rodovia em imagens de média e alta resolução usando programação dinâmica

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

Divergência genética entre clones de eucalipto por caracteres biométricos e fisiológicos sob deficiência hídrica

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

Planejamento de redes de distribuição de energia elétrica de média e baixa tensão

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

Planejamento de sistemas de distribuição de energia elétrica de média tensão através de um algoritmo de busca dispersa

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

Otimização dinâmica de rotores com eixos em compósito

Pós-graduação em Engenharia Mecânica - FEG

Novo algoritimo genético para problemas de cobertura de conjuntos

The Set Covering Problem (SCP) plays an important role in Operational Research since it can be found as part of several real-world problems. In this work we report the use of a genetic algorithm to solve SCP. The algorithm starts with a population chosen by a randomized greedy algorithm. A new crossover operator and a new adaptive mutation operator were incorporated into the algorithm to intensify the search. Our algorithm was tested for a class of non-unicost SCP obtained from OR-Library without applying reduction techniques. The algorithms found good solutions in terms of quality and computational time. The results reveal that the proposed algorithm is able to find a high quality solution and is faster than recently published approaches algorithm is able to find a high quality solution and is faster than recently published approaches using the OR-Library.