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 10D, Issue 7 - Dec 2003
Volume 10D, Issue 6 - Oct 2003
Volume 10D, Issue 5 - Aug 2003
Volume 10D, Issue 4 - Aug 2003
Volume 10D, Issue 3 - Jun 2003
Volume 10D, Issue 2 - Apr 2003
Volume 10C, Issue 2 - Apr 2003
Volume 10D, Issue 1 - Feb 2003
Volume 10, Issue 7 - 00 2003
Volume 10, Issue 5 - 00 2003
Volume 10, Issue 4 - 00 2003
Volume 10, Issue 3 - 00 2003
Volume 10, Issue 2 - 00 2003
Volume 10, Issue 1 - 00 2003
Selecting the target year
An Efficient Grid Cell Based Spatial Clustering Algorithm for Spatial Data Mining
문상호 ; 이동규 ; 서영덕 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 567~567
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exists in spatial databases, is a challenging task due to the huge amounts of spatial data. Clustering algorithms are attractive for the task of class identification in spatial databases. Several methods for spatial clustering have been presented in recent years, but have the following several drawbacks increase costs due to computing distance among objects and process only memory-resident data. In this paper, we propose an efficient grid cell based spatial clustering method for spatial data mining. It focuses on resolving disadvantages of existing clustering algorithms. In details, it aims to reduce cost further for good efficiency on large databases. To do this, we devise a spatial clustering algorithm based on grid ceil structures including cell relationships.
Shape-Based Subsequence Retrieval Supporting Multiple Models in Time-Series Databases
원정임 ; 윤지희 ; 김상욱 ; 박상현 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 577~577
The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function
when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.
Efficient Parallel Spatial Join Processing Method in a Shared-Nothing Database Cluster System
정원일 ; 이충호 ; 배해영 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 591~591
Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database server. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.
Technique for extracting reusable XML Schema from schema-less XML Documents
조정길 ; 구연설 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 603~603
According to development of Web, an amount of XML documents has been increasing. So, many researches are proceeding to verify XML data coming from clients and to store or query efficiently database. In order to verify, store and query, DTD or XML Schema of XML documents is necessary. However, Schemaless XML documents couldn't be operated since they do not have either DTD or in Schema. In this paper, we extract XML schema in order to verify XML data and store or query efficiently database from either well-formed XML or XML Schemaless documents. XML Schema extracting technique which is proposed in this paper extract Schema graph using simulation and dataguide that is a extracting technique for semistructured characteristics of XML data. Also, we propose extracting technique for XML Schema using pattern tables that are considerated with Schema graph and reusability.
Design and Implementation of XML-RPC Interface for Relational Database on Distributed Environments
신성욱 ; 이영욱 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 613~613
The RPC is one of the most used communication mechanisms in the distributed system. This study is to design the simple interface for making use of database under the distributed environments by using XML-RPC among the RPC protocols. The access to any database of the current RDB programs is needed for a programming format of the special API according to the programming language, flat form and the class of the used database but simplification of database access shows that various different database accesses and manipulation are easier and more convenient in the special computer languages and environments by the middleware implemented using a XML-RPC protocol.
Processing XML Queries Using XML Materialized Views : Decomposition of a Path Expression and Result Integration
문찬호 ; 강현철 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 621~621
As demand of XML documents in the Web increases, Web service applications that manage XML documents as their resource are increasing. The view mechanism for XML data could be considered for effective in query processing in these Web service applications. If the XML query results are maintained as XML materialized views and their relevant XML query is processed using them, the query response time could be reduced. There are two types of processing an in path expression, which is one of the core features of XML query languages, using XML materialized views. One is the type where the complete query result is obtained from the materialized view, and the other is the type where some of the result is obtained from the materialized view and the rest is from the underlying XML documents. In this paper, we investigate the second type. An XML query in this paper is an XML path expression which is one of the core features of XML query languages. We first describe the storage structures of the XML materialized views derived from the underlying XML documents in the XML repository. Then, we propose the algorithms to decompose a given XML query into the subquery against the materialized view and the subquery against the underlying XML documents, and to integrate the results of these subqueries. Through performance evaluation, we figure out the condition under which our XML query decomposition using materialized views is more effective than the conventional processing.
Realignment of Clients in Client-server Database System
박용범 ; 박제호 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 639~639
Conventional two-tier databases have shown performance limitation in the presence of many concurrent clients. To this end, the three-tier architecture that exploits similarities in client's object access behavior has been proposed. In this system, clients are partitioned into clusters, and object requests can be then served in inter-cluster manner. Introducing an intermediate layer between server(s) and clients enables this. In this paper, we introduce the problem of client realignment in which access behavior changes, and propose on-line client clustering. This system facilitates adaptive reconfiguration and redistribution of sites. The core issue in this paper is to demonstrate the effectiveness of on-line client clustering. We experimentally investigate the performance of the scheme and necessary costs.
The Consistency Management Using Trees of Replicated Data Items in Partially Replicated Database
배미숙 ; 황부현 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 647~647
The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.
Selective Cache Consistency Scheme to Enlarge Autonomy of Mobile Host in Mobile Computing Environments
김희숙 ; 황병연 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 655~655
The cache used by mobile host is an important device that recovers the weak points of limited power and bandwidth, in mobile computing environments. However, it has to stand and maintain the consistency with the server data. In this paper, we propose a 'Selective Cache Consistency Scheme'. The server allows an effective broadcasting by selecting data of high usability using 'Cache State Table' and 'Data Access Table'. Moreover, this scheme prevents the loss of data that may occur by a long period of disconnection, by asynchronous broadcasting and transmitting those broadcast data preserved in the server. This also allows user to possess the latest data. Through experiments, we have found that the enlargement of autonomy is possible by reducing the dependence of server.
An Efficient Query Rewriting Technique Utilizing Semantic Information and Materialized Views
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 661~661
Materialized views which are stored views of the database offer opportunities for significant performance gain in query evaluation by providing fast access to pre-computed data. The question of when and how to use a materialized view in processing a given query is a difficult one attracting a significant amount of research. Whether a materialized view can be used in answering a query depends on the relationship between the view and the query. Proposed in this paper are new ways of utilizing materialized views in answering a query. Semantic relationships are used in addition to syntactic ones. We also utilize a materialized view in answering a query even if it has relations unrelated to the query. We first show the conditions for testing whether a materialized view can be utilized in answering a query and then present the algorithms for testing the conditions and reformulating a query with a materialized view.
Creation of Soccer Video Highlight Using The Structural Features of Caption
허문행 ; 신성윤 ; 이양원 ; 류근호 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 671~671
A digital video is usually very long temporally. requiring large storage capacity. Therefore, users want to watch pre-summarized video before they watch a large long video. Especially in the field of sports video, they want to watch a highlight video. Consequently, highlight video is used that the viewers decide whether it is valuable for them to watch the video or not. This paper proposes how to create soccer video highlight using the structural features of the caption such as temporal and spatial features. Caption frame intervals and caption key frames are extracted by using those structural features. And then, highlight video is created by using scene relocation, logical indexing and highlight creation rule. Finally. retrieval and browsing of highlight and video segment is performed by selection of item on browser.
Implementation of Protein Motif Prediction System Using integrated Motif Resources
이범주 ; 최은선 ; 류근호 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 679~679
Motif databases are used in the function and structure prediction of proteins which appear on new and rapid release of raw data from genome sequencing projects. Recently, the frequency of use about these databases increases continuously. However, existing motif databases were developed and extended independently and were integrated mainly by using a web-based cross-reference, thus these databases have a heterogeneous search result problem, a complex query process problem and a duplicate database entry handling problem. Therefore, in this paper, we suppose physical motif resource integration and describe the integrated search method about a family-based protein prediction for solving above these problems. Finally, we estimate our implementation of the motif integration database and prediction system for predicting protein motifs.
A Software Quality Prediction Model Without Training Data Set
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 689~689
Criticality prediction models that determine whether a design entity is fault-prone or non fault-prone are used for identifying trouble spots of software system in analysis or design phases. Many criticality prediction models for identifying fault-prone modules using complexity metrics have been suggested. But most of them need training data set. Unfortunately very few organizations have their own training data. To solve this problem, this paper builds a new prediction model, KSM, based on Kohonen SOM neural networks. KSM is implemented and compared with a well-known prediction model, BackPropagation neural network Model (BPM), considering internal characteristics, utilization cost and accuracy of prediction. As a result, this paper shows that KSM has comparative performance with BPM.
Incremental Method for Developing Software Product Family
주복규 ; 김영철 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 697~697
In a software product line approach, developers first develop common software architecture and components by analyzing the characteristics of all software members, and then produce each application by integrating components. The approach is considered very effective means for developing and maintaining in parallel a software product family. Main disadvantage of this approach is that it requires a big up-front investment in preparing product line. Therefore, it takes time to deliver the first version. In this paper, we present an incremental method to develop software families, which requires small additional cost for initial versions and allows an organization to move smoothly to full-scale product line. We present our method by explaining how to record and upgrade the results of variations analysis, and show the application of our method by developing a family of YBS. Our method is a low-risk approach that can be effectively applied to an organization that starts developing software systems but has to deliver the first versions quickly to the market.
Trigger design to software defect analysis
이은서 ; 이경환 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 709~709
This research introduces defect and its causes that happen on software development. Based on defect cause analysis, we understand associated relation between defects and them design defect trigger. So, when we achieve similar project, we can forecast defect and prepare to solve defect by using defect trigger.
Design of Software Process Metrics and Procedures for Software Process Measurement
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 719~719
A SPICE (Software Process Improvement and Capability dEtermination) and CMM (Capability Maturity Model) assessment can be considered as representative software process assessment models since assessors assign ratings to indicators and metrics to measure the capability of software precesses. But ail of process assessment models don't provide a subjective measurement procedure and metrics. In this paper we define basic quality process metrics and propose standard metrics for each process based on SPICE and CMM. This study also proposed a guideline for a subjective measurement procedure and the metrics are effectively use to SPI.
A Case Study of Software Quality Improvement
정현석 ; 황인수 ; 양해술 ;
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 727~727
Recently various quality assurance activities have been applied in software industry for the purpose of software qualify improvement, and the ultimate target of those activities are focused on removing defects from its developed applications. We declared "ZERO DEFECT 21" movement on March 1999 whose purpose is to deliver defect-free applications to the customer. In this paper we would like to introduce the followings ① Approaching Methods, ② Achievements of "ZERO DEFECT 21". After accomplishing first you of "ZERO DEFECT 21" movement which consist of Audits and Software inspections, we could get the following improvement : ① due to conducting the "Audits," we could prevent 22 cases of customer claims, enhance 11.7% of design quality and improve 23.3% of deliverable reusability : ② also, due to conducting the "Periodic Sampling inspection and Final inspection," we could enhance 123% of defect rate compared with early stage of development and 247% of defect rate compared with previous year. Based on the survey results, we could conclude that "ZERO DEFECT 21 " movement provides confidence to project team members and reliability to our customers.
Design and Implementation of Report Generator based on XML Form : Moonlight
The KIPS Transactions:PartD, volume 10, issue 4, 2003, Pages 735~735
This paper presents details of the design and implementation of a report generator, MoonLight, which supports to design the report form from DB or data sources and print it to the printer. Also this paper defines the detailed model of the report system, the architecture and behavior of MoonLight, and the components of the report form, and also shows algorithms to make the report template and print the report bound to the data source. MoonLight takes advantage of XML language for the report template form. And also it is implemented by Java language to take the advantage of platform independency. This paper also shows the results of run-time performance of MoonLight which is measured with the time to construct page objects of a report and the time to render the page objects to the print images, respectively.