Alternatives to linear analysis of energy balance data from lactating dairy cows

The current energy requirements system used in the United Kingdom for lactating dairy cows utilizes key parameters such as metabolizable energy intake (MEI) at maintenance (MEm), the efficiency of utilization of MEI for 1) maintenance, 2) milk production (k(l)), 3) growth (k(g)), and the efficiency of utilization of body stores for milk production (k(t)). Traditionally, these have been determined using linear regression methods to analyze energy balance data from calorimetry experiments. Many studies have highlighted a number of concerns over current energy feeding systems particularly in relation to these key parameters, and the linear models used for analyzing. Therefore, a database containing 652 dairy cow observations was assembled from calorimetry studies in the United Kingdom. Five functions for analyzing energy balance data were considered: straight line, two diminishing returns functions, (the Mitscherlich and the rectangular hyperbola), and two sigmoidal functions (the logistic and the Gompertz). Meta-analysis of the data was conducted to estimate k(g) and k(t). Values of 0.83 to 0.86 and 0.66 to 0.69 were obtained for k(g) and k(t) using all the functions (with standard errors of 0.028 and 0.027), respectively, which were considerably different from previous reports of 0.60 to 0.75 for k(g) and 0.82 to 0.84 for k(t). Using the estimated values of k(g) and k(t), the data were corrected to allow for body tissue changes. Based on the definition of k(l) as the derivative of the ratio of milk energy derived from MEI to MEI directed towards milk production, MEm and k(l) were determined. Meta-analysis of the pooled data showed that the average k(l) ranged from 0.50 to 0.58 and MEm ranged between 0.34 and 0.64 MJ/kg of BW0.75 per day. Although the constrained Mitscherlich fitted the data as good as the straight line, more observations at high energy intakes (above 2.4 MJ/kg of BW0.75 per day) are required to determine conclusively whether milk energy is related to MEI linearly or not.

Effect of energy and protein supplementation on phosphorus utilization in lactating dairy cows

Two experiments were undertaken in which grass silage was used in conjunction with a series of different concentrate types designed to examine the effect of carbohydrate source, protein level and degradability on total dietary phosphorus (P) utilization with emphasis on P pollution. Twelve Holstein-Friesian dairy cows in early to mid-lactation were used in an incomplete changeover design with four periods consisting of 4 weeks each. Phosphorus intake ranged from 54 to 80 g/day and faecal P represented the principal route by which ingested P was disposed of by cows, with insignificant amounts being voided in urine. A positive linear relationship between faecal P and P intake was established. In Experiment 1, P utilization was affected by dietary carbohydrate type, with an associated output of 3.3 g faecal P/g milk P produced for all treatments except those utilizing low degradable starch and low protein supplements, where a mean value of 2.8 g faecal P/g milk P was observed. In Experiment 2, where two protein levels and three protein degradabilities were examined, the efficiency of P utilization for milk P production was not affected by either level or degradability of crude protein (CP) but a significant reduction in faecal P excretion due to lower protein and P intake was observed. In general, P utilization in Experiment 2 was substantially improved compared to the Experiment 1, with an associated output of 1.8 g faecal P/g milk P produced. The improved utilization of P in Experiment 2 could be due to lower P content of the diets offered and higher dry matter (DM) intake. For dairy cows weighing 600 kg, consuming 17-18 kg DM/day and producing about 25 kg milk, P excretion in faeces and hence P pollution to the environment might be minimized without compromising lactational performance by formulating diets to supply about 68 g P/day, which is close to recent published recommended requirements for P.

Modeling small-scale dairy farms in central Mexico using multi-criteria programming

Milk supply from Mexican dairy farms does not meet demand and small-scale farms can contribute toward closing the gap. Two multi-criteria programming techniques, goal programming and compromise programming, were used in a study of small-scale dairy farms in central Mexico. To build the goal and compromise programming models, 4 ordinary linear programming models were also developed, which had objective functions to maximize metabolizable energy for milk production, to maximize margin of income over feed costs, to maximize metabolizable protein for milk production, and to minimize purchased feedstuffs. Neither multicriteria approach was significantly better than the other; however, by applying both models it was possible to perform a more comprehensive analysis of these small-scale dairy systems. The multi-criteria programming models affirm findings from previous work and suggest that a forage strategy based on alfalfa, rye-grass, and corn silage would meet nutrient requirements of the herd. Both models suggested that there is an economic advantage in rescheduling the calving season to the second and third calendar quarters to better synchronize higher demand for nutrients with the period of high forage availability.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Pearl millet utilization in ccommercial laying hen diets formulated on a total or digestible amino acid basis

