• Title/Summary/Keyword: transition probabilities

Search Result 117, Processing Time 0.028 seconds

Markov Chain Properties of Sea Surface Temperature Anomalies at the Southeastern Coast of Korea (한국 남동연안 이상수온의 마르코프 연쇄 성질)

  • Kang, Yong-Q.;Gong, Yeong
    • 한국해양학회지
    • /
    • v.22 no.2
    • /
    • pp.57-62
    • /
    • 1987
  • The Markov chain properties of the sea surface temperature (SST) anomalies, namely, the dependency of the monthly SST anomaly on that of the previous month, are studied based on the SST data for 28years(1957-1984) at 5 stations in the southeastern coast of Korea. Wi classified the monthly SST anomalies at each station into the low, the normal and the high state, and computed transition probabilities between SST anomalies of two successive months The standard deviation of SST anomalies at each station is used as a reference for the classification of SST anomalies into 3states. The transition probability of the normal state to remain in the same state is about 0.8. The transition probability of the high or the low states to remain in the same state is about one half. The SST anomalies have almost no probability to transit from the high (the low) state to the low (the high) state. Statistical tests show that the Markov chain properties of SST anomalies are stationary in tine and homogeneous in space. The multi-step Markov chain analysis shows that the 'memory' of the SST anomalies at the coastal stations remains about 3 months.

  • PDF

Markov Chain Model for Synthetic Generation by Classification of Daily Precipitation Amount into Multi-State (강수계열의 상태분류에 의한 Markov 연쇄 모의발생 모형)

  • Kim, Ju-Hwan;Park, Chan-Yeong;Kang, Kwan-Won
    • Water for future
    • /
    • v.29 no.6
    • /
    • pp.179-188
    • /
    • 1996
  • The chronical sequences of daily precipitation are of great practical importance in the planning and operational processes of water resources system. A sequence of days with alternate dry day and wet day can be generated by two state Markov chain model that establish the subsequent daily state as wet or dry by previously calculated vconditional probabilities depending on the state of previous day. In this study, a synthetic generation model for obtaining the daily precipitation series is presented by classifying the precipitation amount in wet days into multi-states. To apply multi-state Markov chain model, the daily precipitation amounts for wet day are rearranged by grouping into thirty states with intervals for each state. Conditional probabilities as transition probability matrix are estimated from the computational scheme for stepping from the precipitation on one day to that on the following day. Statistical comparisons were made between the historical and synthesized chracteristics of daily precipitation series. From the results, it is shown that the proposed method is available to generate and simulate the daily precipitation series with fair accuracy and conserve the general statistical properties of historical precipitation series.

  • PDF

Time Series Representation Combining PIPs Detection and Persist Discretization Techniques for Time Series Classification (시계열 분류를 위한 PIPs 탐지와 Persist 이산화 기법들을 결합한 시계열 표현)

  • Park, Sang-Ho;Lee, Ju-Hong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.97-106
    • /
    • 2010
  • Various time series representation methods have been suggested in order to process time series data efficiently and effectively. SAX is the representative time series representation method combining segmentation and discretization techniques, which has been successfully applied to the time series classification task. But SAX requires a large number of segments in order to represent the meaningful dynamic patterns of time series accurately, since it loss the dynamic property of time series in the course of smoothing the movement of time series. Therefore, this paper suggests a new time series representation method that combines PIPs detection and Persist discretization techniques. The suggested method represents the dynamic movement of high-diemensional time series in a lower dimensional space by detecting PIPs indicating the important inflection points of time series. And it determines the optimal discretizaton ranges by applying self-transition and marginal probabilities distributions to KL divergence measure. It minimizes the information loss in process of the dimensionality reduction. The suggested method enhances the performance of time series classification task by minimizing the information loss in the course of dimensionality reduction.

Nanostructure of Optical Materials Doped with Rare-Earths: X-Ray Absorption Spectroscopy of Dy-Doped Ge-As-S Glass (희토류 첨가 광소재의 나노구조 : Dy 첨가 Ge-As-S 유리의 X-선 흡수 스펙트럼 분석)

  • Choi, Yong-Gyu;Song, Jay-Hyok;Shin, Yong-Beom;Chernov, Vladimir A.;Heo, Jong
    • Journal of the Korean Ceramic Society
    • /
    • v.43 no.3 s.286
    • /
    • pp.177-184
    • /
    • 2006
  • Dy $L_3$-edge XANES and EXAFS spectra of chalcogenide Ge-As-S glass doped with ca. 0.2 wt% dysprosium have been investigated along with some reference Dy-containing crystals. Amplitude of the white-line peak in XANES spectrum of the glass sample turns out to be stronger than that of other reference crystals, i.e., $DY_2S_3,\;Dy_2O_3\;and\;DyBr_3$. It has been verified from the Dy $L_3$-edge EXAFS spectra that a central Dy atom is surrounded by $6.7{\pm}0.5$ sulfur atoms in its first coordination shell in the Ge-As-S glass, which is relatively smaller than 7.5 of the $Dy_2S_3$ crystal. Averaged Dy-S inter-atomic-distance of the glass ($2.78{\pm}0.01{\AA}$) also turns out to be somewhat shorter than that of the $Dy_2S_3$ crystal ($2.82{\pm}0.01{\AA}$). Such nanostructural changes occurring at Dy atoms imply there being stronger covalency of Dy-S chemical bonds in the Ge-As-S glass than in the crystal counterpart. The enhanced covalency in the nanostructural environment of $Dy^{3+}$ ions inside the glass would then be responsible for optical characteristics of the $4f{\leftrightarrow}4f$ transitions of the dopants, i.e., increase of oscillator strengths and spontaneous radiative transition probabilities.

