• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.899-914
• /
• 2003

It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson Processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. Three generators of pseudo-random self-similar sequences, based on the FFT〔20〕, RMD〔12〕 and SRA methods〔5, 10〕, are compared and analysed in this paper. Properties of these generators were experimentally studied in the sense of their statistical accuracy and times required to produce sequences of a given (long) length. While all three generators show similar levels of accuracy of the output data (in the sense of relative accuracy of the Horst parameter), the RMD- and SRA-based generators appear to be much faster than the generator based on FFT. Our results also show that a robust method for comparative studies of self-similarity in pseudo-random sequences is needed.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.485-490
• /
• 1998

We consider a class of discrete parameter processes on a locally compact Polish space $S$ arising from successive compositions of strictly stationary Markov random maps on $S$ into itself. Sufficient conditions for the existence of the stationary solution and the weak convergence of the distributions of $\{\Gamma_n \Gamma_{n-1} \cdots \Gamma_0x \}$ are given.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.983-992
• /
• 1996

Let p(x, dy) be a transition probability function on $(S, \rho)$, where S is a complete separable metric space. Then a Markov process $X_n$ which has p(x, dy) as its transition probability may be generated by random iterations of the form $X_{n+1} = f(X_n, \varepsilon_{n+1})$, where $\varepsilon_n$ is a sequence of independent and identically distributed random variables (See, e.g., Kifer(1986), Bhattacharya and Waymire(1990)).

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.13-20
• /
• 1994

The spectrum estimation methods of random processes are expressed in this paper. Beginning with the basic theory, non-parametric and parametric methods are overviewed. As to non-parametric method, numerical calculation method is also discussed. As to parametric method, AR model is a very famous and effective model representing random process. Estimation methods of AR parameters which have been proposed are mentioned here. Wavelet analysis is a recently interested technique in signal processing. An application of wavelet analysis is also shown.

• Journal of the Korean Statistical Society
• /
• v.34 no.1
• /
• pp.61-71
• /
• 2005

A class of asymmetric ARCH processes is proposed via binary random power transformations. This class accommodates traditional nonlinear models such as threshold ARCH (Rabemanjara and Zacoian (1993)) and Box-Cox type ARCH models(Higgins and Bera (1992)). Stationarity condition of the model is addressed. Iterative least squares(ILS) and pseudo maximum like-lihood(PML) methods are discussed for estimating parameters and related algorithms are presented. Illustrative analysis for Korea Stock Prices Index (KOSPI) data is conducted.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.95-113
• /
• 2006

The data resulting from a deterministic dynamic system may often appear to be random. However, it is important to distinguish a deterministic and a random processes for statistical analysis. In this paper, we propose a nonparametric test procedure to distinguish a noisy chaos from i.i.d. random process. The proposed procedure can be easily implemented by computer. We notice that the test is very effective to identify a low dimensional chaos process in some cases.

• Journal of the Korean Statistical Society
• /
• v.11 no.2
• /
• pp.118-130
• /
• 1982

Random walks as specia Markov stochastic processes have received particular attention in recent years. Not only the applicability of the theory already developed but also its extension within the frame work of probability measures on algebraic-topological structures such as semigroups, groups and linear spaces became a new challenge for research work in the field. At the same time new insights into classical problems were obtained which in various cases lead to a more efficient presentation of the subject. Consequently the teaching of random walks at all levels should profit from the recent development.

• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.607-625
• /
• 2015

Recently, Wang et al. [Computers and Mathematics with Ap-plications 57 (2009) 1232-1248.] and Wang and Watada [Information Sci-ences 179 (2009) 4057-4069.] studied the renewal process and renewal reward process with fuzzy random inter-arrival times and rewards under the T-independence associated with any continuous Archimedean t-norm. But, their main results do not cover the classical theory of the random elementary renewal theorem and random renewal reward theorem when fuzzy random variables degenerate to random variables, and some given assumptions relate to the membership function of the fuzzy variable and the Archimedean t-norm of the results are restrictive. This paper improves the results of Wang and Watada and Wang et al. from a mathematical per-spective. We release some assumptions of the results of Wang and Watada and Wang et al. and completely generalize the classical stochastic renewal theorem and renewal rewards theorem.

• Communications of the Korean Mathematical Society
• /
• v.12 no.3
• /
• pp.725-741
• /
• 1997

This paper considers the problem of deriving exponential probability inequalities for product symmetric Poisson processes. As an application they are used to show the existence of regular version of some product process derived from L$\acute{e}$vy process.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.135-136
• /
• 2003