• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.87-89
• /
• 2014

Aho-Corasick (AC) algorithm is a multiple patterns string matching algorithm commonly used in many applications with real-time performance requirements. In this paper, we parallelize the AC algorithm on the Intel's Many Integrated Core (MIC) Architecture, Xeon Phi Coprocessor. We propose a new technique to compress the Deterministic Finite Automaton structure which represents the set of pattern strings again which the input data is inspected for possible matches. The new technique reduces the cache misses and leads to significantly improved performance on Xeon Phi.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.750-751
• /
• 2012

스마트폰의 급속한 확산과 함께 스마트폰 애플리케이션 시장이 빠르게 성장하고 있다. 이러한 성장세에 따라 많은 애플리케이션 개발자들이 생겨났으며, 다양한 콘텐츠와 수많은 애플리케이션이 개발되어지고 있다. 여기서 우리는 모바일 기기들의 제한적인 요소를 간과해서는 안 된다. 제한적인 모바일기기에서 유저가 만족할 만할 애플리케이션을 개발하기 위해서는 효율적인 자원 활용과 함께 효율적인 프로그래밍을 해야 할 필요가 있다. 본 논문은 안드로이드 NDK 및 SDK를 기반으로 Native C와 Java를 이용해 애플리케이션을 설계하고, 각 애플리케이션간의 알고리즘 수행속도, 프로세서 점유율측면에서 성능측정 실험을 수행했다. 실험 결과를 통해 보다 우수한 성능의 안드로이드 애플리케이션 개발 방법에 관해 연구했다. 성능측정 항목으로는 JNI delay, Integer, Floating point, Memory access algorithm, String이며, 실험은 삼성 갤럭시 S1에서 수행하였다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.15-27
• /
• 1998

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.18 no.2
• /
• pp.117-122
• /
• 2013

The distributed power conversion LED driver circuit using parasitic inductance is proposed in this paper. while the conventional LED driver circuit is composed of the large size devices and heatsinks, the proposed circuit can be realized with the small sized no heatsink based. since the processing power can be effectively distributed. Also by using the wire parasitic inductance of the LED string, the proposed circuit can be implemented without external magnetic device. As a result, the proposed circuit which features the small size and volume con be realized even without LED driver module(LDM) board. since, all the device can be attached to the existing LED array Module(LAM) board. Therefore, it features that cost savings and volume reduction of circuit. To confirm the validity of the proposed circuit, theoretical analysis and experimental results from a distributed power conversion LED driver circuit prototype are presented.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.86-92
• /
• 2001

Vibrational characteristics and tension fluctuation of a translating wire in WEDM are the main problems to deteriorate the cutting accuracy and processing performance. In this paper, we analyze natural frequencies of the wire used in WEDM, both theoretically and experimentally. To reduce the tension variation of the wire, which directly affects cutting performance, we have designed a simply tension reduction device using springs and rollers. It is shown that tension fluctuation is reduced about 35% using the passive tension controller.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.722-733
• /
• 2012

Recently various studies on various applications using images taken by mobile phone cameras have been actively conducted. This study proposes a correction method for misrecognition of Korean Texts in signboard images using improved Levenshtein metric. The proposed method calculates distances of five recognized candidates and detects the best match texts from signboard text database. For verifying the efficiency of the proposed method, a database dictionary is built using 1.3 million words of nationwide signboard through removing duplicated words. We compared the proposed method to Levenshtein Metric which is one of representative text string comparison algorithms. As a result, the proposed method based on improved Levenshtein metric represents an improvement in recognition rates 31.5% on average compared to that of conventional methods.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.30-36
• /
• 1990

Context-free language can be recognized by Cocke-Younger-Kasami algorithm. This algorithm is a class of polyadic-nonserial dynamic programming technique and has the O(n**3) time complexity. In this paper, a one-dimensional systolic array for recognition of context-free language is designed. The designed triangle type two-dimensional array is projected and transformed to an one-dimensional array. The designed one-dimensional array has n processing elements and \ulcornern+1)/2\ulcorner(n-1)+3n-1 time units to process the algorithm (n is the length of input string). The time complexity is O(n\ulcorner.

• International Journal of Contents
• /
• v.5 no.3
• /
• pp.65-70
• /
• 2009

This paper describes ongoing work on the correction of adverb errors committed by Korean learners studying English as a foreign language (EFL), using an automated English writing assessment system. Adverb errors are commonly found in learners 'writings, but handling those errors rarely draws an attention in natural language processing due to complicated characteristics of adverb. To correctly detect the errors, adverbs are classified according to their grammatical functions, meanings and positions within a sentence. Adverb errors are collected from learners' sentences, and classified into five categories adopting a traditional error analysis. The error classification in conjunction with the adverb categorization is implemented into a set of mal-rules which automatically identifies the errors. When an error is detected, the system corrects the error and suggests error specific feedback. The feedback includes the types of errors, a corrected string of the error and a brief description of the error. This attempt suggests how to improve adverb error correction method as well as to provide richer diagnostic feedback to the learners.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.