Modelo Matemático para Predição da Acidose Metabólica no Nascimento em Gestações com Diástole Zero ou Reversa

Objetivos: elaborar modelo matemático baseado em parâmetros da cardiotocografia (CTG) anteparto de repouso para predição da acidose metabólica no nascimento, caracterizada por valores do excesso de bases (BE) inferiores a -10 mEq/L, em gestações com diagnóstico de diástole zero (DZ) ou reversa (DR) na dopplervelocimetria das artérias umbilicais. Métodos: foi estudada a última cardiotocografia de 127 gestantes de alto risco com diagnóstico de DZ ou DR, pela análise visual do traçado. Os parâmetros da CTG estudados foram a variabilidade da FCF, acelerações transitórias, desacelerações e padrão pseudo-sinusoidal. Entre as características da gravidez foram analisadas a idade gestacional, o intervalo em dias entre o diagnóstico da DZ ou DR e o parto. O modelo de regressão logística foi aplicado na determinação do melhor modelo matemático para predição da acidose. Resultados: a acidose metabólica ocorreu em 51 casos (40,2%). O modelo matemático para predição da acidose contemplou os seguintes parâmetros: intervalo em dias entre o diagnóstico da DZ ou DR e o parto (X1), idade gestacional em semanas (X2), variabilidade da FCF <5 bpm (X3) e variabilidade da FCF entre 5 e 9 bpm (X4). As variáveis de análise da variabilidade receberam valor 1 quando presente e valor 0 quando ausente. O coeficiente z foi calculado pela seguinte fórmula: z = 2,2348 + (-0,0117 X1) + (-0,09 X2) + (1,9552 X3) + (-0,4474 X4). Aplicando-se a expressão p = e z/(1 + e z), a probabilidade (p) foi calculada. Conclusões: o modelo matemático apresentado permite calcular a probabilidade da ocorrência de acidose metabólica no nascimento, em gestações com DZ ou DR, a partir da análise visual da cardiotocografia anteparto de repouso.

Fatores preditores para o óbito neonatal em gestações com diástole zero ou reversa na doplervelocimetria da artéria umbilical

OBJETIVO: avaliar os fatores de risco antenatais e pós-natais para o óbito neonatal em gestações com diástole zero (DZ) ou reversa (DR) na doplervelocimetria da artéria umbilical. MÉTODOS: estudo transversal, retrospectivo, inferencial, a partir de 48 prontuários de gestações únicas com DZ ou DR, idade gestacional entre 24 e 34 semanas, em uma maternidade no Nordeste do Brasil. A média de idade foi de 27,3 anos (DP: 7,9). Vinte (41,7%) eram primigestas. Síndromes hipertensivas foram observadas em 44 (91,7%) casos. Trinta e cinco (72,9%) apresentavam DZ e 13 (27,1%) DR. Procedeu-se inicialmente à análise univariada (teste t de Student e teste Exato de Fisher), relacionando os parâmetros com o desfecho avaliado (óbito neonatal). As variáveis que apresentaram associação significativa foram incluídas no modelo de regressão logística (Estatística de Wald). O nível de significância utilizado foi de 5%. RESULTADOS: a mortalidade perinatal foi de 64,6% (31/48). Ocorreram cinco óbitos fetais e 26 neonatais. A média de idade gestacional no momento do diagnóstico foi de 27,9 (DP: 2,8) semanas. A resolução da gestação antes de 24 horas após o diagnóstico ocorreu em 52,1% dos casos. Parto abdominal foi realizado em 85,4% dos casos. Os recém-nascidos pesaram em média 975,9 g (DP: 457,5). Vinte e quatro (57,1%) apresentaram Apgar menor que 7 no primeiro minuto e 21,4%, no quinto. A idade gestacional no momento do diagnóstico, o peso ao nascer e o Apgar de primeiro minuto revelaram-se variáveis significativamente relacionadas com o óbito neonatal (valores de p foram, respectivamente, 0,008; 0,004 e 0,020). As razões de chance foi de 6,6; 25,3 e 13,8 para o óbito neonatal, quando o diagnóstico foi estabelecido até a 28ª semana, peso <1000 g e Apgar < 7, respectivamente. CONCLUSÕES: idade gestacional no momento do diagnóstico, peso ao nascer e Apgar de primeiro minuto foram fatores capazes de predizer o óbito neonatal em gestações com DZ ou DR na doplervelocimetria da artéria umbilical.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.

