• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

• 대한임베디드공학회논문지
• /
• 제10권5호
• /
• pp.265-272
• /
• 2015

This paper presents an improved feature extraction method to achieve a good performance in the detection of splicing forged images. Strong edges caused by the image splicing destroy the statistical dependencies between parent and child subbands in the wavelet domain. We analyze the co-occurrence probability matrix of parent and child subbands in the wavelet domain, and calculate the statistical moments from two-dimensional characteristic function of the co-occurrence matrix. The extracted features are used as the input of SVM classifier. Experimental results show that the proposed method obtains a good performance with a small number of features compared to the existing methods.

• Journal of applied mathematics & informatics
• /
• 제5권2호
• /
• pp.403-426
• /
• 1998

We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spa-tially homogeneous except for a finite number of blocks. We treat the MAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.

• 대한토목학회논문집
• /
• 제34권1호
• /
• pp.145-153
• /
• 2014

현재 국내외적으로 다양한 가뭄지수들이 개발과 더불어 가뭄평가를 위한 다양한 기준이 개발되고 있다. 가뭄지수를 이용하여 가뭄의 시작, 강도 및 종료 시점을 정의할 경우, 일반적으로 특정 기준값(threshold)에 근거한 해석이 이루어지고 있으나, 이는 실제 가뭄을 평가하는데 불확실성을 가중시키는 원인으로 작용하고 있다. 따라서 본 연구에서는 기존의 가뭄지수 기반의 가뭄판단 시 적용되어져 왔던 특정한 기준값에 근거한 해석이 아닌, 기상학적 가뭄발생의 주된 원인 중 하나인 월강수량 자료에 내재되어 있는 특징을 최대한 활용하고자 은닉 마코프 모형(Hidden Markov Model, HMM) 기반의 확률론적 가뭄해석기법을 제안하였다. 그 결과, 본 연구에서 제시한 HMM 기반의 확률론적 가뭄해석기법은 기존의 다양한 가뭄지수를 적용한 가뭄해석과 비교하여 기상학적 측면에서의 가뭄판단의 명확한 기준 제시 및 가뭄발생의 원인을 규명하는 데 있어 체계적으로 불확실성을 감안한 해석이 가능하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.265-266
• /
• 2006

In this paper, we propose an efficient rate control scheme based on the received power level to overcome a quality degradation of video under time varying channel condition caused by the movement of mobile devices. First, we statistically obtain the relation between the PLR and the received power level. With this information and the sequences of received power level, we calculate the transition probability for the Markov Channel Model. Then, with using Markov chain rule, we obtain the probability where the channel condition remains in a good state and finally find the efficient target bit rate by multiplying it by the offered bandwidth when the network access has begun. We use TMN8 to adjust the bit rate to our proposed outcome. Experimental results show that the proposed method can efficiently enhance the video quality and provide better PSNR performance than with only using TMN8 rate control method.

• 한국지진공학회논문집
• /
• 제26권5호
• /
• pp.191-202
• /
• 2022

Markov envelope as a theoretical solution of the parabolic wave equation with Markov approximation for the von Kármán type random medium is studied and approximated with the convolution of two probability density functions (pdf) of normal and gamma distributions considering the previous studies on the applications of Radiative Transfer Theory (RTT) and the analysis results of earthquake records. Through the approximation with gamma pdf, the constant shape parameter of 2 was determined regardless of the source distance r_o. This finding means that the scattering process has the property of an inhomogeneous single-scattering Poisson process, unlike the previous studies, which resulted in a homogeneous multiple-scattering Poisson process. Approximated Markov envelope can be treated as the normalized mean square (MS) envelope for ground acceleration because of the flat source Fourier spectrum. Based on such characteristics, the path duration is estimated from the approximated MS envelope and compared to the empirical formula derived by Boore and Thompson. The results clearly show that the path duration increases proportionately to r_o^1/2-r_o², and the peak value of the RMS envelope is attenuated by exp (-0.0033r_o), excluding the geometrical attenuation. The attenuation slope for r_o≤100 km is quite similar to that of effective attenuation for shallow crustal earthquakes, and it may be difficult to distinguish the contribution of intrinsic attenuation from effective attenuation. Slowly varying dispersive delay, also called the medium effect, represented by regular pdf, governs the path duration for the source distance shorter than 100 km. Moreover, the diffraction term, also called the distance effect because of scattering, fully controls the path duration beyond the source distance of 300 km and has a steep gradient compared to the medium effect. Source distance 100-300 km is a transition range of the path duration governing effect from random medium to distance. This means that the scattering may not be the prime cause of peak attenuation and envelope broadening for the source distance of less than 200 km. Furthermore, it is also shown that normal distribution is appropriate for the probability distribution of phase difference, as asserted in the previous studies.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 가을 학술발표논문집 Vol.31 No.2 (2)
• /
• pp.31-33
• /
• 2004