An experiment was carried out to evaluate the effect of replacing corn with pearl millet in commercial layer diets, formulated according to the minimal requirements for total and digestible amino acids. Two hundred and forty Lohmann LSL laying hens with 25 weeks of age were distributed in a completely randomized experimental design according to a 2 x 5 factorial arrangement with 3 replicates of 8 birds. Feed was formulated on two amino acid basis (total or digestible) according to Rostagno et al. (2000) and there were five pearl millet inclusion levels (0%, 25%, 50%, 75%, and 100%). Performance and egg quality were evaluated during five periods of 21 days.At the end of each period, feed intake, egg production, egg weight and feed conversion were evaluated. In the last three days of each period, the following egg quality parameters were evaluated: Haugh Unit, yolk pigmentation index, egg specific weight, shell percentage and shell thickness. Digestible amino acid requirements resulted in decreased feed intake (p<0.01) and increased production costs per mass of eggs (kg) or per dozen eggs (p<0.01) compared to total amino acid requirements. There was a linear reduction in feed intake, egg production, egg weight and yolk pigmentation index with increasing inclusion levels of pearl millet. Therefore, increasing levels of replacement of corn by pearl millet affected bird performance negatively. Besides, production costs were higher with increasing pearl millet levels.

Utilização de modelos de programação não-linear para sistematização de terras para irrigação em áreas regulares

Objetivou-se com este trabalho, desenvolver modelos de programação não-linear para sistematização de terras, aplicáveis para áreas com formato regular e que minimizem a movimentação de terra, utilizando o software GAMS para o cálculo. Esses modelos foram comparados com o Método dos Quadrados Mínimos Generalizado, desenvolvido por Scaloppi & Willardson (1986), sendo o parâmetro de avaliação o volume de terra movimentado. Concluiu-se que, ambos os modelos de programação não-linear desenvolvidos nesta pesquisa mostraram-se adequados para aplicação em áreas regulares e forneceram menores valores de movimentação de terra quando comparados com o método dos quadrados mínimos.

Modelo de programação linear para seleção de pulverizadores agrícolas de barras

A seleção de pulverizadores agrícolas que se adaptem às necessidades da propriedade, é um processo trabalhoso, sendo uma das etapas mais importantes dentro do processo produtivo. O objetivo do presente trabalho foi o de desenvolver e utilizar um modelo de programação linear para auxiliar na seleção de pulverizadores agrícolas de barras, baseado no menor custo horário do equipamento. Foram utilizadas as informações técnicas referentes a 20 modelos de pulverizadores disponíveis no mercado, sendo quatro autopropelidos, oito de arrasto e oito do tipo montado. A análise de sensibilidade dos componentes dos custos operacionais mostrou que as taxas de reparo e depreciação foram os fatores que mais interferiram na variação do custo horário do conjunto trator-pulverizador. O modelo matemático desenvolvido facilitou a realização da análise de sensibilidade que foi processada em um tempo muito pequeno.

Distribuição da carga hidráulica em linhas de derivação otimizadas por programação linear

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

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

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

Robust State-Derivative Feedback LMI-Based Designs for Linear Descriptor Systems

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

Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration

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

Relação entre modelos de programação não-linear com incerteza no conjunto de restrições

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

Programação linear por partes: revisão teórica e aplicações

Procura-se resgatar a importância de uma subárea da Programação Matemática conhecida como Programação Linear Por Partes - PLP. de fato a PLP tem inúmeras aplicações tanto na área teórica como em situações reais. Este trabalho apresenta os resultados de uma pesquisa bibliográfica, efetuada nas principais revistas técnicas e livros disponíveis relacionados com Pesquisa Operacional, que visou situar o estado da'arte da Programação Linear por Partes, bem como a abrangência de sua aplicabilidade. Particularmente, no contexto da PLP, este texto deslaca a Programação em Redes Lineares por Partes devido a sua relevância em muitas situações práticas.

Robust state-derivative feedback LMI-based designs for multivariable linear systems

In some practical problems, for instance in the control systems for the suppression of vibration in mechanical systems, the state-derivative signals are easier to obtain than the state signals. New necessary and sufficient linear matrix inequalities (LMI) conditions for the design of state-derivative feedback for multi-input (MI) linear systems are proposed. For multi-input/multi-output (MIMO) linear time-invariant or time-varying plants, with or without uncertainties in their parameters, the proposed methods can include in the LMI-based control designs the specifications of the decay rate, bounds on the output peak, and bounds on the state-derivative feedback matrix K. These design procedures allow new specifications and also, they consider a broader class of plants than the related results available in the literature. The LMIs, when feasible, can be efficiently solved using convex programming techniques. Practical applications illustrate the efficiency of the proposed methods.