Sementes recalcitrantes: intolerantes a baixas temperaturas? Embriões recalcitrantes de Inga vera Willd. subsp. affinis (DC.) T. D. Penn. toleram temperatura sub-zero

Sementes recalcitrantes são intolerantes à dessecação e a baixas temperaturas, que são as principais formas de conservação de sementes e, portanto, são de difícil armazenamento. Inga vera subsp. affinis produz sementes denominadas recalcitrantes, uma vez que não toleram redução do teor de água para valores inferiores a 35%. Neste trabalho é demonstrada a tolerância desses embriões a temperatura de -2 ºC. Embriões de I. vera de diferentes estádios de maturação foram armazenados por até 45 dias nas temperaturas de 8 ºC a -18 ºC, com ou sem secagens prévias até -4,0 e -6,0 MPa. Os resultados permitiram observar que, embora nenhum tratamento tenha proporcionado resistância à temperatura de -18 ºC, a secagem dos embriões maduros a -4 MPa proporcionou maior tolerância à redução de temperatura até níveis de congelamento da água (-2 ºC).

Uma análise da proposta de déficit nominal zero

The aim of this paper is to evaluate the relationship between fiscal deficits and interest rate in Brazil. An adaptation of Taylor’s Rule is tested and the data confirmed this relationship. Furthermore, evidence from a loanable funds model shows that a lower deficit can bring interest rate down. However, policy coordination is a key feature in this process.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Zero-sum problems in finite cyclic groups

The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Square Root Finding In Graphs

Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of distance at most two in H. Graph square is a basic operation with a number of results about its properties in the literature. We study the characterization and recognition problems of graph powers. There are algorithmic and computational approaches to answer the decision problem of whether a given graph is a certain power of any graph. There are polynomial time algorithms to solve this problem for square of graphs with girth at least six while the NP-completeness is proven for square of graphs with girth at most four. The girth-parameterized problem of root fining has been open in the case of square of graphs with girth five. We settle the conjecture that recognition of square of graphs with girth 5 is NP-complete. This result is providing the complete dichotomy theorem for square root finding problem.

Acyclic 5-Choosability of Planar Graphs Without Adjacent Short Cycles

The conjecture claiming that every planar graph is acyclic 5-choosable[Borodin et al., 2002] has been verified for several restricted classes of planargraphs. Recently, O. V. Borodin and A. O. Ivanova, [Journal of Graph Theory,68(2), October 2011, 169-176], have shown that a planar graph is acyclically 5-choosable if it does not contain an i-cycle adjacent to a j-cycle, where 3<=j<=5 if i=3 and 4<=j<=6 if i=4. We improve the above mentioned result and prove that every planar graph without an i-cycle adjacent to a j-cycle with3<=j<=5 if i=3 and 4<=j<=5 if i=4 is acyclically 5-choosable.

Edge-choosability of Planar Graphs

According to the List Colouring Conjecture, if G is a multigraph then χ' (G)=χl' (G) . In this thesis, we discuss a relaxed version of this conjecture that every simple graph G is edge-(∆ + 1)-choosable as by Vizing’s Theorem ∆(G) ≤χ' (G)≤∆(G) + 1. We prove that if G is a planar graph without 7-cycles with ∆(G)≠5,6 , or without adjacent 4-cycles with ∆(G)≠5, or with no 3-cycles adjacent to 5-cycles, then G is edge-(∆ + 1)-choosable.