Seung-Hoon Kim

A low latency semi-systolic multiplier over GF(2m)

A finite field multiplier is commonly used in implementations of cryptosystems and error correcting codes. In this paper, we present a low latency semi-systolic multiplier over GF (2m). We propose a finite field multiplication algorithm to reduce latency based on parallel computation. The proposed multiplier saves at least 31% time complexity as compared to the corresponding existing structures.

TTCG: three-tier context gathering technique for mobile devices

Previous research on sensor networks mainly focused on efficient transmission of data from sensors to fixed sink nodes. Recently there has been active research on mobile sink nodes, but the re-search of an environment where both fixed sink nodes and mobile sinks are present at the same time is rather scarce. This paper proposes a technique for context gathering by mobile de-vices with the sink functionality added through fixed sinks under a previously-built, cluster-based multi-hop sensor network environment. To this end, clustering of mobile devices were done based on the fixed sinks of a previously-built sensor network, and by using appropriate fixed sinks, context gathering was made possible. By mathematical comparison with TTDD routing proto-col, which was proposed for mobile sinks, it was confirmed that performance increases in energy with the number of mobile sinks, and with the number of movements by mobile devices.

A client profile framework for providing adapted contents in ubiquitous environments

In this paper, we propose a client-side framework to process profiles that are necessary to provide a user with adapted content with users context. To provide adapted content to users, the profile must be included various user related information as well as context. The client devices also have functions to process profile. Nevertheless, most profile related researches have been studying focused on the server-side. The framework that processes the profile in the client devices is necessary. To design the framework, we configure the suitable profile for content adaptation based on analysis of previous researches, and define profile creation, transmission and management functions for efficient profile processing. We implement the CPF(Client Profile Framework) based on the design. The CPF also is applied dynamic configuration method to decrease the number of transmission and size, and dynamic creation method to decrease creation time. As the result of performance evaluation, techniques of the proposed framework for processing profiles are more effective than previous ones.

A Character Identification Method using Postpositions for Animate Nouns in Korean Novels

Submitted:June 20, 2016 1 st Revision:July 20, 2016 Accepted:July 26, 2016 * 본 연구는 문화체육관광부 및 한국콘텐츠진흥원의 2016년도 문화기술 연구개발 지원사업으로 수행되었음. ** 단국대학교 응용컴퓨터공학과 교수, 교신저자 ***단국대학교 응용컴퓨터공학과 교수 Novels includes various character names, depending on the genre and the spatio-temporal background of the novels and the nationality of characters. Besides, characters and their names in a novel are created by the author’s pen and imagination. As a result, any proper noun dictionary cannot include all kind of character names which have been created or will be created by authors. In addition, since Korean does not have capitalization feature, character names in Korean are harder to detect than those in English. Fortunately, however, Korean has postpositions, such as “-ege” and “hante”, used by a sentient being or an animate object (noun). We call such postpositions as animate postpositions in this paper. In a previous study, the authors manually selected character names by referencing both Wikipedia and well-known people dictionaries after utilizing Korean morpheme analyzer, a proper noun dictionary, postpositions (e.g., “-ga”, “-eun”, “-neun”, “-eui”, and “-ege”), and titles (e.g., “buin”), in order to extract social networks from three novels translated into or written in Korean. But, the precision, recall, and F-measure rates of character identification are not presented in the study. In this paper, we evaluate the quantitative contribution of animate postpositions to character identification from novels, in terms of precision, recall, and F-measure. The results show that utilizing animate postpositions is a valuable and powerful tool in character identification without a proper noun dictionary from novels translated into or written in Korean. Keyword:Information Extraction, Korean Novels, Character Identification, Postpositions for Animate Nouns, Korean Linguistic Feature 韓國IT서비스學會誌 第15卷 第3號 2016年 9月, pp.115-125 116 Taekeun Park.Seung-Hoon Kim

An Efficient Exchange-Method of a User Profile for Adapted Contents Services

In this paper, we propose the effective exchange-method of a user profile for adapted contents services in the contents adaptation system. The profiles continuously exchange among the devices of contents adaption system for providing the adapted contents to a user. The profile should be also exchanged according to periodic, aperiodic, event, request and response. Consequently, a lot of network traffic occur and computing power require. Solving theses problem, the profile exchange research needs. we analyze creation information, exchange information, and exchange form of the profile information in contents adaptation system for effective profile exchange and define exchange procedure of the profile using the analyzed profile information. we also propose providing method of the profile configured information for decreasing profile processing time and user setting method for decreasing the number of profile transmission. As a result of performance evaluation, providing method of the profile configured information reduce 7% processing time and user setting method decrease the number of profile transmission are effective to exchange the profile.

