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 9D, Issue 6 - Dec 2002
Volume 9D, Issue 5 - Oct 2002
Volume 9D, Issue 4 - Aug 2002
Volume 9D, Issue 3 - Jun 2002
Volume 9D, Issue 2 - Apr 2002
Volume 9D, Issue 1 - Feb 2002
Volume 9, Issue 6 - 00 2002
Volume 9, Issue 5 - 00 2002
Selecting the target year
Implementation Techniques to Apply the PageRank Algorithm
김성진 ; 이상호 ; 방지환 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 745~745
The Google search site (http://www.google.com), which was introduced in 1998, implemented the PageRank algorithm for the first time. PageRank is a ranking method based on the link structure of the Web pages. Even though PageRank has been implemented and being used in various commercial search engines, implementation details did not get documented well, primarily due to business reasons. Implementation techniques introduced in [4,8] are not sufficient to produce PageRank values of Web pages. This paper explains the techniques[4,8], and suggests major data structure and four implementation techniques in order to apply the PageRank algorithm. The paper helps understand the methods of applying PageRank algorithm by means of showing a real system that produces PageRank values of Web pages.
A Pipelined Hash Join Method for Load Balancing
문진규 ; 박노상 ; 김평중 ; 진성일 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 755~755
We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new hash join methods with load balancing capabilities. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets adaptively via a frequency distribution. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join processing without staying on disks. Unless the pipelining execution of multiple hash joins includes some load balancing mechanisms, the skew effect can severely deteriorate system performance. In this paper, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.
A Medical Integration Framework based on XML for efficient exchange and sharing of Electronic Health Record using HL7
이민경 ; 정재헌 ; 전종훈 ; 유수영 ; 김보영 ; 최진욱 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 769~769
The LEX system is a XML-based framework for medical information consolidation. The Lex makes it possible for heterogeneous HISs(Hospital Information Systems) exchange and share HL7 messages by storing the messages into a single Central Clinical Database. In this paper, we propose a HL7 message server independently interoperable from existing HIS to generate HL7 messages, and design an XML database schema suitable for storing and manipulating such data. We also propose a new DTD for efficient transformation of HL7 messages to XML documents for storage saving as well as supporting patient-oriented information retrieval.
A study on searching image by cluster indexing and sequential I/O
김진옥 ; 황대준 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 779~779
There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.
Design and Implementation of XQL Query Processing System Using XQL-SQL Query Translation
김천식 ; 김경원 ; 이지훈 ; 장복선 ; 손기락 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 789~789
XML is a standard format of web data and is currently used as a prevailing language for exchanging data. Most of the commercial data are stored in a relational database. It is quite important to convert these conventionally stored data into those for exchange and use them in data exchange, or to get the query results effectively by utilizing XQL on XML data which are store in a relational database. Thus, it is absolutely required to have a proper query processing mechanism for XML data and to maintain many XML data properly. Up to now, many cases of researches on the storage and retrieval of XML data have been carried out and under study. But, effective retrieval and storage system for path queries like XQL has yet to be contrived. Thus, in this paper, a schema to store XML data is designed, in which DFS-Numbegering method is used to store data effectively. And an effective path query processing method is also designed and implemented, in which a traditional relational database engine is used. That is, XQL is converted into SQL with a XQL processor if a user makes query XQL in a system. A database system executes SQL, and a XML generator uses a generated record and makes a XML document.
Online Reorganization of
tree in a Scalable and Highly Available Database Cluster
이충호 ; 배해영 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 801~801
On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced
tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply
tree (Cache Sensitive
tree) to our method instead of
tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method.
Navigation Tool of Web Version Repository for Software Cooperation Development Environment
김수용 ; 최동운 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 813~813
This paper describes how to convert the *.mdl design information generated from the UML editor into the corresponding XML data, which is arranged to be saved in the relational database system. Also, various design informations can be referred and modified to make teams collaborate with each other on the web through the web browser. In addition, we provide an environment in which all the project team members can share a lot of source codes and execution files as well as object files produced from a web-based collaborative development environment. This thesis is the study about a navigation tool system that aids software developers in managing their web-based searches for relationships of design information.
Design and Implementation of Client/Server System for Mobile Vector Map Services
김미란 ; 최진오 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 819~819
The mobile vector map services for mobile devices, specially for PDA, are being popularized with the advent of KVM (Kilobytes Virtual Machine). However, the services for cellular phone have some problems for implementation, which are the restrictions of bandwidth, resource of the phone, etc. Thus, these restrictions force to develop new map database exclusively for cellular phone services. But, this approach needs high costs and could not support multi user view for a same area. Therefore, we suggest new client/server system for mobile vector map services, using existing general map database, and design and implement the system. The suggested system, which has minimized functions at client and processes map simplification works at sever, makes it possible to serve mobile vector map without developing new map database only for cellular phone.
Design of A Moving Object Management System for Tracking Vehicle Location
안윤애 ; 김동호 ; 류근호 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 827~827
Moving object management systems manage spatiotemporal data, which change their location over tine such as people, animals, and cars. These moving object management systems can be applied to vehicle location tracking, digital battlefield, location-based service, and so on. The existing moving object management systems only manage past or future location of the moving objects separately. Therefore, they cannot suggest estimation method of uncertain past or future location of the moving objects. In this paper, we propose a moving object management system, which not only manages historical data of the moving objects, but also predicts past and future location of the moving objects using historical data stored in database. We define the moving objects for vehicle location tracking and propose a moving object database structure. Finally, we suggest an execution model of the proposed system and apply the execution model to a virtual scenario for vehicle tracking.
A Study of Development Method for Component Reuse & Extension
이은서 ; 이경환 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 837~837
When you develop component, you can offer reusability and extension by analyzing commonality and variability about attribute and behavior. Therefore Component that analyzing commonality and variability are use for the purpose of reducing discord of function and adaptedness. I wish to research reusability and extension of component by analysis commonality and variability of component that exist by domain in this paper, extract function of component by behavior analysis.
Automatic Source Code Generating Technique from Design Patterns
김운용 ; 최영근 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 847~847
A purpose of the object-oriented programming is to promote reuse and development time, and to improve software quality. A way for this purpose is using a design information well-defined and tested in previous time when developing software. Such design information is called design patterns. The design patterns are descriptions of abstract solution to recurse software design problems In a systematic and general way. But because the design patterns are descriptions of abstract solution, the specification and application of patterns generally rely on manual implementation and is applied to various forms. As a result, we need to spend a lot of time to develop software program not only because of difficulty in analyzing and applying to patterns consistently, but also because of the frequent programing faults. And because the applied design patterns don′t express inside application visually, it is difficult to analyze and test for this design patterns. In this paper, we propose automatic source code generating technique to be able to efficiently apply the element of design patterns when developing application. And we show a way to analyze and use the applied design patterns in application. As a result, the design patterns in application provide the consistent structure and efficiency, and make analysis and using effect increased.
The Effects Of Structured Methods On Object Orientation : A Knowledge Interference Prespective
김인재 ; 정덕훈 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 859~859
The life cycle of new information technologies is getting shorter, and the technologies are becoming more complex and difficult to understand. The need to better understand adoption of object orientation motivates this paper. Adoption of object orientation should certainly be influenced by prior software process technologies, such as the process-oriented structured methods, because object orientation is considered to be a paradigm shift from conventional software process technologies. This study aims to empirically analyze knowledge interference of the structured methods with object orientation. A two factorial quasi-experimental design is set forth. The period of experience using the structured methods and the period of experience using object orientation are selected as two independent variables, and the perceived ease of use is chosen as one dependent variable. Data are gathered from active members of Data Processing Management Association (DPMA), who have experiences in using both the structured methods and object orientation. The final results empirically show that previous experience using the structured methods negatively influences the perception of using object orientation that is one of critical factors to technology adoption. It is suggested here that a future study dealing with the same research topic in other countries will provide new insights about comparative studies.
A Study of Optimal Effort Allocation over Software Development Phase
이상운 ; 김용수 ; 한판암 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 865~865
Successful project planning relies on a good estimation of the effort required to complete a project, together with the schedule options that may be available. Existing software effort estimation models are present only the total effort and instantaneous effort function for the software life-cycle. Also, Putnam presents constant effort rate in each phase. However, the size of total effort varies according to the software projects under the influence of its size, complexity and operational environment. As a result, the allocated effort in each phase also differs from one project to another. This paper suggests models for effort allocation in planning, specifying, building, testing and implementing phases followed by the project size and development types. These models are derived from 155 different projects. Therefore, these models can be considered as a practical guideline in management of project schedule and effort allocation.
Defining of Architectural Patterns through Formalization of Architectural Styles
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 877~877
The problem of software reuse is dealt in two approaches. One is to build a new software by composing of the built-in components, and the other is to reuse architectural patterns that most of software system is generally composed of. Although the two approaches are important in design of software architecture, we could find outstanding difference in what kind of building blocks they use. The component based software design makes uses of building blocks whose contents are filled in by someone, on the other hand, the architectural pattern based software design is not interested in the contents of building blocks, but in the framework for building blocks including relationship of the building blocks. The paper purposes to find architectural patterns which are commonly found in diverse applications and help software architects reuse them in the software design process. We refine the architectural styles which is the well-known concept for software architecture design, and refine them as architectural components or templates which can be parts of software architecture.
Improvement Target SW Process Selection for Small and Medium Size Software Organizations
이양규 ; 김종우 ; 권원일 ; 정창신 ; 배세진 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 887~887
Based on SPICE (Software Process Improvement and Capability dEtermination) evaluation model, SPIRE (Software Process Improvement in Regions of Europe) is developed and published as a process improvement model for small and medium size organizations. However, practical selection guidelines or mapping rules between business goals and software processes do not exist within SPIRE. This research aims to construct an objective reference mapping table between business goals and software processes, and to propose a process selection method using the mapping table. The mapping table is constructed by the convergence of domestic software process experts′ opinions using Delphi techniques. In the suggested process selection method, target processes are selected using the intuition of project participants or project managers as well as the reference mapping table. The feasibility of the proposed selection method has been reviewed by applying to two small software companies. Using the reference mapping table, we could select key processes which were passed over by project managers.
A Study on Selection Method of COTS Component Based on the Software Quality Measurement
오기성 ; 이남용 ; 류성열 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 897~897
Because of rapid evolution of software technique, numerous software professionals have been concerned with component based development methodologies. However, it is hard to find out a systematic technique for the selection of COTS (Commercial Off The Shelf) component in consumer position. Up to date, the major of component quality evaluation is object-oriented metric based evaluation methodology. But this paper present four step process and evaluation criteria based on MCDM (Multiple Criteria Decision Making) technique for optimal COTS component selection in consumer position. We considered funtionality, efficiency, usability based on IS0/IEC 9126 for Quality measurement and executed practical analysis about commercial EJB component in internet. This paper show that the proposed selection technique is applicable to optimal COTS component selection.
Design and Implementation of Component Adaptation Supporting Tool
김정아 ; 권오천 ; 최유희 ; 신규상 ; 윤심 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 903~903
In this research, the technique and tool for the adaptation of components are suggested. While reusing a component or assembling components, component adaptation should be required since the interfaces of component to be assembled might not be exactly matched. Sometimes, other attributes are needed for new business features or even the same business concept. So, in reusing or assembling a component, component adaptation techniques are essentially required. In this research, we proposed the following Component Adaptation by Binary Component Adaptation Techniques : and Component Adaptation by Adaptation Components. Also, we constructed a component adaptation supporting tool. As the results, we can adapt the existing components without source code and can reuse the existing components when the components do not meet new requirements or can not be directly connected with other components to be integrated.
A Study on High-Speed Extraction of Bar Code Region for Parcel Automatic Identification
박문성 ; 김진석 ; 김혜규 ; 정회경 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 915~915
Conventional Systems for parcel sorting consist of two sequences as loading the parcel into conveyor belt system and post-code input. Using bar code information, the parcels to be recorded and managed are recognized. This paper describes a 32 × 32 sized mini-block inspection to extract bar code Region of Interest (ROI) from the line Charged Coupled Device (CCD) camera capturing image of moving parcel at 2m/sec speed. Firstly, the Min-Max distribution of the mini-block has been applied to discard the background of parcel and region of conveying belts from the image. Secondly, the diagonal inspection has been used for the extraction of letters and bar code region. Five horizontal line scanning detects the number of edges and sizes and ROI has been acquired from the detection. The wrong detected area has been deleted by the comparison of group size from labeling processes. To correct excluded bar code region in mini-block processes and for analysis of bar code information, the extracted ROI 8 boundary points and decline distribution have been used with central axis line adjustment. The ROI extraction and central axis creation have become enable within 60∼80msec, and the accuracy has been accomplished over 99.44 percentage.
The Implementation of the Digital watermarking for 3D Polygonal Model
김선형 ; 이순흠 ; 김기석 ; 안덕상 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 925~925
This paper discusses techniques for embedding data into 3D polygonal models of geometry. Much researches of Watermarking had been gone as element technology of DRM (digital rights management). But, few research had gone to 3D polygonal model. Most research is limited at text document, 2D image, animation, music etc. RP system is suitable a few production in various goods species, and it is used much in industry to possible reason that produce prototype and find error or incongruent factor at early stage on design in product development childhood. This paper is research about method that insert watermark in STL ( stereolithography) file that have 3D shape model. Proposed algorithm inserts watermark in normal vector region and facet′s interior region of 3D shape data. For this reason, 3D shape does not produce some flexure and fulfill invisibility of watermark. Experiment results that insert and extract watermark in normal netter region and facet′s Interior region of 3D shape data by proposed algorithm do not influence entirely in 3D shape and show that insertion and extraction of watermark are possible.
Implementation of the Secure Web Server-Client Module Based on Protocol Architecture
장승주 ; 한수환 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 931~931
We implement the PBSM (Protocol-Based Security Module) system which guarantees the secure data transmission under web circumstances. There are two modules to implement for the PBSM architecture. One is Web Server Security Module (WSSM) which is working on a web server, the other is the Winsock Client Security Module (WSCSM) which is working on a client. The WSCSM security module decrypts the encrypted HTML document that is received from the security web server The decrypted HTML document is displayed on the screen of a client. The WSSM module contains the encryption part for HTML file and the decryption part for CGI (Common Gateway Interface). We also implement the proposed idea at the web system.Y
Land Surface Classification With Airborne Multi-spectral Scanner Image Using A Neuro-Fuzzy Model
한종규 ; 류근호 ; 연영광 ; 지광훈 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 939~939
In this paper, we propose and apply new classification method to the remotely sensed image acquired from airborne multi-spectral scanner. This is a neuro-fuzzy image classifier derived from the generic model of a 3-layer fuzzy perceptron. We implement a classification software system with the proposed method for land cover image classification. Comparisons with the proposed and maximum-likelihood classifiers are also presented. The results show that the neuro-fuzzy classification method classifies more accurately than the maximum likelihood method. In comparing the maximum-likelihood classification map with the neuro-fuzzy classification map, it is apparent that there is more different as amount as 7.96% in the overall accuracy. Most of the differences are in the ″Building″ and ″Pine tree″, for which the neuro-fuzzy classifier was considerably more accurate. However, the ″Bare soil″ is classified more correctly with the maximum-likelihood classifier rather than the neuro-fuzzy classifier.
Design and Implementation of Web Server for Analyzing Clickstream
강미정 ; 정옥란 ; 조동섭 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 945~945
Clickstream is the information which demonstrate users′ path through web sites. Analysis of clickstream shows how web sites are navigated and used by users. Clickstream of online web sites contains effective information of web marketing and to offers usefully personalized services to users, and helps us understand how users find web sites, what products they see, and what products they purchase. In this paper, we present an extended web log system that add to module of collection of clickstream to understand users′ behavior patterns In web sites. This system offers the users clickstream information to database which can then analyze it with ease. Using ADO technology in store of database constructs extended web log server system. The process of making clickstreaming into database can facilitate analysis of various user patterns and generates aggregate profiles to offer personalized web service. In particular, our results indicate that by using the users′ clickstream. We can achieve effective personalization of web sites.
A Reserve Price Generation Agent for an Internet Auction System
고민정 ; 김신우 ; 박성은 ; 이용규 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 955~955
Commercial internet auction systems have been successfully used recently. In those systems, because reserve prices of auction items are given by sellers only, the success bid rate can be decreased due to the large difference between the reserve price and the normal price. In this paper, we propose an agent that generates reserve prices to sellers based on past auction data and item prices gathered from the web. Through performance experiments, we show that the successful bid rate increases by preventing sellers from making unreasonable reserve prices. Using the pricing agent, we design and implement an XML-based auction system on the web.
Design and Implementation of Internet Auction Agent System (IAAS)
조경산 ; 원유석 ;
The KIPS Transactions:PartD, volume 9, issue 5, 2002, Pages 963~963
In this paper, after defining the requirements to improve the processing of Internet auction, we design and implement Internet Auction Agent System (IAAS) based on the requirements. IAAS consists of a multi - agent system with buying/selling/negotiation agents for auction processing in accordance with the given price strategy, a graphic interface for supporting price strategies, an information agent for supplying real time information and remote control of agents, and DB. For the mobility, scalability, functionality and communication efficiency of agents, IAAS is implemented by using Java JDK1.3, Servlet, RMI and socket. Through the comparative analysis, we show that IAAS fulfills the requirements defined. IAAS can improve the convenience of users and the efficiency of auction processing, and thus increase the utilization of Internet auction.