Genetic associations between carcass traits measured by real-time ultrasound and scrotal circumference and growth traits in Nelore cattle

The aim of the present study was to evaluate the genetic correlations among real-time ultrasound carcass, BW, and scrotal circumference (SC) traits in Nelore cattle. Carcass traits, measured by real-time ultrasound of the live animal, were recorded from 2002 to 2004 on 10 farms across 6 Brazilian states on 2,590 males and females ranging in age from 450 to 599 d. Ultrasound records of LM area (LMA) and backfat thickness (BF) were obtained from cross-sectional images between the 12th and 13th ribs, and rump fat thickness (RF) was measured between the hook and pin bones over the junction between gluteus medius and biceps femoris muscles. Also, BW (n = 22,778) and SC ( n = 5,695) were recorded on animals born between 1998 and 2003. The BW traits were 120, 210, 365, 450, and 550-d standardized BW (W120, W210, W365, W450, and W550), plus BW (WS) and hip height (HH) on the ultrasound scanning date. The SC traits were 365-, 450-, and 550-d standardized SC (SC365, SC450, and SC550). For the BW and SC traits, the database used was from the Nelore Breeding Program-Nelore Brazil. The genetic parameters were estimated with multivariate animal models and REML. Estimated genetic correlations between LMA and other traits were 0.06 (BF), -0.04 ( RF), 0.05 (HH), 0.58 (WS), 0.53 (W120), 0.62 (W210), 0.67 (W365), 0.64 ( W450 and W550), 0.28 (SC365), 0.24 (SC450), and 0.00 ( SC550). Estimated genetic correlations between BF and with other traits were 0.74 ( RF), -0.32 (HH), 0.19 (WS), -0.03 (W120), -0.10 (W210), 0.04 (W365), 0.01 (W450), 0.06 ( W550), 0.17 (SC365 and SC450), and -0.19 (SC550). Estimated genetic correlations between RF and other traits were -0.41 (HH), -0.09 (WS), -0.13 ( W120), -0.09 ( W210), -0.01 ( W365), 0.02 (W450), 0.03 (W550), 0.05 ( SC365), 0.11 ( SC450), and -0.18 (SC550). These estimates indicate that selection for carcass traits measured by real-time ultrasound should not cause antagonism in the genetic improvement of SC and BW traits. Also, selection to increase HH might decrease subcutaneous fat as correlated response. Therefore, to obtain animals suited to specific tropical production systems, carcass, BW, and SC traits should be considered in selection programs.

A SON Enhanced Algorithm for Observed Time Differences Based Geolocation in Real 3G Networks

Conferência - 16th International Symposium on Wireless Personal Multimedia Communications (WPMC)- Jun 24-27, 2013

A 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources

We present a 12*(1+|R|/(4m))-speed algorithm for scheduling constrained-deadline sporadic real-time tasks on a multiprocessor comprising m processors where a task may request one of |R| sequentially-reusable shared resources.

An efficient algorithm to perform multiple testing in epistasis screening

Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-wide epistasis search would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MBMDR-3.0.3. We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn’s disease. Results: In the case of a binary (affected/unaffected) trait, the parallel workflow of MBMDR-3.0.3 analyzes all gene-gene interactions with a dataset of 100,000 SNPs typed on 1000 individuals within 4 days and 9 hours, using 999 permutations of the trait to assess statistical significance, on a cluster composed of 10 blades, containing each four Quad-Core AMD Opteron(tm) Processor 2352 2.1 GHz. In the case of a continuous trait, a similar run takes 9 days. Our program found 14 SNP-SNP interactions with a multiple-testing corrected p-value of less than 0.05 on real-life Crohn’s disease (CD) data. Conclusions: Our software is the first implementation of the MB-MDR methodology able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory, while adequately controlling the type I error rates. A new implementation to reach genome-wide epistasis screening is under construction. In the context of Crohn’s disease, MBMDR-3.0.3 could identify epistasis involving regions that are well known in the field and could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype higher-order associations.

Real-Time Automatic Object Classification and Tracking using Genetic Programming and NVIDIA R CUDA TM

Genetic Programming (GP) is a widely used methodology for solving various computational problems. GP's problem solving ability is usually hindered by its long execution times. In this thesis, GP is applied toward real-time computer vision. In particular, object classification and tracking using a parallel GP system is discussed. First, a study of suitable GP languages for object classification is presented. Two main GP approaches for visual pattern classification, namely the block-classifiers and the pixel-classifiers, were studied. Results showed that the pixel-classifiers generally performed better. Using these results, a suitable language was selected for the real-time implementation. Synthetic video data was used in the experiments. The goal of the experiments was to evolve a unique classifier for each texture pattern that existed in the video. The experiments revealed that the system was capable of correctly tracking the textures in the video. The performance of the system was on-par with real-time requirements.

Investigation into the performance of an algorithm for deriving concise descriptions of optic flow fields for real-time control

This paper describes a region-based algorithm for deriving a concise description of a first order optical flow field. The algorithm described achieves performance improvements over existing algorithms without compromising the accuracy of the flow field values calculated. These improvements are brought about by not computing the entire flow field between two consecutive images, but by considering only the flow vectors of a selected subset of the images. The algorithm is presented in the context of a project to balance a bipedal robot using visual information.

