• Journal of Electrical Engineering and Technology
• /
• 제13권2호
• /
• pp.550-558
• /
• 2018

This paper presents the current limit strategy of voltage controller of delta-connected H-bridge static synchronous compensator (STATCOM) under an unbalanced voltage fault event. When phase to ground fault happens, the feasibility to heighten the magnitude of sagging phase voltage is considered by using symmetric transformation method in delta-structure STATCOM. And the efficiency to cover the maximum physical current limit of switching device is considered by using vector analysis method that calculate the zero sequence current for balancing the cluster energy in delta connected H-bridge STATCOM. The result is simple and obvious. Only positive sequence current has to be used to support the unbalanced voltage sag. Although the relationship between combination of the negative sequence voltage with current and zero sequence current is nonlinear, the more negative sequence current is supplying, the larger zero sequence current is required. From the full-model STATCOM system simulation, zero sequence current demand is identified according to a ratio of positive and negative sequence compensating current. When only positive sequence current support voltage sag, the least zero sequence current is needed.

• 방송공학회논문지
• /
• 제6권1호
• /
• pp.21-31
• /
• 2001

PN 시퀸스를 삽입하는 오디오 워터마킹은 들리지 않으면서도 강인한 워터마크를 만들기 위해 심리음향모델을 사용하여 PN 시퀸스를 변형시킨다. 하지만 워터마크를 삽입하는 모든 프레임에 대해 심리음향모델을 계산하기 위해서는 부호화 과정이 매우 복잡해지는 문제가 있다 부호화기에서 심리음향모델의 역할을 대신 하도록 만든 고정필터로 PN 시퀸스를 변형하면 훨씬 간단하 면서도 효율적인 워터마킹 시스템이 가능해진다. 본 논문에서는 고정된 지각필터를 도입한 효율적인 워터마킹 시스템을 제안한다. 심리음향모델을 대체하는 고정필터를 사용함으로써 PN 시퀸스를 들리지 않게 만들어주고 따라서 강인한 워터마크를 삽입할 수가 있다. 이와 함께 복호화기에서는 PN 시퀸스를 매칭시켜 상관도를 높여주는 보상필터 구조를 제안하여 원신호를 사용하지 않는 복호화기의 복호화 성능을 향상시켰다.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 2018년도 제30회 한글 및 한국어 정보처리 학술대회
• /
• pp.567-569
• /
• 2018

한국어의 경어체는 종결어미에 따라 구분하고, 서로 다른 경어체는 각각 고유한 경어 강도가 있다. 경어체 간의 어체 변환은 규칙기반으로 진행되어 왔다. 본 논문은 어체 변환을 위한 규칙 정의의 번거로움을 줄이고 어체 변환 데이터만을 사용한 심층 학습 기반의 어체 변환 방법을 제안한다. 본 연구는 '해요체-합쇼체' 쌍의 병렬 데이터를 이용하여 Attention-based Sequence-to-Sequence 모델을 바탕으로 한 어체 변환 모델을 학습하였다. 해당 모델을 학습하고 실험하였을 때, 정확도 91%의 우수한 성과를 얻을 수 있었다.

• 인터넷정보학회논문지
• /
• 제13권1호
• /
• pp.99-106
• /
• 2012

다수의 오브젝트로 구성된 반응형 시스템을 모델링 하거나 디자인하기 위해 외부의 입력 및 오브젝트들간의 상호작용을 분석하는 것은 중요하고 어려운 문제이다. 또한, 반응형 시스템이 요구 사항들을 모든 가능한 환경 하에서 올바르게 만족하는지를 확인하는 것은 많은 노력이 필요하다. 본 논문에서는 요구 사항들을 기존에 다양한 분야에서 사용되는 시나리오 명세 언어인 MSC(Message Sequence Chart)에 대해 구문 및 의미를 확장한 LSC(Live Sequence Chart)를 이용하여 반응형 시스템에 적합한 시나리오 기반 명세 모델을 만든다. 그리고 LTL Synthesis를 통해 각 오브젝트에 대하여 모든 요구 사항을 올바르게 만족하는 반응형 시스템 모델을 자동으로 생성한다. 마지막으로 생성된 반응형 시스템 모델로부터 의미적으로 동일한 코드로 변환하는 과정을 반복함으로써 전체 반응형 시스템을 개발하는 방법을 제안한다.

• 대한음성학회지:말소리
• /
• 제62호
• /
• pp.133-147
• /
• 2007

