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.

Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA

This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over binary Galois Field (ECC- GF(2m)). The purpose of our coprocessor is to accelerate the scalar multiplication performed over elliptic curve points represented by affine coordinates in polynomial basis. Our method consists of using elliptic curve parameters over GF(2163) in accordance with international security requirements to implement a bit-parallel coprocessor on field-programmable gate-array (FPGA). Our coprocessor performs modular inversion by using a process based on the Stein's algorithm. Results are presented and compared to results of other related works. We conclude that our coprocessor is suitable for comparing with any other ECC-hardware proposal, since its speed is comparable to projective coordinate designs.

Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Sao Paulo State Research Foundation-FAPESP

Seasonal variation of biotic and abiotic parameters in parallel neotropical fishponds

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

Elementos estruturais relacionados com a mineralização do eoceno - oligoceno entre Mollebamba e Santo Domingo região de Apurimac, sul do Peru

Pós-graduação em Geociências e Meio Ambiente - IGCE

Recovery Tests of an Hybrid Current Limiter Composed of a SFCL in Parallel to an Air-Core Power Reactor

The resistive-type superconducting fault current limiters (RSFCL) prototypes using YBCO-coated conductors have shown current limitation for medium voltage class applications for acting time up to 80 ms. By connecting an air-core reactor in parallel with the RSFCL, thus making an hybrid current limiter, one can extend the acting time for up to 1 s. In this work, we report the performance of a hybrid current limiter subjected to an AC peak fault current of 2 kA during 1 s for which within the first 80 ms the SFCL limits the current concurrently with the air-core reactor, and for the remaining 920 ms, only the air-core reactor limits the current. In order to evaluate the actual conditions for subsequent reconnection of RSFCL to the power grid, the hybrid fault current limiter was tested varying the time interval for recovery from 900 ms and 1.2 s, followed again by the concurrent operation of the hybrid limiter during 1 s (SFCL during 80 ms). From this evaluation test, the recovery time can be measured and compared using the voltage peak generated in superconducting module from the first and second fault test. The recovery time was also determined through the pulsed current method (PCM) on short-length sample test. The results showed that the fault current was limited from 1.9 kA down to 514 A after 1 cycle of 60 Hz frequency, with recovery time lower than 1.2 s for two subsequent fault current tests.

Hybrid methods for lot sizing on parallel machines

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

Ultra-precision face grinding with constant pressure, lapping kinematics, and SiC grinding wheels dressed with overlap factor

Several machining processes have been created and improved in order to achieve the best results ever accomplished in hard and difficult to machine materials. Some of these abrasive manufacturing processes emerging on the science frontier can be defined as ultra-precision grinding. For finishing flat surfaces, researchers have been putting together the main advantages of traditional abrasive processes such as face grinding with constant pressure, fixed abrasives for two-body removal mechanism, total contact of the part with the tool, and lapping kinematics as well as some specific operations to keep grinding wheel sharpness and form. In the present work, both U d-lap grinding process and its machine tool were studied aiming nanometric finishing on flat metallic surfaces. Such hypothesis was investigated on AISI 420 stainless steel workpieces U d-lap ground with different values of overlap factor on dressing (Ud=1, 3, and 5) and grit sizes of conventional grinding wheels (silicon carbide (SiC)=#800, #600, and #300) applying a new machine tool especially designed and built for such finishing. The best results, obtained after 10 min of machining, were average surface roughness (Ra) of 1.92 nm, 1.19-μm flatness deviation of 25.4-mm-diameter workpieces, and mirrored surface finishing. Given the surface quality achieved, the U d-lap grinding process can be included among the ultra-precision abrasive processes and, depending on the application, the chaining steps of grinding, lapping, and polishing can be replaced by the proposed abrasive process.

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