• Title/Summary/Keyword: 마르코프 체인

Search Result 59, Processing Time 0.028 seconds

Performance of Dynamic Spectrum Access Scheme Using Embedded Markov Chain (임베디드 마르코프 체인을 이용한 동적 스펙트럼 접속 방식의 성능 분석)

  • Lee, Yutae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2036-2040
    • /
    • 2013
  • In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

MCMC Algorithm for Dirichlet Distribution over Gridded Simplex (그리드 단체 위의 디리슐레 분포에서 마르코프 연쇄 몬테 칼로 표집)

  • Sin, Bong-Kee
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.94-99
    • /
    • 2015
  • With the recent machine learning paradigm of using nonparametric Bayesian statistics and statistical inference based on random sampling, the Dirichlet distribution finds many uses in a variety of graphical models. It is a multivariate generalization of the gamma distribution and is defined on a continuous (K-1)-simplex. This paper presents a sampling method for a Dirichlet distribution for the problem of dividing an integer X into a sequence of K integers which sum to X. The target samples in our problem are all positive integer vectors when multiplied by a given X. They must be sampled from the correspondingly gridded simplex. In this paper we develop a Markov Chain Monte Carlo (MCMC) proposal distribution for the neighborhood grid points on the simplex and then present the complete algorithm based on the Metropolis-Hastings algorithm. The proposed algorithm can be used for the Markov model, HMM, and Semi-Markov model for accurate state-duration modeling. It can also be used for the Gamma-Dirichlet HMM to model q the global-local duration distributions.

Throughput analysis of DCF protocol for packet applied to the nonmarkov process in the wireless LAN (비 마르코프 과정을 적용한 무선 LAN의 DCF 패킷 처리율 분석)

  • Ha, Eun-Sil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1410-1418
    • /
    • 2007
  • This paper analyzes the throughput of DCF protocol at the MAC layer in the 802.11a wireless LAN. The throughput of DCF protocol is related on probability of backoff, depends on retransmission of each terminal. This paper applied to nonmarcov discrete model for each terminal BER in the base station versus the packet throughput is progressing with the data rate of 6,12,24,54 Mbps, We find the fact that the less the data rate be the higher the throughput. We also find from the throughput calculation by means of traffic intensity in OFDM wireless LAN.

  • PDF

Prediction for the Spatial Distribution of Occupational Employment by Applying Markov Chain Model (마르코프 체인 모형을 이용한 직종별 취업자의 공간적 분포 변화 예측)

  • Park, So Hyun;Lee, Keumsook
    • Journal of the Korean Geographical Society
    • /
    • v.51 no.4
    • /
    • pp.525-539
    • /
    • 2016
  • This study attempts to predict the changes in the spatial distribution of occupational employment in Korea by applying Markov Chain Model. For the purpose we analyze the job-related migration pattern and estimate the transition probability with the last six years job-related migration data. By applying the Chapman-Kolmogorov equation based on the transition probability, we predict the changes in the spatial distribution of occupational employment for the next ten years. The result reveals that the employment of professional jobs is predicted to increase at every city and region except Seoul, while the employment of elementary labor jobs is predicted to increase slightly in Seoul. In particular, Gangwon-do and Chuncheongdo are predicted to increase in the employment of all occupational jobs.

  • PDF

Analysis of an Inspection Process Allowing Consecutive Two-time Testing of Products Using Markov Chains (연속되는 이중 검사를 허용하는 제품품질검사 프로세스에 대한 마르코프 체인을 이용한 분석)

  • Ko, Jeong-Han
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.6
    • /
    • pp.2452-2457
    • /
    • 2012
  • When a quality inspection process rejects a product unit, consecutive repeated inspections are sometimes conducted for the rejected unit to reduce a false reject possibility. This paper analyzes a special inspection process that allows up to two times of consecutive testing for each product to decrease type I inspection errors. This study uses a Markov chain to model the steps of the inspection process and a product unit's quality states during inspection. Historical inspection results from a company are used as the data for the Markov chain model. Using the Markov chain model and data, this study analyzes the effect of this special inspection rule on the proportion of the final quality levels and scrap rate. The results demonstrate that this inspection process of possible double testing could help reduce unnecessary rejects and consequently decrease material and production costs.

