Caracterização da piscicultura na microrregião da baixada cuiabana, Mato Grosso, Brasil

The objective of this study was to characterize the fish farms located in the lowland micro region in Cuiaba, MT, through interviews with 26 selected farmers which represent the universe of fish farms that are active. Qualitative data were subjected to statistical Chi-square test to diagnose the existence of correlation between them with 95% confidence. These results support the conclusion that the species that compose the group of round fish are present in 100% of fish farms, accounting 88.2% of production. The difference is that production exclusively in nurseries and the largest area of shallow water, with production in higher scale than elsewhere in the country, with prospects of growth in area and productivity. Some actions should be implemented: legislation objectively and with sufficient qualified personnel to inspect the enterprises, applied research in food management and feed production with better price and quality, technical and administrative management, use of juveniles with proven genetics and monitoring of water quality. Fish farming is the main source of income funding for 67.5% of farmers interviewed. The size of the fish farms did not affect the variables related to implementation, conduct and management of the activity. The demand and price of feed are the variables that most directs the decision making of farmers. The main marketing channel used by medium and large farmers is exclusively, the slaughterhouses. The main part of fish is sold processed.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.

Efeito da densidade de plantas de Bracharia decumbens Stapf sobre o crescimento inicial de mudas de Eucalyptus grandis W. Hill ex Maiden

In order to verify the effect of Brachiaria decumbens plant density on the initial growth of Eucalyptus grandis plants, one assay was conducted under semi-controlled conditions of soil fertility and humidity. Dark red Latossol, collected from the arable layer, was used as substrate in 50 liters amianthus cement boxes. One seedling of Eucalyptus was planted in each box. Fifteen days later, seedlings of B. decumbens were transplanted on the same box. The treatments consisted of 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 60, 80, 100, and 120 plants of B. decumbens. The experimental design was the complete randomized design, with 15 treatments and four replicates. The Eucalyptus plants that lived with B. decumbens were evaluated for stem diameter, plant high, leaf area, and dry weight of stem, branches and leaves. B. decumbens plants were evaluated for dry weight of aerial parts. B. decumbens, at the density level of four plants per m 2 and over, reduced of the initial growth of the Eucalyptus plants. B. decumbens reduced on average 27.78% stem diameter, 18.47% plant high, 70.56% leaf number, 63.26% leaf area, and 55.22%, 77.29% and 55.30% of stem, branch and leaf dry weight, respectively. Plant high was not a good parameter to evaluate the B. decumbens interference.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Finite element analysis of warpage in laminated aluminium alloy plates for machining of primary aeronautic parts

The aim of this paper consists in presenting a method of simulating the warpage in 7xxx series aluminium alloy plates. To perform this simulation finite element software MSC.Patran and MSC.Marc were used. Another result of this analysis will be the influence on material residual stresses induced on the raw material during the rolling process upon the warpage of primary aeronautic parts, fabricated through machining (milling) at Embraer. The method used to determinate the aluminium plate residual stress was Layer Removal Test. The numerical algorithm Modified Flavenot Method was used to convert layer removal and beam deflection in stress level. With such information about the level and profile of residual stresses become possible, during the step that anticipate the manufacturing to incorporate these values in the finite-element approach for modelling warpage parts. Based on that warpage parameter surely the products are manufactured with low relative vulnerability propitiating competitiveness and price. © 2007 American Institute of Physics.

Ramificação e distribuição dos nervos frênicos no músculo diafragma do gato doméstico

