• Journal of Korea Water Resources Association
• /
• v.48 no.12
• /
• pp.969-979
• /
• 2015

This study applied a probabilistic-based hidden Markov model (HMM) to better characterize drought patterns. In addition, a copula-based bivariate drought frequency analysis was employed to further investigate return periods of the current drought condition in year 2015. The obtained results revealed that western Kangwon area was generally more vulnerable to drought risk than eastern Kangwon area using the 40-year data. Imjin-river watershed including Cheorwon area was the most vulnerable area in terms of severe drought events. Four stations in Han-river watershed showed a joint return period exceeding 1,000 years associated with the drought duration and severity in 2014-2015. Especially, current drought status in Northern Han-river and Imjin-river watershed is most severe drought exceeding 100-year return period.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.281-293
• /
• 2023

This study addresses the optimal design methodology for switching between active electronically scanned array (AESA) radar operating modes to easily select the necessary information to reduce pilots' cognitive load and physical workload in situations where diverse and complex information is continuously provided. This study presents a procedure for defining a hidden Markov chain model (HMM) for modeling operating mode changes based on time series data on the operating modes of the AESA radar used by pilots while performing mission scenarios with inherent uncertainty. Furthermore, based on a transition probability matrix (TPM) of the HMM, this study presents a mathematical programming model for proposing the optimal structural design of AESA radar operating modes considering the manipulation method of a hands on throttle-and-stick (HOTAS). Fighter pilots select and activate the menu key for an AESA radar operation mode by manipulating the HOTAS's rotary and toggle controllers. Therefore, this study presents an optimization problem to propose the optimal structural design of the menu keys so that the pilot can easily change the menu keys to suit the operational environment.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.2
• /
• pp.164-171
• /
• 2009

This paper presents new learning algorithm of dynamic Bayesian networks (DBN) by means of constrained least square (LS) estimation algorithm and gradient descent method. First, we propose constrained LS based parameter estimation for a Markov chain (MC) model given observation data sets. Next, a gradient descent optimization is utilized for online estimation of a hidden Markov model (HMM), which is bi-linearly constructed by adding an observation variable to a MC model. We achieve numerical simulations to prove its reliability and superiority in which a series of non stationary random signal is applied for the DBN models respectively.

• Journal of KIISE:Software and Applications
• /
• v.28 no.1
• /
• pp.46-51
• /
• 2001

2D로 확장한 HMM은 다수 제안되었지만 엄밀한 의미에 있어서 2D HMM이라고 하기에 부족한 점이 많다. 본 논문에서는 기존의 랜덤 필드 모형이 아닌 새로운 2D HMM을 제안한다. 상하 및 좌우 방향의 causal chain 관계를 가정하고 완전한 격자 형성 조건을 두어 2D HMM의 평가, 매개 변수를 추정하는 알고리즘을 제시하였다. 각각의 알고리즘은 동적 프로그래밍과 최우 추정법에 근거한 것이다. 변수 추정 알고리즘은 반복적으로 이루어지며 국소 최적치에 수렴함을 보였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.285-294
• /
• 2007

In this paper, we investigate a novel online estimation algorithm for dynamic Bayesian network(DBN) parameters, given as conditional probabilities. We sequentially update the parameter adjustment rule based on observation data. We apply our algorithm to two well known representations of DBNs: to a first-order Markov Chain(MC) model and to a Hidden Markov Model(HMM). A sliding window allows efficient adaptive computation in real time. We also examine the stochastic convergence and stability of the learning algorithm.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.41-44
• /
• 2005

Cytokines play a crucial role in the immune and inflammatory responses. But because of the high evolutionary rate of these proteins, the similarity between different members of their family is very low, which makes the identification of novel members of cytokines very difficult. According to this point, a new bioinformatic strategy to identify novel cytokine of the short-chain and long-chain 4${\alpha}$ helix cytokine using hidden markov model (HMM) is proposed in the paper. As a result, two motifs were created on the two train data sets, which were used to search three different databases. In order to improve the result, a strict criterion is established to filter the novel cytokines in the subject proteins. Finally, according to their E-value, scores and the criterion, four subject proteins are predicted to be possible novel cytokines for each family respectively.

• Journal of Multimedia Information System
• /
• v.8 no.1
• /
• pp.31-34
• /
• 2021

The classical HMM is defined by a parameter triple �� = (��, A, B), where each parameter represents a collection of probability distributions: initial state, state transition and output distributions in order. This paper proposes a new stationary parameter e = (e1, e2, …, eN) where N is the number of states and et = P(|xt = i, y) for describing how an input pattern y ends in state xt = i at time t followed by nothing. It is often said that all is well that ends well. We argue here that all should end well. The paper sets the framework for the theory and presents an efficient inference and training algorithms based on dynamic programming and expectation-maximization. The proposed model is applicable to analyzing any sequential data with two or more finite segmental patterns are concatenated, each forming a context to its neighbors. Experiments on online Hangul handwriting characters have proven the effect of the proposed augmentation in terms of highly intuitive segmentation as well as recognition performance and 13.2% error rate reduction.

• Journal of Korea Multimedia Society
• /
• v.9 no.4
• /
• pp.414-420
• /
• 2006

Online character recognition techniques have been applied in many new fields of PDA, Tablet PC etc. But the recognition techniques can not use such high technologies naturally yet. Hidden Markov Model (HMM) that is much used recently requires high memory space and complex computational tasks because of comparing the input data with entire standard patterns. In this paper we propose a method to recognize the online characters more efficiently. At first we create chain-codes of learning data and recognition data in preprocessing phase, and then we compress dimensions of data using Principal Component Analysis (PCA) and recognize a character compressed data in recognition phrase. Validity of proposed method .is verified. by experiment results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2285-2301
• /
• 2012

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.