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
A Dynamic Transaction Routing Algorithm with Primary Copy Authority
김기형 ; 조행래 ; 남영환 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1067~1067
Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.
-Tree Supporting a Circular Property of Objects
선휘준 ; 김홍기 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1077~1077
To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called
-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the
-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.
Reliable and Flexible Storage System for NAS Environments
이태근 ; 강용혁 ; 엄영익 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1085~1085
The rapid growth of high speed multimedia services demands the large capacity of the server′s storage that maintains the multimedia contents. Among the server′s devices, the low I/O speed and physical or logical failure of storage device decrease the total performance of system. The continuous increase of multimedia contents require the flexibility of storage capacity. In order to solve the these problems, we propose the uses of software RAID and LVM techniques that provide the performance improvement and reliability of storage device and the flexibility of storage device respectively. In the LINUX 2.4 kernel, we implemented the reliable and flexible storage device and evaluated the performance of it.
XML Document Clustering Based on Sequential Pattern
황정희 ; 류근호 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1093~1093
As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.
Spatiotemporal Moving Pattern Discovery using Location Generalization of Moving Objects
이준욱 ; 남광우 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1103~1103
Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.
Layered Video Content Modeling and Browsing
복경수 ; 이낙규 ; 허정필 ; 유재수 ; 조기형 ; 이병엽 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1115~1115
In this paper, we propose modeling method for video data that represents structural and semantic contents of video data efficiently. Also, a browsing method that helps users easily understand and play the contents of video data is presented. The proposed modeling scheme consists of three layers such as raw data layer, content layer and key frame layer The content layer represents logical hierarchy and semantic contents of video data. We implement two kinds of browsers for playing video data and providing video contents. The playing browser plays video data and Presents the information of currently playing shot. The content browser allows users to browse raw data, structural information and semantic contents of video data.
A Predictive Model for Software Development Team Size and Duration Based on Function Point
박석규 ; 이상운 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1127~1127
Estimation of software project cost, effort and duration in the early stage of software development cycle is a difficult and key problem in software engineering. Most of models estimate the development effort using the function point that is measured from the requirement specification. This paper presents optimal team size and duration prediction based on function point in order to provide information that can be used as a guide in selecting the most Practical and productive team size for a software development project. We introduce to productive metrics and cost for decision criteria of ideal team size and duration. The experimental is based on the analysis of 300 development and enhancement software 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 evaluation by productivity and cost measured criteria in two subgroups, we come to the conclusion that the most successful projects has small teams and minimum duration. Also, I proposed that predictive model for team sire and duration according to function point size based on experimental results. The presented models gives a criteria for necessary team site and duration according to the software size.
A FFP-based Model to Estimate Software Development Cost
박주석 ; 정기원 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1137~1137
The existing Function Point method to estimate the software size has been utilized frequently with the management information system. Due to the expanding usage of the real-time and embedded system, the Full Function Point method is being proposed. However, despite many research is being carried out relation to the software size, the research on the model to estimate the development cost from the measured software size is inadequate. This paper analyzed the linear regression model and power regression model which estimate the development cost from the software FFP The power model is selected, which shows its estimation is most adequate.
An Efficient technique to generate reusable matrix to solve a problem in the engineering field
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1145~1145
We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.
A Database Security System supporting Access Control for Various Sizes of Data Groups
정민아 ; 김정자 ; 원용관 ; 배석찬 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1149~1149
Due to various requirements for the user access control to large databases in the hospitals and the banks, database security has been emphasized. There are many security models for database systems using wide variety of policy-based access control methods. However, they are not functionally enough to meet the requirements for the complicated and various types of access control. In this paper, we propose a database security system that can individually control user access to data groups of various sites and is suitable for the situation where the user′s access privilege to arbitrary data is changed frequently. Data group(s) in different sixes d is defined by the table name(s), attribute(s) and/or record key(s), and the access privilege is defined by security levels, roles and polices. The proposed system operates in two phases. The first phase is composed of a modified MAC (Mandatory Access Control) model and RBAC (Role-Based Access Control) model. A user can access any data that has lower or equal security levels, and that is accessible by the roles to which the user is assigned. All types of access mode are controlled in this phase. In the second phase, a modified DAC(Discretionary Access Control) model is applied to re-control the ′read′ mode by filtering out the non-accessible data from the result obtained at the first phase. For this purpose, we also defined the user group s that can be characterized by security levels, roles or any partition of users. The policies represented in the form of Block(s, d, r) were also defined and used to control access to any data or data group(s) that is not permitted in ′read ′ mode. With this proposed security system, more complicated ′read′ access to various data sizes for individual users can be flexibly controlled, while other access mode can be controlled as usual. An implementation example for a database system that manages specimen and clinical information is presented.
Design of the ERBAC for Role Delegations
오석균 ; 김성열 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1155~1155
This paper applies RBAC policy for solving on the security problems when it will be operated several business on the distributed environments and designed Extended RBAC (ERBAC) model that it is possible to manage security systems on the distributed environments. The designed ERBAC model is based on RBAC96 model due to Sandu et al and added role delegations. Therefor, the designed ERBAC model have the advantage of the following . it can be processed of business without interrupts and implemented server system without modifying its source code, high migration, easy and simple of secure managing.
Extending Jabber Messaging System for Effective Collaboration
이근웅 ; 안건태 ; 황의윤 ; 김진홍 ; 이명준 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1161~1161
The BioPlace system is a web-based collaborative system which offers effective exchange of information and research activities among the genomic researchers. BioPlace supports collaborative works among the related group members through Personal Workspces and Team Workspces which are virtual spaces on the web. Jabber is an open messaging system based on XML, giving an efficient way of developing messaging services by providing various functionality for real-time communication and interoperability with other foreign messaging systems. In this paper, we have designed additional Jabber XML protocol to extend Jabber messaging system to be used as real-time communication methods on the BioPlace collaborative system. Also, according to the protocol, we have developed both the extended Jabber server and the BioPlace messenger client.
Bar Code Location Algorithm Using Pixel Gradient and Labeling
김승진 ; 정윤수 ; 김봉석 ; 원종운 ; 원철호 ; 조진호 ; 이건일 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1171~1171
In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.
Design and Implementation of Cyber Space using H.323 Terminal and Gatekeeper
김기용 ; 이건배 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1177~1177
In this paper, a cyber space for multimedia conference is designed and implemented using gatekeeper and web service which satisfies H.323 standards. The implemented gatekeeper manages a registration and a call control for H.323 video conference terminals. The implemented gate-keeper can manage registered users efficiently with directory services using web service. Also, software maintenance of video conference system is established by service provider instead of users using control download on web. finally, we present the practical use of video conference through various applications of directory services.
The EMFG Modeling and Analysis for a Workflow
허후숙 ; 여정모 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1189~1189
Owing to the developed If industry, many people are more and more interested in Workflow which is an automated business processing system. In this paper, we present basic structures and various parallel processing structures of a workflow using EMFG (Extended Mark Flow Graph) that makes conceptional design available. And then, We design a workflow with EMFG. We propose the commitability verification method to check whether a workflow can complete or not and the logical bug verification method to find whether invalid components exist or not by using simulation result of it. The proposed EMFG modeling and analysis method for a workflow make it possible to become a visual and formal design. Also, it makes intuitional and mathematical analysis possible.
A Study of Implementation for Internet Printing Protocol (IPP) System
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1197~1197
This paper describes the IPP (Internet Printing Protocol), a standard that makes network setup for printers potentially much easier and, not so incidentally, also user can print over the Internet and specifies an implementation of IPP client/server system. It allows the system administrator and operators to control IPP system users and printer devices. The focus of this effort is optimized capabilities the security features for authentication, authorization, and policies, also improved compatibility with existing WP devices. Finally this paper presents conclusions and further researches.
A Dynamic Analysis of Distribution Network for SCP
나윤지 ; 고일석 ; 조동욱 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1207~1207
As development of the e-commerce, the distributing network for a logistics currency is more complicated. A management of the distributing network (DN) is important factor in distribution planning. The DN can be expressed to distribution center (DC) and the interaction of DC. An internal factor of DC and an external factor to occur by an interaction of DC have many influences on the DN. Therefore, for an efficient DN management plan, analysis of the DN that considered DC and an interaction of DC is required. Until now a study on a viewpoint of supply chain management as resources assignment was performed, but the study on analysis of the distribution network was not performed. This paper propose the distribution network analysis technique that considered DC and an interaction of DC. A proposed technique consists of two steps largely. First of all a DN is expressed with the graph that included an interaction of DC and DC. It uses a reachibility tree, and the following, a DN expressed with a graph is analyzed. Also we presented an example model, and show an usefulness of proposal technique with the analysis of this model.
A Service Scenario Development for Digital Comics Content using DRM Technology
오상훈 ; 조현주 ; 강지훈 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1213~1213
In recently, digital comic content distribution was not stable for illegal distribution and the weak of intellectual property right in the internet. The research activities of suggest the distribution model and secure intellectual property right are going in international standard communities, not yet in Korea. As the basis of the research, the general framework of international projects and standards such as MPEG-21, IMPREMATUR, FILIGRANE was analysed. Targeting on the domain of digital comics industry, the digital comics distribution structure and business flow model are defined adapting secured distribution system, DRM. The detail content of this research consist of three themes. The first, survey and analysis of the international standard ＆ leading DRM project′s models. The second, suggestion of the service scenario on the digital comic content distribution. The third, suggestion of the model on the secured distribution of digital comics. Through this research targeting at the digital comics business, we found that standards technical items and requirements was well adapted into target domain, and would affect other domain in digital content industry.
Personalized Commodity Recommendation Using A Multi-Stage Algorithm
장병철 ; 최덕원 ; 이동철 ;
The KIPS Transactions:PartD, volume 10, issue 7, 2003, Pages 1225~1225
Many cyber-shopping malls use various commodity recommendation methods. Although the detailed algorithms are not disclosed to the public, they mostly rely on relatively simple and straightforward methods. This paper intends to improve the commodity recommendation by using a multi-stage algorithm which considers factors that are characteristics of the commodity itself, of the consumer group, and of the individual customer. A comparison table is provided which shows whether there is a change in commodity recommendation as we consider more factors about the customer.