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 11D, Issue 7 - Dec 2004
Volume 11D, Issue 6 - Oct 2004
Volume 11D, Issue 5 - Oct 2004
Volume 11D, Issue 4 - Aug 2004
Volume 11D, Issue 3 - Jun 2004
Volume 11D, Issue 2 - Apr 2004
Volume 11D, Issue 1 - Feb 2004
Volume 11, Issue 6 - 00 2004
Volume 11, Issue 5 - 00 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
Extraction and Indexing Representative Melodies Considering Musical Composition Forms for Content-based Music Information Retrievals
Ku, Kyong-I ; Lim, Sang-Hyuk ; Lee, Jae-Heon ; Kim, Yoo-Sung ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 495~508
DOI : 10.3745/KIPSTD.2004.11D.3.495
Recently, in content-based music information retrieval systems, to enhance the response time of retrieving music data from large music database, some researches have adopted the indexing mechanism that extracts and indexes the representative melodies. The representative melody of music data must stand for the music itself and have strong possibility to use as users` input queries. However, since the previous researches have not considered the musical composition forms, they are not able to correctly catch the contrast, repetition and variation of motif in musical forms. In this paper, we use an index automatically constructed from representative melodies such like first melody, climax melodies and similarly repeated theme melodies. At first, we expand the clustering algorithm in order to extract similarly repeated theme melodies based on the musical composition forms. If the first melody and climax melodies are not included into the representative melodies of music by the clustering algorithm, we add them into representative melodies. We implemented a prototype system and did experiments on comparison the representative melody index with other melody indexes. Since, we are able to construct the representative melody index with the lower storage by 34％ than whole melody index, the response time can be decreased. Also, since we include first melody and climax melody which have the strong possibility to use as users` input query into representative melodies, we are able to get the more correct results against the various users` input queries than theme melody index with the cost of storage overhead of 20％.
Inverted Indexes for XML Updates and Full-Text Retrievals in Relational Model
Cheon, Yun-Woo ; Hong, Dong-Kweon ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 509~518
DOI : 10.3745/KIPSTD.2004.11D.3.509
Recently there has been some efforts to add XML full-text retrievals and XML updates into new standardization of XML queries. XML full-text retrievals plays an important role in XML query languages. of like tables in relational model an XML document has complex and unstructured natures. We believe that when we try to get some information from unstructured XML documents a full-text retrieval query is much more convenient approach than a regular structured query XML update is another core function that an XML query have to have. In this paper we propose an inverted index to support XML updates and XML full-text queries in relational environment. Performance comparisons exhibit that our approach maintains a comparable size of inverted indexes and it supports many full-text retrieval functions very well. It also shows very stable retrieval performance especially for large size of XML documents. Foremost our approach handles XML updates efficiently by removing cascading effects.
An Approach for Integrated Modeling of Protein Data using a Fact Constellation Schema and a Tree based XML Model
Park, Sung-Hee ; Li, Rong-Hua ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 519~532
DOI : 10.3745/KIPSTD.2004.11D.3.519
With the explosion of bioinformatics data such proteins and genes, biologists need a integrated system to analyze and organize large datasets that interact with heterogeneous types of biological data. In this paper, we propose a integration system based on a mediated data warehouse architecture using a XML model in order to combine protein related data at biology laboratories. A fact constellation model in this system is used at a common model for integration and an integrated schema it translated to a XML schema. In addition, to track source changes and provenance of data in an integrated database employ incremental update and management of sequence version. This paper shows modeling of integration for protein structures, sequences and classification of structures using the proposed system.
Incremental Materialized View Management Model for Realtime Report Generation on Large Transaction Processing Environment
Kim, Jin-Soo ; Shin, Ye-Ho ; Ryu, Keun-Ho ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 533~544
DOI : 10.3745/KIPSTD.2004.11D.3.533
Reports have a significant meaning in time-constrained large transaction environments, such as airplane control systems or wargame simulations. This is due to the necessity of generating reports within a given time limit without restraining the operation performance of large transaction environments. In order to generate reports in large transaction environments while satisfying time-constrained requirements, this paper proposes a model which combines the incremental operation mechanism and materialized view mechanism using triggers and stored procedures. Further, the implementation and evaluation of the proposed model provides the Identification of the characteristics of the proposed model.
Algorithm mining Association Rules by considering Weight Support
Kim, Keun-Hyung ; Whang, Byung-Woong ; Kim, Min-Chul ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 545~552
DOI : 10.3745/KIPSTD.2004.11D.3.545
Association rules mining, which is one of data mining technologies, searches data among which are frequent and related to each other in database. But, although the data are not of frequent and rare in database, they have the enough worth of business information if the data ares important and strongly related to each other, In this paper, we propose the algorithm discovering association rules that consist of data, which are rare but, important and strongly related to each other in database. The proposed algorithm was evaluated through simulation. We found that the proposed algorithm discovered efficiently association rules among data, which are not frequent but, important.
A Methodology for View Integration Using ERD Thesaurus
Lee, Won-Jo ; Koh, Jae-Jin ; Jang, Gil-Sang ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 553~562
DOI : 10.3745/KIPSTD.2004.11D.3.553
This paper constructs ERD thesaurus that is storing information about Entity Relationship Diagram(ERD), and proposes an ERD thesaurus-based methodology for view integration in an important conceptual design step in designing databases. To show the usefulness of proposed methodology, the prototype for view integration support system is implemented for the applied case. As a result, ERD thesaurus-based methodology is more effective than the existing methodologies for view Integration in the aspects of affinity analysis, semantic conflicts resolution, and view Integration processes. Therefore, our methodology is expected to be utilized in integrating the existing fragmented schema or designing a large database integration.
A Methodology for Performance Evaluation of Web Robots
Kim, Kwang-Hyun ; Lee, Joon-Ho ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 563~570
DOI : 10.3745/KIPSTD.2004.11D.3.563
As the use of the Internet becomes more popular, a huge amount of information is published on the Web, and users can access the information effectively with Web search services. Since Web search services retrieve relevant documents from those collected by Web robots we need to improve the crawling quality of Web robots. In this paper, we suggest evaluation criteria for Web robots such as efficiency, continuity, freshness, coverage, silence, uniqueness and safety, and present various functions to improve the performance of Web robots. We also investigate the functions implemented in the conventional Web robots of NAVER, Google, AltaVista etc. It is expected that this study could contribute the development of more effective Web robots.
An Exploratory Study on Project Quality Certification System and Organizational Culture for Project Quality Improvement
Moon, Song-Chul ; Kim, Hyun-Soo ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 571~576
DOI : 10.3745/KIPSTD.2004.11D.3.571
Quality of software development project is very important In complex and large domestic soft ware markets. CMM level certification evaluates duality of software development project at present. Therefore, software development company endeavor for acquisition of CMM certification, level up CMM and organization`s competitive power But, today confidentiality of CMM certification come into question, an exploratory study undertake about difference of software project quality and organization performance between CMM certificated organization and no-CMM certificated organization. Two organizations different partially. First of all, incremental improvement of software project process takes precedence of CMM certification. It is better to fit between culture of organization and CMM certification for project quality.
A Metamodel for Creation and Maintenance of Evaluation Set of Software Package Evaluation
Oh, Jae-Won ; Lee, Chong-Won ; Park, Dong-Chul ; Lee, Byung-Jeong ; Wu, Chi-Su ; Kim, Soon-Yong ; Song, Gi-Pyeung ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 577~590
DOI : 10.3745/KIPSTD.2004.11D.3.577
Today, the growth of software industry leads to e quantitative expansion of software package products. Due to this rapid increase of software package products, qualify certification has been required fur software products which users select. Unlike the quality certification of industrial products, the history of software product certification has not been so long. For this reason, software quality evaluation and certification methods have not matured yet. When certifying software products, one of most important factors is the systematic generation of evaluation sets. The evaluation sets include checklists with metrics, and criteria for the software quality certification according to the classification of software product type. This paper presents a metamodel for the systematic generation and maintenance of the evaluation sets. Then, we construct prototype level evaluation sets to show the validity of the metamodel.
A Study on UML-Based Role Modeling for Extracting Components
Song, Ho-Young ; Kim, Jung-Jong ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 591~596
DOI : 10.3745/KIPSTD.2004.11D.3.591
Systematic modeling methods. which can correctly represent user requirements, are absolutely required to extract components when developing components. But, components are designed and developed In general based on the concept of object modeling so that they lacks in supporting representing cooperation and interaction as well as reuse. It means extracting components is not easy to be applied to complicated and sophisticated large-scale systems. This paper utilizes a role modeling method based on the role of objects, not on objects themselves, to complement object modeling. The Role modeling can break down a complicated system into simple models through abstracting the pattern of objects based on roles of the objects. In this study, an UML-based method extracting components through role modeling is embodied. UML can represent models from various standpoints so that role models arc also viewed from several points of view.
A Software Cost Estimation Using Growth Curve Model
Park, Seok-Gyu ; Lee, Sang-Un ; Park, Jae-Heung ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 597~604
DOI : 10.3745/KIPSTD.2004.11D.3.597
Accurate software cost estimation is essential to both developers and customers. Most of the cost estimating models based on the size measure methods, such as LOC and FP, are obtained through size estimation. The accuracy of size estimation directly influences the accuracy of cost estimation. As a result, the overall structure of regression-based cost models applies the power function based on software size. Many growth phenomenon in nature such as the growth in living organism, performance of technology, and learning capability of human show an S-shaped curve. This paper proposes a model which estimates the developing effort by using the growth curve. The presented model assumes that the relation cost and size follows the growth curve. The appropriateness of the growth curve model based on Function Point, Full-Function Point and Use-Case Point, which are the general methods in estimating the software size have been confirmed. The proposed growth curve model shows similar performance with power function model. In conclusion, the growth curve model can be applied in the estimation of the software cost.
A Study on Wrapping of Legacy System using a Transaction Adaptor Component
Hwang, Sun-Myung ; Kim, Sang-Young ; Kim, Jung-Ah ; Jin, Young-Tak ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 605~616
DOI : 10.3745/KIPSTD.2004.11D.3.605
The purpose of CBSD(Component Based Software Development) if to develop software using a reuse component and components assembly. The reused components have to be adapter for satisfaction of requirement specification. This paper represents a component adaption method which reuse previously developed component or legacy system, using an adaptation component called by TA(Transaction Adaptor). The adaptation using TA transmits XML data that is translated into stream type, from a client to on host system. And we introduce RS(Rule Server) which gets some Information from XML data for application program development. Through the Interaction of TA and RS, we can improve effectiveness of component development and maintenance and we can reuse legacy system.
A Design on Component Service Repository using Dynamic Resource Management and Algorithm on Configuration of Dependency
Choi, Sang-Kyoon ; Song, Young-Jae ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 617~624
DOI : 10.3745/KIPSTD.2004.11D.3.617
Recent developments in component technology enable the construction of complex software systems by assembling together off-the-shelf components However, It is still difficult to develop efficient, reliable, and dynamically configurable component-based systems. Unspecified dependencies and behavior on components often has cause the source of the trouble. Therefore, component-based software systems must maintain explicit presentations of inter-component dependence and component requirements. In this paper, I describe the design on repository of component service to deployment, status reporting, and control in component service. Through the existing researches to customize component technology, I present the algorithm that supports dynamic dependency interface in order to reuse context of application.
Identification of Business Component based on Independence Metric
Choi, Mi-Sook ; Cho, Eun-Sook ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 625~634
DOI : 10.3745/KIPSTD.2004.11D.3.625
When constructing a component based system, It is understood that identifying reusable and independent business components is of utmost importance. However, according to conventional component based developing methodologies, most of developers depend on their experience and/or intuition for identification of business components. Furthermore, there are no criteria to evaluate whether the identified business components are more independently defined or not. Therefore, we propose a component identification metrics to apply to component properties In order to complement the difficulties of identifying business components through developers` experience and/or intuition. The metrics defined are the criteria for identifying the business Components and/or for evaluating the Identified components. We propose both a cohesion metric, and a coupling metric, to which component properties are applied, wherein those properties can be understood by high cohesion in, and low coupling between, components. Moreover, we propose an independence metric that can evaluate the degree of independence for a particular component by ratio of the cohesion and coupling of components. The metrics that we propose are applied to case study which demonstrates the identification of more independent business components and the validity of our metrics.
A Plan for Improvement of Usability in Extreme Programming
Lee, Sang-Jun ; Bae, Seok-Chan ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 635~648
DOI : 10.3745/KIPSTD.2004.11D.3.635
Extreme programming is the most representative methodology among agile software development methodologies that is agile in business environment which change fast. As software industry is matured, usability of software quality characteristics is emphasized gradually, but effort to obtain usability in extreme programming is insufficient. In this paper, three things lacked in extreme programming are reinforced. First, roles of user interface expert are defined. Second, usability testing method to extreme programming are introduced. Third, development process and products are proposed. The proposed plan is validated by four methods, which analyze supporting software development life cycle, analyze satisfaction of CMM key process areas, analyze satisfaction of CMM practices, and analyze development of green tea shopping mail. Green tea shopping mall is improved 23％ in the estimated running time, 21％ in the learnability. Also, usability is improved 18％ in the heuristic evaluation and 16％ in the questionnaire method.
Object-Oriented Software Interaction Test Techniques using Design/CPN
Li, Ren-Ge ; Koo, Yeon-Seol ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 649~658
DOI : 10.3745/KIPSTD.2004.11D.3.649
An object-oriented system is organized by a set of interacting objects and the system behavior is represented by the cooperating interaction bet ween objects. The characteristics of object-oriented software. such as inheritance and polymorphism, increase the difficulty of the object-oriented software testing. At running time of a program, one call from a member function can bind to other member functions because of the dynamic characteristics such as concurrence, dynamic binding and interaction. Therefore, there need the research about considering the characteristics of object-oriented software and concurrently testing the interaction between objects. In this paper, we propose the techniques as follows. First, we construct a flattened state chart diagram by considering the inheritance and polymorphism. Next, we model the system with CPN(Colored Petri Net) that usually is applying the system modeling and simulation. Last, we propose a test case generation techniques for testing the interaction between objects in object-oriented software by applying a Design/CPN tool.
Construction of Evaluation Process and Test System for Embedded Software
Yang, Hae-Sool ; Shin, Seok-Kyoo ; Jung, Hye-Jung ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 659~670
DOI : 10.3745/KIPSTD.2004.11D.3.659
It is possible to implement high quality system which coincided with embedded system purchaser`s requirements by quality test. The concrete quality test system applicable within our country for embedded software was not constructed yet. Recently, various embedded systems are developed, but they have many problems such as recall by defect. In this paper, we developed evaluation modules and quality test fables which can implement duality test based on ISO/IEC 12119 for embedded software evaluation.
Design of Required Interface for Components in EJB Environment
Yoon, Hee-Yoon ; Kim, Soo-Dong ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 671~682
DOI : 10.3745/KIPSTD.2004.11D.3.671
As new and diverse information technologies are being introduced and software complexity is increased, software development cost and efforts are also sharply increased. Component-Based Development (CBD) technology is appealing as a new way to reduce the cost and effort by increasing reusability and maintainability. Component in CBD has variability infernally which enables customization of the component within the specific domain. A component user can easily set up internally variability parts though Required interface which is provided by the component. Enterprise JavaBeans (EJB) is utilized as a commercial standard to implement Java-based components. However, EJB constructs are limited in directly implementing Required interfaces of coarse-grained components［8］. In this paper, we define Required interface and propose interface-storage technique, class-storage technique, interface-generation technique, and Plug -in technique for implementing required interface of component. Interface-storage technique stores variable value in Required interface and class-storage technique take the Bean containg variability as Required interface without modification of component model. Interface-generation technique generates new Bean which takes the role of Required interface for component variability and Plug-in technique sets up component variability that component user plugged-in variable part externally The proposed four techniques conform to the semantics of CBD component interface and enable the implementation of high quality components.
A Development Technique of Core Architecture Data Model(CADM) for Defense Information Resource Management
Choi, Nam-Yong ; Jin, Jong-Hyeon ; Song, Young-Jae ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 683~690
DOI : 10.3745/KIPSTD.2004.11D.3.683
MND(Ministry of National Defense) has developed .nm AF(Ministry of National Defense Architecture Framework) to guarantee interoperability among defense information systems. Users can easily and consistently develop architecture products through MND AF. There is necessity for development if CADM(Core Architecture Data Model), which facilitate exchange, integration, and comparison for architecture data, to store architecture data from architecture products and reuse them. We developed CADM from defining entities and relationships that satisfy data requirement of each architecture product from MND AF. After we developed architecture products about MIMS(Military Intelligence Management System), and inserted these architecture data to CADM repository. we verified CADM entities and relationships through query. Through CABM which provides common data model for the whole my architectures, interoperability and integration among defense information systems ran be improved, and integrated defense information resources efficiently can be managed.
The High-Speed Extraction of Interest Region in the Parcel Image of Large Size
Park, Moon-Sung ; Bak, Sang-Eun ; Kim, In-Soo ; Kim, Hye-Kyu ; Jung, Hoe-Kyung ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 691~702
DOI : 10.3745/KIPSTD.2004.11D.3.691
In this paper, we propose a sequence of method which extrats ROIs(Region of Interests) rapidly from the parcel image of large size. In the proposed method, original image is spilt into the small masks, and the meaningful masks, the ROIs, are extracted by two criterions sequentially The first criterion is difference of pixel value between Inner points, and the second is deviation of it. After processing, some informational ROIs-the areas of bar code, characters, label and the outline of object-are acquired. Using diagonal axis of each ROI and the feature of various 2D bar code, the area of 2D bar code can be extracted from the ROIs. From an experiment using above methods, various ROIs are extracted less than 200msec from large-size parcel image, and 2D bar code region is selected by the accuracy of 100％.
A Study on Korea Postal Addressing Standards
Wang, Seung-Jin ; Chang, Tai-Woo ; Kim, Ho-Yon ; Nam, Yun-Seok ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 703~708
DOI : 10.3745/KIPSTD.2004.11D.3.703
Currently the amount of general letter mail in Korea is on an increasing trend; especially it shows the seasonality that is concentrated in the end of the month or the year. However, the situation is not treated appropriately Moreover. manpower insufficiency if the carriers causes the poor service and the heavy burden of work. Under the existing conditions, the various efforts such as development of the automatic sequence sorting system and construction of the address database are given in order to quicken mall process and lighten the carriers` burden But the inconsistent addressing and the various expressions of address drop the systems and the carriers off in efficiency. In this study, we present the Korean postal addressing standards to make it possible to improve the performance of address recognition and help postmen to sort the mail; particularly focusing on the substance. After analyzing the domestic system, the information structure and the problems of postal address, we propose four fundamentals and the standards including synonyms and acronyms. In addition, we suggest several considerations for mail format. We expect that this study could support the postal service in Korea as a basic standard.
An Intelligent Monitoring System of Semiconductor Processing Equipment using Multiple Time-Series Pattern Recognition
Lee, Joong-Jae ; Kwon, O-Bum ; Kim, Gye-Young ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 709~716
DOI : 10.3745/KIPSTD.2004.11D.3.709
This paper describes an intelligent real-time monitoring system of a semiconductor processing equipment, which determines normal or not for a wafer in processing, using multiple time-series pattern recognition. The proposed system consists of three phases, initialization, learning and real-time prediction. The initialization phase sets the weights and tile effective steps for all parameters of a monitoring equipment. The learning phase clusters time series patterns, which are producted and fathered for processing wafers by the equipment, using LBG algorithm. Each pattern has an ACI which is measured by a tester at the end of a process The real-time prediction phase corresponds a time series entered by real-time with the clustered patterns using Dynamic Time Warping, and finds the best matched pattern. Then it calculates a predicted ACI from a combination of the ACI, the difference and the weights. Finally it determines Spec in or out for the wafer. The proposed system is tested on the data acquired from etching device. The results show that the error between the estimated ACI and the actual measurement ACI is remarkably reduced according to the number of learning increases.
Similarity Measurement with Interestingness Weight for Improving the Accuracy of Web Transaction Clustering
Kang, Tae-Ho ; Min, Young-Soo ; Yoo, Jae-Soo ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 717~730
DOI : 10.3745/KIPSTD.2004.11D.3.717
Recently. many researches on the personalization of a web-site have been actively made. The web personalization predicts the sets of the most interesting URLs for each user through data mining approaches such as clustering techniques. Most existing methods using clustering techniques represented the web transactions as bit vectors that represent whether users visit a certain WRL or not to cluster web transactions. The similarity of the web transactions was decided according to the match degree of bit vectors. However, since the existing methods consider only whether users visit a certain URL or not, users` interestingness on the URL is excluded from clustering web transactions. That is, it is possible that the web transactions with different visit proposes or inclinations are classified into the same group. In this paper. we propose an enhanced transaction modeling with interestingness weight to solve such problems and a new similarity measuring method that exploits the proposed transaction modeling. It is shown through performance evaluation that our similarity measuring method improves the accuracy of the web transaction clustering over the existing method
An Efficient Multi-Attribute Negotiation System using Learning Agents for Reciprocity
Park, Sang-Hyun ; Yang, Sung-Bong ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 731~740
DOI : 10.3745/KIPSTD.2004.11D.3.731
In this paper we propose a fast negotiation agent system that guarantees the reciprocity of the attendants in a bilateral negotiation on the e-commerce. The proposednegotiation agent system exploits the incremental learning method based on an artificial neural network in generating a counter-offer and is trained by the previous offer that has been rejected by the other party. During a negotiation, the software agents on behalf of a buyer and a seller negotiate each other by considering the multi-attributes of a product. The experimental results show that the proposed negotiation system achieves better agreements than other negotiation agent systems that are operated under the realistic and practical environment. Furthermore, the proposed system carries out negotiations about twenty times faster than the previous negotiation systems on the average.
Temporal Association Rules with Exponential Smoothing Method
Byon, Lu-Na ; Park, Byoung-Sun ; Han, Jeong-Hye ; Jeong, Han-Il ; Leem, Choon-Seong ;
The KIPS Transactions:PartD, volume 11D, issue 3, 2004, Pages 741~746
DOI : 10.3745/KIPSTD.2004.11D.3.741
As electronic commerce progresses, the temporal association rule is developed from partitioned data sets by time to offer personalized services for customer`s interest. In this paper, we proposed a temporal association rule with exponential smoothing method that is giving higher weights to recent data than past data. Through simulation and case study, we confirmed that it is more precise than existing temporal association rules but consumes running time