An efficient flux difference splitting algorithm for unsteady duct flows of a real gas

A numerical scheme is presented for the solution of the Euler equations of compressible flow of a real gas in a single spatial coordinate. This includes flow in a duct of variable cross-section, as well as flow with slab, cylindrical or spherical symmetry, as well as the case of an ideal gas, and can be useful when testing codes for the two-dimensional equations governing compressible flow of a real gas. The resulting scheme requires an average of the flow variables across the interface between cells, and this average is chosen to be the arithmetic mean for computational efficiency, which is in contrast to the usual “square root” averages found in this type of scheme. The scheme is applied with success to five problems with either slab or cylindrical symmetry and for a number of equations of state. The results compare favourably with the results from other schemes.

Genetic associations between carcass traits measured by real-time ultrasound and scrotal circumference and growth traits in Nelore cattle

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

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

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Distribution network reconfiguration using an efficient evolutionary algorithm

Network reconfiguration is an important tool to optimize the operating conditions of a distribution system. This is accomplished modifying the network structure of distribution feeders by changing the open/close status of sectionalizing switches. This not only reduces the power losses, but also relieves the overloading of the network components. Network reconfiguration belongs to a complex family of problems because of their combinatorial nature and multiple constraints. This paper proposes a solution to this problem, using a specialized evolutionary algorithm, with a novel codification, and a brand new way of implement the genetic operators considering the problem characteristics. The algorithm is presented and tested in a real distribution system, showing excellent results and computational efficiency. © 2007 IEEE.

A multi-objective adaptive immune algorithm for multi-application NoC mapping

Current SoC design trends are characterized by the integration of larger amount of IPs targeting a wide range of application fields. Such multi-application systems are constrained by a set of requirements. In such scenario network-on-chips (NoC) are becoming more important as the on-chip communication structure. Designing an optimal NoC for satisfying the requirements of each individual application requires the specification of a large set of configuration parameters leading to a wide solution space. It has been shown that IP mapping is one of the most critical parameters in NoC design, strongly influencing the SoC performance. IP mapping has been solved for single application systems using single and multi-objective optimization algorithms. In this paper we propose the use of a multi-objective adaptive immune algorithm (M(2)AIA), an evolutionary approach to solve the multi-application NoC mapping problem. Latency and power consumption were adopted as the target multi-objective functions. To compare the efficiency of our approach, our results are compared with those of the genetic and branch and bound multi-objective mapping algorithms. We tested 11 well-known benchmarks, including random and real applications, and combines up to 8 applications at the same SoC. The experimental results showed that the M(2)AIA decreases in average the power consumption and the latency 27.3 and 42.1 % compared to the branch and bound approach and 29.3 and 36.1 % over the genetic approach.

Genetic diversity among alfalfa genotypes (Medicago sativa L.) of non-dormant cultivars using SSR markers and agronomic traits

The aim of this study was to assess genetic diversity among 40 alfalfa (Medicago sativa L.) genotypes of different non-dormant (FD=8) cultivars. Biomass yield, regrowth speed and reaction to spring black stem, lepto leaf spot, and rust were evaluated. Analyses of variances were performed using a mixed model to examine the agronomic variation among individuals. A principal component analysis on standardized agronomic data was performed. Agronomic data were also used to calculate Gower's distance and UPGMA algorithm. For the molecular analysis, six SSR markers were evaluated and 84 alleles were identified. The genetic distance was estimated using standard Nei's distance. Average standard genetic diversity was 0.843, indicating a high degree of variability among genotypes. Finally, a generalized procrustes analysis was performed to calculate the correlation between molecular and agronomic distance, indicating a 65.4% of consensus. This value is likely related to the low number of individuals included in the study, which might have underestimated the real phenotypic variability among genotypes. Despite the low number of individuals and SSR markers analyzed, this study provides a baseline for future diversity studies to identify genetically distant alfalfa individuals or cultivars.

Grouping genetic operators for the delineation of functional areas based on spatial interaction

The delineation of functional economic areas, or market areas, is a problem of high practical relevance, since the delineation of functional sets such as economic areas in the US, Travel-to-Work Areas in the United Kingdom, and their counterparts in other OECD countries are the basis of many statistical operations and policy making decisions at local level. This is a combinatorial optimisation problem defined as the partition of a given set of indivisible spatial units (covering a territory) into regions characterised by being (a) self-contained and (b) cohesive, in terms of spatial interaction data (flows, relationships). Usually, each region must reach a minimum size and self-containment level, and must be continuous. Although these optimisation problems have been typically solved through greedy methods, a recent strand of the literature in this field has been concerned with the use of evolutionary algorithms with ad hoc operators. Although these algorithms have proved to be successful in improving the results of some of the more widely applied official procedures, they are so time consuming that cannot be applied directly to solve real-world problems. In this paper we propose a new set of group-based mutation operators, featuring general operations over disjoint groups, tailored to ensure that all the constraints are respected during the operation to improve efficiency. A comparative analysis of our results with those from previous approaches shows that the proposed algorithm systematically improves them in terms of both quality and processing time, something of crucial relevance since it allows dealing with most large, real-world problems in reasonable time.