Hypoperfusion is the most common event preceding the onset of multiple organ dysfunction syndrome during trauma resuscitation. Detecting subtle changes in perfusion is crucial to ensure adequate tissue oxygenation and perfusion. Traditional methods of detecting physiological changes include measurements of blood pressure, heart rate, urine output, serum levels of lactate, mixed venous oxygen sa...

In this study oesophageal photoplethysmograph data from eight patients under positive pressure ventilation was analysed to test the hypothesis that the modulations created by the ventilation in the AC PPG single could be used to estimate the venous saturation. In order to estimate the instantaneous arterial and venous saturation Smoothed-pseudo WignerVille Distribution (SPWVD) was utilised. The...

Around 10% of deep inelastic scattering (DIS) events observed at HERA at small value of the Bjorken variable x are diffractive events [1, 2], when the incoming proton stays intact losing only a small fraction xIP of its initial momentum. A large rapidity gap is formed between the scattered proton (or its low mass excitation) and the diffractive system. The ratio of diffractive to total DIS cros...

Initiation and Growth of Uroliths Urolith formation, dissolution, and prevention involve complex physical processes. Major factors include: 1) supersaturation resulting in crystal formation, 2) effects of inhibitors of crystallization and inhibitors of crystal aggregation and growth, 3) crystalloid complexors, 4) effects of promoters of crystal aggregation and growth, and 5) effects of non-crys...

We study F-saturation games, rst introduced by Füredi, Reimer and Seress [4] in 1991, and named as such by West [5]. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding g...

In this paper, we discuss the induced saturation number. It is a nice generalization of the saturation number that will allow us to consider induced subgraphs. We define the induced saturation number, indsat(n,H), to be the fewest number of gray edges in a trigraph T such that H does not appear in any realization of T , but if a black or white edge of T is flipped to gray then there exists a re...

Saturation-Based Inference Nachum Dershowitz∗ School of Computer Science Tel-Aviv University P.O. Box 39040 Ramat Aviv, Tel-Aviv 69978 Israel Email: [email protected] Claude Kirchner LORIA & INRIA 615, rue du Jardin Botanique B.P. 101 54602 Villers-lès-Nancy Cedex France [email protected]

At first sight, recursive saturation may seem an ‘unhappy marriage’ between model theory and recursion theory, as some authors put it. Nevertheless, it turns out to work wonderfully well with models of arithmetic. First and most important of all, since there are only countably many recursive sets, the number of recursive types over any infinite structure M is exactly card(M). So by an elementar...

and colleagues reasoned quite convincingly that the liberal use of supplemental oxygen, which is common in the resuscitation of critically ill patients, may be detrimental instead of benefi cial [1]. Th e Surviving Sepsis Campaign guidelines do not give specifi c recommendations about the amount of oxygen to be administered for patients with severe sepsis or septic shock; instead, they advise o...

We consider the following two-player game: Maxi and Mini start with the empty graph on n vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most k, where k ∈ N is a given parameter. The game is over when the graph is saturated and no further edge can be inserted. Maxi wants to maximize the length of the game while Mini wants to minimize ...