• 한국콘텐츠학회논문지
• /
• 제8권2호
• /
• pp.33-40
• /
• 2008

스트링 패턴 매칭 알고리즘은 특정 검색어, 키워드를 검색하는 속도에서는 우수성이 다양한 방법으로 입증되었지만 다양한 패턴에 대해서는 기존의 알고리즘으로는 한계를 가지고 있다. 본 논문에서는 정규 표현식을 이용하여 특정 키워드를 포함하여 다양한 패턴의 검색어에 대해서도 효율적인 패턴 매칭을 수행하여 패턴 검색의 효율을 높이고자 한다. 이러한 연구는 기존의 단순한 키워드 매칭에 비해 각종 유해한 스트링 패턴을 효과적으로 검색할 수 있으며 스트링 패턴 매칭 속도에서도 기존의 알고리즘에 비해 우수성을 갖는다. 본 연구에서 제안한 LEX로부터 생성된 스트링 검색 엔진은 패턴 검색 속도에 대한 실험에서 패턴의 수가 1000개 이상인 경우에서는 BM&AC 알고리즘보다 효율적이지만 키워드 검색에서는 유사한 결과를 얻었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2474-2479
• /
• 2005

The control objectives in this paper are to move the gantry of a container crane to its target position and to suppress the transverse vibration of the payload. The crane system is modeled as an axially moving nonlinear string equation, in which control inputs are applied at both ends, through the gantry and the payload. The dynamics of the moving string are derived using Hamilton's principle. The Lyapunov function method is used in deriving a boundary control law, in which the Lyapunov function candidate is introduced from the total mechanical energy of the system. The performance of the proposed control law is compared with other two control algorithms available in the literature. Experimental results are given.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 추계학술대회논문집
• /
• pp.387-392
• /
• 2004

The control objectives in this paper are to move the gantry of a container crane to its target position and to suppress the transverse vibration of the payload. The crane system is modeled as an axially moving string equation, in which control inputs are applied at both ends, through the gantry and the payload. The dynamics of the moving string are derived using Hamilton's principle for systems with changing mass. The Lyapunov function method is used in deriving a boundary control law, in which the Lyapunov function candidate is introduced from the total mechanical energy of the system. The performance of the proposed control law is compared with other two control algorithms available in the literature. Experimental results are given.

• 전기학회논문지
• /
• 제66권6호
• /
• pp.955-961
• /
• 2017

In this paper, we propose a parallel approximate string matching algorithm with k-mismatches for multiple fixed-length patterns (PMASM) in DNA sequences. PMASM is developed from parallel single pattern approximate string matching algorithms to effectively calculate the Hamming distances for multiple patterns with a fixed-length. In the preprocessing phase of PMASM, all target patterns are binary encoded and stored into a look-up memory. With each input character from the input string, the Hamming distances between a substring and all patterns can be updated at the same time based on the binary encoding information in the look-up memory. Moreover, PMASM adopts graphics processing units (GPUs) to process the data computations in parallel. This paper presents three kinds of PMASM implementation methods in GPUs: thread PMASM, block-thread PMASM, and shared-mem PMASM methods. The shared-mem PMASM method gives an example to effectively make use of the GPU parallel capacity. Moreover, it also exploits special features of the CUDA (Compute Unified Device Architecture) memory structure to optimize the performance. In the experiments with DNA sequences, the proposed PMASM on GPU is 385, 77, and 64 times faster than the traditional naive algorithm, the shift-add algorithm and the single thread PMASM implementation on CPU. With the same NVIDIA GPU model, the performance of the proposed approach is enhanced up to 44% and 21%, compared with the naive, and the shift-add algorithms.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.634-639
• /
• 1998

A methodology based on the concept of variable string length GA(VGA) is developed for determining automatically the number of hyperplanes and their appropriate arrangement for modeling the class boundaries of a given training data set in RN. The genetic operators and fitness functionare newly defined to take care of the variability in chromosome length. Experimental results on different artificial and real life data sets are provided.

• 한국멀티미디어학회논문지
• /
• 제9권10호
• /
• pp.1371-1379
• /
• 2006

본 논문에서는 여러 문자열 단위로 입력되는 문자열을 하나의 문자열로 구성하기 위하여 문자열 길이 정보를 이용한 패딩 알고리즘을 제안한다. 기존의 패딩 알고리즘은 단순히 공백 문자를 삽입함으로써 실제 문자열과 패딩 문자를 구분하지 못하는 문제점을 가지고 있다. 이러한 문제점을 해결하기 위하여 본 논문에서는 패딩하는 문자열 길이를 패딩 값으로 구성한다. 이렇게 함으로써 단순히 공백 문자나 '00'을 패딩하는 경우보다 문자열과 패딩 문자를 구분하는 것이 훨씬 용이하고, 정확히 동작된다. 본 논문에서 제안하는 패딩 알고리즘은 데이터 암호화 및 복호화 알고리즘에 사용가능하다.

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

This paper presents an analysis of the power gain under partial shading conditions (PSC) when the partial shade loss is being compensated in photovoltaic(PV) system. To analyze the power gain, our study divides the mismatch loss into partial shade loss and operating point loss. Partial shade loss is defined as the power difference between a normal string and a partially shaded string at the maximum power point (MPP). Operating point loss is defined as the power loss due to the operating point shift while following the MPP of the PV array. Partial shading in a PV system affects the maximum power point tracking (MPPT) control by creating multiple MPPs, which causes mismatch losses. Several MPPT algorithms have been suggested to solve the multiple MPP problems. Among these, mismatch compensation algorithms require additional power to compensate for the mismatch loss; however, these algorithms do not consider the gain or loss between the input power required for compensation and the increased output power obtained after compensation. This paper analyzes the power gain resulting from the partial shade loss compensation under PSC, using the V-P curve of the PV system, and verifies that power gain existence by simulation and experiment.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.383-386
• /
• 2002

In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권10호
• /
• pp.1015-1019
• /
• 2010

문자열 완전일치 검색 알고리즘용 지금까지 많은 연구가 되어왔지만, EUC-KR 용 다중바이트 문자집합에 대해서는 연구원 것이 부족한 상황이다. 이 논문에서는 기존의 KMP 알고리즘을 사용할 때 EUC-KR과 같은 다중바이트 문자집합 텍스트에서 오검색이 발생할 수 있음을 보이며, 문자 단위의 접두사 함수를 적용하여 오검색이 발생하지 않도록 개선한 KMP 알고리즘을 제안한다. 또한, 널리 사용되고 있는 편집기인 Vim과 Emacs의 검색 알고리즘 및 기존의 오토마타 방식의 연구 결과에 비해 논문에서 제안한 알고리즘이 더 빠른 속도를 보이는 실험 결과를 제시한다.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.67-80
• /
• 2000

Symbiotic evolutionary algorithms, also called cooperative coevolutionary algorithms, are stochastic search algorithms that imitate the biological coevolution process through symbiotic interactions. In the algorithms, the fitness evaluation of an individual required first selecting symbiotic partners of the individual. Several partner selection strategies are provided. The goal of this study is to analyze how much partnering strategies can influence the performance of the algorithms. With two types of test-bed problems: the NKC model and the binary string covering problem, extensive experiments are carried out to compare the performance of partnering strategies, using the analysis of variance. The experimental results indicate that there does not exist statistically significant difference in their performance.