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.

Improvements in the sensibility of MSA-GA tool using COFFEE objective function

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

Semiautomatic object-space road extraction combining a stereoscopic image pair and a TIN-Based DTM

In this letter, a semiautomatic method for road extraction in object space is proposed that combines a stereoscopic pair of low-resolution aerial images with a digital terrain model (DTM) structured as a triangulated irregular network (TIN). First, we formulate an objective function in the object space to allow the modeling of roads in 3-D. In this model, the TIN-based DTM allows the search for the optimal polyline to be restricted along a narrow band that is overlaid upon it. Finally, the optimal polyline for each road is obtained by optimizing the objective function using the dynamic programming optimization algorithm. A few seed points need to be supplied by an operator. To evaluate the performance of the proposed method, a set of experiments was designed using two stereoscopic pairs of low-resolution aerial images and a TIN-based DTM with an average resolution of 1 m. The experimental results showed that the proposed method worked properly, even when faced with anomalies along roads, such as obstructions caused by shadows and trees.

Optimal reactive power dispatch using stochastic chance-constrained programming

Deterministic Optimal Reactive Power Dispatch problem has been extensively studied, such that the demand power and the availability of shunt reactive power compensators are known and fixed. Give this background, a two-stage stochastic optimization model is first formulated under the presumption that the load demand can be modeled as specified random parameters. A second stochastic chance-constrained model is presented considering uncertainty on the demand and the equivalent availability of shunt reactive power compensators. Simulations on six-bus and 30-bus test systems are used to illustrate the validity and essential features of the proposed models. This simulations shows that the proposed models can prevent to the power system operator about of the deficit of reactive power in the power system and suggest that shunt reactive sourses must be dispatched against the unavailability of any reactive source. © 2012 IEEE.

Stochastic simulation of time-series models combined with geostatistics to predict water-table scenarios in a Guarani Aquifer System outcrop area, Brazil

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

Simulation and economic analysis of bovine sex selection

A simulation model implemented in the programming software Delphi XE® was applied to evaluate sex selection in bovine. The hypothesis under investigation was that a dynamic model with stochastic and deterministic elements could detect the sexed semen technique to minimize pregnancy cost and to determine the adequate number of recipients required for in vivo (ET) and in vitro embryo production (IVP) in the proposed scenarios. Sex selection was compared through semen sexed using flow cytometry (C1) and density gradient centrifugation techniques (C2) in ET and IVP. Sensibility analyses were used to identify the adequate number of recipients for each scenario. This number was reinserted into the model to determine the biological and financial values that maximized ET and IVP using sexed semen (C1M and C2M). New scenarios showed that the density gradient technique minimized pregnancy cost based on the proposed scenarios. In addition, the adequate number of recipients (ET - C1M - 115 and C2M - 105)/(IVP - C1M - 145 and C2M - 140) per donor used was determined to minimize the pregnancy cost in all scenarios.

Transaction scheduling using dynamic conflict avoidance

Software transaction memory (STM) systems have been used as an approach to improve performance, by allowing the concurrent execution of atomic blocks. However, under high-contention workloads, STM-based systems can considerably degrade performance, as transaction conflict rate increases. Contention management policies have been used as a way to select which transaction to abort when a conflict occurs. In general, contention managers are not capable of avoiding conflicts, as they can only select which transaction to abort and the moment it should restart. Since contention managers act only after a conflict is detected, it becomes harder to effectively increase transaction throughput. More proactive approaches have emerged, aiming at predicting when a transaction is likely to abort, postponing its execution. Nevertheless, most of the proposed proactive techniques are limited, as they do not replace the doomed transaction by another or, when they do, they rely on the operating system for that, having little or no control on which transaction to run. This article proposes LUTS, a lightweight user-level transaction scheduler. Unlike other techniques, LUTS provides the means for selecting another transaction to run in parallel, thus improving system throughput. We discuss LUTS design and propose a dynamic conflict-avoidance heuristic built around its scheduling capabilities. Experimental results, conducted with the STAMP and STMBench7 benchmark suites, running on TinySTM and SwissTM, show how our conflict-avoidance heuristic can effectively improve STM performance on high contention applications. © 2012 Springer Science+Business Media, LLC.

A Multi-Stage Stochastic Non-Linear Model for Reactive Power Planning Under Contingencies

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

Dynamic behavior, stochasticity and enviromental heterogeneity in Tribolium castaneum

In this study we analyzed the influence of demographic parameters on the population dynamics of Tribolium castaneum, combining empiricism and population theory to analyze the different effects of environmental heterogeneity, by employing Ricker models, designed to study a two-patch system taking into account deterministic and stochastic analysis. Results were expressed by bifurcation diagrams and stochastic simulations. Dynamic equilibrium was widely investigated with results suggesting specific parametric spaces in response to environmental heterogeneity and migration. Population equilibrium patterns, synchrony and persistence in T. castaneum were discussed