نتایج جستجو برای: 13n

تعداد نتایج: 345  

Journal: :Circulation 1999
I Yokoyama S Momomura T Ohtake K Yonekura W Yang N Kobayakawa T Aoyagi S Sugiura N Yamada K Ohtomo Y Sasaki M Omata Y Yazaki

BACKGROUND Diminished myocardial vasodilatation (MVD) in hypercholesterolemics without overt coronary stenosis has been reported. However, whether the diminished MVD of angiographically normal coronary arteries in hypercholesterolemics can be reversed after lipid-lowering therapy is not known. METHODS AND RESULTS A total of 27 hypercholesterolemics and 16 age-matched controls were studied. Al...

2004
Giovanni Manzini

In this paper we consider the linear time algorithm of Kasai et al. [6] for the computation of the Longest Common Prefix (LCP) array given the text and the suffix array. We show that this algorithm can be implemented without any auxiliary array in addition to the ones required for the input (the text and the suffix array) and the output (the LCP array). Thus, for a text of length n, we reduce t...

2017
Abdallah AlMohammad Murdoch Y Norton Andrew E Welch Peter F Sharp Stephen Walton

OBJECTIVE Perfusion-metabolism mismatch pattern on positron emission tomography (PET) predicts hibernating myocardium. We assess the ECG-gated metabolic PET as a surrogate for the perfusion-metabolism mismatch pattern on PET imaging. METHODS 13N-Ammonia (NH3) and 18F-fluorodeoxyglucose (FDG) are respectively perfusion and metabolism PET tracers. We used ECG gating to acquire FDG-PET to collec...

2005
Eugenio Picano

Background The aim of this study was to compare the results of dipyridamole-echocardiography test (DET: twodimensional echo monitoring during dipyridamole infusion up to 0.84 mg/kg over a period of 10 minutes) with both anatomic and physiological parameters of coronary artery disease severity, assessed by computer-assisted quantitative coronary arteriography, and regional coronary flow reserve,...

Journal: :Discrete Mathematics 1991
Douglas Bauer Genghua Fan Henk Jan Veldman

Bauer, D., G. Fan and H.J. Veldman, Hamiltonian properties of graphs with large neighborhood unions, Discrete Mathematics 96 (1991) 33-49. Let G be a graph of order n, a k =min{~ki=ld(vi): {V 1 . . . . . Vn} is an independent set of vertices in G}, NC=min{IN(u) 13N(v) l :uv~E(G)} and NC2=min{IN(u) t3 N(v)l: d(u, v)=2}. O.~ proved that G is hamiltonian if o2~>n ~>3, while Faudree et al. proved t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید