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
ER2XML: An Implementation of XML Schema Generator based on the Entity-Relationship Model
Kim Chang Suk ; Son Dong-Cheul ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 1~12
DOI : 10.3745/KIPSTD.2005.12D.1.001
The XML is emerging as standard language for data exchange on the Web. Therefore a demand of XML Schema(W3C MLL Schema Spec.) that verifies XML document becomes increasing. However, XML Schema has a weak point for design because of its complication despiteof various data and abundant expressiveness. This paper shows a simple way of design for XML Schema using a fundamental means for database design, the Entity-Relationship model. The conversion from the Entity-Relationship model to XML Schema can not be directly on account of discordance between the two models. So we present some algorithms to generate XML Schema from the Entity-Relationship model. The algorithms produce XML Schema codes using a hierarchical view representation. An important objective of this automatic generation is to preserve XML Schema`s characteristics such as reusability, global and local ability, ability of expansion and various type changes.
A Join Operations Benchmark in Users` Perspective
Jeong Hoe Jin ; Lee Sang Ho ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 13~20
DOI : 10.3745/KIPSTD.2005.12D.1.013
The join operation is an important, fundamental operation in database systems, and it costs much to execute. In the literature, there are a number of technical attempts on development and evaluation of efficient join operations, all of which have been carried out In developers` perspective. This paper proposes a join operations benchmark that is dedicated to the evaluation of the join operations in database systems in users` perspective. This benchmark helps users select a database system that performs the join operations well in their work environment. The benchmark consists of 42 join queries, which are derived from on six performance factors that are picked out in two join categories. We have implemented this benchmark with two commercial database systems. The experimental results are also reported.
Concurrency Control Method using the Asynchronous Data Broadcast in Mobile Computing Environments
Ko Seung-Min ; Kim Dae-In ; Im Sun-Mo ; Hwang Bu-Hyun ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 21~30
DOI : 10.3745/KIPSTD.2005.12D.1.021
In mobile computing environments, a mobile host caches the data to use the narrow bandwidth efficiently and improve the response time. A server periodically broadcasts the update data for maintaining the cache consistency of a mobile host. However, a method for maintaining cache consistency using periodic invalidation report has a problem that defers the commit decision of a mobile transaction to guarantee its serializable execution. In this paper, we propose CCM-AD method that guarantees the serializable execution of a mobile transaction even in the case that it is executed using cached data. As CCM-AD method guarantees the serializable execution of mobile transactions by using the intersection between the data broadcast to mobile host and the data updated at server. Then the CCM-AD method can reduce the delay of commitment decision of a mobile transaction. Also our method can reduce the size of invalidation report.
Video Data Classification based on a Video Feature Profile
Son Jeong-Sik ; Chang Joong-Hyuk ; Lee Won-Suk ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 31~42
DOI : 10.3745/KIPSTD.2005.12D.1.031
Generally, conventional video searching or classification methods are based on its meta-data. However, it is almost Impossible to represent the precise information of a video data by its meta-data. Therefore, a processing method of video data that is based on its meta-data has a limitation to be efficiently applied in application fields. In this paper, for efficient classification of video data, a classification method of video data that is based on its low-level data is proposed. The proposed method extracts the characteristics of video data from the given video data by clustering process, and makes the profile of the video data. Subsequently. the similarity between the profile and video data to be classified is computed by a comparing process of the profile and the video data. Based on the similarity. the video data is classified properly. Furthermore, in order to improve the performance of the comparing process, generating and comparing techniques of integrated profile are presented. A comparing technique based on a differentiated weight to improve a result of a comparing Process Is also Presented. Finally, the performance of the proposed method is verified through a series of experiments using various video data.
Histogram-based Selectivity Estimation Method in Spatio-Temporal Databases
Lee Jong-Yun ; Shin Byoung-Cheol ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 43~50
DOI : 10.3745/KIPSTD.2005.12D.1.043
The Processing domains of spatio-temporal databases are divided into time-series databases for moving objects and sequence databases for discrete historical objects. Recently the selectivity estimation techniques for query optimization in spatio-temporal databases have been studied, but focused on query optimization in time-series databases. There wat no previous work on the selectivity estimation techniques for sequence databates as well. Therefore, we construct T-Minskew histogram for query optimization In sequence databases and propose a selectivity estimation method using the T-Minskew histogram. Furthermore we propose an effective histogram maintenance technique for food performance of the histogram.
A management Technique for Protein Version Information based on Local Sequence Alignment and Trigger
Jung Kwang-Su ; Park Sung-Hee ; Ryu Keun-Ho ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 51~62
DOI : 10.3745/KIPSTD.2005.12D.1.051
After figuring out the function of an amino acid sequence, we can infer the function of the other amino acids that have similar sequence composition. Besides, it is possible that we alter protein whose function we know, into useful protein using genetic engineering method. In this process. an original protein amino sequence produces various protein sequences that have different sequence composition. Here, a systematic technique is needed to manage protein version sequences and reference data of those sequences. Thus, in this paper we proposed a technique of managing protein version sequences based on local sequence alignment and a technique of managing protein historical reference data using Trigger This method automatically determines the similarity between an original sequence and each version sequence while the protein version sequences are stored into database. When this technique is employed, the storage space that stores protein sequences is also reduced. After storing the historical information of protein and analyzing the change of protein sequence, we expect that a new useful protein and drug are able to be discovered based on analysis of version sequence.
An Interoperability Level Measurement Mechanism between Heterogeneous Distributed Component Based Systems
Ryu Dong-Kuk ; Kim Young-Chul ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 63~72
DOI : 10.3745/KIPSTD.2005.12D.1.063
In this paper we describe interoperability maturity measurement, due to highlight a momentous issue on interoperability between heterogeneous distributed component based systems. it also suggests one of various ways for supporting interoperability between each other different component based systems, that is, using web services based mechanism and also revises `LISI (Level of information systems interoperability)` model to measure interoperability maturity. We also develop the interoperability questionnaire based on the interoperability factors considered at each phase of component based development process, which is possible to measure interoperability maturity between heterogeneous distributed component systems. Based on revised interoperability maturity model and questionnaire we measure each interoperability maturity on examples of two different implementations, that is, web services and distributed object based mechanism. As a result, we suggest an enhanced interoperability way based on analysing problems af these measured results.
GoF design patterns based object-oriented Total Maximum Daily Load software design
Kim Hyung-Moo ; Kwak Hoon-Seong ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 73~80
DOI : 10.3745/KIPSTD.2005.12D.1.073
The purpose of using CBD in the object-oriented modeling is to improve the software capability by reducing iterative time and space complexity. Despites many achievements of CBD, it is needed to study about design patterns and it`s standardization for the increment of CBD design reusability. However, it is rather possible that impetuous constructing meta-pattern languages and pattern repositories make adapting patterns to software development more complicate and difficult. By applying GoF design patterns to the design of the TMDL(Total Maximum Daily Load) environmental software discipline, this study suggests a method which specifies Pattern names at class names for retrieving, exploring the adapted patterns on the stage of software design without meta-pattern language which is a redundant abstraction, nor additional pattern repositories. Thus, this study can contribute on the reducing iterations and repetitions that are frequently occurred in the process of the environmental software developments.
Efficient Counterexample Generation for Safety Violation in Model Checking
Lee Tae-hoon ; Kwon Gi-hwon ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 81~90
DOI : 10.3745/KIPSTD.2005.12D.1.081
Given a model and a property, model checking determines whether the model satisfies the property. In case the model does not satisfy the property model checking gives a counterexample which explains where the violation occurs. Since counterexamples are useful for model debugging as well as model understanding, counterexample generation is one of the indispensable components in the model checking tool. This paper presents efficient counterexample generation techniques when a safety property is falsified. These techniques are used to solve Push Push games which consist of 50 games. As a result, all the games are solved with the proposed techniques. However, with the original NuSMV, 42 games are solved but 8 failed. In addition, we obtain
time improvement and
space improvement compared to the original NuSMV in solving the game.
Study on Measurement Program in each Maturity Level of CMMI
Yu Young-Moo ; Han Hyuk-Soo ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 91~102
DOI : 10.3745/KIPSTD.2005.12D.1.091
In the past it was generally felt that software quality was the same as product quality. But as the software industry is getting bigger and more complex, it has become hard to develop quality software that meets customers` needs just depending on product quality. Therefore, lately many domestic and foreign companies are making efforts to upgrade product quality by implementing Process Improvement. Measurement in Process Improvement activities enhances the effect of Process Improvement, and also identifies and helps the activities. In support of this paper, research on the measurement program was conducted based on the CMMI adopted by many domestic and foreign companies for their process improvement model. MA process area that deals with measurement process setup is one of the CMMI process areas and was the basis of the structure of the measurement program. This study presents differences of the measurement program for each level of CMMI and how to apply it. The results of this study can help a business to apply CMMI-based Process Improvement by backing up the structure of the measurement program. Furthermore, it can offer a roadmap for progress of the measurement program for each level.
Software Cost Estimation Based on Use Case Points
Park Ju-Seok ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 103~110
DOI : 10.3745/KIPSTD.2005.12D.1.103
Software Development is converting from structural to object oriented method. The later software development prefers the iterative process applications, not aterfall process and based on use case model, the requirements are expressed and based on this, analysis, design and coding are accomplished. Therefore, size of the software to be developed is estimated basing on use case and it is only possible to maintain the project success by estimating development effort, cost and development period. Even though development effort estimation models related current use case point. there is no appropriate development effort estimating. This paper shows, as a result of applying the development effort estimating model about UCP to the growth curve, a superior performance improvement to current statistical models. Therefore, estimation of development effort by applying this model, project development maintenance can be appropriately carried out.
A Design of Index/XML Sequence Relation Information System for Product Abstraction and Classification
Sun Su-Kyun ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 111~120
DOI : 10.3745/KIPSTD.2005.12D.1.111
Software development creates many product that class components, Class Diagram, form, object, and design pattern. So this Paper suggests Index/XML Sequence Relation information system for product abstraction and classification, the system of design product Sequence Relation abstraction which can store, reuse design patterns in the meta modeling database with pattern Relation information. This is Index/XML Sequence Relation system which can easily change various relation information of product for product abstraction and classification. This system designed to extract and classify design pattern efficiently and then functional indexing, sequence base indexing for standard pattern, code indexing to change pattern into code and grouping by Index-ID code, and its role information can apply by structural extraction and design pattern indexing process. and it has managed various products, class item, diagram, forms, components and design pattern.
IP Management Method Using RADIUS Authentication and Accounting Servers
Park Jeong-Hyun ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 121~128
DOI : 10.3745/KIPSTD.2005.12D.1.121
This paper describes the requested IP assignment and authentication problem for wireless internet service of visited ISP subscriber on GPRS network, and proposes to use RADIUS authentication and accounting server for these problems. In this paper, we also define signals between GGSN and RADIUS, and between RADIUS authentication server and accounting sever for IP management and wireless internet service.
A Study on Mobile Contents Converting Design of Web Engineering
Kim Young-Sun ; Oh Sang-Yeob ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 129~134
DOI : 10.3745/KIPSTD.2005.12D.1.129
Web engineering based environment specialty emphasize the importance of networking by producing many kinds of interface devices connected to wireless technology. This Paper is it aims at generating new wireless contents which are available for wireless internet environment by converting and processing wire internet contents. Mobile contents converting module, Converting Solution, which extracts components which can reuse Mobile to provide existing wire internet contents in the Mobile internet environments as it is without necessity for developing or managing sites and contents suitable for various terminals and standard for special use can maximize the efficiency of cost cutting by shorting of productivity and can provide necessary information timely.
Development of an Integrated Retrieval System on Distributed KRISTAL-2002 Systems with Metadata Information
Choe Gui-ja ; Kim Jae-Gon ; Seo Jung-Hyun ; Cho Han-Hyung ; Lee Min-Ho ; Jung Chang-Hu ; Park Dong-In ; Nam Young-Kwang ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 135~150
DOI : 10.3745/KIPSTD.2005.12D.1.135
In this paper, we propose an integrated information retrieval system for distributed multiple KRISTAL-2002 systems by using the metadata information. This system integrates current systems for different areas or systems for the same area with the different schemas so that the users can get the answers by once from the whole systems. The proposed system composes of the Source Server Manager(SSM) supporting the mapping between the integrated metadata database and source server, the Integrated Metadata Manager(ISM) for registering and managing the metadata and schema mapping, the Distributed Query Processor (DQP) for processing the user query into the source server query, the Distributed Data Set Integrated Manager(DDSIM) for transforming the total retrieval results by merging to the HTML format, and the integrated retrieval engine for managing the query results. It is assumed that the integrated metadata follows ISO/IEC 11179 metadata registration procedure with the metadata registry system which is a subsystem of the proposed system. There are two kinds of queries for users; the basic query and the detailed query. The users may select the databases or organizations for results by their own choices before giving the queries. The proposed system has been developed over KRISTAL-2002 systems with
and tested and verified with the six database systems.
A Design and Implementation of Dynamic Electronic Map Creation System for Mobile phone Map Service Using Raster Method
Seo Ii-Soo ; Nam In-Gil ; Lee Jeong-Bae ; Choi Jin-Oh ; Kim Mi-Ram ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 151~158
DOI : 10.3745/KIPSTD.2005.12D.1.151
In order to use the existing map data base in the mobile phone, the dynamic creation technique of the radio map which will be able to be converted into the raster image and transmitted was proposed. We transferred the client module functions such as the coordinate conversion, data compression and decoding to server, and made driving of JAVA browser in the mobile phone which has the restricted resources possible for the dynamic creation of the radio map. We made the radio electronic map service possible without map data base for the mobile phone use only by performing the general work of the map at the sever. And we guaranteed the client waiting time less then the limit time by performing the filtering work of the map at the server also. After we input the keyword at the user interface for searching the region or facility, and verified the performance of the proposed technique by confirming that the raster electronic map usable at the mobile phone was created dynamically.
Language Learning System Evaluating the Quality of a Handwriting String
Kim Gye-Young ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 159~164
DOI : 10.3745/KIPSTD.2005.12D.1.159
In a computing environment connected pan-based computers and a server by Internet, This paper describes a language learning system evaluating the quality of a handwriting string. For the purpose of the system, this paper explains how to retrieve reference data from a database, how to evaluate the quality of a handwriting string using global and local features. The Proposed system can evaluate the qualify of a handwriting string as well as a handwriting character. The qualify can be computed in the case of different language between reference and input. Therefore, we expect that the system is very useful not only for training on handwriting but also learning a language.
A Classification Model Supporting Dynamic Features of Product Databases
Kim Dongkyu ; Lee Sang-goo ; Choi Dong-Hoon ;
The KIPS Transactions:PartD, volume 12D, issue 1, 2005, Pages 165~178
DOI : 10.3745/KIPSTD.2005.12D.1.165
A product classification scheme is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eCl@ss, however, have a lot of limitations to meet these requirements for dynamic features of classification. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this Paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes, and describe the semantic classification model proposed in , which satisfies the requirements for dynamic features of product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph.