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 12D, Issue 7 - Dec 2005
Volume 12D, Issue 6 - Dec 2005
Volume 12D, Issue 5 - Oct 2005
Volume 12D, Issue 4 - Aug 2005
Volume 12D, Issue 3 - Jun 2005
Volume 12D, Issue 2 - Apr 2005
Volume 12D, Issue 1 - Feb 2005
Selecting the target year
Skewed Data Handling Technique Using an Enhanced Spatial Hash Join Algorithm
Shim Young-Bok ; Lee Jong-Yun ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 179~188
DOI : 10.3745/KIPSTD.2005.12D.2.179
Much research for spatial join has been extensively studied over the last decade. In this paper, we focus on the filtering step of candidate objects for spatial join operations on the input tables that none of the inputs is indexed. In this case, many algorithms has presented and showed excellent performance over most spatial data. However, if data sets of input table for the spatial join ale skewed, the join performance is dramatically degraded. Also, little research on solving the problem in the presence of skewed data has been attempted. Therefore, we propose a spatial hash strip join (SHSJ) algorithm that combines properties of the existing spatial hash join (SHJ) algorithm based on spatial partition for input data set`s distribution and SSSJ algorithm. Finally, in order to show SHSJ the outperform in uniform/skew cases, we experiment SHSJ using the Tiger/line data sets and compare it with the SHJ algorithm.
An XPath Accelerator on Relational Databases: An Implementation and Its Tuning
Shin Jin-Ho ; Na Gap-Joo ; Lee Sang-Won ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 189~198
DOI : 10.3745/KIPSTD.2005.12D.2.189
XML is rapidly becoming the standard for data representation and exchange, and XML documents are being adopted in various applications. Since the late 1990s, some native XML database management systems(DBMSs) have been developed. More recently, commercial relational DBMS vendors try to incorporate full functionalities of XML into their products, such as Oracle, MS SQL and IBM DB2. In this paper, we implement a well-known RDBMS-based XML data storage and indexing technique, called XPath Accelerator, and tune it in an industry-leading RDBMS. Our contributions are two-folds: 1) an in-depth implementation of the XPath Accelerator technique and 2) its tuning to exploit the advanced query processing techniques of an RDBMS.
WeXGene: Web-based XML Data Generator
Shin Sun Mi ; Jeong Hoe Jin ; Lee Sang Ho ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 199~210
DOI : 10.3745/KIPSTD.2005.12D.2.199
We need XML generate various kinds of XML data to evaluate XML database systems. Existing XML data generators are developed to generate XML data that are suitable for particular evaluation methods, and their functionalities are limited in terms of generating XML data This paper introduces a new XML data generator, WeXGene, that not only improves the drawbacks of existing data generators but also adds new data generation functionalities. For generating XML data WeXGene uses the user data files and the structure definition files, which specify SDTD(Symbolic DTD) or input parameters. The user data file is a text data file that has column data or row data. It is also possible that WeXGene generates XML data without accessing the user data file. This paper presents the design details, overall system architecture, and data generation process of WeXGene. An analytic comparison with other XML data generators is also presented.
A Study of the Integration of Individual Classification Model in Data Mining for the Credit Evaluation
Kim Kap Sik ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 211~218
DOI : 10.3745/KIPSTD.2005.12D.2.211
This study presents an integrated data mining model for the credit evaluation of the customers of a capital company. Based on customer information and financing processes in capital market, we derived individual models from multi-layered perceptrons(MLP), multivariate discrimination analysis(MDA), and decision tree. Further, the results from the existing models were compared with the results from the integrated model using genetic algorithm. The integrated model presented by this study turned out to be superior to the existing models. This study contributes not only to verifying the existing individual models but also to overcoming the limitations of the existing approaches.
Efficient Generation of a Feature Profile in a Set of Similar Video Data
Park Dong Cheol ; Chang Joong-Hyuk ; Lee Won-Suk ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 219~232
DOI : 10.3745/KIPSTD.2005.12D.2.219
With the rapid progress of computer technology in recent years, a digital video data has been used in many applications. As a result, various technologies have been introduced to discover knowledge embedded in a video database. However, few researches on data mining for a video database have been performed due to the unclear boundary of the information in a large amount of a video stream. This paper proposes an efficient generation method of a feature profile in a set of similar video data. To extract the information embedded in original video data efficiently, several refinement techniques are also presented. These methods include merging pixels, restricting preferred areas, removing noises under a minimum repeat factor, extracting important key frames, generating derived blocks and applying weights to dynamic and static areas differently. Finally, the performance of these methods is evaluated by comparing a result profile obtained by a data mining process with original video streams.
An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree
Im Sang-hyuk ; Ku Kyong-I ; Kim Ki-chang ; Kim Yoo-Sung ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 233~246
DOI : 10.3745/KIPSTD.2005.12D.2.233
To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.
Comparison and Analyzing System for Protein Tertiary Structure Database expands LOCK
Jung Kwang Su ; Han Yu ; Park Sung Hee ; Ryu Keun Ho ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 247~258
DOI : 10.3745/KIPSTD.2005.12D.2.247
Protein structure is highly related to its function and comparing protein structure is very important to identify structural motif, family and their function. In this paper, we construct an integrated database system which has all the protein structure data and their literature. The structure queries from the web interface are compared with the target structures in database, and the results are shown to the user for future analysis. To constructs this system, we analyze the Flat-File of Protein Data Bank. Then we select the necessary structure data and store as a new formatted data. The literature data related to these structures are stored in a relational database to query the my kinds of data easily In our structure comparison system, the structure of matched pattern and RMSD valure are calculated, then they are showed to the user with their relational documentation data. This system provides the more quick comparison and nice analyzing environment.
Query Routing in Road-Based Mobile Ad-Hoc Networks
Hwang So-Young ; Kim Kyoung-Sook ; Li Ki-Joune ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 259~266
DOI : 10.3745/KIPSTD.2005.12D.2.259
Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.
Design and Implementation of Component Storages for Developing Component-Based Game Engines
Song Eui Cheol ; Kim Jung Jong ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 267~274
DOI : 10.3745/KIPSTD.2005.12D.2.267
New game softwares usually have much similarities with old one in the sense of properties and procedures. But nevertheless, the development could be duplicated several times without referencing or reusing of others. In addition, because there is no standardized process about the game engine, the products generated by other software development processes are difficult to understand and to reuse. Therefore, the enterprise developing new game software newly analyze and design although it is same process as the old one. This paper proposes the improved process of the game engine, analysis of structures and relations, classification of the class and the module and their combination methods, implementation of storage, and processor model to apply the component based development method to the game engine.
Rule based Component Development Technique and Case study
Kim Jeong Ah ; Hwang Sun Myung ; Jin Young Taek ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 275~282
DOI : 10.3745/KIPSTD.2005.12D.2.275
In order to increase extendibility and reusability of components during component design, the variability discovered in a business application development needs to be defined to separate rules. That is because component adaptation techniques through redefinition of implementation classes and interface wrapping have limits to support the component reusability. Therefore, It`s essential to design the component which takes into account the future reusability in the component development. In this paper, we extended the existing component architecture to incorporate rule components by separating variable properties from the components and defined the necessary syntax for the rule definition. In the case study, we built the business components for an insurance sales application and verified the component reusability through the rule redefining.
Empirical Study on Test Case Prioritization Techniques of Regression Testing
So Sun Sup ; Chae Yigeun ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 283~288
DOI : 10.3745/KIPSTD.2005.12D.2.283
Test case prioritization methods schedule test cases for execution when we can not practically run all test cases for regression testing. We proposed a new prioritization method that is based on historical execution and mr detection data. And we conducted an experiment to compare the proposed method with existing Random and LRU methods using the fault age under the long run environment as criterion. The experiment shows several interesting results. First, our results show that they are complementary. Random method shows good performance for programs that have many error-detectable test cases and HED is more effective for the programs that can be detected by very small amount of test cases. But LRU is more effective for the programs that have relatively medium amount of error detectable test cases. Next, the performance of prioritization method is affected by the size of test suites. Two experiments that have different size of test suites show considerably different fault ages and performance order. And lastly, the
of test cases shows considerably good performance compared to the execution result of the full test suite.
Implementation of Mobile Agent Multicast Migration Model for Minimizing Network Required Time
Kim Kwang-jong ; Ko Hyun ; Kim Young Ja ; Lee Yon-sik ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 289~302
DOI : 10.3745/KIPSTD.2005.12D.2.289
The mobile agent has very various performance according to the element of communication number of times between hosts, quantity of transmission data agent`s size, network state etc. specially, migration method is caused much effect in whole performance of distributed system. Most existing migration methods have simplicity structure that it moves doing to accumulate continuously result after achieving task by visiting host in the fixed order. Therefore, in case there are situation such as fault, obstacle, and service absence etc. This can be inefficient due to mobile agent increased network required time. In this paper, we design and implementation Multicast Migration Model for minimizing network required time by solving this problems. Multicast Migration Model includes components such as mobile agent including call module and naming agent, which provides object replication information and distributed server`s location transparence. And we evaluate and compare with existing migration method applying prototype system to verify implemented migration model.
SDCDS: A Secure Digital Content Delivery System with Improved Latency time
Na Yun Ji ; Ko Il Seok ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 303~308
DOI : 10.3745/KIPSTD.2005.12D.2.303
Generally, the overloaded server problem and the rapidly increased network traffic problem are happened in a center concentrated multimedia digital content service. Recently, a study about the CDN which is a digital content transmission technology to solve these problems are performed actively. In this study, we proposed the SDCDS which improved a process latency time and a security performance on a digital content delivery and management. The goal of the SDCDS is the digital content security and the improvement of the processing time. For that, we have to design the security and the caching method considering the architecture characteristics of the CDN. In the SDCDS, the public key encryption method is designed by considering the architecture characteristics of CDN. And we improved the processing latency time by improved the caching method which uses the grouped caching method on the encrypted DC and the general DC. And in the experiment, we veryfy the performance of the proposed system.
Design and Implementation of a WML Converter and WML Editor for Automatic Generation of Wireless Internet Content
Jeon Yun-Ju ; Choi Eun-Hye ; Jung Hyun-Suk ; Cho Hyeyoung ; Lee Minsoo ; Yong Hwan-Seung ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 309~318
DOI : 10.3745/KIPSTD.2005.12D.2.309
In order to present wireless Internet users with previously created HTML contents and applications, it is essential to research and develop the technology to efficiently convert HTML documents into documents and further provide a way to edit the WML documents. This paper describes the design and development of a WML converter and WML editor The WML converter can convert HTML pages in real time into WML documents that are suitable for the WAP environment. The WML editor enables creation and modification of WML documents in a WYSIWYG fashion. These tools enable the previous services based on HTML documents to be easily adapted to the wireless environment. The developed WML converter can be installed on a proxy server to support real time conversion of Web contents. It is superior to other converters in terms of the various image formats it supports and the improvements on the conversion of the link and frame tags. Users can continuously browse via links and also view frames. Automatic dividing of large WML documents into WML cards md user defined conversion rules are also supported. The WML editor is also integrated with the converter and provides an integrated WYSIWYG environment for creating, converting and publishing WML documents.
Design and Implementation of Real-Time Information Appliance Controlling Simulator Based on TMO Scheme
Shin Chang-Sun ; Kim Woon-Mi ; Ryu Eun-Soon ; Joo Su-Chong ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 319~326
DOI : 10.3745/KIPSTD.2005.12D.2.319
Recently, the information appliance devices integrating information technology, appliance technology, and communication technology are appeared in home. And this environment requires that the monitoring technology should include the interaction and the real-time controlling among these devices using home network. In this paper, we implemented the active objects for information appliances by applying the Time-triggered Message-triggered Object(TMO) scheme supporting real-time service. Based on distributed real-time services supporting platform using the TMO Support Middleware(TMOSM), we also constructed the real-time information appliance controlling simulator supporting the remote controlling and monitoring service among active objects. The information appliance devices implemented by the TMO scheme can exchange the housing information by autonomous triggering. And we can conveniently reconfigure the executing environment for information appliances when new devices were inserted. For constructing the simulator on the distributed real-time service supporting platform, we described the functions of the active TMOs for information appliances that execute the temperature management, the illuminance management, and the time management controlling services, and designed the remote interaction among them. Finally, by implementing the simulating environment of information appliance devices on distributed platform, we showed whether the procedures of the real-time controlling and the monitoring service for the active objects of information appliances corresponding to physical devices are processed in given executing conditions correctly.
The Simplification of Web Sites Representation with the EMFG
Yeo Jeong Mo ; An Jeong Suk ;
The KIPS Transactions:PartD, volume 12D, issue 2, 2005, Pages 327~334
DOI : 10.3745/KIPSTD.2005.12D.2.327
The representation of Web Sites with EMFG(Extended Mark Flow Graph) is studied as a new method that represents the complicated Web Sites structure. The Web Sites usually have the number of iteration structures. The representation of these Web Sites with EMFG is too complicated, and so we can not understand the structure of these Web Sites sometimes. Therefore, in this paper, we classify these iteration structures when express Web Sites by EMFG as serial iteration structures and parallel iteration structures and propose the method that can simplify these iteration structures. Then we can reduce number of boxes, arcs, and transitions, and efficiently design and manage Web Sites by using this method.