Conceptos y métodos de cálculo de la relación de precios del intercambio exterior = The concept of terms of trade and methods of computation

Incluye Bibliografía

Genetic associations among average annual productivity, growth traits, and stayability: A parallel between Nelore and composite beef cattle

This study was conducted to examine the relationship among average annual productivity of the cow (PRODAM), yearling weight (YW), postweaning BW gain (PWG), scrotal circumference (SC), and stayability in the herd for at least 6 yr (STAY) of Nelore and composite beef cattle. Measurements were taken on animals born between 1980 and 2010 on 70 farms located in 7 Brazilian states. Estimates of heritability and genetic and environmental correlations were obtained by Bayesian approach with 5-trait animal models. Genetic trends were estimated by regressing means of estimated breeding values by year of birth. The heritability estimates were between 0.14 and 0.47. Estimates of genetic correlation among female traits (PRODAM and STAY) and growth traits ranged from-0.02 to 0.30. Estimates of genetic correlations ranged from 0.23 to 0.94 among growth traits indicating that selection for these traits could be successful in tropical breeding programs. Genetic correlations among all traits were favorable and simultaneous selection for growth, productivity, and stayability is therefore possible. Genetic correlation between PRODAM and STAY was 0.99 and 0.85 for Nelore and composite cattle, respectively. Therefore, PRODAM and STAY might be influenced by many of the same genes. The inclusion of PRODAM instead of STAY as a selection criterion seems to be more advantageous for tropical breeding programs because the generation interval required to obtain accurate estimates of genetic merit for PRODAM is shorter. Average annual genetic changes were greater in Nelore than in composite cattle. This was not unexpected because the breeding program of composite cattle included a large number of farms, different production environments, and genetic level of the herds and breeds. Thus, the selection process has become more difficult in this population. © 2013 American Society of Animal Science. All rights reserved.

The Phylogeographic History of the New World Screwworm Fly, Inferred by Approximate Bayesian Computation Analysis

Insect pest phylogeography might be shaped both by biogeographic events and by human influence. Here, we conducted an approximate Bayesian computation (ABC) analysis to investigate the phylogeography of the New World screwworm fly, Cochliomyia hominivorax, with the aim of understanding its population history and its order and time of divergence. Our ABC analysis supports that populations spread from North to South in the Americas, in at least two different moments. The first split occurred between the North/Central American and South American populations in the end of the Last Glacial Maximum (15,300-19,000 YBP). The second split occurred between the North and South Amazonian populations in the transition between the Pleistocene and the Holocene eras (9,100-11,000 YBP). The species also experienced population expansion. Phylogenetic analysis likewise suggests this north to south colonization and Maxent models suggest an increase in the number of suitable areas in South America from the past to present. We found that the phylogeographic patterns observed in C. hominivorax cannot be explained only by climatic oscillations and can be connected to host population histories. Interestingly we found these patterns are very coincident with general patterns of ancient human movements in the Americas, suggesting that humans might have played a crucial role in shaping the distribution and population structure of this insect pest. This work presents the first hypothesis test regarding the processes that shaped the current phylogeographic structure of C. hominivorax and represents an alternate perspective on investigating the problem of insect pests. © 2013 Fresia et al.

Técnicas de paralelização em GPGPU aplicadas em algoritmo para remoção de ruído multiplicativo

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

Integral transform solution for the forced convection of herschel-bulkley fluids in circular tubes and parallel-plates ducts

ABSTRACT: The thermal entry region in laminar forced convection of Herschel-Bulkley fluids is solved analytically through the integral transform technique, for both circular and parallel-plates ducts, which are maintained at a prescribed wall temperature or at a prescribed wall heat flux. The local Nusselt numbers are obtained with high accuracy in both developing and fully-developed thermal regions, and critical comparisons with previously reported numerical results are performed.

Wavelength assignment using a hybrid evolutionary computation to reduce cross-phase modulation

In this paper, we propose a hybrid methodology based on Graph-Coloring and Genetic Algorithm (GA) to solve the Wavelength Assignment (WA) problem in optical networks, impaired by physical layer effects. Our proposal was developed for a static scenario where the physical topology and traffic matrix are known a priori. First, we used fixed shortest-path routing to attend demand requests over the physical topology and the graph-coloring algorithm to minimize the number of necessary wavelengths. Then, we applied the genetic algorithm to solve WA. The GA finds the wavelength activation order on the wavelengths grid with the aim of reducing the Cross-Phase Modulation (XPM) effect; the variance due to the XPM was used as a function of fitness to evaluate the feasibility of the selected WA solution. Its performance is compared with the First-Fit algorithm in two different scenarios, and has shown a reduction in blocking probability up to 37.14% when considered both XPM and residual dispersion effects and up to 71.42% when only considered XPM effect. Moreover, it was possible to reduce by 57.14% the number of wavelengths.

DNA for nano-bio scale computation of chemical formalisms using Higher Order Logic (HOL) and analysis using an interdisciplinary approach

Bio-molecular computing, 'computations performed by bio-molecules', is already challenging traditional approaches to computation both theoretically and technologically. Often placed within the wider context of ´bio-inspired' or 'natural' or even 'unconventional' computing, the study of natural and artificial molecular computations is adding to our understanding of biology, physical sciences and computer science well beyond the framework of existing design and implementation paradigms. In this introduction, We wish to outline the current scope of the field and assemble some basic arguments that, bio-molecular computation is of central importance to computer science, physical sciences and biology using HOL - Higher Order Logic. HOL is used as the computational tool in our R&D work. DNA was analyzed as a chemical computing engine, in our effort to develop novel formalisms to understand the molecular scale bio-chemical computing behavior using HOL. In our view, our focus is one of the pioneering efforts in this promising domain of nano-bio scale chemical information processing dynamics.

Stress analysis in oral obturator prostheses over parallel and tilted implants: photoelastic imaging

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

Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines

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

Metabolic profiling by ultra-performance liquid chromatography-mass spectrometry and parallel factor analysis for the determination of disease biomarkers in Eucalyptus

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

Image Re-Ranking Acceleration on GPUs

Huge image collections are becoming available lately. In this scenario, the use of Content-Based Image Retrieval (CBIR) systems has emerged as a promising approach to support image searches. The objective of CBIR systems is to retrieve the most similar images in a collection, given a query image, by taking into account image visual properties such as texture, color, and shape. In these systems, the effectiveness of the retrieval process depends heavily on the accuracy of ranking approaches. Recently, re-ranking approaches have been proposed to improve the effectiveness of CBIR systems by taking into account the relationships among images. The re-ranking approaches consider the relationships among all images in a given dataset. These approaches typically demands a huge amount of computational power, which hampers its use in practical situations. On the other hand, these methods can be massively parallelized. In this paper, we propose to speedup the computation of the RL-Sim algorithm, a recently proposed image re-ranking approach, by using the computational power of Graphics Processing Units (GPU). GPUs are emerging as relatively inexpensive parallel processors that are becoming available on a wide range of computer systems. We address the image re-ranking performance challenges by proposing a parallel solution designed to fit the computational model of GPUs. We conducted an experimental evaluation considering different implementations and devices. Experimental results demonstrate that significant performance gains can be obtained. Our approach achieves speedups of 7x from serial implementation considering the overall algorithm and up to 36x on its core steps.

An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

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

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.