Novel Character Identification Utilizing Semantic Relation with Animate Nouns in Korean

For identifying speakers of quoted speech or extracting social networks from literature, it is indispensable to extract character names and nominals. However, detecting proper nouns in the novels translated into or written in Korean is harder than in English because Korean does not have a capitalization feature. In addition, it is almost impossible for any proper noun dictionary to include all kinds of character names that have been created or will be created by authors. Fortunately, a previous study shows that utilizing postpositions for animate nouns is a simple and effective tool for character identification in Korean novels without a proper noun dictionary and a training corpus. In this article, we propose a character identification method utilizing the semantic relation with known animate nouns. For 80 novels in Korean, the proposed method increases the micro- and macro-average recall by 13.68% and 11.86%, respectively, while decreasing the micro-average precision by 0.28% and increasing the macro-average precision by 0.07% compared to the previous study. If we focus on characters that are responsible for more than 1% of the character name mentions in each novel, the micro- and macro-average F-measure of the proposed method are 96.98% and 97.32%, respectively.

Efficient Combined Algorithm for Multiplication and Squaring for Fast Exponentiation over Finite Fields \(GF(2^{m})\)

For big data security, high-speed arithmetic units are needed. Finite field arithmetic has received much attention in error-control codes, cryptography, etc. The modular exponentiation over finite fields is an important and essential cryptographic operation. The modular exponentiation can be performed by a sequence of modular squaring and multiplication based on the binary method. In this paper, we propose a combined algorithm to concurrently perform multiplication and squaring over \(GF(2^{m})\) using the bipartite method and common operations. We expect that the architecture based on the proposed algorithm can reduce almost a half of latency compared to the existing architecture. Therefore, we expect that our algorithm can be efficiently used for various applications including big data security which demands high-speed computation.

Comparative study on book similarity measurement method based on characters in the body of a book written in Korean

This paper presents a comparative study on similarity measurement method based on characters in the body of a book written in Korean. We deduce using ratio of characters in the body of a book for measuring similarity and compare results of book similarity using three different similarity measurement methods through the experiment. And we measure similarity using SMC (Simple Matching Coefficient), Jaccard coefficient and cosine similarity based on extracted characters in six books which are history category. The proposed method can measure book similarity more detail than existing research and result of measurement using cosine similarity is more accurate than other two methods because cosine similarity considers not only presence of characters also frequency of characters in the body of a book. If measuring book similarity based on characters in the body of books, we expect quick and detail performance at books which are categorized history, biography, etc.

Low-Latency Radix-4 Multiplication Algorithm over Finite Fields

The multiplication over finite fields is the most basic and important arithmetic operation. In this paper, we propose a low-latency radix-4 multiplication algorithm based shifted polynomial basis (SPB) over finite fields. The existing multiplication algorithm using SPB has the critical path delay of one 2-input AND gate, one 2-input XOR gate, and one 1-bit latch, and the latency of about 0.5 m clock cycles. Our proposed radix-4 multiplication algorithm has the critical path delay of two 2-input AND gate, two 2-input XOR gate, and one 1-bit latch, and the latency of 0.25 m clock cycles. Our radix-4 multiplication algorithm saves about 20% time complexity as compared to the existing multiplication algorithm based on SPB. Therefore, we expect that the proposed algorithm can lead to a hardware architecture which has a considerably low latency. The multiplier applying the proposed algorithm will be a highly modular architecture and be thus well suited for VLSI implementations.

Design of a Low-Latency Multiplication Algorithm for Finite Fields

Finite field arithmetic operations have received much attention in error-control codes, cryptography, etc. Among the basic arithmetic operations over \(GF(2^{m})\), the multiplication is the most important, complex, and time consuming. In this paper, we present a low-latency finite field arithmetic algorithm for multiplication which is a core algorithm for division and exponentiation operations. In order to obtain a dedicated pipelined algorithm for finite field multiplication based on all-one polynomial, we split its computation into two parts, design the algorithm to simultaneously compute them, and reduce computation delay. Also, we show the detailed derivation process in order to obtain the proposed algorithm for the pipelined computation. Therefore, the proposed algorithm can lead to a hardware architecture which has a considerably low latency. The multiplier applying the proposed algorithm will be a highly modular architecture and be thus well suited for VLSI implementations.