jaroslav hajek and asymptotic theory of rank tests - Kybernetika

ePAPER READ

DOWNLOAD ePAPER

kybernetika.cz

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

START NOW

240 J. JURECKOVA

where a N

(i)

= a N

{, i = 1,..., N, and

a N

(l)

characteristic polynomial assignment for delay ... - Kybernetika

polynomial controller design based on flatness - Kybernetika

tuning the zhu-takaoka string matching algorithm and ... - Kybernetika

240 J. JURECKOVA where a N (i) = a N {, i = 1,..., N, and a N (l)

Jaroslav Hajek and Asymptotic Theory of Rank Tests 241 Theorem 2.2. (Asymptotic representation) Under (l)-(3) and (5), where [Nu] denotes the integer part of Nu and S N = T N + r N , (9) At T N = Y^c Ni a N ([NUi] + l), (10) i_l Er N /var T N -> 0 as N -> oo. (11) Among various possible choices of the a Ni , Hajek also considered a Ni = E((p(U!)\R N i = i) = E

Page 1: KYBERNETIKA — VOLUME 31 (1995), N
Page 5 and 6: Jaroslav Hájek and Asymptotic Theo
Page 7 and 8: Jaroslav Hájek and Asymptotic Theo
Page 9 and 10: Jaroslav Hájek and Asymptotic Theo
Page 11 and 12: Jaroslav Hájek and Asymptotic Theo

jaroslav hajek and asymptotic theory of rank tests - Kybernetika

Create successful ePaper yourself

Delete template?

Save as template?