Própolis na dieta de abelhas Apis mellifera L. e seu efeito no sistema imune, expressão de genes após o desafio bacteriano e detoxificação frente ao agroquímico fipronil

Pós-graduação em Zootecnia - FMVZ

Efeitos da adição do IGF-1 ou IGF-LongR3 sobre aspectos celulares e moleculares de complexos cumulus-oócito durante a maturação oocitária in vitro em bovinos

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

Atividade cambial em ramos de Kielmeyera grandiflora (WAWRA) saddi (Callophylaceae) ocorrentes no cerrado paulista

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

Análise espacial do potencial fotovoltaico em telhados de residências usando modelagem hierárquica bayesiana

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

Routing and Wavelength Assignment (RWA) with Power Considerations In All- Optical Wavelength-Routed Networks

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

Selection of Switching Sites in All-Optical Nework Topology Design

In this paper, we consider the problem of topology design for optical networks. We investigate the problem of selecting switching sites to minimize total cost of the optical network. The cost of an optical network can be expressed as a sum of three main factors: the site cost, the link cost, and the switch cost. To the best of our knowledge, this problem has not been studied in its general form as investigated in this paper. We present a mixed integer quadratic programming (MIQP) formulation of the problem to find the optimal value of the total network cost. We also present an efficient heuristic to approximate the solution in polynomial time. The experimental results show good performance of the heuristic. The value of the total network cost computed by the heuristic varies within 2% to 21% of its optimal value in the experiments with 10 nodes. The total network cost computed by the heuristic for 51% of the experiments with 10 node network topologies varies within 8% of its optimal value. We also discuss the insight gained from our experiments.

Integrated pulp and paper mill planning and scheduling

This article describes a real-world production planning and scheduling problem occurring at an integrated pulp and paper mill (P&P) which manufactures paper for cardboard out of produced pulp. During the cooking of wood chips in the digester, two by-products are produced: the pulp itself (virgin fibers) and the waste stream known as black liquor. The former is then mixed with recycled fibers and processed in a paper machine. Here, due to significant sequence-dependent setups in paper type changeovers, sizing and sequencing of lots have to be made simultaneously in order to efficiently use capacity. The latter is converted into electrical energy using a set of evaporators, recovery boilers and counter-pressure turbines. The planning challenge is then to synchronize the material flow as it moves through the pulp and paper mills, and energy plant, maximizing customer demand (as backlogging is allowed), and minimizing operation costs. Due to the intensive capital feature of P&P, the output of the digester must be maximized. As the production bottleneck is not fixed, to tackle this problem we propose a new model that integrates the critical production units associated to the pulp and paper mills, and energy plant for the first time. Simple stochastic mixed integer programming based local search heuristics are developed to obtain good feasible solutions for the problem. The benefits of integrating the three stages are discussed. The proposed approaches are tested on real-world data. Our work may help P&P companies to increase their competitiveness and reactiveness in dealing with demand pattern oscillations. (C) 2012 Elsevier Ltd. All rights reserved.

Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented.

Influence Assessment in an Heteroscedastic Errors-in-Variables Model

The main goal of this article is to consider influence assessment in models with error-prone observations and variances of the measurement errors changing across observations. The techniques enable to identify potential influential elements and also to quantify the effects of perturbations in these elements on some results of interest. The approach is illustrated with data from the WHO MONICA Project on cardiovascular disease.

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012

Competing regression models for longitudinal data

The choice of an appropriate family of linear models for the analysis of longitudinal data is often a matter of concern for practitioners. To attenuate such difficulties, we discuss some issues that emerge when analyzing this type of data via a practical example involving pretestposttest longitudinal data. In particular, we consider log-normal linear mixed models (LNLMM), generalized linear mixed models (GLMM), and models based on generalized estimating equations (GEE). We show how some special features of the data, like a nonconstant coefficient of variation, may be handled in the three approaches and evaluate their performance with respect to the magnitude of standard errors of interpretable and comparable parameters. We also show how different diagnostic tools may be employed to identify outliers and comment on available software. We conclude by noting that the results are similar, but that GEE-based models may be preferable when the goal is to compare the marginal expected responses.

