• Journal of the Korean Statistical Society
• /
• v.6 no.2
• /
• pp.97-102
• /
• 1977

For a sequence of Markov dependent Bernoulli trails, asymptotic normality of the number of success runs with length $r \geq 1$ is established, when the number of trials tends to infinity.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.385-391
• /
• 2003

A sequence of n Bernoulli trials which violates the constant success probability assumption is termed as "Poisson trials". In this paper, the recurrence formula for the r-th central moment of number of successes with n Poisson trials is derived. Romanovsky's method, based on the differentiation of characteristic function, is used in the derivation of recurrence formula for the central moments of conventional binomial distribution. Romanovsky's method is applied to that of Poisson trials in this paper. Some central moment calculation results are given to compare the central moments of Poisson trials with those of conventional binomial distribution.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.5
• /
• pp.887-894
• /
• 2009

The two-stage minimum risk point estimation of mean, the probability of success in a sequence of Bernoulli trials, is considered for the case where loss is taken to be symmetrized relative squared error of estimation, plus a fixed cost per observation. First order asymptotic expansions are obtained for large sample properties of two-stage procedure. Monte Carlo simulation is carried out to obtain the expected sample size that minimizes the risk and to examine its finite sample behavior.

• Journal of the Korean Statistical Society
• /
• v.6 no.1
• /
• pp.3-20
• /
• 1977

In many applications one is concerned with repeated Bernoulli trials whose parameter (success probability) is usually unknown and has to be estimated from a sample. The probability distribution and statistical inference on the repeated independent Bernoulli trials have been studied extensively for the cases of fixed sample size sampling plan, and inverse binomial sampling plan in which observations are cotinued until a pressigned number of successes are obtained. See, for example, Haldane, Girschick et al., DeGroot and Johnson and Kotz.

• Journal of Korean Society for Quality Management
• /
• v.27 no.4
• /
• pp.143-152
• /
• 1999

In Shewhart control chart, the average run length(ARL) is calculated using the mean of a conventional geometric distribution(CGD) assuming a sequence of identical and independent Bernoulli trials. In this, the success probability of CGB is the probability that any point exceeds the control limits. When the process is in-control state, there is no problem in the above assumption since the probability that any point exceeds the control limits does not change if the in-control state continues. However, if the out-of-control state begins and continues during the process, the probability of exceeding the control limits may take two forms. First, once the out-of-control state begins with exceeding probability p, it continues with the same exceeding probability p. Second, after the out-of-control state begins, the exceeding probabilities may very according to some pattern. In the first case, ARL is the mean of CGD with success probability p as usual. But in the second case, the assumption of a sequence of identical and independent Bernoulli trials is invalid and we can not use the mean of CGD as ARL. This paper concentrate on that point. By adopting one generalized binomial distribution(GBD) model that allows correlated Bernoulli trials, generalized geometric distribution(GGD) is defined and its mean is derived to find an alternative ARL when the process is in out-of-control state and the exceeding probabilities take the second form mentioned in the above. Small-scale simulation is performed to show how an alternative ARL works.

• Journal of Korean Institute of Industrial Engineers
• /
• v.1 no.1
• /
• pp.99-103
• /
• 1975

A procedure for the test of independence of the observations and the null distribution are studied for a waiting-time distribution of the number of Bernoulli trials required to obtain a preassigned number of successes under Markov dependence. Selected critical values for the test statistic are tabulated.

• Journal of Korean Society for Quality Management
• /
• v.26 no.4
• /
• pp.79-87
• /
• 1998

This paper considers the problem of testing a one-sided hypothesis under the generalized sampling plan which is defined by a sequence of independent Bernoulli trials. A certain lexicographic order is defined for the boundary points of the sampling plan. It is shown that the family of probability mass function defined on the boundary points has monotone likelihood ratio, and that the test function is uniformly most powerful.

• Journal of the Korean Statistical Society
• /
• v.33 no.1
• /
• pp.35-58
• /
• 2004

For fixed positive integers and $\textit{k}\;(n\;{\geq}\;{\textit{k}}\;+\;2)$, the exact probability distributions of non-overlapping and overlapping patterns of two failures separated by (i) exactly $textsc{k}$ successes, (ii) at least $\textit{k}$ successes and (iii) at most $\textit{k}$ successes have been obtained for Bernoulli independent and Markov dependent trials by using combinatorial technique. The waiting time distributions for the first occurrence and the $r^{th}$ (r > 1) occurrence of the patterns have also been obtained.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.7
• /
• pp.1-9
• /
• 1992

In this thesis, the trellis detection scheme is proposed to improve the error performance of the noncoherent detection in the TFM system. Trellis detection takes advantage of the trellis property of TFM-encoded signals. The trellis property is created by giving correlations among adjacent TFM-encoded signals at the transmitter. The performance of the trellis detection scheme is analyzed by means of the Bernoulli trials with the average symbol error probability, and is compared to that of the bit-by-bit detection scheme. As a result,when the SNR is below 20 dB in the Rayleigh fading and AWGN channel, the trellis detection is inferior to the bit-by-bit detections. But when SNR is above 20 dB, the trellis detection is superior to the bit-by-bit detection, and its performance enhancement is better as the SNR increases.

• Communications for Statistical Applications and Methods
• /
• v.3 no.2
• /
• pp.175-185
• /
• 1996

For the Change-point problem in a sequence of binomial variables we consider the maximum likelihood estimator (MLE) of unknown change-point. Its asymptotic distribution is quite limited in the case of binomial variables with different numver of trials at each time point. Hinkley and Hinkley (1970) gives an asymptotic distribution of the MLE for a sequence of Bernoulli random variables. To find the asymptotic distribution a numerical method such as bootstrap can be used. Another concern of our interest in the inference on the change-point and we derive confidence sets based on the liklihood ratio test(LRT). We find approximate confidence sets from the bootstrap distribution and compare the two results through an example.