• 沒有找到結果。

New Advances in the diagnosis and Management of Cardioembolic Stroke.

N/A
N/A
Protected

Academic year: 2021

Share "New Advances in the diagnosis and Management of Cardioembolic Stroke."

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

New Advances in the diagnosis and Management of

Cardioembolic Stroke

張念中

Lin Mei-Shu;Chang Nen-Chung;Lee Tsung-Ming

摘要

Abstract

Cardioembolic stroke accounts for one-fifth of ischemic stroke and is severe and prone to early recurrence.

Magnetic resonance imaging, transcranial Doppler, echocardiography, 24-hour electrocardiographic monitoring

and electrophysiological study are tools for detecting cardioembolic sources. Non-valvular atrial fibrillation (AF) is

the most common cause of cardioembolic stroke and long-term anticoagulation is proved to prevent stroke. Despite

knowledge of guidelines, doctors recommend anticoagulant for less than half of patients with AF who have risk

factors for cardioembolic stroke and no contraindication for its usage. Direct thrombin inhibitor offers the advantage

of not needing prothrombin time controls and dose adjustments, but it needs large clinical trial for confirmation. Any

type of anticoagulant by any route should not be used in acute cardioembolic stroke. Stroke after percutaneous

coronary intervention (PCI), although rare, is associated with high mortality. Cardiologist must flush catheters

thoroughly, minimize catheter manipulation and use minimal contrast medium during PCI.

參考文獻

相關文件

The mean salivary level of alpha-amylase and the mean scores of state and trait anxiety in geographic tongue patients were higher than those of healthy controls.. But these

• Suppose, instead, we run the algorithm for the same running time mkT (n) once and rejects the input if it does not stop within the time bound. • By Markov’s inequality, this

• Suppose, instead, we run the algorithm for the same running time mkT (n) once and rejects the input if it does not stop within the time bound.. • By Markov’s inequality, this

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Consider an algorithm that runs C for time kT (n) and rejects the input if C does not stop within the time bound.. • By Markov’s inequality, this new algorithm runs in time kT (n)

• Suppose, instead, we run the algorithm for the same running time mkT (n) once and rejects the input if it does not stop within the time bound.. • By Markov’s inequality, this

Let us emancipate the student, and give him time and opportunity for the cultivation of his mind, so that in his pupilage he shall not be a puppet in the hands of others, but rather