نتایج جستجو برای: renyi inequality

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

Journal: :J. Comb. Theory, Ser. A 1992
János Körner Gábor Simonyi

We determine the asymptotics of the largest family { C;} ~ 1 of subsets of an n-set with the property that for some bipartitions C; =A; u B; of the C/s none of the inclusions A; c C 1 , B; c C 1 occurs. Our construction implies a new lower bound on the size of qualitatively independent partition systems in the Renyi sense.

2008
A. Bialas W. Czyz

Recently suggested method of measuring Renyi entropies of multi-particle systems produced in high-energy collisions is presented in the form of a " do-list " , explaining explicitely how to perform the measurement and suggesting improvements in the treatment of the data.

2008
A. Bialas

Recently suggested method of measuring Renyi entropies of multi-particle systems produced in high-energy collisions is presented in the form of a " do-list " , explaining explicitely how to peform the measurement and suggesting improvements in the treatment of the data.

Journal: :Nanosystems: Physics, Chemistry, Mathematics 2015

Journal: :Journal of Physics A: Mathematical and General 2004

Journal: :Optical and Quantum Electronics 2021

Using the type-I SPDC process in BBO nonlinear crystal, we generate a polarization-entangled state near to maximally-entangled Bell-state with high-visibility (high-brightness) 98.50 ± 1.33% (87.71 4.45%) for HV (DA) basis. We calculate CHSH version of Bell inequality, as nonlocal realism test, and find strong violation from classical physics or any hidden variable theory, S = 2.71 0.10. Via me...

2015
Zhenhu Liang Yinghua Wang Xue Sun Duan Li Logan James Voss Jamie W. Sleigh Satoshi Hagihira Xiaoli Li

HIGHLIGHTS ► Twelve entropy indices were systematically compared in monitoring depth of anesthesia and detecting burst suppression.► Renyi permutation entropy performed best in tracking EEG changes associated with different anesthesia states.► Approximate Entropy and Sample Entropy performed best in detecting burst suppression. OBJECTIVE Entropy algorithms have been widely used in analyzing E...

2012
Mousumi Dhara Neeraj Sharma

In the recent past, various graph clustering algorithms have been proposed. Each algorithm has its own behaviour in terms of performance on a specific data set. So, it is really hard to tell which one is the most efficient and optimal. The concept of k-clique percolation technique in random networks is introduced where k is the size of the complete sub-graphs that are organized into large scale...

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

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