نتایج جستجو برای: eccentricdistance sum

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

2005
Michael Gronau

A sum rule relation is proposed for direct CP asymmetries in B → Kπ decays. Leading terms are identical in the isospin symmetry limit, while subleading terms are equal in the flavor SU(3) and heavy quark limits. The sum rule predicts ACP(B 0 → Kπ) = −0.17±0.06 using current asymmetry measurements for the other three B → Kπ decays. A violation of the sum rule would be evidence for New Physics in...

2009
K. Slifer

We will discuss recent results for the spin structure functions, with an emphasis on g2. High precision g2 data allows for tests of the Burkhardt–Cottingham sum rule, and is needed to consistently evaluate higher twist effects.

Journal: :CoRR 2016
Vijay V. S. P. Bhattiprolu Venkatesan Guruswami Euiwoong Lee

Given a random n-variate degree-d homogeneous polynomial f , we study the following problem:

2005
Michael Gronau

A sum rule relation is proposed for direct CP asymmetries in B → Kπ decays. Leading terms are identical in the isospin symmetry limit, while subleading terms are equal in the flavor SU(3) and heavy quark limits. The sum rule predicts ACP(B 0 → Kπ) = −0.17±0.06 using current asymmetry measurements for the other three B → Kπ decays. A violation of the sum rule would be evidence for New Physics in...

Journal: :Fundam. Inform. 2012
Margaret Archibald Arnold Knopfmacher Toufik Mansour

In this paper we consider the absolute variation statistics of a composition σ = σ1 · · ·σm of n which is a measure of the sum of absolute differences between each consecutive pair of parts in a composition. This and some related statistics which we discuss, can also be interpreted within the context of bargraph polygons and bargraph walks of area n. In this context, absolute variation correspo...

Journal: :CoRR 2003
Andrej Brodnik Andreas Nilsson

We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of Ω(log n) per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related prob...

2003
Adam Szczepaniak

In this talk I will motivate the the need for the constituent quark structure. I will also summarize results from the NJL model for the composites of the constituent quark and present an alternative QCD sum rule approach.

Journal: :Inf. Process. Lett. 1993
K. Gopalakrishnan Dean G. Hoffman Douglas R. Stinson

In 1985, Chor et al 2] conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. In this note the existence of symmetric resilient functions is shown to be equivalent to the existence of a solution to a simultaneous subset sum problem. Then, using arithmetic properties of certain binomial coeecients, an innnite class of counterexamples t...

Journal: :علوم دامی ایران 0
حسین جانمحمدی دانشیار گروه علوم دامی دانشکدة کشاورزی دانشگاه تبریز حسن نصیری مقدم استاد، دانشکدة کشاورزی دانشگاه فردوسی مشهد ابوالقاسم گلیان استاد، دانشکدة کشاورزی دانشگاه فردوسی مشهد جواد پور رضا استاد گروه علوم دامی دانشکدة کشاورزی دانشگاه صنعتی اصفهان محسن دانش مسگران استاد، دانشکدة کشاورزی دانشگاه فردوسی مشهد

amino acid (aa) content of six meat and bone meal (mbm) samples was determined by ion-exchange chromatography. true aa digestibility of amino acids were determined of using precise sibbald's feeding method. metionin and lucien, with averages of 0.35 and 2.29 percent, had the lowest and highest values among essential aa of mbm samples. average content of individual aa, sum of essential and ...

Journal: :Electr. J. Comb. 1998
Tom Bohman

A set S of positive integers has distinct subset sums if there are 2|S| distinct elements of the set {∑ x∈X x : X ⊂ S } . Let f(n) = min{maxS : |S| = n and S has distinct subset sums}. Erdős conjectured f(n) ≥ c2n for some constant c. We give a construction that yields f(n) < 0.22002 · 2n for n sufficiently large. This now stands as the best known upper bound on f(n).

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

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