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 11D, Issue 7 - Dec 2004
Volume 11D, Issue 6 - Oct 2004
Volume 11D, Issue 5 - Oct 2004
Volume 11D, Issue 4 - Aug 2004
Volume 11D, Issue 3 - Jun 2004
Volume 11D, Issue 2 - Apr 2004
Volume 11D, Issue 1 - Feb 2004
Volume 11, Issue 6 - 00 2004
Volume 11, Issue 5 - 00 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
Storage Policies for Versions Management of XML Documents using a Change Set
Yun Hong Won ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1349~1356
DOI : 10.3745/KIPSTD.2004.11D.7.1349
The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.
Structure-based Clustering for XML Document Retrieval
Hwang Jeong Hee ; Ryu Keun Ho ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1357~1366
DOI : 10.3745/KIPSTD.2004.11D.7.1357
As the importance or XML is increasing to manage information and exchange data efficiently in the web, there are on going works about structural integration and retrieval. The XML. document with the defined structure can retrieve the structure through the DTD or XML schema, but the existing method can`t apply to XML. documents which haven`t the structure information. Therefore. in this paper we propose a new clus-tering technique at a basic research which make it possible to retrieve structure fast about the XML documents that haven`t the structure information. We first estract the feature of frequent structure from each XML document. And we cluster based on the similar structure by con-sidering the frequent structure as representative structure of the XML document, which makes it possible to retrieve the XML document raster than dealing with the whole documents that have different structure. And also we perform the structure retrieval about XML documents based on the clusters which is the group of similar structure. Moreover, we show efficiency of proposed method to describe how to apply the structure retrieval as well as to display the example of application result.
List Locking Protocol for XML Data Sharing
Lee Eunjung ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1367~1374
DOI : 10.3745/KIPSTD.2004.11D.7.1367
For sharing XML data by many users, a way of concurrency and access control is required for isolating update actions such as inserting and deleting subtrees. Exisiting locking mechanisms as 2PL or MGL suffer low concurrency when applied to tree structures. In this paper, list data subtrees model is proposed based on the semantics expressed in DTD. In this model, tree updating actions such as inserting and deleting subtrees are considered only for the repetitive parts of XML trees. The proposed model guarantees that the result XML tree after applying a tree updating action is always valid, even when multiple users access the tree at the same time. Also, a new locking mechanism called list lock-ing protocol is proposed. The new locking protocol is expected to show better accessility with less number of locking objects compared to the Helmer`s OO2PL model. Since update actions on a shared XML tree usually applied to the repetitive parts of the tree, the proposed model is expected to provide a useful way for efficient data sharing when combined with previous locking methods on terminal node data.
A Continuous Query Processing System for XML Stream Data
Han Seungchul ; Kang Hyunchul ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1375~1384
DOI : 10.3745/KIPSTD.2004.11D.7.1375
Streaming data processing is an area of interest with much research under way. There has been increasing attention on the demands for efficient processing of streaming data produced in the application areas such as monitoring and sensor network. We have developed a continuous query processing system for streaming data and evaluated its performance in this paper. XML, the standard for data exchange on the web, is used as the model for the streaming data and the XQuery appended with a time interval is adopted as the query language for expressing con-tinuous queries. In the proposed system, the result is produced through background processing and materialized for reute in subsequent query processing. Through a detailed set of performance experiments, we shoed the effectiveness of the proposed system.
Subsequence Matching Under Time Warping in Time-Series Databases : Observation, Optimization, and Performance Results
Kim Man-Soon ; Kim Sang-Wook ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1385~1398
DOI : 10.3745/KIPSTD.2004.11D.7.1385
This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.
Declustering Method for Moving Object Database
Seo YoungDuk ; Hong EnSuk ; Hong BongHee ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1399~1408
DOI : 10.3745/KIPSTD.2004.11D.7.1399
Because there are so many spatio-temporal data in Moving Object Databases, a single disk system can not gain the fast response time and tota throughput. So it is needed to take a parallel processing system for the high effectiveness query process. In these existing parallel process-ing system. it does not consider characters of moving object data. Moving object data have to be thought about continuous report to the Moving Object Databases. So it is necessary think about the new Declustering System for the high performance system. In this paper, we propose the new Dechustering Policies of Moving objet data for high effectiveness query processing. At first, consider a spatial part of MBB(Minimum Bounding Box) then take a SD(SemiAllocation Disk) value. Second time, consider a SD value and time value which is node made at together as SDT-Proximity. And for more accuracy Declustering effect, consider a Load Balancing. Evaluation shows performance improvement of aver-age
compare with Round-Robin method about
query area. And performance improvement of average
compare with Spatial Proximity method.
A Way to Speed up Evaluation of Path-oriented Queries using An Abbreviation-paths and An Extendible Hashing Technique
Park Hee-Sook ; Cho Woo-Hyun ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1409~1416
DOI : 10.3745/KIPSTD.2004.11D.7.1409
Recently, due to the popularity and explosive growth of the Internet, information exchange is increasing dramatically over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet. so that in retrieving the XML document. the problem for speeding up evaluation of path-oriented queries is a main issue. In this paper, we propose a new indexing technique to advance the searching performance of path-oriented queries in document databases. In the new indexing technique, an abbreviation-path file to perform path-oriented queries efficiently is generated which is able to use its hash-code value to index keys. Also this technique can be further enhanced by combining the Extendible Hashing technique with the abbreviation path file to expedite a speed up evaluation of retrieval.
Context-based Incremental Preference Analysis Method in Ubiquitous Commerce
Ku Mi Sug ; Hwang Jeong Hee ; Choi Nam Kyu ; Jung Doo Young ; Ryu Keun Ho ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1417~1426
DOI : 10.3745/KIPSTD.2004.11D.7.1417
As Ubiquitous commerce is coming personalization service is getting interested. And also the recommendation method which offers useful information to customer becomes more important. However, most of them depend on specific method and are restricted to the E-commerce. For applying these recommendation methods into U-commerce, first it is necessary that the extended context modeling and systematic connection of the methods to complement strength and weakness of recommendation methods in each commercial transaction. Therefore, we propose a mod-eling technique of context information related to personal activation in commercial transaction and show incremental preference analysis method, using preference tree which is closely connected to recommendation method in each step. And also, we use an XML indexing technique to effi-ciently extract the recommendation information from a preference tree.
A Real-World Workload Generation Tool for Database System Benchmarks
Kim Kee Wuk ; Jeong Hoe Jin ; Lee Sang Ho ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1427~1434
DOI : 10.3745/KIPSTD.2004.11D.7.1427
Database system benchmarks, which are usually evaluated to use the maximized resource in order to get the best results, arc not likely to simulate the real environment. We propose a workload generator that helps benchmarks be executed in the environment similar to a real world. The workload generator can create memory-bound, CPU-bound, and I/O-bound workloads. The workload generator allows users to create an integrated workload. which is similar to a real workload users run across in practice. Finally, we conducted the experiments that the Wisconsin benchmark was performed with the TPC-C and with the workload generation tool, and showed the feasibility of the proposed workload gen-eration tool comparing with two experimental results.
The Methods of Component-Based Development Using Aspect-Oriented Programming Techniques : Focusing on Improvement in UML Diagram
Kim Chi-su ; Kim Tae-young ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1435~1442
DOI : 10.3745/KIPSTD.2004.11D.7.1435
Among many recent methods developing software, the method of component-based development (CBD), which refers to the method of treat-ing software as parts of a larger whole, and developing new applications through the assembly and synthesis of existing software, has been thoroughly studied. CBD, however, has demerits that cause difficulty in making inferences and understanding the code of components. and lack adequate documentation because the method of CBD divides systems according to the functional characteristics of these systems. Therefore, this study shows how to reuse components without difficulty and reduce the development time of systems and development costs by compensat-ing for the weak points of the method of CBD. Aspect-Oriented programming technique has been applied to the method of CBD and the UML diagram for this purpose.
Clustering Characteristics and Class Hierarchy Generation in Object-Oriented Development
Lee Gun Ho ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1443~1450
DOI : 10.3745/KIPSTD.2004.11D.7.1443
The clustering characteristics for a number of classes, and defining the inheritance relations between the classes is a difficult and complex problem in an early stage of object oriented software development. We discuss a traditional iterative approach for the reuse of the existing classes in a library and an integrated approach to creating a number of new classes presented in this study. This paper formulates a character-istic clustering problem for zero-one integer programming and presents a network solution method with illustrative examples and the basic rules to define the inheritance relations between the classes. The network solution method for a characteristic clustering problem is based on a distance parameter between every pair of objects with characteristics. We apply the approach to a real problem taken from industry.
A Software Reliability Growth Model Based on Gompertz Growth Curve
Park Seok-Gyu ; Lee Sang-Un ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1451~1458
DOI : 10.3745/KIPSTD.2004.11D.7.1451
Current software reliability growth models based on Gompertz growth curve are all logarithmic type. Software reliability growth models based on logarithmic type Gompertz growth curve has difficulties in parameter estimation. Therefore this paper proposes a software reliability growth model based on the logistic type Gompertz growth curie. Its usefulness is empirically verified by analyzing the failure data sets obtained from 13 different software projects. The parameters of model are estimated by linear regression through variable transformation or Virene`s method. The proposed model is compared with respect to the average relative prediction error criterion. Experimental results show that the pro-posed model performs better the models based on the logarithmic type Gompertz growth curve.
A Study on Quality Evaluation and Improvement of Software Requirement - Specification
Kim Hyong-Hwan ; Kozima Tsutomu ; Park Young B ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1459~1466
DOI : 10.3745/KIPSTD.2004.11D.7.1459
As the area of software application is increased. the software is becoming larger and more complex. In addition, development of the high quality software within the limits of the budget is strongly demanded. Many methodologies, such as software process improvement, object-ori-ented development, requirement-engineering, and software metrics have been introduced in the software development process in order to attain such objectives. Among those techniques. Requirements-Engineering gives basic guideline to develop high quality software. In other word. in order to develop high quality software, requirements should be elicited, and described. And with proper reviews and management. the quality of requirements can be improved. In this paper, quantitative measurement method that is based on IEEE Std-830-1998 for the require-ment-specifications is proposed.
An Effect on the Audit Quality and Customer Satisfaction by the Service Quality of Information System Audit
Kim DongSoo ; Kim Hyunsoo ; Ahn Yeonshick ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1467~1476
DOI : 10.3745/KIPSTD.2004.11D.7.1467
The importance and demand about IS(information system) audit we increasing to raise quality of IS and prevention of the IS risk and dysfunction. Technology and system research for the substantiality and raising reliability of IS audit are continuously performed. But, there are misunderstanding of audit clients about IS audit, insufficiency of auditor`s ability and misunderstanding of new technology and target business area. Therefore, is not getting trust from client or system integrator because service quality of IS audit is weak relatively. This study aims at survey correlation between audit service quality factor and audit quality, between audit quality and customer satisfaction. The results of this study are as follow. Auditor`s ability, correspondence has a significant effect on audit quality, also audit quality on audit satisfaction, and Auditor`s ability, reliability has a significant effect on audit satisfaction.
A Design of the Application Program Generator based on Meta-Data
Kim Chi Su ; Oh Eun Jin ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1477~1482
DOI : 10.3745/KIPSTD.2004.11D.7.1477
Software development process consists of five phases : requirement, analysis, design, implementation and testing. There is almost always a gap between the system design and implementation stages, caused by a combination of the difficulty of programming and frequent changes on the system design. The goal of this paper is to reduce the gap between system design and implementation, and we design a tool producing a application program by recognizing business logic for a more rapid and flexible developing of software. The core idea of Application Program Generator is : firstly, to recognize that business application in the same domain share business logic and presentation logic : secondly, to treat system design as persistent meta-data ; thirdly, to use the persistent meta-data to build or customize applications as required.
The Estimation of Software Development Effort Using Multiple Regression Method
Jung Hye-Jung ; Yang Hae-Sool ; Shin Seok-Kyoo ; Lee Sang-Un ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1483~1490
DOI : 10.3745/KIPSTD.2004.11D.7.1483
To accomplish a project successfuly, we have to estimate develpment effort accurately. But, development effort is different to software size and operation environment. Usually, we made use of function point for estimating development effort. In this paper. we make use of 789 project data. It is related to development projects in 1990`s. We investigate the variable affecting development effort. Also, we exedcute multiple liner regression analysis for looking linear relation about variables. We find the regression equation for multistage by dividing PDR that influ-enced development effort step by step.
An Estimating Method for Software Testing Manpower
Park Ju-Seok ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1491~1498
DOI : 10.3745/KIPSTD.2004.11D.7.1491
Successful project planning relics on a good estimation of the manpower required to complete a project, together with the schedule options that may be available. Despite the extensive research done developing new and better models, existing software manpower estimation models are present only the total manpower or instantaneous manpower distribution according to the testing time for the software life-cycle. This paper suggests the manpower estimating models for software testing phase as well as testing process and debugging process in accordance with de-tected faults. This paper presents the polynomial model for effort based on testing and debugging faults. These models are verified by 5 different software project data sets with coefficient of determination and mean magnitude of relative error for adaptability of model.
Technical Approaches for Blocking Obscenity in Internet Video Chatting
Cho Dong Uk ; Kim Ji Yeong ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1499~1506
DOI : 10.3745/KIPSTD.2004.11D.7.1499
In this paper an analysis of current video chatting situation and connection status is performed and a technical method to block the obscene contents is proposed. Methods to shut down socially degenerate Internet sites are well known, which are essentially directory or vocabulary based. For the video chatting sites. however, dynamic selectivity is required as the chatting groups in a sites are all different and even in a single group the contents of chatting may turn socially objectionable as time passes. The proposed method is based on the analysis of chatting contents and selectively blocks the sound and/or video data streams. To prove the effectiveness of the method the experiments are performed and the results are shown very satisfactioy.
Design and Implementation of SMS Application System with Wireless Internet Environment
Yang Hae-Sool ; Hong Jung-Hun ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1507~1516
DOI : 10.3745/KIPSTD.2004.11D.7.1507
Recently, the most remarkable word is `ubiuuitous` in field of information and communication. Ubiquitous has a meaning `exist everywhere` that means our daily life is connect as network. It means we can get the information which in need whenever and wherever with safety. We predict this word will be symbolical keyword which lead an information-oriented society including the internet a quite long it. It`s already per-meate to us the Ubiquitous. It`s taken by CCTV when we visit bank. It`s made to us can know the fastest way the GPS system to be connected by an artificial satcllite on mobile, and many people use mobile and PDA for investment in stocks. Among them, it has begun to spread many mobile services to us. In this paper, it`s the aim a creation of value added through an efficient mobile services to use wireless internet different with previous way, cutting down on expenses and business modeling.
JProtein : A Protein Structure Viewer based on Java3D Technology
Moon Nam-Doo ; Byun Sang-Hee ; Kim Jin-Hong ; Han In-Seob ; Lee Myung-Joon ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1517~1526
DOI : 10.3745/KIPSTD.2004.11D.7.1517
Entering the post genome era with an increasing amount of protein data available in public databases, the study of tertiary structure of pro-teins has been artively in progress. To analyze the structure of a protein effectively, it is necessary to visualize the tertiary structure of a protein. Rececntly, many visualization tools based on Java technology have been developed to visualize a protein whose structure has been known. In this paper, we describe a new protein visualization system, named JProtein. It is designed to be an easy-to-use, platform neutral melocular visualization tool. The JProtein system is developed using Java3D technology. Java3D is an API providing a programming interface for 3D representations. The system informs us the angle and the distance of the interacting atoms in amino acids which are visualized, providing several 3D representation models of a protein molecule. In particular, the JProtein system presents synchronous stereo view as well as asynchronous one.
A Knowledge Base Management Technique Based on XML Templates and its Application
Lee Hiye-Ja ; Jeong Byeong-Soo ; Park Seung-Hun ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1527~1536
DOI : 10.3745/KIPSTD.2004.11D.7.1527
For using the knowledge of experts diversely and efficiently, it is very important that the system could represent the complex knowledge in well structured manner and also adapt well to the frequent schema changes. In this paper, we propose an efficient method for knowledge base management by using XML based templates. In our proposed method, to solve the inefficiency of management of many XML documents, we represent the complex knowledge on XML-based templates, and manage the templates structurally by using a meta-template that defines relationship among the templates. In order to show the effectiveness of our method, we developed a knowledge base to formulate an exercise prescription for a subject and an application program to classify the subject`s fitness. The experimental study shows that XML-based templates provide a flexible, extensible and structured way of representing expert knowledge. The inference using XML-based templates can be controlled systematically and efficiently by using meta-template.
A Design of a Recommendation System for One to One Web Marketing
Na Yun Ji ; Go Il Seok ; Han Kun Heui ;
The KIPS Transactions:PartD, volume 11D, issue 7, 2004, Pages 1537~1542
DOI : 10.3745/KIPSTD.2004.11D.7.1537
Various studies to increase customer satisfaction of a web based system are performed actively. Also in recent days an interest about the personalization that supporting a order type service on customer`s viewpoint was raised. So the studies supporting the personalization is required in a web-based marketing system. In this study, we designed an intelligent recommendation system which supporting one to one web marketing using cross selling. The proposed system used an intelligent data mining method as a concurrent cross selling and a sequential cross selling. Also, In experiment on the prototype, we show a proposed system was usable in an practical system applying the mining result.