• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.535-543
• /
• 2003

A ranked set sample version of the sign test is proposed for testing hypotheses concerning the quantiles of a population characteristic by Kaur, et. al(2002). In this paper, we proposed the ranked set sample Wilcoxon signed rank test for quantiles under equal allocation. We obtain the asymptotic property and the asymptotic relative efficiencies of the proposed test statistic with respect to Wilcoxon signed rank test of simple random sample for quantiles under equal allocation. We calculate the ARE of test statistics, the proposed test statistic is more efficient than simple random sampling for all quantiles. The relative advantage of ranked set sampling is greatest at the median and tapers off in the tails.

• Communications for Statistical Applications and Methods
• /
• v.15 no.2
• /
• pp.147-159
• /
• 2008

We consider using ranked set sampling methods to draw inference about the three well-known measures of overlap, namely Matusita's measure $\rho$, Morisita's measure $\lambda$ and Weitzman's measure $\Delta$. Two exponential populations with different means are considered. Due to the difficulties of calculating the precision or the bias of the resulting estimators of overlap measures, because there are no closed-form exact formulas for their variances and their exact sampling distributions, Monte Carlo evaluations are used. Confidence intervals for those measures are also constructed via the bootstrap method and Taylor series approximation.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.2
• /
• pp.367-374
• /
• 2022

A sampling set selection algorithm is proposed to reconstruct original graph signals from the sampled signals generated on the nodes in the sampling set. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound on the reconstruction error to reduce the algorithm complexity. The metric is manipulated by using QR factorization to produce the upper triangular matrix and the analytic result is presented to enable a greedy selection of the next nodes at iterations by using the diagonal entries of the upper triangular matrix, leading to an efficient sampling process with reduced complexity. We run experiments for various graphs to demonstrate a competitive reconstruction performance of the proposed algorithm while offering the execution time about 3.5 times faster than one of the previous selection methods.

• Journal of the Korea Safety Management & Science
• /
• v.10 no.2
• /
• pp.205-210
• /
• 2008

The research interprets the principles of sampling error design for quality statistics models such as hypothesis test, interval estimation, control charts and acceptance sampling. Introducing the proper discussions of the design of significance level according to the use of hypothesis test, then it presents two methods to interpret significance by Neyman-Pearson and Fisher. Second point of the study proposes the design of confidence level for interval estimation by Bayesian confidence set, frequentist confidential set and fiducial interval. Third, the content also indicates the design of type I error and type II error considering both productivity and customer claim for control chart. Finally, the study reflects the design of producer's risk with operating charistictics curve, screening and switch rules for the purpose of purchasing and subcontraction.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.15-22
• /
• 2015

Estimating the number of distinct values is really well-known problems in network data measurement and many effective algorithms are suggested. Recent works have built upon technique called Linear Counting to solve the estimation problem for massive sets or spreaders in small memory. Sampling is used to reduce the measurement data, and it is assumed that sampling gives bad effect on the accuracy. In this paper, however, we show that the sampling on multi-set estimation sometimes gives better results for CSE with sampling than for MCSE that examines all the packets without sampling in terms of accuracy and estimation range. To prove this, we presented mathematical analysis, conducted experiment with real data, and compared the results of CSE, MCSE, and CSES.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.524-528
• /
• 1996

Quality information is known to have the characteristic of continuous distribution in many manufacturing processes. It is difficult to describe the process condition by classifying the distribution into discrete ranges which is based on the set concept. Fuzzy control chart has been developed for the control of linguistic data but it still utilizes the dichotomous notion of classical set theory. In this paper, the fuzzy sampling method is studied in order to manage the ambiguous data properly and incorporated for generating fuzzy control chart. The method is based on the fuzzy set concept and considered to be appropriate for the realization of a complete fuzzy control chart. The fuzzy control chart was compared with the conventional generalized p-chart in the sensitivity for quality distribution and robustiness against the noise. The fuzzy control chart with the fuzzy sampling method showed better characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1682-1687
• /
• 2020

We study the problem of sampling a subset of nodes of graphs for bandlimited graph signals such that the signal values on the sampled nodes provide the most information in order to reconstruct the original graph signal. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound of the reconstruction error to reduce the complexity of the selection process. We further simplify the upper bound by applying useful approximations to propose a low-weight greedy selection process that is iteratively conducted to find a suboptimal sampling set. Through the extensive experiments for various graphs, we inspect the performance of the proposed algorithm by comparing with different sampling set selection methods and show that the proposed technique runs fast while preserving a competitive reconstruction performance, yielding a practical solution to real-time applications.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1023-1030
• /
• 2020

We address the sampling set selection problem for arbitrary graph signals such that the original graph signal is reconstructed from the signal values on the nodes in the sampling set. We introduce a variation difference as a new indirect metric that measures the error of signal variations caused by sampling process without resorting to the eigen-decomposition which requires a huge computational cost. Instead of directly minimizing the reconstruction error, we propose a simple and fast greedy selection algorithm that minimizes the variation differences at each iteration and justify the proposed reasoning by showing that the principle used in the proposed process is similar to that in the previous novel technique. We run experiments to show that the proposed method yields a competitive reconstruction performance with a substantially reduced complexity for various graphs as compared with the previous selection methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.63
• /
• pp.33-43
• /
• 2001

To estimate the reliability of a large and complex network with a small variance, we propose two dynamic Monte Carlo sampling methods: the sequential minimal cut set (SMCS) and the sequential minimal path set (SMPS) methods. These methods do not require all minimal cut sets or path sets to be given in advance and do not simulate all arcs at each trial, which can decrease the valiance of network reliability. Based on the proposed methods, we develop the importance sampling estimators, the total hazard (or safety) estimator and the hazard (or safety) importance sampling estimator, and compare the performance of these simulation estimators. It is found that these estimators can significantly reduce the variance of the raw simulation estimator and the usual importance sampling estimator. Especially, the SMCS algorithm is very effective in case that the failure probabilities of arcs are low. On the contrary, the SMPS algorithm is effective in case that the success Probabilities of arcs are low.

• Communications for Statistical Applications and Methods
• /
• v.23 no.5
• /
• pp.385-397
• /
• 2016

The stress-strength models have been intensively investigated in the literature in regards of estimating the reliability ${\theta}$ = P(X > Y) using parametric and nonparametric approaches under different sampling schemes when X and Y are independent random variables. In this paper, we consider the problem of estimating ${\theta}$ when (X, Y) are dependent random variables with a bivariate underlying distribution. The empirical and kernel estimates of ${\theta}$ = P(X > Y), based on bivariate ranked set sampling (BVRSS) are considered, when (X, Y) are paired dependent continuous random variables. The estimators obtained are compared to their counterpart, bivariate simple random sampling (BVSRS), via the bias and mean square error (MSE). We demonstrate that the suggested estimators based on BVRSS are more efficient than those based on BVSRS. A simulation study is conducted to gain insight into the performance of the proposed estimators. A real data example is provided to illustrate the process.