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
A Sliding Window Technique for Open Data Mining over Data Streams
Chang Joong-Hyuk ; Lee Won-Suk ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 335~344
DOI : 10.3745/KIPSTD.2005.12D.3.335
Recently open data mining methods focusing on a data stream that is a massive unbounded sequence of data elements continuously generated at a rapid rate are proposed actively. Knowledge embedded in a data stream is likely to be changed over time. Therefore, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. This paper proposes a sliding window technique for finding recently frequent itemsets, which is applied efficiently in open data mining. In the proposed technique, its memory usage is kept in a small space by delayed-insertion and pruning operations, and its mining result can be found in a short time since the data elements within its target range are not traversed repeatedly. Moreover, the proposed technique focused in the recent data elements, so that it can catch out the recent change of the data stream.
An Efficient Subsequence Matching Method Based on Index Interpolation
Loh Woong-Kee ; Kim Sang-Wook ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 345~354
DOI : 10.3745/KIPSTD.2005.12D.3.345
Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.
Effectiveness Evaluations of Subsequence Matching Methods Using KOSPI Data
Yoo Seung Keun ; Lee Sang Ho ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 355~364
DOI : 10.3745/KIPSTD.2005.12D.3.355
Previous researches on subsequence matching have been focused on how to make indexes in order to speed up the matching time, and do not take into account the effectiveness issues of subsequence matching methods. This paper considers the effectiveness of subsequence matching methods and proposes two metrics for effectiveness evaluations of subsequence matching algorithms. We have applied the proposed metrics to Korean stock data and five known matching algorithms. The analysis on the empirical data shows that two methods (i.e., the method supporting normalization, and the method supporting scaling and shifting) outperform the others in terms of the effectiveness of subsequence matching.
Comparability and uniformity of ontology for automated information integration of parts
Cho Joonmyun ; Han Soonhung ; Kim Hyun ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 365~374
DOI : 10.3745/KIPSTD.2005.12D.3.365
The B2B electronic product commerce needs intermediary system to provide an integrated interface for the parts libraries of multiple suppliers. However, it is difficult to automatically integrate the parts libraries because they are heterogeneous. Existing ontology-based approaches show a limited functionality of automated integration of information because Dey can not prevent ontologies from being modeled in different ways, so that the inter-ontology mappings to resolve the heterogeneity become complicated and arbitrary. In order to overcome such problems this paper proposes an ontology modeling framework for parts libraries based on the Guarino`s theory of upper ontology. The framework provides knowledge modeling primitives which have explicit formal meanings and modeling principles based on ontological natures. Using the framework, ontology developers can model the knowledge of parts libraries systematically and consistently, so that the resulting ontologies become comparable and uniform and the ontology merging algorithm for the automated information integration can be easily developed.
Extension of OpenGIS Model for Four Dimensional Spatiotemporal Data
Kim Sang Ho ; Chi Jeong Hee ; Ryu Keun Ho ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 375~384
DOI : 10.3745/KIPSTD.2005.12D.3.375
Most of data objects in the real world have spatial and temporal information simultaneously. One of the objectives of spatiotemporal databases is to provide a very expressive framework for spatiotemporal database applications. The object oriented spatiotemporal model can manage spatiotemporal data efficiently because the model is able to store the complete history of any objects. Therefore, in order to handle the spatiotemporal data in object oriented fashion, we proposed a low dimensional spatiotemporal model in the object oriented fashion that extended dimensionally two dimensional spatial model of OpenGIS to fit into the real world information and to include temporal information. In order to proof the proposed model, we design a data provider component which consists of the data source, the session, the command, and the rowset component, and implement it. The proposed four dimensional spatiotemporal data model and provider in the object oriented fashion can be used to store, retrieve and manage the object oriented spatiotemporal data.
The specification of component dependence information and implementation of dependence manager
Choi Sang-kyoon ; Song Young-Jae ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 385~394
DOI : 10.3745/KIPSTD.2005.12D.3.385
In the component-based software development environment, it is important for developers who compose components to provide the information of dependence relationship between components. However it is not provided the information of dependence relationship of components. Therefore, it happens that the developer occasionally composes the components without knowing the dependence relation between the primitive components. In order to complement these disadvantages, In this paper, the design and implementation of dependence manager which provides the component dependence information for the development of integrity and persistence information system are established by defining the information about the dependence and relation between components as XML, managing them and providing a developer with the information about the dependence relationship between primitive components, we can establish. The components being created in the dependence manager show that the figure of reused matrix measurement is indicated from
, being included in confidence limits.
Product Line Development Process for Mobile Software based on Product Line
Kim Haeng-Kon ; Son Lee-Kyeong ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 395~408
DOI : 10.3745/KIPSTD.2005.12D.3.395
Ubiquitous computing spans a very broad range of technologies and needs very complicated user`s requirements. There are many scenarios and technologies involved in ubiquitous computing. We need new software development tools and methodology to meet the requirements. A software product line is one of promising new technology for it. A software product line is a set of software intensive systems that share a common, managed set of features satisfying the specific needs of a particular market segment or mission and that are developed from a common set of core assets. Software architecture-based development is the exploration and maturation of the role of software architecture in the product line life cycle. In this thesis, we identify the foundational concepts underlying software product lines and the essential activities to develop the mobile application systems. So, we define, design, and implement the Mobile Application System Architecture(MASA) that includes the development process for applying into mobile business domain and encompass scoping and gathering requirements for the Product line based on Component Based Development(CBD).
A Study of Estimation for Web Software Size
KIM JeeHyun ; YOO HaeYoung ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 409~416
DOI : 10.3745/KIPSTD.2005.12D.3.409
Opportunity Tree Framework Design For Optimization of Software Development Project Performance
Song Ki-Won ; Lee Kyung-Whan ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 417~428
DOI : 10.3745/KIPSTD.2005.12D.3.417
Today, IT organizations perform projects with vision related to marketing and financial profit. The objective of realizing the vision is to improve the project performing ability in terms of QCD. Organizations have made a lot of efforts to achieve this objective through process improvement. Large companies such as IBM, Ford, and GE have made over
of success through business process re-engineering using information technology instead of business improvement effect by computers. It is important to collect, analyze and manage the data on performed projects to achieve the objective, but quantitative measurement is difficult as software is invisible and the effect and efficiency caused by process change are not visibly identified. Therefore, it is not easy to extract the strategy of improvement. This paper measures and analyzes the project performance, focusing on organizations` external effectiveness and internal efficiency (Qualify, Delivery, Cycle time, and Waste). Based on the measured project performance scores, an OT (Opportunity Tree) model was designed for optimizing the project performance. The process of design is as follows. First, meta data are derived from projects and analyzed by quantitative GQM(Goal-Question-Metric) questionnaire. Then, the project performance model is designed with the data obtained from the quantitative GQM questionnaire and organization`s performance score for each area is calculated. The value is revised by integrating the measured scores by area vision weights from all stakeholders (CEO, middle-class managers, developer, investor, and custom). Through this, routes for improvement are presented and an optimized improvement method is suggested. Existing methods to improve software process have been highly effective in division of processes` but somewhat unsatisfactory in structural function to develop and systemically manage strategies by applying the processes to Projects. The proposed OT model provides a solution to this problem. The OT model is useful to provide an optimal improvement method in line with organization`s goals and can reduce risks which may occur in the course of improving process if it is applied with proposed methods. In addition, satisfaction about the improvement strategy can be improved by obtaining input about vision weight from all stakeholders through the qualitative questionnaire and by reflecting it to the calculation. The OT is also useful to optimize the expansion of market and financial performance by controlling the ability of Quality, Delivery, Cycle time, and Waste.
A Study on the Component Based Development Methodology : MCPI for Crop Production Information System
Park Dong-Jin ; Seo Soon-Mo ; Kim In-Hwan ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 429~438
DOI : 10.3745/KIPSTD.2005.12D.3.429
For the implementation of science and technology based agriculture, one of the domestic rural development strategies, it is essential that we should have an integrated information system for each crop production. This system would be a web-based collaborative system for the local farmer and the advisors who guide the crop production technically, and would be capable of providing the real-time analysis functionalities and expert knowledge. In this thesis, we proposed a component based development methodology called MCPI(Method for Crop Production Information system) which employs and re-organizes Marmi-III, the popular existing component based methodology for the large scale S/W development project. In particular, MCPI is designed to reflect the characteristics of crop production information system and for the small and medium S/W project. To show the applicability in real-world problems, we develop and evaluate a prototype which is based on our proposed methodology for the rice production farmer in mid-Choongnam area.
Weighting of XML Tag using User`s Query
Woo Seon-Mi ; Yoo Chun-Sik ; Kim Yong-Sung ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 439~446
DOI : 10.3745/KIPSTD.2005.12D.3.439
XML is the standard that can manage systematically WWW documents and increase retrieval efficiency. Because XML documents have the information of contents and that of structure in single document, users can get more suitable retrieval result by retrieving the information of content as well as that of logical structure. In this paper, we will propose a method to calculate the weights of XML tags so that the information of XML tag is used to index decision. A proposed method creates term vector and weight vector for XML tags, and calculates weight of tag by reflecting user`s retrieval behavior (user`s query). And it decides the weights of index terms of XML document by reflecting the weights of tags. And we will perform an evaluation of proposed method by comparison with existing researches using weights of paragraphs.
A Diagram System based on XML
Kim Sung-Keun ; Kim Young-Chul ; Youn Tae Hee ; Yoo Chae-Woo ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 447~454
DOI : 10.3745/KIPSTD.2005.12D.3.447
Generally, Diagram Systems related XML document are designed for certain purpose. It is also difficult to create DML document, because there is no definition of diagram component. In this paper, we design and implement the diagram system to execute the XML document. This diagram system defines the diagram component with WYSIWIG concept ,md it is designed to generate DML document automatically. Therefore, it is possible to develop diagram efficiently and maintain consistency by definition of syntax about diagram with DTD. And this system uses the concept of VPL(Visual Programming Language) to check syntax and semantic about diagram sentence. Though this system, DML documents can be generated easily, and it can also check syntax and perform semantic.
A Design and Development of a Wireless-Wireless-linked Mobile Game Content
Ko Il Seok ; Lee Jang Beom ; Cho Dong Uk ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 455~460
DOI : 10.3745/KIPSTD.2005.12D.3.455
An improvement of a mobile game content production and a service technology are bringing an explosive increase of a mobile game market. Currently serviced mobile games are using a WAP method and a download method. Because of technical problems, we couldn`t develop the mobile game content which sequentially linked WAP->download and download->WAP. In this study, we design and develop the mobile game content which sequentially linked WAP->download and download->WAP. In the proposed method, we can linked the stage and the ranking information as sharing a data on real time that it is impossible in the previous mobile game content.
User-Class based Service Acceptance Policy using Cluster Analysis
Park Hea-Sook ; Baik Doo-Kwon ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 461~470
DOI : 10.3745/KIPSTD.2005.12D.3.461
This paper suggests a new policy for consolidating a company`s profits by segregating the clients using the contents service and allocating the media server`s resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. In this case, CRM refers to the strategy of consolidating a company`s profits by efficiently managing the clients, providing them with a more effective, personalized service, and managing the resources more effectively. For the realization of a new service policy, this paper analyzes the level of contribution
the clients` service pattern (total number of visits to the homepage, service type, service usage period, total payment, average service period, service charge per homepage visit) and profits through the cluster analysis of clients` data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. Likewise, the CRFA (Client Request Filtering algorithm) was suggested per cluster to allocate media server resources. CRFA issues approval within the resource limit of the cluster where the client belongs. In addition, to evaluate the efficiency of CRFA within the Client/Server environment the acceptance rate per class was determined, and an evaluation experiment on network traffic was conducted before and after applying CRFA. The results of the experiments showed that the application of CRFA led to the decrease in network expenses and growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.
A Study on Selection Method and Mediateness Degree of Difficulty of Examination Questions in Web-based Education System
Kim Eun-Jung ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 471~480
DOI : 10.3745/KIPSTD.2005.12D.3.471
Most questions made for remote examinations on web-based education system use methods of making questions using fixed questions or randomly using item pools or automatically using degree of difficulty. Particularly, automatically selection methods using degree of difficulty is the kernel of a question that objectivity of the first degree of difficulty for questions and an effective questions selection using degree of difficulty and mediateness degree of difficulty based result of examination. This paper is use automatically selection methods for examination on web-based education system. Firstly, we present new question selection algorithms as regards degree of difficulty and distribution between all units. Secondly, we present new algorithms of mediateness degree of difficulty as regards education ability of students for adjust the degree of difficulty. We identified this algorithms is more effective as compared with previously algorithms on web-based education system.
Development of Localization Tracking System and User Interface of Guiding Robot for the Visually Impaired
Ryu Je-Goon ; Shen Dong-Fan ; Kwon Oh-Sang ; Kim Nack-Hwan ; Lee Sang-Moo ; Lee Eung-Hyuk ; Hong Seung-Hong ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 481~492
DOI : 10.3745/KIPSTD.2005.12D.3.481
To guide the guiding robot for the visually impaired carefully, the digital map to be used to search a path must be detailed and has some information about dangerous spots. It also has to search not only safe but also short path through the position data by GPS and INS sensors. In this paper, as the difference of the ability that the visually unpaired can recognize, we have developed the localization tracking system so that it can make a movement path and verify position information, and the global navigation system for the visually impaired using the GPS and INS. This system can be used when the visually impaired move short path relatively. We had also verified that the system was able to correct the position as the assistant navigation system of the GPS on the outside.
Design and Implementation of a Mobile System for Exploiting the Internet Product Information Effectively
Ha Sangho ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 493~498
DOI : 10.3745/KIPSTD.2005.12D.3.493
With the advances of wireless technologies and mobile computing, m-commerce is being realized for several mobile devices such as PDAs and mobile phones. Currently, service contents in m-commerce are usually newly written to meet specific characteristics of the target mobile devices, thus requiring formidable efforts. Therefore, we should exploit the Internet product information currently being provided for e-commerce. However, bringing the Internet product to mobile devices is far from straightforward due to the many limitations of mobile devices such as little memory, small displays, low processing speeds, and so forth. In this paper, we first suggest a new model to effectively adapt the Internet product information for mobile phones. We then suggest a mobile system to implement the model. We then design and implement the system. Finally, we give experiments on the system.
Hash-Chain based Micropayment without Disclosing Privacy Information
Jeong Yoon-Su ; Baek Seung-Ho ; Hwang Yoon-Cheol ; Lee Sang-Ho ;
The KIPS Transactions:PartD, volume 12D, issue 3, 2005, Pages 499~506
DOI : 10.3745/KIPSTD.2005.12D.3.499
A hash chain is a structure organized by hash function with high speed in computation. Systems using the hash chain are using extensively in various cryptography applications such as one-time passwords, server-supported signatures and micropayments. However, the most hash chain based on the system using pre-paid method provides anonymity but has the problem to increase payment cost. In this paper, we propose a new hash chain based on the micropayment system to keep user anonymity safe through blind signature in the withdrawal process of the root value without disclosing privacy information, and to improve efficiency by using secret key instead of public key in the system without the role of certificate.