• 제목/요약/키워드: independent and identically distributed

검색결과 135건 처리시간 0.023초

A CHARACTERIZATION OF THE POWER FUNCTION DISTRIBUTION BY INDEPENDENT PROPERTY OF LOWER RECORD VALUES

  • Lim, Eun-Hyuk;Lee, Min-Young
    • 충청수학회지
    • /
    • 제26권2호
    • /
    • pp.269-273
    • /
    • 2013
  • We prove a characterization of the power function distribution by lower record values. We prove that $F(x)=(\frac{x}{a})^{\alpha}$ for all $x$, 0 < $x$ < $a$, ${\alpha}$ > 0 and $a$ > 0 if and only if $\frac{X_{L(n)}}{X_{L(m)}}$ and $X_{L(m)}$ are independent for $1{\leq}m$ < $n$.

STRONG LAWS OF LARGE NUMBERS FOR RANDOM UPPER-SEMICONTINUOUS FUZZY SETS

  • Kim, Yun-Kyong
    • 대한수학회보
    • /
    • 제39권3호
    • /
    • pp.511-526
    • /
    • 2002
  • In this paper, we concern with SLLN for sums Of in-dependent random upper-semicontinuous fuzzy sets. We first give a generalization of SLLN for sums of independent and level-wise identically distributed random fuzzy sets, and establish a SLLN for sums of random fuzzy sets which is independent and compactly uniformly integrable in the strong sense. As a result, a SLLN for sums of independent and strongly tight random fuzzy sets is obtained.

COMPLETE CONVERGENCE FOR ARRAYS OF ROWWISE INDEPENDENT RANDOM VARIABLES(II)

  • Sung, Soo-Hak
    • 대한수학회보
    • /
    • 제37권2호
    • /
    • pp.255-263
    • /
    • 2000
  • Let ${X_{nk}}, u_n\; \leq \;k \leq \;u_n,\; n\; \geq\; 1}$ be an array of rowwise independent, but not necessarily identically distributed, random variables with $EX_{nk}$=0 for all k and n. In this paper, we povide a domination condition under which ${\sum^{u_n}}_=u_n\; S_{nk}/n^{1/p},\; 1\; \leq\; p\;<2$ converges completely to zero.

  • PDF

Performance of Selective Decode-and-Forward Relay Networks with Partial Channel Information

  • Rui, Xianyi
    • ETRI Journal
    • /
    • 제32권1호
    • /
    • pp.139-141
    • /
    • 2010
  • In this letter, closed-form approximations for outage probability and symbol error rate are presented for a selective decode-and-forward relay network with partial channel information. An independent but not identically distributed Rayleigh fading environment is considered. Numerical and simulated results demonstrate the validity of the analytical results.

Asymptotic Relative Efficiencies of Chaudhuri′s Estimators for the Multivariate One Sample Location Problem

  • Park, Kyungmee
    • Communications for Statistical Applications and Methods
    • /
    • 제8권3호
    • /
    • pp.875-883
    • /
    • 2001
  • We derive the asymptotic relative efficiencies in two special cases of Chaudhuri's estimators for the multivariate one sample problem. And we compare those two when observations are independent and identically distributed from a family of spherically symmetric distributions including normal distributions.

  • PDF

Secrecy Performances of Multicast Underlay Cognitive Protocols with Partial Relay Selection and without Eavesdropper's Information

  • Duy, Tran Trung;Son, Pham Ngoc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4623-4643
    • /
    • 2015
  • This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.