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 High-dimensional Index Structure for the support of Concurrency Control
Lee, Yong-Ju ; Chang, Jae-Woo ; Kim, Hang-Young ; Kim, Myung-Joon ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 1~12
DOI : 10.3745/KIPSTD.2003.10D.1.001
Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.
Design and implementation of an XML Repository System supporting Document Version
Son, Chung-Beom ; Oh, Kyoung-Keun ; Yoo, Jae-Soo ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 13~22
DOI : 10.3745/KIPSTD.2003.10D.1.013
Recently, as the Importance of the management on internet documents has highly increased, the research of an XML repository system has been actively made to store, retrieve and manage large XML documents. The version management for XML documents is required in the XML applications such as patent documents, software design and system manual that the modified documents have to be managed. In this paper, we propose a data model based on a fragmentation model that supports document versioning. We also design and implement an XML repository system supporting document versioning. It is shown through Performance evaluation that our system outperforms the existing repository system.
Decision Tree Classifier for Multiple Abstraction Levels of Data
Jeong, Min-A ; Lee, Do-Heon ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 23~32
DOI : 10.3745/KIPSTD.2003.10D.1.023
Since the data is collected from disparate sources in many actual data mining environments, it is common to have data values in different abstraction levels. This paper shows that such multiple abstraction levels of data can cause undesirable effects in decision tree classification. After explaining that equalizing abstraction levels by force cannot provide satisfactory solutions of this problem, it presents a method to utilize the data as it is. The proposed method accommodates the generalization/specialization relationship between data values in both of the construction and the class assignment phase of decision tree classification. The experimental results show that the proposed method reduces classification error rates significantly when multiple abstraction levels of data are involved.
Active Rule Language for XML Document Management
Hwang, Jeong-Hee ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 33~44
DOI : 10.3745/KIPSTD.2003.10D.1.033
XML is the standard for storing and exchanging information in the Web. As the applications of XML become more widespread, the worts on rule-based technology are rapidly going on to support reactive functionality on the XML documents and the XML repositories. Active rules consist of event-condition-action, which automatically perform actions in response to status change of database. Therefore the feature of active rule satisfies the new needs in XML setting. In this paper, we propose not only a XML based active rule language to manage XML document automatically, but also an active rule analysis method to guarantee rule termination. Finally, we demonstrate some examples of active rule defined by the proposed rule language, and also verify the efficiency of our analysis method by comparing with another method.
A Data Model for Past and Future Location Process of Moving Objects
Jang, Seung-Youn ; Ahn, Yoon-Ae ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 45~56
DOI : 10.3745/KIPSTD.2003.10D.1.045
In the wireless environment, according to the development of technology, which is able to obtain location information of spatiotemporal moving object, the various application systems are developed such as vehicle tracking system, forest fire management system and digital battle field system. These application systems need the data model, which is able to represent and process the continuous change of moving object. However, if moving objects are expressed by a relational model, there is a problem which is not able to store all location information that changed per every time. Also, existing data models of moving object have a week point, which constrain the query time to the time that is managed in the database such as past or current and near future. Therefore, in this paper, we propose a data model, which is able to not only express the continuous movement of moving point and moving region but also process the operation at all query time by using shape-change process and location determination functions for past and future. In addition, we apply the proposed model to forest fire management system and evaluate the validity through the implementation result.
An Effective Incremental Text Clustering Method for the Large Document Database
Kang, Dong-Hyuk ; Joo, Kil-Hong ; Lee, Won-Suk ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 57~66
DOI : 10.3745/KIPSTD.2003.10D.1.057
With the development of the internet and computer, the amount of information through the internet is increasing rapidly and it is managed in document form. For this reason, the research into the method to manage for a large amount of document in an effective way is necessary. The document clustering is integrated documents to subject by classifying a set of documents through their similarity among them. Accordingly, the document clustering can be used in exploring and searching a document and it can increased accuracy of search. This paper proposes an efficient incremental cluttering method for a set of documents increase gradually. The incremental document clustering algorithm assigns a set of new documents to the legacy clusters which have been identified in advance. In addition, to improve the correctness of the clustering, removing the stop words can be proposed and the weight of the word can be calculated by the proposed TF
Design of Component Version Management using Reuse Business Model
Kim, Young-Sun ; Oh, Sang-Yeob ; Jang, Deog-Chul ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 67~76
DOI : 10.3745/KIPSTD.2003.10D.1.067
The reuse of software is to use the components of software to be made beforehand to improve the productivity of it. The development of electronic commerce requires it which can be shown from changing the change of business models Reuse is the necessary solution to cope with a rapid change in the electronic commercial transaction. These reuse business models have the defects that they are not offered from version management. This paper has the purpose that by doing the supplementation of defects not to be offered from the version management and by introducing the quick change management about reuse business models, reusing the components and saving a development and reducing a development af period. The reuse of components by the new reuse business models has the advantages to minimize the danger elements from the design to the finish. We use the version management and try to present the method to make the efficiency of reuse by introducing components and managing the elements about components to the version in the technique to accomplish the reuse of software.
An Ideal Team Size in Development and Maintenance Project
Lee, Sang-Un ; Park, Joong-Yang ; Park, Jae-Heong ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 77~84
DOI : 10.3745/KIPSTD.2003.10D.1.077
Experts work teams generally agree that small teams are better than large teams for getting things done. Also, always aim for the lowest practical team size. But what does "small" mean\ulcorner We Introduce to productive metrics such as project delivery rate (PDR) and speed of delivery (SOD) for decision criteria of ideal team size. The experimental is based on the analysis of 300 project data. These data sets are divide in two subgroups. One is a development project ; the other is a maintenance project. As a result of experimental in two subgroup, we come to the conclusion that the molt successful projects has small teams indeed staffed with maximum five persons. This paper presents ideal team size in order to provide information that can be used as a guide in selecting the most practical and productive-based team size for a software development project.t project.
The Design and Implementation of e-BCOS for e-Business Component System
Choi, Ha-Jung ; Kim, Haeng-Kon ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 85~100
DOI : 10.3745/KIPSTD.2003.10D.1.085
Today`s computing system has expanded its application to business trade and distributed work transactions using the Internet. As the demand for more flexible, adaptable, extensible, and robust web-based enterprise, these application development has been gradually expanded based on reusable, independent, and portable components. Component Based Development (CBD) works by developing and evolving software from selected reusable software components and then assembling them within appropriate software architecture. However, it requires an increase in cost to build new components as well as the necessary effort to develop of the business requirement these components. Standardized component models are required as well from the perspective of systems in order to support rapid and exact component information transmission on the web. In this paper, we describe the e-Business Component Development with agent for rapid application development on the web that correspond to the demands of users in the business domain. We design and implement the specifications of e-business components by combining these demands. In order to improve the agent register and retrieval, we propose the intelligent search and register agents, which can conduct more precise searching and specializing for components. The system enables the locating of user`s frequently used components through an agent involving register and retrieval, as well as rapid procedures for registers The e-BCOS (e-Business Component System) is the agent system for the user to register distributed components and to search for components Information. The e-BCOS increases reusability through the e-business component development of distributed components in the business domain. For the share and delivery, specification with XML is acceptable to user`s variable order e-BCOS Includes the effective investment, timeliness, reliability, efficiency, and maintenance effort by with agent.
Optimized Design for Yard Operating System Layout of Automated Container Terminal
Hong, Dong-Hee ; Chung, Tae-Choong ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 101~108
DOI : 10.3745/KIPSTD.2003.10D.1.101
Construction of automated terminal it urgently demanded to gain the foundation of hub-port in north east Asia. Therefore we suggest an adequate operating system layout of automated terminal in Korea. In this paper the aim of automated terminal operating system is satisfied. four basic models are divided according to moving course of export and import cargo of each automated equipments, several input data are changed and analyzed dynamically by Trial and Error method, and then an optimized operating system model is selected, and designed for yard operating system layout on the basis of the selected model. Particularly, the productivity of automated port is up to the kind of automated equipments. However, because expense and present work process must be considered actually. In order to prevent confusion of the work, the method to optimize the present work and substitute prevent equipments and automated equipments was designed. It is a premise that ail the yard equipments described in this paper must be automatic except quay crane.
A CORBA-Based Collaborative Work Supported Medical Image Analysis and Visualization System
Chun, Jun-Chul ; Son, Jae-Gi ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 109~116
DOI : 10.3745/KIPSTD.2003.10D.1.109
In this paper, a CORBA-based collaborative medical image analysis and visualization system, which provides high accessibility and usability of the system for the users on distributed environment is introduced. The system allows us to manage datasets and manipulates medical images such as segmentation and volume visualization of computed geometry from biomedical images in distributed environments. Using Bayesian classification technique and an active contour model the system provides classification results of medical images or boundary information of specific tissue. Based on such information, the system can create real time 3D volume model from medical imagery. Moreover, the developed system supports collaborative work among multiple users using broadcasting and synchronization mechanisms. Since the system is developed using Java and CORBA, which provide distributed programming, the remote clients can access server objects via method invocation, without knowing where the distributed objects reside or what operating system it executes on.
A Virtual Microscope System for Educational Applications
Cho, Seung-Ho ; Beynon, Mike ; Saltz, Joel ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 117~124
DOI : 10.3745/KIPSTD.2003.10D.1.117
The system implemented in this paper partitions and stores specimen data captured by a light microscope on distributed or parallel systems. Users ran observe images on computers as we use a physical microscope. Based on the client-server computing model, the system consists of client, coordinator, and data manager. Three components communicate messages. For retrieving images, we implemented the client program with necessary functions for educational applications such at image mark and text annotation, and defined the communication protocol. We performed the experiment for introducing a tape storage which stores a large volume of data. The experiment results showed performance improvement by data partitioning and indexing technique.
Design and Implementation of Transportation Reservation Agent System
Hwang, Hyeon-A ; Lim, Han-Kyu ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 125~132
DOI : 10.3745/KIPSTD.2003.10D.1.125
The Internet reservation service is one of the most utilized internet services, specifically the agent efficiently supports this reservation services. The Agent will replace the repetitious reservation process and selectively offering the most proper service information. In this study, the user assisting agent system that can enable people to make reservation of public transportations through the internet is designed and implemented. This system consists of multiple agents that are Interface agent, 4ask agents and filtering agent. The interface agent is an arbitrator of this system that analyzes user`s demand and integrate agent`s result. And it has user-adaptive capability using case-based reasoning. There are three task agents if this system, it executes information gathering and information-change monitoring of each. Filtering agent extracts information only about reservation status in gathered information. Finally, this system is to offer integrated information of the reservation status about train and airplane and execute the simple-repetitious works for the reservation instead of user by agents.
SCOPML and SCOPBrowser
Ahn, Geon-Tae ; Yoon, Hyeong-Seok ; Hwang, Eui-Yoon ; Kim, Jin-Hong ; Lee, Myung-Joon ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 133~142
DOI : 10.3745/KIPSTD.2003.10D.1.133
The major challenge for post-genomic study is to identify structural similarity and relationships of proteins. SCOP (Structural Classification of Proteins) is a typical database for this purpose, providing a derailed description of the structural and functional relationships of the proteins whose three-dimensional structures have been determined. Unfortunately, since the SCOP data is only available as a plain text format, it is cumbersome and error-prone to develop tools and resources to utilize the data more effectively. To meet these researchers to utilize the data more effectively. To meet these requirements, we have developed an XML representation for the SCOP site, users of the tool, named, SCOPBrowser, for effective search of SCOP database. In addition to the information available from the SCOP site, users of the tool can obtain various information such as viewing the tree hierarchy of structure classification of proteins, searching into whole protein domains, showing XML contents of a specific domain, and some useful statistics about protein structures.
A Web Services-based Client OLAP API and Its Application to Cube Browsing
Bae, Eun-Joo ; Kim, Myung ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 143~152
DOI : 10.3745/KIPSTD.2003.10D.1.143
XML and Web Services draw a lot of attention as standard technologies for data exchange and integration among heterogeneous platforms XML/A, which supports such technologies, is a SOAP based XML APl that facilitates data exchange between a client application and a data analysis engine through the Internet. The fact that the XML format is used for data exchange makes XML/A to be platform-independent. However. client application developers have to go through a tedious Job of treating the same type of XML documents fur downloading data from the server. Also, an XML query language is needed for extracting data from the XML documents sent by the server. In this paper, we present a high level client OLAP API, called DXML, for the client application developers in the windows environment to easily use the OLAP services of XML/A. XMLMD consists of properties and methods needed for OLAP application development. XMLMD is to XML/A what ADOMD is to OLEDB for OLAP. We also present a web OLAP cube browser that is developed using XMLMD. The browser display`s data in various formats such as XML, HTML, Excel, and graph.
Design and Implementation of Dynamic Peer Selection Scheme for Allocating Proxy-Server on Pure P2P Network Environments
Kim, Young-Jin ; Kim, Moon-Jeong ; Kim, Ung-Mo ; Eom, Young-Ik ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 153~160
DOI : 10.3745/KIPSTD.2003.10D.1.153
Recently, deployments of firewalls and NATs ire increasing to provide network security features or to solve the problem of public IP shortage. But, in these environments, peers in different firewall or NAT environments may get limited services because they cannot open direct communicate channels. This can be a significant problem in pure P2P environments where the peers should get or provide services by opening direct channels among themselves. In this paper, we propose a scheme for dynamically selecting a peer that fan be used as a proxy server. The proxy server supports the communication between the peers in different firewall or NAT environments. The proposed scheme is operating system independent and supports bidirectional communication among the peers in P2P environments. Additionally, the proposed scheme can distribute network traffic by dynamically allocating proxy servers to the peers that is not located in the firewall or NAT environments.
An Effect Analysis for Improvement of Information Lead Time on Supply Chains : A Case Study of Manufacturing Industry
Kim, Chul-Soo ; Kim, Garp-Choong ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 161~166
DOI : 10.3745/KIPSTD.2003.10D.1.161
Information lead time is defined as the time spent by processing orders from some buyers, whereas order lead time is defined as producing and supplying the products. The information lead time significantly serve to magnify the increase in variability due to demand forecasting. This paper models a decentralized supply chain composed of cascade type which has four type phases (or divisions) such as retailer, wholesaler, distributor, and factory. Each phases is managed by different centers individually with their own local inventory information. We investigate whether each phase`s Information lead time affects companies networked a value chain. In particular, on several experiments performed with a programmed simulation (like a MIT beer game), we study the following question ; Can information lead times do better than material lead times in cost-benefit perspective\ulcorner Can more much Information lead times in downstream reasonably do worser than in upstream when playing the simulation\ulcorner In the conclusion, we show the importance of information lead time on a SC and, besides, guarantee that improvement of information lead time in upstream do more effective than one in downstream in cost-benefit perspective.
Design and Implementation of an E-Catalog System for the Efficiency of Electronic Commerce
Choi, Ok-Kyung ; Han, Sang-Yong ;
The KIPS Transactions:PartD, volume 10D, issue 1, 2003, Pages 167~174
DOI : 10.3745/KIPSTD.2003.10D.1.167
Today in Korea, various types of B2B or B2C businesses are carried out on the Internet and the catalog information is the molt important factor to make customers purchase the product. However, no case can be found where information is shared between the business partners, more specifically, each catalog supplier possesses data that are incompatible with others. Though the e-business market has rapidly expanded, it is still difficult for businesses to attract buyers unless an integrated system is provided for more fast and convenient B2B businesses. Such a systematic and integrated catalog system is highly demanded along with current database management system Therefore, this study suggests the E-Catalog system consists of a fixed and standardized catalog system offering product information and a network-based architecture offering products to customers through a search system. The proposed system also supports CRM (Customer Relation Management).