CLUSTERING DNA MICROARRAY DATA BY STOCHASTIC ALGORITHM

  • Shon, Ho-Sun;Kim, Sun-Shin;Wang, Ling;Ryu, Keun-Ho
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.438-441
    • /
    • 2007
  • Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

  • PDF

An Analysis about the Features of Mathematical Learning of Middle School Students through the Distribution Graphs of the Responses Percentages in National Assessment of Educational Achievement (학업성취도 평가에서 답지 반응률 분포 그래프를 활용한 중학생의 수학과 학업 특성 분석)

  • Jo, Yun Dong;Lee, Kwang Sang
    • Journal of Educational Research in Mathematics
    • /
    • v.25 no.1
    • /
    • pp.1-19
    • /
    • 2015
  • This paper aims to explore what we can improve in the curriculum, teaching-learning, and evaluation on the bases of the analyses of multiple-choice items set in National Assessment of Educational Achievement. For this goal, by using the distribution curves of the responses percentages, we will grasp the features of educational achievement which appear to students through an in-depth analysis about not only item itself but also the contents included in particular distracters. These analyses provide more information than the descriptive statistical values such as the mean of correct answer percentage and the discrimination of whole group and the mean of responses percentages of replies of subgroups. Because the distribution curves of the responses percentages reveal the transition from the lowest to the highest educational achievement very well. From these analyses we acquire the implications about the concept of prime factor or prime factorization, ratio(proportion) such as velocity, linear function, volume of cone, properties of solid figure, and probabilities of empty event and total event.

Multicast Coverage Prediction in OFDM-Based SFN (OFDM 기반의 SFN 환경에서의 멀티캐스트 커버리지 예측)

  • Jung, Kyung-Goo;Park, Seung-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3A
    • /
    • pp.205-214
    • /
    • 2011
  • In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

Domain Adaptation Method for LHMM-based English Part-of-Speech Tagger (LHMM기반 영어 형태소 품사 태거의 도메인 적응 방법)

  • Kwon, Oh-Woog;Kim, Young-Gil
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.10
    • /
    • pp.1000-1004
    • /
    • 2010
  • A large number of current language processing systems use a part-of-speech tagger for preprocessing. Most language processing systems required a tagger with the highest possible accuracy. Specially, the use of domain-specific advantages has become a hot issue in machine translation community to improve the translation quality. This paper addresses a method for customizing an HMM or LHMM based English tagger from general domain to specific domain. The proposed method is to semi-automatically customize the output and transition probabilities of HMM or LHMM using domain-specific raw corpus. Through the experiments customizing to Patent domain, our LHMM tagger adapted by the proposed method shows the word tagging accuracy of 98.87% and the sentence tagging accuracy of 78.5%. Also, compared with the general tagger, our tagger improved the word tagging accuracy of 2.24% (ERR: 66.4%) and the sentence tagging accuracy of 41.0% (ERR: 65.6%).

Application of Rainwater Harvesting System Reliability Model Based on Non-parametric Stochastic Daily Rainfall Generator to Haundae District of Busan (비모수적 추계학적 일 강우 발생기 기반의 빗물이용시설 신뢰도 평가모형의 부산광역시 해운대 신시가지 적용)

  • Choi, ChiHyun;Park, MooJong;Baek, ChunWoo;Kim, SangDan
    • Journal of Korean Society on Water Environment
    • /
    • v.27 no.5
    • /
    • pp.634-645
    • /
    • 2011
  • A newly developed rainwater harvesting (RWH) system reliability model is evaluated for roof area of buildings in Haeundae District of Busan. RWH system is used to supply water for toilet flushing, back garden irrigation, and air cooling. This model is portable because it is based on a non-parametric precipitation generation algorithm using a markov chain. Precipitation occurrence is simulated using transition probabilities derived for each day of the year based on the historical probability of wet and dry day state changes. Precipitation amounts are selected from a matrix of historical values within a moving 30 day window that is centered on the target day. Then, the reliability of RWH system is determined for catchment area and tank volume ranges using synthetic precipitation data. As a result, the synthetic rainfall data well reproduced the characteristics of precipitation in Busan. Also the reliabilities of RWH system for each of demands were computed to high values. Furthermore, for study area using the RWH system, reduction efficiencies for rooftop runoff inputs to the sewer system and potable water demand are evaluated for 23%, 53%, respectively.

Towards the Saturation Throughput Disparity of Flows in Directional CSMA/CA Networks: An Analytical Model

  • Fan, Jianrui;Zhao, Xinru;Wang, Wencan;Cai, Shengsuo;Zhang, Lijuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1293-1316
    • /
    • 2021
  • Using directional antennas in wireless Ad hoc networks has many superiorities, including reducing interference, extending transmission range, and increasing space division multiplexing. However, directional transmission introduces two problems: deafness and directional hidden terminals problems. We observe that these problems result in saturation throughput disparity among the competing flows in directional CSMA/CA based Ad hoc networks and bring challenges for modeling the saturation throughput of the flows. In this article, we concentrate on how to model and analyze the saturation throughput disparity of different flows in directional CSMA/CA based Ad hoc networks. We first divide the collisions occurring in the transmission process into directional instantaneous collisions and directional persistent collisions. Then we propose a four-dimensional Markov chain to analyze the transmission state for a specific node. Our model has three different kinds of processes, namely back-off process, transmission process and freezing process. Each process contains a certain amount of continuous time slots which is defined as the basic time unit of the directional CSMA/CA protocols and the time length of each slot is fixed. We characterize the collision probabilities of the node by the one-step transition probability matrix in our Markov chain model. Accordingly, we can finally deduce the saturation throughput for each directional data stream and evaluate saturation throughput disparity for a given network topology. Finally, we verify the accuracy of our model by comparing the deviation of analytical results and simulation results.