566 research outputs found

    Pädiatrisches stumpfes thorakoabdominales Trauma: Damage-Control-Resuscitation-Therapie

    Get PDF
    Zusammenfassung: Die Primärversorgung von Kindern mit schwerem stumpfem Bauchtrauma und begleitender Azidose, Koagulopathie und Hypothermie (letale Trias) erfordert ein effizientes multidisziplinäres Therapieregime zur Reduktion der Mortalität. Ein 5,5Jahre alter Junge wurde auf einem Bergbauernhof zwischen Traktorhinterrad und Hoftorumrandung im Torsobereich eingequetscht. Es kam zu einer Milzruptur Grad IV, einer Leberruptur Grad III, einer Pankreaslazeration Grad III, einer beidseitigen Lungenkontusion und einem begleitenden Weichteiltrauma mit Rhabdomyolyse. Aufgrund des schweren Traumas mit Auftreten einer Koagulopathie und einer kombinierten metabolisch-respiratorischen Azidose erfolgten die Gabe von Blutprodukten anstelle der von Kristalloiden, Akzeptanz einer permissiven Hypotension, Stabilisierung der Körpertemperatur im Sinne einer Damage-Control-Resuscitation-Strategie sowie eine Milz erhaltende operative Versorgung mittels Laparotomie. Es wird ein mögliches Therapieregime für das pädiatrische schwere Trauma mit Massentransfusion (MT) diskutier

    Projection image-to-image translation in hybrid X-ray/MR imaging

    Full text link
    The potential benefit of hybrid X-ray and MR imaging in the interventional environment is large due to the combination of fast imaging with high contrast variety. However, a vast amount of existing image enhancement methods requires the image information of both modalities to be present in the same domain. To unlock this potential, we present a solution to image-to-image translation from MR projections to corresponding X-ray projection images. The approach is based on a state-of-the-art image generator network that is modified to fit the specific application. Furthermore, we propose the inclusion of a gradient map in the loss function to allow the network to emphasize high-frequency details in image generation. Our approach is capable of creating X-ray projection images with natural appearance. Additionally, our extensions show clear improvement compared to the baseline method.Comment: In proceedings of SPIE Medical Imaging 201

    Counting Induced Subgraphs: {A}n Algebraic Approach to \#{W}[1]-hardness

    Get PDF

    Convergence of simple adaptive Galerkin schemes based on h − h/2 error estimators

    Get PDF
    We discuss several adaptive mesh-refinement strategies based on (h − h/2)-error estimation. This class of adaptivemethods is particularly popular in practise since it is problem independent and requires virtually no implementational overhead. We prove that, under the saturation assumption, these adaptive algorithms are convergent. Our framework applies not only to finite element methods, but also yields a first convergence proof for adaptive boundary element schemes. For a finite element model problem, we extend the proposed adaptive scheme and prove convergence even if the saturation assumption fails to hold in general

    Learning capability : the effect of existing knowledge on learning

    Get PDF
    It has been observed that different people learn the same things in different ways - increasing their knowledge of the subject/domain uniquely. One plausible reason for this disparity in learning is the difference in the existing personal knowledge held in the particular area in which the knowledge increase happens. To understand this further, in this paper knowledge is modelled as a 'system of cognitive schemata', and knowledge increase as a process in this system; the effect of existing personal knowledge on knowledge increase is 'the Learning Capability'. Learning Capability is obtained in form of a function; although it is merely a representation making use of mathematical symbolism, not a calculable entity. The examination of the function tells us about the nature of learning capability. However, existing knowledge is only one factor affecting knowledge increase and thus one component of a more general model, which might additionally include talent, learning willingness, and attention

    Multipliers for p-Bessel sequences in Banach spaces

    Full text link
    Multipliers have been recently introduced as operators for Bessel sequences and frames in Hilbert spaces. These operators are defined by a fixed multiplication pattern (the symbol) which is inserted between the analysis and synthesis operators. In this paper, we will generalize the concept of Bessel multipliers for p-Bessel and p-Riesz sequences in Banach spaces. It will be shown that bounded symbols lead to bounded operators. Symbols converging to zero induce compact operators. Furthermore, we will give sufficient conditions for multipliers to be nuclear operators. Finally, we will show the continuous dependency of the multipliers on their parameters.Comment: 17 page

    Cascade Failure in a Phase Model of Power Grids

    Full text link
    We propose a phase model to study cascade failure in power grids composed of generators and loads. If the power demand is below a critical value, the model system of power grids maintains the standard frequency by feedback control. On the other hand, if the power demand exceeds the critical value, an electric failure occurs via step out (loss of synchronization) or voltage collapse. The two failures are incorporated as two removal rules of generator nodes and load nodes. We perform direct numerical simulation of the phase model on a scale-free network and compare the results with a mean-field approximation.Comment: 7 pages, 2 figure

    On Metric Dimension of Functigraphs

    Full text link
    The \emph{metric dimension} of a graph GG, denoted by dim(G)\dim(G), is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let G1G_1 and G2G_2 be disjoint copies of a graph GG and let f:V(G1)V(G2)f: V(G_1) \rightarrow V(G_2) be a function. Then a \emph{functigraph} C(G,f)=(V,E)C(G, f)=(V, E) has the vertex set V=V(G1)V(G2)V=V(G_1) \cup V(G_2) and the edge set E=E(G1)E(G2){uvv=f(u)}E=E(G_1) \cup E(G_2) \cup \{uv \mid v=f(u)\}. We study how metric dimension behaves in passing from GG to C(G,f)C(G,f) by first showing that 2dim(C(G,f))2n32 \le \dim(C(G, f)) \le 2n-3, if GG is a connected graph of order n3n \ge 3 and ff is any function. We further investigate the metric dimension of functigraphs on complete graphs and on cycles.Comment: 10 pages, 7 figure
    corecore