• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.7
• /
• pp.213-218
• /
• 2015

Given two strings X and Y (|X|=m, |Y|=n) over an alphabet ${\Sigma}$, the extended edit distance between X and Y can be computed using dynamic programming in O(mn) time and space. Recently, a parallel algorithm that takes O(m+n) time and O(mn) space using m threads to compute the extended edit distance between X and Y was presented. In this paper, we present an improved parallel algorithm using the shared memory on GPU. The experimental results show that our parallel algorithm runs about 19~25 times faster than the previous parallel algorithm.

• Smart Structures and Systems
• /
• v.20 no.5
• /
• pp.563-572
• /
• 2017

The safety of structures is closely associated with the structural out-of-plane behavior. In particular, long and slender beam structures have been increasingly used in the design and construction. Therefore, an evaluation of the lateral and torsional behavior of a structure is important for the safety of the structure during construction as well as under service conditions. The current contact measurement method using displacement meters cannot measure independent movements directly and also requires caution when installing the displacement meters. Therefore, in this study, a vision-based system was used to measure the in-plane and out-of-plane displacements of a structure. The image processing algorithm was based on reference objects, including multiple targets in Lab color space. The captured targets were synchronized using a load indicator connected wirelessly to a data logger system in the server. A laboratory beam test was carried out to compare the displacements and rotation obtained from the proposed vision-based measurement system with those from the current measurement method using string potentiometers. The test results showed that the proposed vision-based measurement system could be applied successfully and easily to evaluating both the in-plane and out-of-plane movements of a beam including twisting rotation.

• Journal of Fashion Business
• /
• v.21 no.6
• /
• pp.77-86
• /
• 2017

This study aims to explore the unethical issues in leather processing and to develop designs of leather products based on the concept of reincarnation by ecosystem circulation. The method used in this research include the review of previous literature and the design process for development fashion accessories using waste leather. The design process comprises collecting waste leather, classifying waste leather by type, color, and size, and developing leather products according to line carnation method. For this research, the material was limited to waste cowhide leather collected from leather workshops and leather product factories. The leather pieces were divided into typical and atypical types and developed leather accessories based on the leather piece's color and size. A twill brooch, four-string bracelet, a brooch using the four-stringed leather strap and mini handbag designs were developed using regular type waste leather. An armband of abstract patterns and a cellphone case with graffiti pattern using irregular type over-splitting waste leather. The environmental issues in design are observed as part of understanding the significance of this study. Development of waste leather accessory can expand the usability of the waste leather as well as increase the product value by creating limited-line editions. By understanding the role and benefits of sustainable upcycling, this research suggests an efficient way to use waste materials in fashion to coexist with the natural environment.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.23-34
• /
• 2008

The number of web service user is increasing steadily as web-based service is offered in various form. But, web service has a vulnerability such as SQL Injection, Parameter Injection and DoS attack. Therefore, it is required for us to develop Web IDS system and additionally to offer Rule-base intrusion detection/response mechanism against those attacks. However, existing Web IDS system didn't correspond properly on recent web attack mechanism because they didn't including suitable pre-processing procedure on huge web log data. Therfore, we propose an efficient web log pre-processing mechanism for enhancing rule based detection and improving the performance of web IDS base attack response system. Proposed algorithm provides both a field unit parsing and a duplicated string elimination procedure on web log data. And it is also possible for us to construct improved web IDS system.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.66-74
• /
• 1995

A 8-bit 15MHz CMOS subranging Analog-to-Digital converter for high-speed, low-power consumption applications is described. Subranging, 2 step flash, A/D converter used a new resistor string and a simple comparator architecture for the low power consumption and small chip area. Comparator exhibites 80dB loop gain, 50MHz conversion speed, 0.5mV offset and maximum error of voltage divider was 1mV. This Analog-to-Digital converter has been designed and fabricated in 1.2 m N-well CMOS technology. It consumed 150mW power at ＋5/-5V supply and delayed 65ns. The proposed Analog-to-Digital converter seems suitable for high- speed, low-power consumption, small area applications and one-chip mixed Analog- Digital system. Simulations are performed with PSPICE and a fabricated chip is tested.

• The Journal of the Korea Contents Association
• /
• v.17 no.4
• /
• pp.576-584
• /
• 2017

Unknown nouns which are not in a dictionary make problems not only morphological analysis but also almost all natural language processing area. This paper describes a recognition method for Korean unknown nouns using strings following nouns such as postposition, suffix and postposition, suffix and eomi, etc. We collect and sort words including nouns from documents and divide a word including unknown noun into two parts, candidate noun and string following the noun, by finding same prefix morphemes from more than two unknown words. We use information of strings following nouns extracted from Sejong corpus and decide unknown noun finally. We obtain 99.64% precision and 99.46% recall for unknown nouns occurred more than two forms in news of two portal sites.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.427-434
• /
• 2009

With the rapid evolution of the Internet and mobile environments, text including spelling errors such as newly-coined words and abbreviated words are widely used. These spelling errors make it difficult to develop NLP (natural language processing) applications because they decrease the readability of texts. To resolve this problem, we propose a spelling error correction model using a spelling error correction dictionary and a newspaper corpus. The proposed model has the advantage that the cost of data construction are not high because it uses a newspaper corpus, which we can easily obtain, as a training corpus. In addition, the proposed model has an advantage that additional external modules such as a morphological analyzer and a word-spacing error correction system are not required because it uses a simple string matching method based on a correction dictionary. In the experiments with a newspaper corpus and a short message corpus collected from real mobile phones, the proposed model has been shown good performances (a miss-correction rate of 7.3%, a F1-measure of 97.3%, and a false positive rate of 1.1%) in the various evaluation measures.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.583-588
• /
• 2009

Network intrusion detection system (NIDS) monitors all incoming packets in the network and detects packets that are malicious to internal system. The NIDS should also have ability to update detection rules because new attack patterns are unpredictable. Incorporating FPGAs into the NIDS is one of the best solutions that can provide both high performance and high flexibility comparing with other approaches such as software solutions. In this paper we propose and design a novel approach, prefix sharing parallel pattern matcher, that can not only minimize additional resources but also maximize the processing performance. Experimental results showed that the throughput for 16-bit input is twice larger than for 8-bit input but the used LEs/Char in FPGA increases only 1.07 times.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.444-450
• /
• 1999

This paper deals with several methods: the clustering method that uses k-means algorithm to abstract the area of characters on the image document and the distance function that suits for the HIS coordinate system to cluster the image. For the prepossessing step to recognize this, or the method of characters segmentate, the algorithm to abstract a discrete character is also proposed, using the linking picture element. This algorithm provides the feature that separates any character such as the touching or overlapped character. The methods of projecting and tracking the edge have so far been used to segment them. However, with the new method proposed here, the picture element extracts a discrete character with only one-time projection after abstracting the character string. it is possible to pull out it. dividing the area into the character and the rest (non-character). This has great significance in terms of processing color documents, not the simple binary image, and already received verification that it is more advanced than the previous document processing system.

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