• Journal of the Korean Society for information Management
• /
• v.27 no.2
• /
• pp.7-20
• /
• 2010

This study aims to provide a method of extracting the most recent information on US patent documents. An HTML paring technique that can directly connect to the US Patent and Trademark Office (USPTO) Web page is adopted. After obtaining a list of 50 documents through a keyword searching method, this study suggested an algorithm, using HTML parsing techniques, which can extract a patent number, an applicant, and the US patent class information. The study also revealed an algorithm by which we can extract both patents and subsequent patents using their closely connected relationship, that is a very distinctive characteristic of US patent documents. Although the proposed method has several limitations, it can supplement existing databases effectively in terms of timeliness and comprehensiveness.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.612-615
• /
• 1988

This paper proposes a method for analyzing the Korean inflected word in machine translation system. We define the processing rules which are useful of analyzing an irregular conjugation, pesent an parsing algorithm of noun and specifed verb and reduce the space of dictionary by the algorithm.

• Journal of Internet of Things and Convergence
• /
• v.2 no.4
• /
• pp.1-8
• /
• 2016

In order for consumers to purchase products and event products offered at each convenience store at a low price, visitors should visit the convenience store's homepage or visit the store directly. In this study, we developed an app program for each convenience store to find out which products are event products and which services are provided at certain convenience stores. Using this app, users can search real-time on various services including event information provided by various convenience stores.

• Genomics & Informatics
• /
• v.6 no.3
• /
• pp.147-152
• /
• 2008

The basic graph layout technique, one of many visualization techniques, deals with the problem of positioning vertices in a way to maximize some measure of desirability in a graph. The technique is becoming critically important for further development of the field of systems biology. However, applying the appropriate automatic graph layout techniques to the genomic scale flow of metabolism requires an understanding of the characteristics and patterns of duplicate and shared vertices, which is crucial for bioinformatics software developers. In this paper, we provide the results of parsing KEGG XML files from a graph-theoretical perspective, for future research in the area of automatic layout techniques in biological pathway domains.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2476-2495
• /
• 2021

Model-based software architecture verification and test scenarios generation are becoming more and more important in the software industry. Based on the existing temporal graph grammar, this paper proposes a new formalization method of the context-sensitive graph grammar for aiming at UML activity diagrams, which is called the UML Activity Graph Grammar, or UAGG. In the UAGG, there are new definitions and parsing algorithms. The proposed mechanisms are able to not only check the structural correctness of the UML activity diagram but also automatically generate the test scenario according to user constraints. Finally, a case study is discussed to illustrate how the UAGG and its algorithms work.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.11-25
• /
• 2012

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.439-442
• /
• 1994

본 논문은 PC 환경에서 한국어 문장구조를 분석할 수 있는 분석 기법을 제시한다. 상대적으로 어순이 자유로운 언어인 한국어의 특성에 중점을 두어, 이를 효과적으로 처리할 수 있는 분식 기법으로 shift-reduce 알고리즘을 제시한다. shift-reduce 분석 기법은 구문론 및 의미론적 하위 범주화어 의한 분석을 효율적으로 실행할 수 있도록 해주며. bottom-up과 left-right에 의한 분석 과정을 보완하여 준다.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1284-1287
• /
• 1987

A method of quantitative electrocardiogram analysis, based on concepts drawn from syntactic pattern recognition theories, is described. The algorithm can be used for removing the Interference noises and base line drift as a filter function, and for reducing the number of points representing the digitized ECG waveform. The Parsing is performed with simple finite state automata inferred by experiments and suitable to be updated during experiment execution. Two parameters are utilized for defining the noise and these make the algorithm flexible. The examples for testing the algorithm is real ECG waveforms with noise. Some experimental results lire presented.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.307-312
• /
• 2001

In this paper, we proposed the object-tracking algorithm that recognizes and estimates the any shaped and size objects using vision system. For the extraction of the object from the background of the acquired images, spatio-temporal filter and signature parsing algorithm are used. Specially, for the solution of correspondence problem of the multiple objects tracking, we compute snake energy and position information of the target objects. Through the real-time tracking experiment, we verified the effectiveness of the suggested tracking algorithm.