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 14D, Issue 7 - Dec 2007
Volume 14D, Issue 6 - Oct 2007
Volume 14D, Issue 5 - Aug 2007
Volume 14D, Issue 4 - Jun 2007
Volume 14D, Issue 3 - Jun 2007
Volume 14D, Issue 2 - Apr 2007
Volume 14D, Issue 1 - Feb 2007
Selecting the target year
A Moving Object Query Process System for Mobile Recommendation Service
Park, Jeong-Seok ; Shin, Moon-Sun ; Ryu, Keun-Ho ; Jung, Young-Jin ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 707~718
DOI : 10.3745/KIPSTD.2007.14-D.7.707
Recently, much studies for providing mobile users with suitable and useful content services, LBS(Location Based Service) corresponding to the change of users` location, are actively going on. First and foremost, this is basically owing to the progress of location management technologies such as GPS, mobile communication technology and the spread of personal devices like PDA and the cellular phones. Besides, the research scope of LBS has been changed from vehicle tracking and navigation services to intelligent and personalized services considering the changing information of conditions or environment where the users` are located. For example, it inputs the information such as heavy traffic, pollution, and accidents. The query languages which effectively search the stored vehicle and environment information have been studied depending on the increase of the information utilization. However, most of existing moving object query languages are not enough to provide a recommendation service for a user, because they can not be tested and evaluated in real world and did not consider changed environment information. In order to retrieve not only a vehicle location and environment condition but also use them, we suggest a moving object query language for recommendation service and implement a moving object query process system for supporting a query language. It can process a nearest neighbor query for recommendation service which considers various attributes such as a vehicle`s location and direction, environment information. It can be applied to location based service application which utilizes the recommended factors based on environmental conditions.
An Efficient Index Buffer Management Scheme for a B+ tree on Flash Memory
Lee, Hyun-Seob ; Joo, Young-Do ; Lee, Dong-Ho ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 719~726
DOI : 10.3745/KIPSTD.2007.14-D.7.719
Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, due to the very distinct characteristics of flash memory, disk based systems and applications may result in severe performance degradation when directly adopting them on flash memory storage systems. Especially, when a B-tree is constructed, intensive overwrite operations may be caused by record inserting, deleting, and its reorganizing, This could result in severe performance degradation on NAND flash memory. In this paper, we propose an efficient buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer is filled up. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique called BFTL through various experiments.
Efficient Similarity Search in Multi-attribute Time Series Databases
Lee, Sang-Jun ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 727~732
DOI : 10.3745/KIPSTD.2007.14-D.7.727
Most of previous work on indexing and searching time series focused on the similarity matching and retrieval of one-attribute time series. However, multimedia databases such as music, video need to handle the similarity search in multi-attribute time series. The limitation of the current similarity models for multi-attribute sequences is that there is no consideration for attributes` sequences. The multi-attribute sequences are composed of several attributes` sequences. Since the users may want to find the similar patterns considering attributes`s sequences, it is more appropriate to consider the similarity between two multi-attribute sequences in the viewpoint of attributes` sequences. In this paper, we propose the similarity search method based on attributes`s sequences in multi-attribute time series databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. In addition, we give preliminary experimental results to show the effectiveness of the proposed method.
An Adaptive Grid-based Clustering Algorithm over Multi-dimensional Data Streams
Park, Nam-Hun ; Lee, Won-Suk ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 733~742
DOI : 10.3745/KIPSTD.2007.14-D.7.733
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Due to this reason, memory usage for data stream analysis should be confined finitely although new data elements are continuously generated in a data stream. To satisfy this requirement, data stream processing sacrifices the correctness of its analysis result by allowing some errors. The old distribution statistics are diminished by a predefined decay rate as time goes by, so that the effect of the obsolete information on the current result of clustering can be eliminated without maintaining any data element physically. This paper proposes a grid based clustering algorithm for a data stream. Given a set of initial grid cells, the dense range of a grid cell is recursively partitioned into a smaller cell based on the distribution statistics of data elements by a top down manner until the smallest cell, called a unit cell, is identified. Since only the distribution statistics of data elements are maintained by dynamically partitioned grid cells, the clusters of a data stream can be effectively found without maintaining the data elements physically. Furthermore, the memory usage of the proposed algorithm is adjusted adaptively to the size of confined memory space by flexibly resizing the size of a unit cell. As a result, the confined memory space can be fully utilized to generate the result of clustering as accurately as possible. The proposed algorithm is analyzed by a series of experiments to identify its various characteristics
Investigating Binding Area of Protein Surface using MCL Algorithm
Jung, Kwang-Su ; Yu, Ki-Jin ; Chung, Yong-Je ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 743~752
DOI : 10.3745/KIPSTD.2007.14-D.7.743
Proteins combine with other materials to achieve their function and have similar function if their active sites are similar. Thus we can infer the function of protein by identifying the binding area of proteins. This paper suggests the novel method to select binding area of protein using MCL (Markov Cluster) algorithm. We construct the distance matrix from surface residues distance on protein. Then this distance matrix is transformed to connectivity matrix for applying MCL process. We adopted Catalytic Site Atlas (CSA) data to evaluate the proposed method. In the experimental result using CSA data (94 selected single chain proteins), our algorithm detects the 91 (97%) binding area near by active site of each protein. We introduced a new geometrical features and this mainly contributes to reduce the time to analyze the protein by selecting the residues near by active site.
Rigorous System Testing by Supporting Vertical Traceability
Seo, Kwang-Ik ; Choi, Eun-Man ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 753~762
DOI : 10.3745/KIPSTD.2007.14-D.7.753
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 makes overcome to difficulties of going up-and-down abstraction level to find out error spot of faults discovered by testing This paper represents a vertical test method which connects a system test level and an integration test level in a test stage by using UML. Experiment of how traceability works and how effective focus on error spots has been included using concrete examples of tracing from models to the code.
Design and Implementation of Tool Constructing Migration of Legacy System
Yang, Hae-Seung ; Park, Pyung-Hyung ; Yang, Hae-Sool ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 763~772
DOI : 10.3745/KIPSTD.2007.14-D.7.763
Due to increased software development cost, interest about the method and automated tool for reusing legacy system have been running high. Therefore, In this study, it proves the definition, concept and also background of legacy system by showing real market and technology trend. Automation tool is designed and developed to handle the concrete development methodology, procedure and reference. Also, we implemented the process that analyze the legacy system and extract, refine, store and reuse the candidate components by using LM(Legacy to Modern System) supporting tool presented in this paper. If LM supporting tool is applied to legacy system migration, we can expect cutting costs, shortening the developing period and succeeding the intellectual property by software re-engineering.
Framework for Developing RFID Applications Based on Product Line Architecture
Moon, Mi-Kyeong ; Kim, Han-Jun ; Yeom, Keun-Hyuk ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 773~782
DOI : 10.3745/KIPSTD.2007.14-D.7.773
Software produce line engineering is a method that prepares for future reuse and supports seamless reuse in the application development process. Analyzing the commonality and variability between products in a product line is one of the essential concerns that must be considered when building a product line. In this paper, we suggest to combine a product line engineering approach with RFID applications technology. More concretely, common activities are identified among the RFID-enable applications and the variability in the common activities is analyzed in detail. Then, we suggest reusable product line architecture as a product line asset. In addition, as a tool for supporting this research, a framework which provides both reusable product line architecture for REID applications and the components that implement concrete realization of the architecture is developed. Sharing a common architecture and reusing assets to deploy recurrent services may be considered an advantage in terms of economic significance and overall quality.
The Pre-Service and Post-Transcoding Method for Enhancing the Response Time of Mobile Web Service
Kang, Eui-Sun ; Park, Dae-Hyuck ; Lim, Young-Hwan ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 783~790
DOI : 10.3745/KIPSTD.2007.14-D.7.783
One of the particulars to be considered for providing wireless web service with PC web page is the hardware environment between PC and mobile device. It is because time cost is required in producing mobile contents to suit environment of the connected terminal. Therefore, server side should take account of response time and disk capacity of server. Response time is delayed by content conversion and disk capacity need to store various versions about one content. This paper suggests a pre-service and post-transcoding method to provide faster response time for a mobile terminal. The pre-service is to minimize response time by placing the top priority in servicing contents saved in cache as much as possible even if the quality of contents serviced to mobile terminal may be low. After pre-service is provided, the mobile content is transcoded for the terminal later. Performance level of method proposed was compared through experiment and the result of analysis was described.
Impact of KM Strategies on KM Performance
Lee, Young-Hee ; Song, In-Kuk ; Lee, Jung-Woo ; Jeong, Seung-Ryul ; Lee, Bong-Gyou ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 791~800
DOI : 10.3745/KIPSTD.2007.14-D.7.791
The purpose of the research is to investigate the impact of the implementation and recognition for KM strategies on KM performances in public enterprises. The research identified critical factors of KM strategies and performances through literature review, measured the degrees of implementation and significance recognition for the strategies targeting public enterprises, and analyzed the KM performance levels based on the combined degrees of the implementation and the recognition for KM strategies. The findings illustrate that not only the KM strategies implementation, but also the significance recognition can affect the KM performances. The researchers urge that organizations, in advance, should request their employees` understanding and significance recognition for KM strategies to successfully implement their knowledge management.
Kalman filter based Motion Vector Recovery for H.264
Ko, Ki-Hong ; Kim, Seong-Whan ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 801~808
DOI : 10.3745/KIPSTD.2007.14-D.7.801
Video coding standards such as MPEG-2, MPEG-4, H.263, and H.264 transmit a compressed video data using wired/wireless communication line with limited bandwidth. Because highly compressed bit-streams is likely to fragile to error from channel noise, video is damaged by error. There have been many research works on error concealment techniques, which recover transmission errors at decoder side [1, 2]. We designed an error concealment technique for lost motion vectors of H.264 video coding. In this paper, we propose a Kalman filter based motion vector recovery scheme, and experimented with standard video sequences. The experimental results show that our scheme restores original motion vector with more precision of 0.91 - 1.12 on average over conventional H.264 decoding with no error recovery.
Traffic Sign Recognition Using Color Information and Error Back Propagation Algorithm
Bang, Gul-Won ; Kang, Dea-Wook ; Cho, Wan-Hyun ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 809~818
DOI : 10.3745/KIPSTD.2007.14-D.7.809
In this thesis, the color information is used to extract the traffic sign territory, and for recognizing the extracted image, it proposes the traffic sign recognition system that applies the error back propagation algorithm. The proposed method analyzes the color of traffic sign to extract and recognize the possible territory of traffic sign. The method of extracting the possible territory is to use the characteristics of YUV, YIQ, and CMYK color space from the RGB color space. Morphology uses the geometric characteristics of traffic sign to make the image segmentation. The recognition of traffic signs can be recognized by using the error back propagation algorithm. As a result of the experiment, the proposed system has proven its outstanding capability in extraction and recognition of candidate territory without the influence of differences in lighting and input image in various sizes.
Topic maps Matching and Merging Techniques based on Partitioning of Topics
Kim, Jung-Min ; Chung, Hyun-Sook ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 819~828
DOI : 10.3745/KIPSTD.2007.14-D.7.819
In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.
Developing dirty data cleansing service between SOA-based services
Ji, Eun-Mi ; Choi, Byoung-Ju ; Lee, Jung-Won ;
The KIPS Transactions:PartD, volume 14D, issue 7, 2007, Pages 829~840
DOI : 10.3745/KIPSTD.2007.14-D.7.829
Dirty Data Cleansing technique so far have aimed to integrate large amount of data from various sources and manage data quality resided in DB so that it enables to extract meaningful information. Prompt response to varying environment is required in order to persistently survive in rapidly changing business environment and the age of limitless competition. As system requirement is recently getting complexed, Service Oriented Architecture is proliferated for the purpose of integration and implementation of massive distributed system. Therefore, SOA necessarily needs Data Exchange among services through Data Cleansing Technique. In this paper, we executed quality management of XML data which is transmitted through events between services while they are integrated as a sole system. As a result, we developed Dirty Data Cleansing Service based on SOA as focusing on data cleansing between interactive services rather than cleansing based on detection of data error in DB already integrated.