웹 사용에 대한 다음 요구 사항을 예측하기 위한 마이닝 방법으로 연관규칙이나 순차 패턴 등이 많이 사용되고 있지만, 이러한 방법들은 생성된 규칙들의 지지도(Support)나 신뢰도(Confidence)에 의한 예측만을 고려하기 때문에 정확한 예측을 하기 어려운 단점을 가지고 있다. 따라서, 본 논문에서는 빈도 수에 의한 Markov model을 기반으로 하여 웹 로그 파일에 저장된 사용자들의 행동 패턴에 따라 생성되어지는 여러 형태의 규칙 유형을 찾아내고, 사용 빈도 수를 이용한 전이 확률 행렬에 따른 다음 요구사항을 정확하게 예측할 수 있는 모델을 제시하고자 한다. 그 결과 여러 형태의 규칙 유형을 $K^{th}$ -order Markov 과정에서 효율적으로 발견해 낼 수 있다.

• 산업기술연구
• /
• 제23권A호
• /
• pp.41-46
• /
• 2003

Because the quality of a radio link in real environment is generally varied with time, there is a difference between the delay in the real environment and one obtained from the analytic model where a time-varying link model is not used as a link model for a Bluetooth. This paper analyzes the transmission delay of a message in the time-varying radio link model for the Bluetooth. The time-varying radio link is modeled with a two-state Markov model. The mean transmission delay of the message is analytically obtained in terms of the arrival rate of the message, the state transition probability in the Markov model, and the packet error rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2568-2584
• /
• 2015

Spectral clustering has become one of the most popular clustering approaches in recent years. Similarity graph constructed on the data is one of the key factors that influence the performance of spectral clustering. However, the similarity graphs constructed by existing methods usually contain some unreliable edges. To construct reliable similarity graph for spectral clustering, an efficient method based on Markov random walk (MRW) is proposed in this paper. In the proposed method, theMRW model is defined on the raw k-NN graph and the neighbors of each sample are determined by the probability of the MRW. Since the high order transition probabilities carry complex relationships among data, the neighbors in the graph determined by our proposed method are more reliable than those of the existing methods. Experiments are performed on the synthetic and real-world datasets for performance evaluation and comparison. The results show that the graph obtained by our proposed method reflects the structure of the data better than those of the state-of-the-art methods and can effectively improve the performance of spectral clustering.

• ETRI Journal
• /
• 제39권5호
• /
• pp.718-728
• /
• 2017

Empirical modeling of wireless fading channels using common schemes such as autoregression and the finite state Markov chain (FSMC) is investigated. The conceptual background of both channel structures and the establishment of their mutual dependence in a confined manner are presented. The novel contribution lies in the proposal of a new approach for deriving the state transition probabilities borrowed from economic disciplines, which has not been studied so far with respect to the modeling of FSMC wireless fading channels. The proposed approach is based on equal portioning of the received signal-to-noise ratio, realized by using an alternative probability construction that was initially highlighted by Tauchen. The associated statistical procedure shows that a first-order FSMC with a limited number of channel states can satisfactorily approximate fading. The computational overheads of the proposed technique are analyzed and proven to be less demanding compared to the conventional FSMC approach based on the level crossing rate. Simulations confirm the analytical results and promising performance of the new channel model based on the Tauchen approach without extra complexity costs.