Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartD
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 18D, Issue 6 - Dec 2011
Volume 18D, Issue 5 - Oct 2011
Volume 18D, Issue 4 - Aug 2011
Volume 18D, Issue 3 - Jun 2011
Volume 18D, Issue 2 - Apr 2011
Volume 18D, Issue 1 - Feb 2011
Selecting the target year
A novel page replacement policy associated with ACT-R inspired by human memory retrieval process
Roh, Hong-Chan ; Park, Sang-Hyun ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 1~8
DOI : 10.3745/KIPSTD.2011.18D.1.001
The cache structure, which is designed for assuring fast accesses to frequently accessed data, resides on the various levels of computer system hierarchies. Many studies on this cache structure have been conducted and thus many page-replacement algorithms have been proposed. Most of page-replacement algorithms are designed on the basis of heuristic methods by using their own criteria such as how recently pages are accessed and how often they are accessed. This data-retrieval process in computer systems is analogous to human memory retrieval process since the retrieval process of human memory depends on frequency and recency of the retrieval events as well. A recent study regarding human memory cognition revealed that the possibility of the retrieval success and the retrieval latency have a strong correlation with the frequency and recency of the previous retrieval events. In this paper, we propose a novel page-replacement algorithm by utilizing the knowledge from the recent research regarding human memory cognition. Through a set of experiments, we demonstrated that our new method presents better hit-ratio than the LRFU algorithm which has been known as the best performing page-replacement algorithm for DBMS caches.
Efficient Rotation-Invariant Boundary Image Matching Using the Envelope-based Lower Bound
Kim, Sang-Pil ; Moon, Yang-Sae ; Hong, Sun-Kyong ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 9~22
DOI : 10.3745/KIPSTD.2011.18D.1.009
In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.
A Composition Check of Composite Refactorings Not Having a Specification of Precondition
Kim, Kyung-Min ; Jang, Pil-Jae ; Kim, Tae-Gong ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 23~34
DOI : 10.3745/KIPSTD.2011.18D.1.023
Refactoring has been actively used in recent software developments. Many studies on the processing of more large scaled composite refactorings have been conducted through the composition of elementary refactorings. It is important to verify the possibility of composition before the refactoring is performed, because the composite refactorings are processed to the sequence of composed elementary refactorings. In conventional studies, they verify the possibility of composition using the precondition of composite refactorings which are computed from the precondition and postcondition of elementary refactorings. They can not verify the possibility of composition in case which composite refactorings do not have a specification of precondition. Thus, we plan to verify the possibility of composition by using the elementary refactorings only without any additional definitions of the preconditions of composite refactorings. To achieve this goal, we proposes a specification method of elementary refactorings and a method for the composition check of refactorings. Then, we develop a prototype tool based on these methods. In addition, we verify the efficiency of our methods through case studies.
Detection of Potential Memory Access Errors based on Assembly Codes
Kim, Hyun-Soo ; Kim, Byeong-Man ; Bae, Hyun-Seop ; Chung, In-Sang ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 35~44
DOI : 10.3745/KIPSTD.2011.18D.1.035
Memory errors can cause not only program malfunctions but also even unexpected system halt. Though a programmer checks memory errors, some memory errors with low occurrence frequency are missed to detect. In this paper, we propose a method for effectively detecting such memory errors using instruction transition diagrams through analyzing assembly codes obtained by disassembling an executable file. Out of various memory errors, local memory return errors, null pointer access errors and uninitialized pointer access errors are targeted for detection. When applying the proposed method to various programs including well-known open source programs such as Apache web server and PHP script interpreter, some potential memory errors are detected.
Task Extraction from Software Design Models to Improve Energy Efficiency of Embedded Software
Hong, Jang-Eui ; Kim, Doo-Hwan ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 45~56
DOI : 10.3745/KIPSTD.2011.18D.1.045
The importance of low-power embedded system is being increased. The studies on low-power system have been performed in issues of hardware architecture and operating system. However because the behaviors of software control the working of hardware devices, the power analysis of software is one of critical issues in energy-efficient embedded system development. This paper proposes a technique to extract tasks from software design models with considering power consumption. We first define the criteria for task extraction, and then propose the way to separate out the task from UML 2.0 design models. Our technique can provide the chance to reduce the power consumption as well as to fulfill the performance requirement in the early phase of software development.
Design and Implementation of Spatially-enabled Integration Management System for a gCRM
Kim, Sam-Geun ; Moon, Il-Hwan ; Ahn, Jae-Geun ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 57~66
DOI : 10.3745/KIPSTD.2011.18D.1.057
Recently, the necessity of new methods of spatial data integration and analysis in CRM has been increased since it is acknowledged that about eighty percent of all data stored in corporate databases has a spatial component. But conventional CRM systems are either incapable of managing spatial data or are not user-friendly when doing so. This paper has designed and implemented spatially-enabled integration management system that can manage consistently both enterprise and spatial data through a legacy CRM system and object-oriented database and additionally support spatial analysis and map visualization for a gCRM. Through implementation, it is demonstrated that the proposed system can facilitate effectively spatial data management and analysis in a legacy CRM system.
Design and Implementation of OCR Correction Model for Numeric Digits based on a Context Sensitive and Multiple Streams
Shin, Hyun-Kyung ;
The KIPS Transactions:PartD, volume 18D, issue 1, 2011, Pages 67~80
DOI : 10.3745/KIPSTD.2011.18D.1.067
On an automated business document processing system maintaining financial data, errors on query based retrieval of numbers are critical to overall performance and usability of the system. Automatic spelling correction methods have been emerged and have played important role in development of information retrieval system. However scope of the methods was limited to the symbols, for example alphabetic letter strings, which can be reserved in the form of trainable templates or custom dictionary. On the other hand, numbers, a sequence of digits, are not the objects that can be reserved into a dictionary but a pure markov sequence. In this paper we proposed a new OCR model for spelling correction for numbers using the multiple streams and the context based correction on top of probabilistic information retrieval framework. We implemented the proposed error correction model as a sub-module and integrated into an existing automated invoice document processing system. We also presented the comparative test results that indicated significant enhancement of overall precision of the system by our model.