Genetic parameters of total milk yield and factors describing the shape of lactation curve in dairy buffaloes

The objective of this study was to apply factor analysis to describe lactation curves in dairy buffaloes in order to estimate the phenotypic and genetic association between common latent factors and cumulative milk yield. A total of 31 257 monthly test-day milk yield records from buffaloes belonging to herds located in the state of São Paulo were used to estimate two common latent factors, which were then analysed in a multi-trait animal model for estimating genetic parameters. Estimates of (co)variance components for the two common latent factors and cumulated 270-d milk yield were obtained by Bayesian inference using a multiple trait animal model. Contemporary group, number of milkings per day (two levels) and age of buffalo cow at calving (linear and quadratic) as covariate were included in the model as fixed effects. The additive genetic, permanent environmental and residual effects were included as random effects. The first common latent factor (F1) was associated with persistency of lactation and the second common latent factor (F2) with the level of production in early lactation. Heritability estimates for Fl and F2 were 0.12 and 0.07, respectively. Genetic correlation estimates between El and F2 with cumulative milk yield were positive and moderate (0.63 and 0.52). Multivariate statistics employing factor analysis allowed the extraction of two variables (latent factors) that described the shape of the lactation curve. It is expected that the response to selection to increase lactation persistency is higher than the response obtained from selecting animals to increase lactation peak. Selection for higher total milk yield would result in a favourable correlated response to increase the level of production in early lactation and the lactation persistency.

Genetic parameter estimates for live weight and daily live weight gain obtained for Nellore bulls in a test station using different models

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

Genetic linkage map of chicken chromosome 1 from a Brazilian resource population

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

Evolutionary multi-move path-relinking for transmission network expansion planning

This paper presents the application of a new metaheuristic algorithm to solve the transmission expansion planning problem. A simple heuristic, using a relaxed network model associated with cost perturbation, is applied to generate a set of high quality initial solutions with different topologies. The population is evolved using a multi-move path-relinking with the objective of finding minimum investment cost for the transmission expansion planning problem employing the DC representation. The algorithm is tested on the southern Brazilian system, obtaining the optimal solution for the system with better performance than similar metaheuristics algorithms applied to the same problem. ©2010 IEEE.

Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach

The multi-relational Data Mining approach has emerged as alternative to the analysis of structured data, such as relational databases. Unlike traditional algorithms, the multi-relational proposals allow mining directly multiple tables, avoiding the costly join operations. In this paper, is presented a comparative study involving the traditional Patricia Mine algorithm and its corresponding multi-relational proposed, MR-Radix in order to evaluate the performance of two approaches for mining association rules are used for relational databases. This study presents two original contributions: the proposition of an algorithm multi-relational MR-Radix, which is efficient for use in relational databases, both in terms of execution time and in relation to memory usage and the presentation of the empirical approach multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE.

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.

An approach to implement data fusion techniques in wireless sensor networks using genetic machine learning algorithms

Wireless Sensor Networks (WSNs) can be used to monitor hazardous and inaccessible areas. In these situations, the power supply (e.g. battery) of each node cannot be easily replaced. One solution to deal with the limited capacity of current power supplies is to deploy a large number of sensor nodes, since the lifetime and dependability of the network will increase through cooperation among nodes. Applications on WSN may also have other concerns, such as meeting temporal deadlines on message transmissions and maximizing the quality of information. Data fusion is a well-known technique that can be useful for the enhancement of data quality and for the maximization of WSN lifetime. In this paper, we propose an approach that allows the implementation of parallel data fusion techniques in IEEE 802.15.4 networks. One of the main advantages of the proposed approach is that it enables a trade-off between different user-defined metrics through the use of a genetic machine learning algorithm. Simulations and field experiments performed in different communication scenarios highlight significant improvements when compared with, for instance, the Gur Game approach or the implementation of conventional periodic communication techniques over IEEE 802.15.4 networks. © 2013 Elsevier B.V. All rights reserved.

Genetic evaluation using multi-trait and random regression models in Simmental beef cattle

The Brazilian Association of Simmental and Simbrasil Cattle Farmers provided 29,510 records from 10,659 Simmental beef cattle; these were used to estimate (co)variance components and genetic parameters for weights in the growth trajectory, based on multi-trait (MTM) and random regression models (RRM). The (co)variance components and genetic parameters were estimated by restricted maximum likelihood. In the MTM analysis, the likelihood ratio test was used to determine the significance of random effects included in the model and to define the most appropriate model. All random effects were significant and included in the final model. In the RRM analysis, different adjustments of polynomial orders were compared for 5 different criteria to choose the best fit model. An RRM of third order for the direct additive genetic, direct permanent environmental, maternal additive genetic, and maternal permanent environment effects was sufficient to model variance structures in the growth trajectory of the animals. The (co)variance components were generally similar in MTM and RRM. Direct heritabilities of MTM were slightly lower than RRM and varied from 0.04 to 0.42 and 0.16 to 0.45, respectively. Additive direct correlations were mostly positive and of high magnitude, being highest at closest ages. Considering the results and that pre-adjustment of the weights to standard ages is not required, RRM is recommended for genetic evaluation of Simmental beef cattle in Brazil. ©FUNPEC-RP.

Genetic Parameter Estimates for Milk Yield and Lactation Length in Buffalo

The objective of this study was to estimate genetic parameters for milk yield at 244 days and lactation length in graded buffalo cows at the El Cangre Cattle Genetic Enterprise. Data were gathered from 2575 lactations, 1377 buffalo cows, 37 milking units and between 2002-2009 calving years. It was employed the Restricted Maximum Likelihood method (REML) for estimating (co) variance components with multi trait model. Average of milk yield at 244 days and lactation length were 864 kg and 240 days, respectively. Heritability was 0.15 for milk yield and 0.13 for lactation length. Genetic correlation between these traits was 0.63. It was concluded that it is necessary to intensify selection and to increase control of the information of the genetic herds to obtain high precision in the estimates and therefore, obtain bigger genetic progress in of this species in our country.

