Comprimento de estacas e parte do ramo na formação de mudas de aceroleira

A capacidade rizogênica, a brotação e o vigor de estacas caulinares de aceroleira foram avaliados em condições de casa de vegetação na Empresa Brasileira de Pesquisa Agropecuária (EMBRAPA) Agroindústria Tropical, em Fortaleza-CE, no período de novembro de 2000 a janeiro de 2001, objetivando determinar a parte do ramo e o tamanho mais apropriado para estaquia. O delineamento experimental foi inteiramente casualizado, no esquema fatorial 3x3, correspondendo a três posições no ramo (apical, mediano e basal) e três comprimentos de estacas (10; 15 e 20 cm), com três repetições de 10 estacas por parcela. As estacas, colhidas de plantas com 2,5 anos de idade, foram plantadas em tubetes de 288cm³ contendo uma mistura de casca de arroz carbonizada e vermicomposto, na proporção volumétrica de 2:3, e cultivadas por um período de 60 dias sob condições de nebulização intermitente. Avaliaram-se a percentagem de estacas enraizadas, o peso da matéria seca do sistema radicular e parte aérea, o número de folhas, de gemas sem brotação e as ramificações emitidas por estaca. Os resultados indicaram que estacas caulinares com 10 centímetros de comprimento e colhidas da porção mediana dos ramos são mais apropriadas para a produção de mudas de aceroleira por estaquia, sob condições de casa de vegetação com nebulização intermitente.

Ramificação e distribuição do tronco pulmonar em relação aos brônquios, em fetos de bovinos azebuados

Mediante esta pesquisa, estudamos a ramificação e a distribuição das artérias pulmonares em 20 fetos de bovinos azebuados (13 machos e 7 fêmeas), com idades variando entre 6 e 9 meses. As peças foram fixadas em solução aquosa de formol a 10%, e o método de dissecação consistiu da abertura da cavidade torácica desses animais, com vistas à individualização dos vasos arteriais e brônquios. da artéria pulmonar direita observou-se que, mais comumente, 15 vezes (75%), parte como primeiro colateral o ramo ascendente, seguido do ramo descendente que acompanham os dois brônquios segmentares do brônquio traqueal, os quais irrigam, respectivamente, a porção cranial e caudal do lobo cranial do pulmão. Logo após este arranjo, surgem o ramo lobar acessório e em seguida o ramo lobar médio. O ramo lobar acessório pode emergir duas vezes (10%) depois do ramo lobar médio ou na mesma altura dele, cinco vezes (25%). Uma única vez (5%) aparecem dois ramos lobares médios. em cinco preparações (25%), os dois primeiros ramos da artéria pulmonar direita são vistos a nascer em tronco comum, o ramo lobar cranial. da artéria pulmonar esquerda nascem mais freqüentemente 18 vezes (90%) como 1º e 2º colaterais os ramos ascendente e descendente, e respectivamente duas vezes (10%) estes ramos provêm de um único colateral, o ramo lobar cranial. em cada lobo caudal (direito e esquerdo), penetra um ramo lobar caudal (direito e esquerdo) que emite número bastante variado de ramos arteriais (6 a 14) do lado direito e (7 a 16) do lado esquerdo.

Artéria e veia lienais de bovinos da raça Nelore

A artéria lienal mostra dois comportamentos antes de penetrar no hilo do baço, compondo o Grupo I (90%) com um ramo extra-hilar e o Grupo II (10%) com 2 destes ramos. Após penetrar, origina em média 13 ramos para a margem cranial e 10 para a margem caudal. A veia lienal freqüentemente (96,6%) está representada por um único vaso de trajeto longitudinal no eixo dorsoventral, para onde confluem em média 13 vasos da margem cranial e 11 da margem caudal, e raramente (3,3%) esta veia resulta da confluência de 2 vasos de calibres equivalentes.

Segmentação anatomocirúrgica arterial dos pulmões de ovinos da raça ideal (Ovis aires - L.1758)

Foram estabelecidos segmentos anatomocirúrgicos em pulmões de ovinos da raça Ideal (dezessete segmentos no pulmão direito e doze no esquerdo), mediante dissecação de peças coradas com látex colorido e fixadas em formol. Na maioria dos casos, a artéria pulmonar direita emite, a partir de um tronco, o ramo ascendente e descendente para as partes cranial e caudal do lobo cranial respectivamente; o ramo do lobo médio; o ramo do lobo caudal e o ramo do lobo acessório. Invariavelmente, a artéria pulmonar esquerda emite o ramo do lobo cranial e o ramo do lobo caudal.

6-[omega-arylalkenyl]-5,6-dihydro-alpha-pyrones from Cryptocarya moschata (Lauraceae)

