• Smart Media Journal
• /
• v.9 no.2
• /
• pp.33-38
• /
• 2020

Order preserving matching refers to the problem of reporting substrings of a given text where there exists order isomorphism with the pattern. In this paper, we propose a new algorithm based on filtering and evaluation. The proposed algorithm is simple and easy to implement, and runs in linear time on average. Experimental results show that it works efficiently with real world data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.415-417
• /
• 2001

인터넷의 성장에 따라, 많은 웹사이트가 생기고, 더 많은 정보들이 웹사이트에 등록되었다. 웹사이트에서 등록되는 정보가 많을수록, 사용자가 원하는 정보를 얻기가 쉽지 않다. 따라서, 사용자가 찾는 정보를 쉽게 찾을 수 있도록, 웹사이트 내에 전문(full-text) 검색엔진을 도입하기도 한다. 본 논문에서는 사용자가 자연어를 이용한 대화를 통해 웹사이트 내의 정보를 습득할 수 있도록 하는 대화형 도우미 에이전트를 위하여 한글 전처리 방법과 근사패턴매칭기법을 제안한다. 사용자가 문장을 입력하면, 동의어처리와 형태소 분석을 통해 사용자의 문장을 분석하고, 이미 작성되어 있는 지식과의 매칭을 통해 사용자에게 알맞은 대답을 제시한다. 지식은 XML 형식으로 저장되며, 사용자가 입력한 문장과 아주 똑같지 않더라도, 어느 정도의 유사도를 가지고 대답을 이끌어 낼수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.133-142
• /
• 1993

This paper prrsents shape matching of two-dimensional object. This shape matching is applied to two-dimensional simple c10sedcurves represented by polygons. A large number of shape matching procedures have proposed baseed on teh view that shape can be represented by a vector of numerical features, and that this representation can be matched using techniques from statical pattern recognition. The varieties of features that have been extracted from shapes and used to represent them are numerous. But all of these feature-based approches suffer from the shortcoming that the descriptor of a segment of a shape do not ordinarily bear any simple relations hip to the description for the entire shape. We solve the segment matching problem of shape matching, defined as the recognition of a piece of a shape as approximate match to a part of large shape, by using relaxation labeling technique.

• Korean Journal of Cognitive Science
• /
• v.13 no.4
• /
• pp.1-8
• /
• 2002

As Internet grows, many web sites have been built, therefore much information has been registered. Because the web sites have more information, it is more difficult that the user can find the information wanted. Therefore, to get information that user wants easily, the full-text engine may be embedded to the web site. This paper is about developing the help conversational agent for a user to find the information that he wants through conversation with agent. The proposed method is based on the pattern matching of artificial intelligence, not natural language processing. If a user inputs any sentence, the help conversational agent responds to the sentence through preprocessing and pattern matching with knowledge. The knowledge is built with the XML format. With the approximate pattern matching, the agent picks up the appropriate response with some degree of similarities. At the experiment, some different sentences with the same meaning have been entered, then the agent recognized them as the same pattern, and it made a correct answer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.742-746
• /
• 2010

In this paper, we propose new randomness testing methods based on approximate periods in order to improve the previous randomness testing method using exact pattern matching. Finding approximate periods of random sequences enables us to search similarly repeated parts, but it has disadvantages since it takes long time. In this paper we propose randomness testing methods whose time complexity is O($n^2$) by reducing the time complexity of computing approximate periods from O($n^3$) to O($n^2$). Moreover, we perform some experiments to compare pseudo random number generated by AES cryptographic algorithms and true random number.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.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.