The importance of plant life form on spatial associations along a subtropical coastal dune gradient

Questions Does the spatial association between isolated adult trees and understorey plants change along a gradient of sand dunes? Does this association depend on the life form of the understorey plant? Location Coastal sand dunes, southeast Brazil. Methods We recorded the occurrence of understorey plant species in 100 paired 0.25 m2 plots under adult trees and in adjacent treeless sites along an environmental gradient from beach to inland. Occurrence probabilities were modelled as a function of the fixed variables of the presence of a neighbour, distance from the seashore and life form, and a random variable, the block (i.e. the pair of plots). Generalized linear mixed models (GLMM) were fitted in a backward step-wise procedure using Akaike's information criterion (AIC) for model selection. Results The occurrence of understorey plants was affected by the presence of an adult tree neighbour, but the effect varied with the life form of the understorey species. Positive spatial association was found between isolated adult neighbour and young trees, whereas a negative association was found for shrubs. Moreover, a neutral association was found for lianas, whereas for herbs the effect of the presence of an adult neighbour ranged from neutral to negative, depended on the subgroup considered. The strength of the negative association with forbs increased with distance from the seashore. However, for the other life forms, the associational pattern with adult trees did not change along the gradient. Conclusions For most of the understorey life forms there is no evidence that the spatial association between isolated adult trees and understorey plants changes with the distance from the seashore, as predicted by the stress gradient hypothesis, a common hypothesis in the literature about facilitation in plant communities. Furthermore, the positive spatial association between isolated adult trees and young trees identified along the entire gradient studied indicates a positive feedback that explains the transition from open vegetation to forest in subtropical coastal dune environments.

Cough and dyspnea during bronchoconstriction: comparison of different stimuli

Abstract Background Bronchial challenge tests are used to evaluate bronchial responsiveness in diagnosis and follow-up of asthmatic patients. Challenge induced cough has increasingly been recognized as a valuable diagnostic tool. Various stimuli and protocols have been employed. The aim of this study was to compare cough and dyspnea intensity induced by different stimuli. Methods Twenty asthmatic patients underwent challenge tests with methacholine, bradykinin and exercise. Cough was counted during challenge tests. Dyspnea was assessed by modified Borg scale and visual analogue scale. Statistical comparisons were performed by linear mixed-effects model. Results For cough evaluation, bradykinin was the most potent trigger (p < 0.01). In terms of dyspnea measured by Borg scale, there were no differences among stimuli (p > 0.05). By visual analogue scale, bradykinin induced more dyspnea than other stimuli (p ≤ 0.04). Conclusion Bradykinin seems to be the most suitable stimulus for bronchial challenge tests intended for measuring cough in association with bronchoconstriction.

Accelerating benders decomposition with heuristicmaster problem solutions

In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.

Computing primal solutions with exact arithmetics in SCIP.

The research for exact solutions of mixed integer problems is an active topic in the scientific community. State-of-the-art MIP solvers exploit a floating- point numerical representation, therefore introducing small approximations. Although such MIP solvers yield reliable results for the majority of problems, there are cases in which a higher accuracy is required. Indeed, it is known that for some applications floating-point solvers provide falsely feasible solutions, i.e. solutions marked as feasible because of approximations that would not pass a check with exact arithmetic and cannot be practically implemented. The framework of the current dissertation is SCIP, a mixed integer programs solver mainly developed at Zuse Institute Berlin. In the same site we considered a new approach for exactly solving MIPs. Specifically, we developed a constraint handler to plug into SCIP, with the aim to analyze the accuracy of provided floating-point solutions and compute exact primal solutions starting from floating-point ones. We conducted a few computational experiments to test the exact primal constraint handler through the adoption of two main settings. Analysis mode allowed to collect statistics about current SCIP solutions' reliability. Our results confirm that floating-point solutions are accurate enough with respect to many instances. However, our analysis highlighted the presence of numerical errors of variable entity. By using the enforce mode, our constraint handler is able to suggest exact solutions starting from the integer part of a floating-point solution. With the latter setting, results show a general improvement of the quality of provided final solutions, without a significant loss of performances.