A Segmentation-Based HMM and MLP Hybrid Classifier for English Legal Word Recognition (분할기반 은닉 마르코프 모델과 다층 퍼셉트론 결합 영문수표필기단어 인식시스템)

  • 김계경;김진호;박희주
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.200-207
    • /
    • 2001
  • In this paper, we propose an HMM(Hidden Markov modeJ)-MLP(Multi-layer perceptron) hybrid model for recognizing legal words on the English bank check. We adopt an explicit segmentation-based word level architecture to implement an HMM engine with nonscaled and non-normalized symbol vectors. We also introduce an MLP for implicit segmentation-based word recognition. The final recognition model consists of a hybrid combination of the HMM and MLP with a new hybrid probability measure. The main contributions of this model are a novel design of the segmentation-based variable length HMMs and an efficient method of combining two heterogeneous recognition engines. ExperimenLs have been conducted using the legal word database of CENPARMI with encouraging results.

  • PDF

Modeling the Spatial Dynamics of Urban Green Spaces in Daegu with a CA-Markov Model (CA-Markov 모형을 이용한 대구시 녹지의 공간적 변화 모델링)

  • Seo, Hyun-Jin;Jun, Byong-Woon
    • Journal of the Korean Geographical Society
    • /
    • v.52 no.1
    • /
    • pp.123-141
    • /
    • 2017
  • This study predicted urban green spaces for 2020 based on two scenarios keeping or freeing the green-belt in the Daegu metropolitan city using a hybrid Cellular Automata(CA)-Markov model and analyzed the spatial dynamics of urban green spaces between 2009 and 2020 using a land cover change detection technique and spatial metrics. Markov chain analysis was employed to derive the transition probability for projecting land cover change into the future for 2020 based on two land cover maps in 1998 and 2009 provided by the Ministry of Environment. Multi-criteria evaluation(MCE) was adopted to develop seven suitability maps which were empirically derived in relation to the six restriction factors underlying the land cover change between the years 1998 and 2009. A hybrid CA-Markov model was then implemented to predict the land cover change over an 11 year period to 2020 based on two scenarios keeping or freeing the green-belt. The projected land cover for 2009 was cross-validated with the actual land cover in 2009 using Kappa statistics. Results show that urban green spaces will be remarkably fragmented in the suburban areas such as Dalseong-gun, Seongseo, Ansim and Chilgok in the year 2020 if the Daegu metropolitan city keeps its urbanization at current pace and in case of keeping the green-belt. In case of freeing the green-belt, urban green spaces will be fragmented on the fringes of the green-belt. It is thus required to monitor urban green spaces systematically considering the spatial change patterns identified by this study for sustainably managing them in the Daegu metropolitan city in the near future.

  • PDF

Markov Chain Analysis of Opportunistic Cognitive Radio with Primary and Secondary User's Queue (주·부사용자 Queue가 있는 기회적 인지 전파망의 Markov Chain 분석)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.9-15
    • /
    • 2010
  • Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, with the imperfect sensing of misdetection and false alarm, we quantitatively investigate the effects of primary and secondary user's queue on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. With the queue primary user's spectrum usage improved up to 18%, and the secondary user's spectrum usage improved up to 50%.

Automatic Generation of Music Accompaniment Using Reinforcement Learning (강화 학습을 통한 자동 반주 생성)

  • Kim, Na-Ri;Kwon, Ji-Yong;Yoo, Min-Joon;Lee, In-Kwon
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.739-743
    • /
    • 2008
  • In this paper, we introduce a method for automatically generating accompaniment music, according to user's input melody. The initial accompaniment chord is generated by analyzing user's input melody. Then next chords are generated continuously based on markov chain probability table in which transition probabilities of each chord are defined. The probability table is learned according to reinforcement learning mechanism using sample data of existing music. Also during playing accompaniment, the probability table is learned and refined using reward values obtained in each status to improve the behavior of playing the chord in real-time. The similarity between user's input melody and each chord is calculated using pitch class histogram. Using our method, accompaniment chords harmonized with user's melody can be generated automatically in real-time.

  • PDF