Estimates of genetic parameters for total milk yield over multiple ages in Brazilian Murrah buffaloes using different models

The objective of this study was to estimate variance components and genetic parameters for accumulated 305-day milk yield (MY305) over multiple ages, from 24 to 120 months of age, applying random regression (RRM), repeatability (REP) and multi-trait (MT) models. A total of 4472 lactation records from 1882 buffaloes of the Murrah breed were utilized. The contemporary group (herd-year-calving season) and number of milkings (two levels) were considered as fixed effects in all models. For REP and RRM, additive genetic, permanent environmental and residual effects were included as random effects. MT considered the same random effects as did REP and RRM with the exception of permanent environmental effect. Residual variances were modeled by a step function with 1, 4, and 6 classes. The heritabilities estimated with RRM increased with age, ranging from 0.19 to 0.34, and were slightly higher than that obtained with the REP model. For the MT model, heritability estimates ranged from 0.20 (37 months of age) to 0.32 (94 months of age). The genetic correlation estimates for MY305 obtained by RRM (L23.res4) and MT models were very similar, and varied from 0.77 to 0.99 and from 0.77 to 0.99, respectively. The rank correlation between breeding values for MY305 at different ages predicted by REP, MT, and RRM were high. It seems that a linear and quadratic Legendre polynomial to model the additive genetic and animal permanent environmental effects, respectively, may be sufficient to explain more parsimoniously the changes in MY305 genetic variation with age.

Accumulated productivity and its genetic association with reproductive traits in females Brahman

Objective. Assessment of genetic parameters for accumulative productivity trait (ACP) and genetic correlations with age at first calving (AFC), between calving interval of first and second parity (BCI1) and longevity (LONG). Materials and methods. 8584 Brahman female records were used with an animal model in multi-trait analysis with restricted maximum likelihood method, implemented using the WOMBAT software. The models considered the fixed effects of contemporary group, parity and weaning weight of first calf covariate, the only random effect was the genetic additive direct. Weaning weight (P240) was included to reduce the effect of selection on the estimation of variance components. Results. The heritability estimates were 0.3 +/- 0.04, 0.11 +/- 0.03, 0.07 +/- 0.03 and 0.24 +/- 0.04 for AFC, BCI1, LONG and ACP respectively. Correlations between ACP and the other features were moderate to high and favorable. Conclusions. ACP can be included in breeding programs for Brahman, and used as selection criteria for its moderate heritability and genetic correlation with reproductive traits.

Locating control points in aerial images with a multi-scale approach based on terrestrial image patches

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

Genetic and phenotypic parameters of carcass and organ traits of broiler chickens

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

Algorithms for UAS insertion in civil air space

One of the most interesting challenge of the next years will be the Air Space Systems automation. This process will involve different aspects as the Air Traffic Management, the Aircrafts and Airport Operations and the Guidance and Navigation Systems. The use of UAS (Uninhabited Aerial System) for civil mission will be one of the most important steps in this automation process. In civil air space, Air Traffic Controllers (ATC) manage the air traffic ensuring that a minimum separation between the controlled aircrafts is always provided. For this purpose ATCs use several operative avoidance techniques like holding patterns or rerouting. The use of UAS in these context will require the definition of strategies for a common management of piloted and piloted air traffic that allow the UAS to self separate. As a first employment in civil air space we consider a UAS surveillance mission that consists in departing from a ground base, taking pictures over a set of mission targets and coming back to the same ground base. During all mission a set of piloted aircrafts fly in the same airspace and thus the UAS has to self separate using the ATC avoidance as anticipated. We consider two objective, the first consists in the minimization of the air traffic impact over the mission, the second consists in the minimization of the impact of the mission over the air traffic. A particular version of the well known Travelling Salesman Problem (TSP) called Time-Dependant-TSP has been studied to deal with traffic problems in big urban areas. Its basic idea consists in a cost of the route between two clients depending on the period of the day in which it is crossed. Our thesis supports that such idea can be applied to the air traffic too using a convenient time horizon compatible with aircrafts operations. The cost of a UAS sub-route will depend on the air traffic that it will meet starting such route in a specific moment and consequently on the avoidance maneuver that it will use to avoid that conflict. The conflict avoidance is a topic that has been hardly developed in past years using different approaches. In this thesis we purpose a new approach based on the use of ATC operative techniques that makes it possible both to model the UAS problem using a TDTSP framework both to use an Air Traffic Management perspective. Starting from this kind of mission, the problem of the UAS insertion in civil air space is formalized as the UAS Routing Problem (URP). For this reason we introduce a new structure called Conflict Graph that makes it possible to model the avoidance maneuvers and to define the arc cost function of the departing time. Two Integer Linear Programming formulations of the problem are proposed. The first is based on a TDTSP formulation that, unfortunately, is weaker then the TSP formulation. Thus a new formulation based on a TSP variation that uses specific penalty to model the holdings is proposed. Different algorithms are presented: exact algorithms, simple heuristics used as Upper Bounds on the number of time steps used, and metaheuristic algorithms as Genetic Algorithm and Simulated Annealing. Finally an air traffic scenario has been simulated using real air traffic data in order to test our algorithms. Graphic Tools have been used to represent the Milano Linate air space and its air traffic during different days. Such data have been provided by ENAV S.p.A (Italian Agency for Air Navigation Services).

Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.