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
Algorithm for Topological Relationship On an Indeterminate Spatiotemporal Object
Ji, Jeong-Hui ; Kim, Dae-Jung ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 873~884
DOI : 10.3745/KIPSTD.2003.10D.6.873
So far, significant achievements have been studied on the development of models for spatial and spatiotemporal objects with indeterminate boundaries which are found in many applications for geographic analysis and image understanding. Therefore, in this paper we propose the spatiotemporal data model which is applicable for spatial and spatiotemporal objects with uncertainty. Based on this model, we defined topological relationships among the indeterminate spatiotemporal objects and designed the algorithm for the operations. For compatibility with existing spatial models, the proposed model has been designed by extending the spatiotemporal object model which is based on the open GIS specification. We defined indeterminate spatial objects, such as the objects whose position and the shape change discretely over time, and the objects whose shape changes continuously as well as the position. We defined topological relationships among these objects using the extended 9-IM. The proposed model can be efficiently applied to the management systems of natural resource data, westher information, geographic information. and so on.
Techniques for Acquisition of Moving Object Location in LBS
Min, Gyeong-Uk ; Jo, Dae-Su ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 885~896
DOI : 10.3745/KIPSTD.2003.10D.6.885
The typws of service using location Information are being various and extending their domain as wireless internet tochnology is developing and its application par is widespread, so it is prospected that LBS(Location-Based Services) will be killer application in wireless internet services. This location information is basic and high value-added information, and this information services make prior GIS(Geographic Information System) to be useful to anybody. The acquisition of this location information from moving object is very important part in LBS. Also the interfacing of acquisition of moving object between MODB and telecommunication network is being very important function in LBS. After this, when LBS are familiar to everybody, we can predict that LBS system load is so heavy for the acquisition of so many subscribers and vehicles. That is to say, LBS platform performance is fallen off because of overhead increment of acquiring moving object between MODB and wireless telecommunication network. So, to make stable of LBS platform, in this MODB system, acquisition of moving object location par as reducing the number of acquisition of unneccessary moving object location. We study problems in acquiring a huge number of moving objects location and design some acquisition model using past moving patternof each object to reduce telecommunication overhead. And after implementation these models, we estimate performance of each model.
The Training Data Generation and a Technique of Phylogenetic Tree Generation using Decision Tree
Chae, Deok-Jin ; Sin, Ye-Ho ; Cheon, Tae-Yeong ; Go, Heung-Seon ; Ryu, Geun-Ho ; Hwang, Bu-Hyeon ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 897~906
DOI : 10.3745/KIPSTD.2003.10D.6.897
The traditional animal phylogenetic tree is to align the body structure of the animal phylums from simple to complex based on the initial development character. Currently, molecular systematics research based on the molecular, it is on the fly, is again estimating prior trend and show the new genealogy and interest of the evolution. In this paper, we generate the training set which is obtained from a DNA sequence ans apply to the classification. We made use of the mitochondrial DNA for the experiment, and then proved the accuracy using the MEGA program which is anaysis program, it is used in the biology field. Although the result of the mining has to proved through biological experiment, it can provede the methodology for the efficient classify and can reduce the time and effort to the experiment.
A Data Generator for Database Benchmarks and its Performance Evaluation
Ok, Eun-Taek ; Jeong, Hoe-Jin ; Lee, Sang-Ho ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 907~916
DOI : 10.3745/KIPSTD.2003.10D.6.907
Database benchmarks require efficient of large-scale data. This presents the system architecture, control flows, and characteristics of the data generator we have developed. The data generator features generation of large-scale data, column-by-column data generation, a number of data distributions and verification, and real data generation. An extensive conparison with other data generators in terms of function is also presented. Finally, empirical performance experiments between RAID systems and non-RAID one have been conducted to alleviate I/O bottleneck. The test results can serve as guidelines to help confifure system architecture.
Policy for reducing update duration of materialized views by distinguishing Insertion/Deletion operations
Kim, Geun-Hyeong ; Lee, Dong-Cheol ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 917~926
DOI : 10.3745/KIPSTD.2003.10D.6.917
More views in data warehouse, can respond to the users more rapidly because the user`s requests may be processed by utilizing only the materialized views with higher probabilities rather than accessing base relations. But, more views cause longer update duration of all the materialized views. During the update time, queries of users can not be processed because accesses to the datawarehouse are blocked. Thus, the update durations of the materialized views are necessary to be reduced. In this paper, we propose algorithm the update duration of the materialized views owing to managing by distinguishing insecton/deletion operations. Though there might overheads for distinguishing insertion/deletion, we concluded that the proposed algorithm could be excellent than others.
Block Histogram Compression Method for Selectivity Estimation in High-dimensions
Lee, Ju-Hong ; Jeon, Seok-Ju ; Park, Seon ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 927~934
DOI : 10.3745/KIPSTD.2003.10D.6.927
Database query optimates the selectivety of a query to find the most efficient access plan. Multi-dimensional selectivity estimation technique is required for a query with multiple attributes because the attributes are not independent each other. Histogram is practically used in most commercial database products because it approximates data distributions with small overhead and small error rates. However, histogram is inadequate for a query with multiple attributes because it incurs high storage overhead and high error rates. In this paper, we propose a novel method for multi-dimentional selectivity estimation. Compressed information from a large number of small-sized histogram buckets is maintained using the discrete cosine transform. This enables low error rates and low storage overheads even in high dimensions. Extensive experimental results show adventages of the proposed approach.
An Online Scaling Method for Improving the Availability of a Database Cluster
Lee, Chung-Ho ; Jang, Yong-Il ; Bae, Hae-Yeong ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 935~948
DOI : 10.3745/KIPSTD.2003.10D.6.935
An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica`s condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.
Design of ALTIBASE(TM) Storage Manager for High Performance and High Availability
Jeong, Gwang-Cheol ; Lee, Gyu-Ung ; Bae, Hae-Yeong ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 949~960
DOI : 10.3745/KIPSTD.2003.10D.6.949
Main memory database systems use the different implementation techniques to sturucture and organize the user dta and system catalogs, since traditional database systems are optimized for the characteristics of disk storage environment. We present, in this paper, the design considerations for our main memory database system
that is currently applied to the time-critical applications. We focus on the design issues of storage manager in
. The major components are introduced, and features and characteristics of transaction management and recovery method are described. We also present the database replication mechanism and its conflict resolution mechanism for high availability and performance. In order to evaluate our transaction performance, we show various experimental reports as measured by the TPS.
Client Cache Management Scheme For Data Broadcasting Environments
Kwon, Hyeok-Min ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 961~970
DOI : 10.3745/KIPSTD.2003.10D.6.961
In data broadcasting environments, the server periodically broadcasts data items in the broadcast channel. When each client wants to access any data item, it should monitor the broadcast channel and wait for the desired item to arrive. Client data caching is a very effective technique for reducing the time spent waiting for the desired item to be broadcastted. This paper proposes a new client cache management scheme, named LRU-CFP, to reduce this waiting time ans evaluates its performance on the basis of a simulation model. The performance results indicate that LRU-CFP scheme shows superior performance over LRU, GRAY and CF in the average response time.
Metamodels and Verification Rules for Verifying the Correctness of UML Diagrams
Ha, Il-Kyu ; Kang, Byung-Wook ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 971~982
DOI : 10.3745/KIPSTD.2003.10D.6.971
The consistency of UML diagrams is a nature for checking whether diagrams are coherently designed with only one requirements and the correctness of UML Diagrams, especially it uses OCL(Object Constraint Language) which is standard constraint language in UML. Firstly we devise metamodels that are described with conponent and relationships, then we derive verification rules from each matamodels for verifying correctness and consistency, and then we formally specify the rules with OCL for automatic verification. Finally we verify the rules with USE TOOL.
프로세스 패턴에 기반한 컴포넌트 품질보증 프로세스의 구축
Hwang, Sun-Myung ; Kim, Gil-Jo ; Kim, Jin-Sam ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 983~990
DOI : 10.3745/KIPSTD.2003.10D.6.983
Developing a component-bassed software requires verified and standardized software components. This paper presents and approach to build conponent quality assurance process based on process patterns. To describe process patterns, a metamodel is suggested and several process for software components. The process pattern approach was applied to real projects and its advantages and disadvantages are discussed.
A Research to Enhance the Fault Tolerance of the CORBA Based Traffic Information Systems
Seh, Woon-Suk ; Ryu, Kwang-Taek ; Lee, Eun-Seok ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 991~998
DOI : 10.3745/KIPSTD.2003.10D.6.991
There are many methods to enhance the fault tolerance of the CORBA based real time systems by viewpoints. Among them, this paper provides a method to enable seamless services where the systems based on the CORBA have object`s faults originated processing real time information. Namely, this paper observes a method to deal efficiently with object`s faults happening in 3 tier architecture environments. It is possible to replicate objects as a way to enhance the fault tolerance considering object`s faults. Along with it, this paper shows a method to enhance the fault tolerance ultimately and then keep the service continuity by prividing a way to allow to continue to run the systems until the FT-CORBA based one`s faults are recovered.
Program Slicing in the Presence of Complicated Data Structure
Ryu, Ho-Yeon ; Park, Joong-Yang ; Park, Jae-Heung ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 999~1010
DOI : 10.3745/KIPSTD.2003.10D.6.999
Program slicing is s method to extract the statements from the program which have an influence on the value of a variable at a paricular point of the program. Program slicing is applied for many applications, such as program degugging, program testing, program integration, parallel program execution, software metrics, reverse engineering, and software maintenance, etc. This paper is the study to create the exact slice in the presence of Object Reference State Graph to generate more exactly static analysis information of objects in the program of the presence of complicated data structure.
Workflow Management System for Application Integration
Yoon, Seok-Hyun ; Oh, Myeong-Eun ; Han, Sang-Yong ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1011~1016
DOI : 10.3745/KIPSTD.2003.10D.6.1011
To cope with rapidly changing enterprise environment, many business entities introduce EAI, which integrates applications by installing middleware. But existing EAI has a serious problem that is to import imddleware-dependent coding method to integrate systems, using different middlewares. In this paper, we suggest middleware independent `Workflow Management System` which efficiently integrates applications of various middleware systems with `Duplicate EAI Adapter`, `state chart` and `XML` technology.
Development of an efficient Service Management on Jini HomeNetwork
Jung, Jun-Young ; Jung, Min-Soo ; Kim, Kwang-Soo ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1017~1024
DOI : 10.3745/KIPSTD.2003.10D.6.1017
Jini is a promising HomeNetworking middleware of computing environment based on Java Technology. To support Homenetwork service based on Jini, Jini device requires a successive operation and complicated management. In this paper, our service management system is a service provider component and lookup service component including automation module. Our automatin module privide searching and setting function of a library, runtime environment and class file system cinfiguration information for Jini service. Our system can be accomplished by automation of runtime environment, simplification of service management structure, visualization of service execution.
Sequential Percentile Estimation for Sequential Steady-State Simulation
Lee, Jong-Suk ; Jeong, Hae-Duck ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1025~1032
DOI : 10.3745/KIPSTD.2003.10D.6.1025
Percentiles are convenient measures of the entire range of values of simulation outputs. However, unlike means and standard deviations, the observations have to be stored since calculation of percentiles requires several passes through the data. Thus, percentile (PE) requires a large amount of computer storage and computation time. The best possible computation time to sort n observations is (O(
)), and memory proportional to n is required to store sorted values in order to find a given order statistic. Several approaches for extimating percentiles in RS(regenerative simulation) and non-RS, which can avoid difficulties of PE, have been proposed in [11, 12, 21]. In this paper, we implemented these three approaches known as : leanear PE, batching PE, spectral
PE in the context of sequential steady-state simulation. Numerical results of coverage analysis of these PE approachs are present.
A Design of Protocol for Credit Card Transaction on PDA Using ECC
Yu, Seong-Jin ; Kim, Seong-Youl ; Youn, Chun-Kyun ; Chung, Il-Yong ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1033~1040
DOI : 10.3745/KIPSTD.2003.10D.6.1033
In order to provode information services on M-Commerce, a payment solution with security function should be required. User`s mobile terminals for using M-Commerce services are diversifying to cellular phone, PDA, Smart phone etc. Among them, intergration of PDA`s interface and mobile connection overcomes the weak point of existing cullular phone depending on information via the internet. In this paper, the protocol for a credit card transaction on PDA using ECC is presented. Secure Card module on this protocol encrypts user`s information such as private information, delivery information and credit card information and store them on PDA in order to free from inputting information whenever it is used. This scheme also offers security services on M-Commerce including authentication, confidentiality, integration, non-repudiation and so on.
Implementation of the mote Image Based Metering System bridging with PCS Network
Lee, Chang-Su ; Na, Jong-Ray ; Hwang, Jin-Kwon ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1041~1048
DOI : 10.3745/KIPSTD.2003.10D.6.1041
This paper implements a remote image based metering(IBM) system which capture meter image, recognizes number automatically, and send the data wirelessly through PCS data network. We use existing gas/water meter and get NTSC camera image by installing small monochrome CMOS camera on the meter closely. For remote data transfer, we use SMS (short message service) that is provided by commercial PCS network. We developed DVR(digital video recorder) for capturing meter image and character recognition algorithm. In addition, hardware and software for SMS and meter selector were developed.
An Exploratory Study for Identifying Success Factors in On-line Games: Analysis of Game players` Behavior
Jung, Jai-Jin ; Kim, Tae-Ung ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1049~1058
DOI : 10.3745/KIPSTD.2003.10D.6.1049
The last few years have been a boom time for the online gaming industry. Internet-based online games have made an increasingly popular form of entertainment. The gaming industry estimates that online gaming players reach over 26 million in 2002. The rapid development of online game-contents and related information technology shall increase the size of industry and have a profound impact on many ways of our living and sociaty. This paper develops the exploratory LISREL model for identifying the factors attecting the players` loyalty for some specific brand of online games. The concept of flow, word of mouth, feedback, challenge, social norms, and online community activities, etc, are all introduced into the model, as the independent variables affecting the loyalty directly and indirectly. Based on data collected from online questionnaire survey, the validity of the model has been tested and interesting conclusions have been developed concerning the relationships between the loyalty, flow, word of mouth and other set of independent vareables. It is hoped that this result might provide the useful guidelines for developing the successful online game contents.
A Credit Card Sensing System based on Shared Key for Promoting Electronic Commerce
Jang, Si-Woong ; Shin, Byoung-Chul ; Kim, Yang-Kok ;
The KIPS Transactions:PartD, volume 10D, issue 6, 2003, Pages 1059~1066
DOI : 10.3745/KIPSTD.2003.10D.6.1059
In this paper, the magnetic sensing system is designed and implemented for the safe security in internet commerce system. When the payment is required inthe internet commerce system, the magnetic sensing system will get the information from a credit card without keyboard input and then encrypt and transmit the information to server. The credit card sensing system, which is proposed in this paper, is safe from keyboard hacking because it encrypts card information immediately in its internal chip and sends the information to host system. For the protection of information, the magnetic sensing system is basically based on a synchronous stream cipher cryptosystem which is related to a group of matrices. The size of matrices and the bits of keys for the best performances are determined for various cases. It is shown that for credit card payments. matrices of size 2 have good performance even at most 128bits keys with the consideration of inverse matrices. For authentication of general-purpose data, the magnetic sensing system needs more than 1.5KB data and in this case, the optimum size of matrices is 2 or 3 at more 256bits keys with consideration of inverse matrices.