Eleven 6-[omega-arylalkenyl]-5,6-dihydro-alpha-pyrones, cryptomoscatones D2, E1, E2, E3 and F1 and cryptopyranmoscatones A1, A2, A3, B1, B2 and B4, in addition to goniothalamin and cryptofolione, were isolated from branch and stem bark of Cryotocarya moschata, Lauraceae. Their structures were established by spectroscopic methods. (C) 2000 Elsevier B.V. Ltd. All rights reserved.

Tabu search algorithm for network synthesis

Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures (configurations obtained with different sets of circuit/transformer additions). The proposed parallel tabu search algorithm has shown to be effective in exploring this type of optimization landscape. The algorithm is a third generation tabu search procedure with several advanced features. This is the most comprehensive combinatorial optimization technique available for treating difficult problems such as the transmission expansion planning. The method includes features of a variety of other approaches such as heuristic search, simulated annealing and genetic algorithms. In all test cases studied there are new generation, load sites which can be connected to an existing main network: such connections may require more than one line, transformer addition, which makes the problem harder in the sense that more combinations have to be considered.

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.

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.

Evolutionary heuristic to determine future land use

In the spatial electric load forecasting, the future land use determination is one of the most important tasks, and one of the most difficult, because of the stochastic nature of the city growth. This paper proposes a fast and efficient algorithm to find out the future land use for the vacant land in the utility service area, using ideas from knowledge extraction and evolutionary algorithms. The methodology was implemented into a full simulation software for spatial electric load forecasting, showing a high rate of success when the results are compared to information gathered from specialists. The importance of this methodology lies in the reduced set of data needed to perform the task and the simplicity for implementation, which is a great plus for most of the electric utilities without specialized tools for this planning activity. © 2008 IEEE.

Meta-heuristic approaches for a soft drink industry problem

The present paper evaluates meta-heuristic approaches to solve a soft drink industry problem. This problem is motivated by a real situation found in soft drink companies, where the lot sizing and scheduling of raw materials in tanks and products in lines must be simultaneously determined. Tabu search, threshold accepting and genetic algorithms are used as procedures to solve the problem at hand. The methods are evaluated with a set of instance already available for this problem. This paper also proposes a new set of complex instances. The computational results comparing these approaches are reported. © 2008 IEEE.

Fault section estimation in automated distribution substations

In this paper, a methodology based on Unconstrained Binary Programming (UBP) model and Genetic Algorithms (GAs) is proposed for estimating fault sections in automated distribution substations. The UBP model, established by using the parsimonious set covering theory, looks for the match between the relays' protective alarms informed by the SCADA system and their expected states. The GA is developed to minimize the UBP model and estimate the fault sections in a swift and reliable manner. The proposed methodology is tested by utilizing a real-life automated distribution substation. Control parameters of the GA are tuned to achieve maximum computational efficiency and reduction of processing time. Results show the potential and efficiency of the methodology for estimating fault section in real-time at Distribution Control Centers. ©2009 IEEE.

Context-sensitive analysis without calling-context

Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the resulting algorithms are not directly applicable when behavior similar to call and ret instructions may be realized using non-atomic statements, or when procedures do not have rigid boundaries, such as with programs in low level languages like assembly or RTL. We present a framework for context-sensitive analysis that requires neither atomic call and ret instructions, nor encapsulated procedures. The framework presented decouples the transfer of control semantics and the context manipulation semantics of statements. A new definition of context-sensitivity, called stack contexts, is developed. A stack context, which is defined using trace semantics, is more general than Sharir and Pnueli's interprocedural path based calling-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of calling-context based algorithms using stack-context. The framework presented is suitable for deriving algorithms for analyzing binary programs, such as malware, that employ obfuscations with the deliberate intent of defeating automated analysis. The framework is used to create a context-sensitive version of Venable et al.'s algorithm for analyzing x86 binaries without requiring that a binary conforms to a standard compilation model for maintaining procedures, calls, and returns. Experimental results show that a context-sensitive analysis using stack-context performs just as well for programs where the use of Sharir and Pnueli's calling-context produces correct approximations. However, if those programs are transformed to use call obfuscations, a contextsensitive analysis using stack-context still provides the same, correct results and without any additional overhead. © Springer Science+Business Media, LLC 2011.

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.

Performance of CMS muon reconstruction in cosmic-ray events

The performance of muon reconstruction in CMS is evaluated using a large data sample of cosmic-ray muons recorded in 2008. Efficiencies of various high-level trigger, identification, and reconstruction algorithms have been measured for a broad range of muon momenta, and were found to be in good agreement with expectations from Monte Carlo simulation. The relative momentum resolution for muons crossing the barrel part of the detector is better than 1% at 10 GeV/c and is about 8% at 500 GeV/c, the latter being only a factor of two worse than expected with ideal alignment conditions. Muon charge misassignment ranges from less than 0.01% at 10GeV/c to about 1% at 500 GeV/c. © 2010 IOP Publishing Ltd and SISSA.

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.