• 한국소음진동공학회논문집
• /
• 제22권5호
• /
• pp.413-421
• /
• 2012

In industry, various rotating machinery such as pumps, gas turbines, compressors, electric motors, generators are being used as an important facility. Due to the industrial development, they make high performance(high-speed, high-pressure). As a result, we need more intelligent and reliable machine condition diagnosis techniques. Diagnosis technique using hidden Markov-model is proposed for an accurate and predictable condition diagnosis of various rotating machines and also has overcame the speed limitation of time/frequency method by using compensation of the rotational speed of rotor. In addition, existing artificial intelligence method needs defect state data for fault detection. hidden Markov model can overcome this limitation by using normal state data alone to detect fault of rotational machinery. Vibration analysis of step-up gearbox for wind turbine was applied to the study to ensure the robustness of diagnostic performance about compensation of the rotational speed. To assure the performance of normal state alone method, hidden Markov model was applied to experimental torque measuring gearbox in this study.

• 인지과학
• /
• 제24권2호
• /
• pp.95-109
• /
• 2013

본 논문에서는 제한된 자원을 사용하는 기기에 적합한 경량화된 한국어 형태소 분석 및 품사 부착 방법을 제안한다. 관련된 초기 연구로는 규칙에 기반을 둔 방법들이 적용되었으나 최근에는 통계에 기반을 둔 방법들을 중심으로 연구되고 있다. 계산 처리 능력과 사용 가능한 메모리가 제한되는 환경에서는 규칙에 기반을 둔 방법보다 상대적으로 많은 자원을 사용하는 통계에 기반을 둔 방법을 사용하여 형태소 분석 및 품사 부착을 수행하기에는 한계가 있다. 본 논문에서는 기존의 규칙에 기반을 둔 형태소 분석 방법인 좌최장일치법을 개선하여 형태소 분석을 수행하고, 통계적인 방법인 hidden Markov model을 축소하여 형태소 품사 부착을 수행한다. 제안하는 방법은 기존의 hidden Markov model을 사용한 시스템과 유사한 성능을 보여주며 소량의 메모리 사용과 월등히 빠른 속도로 형태소 분석 및 품사 부착을 수행할 수 있다.

• 한국경영과학회지
• /
• 제24권3호
• /
• pp.83-91
• /
• 1999

In order to build and manage an ATM network effectively under several types of control methods, it is necessary to estimate the performance of the equipments in various viewpoints, especially of ATM multiplexer. As for the method to model the input stream into the ATM multiplexer, many researches have been done to characterize it by, such as, fluid flow, MMPP(Markov Modulated Poisson Process), or MMDP (Markov Modulated Deterministic Process). We introduce an MRP(Markov Renewal Process) to model the input stream which has proper structure to represent the burst traffic with high correlation. In this paper, we build a model for aggregated heterogeneous ON-OFF sources of ATM traffic by MRP. We make discrete time MR/D/1/B queueing system, whose input process is the superposed MRP and present a performance analysis by finding CLP(Cell Loss Probability). A simulation is done to validate our algorithm.

• 산업경영시스템학회지
• /
• 제38권1호
• /
• pp.74-82
• /
• 2015

Two key challenges in statistical relational learning are uncertainty and complexity. Standard frameworks for handling uncertainty are probability and first-order logic respectively. A Markov logic network (MLN) is a first-order knowledge base with weights attached to each formula and is suitable for classification of dataset which have variables correlated with each other. But we need domain knowledge to construct first-order logics and a computational complexity problem arises when calculating weights of first-order logics. To overcome these problems we suggest a method to generate first-order logics and learn weights using association analysis in this study.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.455-464
• /
• 2005

In this paper, we analyze a queueing system with overload control by arrival rates. This paper is motivated by overload control to prevent congestion in telecommunication networks. The arrivals occur dependent upon queue length. In other words, if the queue length increases, the arrivals may be reduced. By considering the burstiness of traffics in telecommunication networks, we assume the arrival to be a Markov-modulated Poisson process. The analysis by the embedded Markov chain method gives to us the performance measures such as loss and delay. The effect of performance measures on system parameters also is given throughout the numerical examples.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.115-128
• /
• 2002

Hierarchical models are widely used for inference on correlated parameters as a compromise between underfitting and overfilling problems. In this paper, we take a Bayesian approach to analyzing hierarchical models and suggest a Markov chain Monte Carlo methods to get around computational difficulties in Bayesian analysis of the hierarchical models. We apply the method to a real data on smoking and lung cancer which are collected from cities in China.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2008년도 학술대회 1부
• /
• pp.499-503
• /
• 2008

In this paper, a novel human activity recognition method is proposed which utilizes independent components of activity shape information from image sequences and Hidden Markov Model (HMM) for recognition. Activities are represented by feature vectors from Independent Component Analysis (ICA) on video images, and based on these features; recognition is achieved by trained HMMs of activities. Our recognition performance has been compared to the conventional method where Principle Component Analysis (PCA) is typically used to derive activity shape features. Our results show that superior recognition is achieved with our proposed method especially for activities (e.g., skipping) that cannot be easily recognized by the conventional method.

• 한국수자원학회논문집
• /
• 제38권8호
• /
• pp.595-604
• /
• 2005

관측자료의 보완이나 확충을 위한 강수량 모의발생은 수문분석에 있어서 중요한 과제라고 할 수 있다. 강수량을 모의하는 방법은 크게 기존의 매개변수적 방법과 비매개변수적 방법 두 가지로 나눌 수 있고, 강수량 모의의 시간간격에 따라 일강수량 자료의 모의 또는 시간강수량 자료의 모의 등으로 구분할 수 있다. 지금까지, Markov모형은 일강수량 모의발생에 많이 이용되어왔다. 이러한 대부분 Markov모형들은 동질성모형으로 상태벡터를 구축하는데 있어서 자료의 크기가 작으면 모형구축의 어려움이 따르고 같은 월에 대한 상태벡터의 동질성을 가정하는 등의 문제가 있다. 실제 강수발생의 과정은 비정상적(nonstationary)이므로 이를 보완하기 위해, 된 논문에서는 일강수량을 기존의 매개변수적인 방법이 아닌 단변량과 다변량에 대하여 비매개변수적인 방법으로 접근하여 모의하는 방법에 대하여 분석하였다.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.183-187
• /
• 2005

In this paper, we propose a heuristic method to select features using a Two-Phase Markov Blanket-based (TPMB) algorithm. The first phase, filtering phase, of TPMB algorithm works by filtering the obviously redundant features. A non-linear correlation method based on Information theory is used as a metric to measure the redundancy of a feature [1]. In second phase, approximating phase, the Markov Blanket (MB) of a system is estimated by employing the concept of cross entropy to identify the MB. We perform experiments on microarray data and report two popular dataset, AML-ALL [3] and colon tumor [4], in this paper. The experimental results show that the TPMB algorithm can significantly reduce the number of features while maintaining the accuracy of the classifiers.

• 한국멀티미디어학회논문지
• /
• 제20권7호
• /
• pp.1065-1072
• /
• 2017

As smart devices and social network services (SNSs) become increasingly pervasive, individuals produce large amounts of data in real time. Accordingly, studies on unstructured data analysis are actively being conducted to solve the resultant problem of information overload and to facilitate effective data processing. Many such studies are conducted for filtering inappropriate information. In this paper, a feature-weighting method considering SNS-message features is proposed for the classification of short text messages generated on SNSs, using Markov logic networks for category inference. The performance of the proposed method is verified through a comparison with an existing frequency-based classification methods.