a well known problem
play

! A well known problem Chart Title 2000 1500 Axis Title 1000 - PowerPoint PPT Presentation

Nov 11, 2022 •263 likes •379 views

What is the Potential Increase of the Heart Graft Pool by Cardiac Donation after Circulatory Death ? Tim Noterdaeme, O Detry, MF Hans, E Nellessen, D Ledoux, J Joris, M Meurisse, JO Defraigne Dpt of Surgery & Transplantation Dpt of

  1. What is the Potential Increase of the Heart Graft Pool by Cardiac Donation after Circulatory Death ? Tim Noterdaeme, O Detry, MF Hans, E Nellessen, D Ledoux, J Joris, M Meurisse, JO Defraigne Dpt of Surgery & Transplantation Dpt of Anaesthesiology & ICU !

  2. A well known problem Chart Title 2000 1500 Axis Title 1000 500 0 2006 2007 2008 2009 2010 2011 Waiting 904 933 989 1121 1158 1222 Heart Donors 587 597 583 580 630 592

  3. How to fill the Gap ? ! Extended criteria within donation after brain- death ? ! VAD ? ! Potentially using hearts retrieved from donation after circulatory death (DCD)?

  4. What have we done ? ! Retrospectively screen local database for potential DCD heart-donors ! From 2006-2011 ! Same inclusion criteria as DBD ! But WIT < 30 min ! WIT = (turn off ventilation " cannulation)

  5. What are the Results ? DBD Hearts 70 Others 62 DCD 70 DBD Others 107 Usable 8

  6. During the same Time ! 82 Newly listed Patients for Heart-Transplantation ! 53 Were transplanted ! 20 Died (or unlisted) ! 9 Still waiting for Transplantation

  7. Compared Timespan Population Suitable Increase in activity Liège 2006-2011 70 DCD 8 (11%) 15% Osaki et al. 2004-2006 78 DCD 12 (15%) 17% (Wisconsin) Singal et al. 2001-2003 119 DCD 14-21 (12-18%) 4-6% (GLDP)

  8. In details DBD-Hearts (70) DCD-Hearts (8) P-value Age (years) 35.6 ± 1.6 35 ± 3.4 0.89 Female (%) 31.4 25 0.71 CPR (%) 10 12.5 0.89 COD: - Anoxia 16.5 0 0.2 - Trauma 65 50 0.48 - CVA 18.5 37.5 0.21 - Other 0 12.5 BMI 23.6 ± 0.5 22.9 ± 1.3 0.66 ICU-stay (days) 3.3 ± 0.4 4.9 ± 0.6 0.19 Diuresis (ml) 3817 ± 207 3454 ± 551 0.58 Inotropic –support (%) 82.8 25 0.0015 DWIT (min) 15.1 ± 0.5 (13-17) Withdrawal phase (min) 7.0 ± 0.7 (3-10) Acirculatory phase (min) 8.1 ± 0.6 (5-10)

  9. An Interesting Finding ! DCD need significantly less inotropic support. ! In DBD, brain ischemia induces a catecholamine surge responsible for a high peripheral resistance, myocardial stunning and lesions. ! Reversible after 12-16 days ! Due to the nature of DCD, this is absent.

  10. In Summary ! 11 % of DCD are potential heart-donors ! Leading to an increase of 15 % in HT-activity ! Reduction of 40 % of death on waiting list ! Questions remaining ! Quality of the organ ? ! Initial allocation ? ! Ethical issues ?

  11. On the waiting list since 1939

Recommend

Problem-Solving with Only 28% of employers classify college graduates Think-Alouds problem

Problem-Solving with Only 28% of employers classify college graduates Think-Alouds problem

12/5/14 Analysis of the situation Problem-solving is viewed as necessary for success in STEM fields, with the American Chemical Society (ACS) going so far as to refer to problem-solving as the ultimate goal. Problem-Solving with

316 views • 4 slides
Problem Problem Problem A.R.S.S (Anonymity) AdBlock VPN DNS Crypt A.R.S.S (Reliability)

Problem Problem Problem A.R.S.S (Anonymity) AdBlock VPN DNS Crypt A.R.S.S (Reliability)

Problem Problem Problem A.R.S.S (Anonymity) AdBlock VPN DNS Crypt A.R.S.S (Reliability) OpenBSD Higher Availability IDS M:Tier A.R.S.S (Security) DNS Reshaping DNS Local Resolver NTP DMZ A.R.S.S (Stability) Packet

415 views • 16 slides
THE BIG PROBLEM Getting to know your team, the Big Problem and its Systemic Root Causes Dorica

THE BIG PROBLEM Getting to know your team, the Big Problem and its Systemic Root Causes Dorica

PHASE 1: SYSTEM CHANGE JOURNEY THE BIG PROBLEM Getting to know your team, the Big Problem and its Systemic Root Causes Dorica Dans team working for rare diseases CLARIFYING THE BIG PROBLEM 2. Consequences if problem is not solved (relevance)

179 views • 7 slides
BUFFERDeBLOAT A SURVEY OF DIFFERENT WAYS TO COUNTER-BUFFERBLOAT Problem Problem Problem

BUFFERDeBLOAT A SURVEY OF DIFFERENT WAYS TO COUNTER-BUFFERBLOAT Problem Problem Problem

BUFFERDeBLOAT A SURVEY OF DIFFERENT WAYS TO COUNTER-BUFFERBLOAT Problem Problem Problem Simulation Setup Result Analysis Suggestion Bufferbloat is the existence of excessively large (bloated) buffers in systems, AFFECTED

369 views • 26 slides
Statement Problem A: Bijection In this problem, you have to establish a bijection between

Statement Problem A: Bijection In this problem, you have to establish a bijection between

Problem A: Bijection Statement Statement Problem A: Bijection In this problem, you have to establish a bijection between combinations and pairs of a regular bracket sequence and an integer. Ivan Kazmenko (SPb SU) Problem Analysis 28.01.2020

2.1k views • 181 slides
Chapter Two Problem Solving Using Search Defining the Problem How do you represent a problem

Chapter Two Problem Solving Using Search Defining the Problem How do you represent a problem

Chapter Two Problem Solving Using Search Defining the Problem How do you represent a problem so that the computer can solve it? Even before that, how do you define the problem with enough precision so that you can figure out how to

498 views • 30 slides
Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Revised by Hankui Zhuo, March 7, 2018 Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Chapter 3 2 Problem-solving

934 views • 70 slides
Reduction Informal Definition A problem A is reducible to problem B iff the solution to problem B

Reduction Informal Definition A problem A is reducible to problem B iff the solution to problem B

Reduction Informal Definition A problem A is reducible to problem B iff the solution to problem B can be used to solve the problem A . Computability and Complexity This means that solving A cannot be more difficult than solving B . Lecture 5 In

187 views • 3 slides
Problem Definition Techniques 4. 1. K-T Problem Critical Analysis Thinking Problem

Problem Definition Techniques 4. 1. K-T Problem Critical Analysis Thinking Problem

Problem Definition Techniques 4. 1. K-T Problem Critical Analysis Thinking Problem Definition Techniques 3. 2. Statement Present / Desired Restatement State Duncker Diagram Slides mainly adapted from Dr. Foglers Strategies for

763 views • 33 slides
Last time: Problem-Solving Problem solving: Goal formulation Problem formulation

Last time: Problem-Solving Problem solving: Goal formulation Problem formulation

Last time: Problem-Solving Problem solving: Goal formulation Problem formulation (states, operators) Search for solution Problem formulation: Initial state ? ? ? ? 1 Last time: Problem-Solving Problem

361 views • 18 slides
Consciousness (cont.) Phil 255 The hard problem The hard problem is the mind - body problem

Consciousness (cont.) Phil 255 The hard problem The hard problem is the mind - body problem

Consciousness (cont.) Phil 255 The hard problem The hard problem is the mind - body problem Terminology due to renewed interest in Nagel s concerns from David Chalmers The easy problem ( which isn t so easy ) giving a scienti

411 views • 19 slides
with classical methods Visualisations Introduction The first problem Problem

with classical methods Visualisations Introduction The first problem Problem

with classical methods Visualisations Introduction The first problem Problem The second problem Given Problems Analysis Simplification Classification Discussion Complex Handling Lagrangian

689 views • 20 slides
Problem Sets E-M Reading: Problem Set 3 Forsyth &amp; Ponce 16.1, 16.2

Problem Sets E-M Reading: Problem Set 3 Forsyth &amp; Ponce 16.1, 16.2

Problem Sets E-M Reading: Problem Set 3 Forsyth &amp; Ponce 16.1, 16.2 Distributed Tuesday, 3/18. Forsyth &amp; Ponce 16.3 for challenge Due Thursday, 4/3 problem. Problem Set 4 Yair Weiss: Motion

197 views • 5 slides
Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Chapter 3 3 Problem-solving agents Restricted form of general

973 views • 64 slides
Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem

Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Chapter 3 2 Problem-solving agents Restricted form of general

1k views • 74 slides
Professor Sheena Asthana Outline Problem: what problem? Resource allocation: a brief

Professor Sheena Asthana Outline Problem: what problem? Resource allocation: a brief

Professor Sheena Asthana Outline Problem: what problem? Resource allocation: a brief overview So, are rural areas underfunded? Problem: what problem? Widespread perception that urban deprived areas have the highest needs for

1.03k views • 19 slides
The Satisfiability Problem [HMU06,Chp.10b] Satisfiability (SAT) Problem Cooks

The Satisfiability Problem [HMU06,Chp.10b] Satisfiability (SAT) Problem Cooks

The Satisfiability Problem [HMU06,Chp.10b] Satisfiability (SAT) Problem Cooks Theorem: An NP-Complete Problem Restricted SAT: CSAT, k-SAT, 3SAT 1 Satisfiability (SAT) Problem 2 Boolean Expressions Boolean, or

727 views • 57 slides
Problem Solving and Search Chapter 3 Outline Problem-solving agents Problem formulation

Problem Solving and Search Chapter 3 Outline Problem-solving agents Problem formulation

Problem Solving and Search Chapter 3 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms Problem-Solving Agents In the simplest case, an agent will: formulate (or be given) a goal and a

1.23k views • 95 slides
Our Focus: the streets in Sclessin The Problem: Low brightness The Problem: Too high, no human

Our Focus: the streets in Sclessin The Problem: Low brightness The Problem: Too high, no human

The Streets Our Focus: the streets in Sclessin The Problem: Low brightness The Problem: Too high, no human scale The Problem: Window is always closed Good CRI Sodium- Bad CRI The Problem: no face recognition ? 3 types of streets

625 views • 34 slides
CHAPTER 1 Statement of Problem and Rationale The Problem Addressed The problem of ministry I

CHAPTER 1 Statement of Problem and Rationale The Problem Addressed The problem of ministry I

1 April 22, 2017 CHAPTER 1 Statement of Problem and Rationale The Problem Addressed The problem of ministry I addressed is that many church plants fail to reach viability. Definitions for church planting viability or success

607 views • 32 slides
Is This Algorithm Fast? Topic Number 8 op c u be 8 Problem: given a problem, how fast does

Is This Algorithm Fast? Topic Number 8 op c u be 8 Problem: given a problem, how fast does

Is This Algorithm Fast? Topic Number 8 op c u be 8 Problem: given a problem, how fast does this Algorithm Analysis code solve that problem? Could try to measure the time it takes, but &quot; bit twiddling: 1. (pejorative) An exercise

396 views • 15 slides
Software Development Method 1. Specify the problem requirements 2. Analyze the problem

Software Development Method 1. Specify the problem requirements 2. Analyze the problem

Software Development Method 1. Specify the problem requirements 2. Analyze the problem Algorithms 3. Design the algorithm to solve the problem 4. Implement the algorithm 5. Test and verify the completed program 6. Maintain and update the

145 views • 3 slides
Mat 3770 Problem Bin Packing Dynamic Programming Basic Problem or Algorithm Problem

Mat 3770 Problem Bin Packing Dynamic Programming Basic Problem or Algorithm Problem

Mat 3770 Bin Packing or The Knapsack Mat 3770 Problem Bin Packing Dynamic Programming Basic Problem or Algorithm Problem Variation The Knapsack Problem Exhaustive Search Greedy Dynamic Pgmg Hierarchical Math Pgmg Spring 2014

479 views • 27 slides
More Worked Problem from Problem Set 3 Problem 4: Determine the Poisson brackets (a) { p , A x }

More Worked Problem from Problem Set 3 Problem 4: Determine the Poisson brackets (a) { p , A x }

More Worked Problem from Problem Set 3 Problem 4: Determine the Poisson brackets (a) { p , A x } and (b) { H , A x } for the 2D central force problem with p 2 p 2 2 mr 2 k r r , H = 2 m + p 2 cos mk cos + p r p sin ,

380 views • 14 slides

More recommend