Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
KIISE Transactions on Computing Practices
Journal Basic Information
Journal DOI :
Korean Institute of Information Scientists and Engineers
Editor in Chief :
Volume & Issues
Volume 22, Issue 9 - Sep 2016
Volume 22, Issue 8 - Aug 2016
Volume 22, Issue 7 - Jul 2016
Volume 22, Issue 6 - Jun 2016
Volume 22, Issue 5 - May 2016
Volume 22, Issue 4 - Apr 2016
Volume 22, Issue 3 - Mar 2016
Volume 22, Issue 2 - Feb 2016
Volume 22, Issue 1 - Jan 2016
Selecting the target year
Cloning of Korean Morphological Analyzers using Pre-analyzed Eojeol Dictionary and Syllable-based Probabilistic Model
Shim, Kwangseob ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 119~126
DOI : 10.5626/KTCP.2016.22.3.119
In this study, we verified the feasibility of a Korean morphological analyzer that uses a pre-analyzed Eojeol dictionary and syllable-based probabilistic model. For the verification, MACH and KLT2000, Korean morphological analyzers, were cloned with a pre-analyzed eojeol dictionary and syllable-based probabilistic model. The analysis results were compared between the cloned morphological analyzer, MACH, and KLT2000. The 10 million Eojeol Sejong corpus was segmented into 10 sets for cross-validation. The 10-fold cross-validated precision and recall for cloned MACH and KLT2000 were 97.16%, 98.31% and 96.80%, 99.03%, respectively. Analysis speed of a cloned MACH was 308,000 Eojeols per second, and the speed of a cloned KLT2000 was 436,000 Eojeols per second. The experimental results indicated that a Korean morphological analyzer that uses a pre-analyzed eojeol dictionary and syllable-based probabilistic model could be used in practical applications.
Neural Predictive Coding for Text Compression Using GPGPU
Kim, Jaeju ; Han, Hwansoo ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 127~132
DOI : 10.5626/KTCP.2016.22.3.127
Several methods have been proposed to apply artificial neural networks to text compression in the past. However, the networks and targets are both limited to the small size due to hardware capability in the past. Modern GPUs have much better calculation capability than CPUs in an order of magnitude now, even though CPUs have become faster. It becomes possible now to train greater and complex neural networks in a shorter time. This paper proposed a method to transform the distribution of original data with a probabilistic neural predictor. Experiments were performed on a feedforward neural network and a recurrent neural network with gated-recurrent units. The recurrent neural network model outperformed feedforward network in compression rate and prediction accuracy.
Implementation of Motion Detection based on Extracting Reflected Light using 3-Successive Video Frames
Kim, Chang Min ; Lee, Kyu Woong ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 133~138
DOI : 10.5626/KTCP.2016.22.3.133
Motion detection algorithms based on difference image are classified into background subtraction and previous frame subtraction. 1) Background subtraction is a convenient and effective method for detecting foreground objects in a stationary background. However in real world scenarios, especially outdoors, this restriction, (i.e., stationary background) often turns out to be impractical since the background may not be stable. 2) Previous frame subtraction is a simple technique for detecting motion in an image. The difference between two frames depends upon the amount of motion that occurs from one frame to the next. Both these straightforward methods fail when the object moves very "slightly and slowly". In order to efficiently deal with the problem, in this paper we present an algorithm for motion detection that incorporates "reflected light area" and "difference image". This reflected light area is generated during the frame production process. It processes multiplex difference image and AND-arithmetic of bitwise. This process incorporates the accuracy of background subtraction and environmental adaptability of previous frame subtraction and reduces noise generation. Also, the performance of the proposed method is demonstrated by the performance assessment of each method using Gait database sample of CASIA.
Automatic Binary Execution Environment based on Real-machines for Intelligent Malware Analysis
Cho, Homook ; Yoon, KwanSik ; Choi, Sangyong ; Kim, Yong-Min ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 139~144
DOI : 10.5626/KTCP.2016.22.3.139
There exist many threats in cyber space, however current anti-virus software and other existing solutions do not effectively respond to malware that has become more complex and sophisticated. It was shown experimentally that it is possible for the proposed approach to provide an automatic execution environment for the detection of malicious behavior of active malware, comparing the virtual-machine environment with the real-machine environment based on user interaction. Moreover, the results show that it is possible to provide a dynamic analysis environment in order to analyze the intelligent malware effectively, through the comparison of malicious behavior activity in an automatic binary execution environment based on real-machines and the malicious behavior activity in a virtual-machine environment.
A Case Study for Mutation-based Fault Localization for FBD Programs
Shin, Donghwan ; Kim, Junho ; Yun, Wonkyung ; Jee, Eunkyoung ; Bae, Doo-Hwan ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 145~150
DOI : 10.5626/KTCP.2016.22.3.145
Finding the exact location of faults in a program requires enormous time and effort. Several fault localization methods based on control flows of a program have been studied for decades. Unfortunately, these methods are not applicable to programs based on data-flow languages. A recently proposed mutation-based fault localization method is applicable to data-flow languages, as well as control-flow languages. However, there are no studies on the effectiveness of the mutation-based fault localization method for data-flow based programs. In this paper, we provided an experimental case study to evaluate the effectiveness of mutation-based fault localization on programs implemented in Function Block Diagram (FBD), a widely used data-flow based language in safety-critical systems implementation. We analyzed several real faults in the implementation of FBD programs of a nuclear reactor protection system, and evaluated the mutation-based fault localization effectiveness for each fault.
OCP Cold Storage Test-bed
Lee, Jaemyoun ; Kang, Kyungtae ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 151~156
DOI : 10.5626/KTCP.2016.22.3.151
Cloud computing systems require a huge number of storage servers due to the growing implications of power bills, carbon emissions, and logistics of data centers. These considerations have motivated researchers to improve the energy efficiency of storage servers. Most servers use a lot of power irrespective of the amount of computing that they are doing, and one important goal is to redesign servers to be power-proportional. However, Research on large-scale storage systems is hampered by their cost. It is therefore desirable to develop a scalable test-bed for evaluating the power consumption of large-scale storage systems. We are building on open-source projects to construct a test-bed which will contribute to the assessment of power consumption in tiered storage systems. Integrating the cloud application platform can easily extend the proposed testbed laying a foundation for the design and evaluation of low-power storage servers.
Effect of Faster Update Rate on Interaction Accuracy
Seong, Wonjun ; Gao, BoYu ; Lee, Jooyoung ; Lee, Hasup ; Kim, HyungSeok ; Kim, Jee-In ;
KIISE Transactions on Computing Practices, volume 22, issue 3, 2016, Pages 157~162
DOI : 10.5626/KTCP.2016.22.3.157
The limitation of a human's visual perception is considered to be 60 frames per second, This study investigated the effects of fast update rates (above 60 fps) in terms of interaction accuracy. Initial experiments showed that the interaction accuracy increased at rates faster than 60 fps. We assumed that either or both of the following two situations would cause such an effect: the user could recognize rendering rates faster than 60 fps, or the input processing rates were significant for the high accuracy. To evaluate the significance of these events, we conducted a second and third experiment. Although the display refresh rate was also fixed at 60 fps (by disabling the vertical sync), the rendered image actually differed for 60 fps and 150 fps. This research shows that faster update rate is necessary to achieve high interaction accuracy, and its limit is far over the usually considered 60 fps.