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 14D, Issue 7 - Dec 2007
Volume 14D, Issue 6 - Oct 2007
Volume 14D, Issue 5 - Aug 2007
Volume 14D, Issue 4 - Jun 2007
Volume 14D, Issue 3 - Jun 2007
Volume 14D, Issue 2 - Apr 2007
Volume 14D, Issue 1 - Feb 2007
Selecting the target year
Development of Multimedia Annotation and Retrieval System using MPEG-7 based Semantic Metadata Model
An, Hyoung-Geun ; Koh, Jae-Jin ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 573~584
DOI : 10.3745/KIPSTD.2007.14-D.6.573
As multimedia information recently increases fast, various types of retrieval of multimedia data are becoming issues of great importance. For the efficient multimedia data processing, semantics based retrieval techniques are required that can extract the meaning contents of multimedia data. Existing retrieval methods of multimedia data are annotation-based retrieval, feature-based retrieval and annotation and feature integration based retrieval. These systems take annotator a lot of efforts and time and we should perform complicated calculation for feature extraction. In addition. created data have shortcomings that we should go through static search that do not change. Also, user-friendly and semantic searching techniques are not supported. This paper proposes to develop S-MARS(Semantic Metadata-based Multimedia Annotation and Retrieval System) which can represent and extract multimedia data efficiently using MPEG-7. The system provides a graphical user interface for annotating, searching, and browsing multimedia data. It is implemented on the basis of the semantic metadata model to represent multimedia information. The semantic metadata about multimedia data is organized on the basis of multimedia description schema using XML schema that basically comply with the MPEG-7 standard. In conclusion. the proposed scheme can be easily implemented on any multimedia platforms supporting XML technology. It can be utilized to enable efficient semantic metadata sharing between systems, and it will contribute to improving the retrieval correctness and the user`s satisfaction on embedding based multimedia retrieval algorithm method.
A Tree-structured XPath Query Reduction Scheme for Enhancing XML Query Processing Performance
Lee, Min-Soo ; Kim, Yun-Mi ; Song, Soo-Kyung ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 585~596
DOI : 10.3745/KIPSTD.2007.14-D.6.585
XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.
Efficient Computation of Stream Cubes Using AVL Trees
Kim, Ji-Hyun ; Kim, Myung ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 597~604
DOI : 10.3745/KIPSTD.2007.14-D.6.597
Stream data is a continuous flow of information that mostly arrives as the form of an infinite rapid stream. Recently researchers show a great deal of interests in analyzing such data to obtain value added information. Here, we propose an efficient cube computation algorithm for multidimensional analysis of stream data. The fact that stream data arrives in an unsorted fashion and aggregation results can only be obtained after the last data item has been read. cube computation requires a tremendous amount of memory. In order to resolve such difficulties, we compute user selected aggregation fables only, and use a combination of an way and AVL trees as a temporary storage for aggregation tables. The proposed cube computation algorithm works even when main memory is not large enough to store all the aggregation tables during the computation. We showed that the proposed algorithm is practically fast enough by theoretical analysis and performance evaluation.
An Efficient Path Expression Join Algorithm Using XML Structure Context
Kim, Hak-Soo ; Shin, Young-Jae ; Hwang, Jin-Ho ; Lee, Seung-Mi ; Son, Jin-Hyun ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 605~614
DOI : 10.3745/KIPSTD.2007.14-D.6.605
As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost. In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.
An Efficient Database Design Method for Mobile Multimedia Services on Home Network Systems
Song, Hye-Ju ; Park, Young-Ho ; Kim, Jung-Tae ; Paik, Eui-Hyun ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 615~622
DOI : 10.3745/KIPSTD.2007.14-D.6.615
Recently, users who want to be provided motile devices, such as PDP, PMP, and IPTV connected wireless internet, with multimedia contents are increasing due to an influence of multimedia contents. In the paper, we propose an efficient database design method for managing mobile multimedia services on home network systems. For this, we build relations using attributes required while providing multimedia services, and then design a database. Specially, we propose a database design method based on normalization theory to eliminate redundancies and update anomalies caused by a non trivial multi valued dependency in relations. In the experiments, we compare and analyze occurrence frequencies of data redundancies and update anomalies through query executions on the relation decomposed into normal forms. The results reveal that our database design is failrly effective.
Design and Implementation of Storage Schema and Low-level Storage Manager for GML Documents
Chang, Jae-Woo ; Kim, Young-Guk ; Kim, Young-Jin ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 623~632
DOI : 10.3745/KIPSTD.2007.14-D.6.623
GML is a markup language presented as exchange standard for geographic information by the OGC(Open GIS Consortium). In spatial network databases, researches for supporting GML(Geographic Markup Language) can be divided into the parsing, the storing and the retrieval of GML documents. Among them, the study on the storage of GML documents is essential for their efficient retrieval. However there is little research on the storing of GML documents whereas there have been a lot of researches on the storing of n documents. Because the storage schema designed for XML documents are not appropriate for geographic information, we, in this paper, propose three storage schema for efficiently storing GML documents including geographic information in order to solve the problem that the XML storage schema store duplicate data and need to search many tables for obtaining elements. In addition, we design and implement a low-level storage manager which can store GML documents using the proposed GML storage schema.
Compositional Safety Analysis for Embedded Systems using the FSM Behavioral Equivalence Algorithm
Lee, Woo-Jin ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 633~640
DOI : 10.3745/KIPSTD.2007.14-D.6.633
As the embedded systems closely related with our living become complex by interoperating each other via internet, the safety issue of embedded systems begins to appear For checking safety properties of the system interactions, it is necessary to describe the system behaviors in formal methods and provide a systematic safety analysis technique. In this research, the behaviors of an embedded system are described by Labeled Transition Systems(LTS) and its safety properties are checked on the system model. For enhancing the existing compositional safety analysis technique, we perform the safety analysis techniques by checking the behavioral equivalence of the reduced model and a property model after reducing the system model in the viewpoint of the property.
The Effect of Requirement Creep on the Fixed-Cost Project Planning
Lee, Sang-Un ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 641~648
DOI : 10.3745/KIPSTD.2007.14-D.6.641
To develop a dynamic system project in which the requirement changes frequently, it`s impossible to finish the development within a fixed-cost due to additional budget occurring in need of requirement creep. To manage the successive project within a fixed-cost, it`s better to manage the ratio of necessarily changed size of project and necessary optional requirement. According to Bhagwat, it is occurred in the construction phase. Also, he stated that the software development cost, construction phase cost and requirement cost are equal and it was wrong explanation in the ratio of requirement creep and optional requirement. This paper assumes the requirement creep to be happening in the phase of elaboration and construction. In addition, some differences were supposed to happen between software development cost, construction phase cost, and requirement creep cost. As a result, the reality was preferred rather than the ratio of optional requirement and the ratio of requirement creep.
Development of an Application for Reliability Testing on Controller Area Network
Kang, Ho-Suk ; Choi, Kyung-Hee ; Jung, Gi-Hyun ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 649~656
DOI : 10.3745/KIPSTD.2007.14-D.6.649
Today, controller area network(CAN) is a field bus that is nowadays widespread in distributed embedded systems due to its electrical robustness, low price, and deterministic access delay. However, its use safety-critical applications has been controversial due to dependability limitation, such as those arising from its bus topology. Thus it is important to analyze the performance of the network in terms of load of data bus, maximum time delay, communication contention, and others during the design phase of the controller area network. In this paper, a simulation algorithm is introduced to evaluate the communication performance of the vehicle network and apply software base fault injection techniques. This can not only reduce any erratic implementation of the vehicle network but it also improves the reliability of the system.
A Testing Method for URC Robot Software
Hwang, Sun-Myung ; Chung, Yun-Koo ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 657~664
DOI : 10.3745/KIPSTD.2007.14-D.6.657
URC robot offers necessary service anytime and anywhere by using a network to the robot, expanding the applicable service, keeping all the functions in itself, it undertakes functions for the causing problems through the network. URC software components are composed of HRI(Human Robot Interaction), robot action technology and others. We analyze the quality models based on ISO/IEC 9126, define URC components evaluation specification consists of 4 parts such as generic rule, instance rule, evaluation value and test method. And we define the quality process and test case design for URC, and show a testing and evaluation process for URC components.
Analogy-based Reuse of Object Model
Bae, Je-Min ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 665~674
DOI : 10.3745/KIPSTD.2007.14-D.6.665
Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. Therefore, this paper present analogical matching techniques for the reuse of object models and patterns. And this paper have suggested the object model and the design patterns as reusable components and the representation techniques to store them. Namely, the contents of the paper are as follows. Analogical matching functions to retrieve analogous components from reusable libraries. And the representation of reusable components to be stored in the library in order to support the analogical matching.
An automated memory error detection technique using source code analysis in C programs
Cho, Dae-Wan ; Oh, Seung-Uk ; Kim, Hyeon-Soo ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 675~688
DOI : 10.3745/KIPSTD.2007.14-D.6.675
Memory access errors are frequently occurred in C programs. A number of tools and research works have been trying to detect the errors automatically. However, they have one or more of the following problems: inability to detect all memory errors, changing the memory allocation mechanism, incompatibility with libraries, and excessive performance overhead. In this paper, we suggest a new method to solve these problems, and then present a result of comparison to the previous research works through the experiments. Our approach consists of two phases. First is to transform source code at compile time through inserting instrumentation into the source code. And second is to detect memory errors at run time with a bitmap that maintains information about memory allocation. Our approach has improved the error detection abilities against the binary code analysis based ones by using the source code analysis technique, and enhanced performance in terms of both space and time, too. In addition, our approach has no problem with respect to compatibility with shared libraries as well as does not need to modify memory allocation mechanism.
A study on the mitigation model development for minimizing the incidents of disk unit in information system`s operational risks
Hwang, Myung-Soo ; Lee, Young-Jai ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 689~700
DOI : 10.3745/KIPSTD.2007.14-D.6.689
Organizations and customers lose if business activities we discontinued by an incident of information systems under the current business environment because they pursue real time enterprise and on demand enterprise. The loss includes the intangible decline in brand image, customer separation, and the tangible loss such as decrease in business profits. Thus. it is necessary to have preparedness in advance and mitigation for minimization of a loss due to the business discontinuity and information system`s operational risks. This paper suggests the mitigation model for minimizing the incidents of disk unit in information system`s operational risks. The model will be represented by a network model which is composed of the three items as following: (1) causes, attributes, indicators of an operational risk, (2) a periodic time through an analysis of historical data, (3) an index or a regulation related to the examination of causes of an operational risk.
Design and Application of Metadata Schema in Datawebhouse System
Park, Jong-Mo ; Cho, Kyung-San ;
The KIPS Transactions:PartD, volume 14D, issue 6, 2007, Pages 701~706
DOI : 10.3745/KIPSTD.2007.14-D.6.701
Datawebhouse consists of both web log analysis used for customer management and datawarehouse used for decision support. However, datawebhouse needs complex operations for management in order to transform and integrate data from heterogeneous data sources and distributed systems. We propose a metadata schema in order to enable data integration and data management which are essential in datawebhouse environments. We show that our proposed schema supports datawebhouse development and enables integrated asset management of business information. With ETL metadata for web log extract, we can improve the data processing time of web log.