• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.108-114
• /
• 2002

After automatic translation system for hangul's romanization based on the World Wide Web converting korean-word, sentence, document to Transliteration letters by applying algorithm based phonological principles. even though a user do not know the basic principles of the usage of Korean-to-Romanization notations, It refers to corresponding character table that has been currently adopted the authority's standard proposition for Korean-to-Romanization notation rule concurrently, add to make possible to convert a machinized code as well. It provides font for toggling Korean-English mode, insert-edit mode by assigning ASCII codes and Unicode are hardly used to them. This program could be made in C++ progamming language and Unified Modeling Language to implement various font. font-expanding and condensing. alternative printing.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.6-11
• /
• 2001

After automatic translation system for hangul's romanization based on the World Wide Web converting korean-word. sentence, document to Transliteration letters by applying algorithm based phonological principles. even though a user do not know the basic principles of the usage of Korean-to-Romanization notations. It refers to corresponding character table that has been currently adopted the authority's standard proposition for Korean-to-Romanization notation rule concurrently, add to make possible to convert a machinized code as well. It Provides font for toggling Korean-English mode, insert-edit mode by assigning ASCII codes are hardly used to them. This program could be made in C++ programming language and Unified Modeling Language to implement various font. font-expanding and condensing, alternative printing.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.3
• /
• pp.79-88
• /
• 2008

On the internet, the NIDS(Network Intrusion Detection System) has been widely deployed to protect the internal network. The NIDS builds a set of rules with analysis results on illegal packets and filters them using the rules, thus protecting the internal system. The number of rules is ever increasing as the attacks are becoming more widespread and well organized these days. As a result, the performance degradation has been found severe in the rule application fer the NIDS. In this paper, we propose a multiple pattern matching scheme to improve rule application performance. Then we compare our algorithm with Wu-Mantel algorithm which is known to do high performance multi-pattern matching.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.796-799
• /
• 2006

This paper presents a new method for automatic detection of skew in a document image using mathematical morphology. To speed up processing, we use reduced image but it still requires long time to estimate the skew angle so the proposed method works with region of interest, not with whole image. Character strings are connected by using morphological closing operation and a component labeling is used to select region of interest. The method considers the lowermost pixels of characters in candidate regions in the binary image of original document image. Experimental results shows that the proposed method is extremely fast and robust as well as independent of script forms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1986-1992
• /
• 2009

A user often searches a data by inputting a variant such as the abbreviation or substring of a word, or a misspelled word. The simple approach to the searching for variants is to build a variants dictionary. However, it entails enormous cost and time and can not handle variants by misspelling. Approximate searching, searching by approximate string matching, is a good approach to the searching. A problem in the approach is that it cannot handle variants by abbreviations. This paper propose a method for searching various variants including abbreviations and misspelled words, by using the trie indexing. First, this paper shows a variant matching method with the calculation of path weighted-metric. In addition, it provides variant searching algorithm to reduce the search time.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.528-538
• /
• 2003

A SCCRS (Speech and Character Combined Recognition System) is developed for working on mobile devices such as PDA (Personal Digital Assistants). In SCCRS, the feature extraction is separately carried out for speech and for hand-written character, but the recognition is performed in a common engine. The recognition engine employs essentially CHMM (Continuous Hidden Markov Model), which consists of variable parameter topology in order to minimize the number of model parameters and to reduce recognition time. For generating contort independent variable parameter model, we propose the SSMS(Successive State and Mixture Splitting), which gives appropriate numbers of mixture and of states through splitting in mixture domain and in time domain. The recognition results show that the proposed SSMS method can reduce the total number of GOPDD (Gaussian Output Probability Density Distribution) up to 40.0% compared to the conventional method with fixed parameter model, at the same recognition performance in speech recognition system.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.24-27
• /
• 2008

As shown in Wikipedia, tagging or cross-linking through major key-words improves the readability of documents. Recently, the Semantic Web rises the importance of social tagging as a key feature of the Web 2.0 and Tag Cloud has emerged as its crucial phenotype. In this paper we provides an efficient method of automated keyword tagging based on controlled term collection, where the computational complexity of O(mN) - if pattern matching algorithm is used - can be reduced to O(mlogN) - if Information Retrieval is adopted - while m is the length of target document and N is the total number of candidate terms to be tagged. The result shows that IR-based tagging speeds up 5.6 times compared with fast pattern matching algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3762-3774
• /
• 2000

The advances of computer hardware and information processing technologies raise the needs of multimedia information retrieval systems. Up to date. multimedia information systems have been developed for text information and image information. Nowadays. the multimedia information systems for video and audio information. especially for musical information have been grown up more and more. In recent music information retrieval systems. not only the information retrieval based on meta-information such like composer and title but also the content-based information retrieval is supported. The content-based information retrieval in music information retrieval systems utilize the similarity value between the user query and the music information stored in music database. In tbis paper. hence. we developed a similarity computation algorithm in which the pitches and lengths of each corresponding pair of notes are used as the fundamental factors for similarity computation between musical information. We also make an experiment of the proposed algorithm to validate its appropriateness. From the experimental results. the proposed similarity computation algorithm is shown to be able to correctly check whether two music files are analogous to each other or not based on melodies.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.7
• /
• pp.81-91
• /
• 2006

Recently, G.A studies have studied and demonstrated that artificial intelligence like G.A networks, G.A PI controller. The design techniques of PI controller using G.A with the newly proposed teaming algorithm was presented, and the designed controller with AC servo motor system. The goal of this paper is to design the AC servo motor using genetic algorithm and to control drive robot. And in this paper, we propose a genetic algorithms approach to find an optimal or near optimal input variables for genetic algorithm PI controller. Our experimental results show that this approach increases overall classification accuracy rate significantly. Finally, we executed for the implementation of high performance speed control system. It is used a 16-bit DSP, IMS320LF2407, which is capable of the high speed and floating point calculation.

• 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).