The ramification and the distribution of the phrenic nerves right and left had been studied in 30 muscles diaphragms of unknown breed adult domestic cats, 7 males and 23 females, and were fixed in 10% buffered formalin solution. After fixation and dissection, it was observed that the phrenic nerves ramified for the respective carnous parts of the muscle diaphragm, pars lumbalis, costalis and sternalis, and had finished in higher frequency in dorsolateral trunk and ventral branch (63.33%). We observed the following arrangements: dorsal, ventral and lateral branches (25.0%); dorsal branch and ventrolateral trunk (6.66%); dorsolateral and ventrolateral trunks (3.33%); dorsolateral trunk, lateral and ventral branches (1.66%). The phrenic nerves had distributed symmetrically in 11 samples (36.66%), only showing the termination in dorsolateral trunk and ventral branch. The dorsal branches supplied pars lumbalis (73.33% to right and 56.66% to the left) and pars costalis (13.33% to right and 10.0% to the left). The right dorsal branch supplied the crus mediale dexter of the right pillar (100.0%) and the left dorsal branch supplied the crus mediale sinister of the right pillar and the left pillar (100.0%). The lateral branches supply pars lumbalis (23.33% to right and 33.33% to the left), pars costalis (96.66% to right and 100.0% to the left) and pars sternalis (3.33% only to the right). The ventral branches supplied the ventral region of pars costalis (46.66 % to right and 43.33% to the left) and pars sternalis (96.66% to right and 100.0% to the left). Four female animals (13.33%) had shown fibers crossing proceeding from the left ventral branch for right antimere had been that in one of these samples (3.33%) occurred connection between the left ventral branch and the right.

Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes

In this paper, some new constraints and an extended formulation are presented for a Lot Sizing and Scheduling Model proposed in the literature. In the production process considered a key material is prepared and is transformed into different final items. The sequencing decisions are related to the order in which the materials are processed and the lot sizing decisions are related to the final items production. The mathematical formulation considers sequence-dependent setup costs and times. Results of the computational tests executed using the software Cplex 10.0 showed that the performance of the branch-and-cut method can be improved by the proposed a priori reformulation.

Barbados: public-private sector partnership

Includes bibliography

Two-level network design with intermediate facilities: An application to electrical distribution systems

We consider the two-level network design problem with intermediate facilities. This problem consists of designing a minimum cost network respecting some requirements, usually described in terms of the network topology or in terms of a desired flow of commodities between source and destination vertices. Each selected link must receive one of two types of edge facilities and the connection of different edge facilities requires a costly and capacitated vertex facility. We propose a hybrid decomposition approach which heuristically obtains tentative solutions for the vertex facilities number and location and use these solutions to limit the computational burden of a branch-and-cut algorithm. We test our method on instances of the power system secondary distribution network design problem. The results show that the method is efficient both in terms of solution quality and computational times. © 2010 Elsevier Ltd.

Optimal energy generation with biomass of sugarcane harvest

The aim of this work is the application of the Interior Point and Branch and Bound methods in multiobjective optimization models related to sugarcane harvest residual biomass. These methods showed their viability to help on choosing the sugarcane planting varieties, searching to optimize cost and energy balance of harvest residual biomass, which have conflitant objectives. These methods provide satisfactory results, with fair computing performance and reliable and consistent solutions to the analyzed models. © 2011 IEEE.

Selecting the most adequate bedding material for broiler production in Brazil

Broiler chicken production is widely dispersed across the globe, and one important issue for growers is the selection of adequate bedding material, as the availability and price of substrates varies among countries and regions within a same country. This study aimed at applying a multiple criteria analysis approach for the selection of the most appropriate bedding material for broiler production. Based on field research data and growers' experience, the most desirable characteristics of a litter material were chosen as the main criteria. The selected materials were wood shavings, rice husks, chopped Napier grass (Pennisetum pupureum), 50% sugar cane bagasse (Saccharum L.) plus 50% wood shavings, 50% sugar cane bagasse (Saccharum L.) plus 50% rice husks, and pure sugar cane bagasse (Saccharum L.). The analytical hierarchy process (AHP) was applied for selecting the most suitable bedding material. Validation was performed using data from previous studies carried out in central-western Brazil on the effects of different types of bedding material on broiler carcass quality. Considering the selected criteria, several bedding materials were tested and ranked, and the results showed that wood-shavings litter was the best option (weight = 0.28), followed by rice husks (weight = 0.24). All other tested alternatives presented lower scores and were, therefore, not considered for use. The AHP approach was found to be an efficient tool to select the most appropriate litter material under specific scenarios.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.

Análise e implementação de um algoritmo de busca dispersa para o planejamento da expansão de sistemas de transmissão

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