نتایج جستجو برای: ñ

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

Journal: :The Journal of invasive cardiology 1998
Prpic Lansky Popma

Non-Q wave myocardial infarction and unstable angina remain major causes of morbidity and mortality in patients with atherosclerotic coronary artery disease. Judicious use of cardiac catheterization and coronary revascularization may further improve the prognosis of patients with these acute coronary syndromes (ACS). Patients with ACS at high risk for further cardiac events include those patien...

2016
Gianluca Rastelli

We study a quantumharmonic oscillator linearly coupled through the position operator q̂ to a first bath and through themomentumoperator p̂ to a second bath yielding anOhmic–Drude dissipation. We analyse the oscillator’sfluctuations as a function of the ratio between the strength of the two couplings, focusing in particular on the situation inwhich the two dissipative interactions are comparable. ...

2009
Beomkyu Shin

‘:r 7Hë H“Ér $ x9 •̧ J o w Ž (low-density parity-check: LDPC) ÂÒ ñ\ ¦ 6 x #Œ f” “§ ÅÒ Ão ì r1⁄2+É × æ o (orthogonal frequency division multiplexing: OFDM) r Û1⁄4%7›\"f type I ™D¥1⁄2+Ë1lx ìøÍ4Ÿ¤ כ11⁄2̈ (hybrid automatic repeat request: H-ARQ)\ ¦0Aô Ç"fÚÔáÔYUe” (subframe)F C u _ Dh–Ðî rl ï r̀¦]jîߖô Ç . e” _ _ "fÚÔáÔYUe” F C u J ‡ \@/ #ŒG V, 6 x|3⁄4Ó (channel capacity)s 9þtÃo2Ÿ¤q àԚ̧ÀÓÖ ¦ (bit ...

Journal: :CoRR 2017
Curtis G. Northcutt Tailin Wu Isaac L. Chuang

P̃ Ñ learning is the problem of binary classification when training examples may be mislabeled (flipped) uniformly with noise rate ρ1 for positive examples and ρ0 for negative examples. We propose Rank Pruning (RP) to solve P̃ Ñ learning and the open problem of estimating the noise rates. Unlike prior solutions, RP is efficient and general, requiring O(T ) for any unrestricted choice of probabili...

2006
Paul Balister Béla Bollobás Stefanie Gerke

The Generalised Randić index R−α(T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))−α where d(x) is the degree of the vertex x in T . For all α > 0, we find the minimal constant βc = βc(α) such that for all trees on at least 3 vertices R−α(T ) ≤ βc(n + 1) where n = |V (T )| is the number of vertices of T . For example, when α = 1, βc = 15 56 . This bound is sharp up to the additive...

Journal: :Journal of the American Chemical Society 2002
Ryan C Bailey Joseph T Hupp

Micropatterning of the vapochromic charge-transfer salt, [Pt(CNC6H4C10H21)4][Pd(CN)4], on transparent platforms yields transmissive chemoresponsive diffraction gratings. Exposure of the gratings to volatile organic compounds (VOCs) such as chloroform and methanol leads to VOC uptake by the porous material comprising the grating lattice or framework, and a change in the material's complex refrac...

Journal: :Journal of Graph Theory 2007
Paul N. Balister Béla Bollobás Stefanie Gerke

The Generalised Randić index R−α(T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))−α where d(x) is the degree of the vertex x in T . For all α > 0, we find the minimal constant βc = βc(α) such that for all trees on at least 3 vertices R−α(T ) ≤ βc(n + 1) where n = |V (T )| is the number of vertices of T . For example, when α = 1, βc = 15 56 . This bound is sharp up to the additive...

2007
Y. Huang A. Johansen M. W. Lee H. Saleur

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

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