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 13D, Issue 7 - Dec 2006
Volume 13D, Issue 6 - Oct 2006
Volume 13D, Issue 5 - Oct 2006
Volume 13D, Issue 4 - Aug 2006
Volume 13D, Issue 3 - Jun 2006
Volume 13D, Issue 2 - Apr 2006
Volume 13D, Issue 1 - Feb 2006
Selecting the target year
XPERT : An XML Query Processing System using Relational Databases
Jung Min-Kyoung ; Hong Dong-Kweon ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 1~10
DOI : 10.3745/KIPSTD.2006.13D.1.001
This paper introduces the development XPERT(XML Query Processing Engine using Relational Technologies) which is based on relational model. In our system we have used a decomposed approach to store XML files in relational tables. XML queries are translated to SQLs according to the table schema, and then they are sent to the relational DBMS to get the results back. Our translation scheme produces AST(Abstract Syntax Tree) by analyzing XQuery expressions at first. And on traversing AST proper SQLs are generated. Translated SQLs can reduce the number of joins by using path information and utilize dewey number to preserve document originated orderings among compoments in XML. In addition we propose the efficient algorithms of XPath and XQuery translation. And finally we show the implementation of our prototype system for the functional evaluations.
Efficient Deferred Incremental Refresh of XML Query Cache Using ORDBMS
Hwang Dae-Hyun ; Kang Hyun-Chul ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 11~22
DOI : 10.3745/KIPSTD.2006.13D.1.011
As we are to deal with more and more XML documents, research on storing and managing XML documents in databases are actively conducted. Employing RDBMS or ORDBMS as a repository of XML documents is currently regarded as most practical. The query results out of XML documents stored in databases could be cached for query performance though the cost of cache consistency against the update of the underlying data is incurred. In this paper, we assume that an ORDBMS is used as a repository for the XML query cache as well as its underlying XML documents, and that XML query cache is refreshed in a deferred way with the update log. When the same XML document was updated multiple times, the deferred refresh of the XML query cache may Bet inefficient. We propose an algorithm that removes or filters such duplicate updates. Based on that, the optimal SQL statements that are to be executed for XML query cache consistency are generated. Through experiments, we show the efficiency of our proposed deferred refresh of XML query cache.
Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks
Pandey Suraj ; Eo Sang-Hun ; Kim Ho-Seok ; Bae Hae-Young ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 23~28
DOI : 10.3745/KIPSTD.2006.13D.1.023
In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn`t provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.
Shape-Based Leaf Image Retrieval System
Nam Yun-Young ; Hwang Een-Jun ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 29~36
DOI : 10.3745/KIPSTD.2006.13D.1.029
In this paper, we present a leaf image retrieval system that represents and retrieves leaf images based on their shape. For more effective representation of leaf images, we improved an existing MPP algorithm. Also, in order to reduce the response time, we proposed a new dynamic matching algorithm at basically revises the Nearest Neighbor search. The system provides users with an interface for uploading query images or tools to generate queries based on shape features and retrieves images based on their similarity. For convenience, users are allowed to easily query images by sketching leaf shape or leaf arrangement on the web. In the experiment, we constructed an image database of Korean native plants and measured the system performance by counting the number of similar images retrieved for queries.
A Study on the Agent Component Development Support to PDA
Kim Haeng-Kon ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 37~50
DOI : 10.3745/KIPSTD.2006.13D.1.037
In the focusing on the important of wireless internet, mobile terminal device plays a central role in tracking and coordinating terms in mobile business processing. Especially, mobile device has been considered as a key technology for embedded software and ubiquitous era. Because existing web environments is moving to wireless internet, the new concepts for wireless internet computing environments has gained increasing interest. Mobile agents provide a new abstraction for deploying over the existing infrastructures. Mobile application systems require the flexibility, adaptability, extensibility, and autonomous. New software developments methodology is required to meet the requirements. In this paper, we present an agent architectures model that allows compassable components with pluggable and independable. Our approach involves wrapping components inside a servlet. We have used the model and components to develop the PDA mobile agent.
A Technical Assessment of Software Product Line Methodologies
Park Shin-Young ; Kim Soo-Dong ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 51~60
DOI : 10.3745/KIPSTD.2006.13D.1.051
Product Line Engineering(PLE) is an effective software development technique which produces applications using core assets. Because of reusing the core assets, PLE can save cost for developing products in a domain but increase reusability. There are about ten PLE methodologies available, but there are not yet common agreements on PLE process and artifacts. This makes developers harder to choose a methodology and to apply it in practice. A comprehensive technical evaluation and comparison on existing PLE methodologies would be essential for practitioners. In this paper, we present a technical assessment of representative PLE methodologies; FAST, SEI SPL, PuLSE, Bosch`s PL proceis, FOPLE, ESAPS, KobrA/PoLITe, Alexandria, COPA, QADA. They are compared in the criteria of process, artifacts, instructions, and special features. And we identify common or variable elements between methodologies and confirm elements to be improved in each PLE methodology. The assessment result would be well utilized in defining a practical methodology for PLE projects and in choosing an appropriate methodology among available ones.
Applying rework indicator to control software development project
Han Hyuk-Soo ; Kim Han-Saem ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 61~66
DOI : 10.3745/KIPSTD.2006.13D.1.061
It is reported that the success ratio of software development projects has been only 30%. Many causes lower project`s chance of success, particularly lack of systematic project management. Especially, moving on the next phase of project with unsatisfactory outputs can be very problematic because it can cause much waste of resource, time and even lead to the failure of the whole project. Peer review and inspection are some of the practices designed to prevent such waste and possible failure. When defects are identified through such progress, each developer has to work on the product component again and fix the problem. This process is called rework. In this paper, we propose a method for improving quality of reworked product component to prevent excessive cost and time consumed caused by moving on the next phase of a project with a problematic product component. More specifically, this paper suggests a rework indicator that measures the level of rework based on its complexity and severity and is used to choose appropriate checking method on reworked product component. The research also confirmed the method`s usefulness and effectiveness by applying the suggested method on four projects.
Identifying Security Requirement using Reusable State Transition Diagram at Security Threat Location
Seo Seong-Chae ; You Jin-Ho ; Kim Young-Dae ; Kim Byung-Ki ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 67~74
DOI : 10.3745/KIPSTD.2006.13D.1.067
The security requirements identification in the software development has received some attention recently. However, previous methods do not provide clear method and process of security requirements identification. We propose a process that software developers can build application specific security requirements from state transition diagrams at the security threat location. The proposed process consists of building model and identifying application specific security requirements. The state transition diagram is constructed through subprocesses i) the identification of security threat locations using security failure data based on the point that attackers exploit software vulnerabilities and attack system assets, ii) the construction of a state transition diagram which is usable to protect, mitigate, and remove vulnerabilities of security threat locations. The identification Process of application specific security requirements consist of i) the analysis of the functional requirements of the software, which are decomposed into a DFD(Data Flow Diagram; the identification of the security threat location; and the appliance of the corresponding state transition diagram into the security threat locations, ii) the construction of the application specific state transition diagram, iii) the construction of security requirements based on the rule of the identification of security requirements. The proposed method is helpful to identify the security requirements easily at an early phase of software development.
A Study on the Elevation of Software Process Level and Performance through Software Process Improvement
Moon Song-Chul ; Kim Hyun-Soo ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 75~86
DOI : 10.3745/KIPSTD.2006.13D.1.075
This paper studied the improvement of software process of the software firms. Software process infrastructure level of software process is very important. This study provided that software process infrastructure have an significant influence on the process level, process infrastructure management level, and software process performance. The result showed that software process high level is elevated through management activity of organization infrastructure and technical infrastructure. And organization performance is elevated through fit between process level and quality culture of software process. Problem factors of software process infrastructure improvement is lack of process improvement mind, leadership and investment. Therefore software firms must construct process improvement through supporting of process quality mind and investment with process infrastructure improvement.
Algorithm selecting Software development route suitable for Project environment and characteristics
Jung Byung-Kwon ; Yoon Seok-Min ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 87~96
DOI : 10.3745/KIPSTD.2006.13D.1.087
This paper focused on the method for customizing software development path, considering the project environments and characteristics. he selection standard of development path is composed of ten items, based on the process of ISO/IEC TR 15721 Information Technology Guide for ISO/IEC 12207 (Software Life Cycle Process) and ISO/IEC 15504 Information technology - Process assessment. The ten items were reflected the project environments and characteristics, at the same time the items conduct the adjustment item of selecting project development path. An algorithm for selecting software development path through items of the project environments and characteristics is presented. To test the algerian in this paper, a system for selecting development path, which reflected algorithm was developed. The development project for web-based system were also adopted to the system for selecting development path. In addition, provened hand-worked project path process differed from machine-worked project path process. The reason why it differs is that outputs were mixed or their names were changed. The effect is to select easily software development route suitable for project environment and characteristics.
The Development of the Application Program Generator based on Meta-Data
Kim Chi-Su ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 97~102
DOI : 10.3745/KIPSTD.2006.13D.1.097
Generally, a software development process is composed with requirements analysis, design, coding, test and maintenance. However, some changes of the design step are difficult to complicate the next step in the development process. It always causes the disagreement between design and implementation step. In this paper, we have developed a tool which can generate an application program. The tool can reduce the disagreement between system design and implementation and recognize the business logic to develop the software rapidly and flexibly In addition, we proposed a non-program-based application program system approach was proposed, In. We can generate and modify an application program with this method which can edit the meta data of a system design by the dynamic method for the execution time.
A Change Tracking Technique for Maintaining Consistency of Game Design Artifacts
Park Jae-Hyun ; Yi Du-Won ; Rhew Sung-Yul ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 103~110
DOI : 10.3745/KIPSTD.2006.13D.1.103
The Game development process that the Korea Game Development Infinity researches and publishes has laid important groundwork for the game industry. However, the game design cannot guarantee a software quality because an artifact is made incorrect by a game planner`s new idea and modification. In this paper theorized the system to maintain artifacts consistently that is generated in planning phase and make changed contents traceable. First, it defined an ACT graph to represent relation of between artifacts, a ACT table that traces and manages it changes and a table of artifacts change history. Also, it suggested the ACT process applying as we mentioned above. Then we worked a case study to verify the change tracking technique which is presented. In a case study, we find game designer is capable to grip and modify a change of artifacts when it occurs a change of game design artifacts. As a result of that, we can save the time and effort to maintain the consistency among game design artifacts.
Model Reduction with Abstraction : Case Study with Nemorize Game
Lee Jung-Lim ; Kwon Gi-Hwon ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 111~116
DOI : 10.3745/KIPSTD.2006.13D.1.111
Given a state, it is essential to for the finite state model analysis (such as model checking) to decide whether or not the state is reachable. W a site of the model is small, the whole state space is to be explored exhaustively. However, it is very difficult or even impossible if a size of the model is large. In this case, the model can be reduced into a smaller one via abstraction which does not allow e false positive error. this paper, we devise such an abstraction and apply it to the Nemorize game solving. As a result, unsolved game due to the state explosion problem is solved with the proposed abstraction.
The Performance-ability Evaluation of an UML Activity Diagram with the EMFG
Yeo Jeong-Mo ; Lee Mi-Soon ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 117~124
DOI : 10.3745/KIPSTD.2006.13D.1.117
Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.
Region Extraction of License Plates in Noise Environment Using YUV Color Space Convert
Kim Jae-Nam ; Choi Tae-Il ; Kim Byung-Ki ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 125~132
DOI : 10.3745/KIPSTD.2006.13D.1.125
The existing recognition system of license plates cannot get the satisfactory result in noise environments. The purpose of this paper is to propose an algorithm that can recognize the region of license plates accurately in a noise environment. The algorithm is formulated by reorganizing the U- and V-channels of YUV color space as YUV is insensitive to light and carries less data than RGB color information. The region of license plates has been extracted by the geometric characteristics, sizes, and places of labeling images. The proposed algorithm was found to improve the process of extracting the region of license plates in various noise environments.
Performance Evaluation on the Learning Algorithm for Automatic Classification of Q&A Documents
Choi Jung-Min ; Lee Byoung-Soo ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 133~138
DOI : 10.3745/KIPSTD.2006.13D.1.133
Electric commerce of surpassing the traditional one appeared before the public and has currently led the change in the management of enterprises. To establish and maintain good relations with customers, electric commerce has various channels for customers that understand what they want to and suggest it to them. The bulletin board and e-mail among em are inbound information that enterprises can directly listen to customers` opinions and are different from other channels in characters. Enterprises can effectively manage the bulletin board and e-mail by understanding customers` ideas as many as possible and provide them with optimum answers. It is one of the important factors to improve the reliability of the notice board and e-mail as well as the whole electric commerce. Therefore this thesis researches into methods to classify various kinds of documents automatically in electric commerce; they are possible to solve existing problems of the bulletin board and e-mail, to operate effectively and to manage systematically. Moreover, it researches what the most suitable algorithm is in the automatic classification of Q&A documents by experiment the classifying performance of Naive Bayesian, TFIDF, Neural Network, k-NN
Design and Implementation of a Distributed Transactional Workflow Monitoring System
Min Jun-Ki ; Kim Kwang-Hoon ; Chung Joong-Soo ;
The KIPS Transactions:PartD, volume 13D, issue 1, 2006, Pages 139~146
DOI : 10.3745/KIPSTD.2006.13D.1.139
This paper describes the design and implementation details of a distributed transactional workflow monitoring system. There have been prevalent research and development trends in the workflow literature - workflow systems tend to be completely distributed architectures to support very large-scale workflow applications on object-oriented and internet-based infrastructures. That is, the active (object), distributed (architecture), system-oriented (transaction), and large-scale (application) workflow systems are the key targets in terms of the research and development aspects. While the passive, centralized, human-oriented, and small/medium scale workflow systems are the typical instances of the traditional workflow systems. Unlike in the traditional (the client-server architecture) workflow systems, the workflow monitoring features should not be easily supported in the recent (the fully distributed architecture) workflow systems. At the same time, they need a set of additional monitoring features, such as gathering and displaying statistical (or overload status) information of the workflow architectural components dispersed on the internet. We, in this paper, introduce the additional workflow monitoring features that are necessarily required for the recent workflow systems, and show how to embed those features into a web-based distributed workflow system.