نتایج جستجو برای: معادله λh

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

Journal: :Electr. Notes Theor. Comput. Sci. 2008
Herman Geuvers Freek Wiedijk

The type theory λP corresponds to the logical framework LF. In this paper we present λH, a variant of λP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a λH term is proportional to the size of the term itself. We define an erasure map from λH to λP , and show t...

2014
Alessandro Feliciello

The FINUDA experiment, carried out at the Frascati φ-factory DAΦNE, allowed to find the first experimental evidence for the existence of the neutron-rich hypernucleus ΛH by measuring in coincidence (π+,π−) pairs from the K− stop + Li → ΛH + π production reaction, followed by the ΛH → He + π− mesonic weak decay. The production rate of ΛH undergoing such a two-body π− decay turned out to be (2.9 ...

2009
Harold Simmons

Let λH be the term calculus of Howard’s system of constructive ordinals. I use this to name iteration gadgets (generalized ordinal notations). I isolate a family of higher order ordinal functions which give a partial semantics of λH. I indicate how λH provides an intrinsic measure of each ordinal below the Howard ordinal.1

ژورنال: شیمی کاربردی 2017

در این مقاله، حلالیت باکلوفن با روش وزن‌سنجی مطالعه شده است. حلالیت باکلوفن در مخلوط دوتایی (آب + 1-هگزیل-4-متیل پیریدینیوم برماید) در محدوده دمایی 293.1تا 313.1 کلوین تحت فشار اتمسفری اندازه‌گیری شد. در مخلوط دوتایی حلالیت باکلوفن با افزایش غلظت مایع‌یونی افزایش یافت. این افزایش حلالیت ناشی از برهم‌کنش‌های آب‌گریز بین باکلوفن و مایع‌یونی و تشکیل میسل می‌باشد. زیرا کاتیون مایع یونی مشابه سورفکت...

2012
M. Agnello L. Benussi M. Bertani H. C. Bhang G. Bonomi E. Botta M. Bregant T. Bressani S. Bufalino L. Busso D. Calvo P. Camerini B. Dalena F. De Mori G. D’Erasmo F. L. Fabbri A. Feliciello A. Filippi E. M. Fiore A. Fontana H. Fujioka P. Genova P. Gianotti N. Grion V. Lucherini S. Marcello N. Mirfakhrai F. Moia O. Morra T. Nagae H. Outa A. Pantaleo V. Paticchio S. Piano R. Rui G. Simonetti R. Wheadon A. Zenoni A. Gal

The FINUDA experiment at DAΦNE, Frascati, has found evidence for the neutron-rich hypernucleus ΛH studying (π , π−) pairs in coincidence from the K− stop+ 6Li→ 6 ΛH+π + production reaction followed by ΛH→ 6He+π− weak decay. The production rate of ΛH undergoing this two-body π − decay has been found to be (2.9 ± 2.0) · 10−6/K− stop. Its binding energy has been evaluated to be BΛ(ΛH) = (4.0 ± 1.1...

2006
Richard S. Falk

Conditions for Stable Approximation Schemes Basic idea: Mimic structure of continuous problem. To establish stability of continuous problem, only used last two spaces in top sequence and last three spaces in bottom sequence. Λn−1(K) dn−1 −−−→ Λn(K)→ 0 ↗ Sn−2 ↗ Sn−1 Λn−2(V) dn−2 −−−→ Λn−1(V) dn−1 −−−→ Λn(V)→ 0. Thus, look for five finite dimensional spaces connected by a similar structure, i.e.,...

2008
Ivan Landjev Assia Rousseva

Hamada [Bull. Osaka Women’s Univ. 24:1–47, 1985; Discrete Math. 116:229-268, 1993] characterized the non-weighted minihypers having parameters ( ∑h i=1 vλi+1, ∑h i=1 vλi ; t, q) with t > λ1 > λ2 > · · · > λh ≥ 0. This result has been generalized in [Des. Codes Cryptogr. 45:123-138,2007] where it was proved that a weighted ( ∑h i=1 vλi+1, ∑h i=1 vλi ; t, q)-minihyper F, with k − 1 > λ1 > λ2 > · ...

Journal: :Electr. J. Comb. 2014
Bhaswar B. Bhattacharya Sayantan Das Shirshendu Ganguly

In this paper we introduce the notion of minimum-weight edge-discriminators in hypergraphs, and study their various properties. For a hypergraph H = (V,E ), a function λ : V → Z+∪{0} is said to be an edge-discriminator onH if∑v∈Ei λ(v) > 0, for all hyperedges Ei ∈ E , and ∑ v∈Ei λ(v) 6= ∑ v∈Ej λ(v), for every two distinct hyperedges Ei, Ej ∈ E . An optimal edge-discriminator on H, to be denoted...

Journal: :Electr. J. Comb. 2017
Albert Bush Yi Zhao

For λ ∈ Z, let λ · A = {λa : a ∈ A}. Suppose r, h ∈ Z are sufficiently large and comparable to each other. We prove that if |A + A| 6 K|A| and λ1, . . . , λh 6 2r, then |λ1 ·A+ . . .+ λh ·A| 6 K |A|. This improves upon a result of Bukh who shows that |λ1 ·A+ . . .+ λh ·A| 6 K|A|. Our main technique is to combine Bukh’s idea of considering the binary expansion of λi with a result on biclique dec...

Journal: :Eur. J. Comb. 2010
Deborah King Charl J. Ras Sanming Zhou

Let h ≥ 1 be an integer. An L(h, 1, 1)-labelling of a (finite or infinite) graph is an assignment of nonnegative integers (labels) to its vertices such that adjacent vertices receive labels with difference at least h, and vertices distance 2 or 3 apart receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over a...

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

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