763 research outputs found

    Severe acute maternal morbidity and maternal death audit - a rapid diagnostic tool for evaluating maternal care

    Get PDF
    Objective. To analyse severe acute maternal morbidity (SAMM) and maternal mortality in the Pretoria region over a 2-year period (2000 - 2001).Setting. Public hospitals in the Pretoria region, South Africa, serving a mainly indigent urban population.Methods. A descriptive study was performed whereby women with SAMM and maternal deaths were identified at daily audit meetings and an audit form was completed for all cases fulfilling the definition of SAMM ('near miss') and for all maternal deaths.Results. The number of maternal deaths declined slightly but not significantly from 18 deaths in 2000 to 16 in 2001. This represents a change in the maternal mortality ratio (MMR) from 130/100 000 live births in 2000 to a MMR of 100/100 000 live births in 2001. However, when data for women with SAMM and maternal deaths were combined, there was a significant increase in major maternal morbidity from 90 cases (SAMM and maternal death rate 649/100 000 live births) in 2000 to 142 cases (SAMM and maternal death rate 889/100 000 live births) in 2001 (p = 0.006). This increase was due to a significant increase in severe maternal morbidity related to abortions and obstetric haemorrhages.Conclusion. Analysis of maternal deaths only in the Pretoria region failed to identify abortions and haemorrhages as major maternal care problems. When data for women with SAMM were combined with data for maternal deaths, however, these problems were dearly identified, and remedial action could be taken. Including SAMM in maternal death audits increases the rapidity with which health system problems can be identified

    Manifolds associated with (Z2)n(Z_2)^n-colored regular graphs

    Full text link
    In this article we describe a canonical way to expand a certain kind of (Z2)n+1(\mathbb Z_2)^{n+1}-colored regular graphs into closed nn-manifolds by adding cells determined by the edge-colorings inductively. We show that every closed combinatorial nn-manifold can be obtained in this way. When n3n\leq 3, we give simple equivalent conditions for a colored graph to admit an expansion. In addition, we show that if a (Z2)n+1(\mathbb Z_2)^{n+1}-colored regular graph admits an nn-skeletal expansion, then it is realizable as the moment graph of an (n+1)(n+1)-dimensional closed (Z2)n+1(\mathbb Z_2)^{n+1}-manifold.Comment: 20 pages with 9 figures, in AMS-LaTex, v4 added a new section on reconstructing a space with a (Z2)n(Z_2)^n-action for which its moment graph is a given colored grap

    An Inverse Method for Policy-Iteration Based Algorithms

    Full text link
    We present an extension of two policy-iteration based algorithms on weighted graphs (viz., Markov Decision Problems and Max-Plus Algebras). This extension allows us to solve the following inverse problem: considering the weights of the graph to be unknown constants or parameters, we suppose that a reference instantiation of those weights is given, and we aim at computing a constraint on the parameters under which an optimal policy for the reference instantiation is still optimal. The original algorithm is thus guaranteed to behave well around the reference instantiation, which provides us with some criteria of robustness. We present an application of both methods to simple examples. A prototype implementation has been done

    Using Strategy Improvement to Stay Alive

    Full text link
    We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy -- depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice

    FSHD myoblasts fail to downregulate intermediate filament protein vimentin during myogenic differentiation.

    Get PDF
    Facioscapulohumeral muscular dystrophy (FSHD) is an autosomal dominant hereditary neuromuscular disorder. The clinical features of FSHD include weakness of the facial and shoulder girdle muscles followed by wasting of skeletal muscles of the pelvic girdle and lower extremities. Although FSHD myoblasts grown in vitro can be induced to differentiate into myotubes by serum starvation, the resulting FSHD myotubes have been shown previously to be morphologically abnormal. Aim. In order to find the cause of morphological anomalies of FSHD myotubes we compared in vitro myogenic differentiation of normal and FSHD myoblasts at the protein level. Methods. We induced myogenic differentiation of normal and FSHD myoblasts by serum starvation. We then compared protein extracts from proliferating myoblasts and differentiated myotubes using SDS-PAGE followed by mass spectrometry identification of differentially expressed proteins. Results. We demonstrated that the expression of vimentin was elevated at the protein and mRNA levels in FSHD myotubes as compared to normal myotubes. Conclusions. We demonstrate for the first time that in contrast to normal myoblasts, FSHD myoblasts fail to downregulate vimentin after induction of in vitro myogenic differentiation. We suggest that vimentin could be an easily detectable marker of FSHD myotube

    Improving Strategies via SMT Solving

    Full text link
    We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number of iterations (ii) the use of merge operations (often, convex hulls) at the merge points of the control flow graph. It instead computes the least inductive invariant expressible in the domain at a restricted set of program points, and analyzes the rest of the code en bloc. We emphasize that we compute this inductive invariant precisely. For that we extend the strategy improvement algorithm of [Gawlitza and Seidl, 2007]. If we applied their method directly, we would have to solve an exponentially sized system of abstract semantic equations, resulting in memory exhaustion. Instead, we keep the system implicit and discover strategy improvements using SAT modulo real linear arithmetic (SMT). For evaluating strategies we use linear programming. Our algorithm has low polynomial space complexity and performs for contrived examples in the worst case exponentially many strategy improvement steps; this is unsurprising, since we show that the associated abstract reachability problem is Pi-p-2-complete

    A mutual reference shape based on information theory

    Get PDF
    International audienceIn this paper, we propose to consider the estimation of a refer-ence shape from a set of different segmentation results using both active contours and information theory. The reference shape is defined as the minimum of a criterion that benefits from both the mutual information and the joint entropy of the input segmentations and called a mutual shape. This energy criterion is here justified using similarities between informa-tion theory quantities and area measures, and presented in a continuous variational framework. This framework brings out some interesting evaluation measures such as the speci-ficity and sensitivity. In order to solve this shape optimization problem, shape derivatives are computed for each term of the criterion and interpreted as an evolution equation of an active contour. Some synthetical examples allow us to cast the light on the difference between our mutual shape and an average shape. Our framework has been considered for the estimation of a mutual shape for the evaluation of cardiac segmentation methods in MRI

    Gériatrie [Geriatric medicine: update 2020]

    Get PDF
    Several studies published in 2020 showed new data supporting the prescription of statins in some old and very old patients. Despite the enthusiasm about SGLT-2 inhibitors, caution must remain in frail and dependent older diabetic patients who are not well represented in most studies. Antihypertensive treatment appears more beneficial when taken at night rather than in the morning but beware of the prescribing cascade of a diuretic when a new prescription of a calcium channel blocker. Biomarkers, including plasmatic biomarkers, are becoming increasingly important in the diagnostic strategy of neurocognitive disorders. Finally, fall prevention studies showed heterogeneous results but multimodal interventions remain mainstream
    corecore