• Journal of the Chungcheong Mathematical Society
• /
• v.8 no.1
• /
• pp.11-17
• /
• 1995

Let ${\tau}_a$ be the first time that a perturbed random walk with extended real-valued independent and identically distributed (i.i.d.) random variables crosses a constant boundary $a{\geq}0$. For the stopping times ${\tau}_a$ we investigate some basic properties and obtain its limiting distribution as $a{\rightarrow}{\infty}$ and an upper bound of the expected stopping times E(${\tau}_a$).

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.1049-1058
• /
• 2011

This paper suggests blending time adjusting method of braking command characteristics management and Set value test for optimizing of braking deceleration to enhance the precise position stopping. This method minimizes pneumatic-braking degree deviation by characteristics management, and secures braking stability at braking. By Set value test method, braking blending characteristics are analyzed accurately. And by optimal timing tuning at braking blending, It enhanced the precise position stopping with stabilization of deceleration To demonstrate the usefulness of these suggestion, I modeled for Deajeon Line #1. And through comparison with case of related companies, the proposed method which this paper suggested is proved to be superior to others.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.207-215
• /
• 2009

In recent digital communication systems, the performance of Turbo Code used as the error correction coding method depends on the interleaver size influencing the free distance determination and iterative decoding algorithms of the turbo decoder. However, some iterations are needed to get a better performance, but these processes require large time delay. Recently, methods of reducing the number of iteration have been studied without degrading original performance. In this paper, the new method combining ME (Mean Estimate) stopping criterion with SDR (sign difference ratio) stopping criterion of previous stopping criteria is proposed, and the fact of compensating each method's missed detection is verified Faster decoding realizes that reducing the number of iterative decoding about 1~2 times by adopting our proposed method into serially concatenation of both decoder. System Environments were assumed DS-CDMA forward link system with intense MAI (multiple access interference).

• ETRI Journal
• /
• v.34 no.2
• /
• pp.272-275
• /
• 2012

This letter studies the problem of exploiting multichannel diversity in a spectrum sharing system, where the secondary user (SU) sequentially explores channel state information on the licensed channels with time consumption. To maximize the expected achievable throughput for the SU, we formulate this problem as an optimal stopping problem, whose objective is to choose the right channel to stop exploration based on the observed signal-to-noise ratio sequence. Moreover, we propose a myopic but optimal rule, called one-stage look-ahead rule, to solve the stopping problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

• Journal of information and communication convergence engineering
• /
• v.21 no.3
• /
• pp.198-207
• /
• 2023

Responding to changes in artificial intelligence models and the data environment is crucial for increasing data-learning accuracy and inference stability of industrial applications. A learning model that is overfitted to specific training data leads to poor learning performance and a deterioration in flexibility. Therefore, an early stopping technique is used to stop learning at an appropriate time. However, this technique does not consider the homogeneity and independence of the data collected by heterogeneous nodes in a differential network environment, thus resulting in low learning accuracy and degradation of system performance. In this study, the generalization performance of neural networks is maximized, whereas the effect of the homogeneity of datasets is minimized by achieving an accuracy of 99.7%. This corresponds to a decrease in delay time by a factor of 2.33 and improvement in performance by a factor of 2.5 compared with the conventional method.

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.297-309
• /
• 1999

A sequential procedure of fixed-width confidence intervals for quantiles satisfying a condition of coverage probability is provided based on recursive density estimators. It is shown that the proposed sequential procedure is asymptotically efficient. In addition, the asymptotic normality for the proposed stopping time is derived.

• Journal of the Korean Statistical Society
• /
• v.26 no.3
• /
• pp.309-317
• /
• 1997

A sequential procedure for estimating a linear function of two normal means which satisfies the two requirements, i.e. one is a condition of coverage probability, the other is a condition of $\beta$-protection, is proposed when the variances are unknown and not necessarily equal. We give asymptotic behaviors of the proposed stopping time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.12
• /
• pp.39-45
• /
• 2003

Design verification of VHDL models is getting difficult and has become a critical and time-consuming process in hardware design. Recent]y the methods using Bayesian estimation and stopping rule have been introduced to verify behavioral models and to reduce clock cycles. This paper presents two strategies to reduce clock cycles when using stopping rule in a VHDL model verification. The first method is that a semi-random variable is defined and the data that stay in the range of semi-random variable are skipped when stopping rule is running. The second one is to keep the old values of parameters when phases of stopping rule are changed. 12 VHDL models are examined to observe the effectiveness of strategies, and the simulation results show that more than about 25% of clock cycles is reduced by using the two proposed strategies with 0.6% losses of branch coverage rate.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.2
• /
• pp.165-171
• /
• 2003

Visual search in an unstructured search field is a fruitful research area for computational modeling. Search models that describe relationship between search time and probability of target detection have been used for prediction of human search performance and provision of ideal goals for search training. Until recently, however, most of models were focused on detecting a single target in a search field, although, in practice, a search field includes multiple targets and search models for multiple targets may differ from search models for a single target. This study proposed a random search model for multiple targets, generalizing a random search model for a single target which is the most typical search model. To test this model, human search data were collected and compared with the model. This model well predicted human performance in visual search for multiple targets. This paper also proposed how to determine optimal stopping time in multiple-target search.