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 8D, Issue 6 - Oct 2001
Volume 8D, Issue 5 - Oct 2001
Volume 8D, Issue 4 - Aug 2001
Volume 8D, Issue 3 - Jun 2001
Volume 8D, Issue 2 - Apr 2001
Volume 8D, Issue 1 - Feb 2001
Selecting the target year
A Spatiotemporal Moving Objects Management System using GIS
Shin, Key-Soo ; Ahn, Yun-Ae ; Bae, Jong-Chul ; Jeong, Yeong-Jin ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 105~116
Moving objects are spatiotemporal data that location and shape of spatial objects are changed continuously over time. If spatiotemporal moving objects are managed by conventional database system, moving objects management systems have two problems as follows. First, update for location information changed over time is occurred frequently. Second, past and future information of moving objects are not provided by system because only current state of objects is stored in the system. Therefore, in this paper, we propose a spatiotemporal moving objects management system which is able to not only manage historical information of moving objects without frequent update, but also provide all location information about past, current, and near future. In the proposed system, information of moving objects are divided into location information for representing location and motion information for representing moving habits. Especially, we propose the method which can search location information all objects by use of changing process algorithms with minimum history information. Finally, we applied the proposed method to battlefield analysis system, as the result of experiment, we knew that past, current, and near future location information for moving objects are managed by relational database and GIS system.
Design and Implementation of a Data Mining Query Processor
Kim, Chung-Seok ; Kim, Kyung-Chang ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 117~124
A data mining system includes various data mining functions such as aggregation, association and classification, among others. To express these data mining function, a powerful data mining query language is needed. In addition, a graphic user interface(GUI) based on the data mining query language is needed for users. In addition, processing a data mining query targeted for a data warehouse, which is the appropriate data repository for decision making, is needed. In this paper, we first build a GUI to enable users to easily define data mining queries. We then propose a data mining query processing framework that can be used to process a data mining query targeted for a data warehouse. We also implement a schema generate a data warehouse schema that is needed to build a data warehouse. Lastly, we show the implementation details of a query processor that can process queries that discover association rules.
An Efficient Range Search and Nearest Neighbor Search Algorithm for Action Parts of Active Systems in Sparse Area
Kim, Jung-Il ; Hong, Dong-Kweon ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 125~131
Various kind of disasters happens in our society. Most of them require immediate treatment to save life or to protect valuable products. When an accident happens in a place, it is reported to the headquarter of emergency measures system. According to the nature of accident several treatments orders are transmitted to the related authorities. In this paper, we introduce an intelligent emergency measures system that uses trigger mechanism of active databases. The system responds to various events spontaneously without intervention of mankind by triggering proper rules. The most important part of an action in the system is the capability of searching places to apply adequate treatments quickly. We have developed a new method for range queries and nearest neighbor queries which utilize the z-ordering technique to get fast responses. Those new methods are further extended to handle more realistic actual distance of road among positions.
Optimistic Concurrency Control based on 2-Version and TimeStamp for Broadcast Environment : OCC/2VTS
Lee, Uk-Hyun ; Hwang, Bu-Hyun ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 132~144
The broadcast environment is asymmetric communication aspect that is typically much greater communication capacity available from server to clients than in the opposite direction. In addition, most of mobile computing systems only allow the generation of read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when those schemes are applied to the broadcast environment having quite a high data contention. In this paper, we propose OCC/2VTS (Optimistic Concurrency Control based on 2-Version and TimeStamp) that is most appropriate for broadcast environment. OCC/2VTS lets each client process and commit query transactions for itself by using two version data in cache. If the values of appropriate data items are not changed twice by invalidation report after a query transaction starts, the query transaction is committed safely independent of commitment of update transactions. OCC/2VTS decreases the number of informing server for the purpose of commitment. Due to broadcasting the validation reports including updated recent values, it reduces the opportunity of requesting a recent data values of server as well. As a result, OCC/2VTS makes full use of the asymmetric bandwidth. It also improves transaction throughput by increasing the query transaction commit ratio as much as possible.
PdR-Tree : An Efficient Indexing Technique for the improvement of search performance in High-Dimensional Data
Joh, Beom-Seok ; Park, Young-Bae ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 145~153
The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expressing it as B-tree ; and by solving the problem of search time complexity the pyramid technique also prevents the effect \"phenomenon of dimensional curse\" which is caused by treatment of hypercube range query in n-dimensional data space. The Spherical Pyramid-Technique applies the pyramid method’s space division strategy, uses spherical range query and improves the search performance to make it suitable for similarity search. However, depending on the size of data and change in dimensions, the two above technique demonstrate significantly inferior search performance for data sizes greater than one million and dimensions greater than sixteen. In this paper, we propose a new index-structured PdR-Tree to improve the search performance for high dimensional data such as multimedia data. Test results using simulation data as well as real data demonstrate that PdR-Tree surpasses both the Pyramid-Technique and Spherical Pyramid-Technique in terms of search performance.
Parsimonious Neural Network and Heuristic Search Method for Software Effort Estimation Model
Jeon, Eung-Seop ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 154~165
A number of attempts to develop methods for measuring software effort have been focused on the area of software engineering and many models have also been suggested to estimate the effort of software projects. Almost all current models use algorithmic or statistical mechanisms, but the existing algorithmic effort estimation models have failed to produce accurate estimates. Furthermore, they are unable to reflect the rapidly changing technical environment of software development such as module reuse, 4GL, CASE tool, etc. In addition, these models do not consider the paradigm shift of software engineering and information systems(i.e., Object Oriented system, Client-Server architecture, Internet/Intranet based system etc.). Thus, a new approach to software effort estimation is needed. After reviewing and analyzing the problems of the current estimation models, we have developed a model and a system architecture that will improve estimation performance. In this paper, we have adopted a neural network model to overcome some drawbacks and to increase estimation performance. We will also address the efficient system architecture and estimation procedure by a similar case-based approach and finally suggest the heuristic search method to find the best estimate of target project through empirical experiments. According to our experiment with the optimally parsimonious neural network model the mean error rate was significantly reduced to 14.3%.
A Design of Efficient Object Management Repository Using Integration Management Model
Seon, Su-Gyun ; Song, Yeong-Jae ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 166~174
Lately computing environment is changing into integrating open system. This paper proposes Integrated Management Model to improve productivity about new software development. The model is divided by Management Model to deal with the rapidly changing environment effectively into three layers: the first layer classifies and displays information to users, the users, the second layer controls function, the integration and management layer, and the last layer manages data, the objects management storage layer. So it designs of Efficient Object Management Repository Using Integration Management Model. This might support afterward prototyping in maximizing the reuse of software, which is advantage to the integration of the system, and in promoting its productivity.
A Study of Optimal Ratio of Data Partition for Neuro-Fuzzy-Based Software Reliability Prediction
Lee, Sang-Un ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 175~180
This paper presents the optimal fraction of validation set to obtain a prediction accuracy of software failure count or failure time in the future by a neuro-fuzzy system. Given a fixed amount of training data, the most popular effective approach to avoiding underfitting and overfitting is early stopping, and hence getting optimal generalization. But there is unresolved practical issues : How many data do you assign to the training and validation set\ulcorner Rules of thumb abound, the solution is acquired by trial-and-error and we spend long time in this method. For the sake of optimal fraction of validation set, the variant specific fraction for the validation set be provided. It shows that minimal fraction of the validation data set is sufficient to achieve good next-step prediction. This result can be considered as a practical guideline in a prediction of software reliability by neuro-fuzzy system.
Design and Development of an XML/EDI System
Sin, Dong-Gyu ; Sin, Dong-Il ;
The KIPS Transactions:PartD, volume 8D, issue 2, 2001, Pages 181~192
XML/EDI is different from traditional EDI because it offers the framework necessary for electronic commerce and extends the scope of the traditional EDI which focuses on data transfer. Since existing EDI services are moved to Internet platform and again to Web platform, users can use EDI in the integrated environment without inconvenience of using different EDI softwares, which have their own configurations. This paper describes the overall design and implementation of a Web-based XML/EDI system that is a core component for the electronic commerce. The constructed XML/EDI system in this paper is comprised of document generation module, document storage module, document search module, document management module, template document management module and e-mail transmission module. Requirements and design goal of XML/EDI system are introduced, detailed functionalities of modules and design facts are described and execution and execution procedures of the implemented system are explained.