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 16D, Issue 6 - Dec 2009
Volume 16D, Issue 5 - Oct 2009
Volume 16D, Issue 4 - Aug 2009
Volume 16D, Issue 3 - Jun 2009
Volume 16D, Issue 2 - Apr 2009
Volume 16D, Issue 1 - Feb 2009
Selecting the target year
An Efficient Buffer Management Technique Using Spatial and Temporal Locality
Min, Jun-Ki ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 153~160
DOI : 10.3745/KIPSTD.2009.16-D.2.153
Efficient buffer management is closely related to system performance. Thus, much research has been performed on various buffer management techniques. However, many of the proposed techniques utilize the temporal locality of access patterns. In spatial database environments, there exists not only the temporal locality but also spatial locality, where the objects in the recently accessed regions will be accessed again in the near future. Thus, in this paper, we present a buffer management technique, called BEAT, which utilizes both the temporal locality and spatial locality in spatial database environments. The experimental results with real-life and synthetic data demonstrate the efficiency of BEAT.
An Improved Split Algorithm for Indexing of Moving Object Trajectories
Jeon, Hyun-Jun ; Park, Ju-Hyun ; Park, Hee-Suk ; Cho, Woo-Hyun ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 161~168
DOI : 10.3745/KIPSTD.2009.16-D.2.161
Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.
Efficient Storage Structures for a Stock Investment Recommendation System
Ha, You-Min ; Kim, Sang-Wook ; Park, Sang-Hyun ; Lim, Seung-Hwan ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 169~176
DOI : 10.3745/KIPSTD.2009.16-D.2.169
Rule discovery is an operation that discovers patterns frequently occurring in a given database. Rule discovery makes it possible to find useful rules from a stock database, thereby recommending buying or selling times to stock investors. In this paper, we discuss storage structures for efficient processing of queries in a system that recommends stock investments. First, we propose five storage structures for efficient recommending of stock investments. Next, we discuss their characteristics, advantages, and disadvantages. Then, we verify their performances by extensive experiments with real-life stock data. The results show that the histogram-based structure improves the query performance of the previous one up to about 170 times.
Sensor Data Abstraction and Utilization in Environmental Monitoring System based on Geosensor Network
Jung, Young-Jin ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 177~184
DOI : 10.3745/KIPSTD.2009.16-D.2.177
Environmental monitoring systems are widely developed for analyzing environment and understanding an ecosystem according to the advance of wireless communication and various sensing techniques. To extract useful information, it requires high cost for processing a query, because these systems have to handle huge volume of raw sensor data which is transmitted from a wide area in environmental monitoring applications. Besides, it is also hard to answer an user defined query which requests to check current and near future condition. In this paper, we propose the monitoring system structure for processing a user defined query for environmental monitoring. It also describes the utilization of sensor data filtering and abstraction model. The designed abstraction model which is based on the slope grid in GIS supports fast data access and update. To analyze condition, the extracted data from abstraction model of each sensor type is combined in a query processor. It is useful to provide meaningful information to users.
A Method for Mining Interval Event Association Rules from a Set of Events Having Time Property
Han, Dae-Young ; Kim, Dae-In ; Kim, Jae-In ; Na, Chol-Su ; Hwang, Bu-Hyun ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 185~190
DOI : 10.3745/KIPSTD.2009.16-D.2.185
The event sequence of the same type from a set of events having time property can be summarized in one event. But if the event sequence having an interval, It is reasonable to be summarized more than one in independent sub event sequence of each other. In this paper, we suggest a method of temporal data mining that summarizes the interval events based on Allen`s interval algebra and finds out interval event association rule from interval events. It provides better knowledge than others by using concept of an independent sub sequence and finding interval event association rules.
Energy-efficient Query Processing of Constrained Nearest Neighbor Queries on the Wireless Broadcasting Environments
Lee, Myong-Soo ; Ryu, Byung-Gul ; Oh, Jae-Oh ; Lee, Sang-Keun ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 191~200
DOI : 10.3745/KIPSTD.2009.16-D.2.191
Location based services (LBSs) have drawn huge attention as the growing number mobile devices and wireless technology demand more pervasive information access. In LBSs, Constraint nearest neighbor queries are one of the important queries of human to fulfill his desired quickly through wireless technology. We propose new query processing of constrained nearest neighbor query on the air to support mobile clients which demand optimal uses of wireless broadcast channel and using minimum battery power of client. First we proposed NN query processing with constrained region and then explain the novel NN query processing with various types of constraints. We have proposed novel algorithms to support Constrained Nearest Neighbor queries on the air based on Distributed Spatial Index and Bitmap-based Spatial Index.
Requirements Trace Table Expansion and How to Normalization
Kim, Ju-Young ; Rhew, Sung-Yul ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 201~212
DOI : 10.3745/KIPSTD.2009.16-D.2.201
There are various methods to trace output in software development to verify the consistency and completeness of requirements. Existing studies do present the trace meta-model or automated tools, but fail to list specifically traced output or traced items. Also, in regards to trace tables, which contain traced items, existing studies don‘t consider the whole software development process but merely its sub-process. Given this, the present study suggests an extended requirements tracetable that tracks output from the inception of the project through the architectural design phase to the application delivery, following up on the researcher’s previous study on a tracetable that considered only a sub-process of the whole development process. In addition, in order to address the problem of the tracking process becoming complicated with increased tracefields due to an extended trace table, the researcher suggests a method for normalizing a requirements tracetable that can integrate and separate by development process phase. Apply it to theH system development project of a D company, and this study caseverified application possibility of study, confirmed an effect of a chase to easily find out an error of requirements. Improve precision of a traceto verify consistency of requirements and completeness through this study, and will minimize failure of a software development.
Traceability of UML Based Test Artifacts Using XML
Seo, Kwang-Ik ; Choi, Eun-Man ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 213~222
DOI : 10.3745/KIPSTD.2009.16-D.2.213
Traceability has been held as an important factor in testing activities as well as model driven development. Vertical traceability affords us opportunities to improve manageability from models and test cases to code in testing and debugging phase. Traceability also overcomes difficulties by the separation between abstraction levels when we trace errors from models to source code after test. To support a rigorous test this paper proposes XML based traceability which vertically trace from model and test case to source code. This paper explains how the traceability works and finds out error spots Through experiments using a concrete example.
Extending the Abstraction Capability of BPMN by Introducing Vertical Abstraction
Kang, Sung-Won ; Lee, Dan-Hyung ; Ahn, Yu-Whoan ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 223~236
DOI : 10.3745/KIPSTD.2009.16-D.2.223
BPMN is a standard business process description notation developed by OMG. It allows the user to have an abstract view of a process that hides its details with the Collapsed Sub-Process notation. While it is a useful direction of abstraction that can be called the horizontal abstraction, a different kind of abstraction, the vertical abstraction, is necessary when different stakeholders of business would like to have different views of the business process form their own viewpoints of interest. For example, stakeholders may want to see a process from the viewpoint of a particular group of actors or from the viewpoint of a certain set of goals. This paper first extends horizontal abstraction capability of BPMN by introducing the notion of super edge and, moreover, adds the vertical abstraction capability to it by introducing the notions of `aspect attribute` and `interest specification` and notations for them.
The Efficient Spatio-Temporal Moving Pattern Mining using Moving Sequence Tree
Lee, Yon-Sik ; Ko, Hyun ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 237~248
DOI : 10.3745/KIPSTD.2009.16-D.2.237
Recently, based on dynamic location or mobility of moving object, many researches on pattern mining methods actively progress to extract more available patterns from various moving patterns for development of location based services. The performance of moving pattern mining depend on how analyze and process the huge set of spatio-temporal data. Some of traditional spatio-temporal pattern mining methods[1-6,8-11]have proposed to solve these problem, but they did not solve properly to reduce mining execution time and minimize required memory space. Therefore, in this paper, we propose new spatio-temporal pattern mining method which extract the sequential and periodic frequent moving patterns efficiently from the huge set of spatio-temporal moving data. The proposed method reduces mining execution time of
rate on frequent moving patterns mining using the moving sequence tree which generated from historical data of moving objects based on hash tree. And also, for minimizing the required memory space, it generalize the detained historical data including spatio-temporal attributes into the real world scope of space and time using spatio-temporal concept hierarchy.
Monitoring System of Blind Areas in a Skiing Resort using a USN
Lee, Hyung-Bong ; Jung, Ui-Min ; Park, Lae-Jeong ; Moon, Jung-Ho ; Chung, Tae-Yun ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 249~256
DOI : 10.3745/KIPSTD.2009.16-D.2.249
This paper introduces an efficient USN (ubiquitous sensor network) for monitoring blind areas in a skiing resort, developed as a part of u-Sport showcase project of Gangwon Province. Blind areas of a skiing resort are dangerous and/or steep areas located aroud ski slopes, which are rarely traveled and not easily seen by a ski patrol. If an accident occurs in such a blind area, the main control center of the sking resort can hardly recognize the accident and provide first aid and rescue services promptly. The blind area monitoring system proposed in this paper monitors a blind area of a skiing resort using five battery-powered sensor nodes each of which has an image sensor on it and wirelessly transmits images around the blind area to the main control center on a regular basis, therebly allowing real-time monitoring of the blind area and prompt rescue services in case of accidents. Additionally, the monitoring system provides an emergency button which skiers injured in the blind area can push. If the button is pushed, an image around the button and an alarm signal are transmitted to the main control center and therefore the main control center can take prompt actions for rescuing the injured skiers.
A Study on the e-Government Interoperability Framework Based on IT life cycle and EA
Kang, Dong-Seok ; Shin, Shin-Ae ; Jung, Seung-Ho ; Choi, Young-Jin ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 257~264
DOI : 10.3745/KIPSTD.2009.16-D.2.257
The purposes of e-Government are to connect government agencies without boundary, and to deliver better quality e-services to citizens. The frontier countries try to reach the e-Government goals using Government Interoperability Framework(GIF). Even though Korea also has interoperability regulations, that is obscure. So we have some limitations to take the e-Government interoperability advantages. This study analyzes the cases of advanced countries (EU, U.S., U.K., and Australia), and reviews Korea`s regulations. After that, we suggest EA based Korean e-Government Interoperability Framework(K-GIF), that is to manage the interoperability from business to information technology over the whole IT life cycle.
The Method of Verification for Legal Admissibility of Digital Evidence using the Digital Forensics Ontology
Cho, Hyuk-Gyu ; Park, Heum ; Kwon, Hyuk-Chul ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 265~272
DOI : 10.3745/KIPSTD.2009.16-D.2.265
Although the various crime involved numerous digital evidence, the digital evidence is hard to be acknowledged as a evidence to proof the crime fact in court. We propose the method of verification for the legal admissibility of digital evidence using digital forensics ontology. In order to verify the legal admissibility of digital evidence, we will extend the digital ontology by standard digital forensics process from Digital Forensics Technical Manual defined by KNPA and set up the relation properties and the rule of property constraint to process class in the digital forensics ontology. It is possible for proposed ontology to utilize to plan the criminal investigation and to educate the digital forensics.
Weight Based Technique For Improvement Of New User Recommendation Performance
Cho, Sun-Hoon ; Lee, Moo-Hun ; Kim, Jeong-Seok ; Kim, Bong-Hoi ; Choi, Eui-In ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 273~280
DOI : 10.3745/KIPSTD.2009.16-D.2.273
Today, many services and products that used to be only provided on offline have been being provided on the web according to the improvement of computing environment and the activation of web usage. These web-based services and products tend to be provided to customer by customer`s preferences. This paradigm that considers customer`s opinions and features in selecting is called personalization. The related research field is a recommendation. And this recommendation is performed by recommender system. Generally the recommendation is made from the preferences and tastes of customers. And recommender system provides this recommendation to user. However, the recommendation techniques have a couple of problems; they do not provide suitable recommendation to new users and also are limited to computing space that they generate recommendations which is dependent on ratings of products by users. Those problems has gathered some continuous interest from the recommendation field. In the case of new users, so similar users can`t be classified because in the case of new users there is no rating created by new users. The problem of the limitation of the recommendation space is not easy to access because it is related to moneywise that the cost will be increasing rapidly when there is an addition to the dimension of recommendation. Therefore, I propose the solution of the recommendation problem of new user and the usage of item quality as weight to improve the accuracy of recommendation in this paper.
Analyzing Influential Factors of Sustainable Consumption Behavior in Mobile Videophone Services
Park, Deog-Wan ; Lee, Young-Hee ; Lee, Bong-Gyou ;
The KIPS Transactions:PartD, volume 16D, issue 2, 2009, Pages 281~294
DOI : 10.3745/KIPSTD.2009.16-D.2.281
The objective of this study is to analyze influential factors of sustainable consumption behavior in mobile videophone services using TAM(Technology Acceptance Model). The results of data analysis by SPSS 12.0 show that perceived usefulness, perceived easy of use, videophone service quality, concentration, and use of videophone service by acquaintances exert significant influence on continuous use for videophone services. But `the level of neighbor`s videophone possession and use, videophone charge, videophone quality, and privacy` as moderating variables haven`t significant influence on extended use.