• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• The Korean Journal of Applied Statistics
• /
• v.20 no.3
• /
• pp.605-618
• /
• 2007

Adaptive sampling design is the selection procedure which depends on observed values of the variable of interest. It is the method which could be applied to the rare and unapproachable population. Adaptive cluster sampling strategies are more efficient than simple random sampling on equivalent sample size. Adaptive sampling with new estimators through the Rao-blackwell method have lower variance than Horvitz-Thompson (HT) and Hansen-Hurwitz (HH). Also, to determine suitable sample size, it was used expected sample and the method finding appropriate sample size by changing initial sample size were studied.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.5
• /
• pp.981-999
• /
• 2017

In the standard control chart assuming a simple random model, we estimate the process variance without considering the between-sample variance. If the between-sample exists in the process, the process variance is under-estimated. When the process variance is under-estimated, the narrower control limits result in the excessive false alarm rate although the sensitivity of the control chart is improved. In this paper, using the variance component model to incorporate the between-sample variance, we set the control limits using both the within- and between-sample variances, and evaluate the efficiency of the control chart in terms of the average run length (ARL). Considering the most widely used control chart types such as ${\bar{X}}$, EWMA and CUSUM control charts, we compared the differences between two cases, Case I and Case II, where the between-sample variance is ignored and considered, respectively. We also considered the two cases when the process parameters are given and estimated. The results showed that the false alarm rate of Case I increased sharply as the between-sample variance increases, while that of Case II remains the same regardless of the size of the between-sample variance, as expected.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.11
• /
• pp.11-18
• /
• 2012

Debris flow deposition model is a model to predict affected areas by debris flow and random walk model (RWM) was used to build the model. Although the model was proved to be effective in the prediction of affected areas, the model has several free parameters decided experimentally. There are several well-known methods to estimate parameters, however, they cannot be applied directly to the debris flow problem due to the small size of training data. In this paper, a modified neural network, called pseudo sample neural network (PSNN), was proposed to overcome the sample size problem. In the training phase, PSNN uses pseudo samples, which are generated using the existing samples. The pseudo samples smooth the solution space and reduce the probability of falling into a local optimum. As a result, PSNN can estimate parameter more robustly than traditional neural networks do. All of these can be proved through the experiments using artificial and real data sets.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.386-396
• /
• 2020

This study aimed to examine the influences of an experience of purchasing random items and gambling behaviors among adolescents in South Korea. This study performed a series of binominal logistic regression analyses by using a sample of 17,520 adolescents from the 2018 Survey on Youth Gambling Problems. The findings are a follows. First, 49.9% of the adolescents had experience in buying random items. Second, an experience of buying random items among adolescents who have experienced betting games are related to problem gambling(OR=1.48, p<.001). Third, an experience of buying random items among adolescents who have no experienced in betting games are related to intention to participate in legalized gambling(OR=1.89, p<.001). Fourth, there were no gender differences in the influence of an experience of purchasing random items on gambling behaviors. Based on the findings, implications for addressing gambling problems among adolescents were discussed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.39-43
• /
• 2000

In this paper, we show that the fuzzy sample mean is a strong consistent estimator for the expectation of a fuzzy random set taking values in the space F(R$\^$/p) of upper semicontinuous convex fuzzy subsets of R$\^$/p with compact support.

• Communications for Statistical Applications and Methods
• /
• v.15 no.6
• /
• pp.939-946
• /
• 2008

In this paper the support vector method is presented for the probability density function estimation when the sample observations are contaminated with random noise. The performance of the procedure is compared to kernel density estimates by the simulation study.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.31-52
• /
• 1997

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.

• Communications for Statistical Applications and Methods
• /
• v.5 no.3
• /
• pp.591-597
• /
• 1998

We prove (at least empirically) that some forms of the scaled residuals calculated from i.i.d. multivariate normal random vectors are ancillary. We further show that, if the scaled residuals are ancillary, then they have the same distribution whatever form of rotation is rosed to remove sample correlations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.31-31
• /
• 1989

The Generalized Assignment Problem(GAP) determines the minimum assignment of n tasks to m workstations such that each task is assigned to exactly one workstation, subject to the capacity of a workstation. In this paper, we presented a new heuristic search algorithm for GAPs. Then we tested it on 4 different benchmark sample sets of random problems generated according to uniform distribution on a microcomputer.