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
Design and Implementation of Object Reusing Methods for Mobile Vector Map Services
김진덕 ; 최진오 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 359~359
Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.
An XML Schema Manager based on the User-defined XML View
정채영 ; 김영옥 ; 이미영 ; 강현석 ; 배종민 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 367~367
A mediator-wrapper system, which is one of integration methods of heterogeneous databases, preserves a virtual integrated view rather than physical movement of the contents of each database. In order for a mediator to preserve a virtual integrated view, it requires the schema manager of the wrapper which communicates with local databases. This paper presents a schema manager of a wrapper that provides a mediator with XML schema which is generated from relational database schema. The XML schema manager supports a user-defined XML view. We present the view tree model which is used for materializing the use-defined XML view to generate XML schema, and the conversion algorithm based on the proposed view tree model. This model is can be uniformly applied to all schema managers of heterogeneous information sources.
A Mobile Agent-based Grouping Method for enhancing Performance of Mobile Database Management Systems
신성욱 ; 정동원 ; 이정욱 ; 백두권 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 375~375
A rapid growth of mobile devices and a proliferation of wireless networks lead to changing the existing environment into a mobile environment. Expansion of mobile environment makes a pressing need of mobile databases, and there are several solutions to achieve it. But they still accompany with some problems. Especially, the current synchronization server that manages consistently many mobile database management systems is based on the centralized method to synchronize data between the mobile database systems. It is the major factor that causes the lower performance of the whole system. Furthermore, the fault tolerance has not been considered in the existing systems. Therefore, we suggest the mobile agent-based mobile database system in order to resolve the problems. The system, we propose in this paper, provides the high-performance of the whole system by mobile grouping, and also may support a fault-tolerance management method.
Performance Evaluation of XML Materialized View Refresh
성호상 ; 문찬호 ; 강현철 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 387~387
Materialized views have received much attention for query performance improvement. They need to be refreshed whenever their underlying data sources are updated. They could be recomputed from scratch or they could be incrementally refreshed by reflecting only those portions of updates that affect them. With emergence of XML as the standard for data exchange on the Web, active research is under way on effectively storing and retrieving XML documents. In this paper, we describe a performance study on the incremental refresh of XML materialized views for the case where XML documents are stored in a relational DBMS, and XML materialized views are maintained with incremental refresh. We describe implementation of a prototype XML storage system that supports XML materialized views and their incremental refresh, and report the performance results obtained with the implemented system through a detailed set of experiments on the incremental refresh of XML materialized views. The results show that the XML view maintenance with incremental refresh outperforms the ordinary view recomputation.
XML-OGL : UML-based Graphical Language for Querying XML Docunents
하얀 ; 김기한 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 399~399
The widespreading of XML as a standard for semi-structured documents on the Web opens up challenging opportunities for Web query language. And UML is a graphical language to represent the result of object-oriented analysis and design. In this paper, we introduce an UML-based graphical query language for XML documents. The use of a visual formalism for representing the syntax and semantics of queries enables an intuitive expression of queries, even when they are rather complex. And, it is matched a series of processes to store and retrieve XML documents to OODBMS with the use of an uniform visualization for representing both the content of XML documents (and of their DTD) and the syntax and semantics of queries.
An Extension of the DBMax for Data Warehouse Performance Administration
김은주 ; 용환승 ; 이상원 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 407~407
As the usage of database systems dramatically increases and the amount of data pouring into them is massive, the performance administration techniques for using database systems effectively are getting more important. Especially in data warehouses, the performance management is much more significant mainly because of large volume of data and complex queries. The objectives and characteristics of data warehouses are different from those of other operational systems so adequate techniques for performance monitoring and tuning are needed. In this paper we extend functionalities of the DBMax, a performance administration tool for Oracle database systems, to apply it to data warehouse systems. First we analyze requirements based on summary management and ETL functions they are supported for data warehouse performance improvement in Oracle 9i. Then, we design architecture for extending DBMax functionalities and implement it. In specifics, we support SQL tuning by providing details of schema objects for summary management and ETL processes and statistics information. Also we provide new function that advises useful materialized views on workload extracted from DBMax log files and analyze usage of existing materialized views.
An Effective Algorithm for Subdimensional Clustering of High Dimensional Data
박종수 ; 김도형 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 417~417
The problem of finding clusters in high dimensional data is well known in the field of data mining for its importance, because cluster analysis has been widely used in numerous applications, including pattern recognition, data analysis, and market analysis. Recently, a new framework, projected clustering, to solve the problem was suggested, which first select subdimensions of each candidate cluster and then each input point is assigned to the nearest cluster according to a distance function based on the chosen subdimensions of the clusters. We propose a new algorithm for subdimensional clustering of high dimensional data, each of the three major steps of which partitions the input points into several candidate clutters with proper numbers of points, filters the clusters that can not be useful in the next steps, and then merges the remaining clusters into the predefined number of clusters using a closeness function, respectively. The result of extensive experiments shows that the proposed algorithm exhibits better performance than the other existent clustering algorithms.
Efficient Processing method of OLAP Range-Sum Queries in a dynamic warehouse environment
전석주 ; 이주홍 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 427~427
In a data warehouse, users typically search for trends, patterns, or unusual data behaviors by issuing queries interactively. The OLAP range-sum query is widely used in finding trends and in discovering relationships among attributes in the data warehouse. In a recent environment of enterprises, data elements in a data cube are frequently changed. The problem is that the cost of updating a prefix sum cube is very high. In this paper, we propose a novel algorithm which reduces the update cost significantly by an index structure called the Δ-tree. Also, we propose a hybrid method to provide either approximate or precise results to reduce the overall cost of queries. It is highly beneficial for various applications that need quick approximate answers rather than time consuming accurate ones, such as decision support systems. An extensive experiment shows that our method performs very efficiently on diverse dimensionalities, compared to other methods.
A New Optimistic Concurrency Control Method for Mobile Transactions
김치연 ; 배석찬 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 439~439
A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.
Finding Frequent Itemsets based on Open Data Mining in Data Streams
장중혁 ; 이원석 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 447~447
The basic assumption of conventional data mining methodology is that the data set of a knowledge discovery process should be fixed and available before the process can proceed. Consequently, this assumption is valid only when the static knowledge embedded in a specific data set is the target of data mining. In addition, a conventional data mining method requires considerable computing time to produce the result of mining from a large data set. Due to these reasons, it is almost impossible to apply the mining method to a realtime analysis task in a data stream where a new transaction is continuously generated and the up-to-dated result of data mining including the newly generated transaction is needed as quickly as possible. In this paper, a new mining concept, open data mining in a data stream, is proposed for this purpose. In open data mining, whenever each transaction is newly generated, the updated mining result of whole transactions including the newly generated transactions is obtained instantly. In order to implement this mechanism efficiently, it is necessary to incorporate the delayed-insertion of newly identified information in recent transactions as well as the pruning of insignificant information in the mining result of past transactions. The proposed algorithm is analyzed through a series of experiments in order to identify the various characteristics of the proposed algorithm.
Design and Performance Analysis of a Parallel Cell-Based Filtering Scheme using Horizontally-Partitioned Technique
장재우 ; 김영창 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 459~459
It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.
A BPN model for Web-based Business Process Reengineering and Specification
장수진 ; 최상수 ; 이강수 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 471~471
A web-based information system, that is a dominant type of information systems, suffers from the “web crisis” in development and maintenance of the system. To cope with the problem, a technology of reengineering to web-based business process, which is one of web engineering, is strongly needed. In this paper, we propose a BPN(Business Process Net) model and reengineering guides along with an application example, which are used for modeling web-based business processes and migrating to web-based information system. BPN model is a type of not only a Beta-distributed stochastics Petri net, but also an executable Activity diagram. BPN is modeled by using the Use Case analysis method and the Beta-distribution. The later is used for the purpose of modeling the uncertainty of execution time and cost of a business process. BPN model and reengineering heuristics might be used as a formal common model for business process specification languages, and analysis and design method for Web-based Information system, respectively.
A Study on an Efficient Environment for Web Applications Development
강병도 ; 이미경 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 489~489
Due to the rapid growth of Internet, modern software applications must support many web-based functionalities than traditional software applications. These web-based functional supports increase the complexity of software architecture and the cost of software development. Therefore, the development of an efficient environment that web characteristics are well reflected is the most important. In this thesis, we have presented an efficient environment for development of web applications. For the presented environment, after considering the web characteristics, we defined a Process for web applications and modeling environment. The Presented environment has three main functions : ① it Provides a modeling environment for design of web-based applications, ② it has a modeling language called WML(web-application modeling language), ③ it automatically extracts web pages from diagrams. As a result, using the three main functions of the presented environment, we can easily design, develop, and maintain the web applications.
Similarity-Based Subsequence Search in Image Sequence Databases
김인범 ; 박상현 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 501~501
This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.
Implementation of a Scenario Editing and Practicing System Based on XML
김신우 ; 신기호 ; 박성은 ; 이용규 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 513~513
In order to represent a play script using XML, a DTD has been defined and used on the web. However, it is not easy to make XML scripts using text editors for a writer who is not familiar with XML. Moreover, editors do not help actor/actresses use XML scripts for practicing plays. In this research, we develop a syntax-directed XML editor designed for writing XML scripts easily. Also, we implement a system that help actor/actresses practice plays together with multi-clients. Play events are synchronized by a time server synchronizing clocks of participants. We have evaluated the performance of various event implementation techniques through experiments and have used an appropriate technique for synchronizing play events. By using the system, a play writer can easily make an XML script and actor/actresses practice the play using the script.
Design and Implementation of a Video-conference System supporting H.323 and SIP
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 521~521
Various multimedia application services have been developed with techniques of high speed networks and computer. Among these services, a video-conference system over internet is useful and important, and its standardization has been shown in ITU-T H.323 and IETF SIP. H.323 standardization is currently used in many products, but two standardizations will coexist for a long time. Since the interoperability is needed between two standardizations, H.323-SIP gateway is developed for it. In audition, a video-conference system supporting two standardizations is necessary to be developed. We have implemented the video-conference terminal supporting both ITU-T H.323 and IETF SIP standardizations over internet. The system implementation has been designed using the common modules of two standardizations maximally, and the interoperability among different systems is satisfied through experiments.
Design of Solar Radiation Energy Data Management System
오인배 ; 안윤애 ; 류근호 ; 김광득 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 531~531
Because of the rapid increase of energy consumption, we have some problems such as environmental pollution, global warming, the oil shocks, and so on. To solve these problems, concern about renewable energy such as solar energy, wind force, and water energy is continuously increasing. America, Europe, and Japan have developed a system that manage and utilize the information of the renewable energy resources. However, in the domestic, renewable energy information system was not effectively built yet. Therefore, in this paper, we propose a renewable energy information system, which store and manage solar radiation energy data. We implemented the system using ArcView GIS. Also the system is able to retrieve the information from the energy database through various spatiotemporal queries. In addition, user can identify the results of summary data in the form of chart, graph, and counter line. The implemented system is supplied to the user through the web by ArcIMS.
Practically Secure and Efficient Random Bit Generator Using Digital Fingerprint Image for The Source of Random
박승배 ; 주낙근 ; 강문설 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 541~541
We present a random bit generator that uses fingerprint image as the source of random, and the random bit generator is the first generator in the world that uses biometric information for the source of random in the world. The generator produces, on the average, 9,334 bits a fingerprint image in 0.03 second, and the produced bit sequence passes all 16 statistical tests that are recommended by NIST for testing the randomness.
Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval
하진석 ; 구경이 ; 박재현 ; 김유성 ;
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 547~547
From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user′s query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.
A System Implementation for Issuing and Verifying the Electronic Receipt for M-Commerce
The KIPS Transactions:PartD, volume 10, issue 3, 2003, Pages 559~559
As cell phone and PDA have been in common use recently, there is a growing tendency to utilize the mobile terminals for M-Commerce. The information security and the receipt of e-trade are very important to support reliable digital transactions in wireless environment as in wired environment. Even though some work such as WML digital signature and WPKI has been studied for M-Commerce, there are several problems on the aspects of the functional limitation of the mobile terminals and the unsecure data transformation of WAP gateway. In this study we have designed and implemented a prototype system of issuing and verifying the electronic receipt that guarantees authentication, data integrity and non-repudiation for secure mobile e-commerce. Moreover, we have enhanced the system performance by letting the trusted independent server verify and manage the electronic receipt.