• Journal of Korean Society for Quality Management
• /
• v.31 no.4
• /
• pp.164-175
• /
• 2003

This paper investigates bootstrap confidence intervals of the process capability index(PCI) based on the expected loss derived from the empirical distribution function(EDF). The PCI based on the expected loss is too complex to derive its confidence interval analytically, so the bootstrap method is a good alternative. We propose three types of the bootstrap confidence interval; the standard bootstrap(SB), the percentile bootstrap(PB), and the acceleration biased­corrected percentile bootstrap(ABC). We also perform a comprehensive simulation study under various process distributions, in order to compare the accuracy of the coverage probability of the bootstrap confidence intervals. In most cases, the coverage probabilities of the bootstrap confidence intervals from the EDF PCI turned out to be more accurate than those from the PCI based on the normal distribution. It is expected that the bootstrap confidence intervals from the EDF PCI can be utilized in real processes where the true distribution family may not be known.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.467-475
• /
• 2011

This paper develops the noninformative priors for the stress-strength reliability from one parameter generalized exponential distributions. When this reliability is a parameter of interest, we develop the first, second order matching priors, reference priors in its order of importance in parameters and Jeffreys' prior. We reveal that these probability matching priors are not the alternative coverage probability matching prior or a highest posterior density matching prior, a cumulative distribution function matching prior. In addition, we reveal that the one-at-a-time reference prior and Jeffreys' prior are actually a second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study and a provided example.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.7
• /
• pp.73-80
• /
• 2009

This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time.

• Journal of information and communication convergence engineering
• /
• v.10 no.4
• /
• pp.329-336
• /
• 2012

For designing broadcast protocols in mobile ad hoc networks (MANETs), one of the important goals is to reduce the rebroadcast packets redundancy while reaching all the nodes in network. In this paper, we propose a probabilistic broadcasting mechanism based on selfishness and additional coverage in MANETs. Our approach dynamically adjusts the rebroadcast probability according to the extra covered area and number of neighbor nodes. By these two factors, mobile hosts can be classified into three groups: normal, low selfishness, and high selfishness groups. The nodes in the normal group forward packets for other nodes with high probability, whereas the nodes in the low selfishness group rebroadcast packets with low probability and the nodes in the high selfishness group do not rebroadcast packets. We compared our approach with simple flooding and the fixed probabilistic approach. The simulation results show that the proposed schemes can significantly reduce the number of retransmissions by up to 40% compared simple flooding and fixed probabilistic scheme without significant reduction in the network reachability and end-to-end packet delay.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1144-1147
• /
• 2013

Dual-mode terminals (DMTs) equipped with cellular and WLAN interfaces have become popular in recent years. Users of DMTs can enjoy high-speed WLAN Internet access and wide area Internet access to cellular networks. However, a DMT may consume power inefficiently when discovering a WLAN with inherently limited service coverage. In this letter, we propose to use smart WLAN discovery (SWD) to minimize the power consumption required for WLAN discovery. To minimize the power consumption of a DMT, an SWD DMT activates its WLAN interface only when the DMT transfers data within the WLAN coverage area. The simulation results of SWD show an improved power-saving performance compared to previous WLAN discovery schemes.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.1
• /
• pp.41-48
• /
• 1997

We construct the empirical Bayes(EB) confidence intervals that attain a specified level of EB coverage for the unknown scale parameter in the Weibull distribution with the known shape parameter under the type II censored data. Our general approach is to use an EB bootstrap samples introduced by Larid and Louis(1987). Also, we compare the coverage probability and the expected interval length for these bootstrap intervals with those of the naive intervals through Monte Carlo simulation.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.3
• /
• pp.763-772
• /
• 2015

In this paper, we develop the noninformative priors for the product of different powers of k means in the exponential distribution. We developed the first and second order matching priors. It turns out that the second order matching prior matches the alternative coverage probabilities, and is the highest posterior density matching prior. Also we revealed that the derived reference prior is the second order matching prior, and Jeffreys' prior and reference prior are the same. We showed that the proposed reference prior matches very well the target coverage probabilities in a frequentist sense through simulation study, and an example based on real data is given.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.349-350
• /
• 2008

Average throughput estimation of EV-DO forward link is implemented on the basis of the serving coverage area per sector instead of time consuming and complicated Monte Carlo simulation. For the implementation of this analysis function in cell planning tool, $CellTREK^{(R)}$, developed by KT, both SNR vs. DRC mapping table and receiver sensitivity are suggested as the satisfying criteria to be satisfied above each threshold level simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.1948-1957
• /
• 1996

The conformance testing of communication protocol is the process to evaluate whether the protocol implemented is identified with standard specification. By evaluating how generated test cases detect many faults, it can be used with standard estimating efficiency of conformance testing. The method that evaluates the capability of fault coverage for test cases, has been researched by mathematical analysis and simulation. In this paper, we pointed out the problem of existing method and proposed new evaluation model of fault covergage for test case which generated by foult model. Also, we analyzed the results comparing to the existing evaluation method and proved its validity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.205-210
• /
• 2004

This paper deals with rule extraction from data using rough set theory. We construct the rule base in a hierarchical granulation structure by applying core as a classification criteria at each level. When more than one core exist, the coverage is used for the selection of an appropriate one among them to increase the classification rate and accuracy. In Addition, a probabilistic approach is suggested so that the partially useful information included in inconsistent data can be contributed to knowledge reduction in order to decrease the effect of the uncertainty or vagueness of data. As a result, the proposed method yields more proper and efficient rule base in compatability and size. The simulation result shows that it gives a good performance in spite of very simple rules and short conditionals.