• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.3
• /
• pp.131-137
• /
• 2005

This paper describes a new approach to the algorithm and fundamental characteristics of the device for monitoring the leakage currents flowing through zinc oxide (ZnO) surge arresters. In order to obtain a technique for a new on-line monitoring device that can be used in the deterioration diagnosis of ZnO surge arresters, the new algorithm and on-line leakage current detection device for extracting the resistive and capacitive currents using the phase shift addition method were proposed. The computer-based on-line monitoring device can sense accurately the power frequency leakage currents flowing through ZnO surge arresters. The on-line leakage current monitoring device of ZnO surge arresters proposed in this work has the high sensitivity compared to the third harmonic leakage current detection devices. As a consequence, it was found that the proposed leakage current monitoring device would be useful for forecasting the defects and degradation of ZnO surge arresters.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.785-794
• /
• 2013

Soon after Lee and O'Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is proposed.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.623-626
• /
• 1998

NLMS algorithm is degraded by the ambient noises and the near-end speech signals. In this paper, a robust acoustic echo cancellation algorithm is proposed. To enhance the echo cancellation performance, the step size of the proposed algorithm is normalized by the sum o fthe power of the reference signals and the primary signals. as results of comparing the excess mean square errors, it is shown that the proosed algorithm can enhance the performance of cancelling the echo signals. Some experiments, which is used multimedia personal computer, are carried out. As results of experiments, the proposed algorithm shows better performance than conventional ones.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.375-383
• /
• 2003

Clustering in spatial mining is to group similar objects based on their distance, connectivity or their relative density in space. In the real world. there exist many physical objects such as rivers, lakes and highways, and their presence may affect the result of clustering. In this paper, we define distance to handle obstacles, and using that we propose the density based clustering algorithm called DBSCAN-O to handle obstacles. We show that DBSCAN-O produce different clustering results from previous density based clustering algorithm DBSCAN by our experiment result.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.9-23
• /
• 2010

In this paper we generalize large-update primal-dual interior point methods for linear optimization problems in [2] to the $P_*(\kappa)$ linear complementarity problems based on a new kernel function which includes the kernel function in [2] as a special case. The kernel function is neither self-regular nor eligible. Furthermore, we improve the complexity result in [2] from $O(\sqrt[]{n}(\log\;n)^2\;\log\;\frac{n{\mu}o}{\epsilon})$ to $O\sqrt[]{n}(\log\;n)\log(\log\;n)\log\;\frac{m{\mu}o}{\epsilon}$.

• Smart Media Journal
• /
• v.12 no.6
• /
• pp.9-14
• /
• 2023

The longest increasing subsequence is a fundamental problem which has been studied for a long time in computer science. In this paper, we consider the maximal increasing subsequence problem where the constraint is released from the longest to the maximal. For two kinds of increasing (monotone increasing and strictly increasing), we propose linear-time algorithms computing a maximal increasing subsequence of an input sequence from an alphabet Σ. Our algorithm for computing a maximal monotone increasing subsequence requires O(1) space and our algorithm for computing a maximal strictly increasing subsequence requires O(|Σ|) space.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.488-491
• /
• 2011

For given g ${\geq}$ 3, this paper provides an O(1) time and O(n) space complexity algorithm for generation of biconnected rooted colored outerplanar graphs with face size bound g, where the graphs generated contain at most n vertices. The vertices are colored in such a way that each color has a corresponding degree bound. There is also a face size bound for each inner face of the graph. No duplications or isomorphic copies of a same graph are generated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.1
• /
• pp.7-12
• /
• 2010

This paper considers a dynamic lot-sizing problem with backlogging under a minimum replenishment policy. For general concave production costs, we propose an O($T^5$) dynamic programming algorithm. If speculative motive is not allowed, in this case, a more efficient O($T^4$) algorithm is developed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1035-1040
• /
• 1989

This paper describes first Boxes algorithm as a good method to generate the pulse patterns for a pulse width modulated inverter which has a good characteristics and simple to excute. Second we present the motor analysis fed by P.W.M. inverter in steady-state operation. In this analysis we improve the MRF ( Multiple Reference Frames ) to can be easy apply to analyse all the induction motor parameters. Finally we presented all the results obtained for a 3-phase induction motor.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.958-960
• /
• 2004

접미사 배열은 긴 문자열에 대한 효율적인 패턴 검색을 위해 널리 쓰이는 자료 구조로서 지금까지 접미사 배열을 이용하여 텔스트 T 안에서 패턴 P를 검색하는 O(｜P｜ㆍ｜∑｜), O(｜P｜ㆍlog｜∑｜)시간 알고리즘(｜∑｜:알파벳 크기)들 이 발표되었다. 본 논문에서는 O(｜P｜)시간 알고리즘을 제시하고, 기존의 알고리즘들과 비교한 실험 결과를 보여준다.