In this paper, we introduce a phone vector discrete HMM(PVDHMM) that decodes a phone sequence string, and demonstrates the applicability to spoken document retrieval. The PVDHMM treats a phone recognizer or large vocabulary continuous speech recognizer (LVCSR) as a vector quantizer whose codebook size is equal to the size of its phone set. We apply the PVDHMM to decode the phone sequence strings and compare the outputs with those of a continuous speech recognizer(CSR). Also we carry out spoken document retrieval experiment through PVDHMM word spotter on the phone sequence strings which are generated by phone recognizer or LVCSR and compare its results with those of retrieval through the phone-based vector space model.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2000년도 International Symposium on Bioinformatics
• /
• pp.28-31
• /
• 2000

We describe a hidden Markov model, HMMTIR, for general protein sequence based on the I-sites library of sequence-structure motifs. Unlike the linear HMMs used to model individual protein families, HMMSTR has a highly branched topology and captures recurrent local features of protein sequences and structures that transcend protein family boundaries. The model extends the I-sites library by describing the adjacencies of different sequence-structure motifs as observed in the database, and achieves a great reduction in parameters by representing overlapping motifs in a much more compact form. The HMM attributes a considerably higher probability to coding sequence than does an equivalent dipeptide model, predicts secondary structure with an accuracy of 74.6% and backbone torsion angles better than any previously reported method, and predicts the structural context of beta strands and turns with an accuracy that should be useful for tertiary structure prediction. HMMSTR has been incorporated into a public, fully-automated protein structure prediction server.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.209-215
• /
• 2014

Sequence tagging is the task of predicting frame-wise labels for a given input sequence and has important applications to diverse domains. Conventional methods such as maximum likelihood (ML) learning matches global features in empirical and model distributions, rather than local features, which directly translates into frame-wise prediction errors. Recent probabilistic sequence models such as conditional random fields (CRFs) have achieved great success in a variety of situations. In this paper, we introduce a novel discriminative CRF learning algorithm to minimize local feature mismatches. Unlike overall data fitting originating from global feature matching in ML learning, our approach reduces the total error over all frames in a sequence. We also provide an efficient gradient-based learning method via gradient forward-backward recursion, which requires the same computational complexity as ML learning. For several real-world sequence tagging problems, we empirically demonstrate that the proposed learning algorithm achieves significantly more accurate prediction performance than standard estimators.

• Communications for Statistical Applications and Methods
• /
• 제12권1호
• /
• pp.139-147
• /
• 2005

It is interesting to locate homogeneous segments within a DNA sequence. Suppose that the DNA sequence has segments within which the observations follow the same residue frequency distribution, and between which observations have different distributions. In this setting, change points correspond to the end points of these segments. This article explores the use of a binary segmentation procedure in detecting the change points in the DNA sequence. The change points are determined using a sequence of nested hypothesis tests of whether a change point exists. At each test, we compare no change-point model with a single change-point model by using the Bayesian information criterion. Thus, the method circumvents the computational complexity one would normally face in problems with an unknown number of change points. We illustrate the procedure by analyzing the genome of the bacteriophage lambda.

• 한국음향학회지
• /
• 제41권3호
• /
• pp.335-341
• /
• 2022

본 논문에서는 기존 자연어 처리 분야에서 뛰어난 성능을 보이는 트랜스포머를 하이브리드 음성인식에서의 음향모델로 사용하였다. 트랜스포머 음향모델은 attention 구조를 사용하여 시계열 데이터를 처리하며 연산량이 낮으면서 높은 성능을 보인다. 본 논문은 이러한 트랜스포머 AM에 기존 DNN-HMM 모델에서 사용하는 가중 유한 상태 전이기(weighted Finite-State Transducer, wFST) 기반 학습인 시퀀스 분류 학습의 네 가지 알고리즘을 각각 적용하여 성능을 높이는 방법을 제안한다. 또한 기존 Cross Entropy(CE)를 사용한 학습방식과 비교하여 5 %의 상대적 word error rate(WER) 감소율을 보였다.

• 한국경영과학회지
• /
• 제26권1호
• /
• pp.71-85
• /
• 2001

This paper considers a cost model for a U-shaped manufacturing cell formation which incorporates a required number of machines and various material flows together under multi-part multi-cell environment. The model is required to satisfy both the specified operation sequence of each part and the total part demand volume, which are considered to derive material handling cost in U-shaped flow line cells. In the model several cost-incurring factors including set-up for batch change-over, processing time for operations of each part, and machine failures are also considered in association with processing load and capacity of each cell. Moreover, a heuristic for a good machine layout in each cell is newly proposed based on the material handling cost of each alternative sequence layout. These all are put together to present an efficient heuristic for the U-shaped independent-cell formation problem, numerical problems are solved to illustrate the algorithm.