Improvements in the score matrix calculation method using parallel score estimating algorithm

The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.

Multiobjective Genetic Algorithm applied to dengue control

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

H-infinity control design for time-delay linear systems: a rational transfer function based approach

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

LMI-based algorithm for strictly positive real systems with static output feedback

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

Fault section estimation in electric power systems using an optimization immune algorithm

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

ALGORITHM FOR PROBABILISTIC ANALYSIS of DISTRIBUTION SYSTEMS WITH DISTRIBUTED GENERATION

In this paper an efficient algorithm for probabilistic analysis of unbalanced three-phase weakly-meshed distribution systems is presented. This algorithm uses the technique of Two-Point Estimate Method for calculating the probabilistic behavior of the system random variables. Additionally, the deterministic analysis of the state variables is performed by means of a Compensation-Based Radial Load Flow (CBRLF). Such load flow efficiently exploits the topological characteristics of the network. To deal with distributed generation, a strategy to incorporate a simplified model of a generator in the CBRLF is proposed. Thus, depending on the type of control and generator operation conditions, the node with distributed generation can be modeled either as a PV or PQ node. To validate the efficiency of the proposed algorithm, the IEEE 37 bus test system is used. The probabilistic results are compared with those obtained using the Monte Carlo method.

Design of a control system using linear matrix inequalities for the active vibration control of a plate

The study of algorithms for active vibration control in smart structures is an area of interest, mainly due to the demand for better performance of mechanical systems, such as aircraft and aerospace structures. Smart structures, formed using actuators and sensors, can improve the dynamic performance with the application of several kinds of controllers. This article describes the application of a technique based on linear matrix inequalities (LMI) to design an active control system. The positioning of the actuators, the design of a robust state feedback controller and the design of an observer are all achieved using LMI. The following are considered in the controller design: limited actuator input, bounded output (energy) and robustness to parametric uncertainties. Active vibration control of a flat plate is chosen as an application example. The model is identified using experimental data by an eigensystem realization algorithm (ERA) and the placement of the two piezoelectric actuators and single sensor is determined using a finite element model (FEM) and an optimization procedure. A robust controller for active damping is designed using an LMI framework, and a reduced model with observation and control spillover effects is implemented using a computer. The simulation results demonstrate the efficacy of the approach, and show that the control system increases the damping in some of the modes.

Observer-based state-feedback versus H-infinity output feedback control solved by LMI approach for applications in smart structures

This paper aims with the use of linear matrix inequalities approach (LMIs) for application in active vibration control problems in smart strutures. A robust controller for active damping in a panel was designed with piezoelectrical actuators in optimal locations for illustration of the main proposal. It was considered, in the simulations of the closed-loop, a model identified by eigensystem realization algorithm (ERA) and reduced by modal decomposition. We tested two differents techniques to solve the problem. The first one uses LMI approach by state-feedback based in an observer design, considering several simultaneous constraints as: a decay rate, limited input on the actuators, bounded output peak (output energy) and robustness to parametic uncertainties. The results demonstrated the vibration attenuation in the structure by controlling only the first modes and the increased damping in the bandwidth of interest. However, it is possible to occur spillover effects, because the design has not been done considering the dynamic uncertainties related with high frequencies modes. In this sense, the second technique uses the classical H. output feedback control, also solved by LMI approach, considering robustness to residual dynamic to overcome the problem found in the first test. The results are compared and discussed. The responses shown the robust performance of the system and the good reduction of the vibration level, without increase mass.

System identification and active vibration control of a flexible structure

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

Application of wavelets to the evaluation of phantom images for mammography quality control

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

An algorithm for arranging response surface designs in small blocks

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.

Carbon nuclear magnetic resonance spectroscopic fingerprinting of commercial gasoline: Pattern-recognition analyses for screening quality control purposes

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

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.