Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korea Multimedia Society
Journal Basic Information
Journal DOI :
Korea Multimedia Society
Editor in Chief :
Volume & Issues
Volume 11, Issue 12 - Dec 2008
Volume 11, Issue 11 - Nov 2008
Volume 11, Issue 10 - Oct 2008
Volume 11, Issue 9 - Sep 2008
Volume 11, Issue 8 - Aug 2008
Volume 11, Issue 7 - Jul 2008
Volume 11, Issue 6 - Jun 2008
Volume 11, Issue 5 - May 2008
Volume 11, Issue 4 - Apr 2008
Volume 11, Issue 3 - Mar 2008
Volume 11, Issue 2 - Feb 2008
Volume 11, Issue 1 - Jan 2008
Selecting the target year
Query Processing using Information of Parent Nodes in Partitioned Inverted Index Tables
Kim, Myung-Soo ; Hwang, Byung-Yeon ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 905~913
Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.
Load Balancing Method for Query Processing Based on Cache Management in the Grid Database
Shin, Soong-Sun ; Back, Sung-Ha ; Eo, Sang-Hun ; Lee, Dong-Wook ; Kim, Gyoung-Bae ; Chung, Weon-Il ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 914~927
Grid database management systems are used for large data processing, high availability and data integration in grid computing. Furthermore the grid database management systems are in the use of manipulating the queries that are sent to distributed nodes for efficient query processing. However, when the query processing is concentrated in a random node, it will be occurred with imbalance workload and decreased query processing. In this paper we propose a load balancing method for query processing based on cache Management in grid databases. This proposed method focuses on managing a cache in nodes by cache manager. The cache manager connects a node to area group and then the cache manager maintains a cached meta information in node. A node is used for caching the efficient meta information which is propagated to other node using cache manager. The workload of node is distributed by using caching meta information of node. This paper shows that there is an obvious improvement compared with existing methods, through adopting the proposed algorithm.
Version Management Method for Consistency in the Grid Database
Shin, Soong-Sun ; Jang, Yong-Il ; Chung, Weon-Il ; Lee, Dong-Wook ; Eo, Sang-Hun ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 928~939
The grid database management system is used for large data processing, high availability and data integration by grid environment. It has a replica for processing performance and high availability in each node. The grid database has a problem of inconsistency, when the update is occurred with a coincidently frequent. To solve this problem, in this paper proposed a version management method for consistency in the grid database. Proposed version manager manages a version of each replica. The version manager keeps a consistency of update operation when is occurred at each node by using a pending queue and waiting queue. Also the node keeps a consistency using a priority queue. So, proposed method has stable and fast update propagation. The proposed method shows stable and faster update propagation than traditional method by performance evaluation.
Integration of XML Schemas Based on Domain Ontology
Kang, Hae-Ran ; Lee, Kyong-Ho ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 940~955
Semantically similar XML documents in the same application domain might often conform to different schemas. To uniformly view and query such XML documents, we need an efficient method of integrating XML schemas. This paper proposes a sophisticated method for integrating XML schemas in the same application domain. To compute mapping relationships between schemas, the proposed method utilizes various relationships, such as synonyms and hypernyms, between lexical items based on dictionaries and domain ontologies. Particularly, the relationships between lexical items are elaborated by taking their structural information into account. In addition, this paper proposes a more accurate method for integrating compositors. Experimental results with schemas in various application domains show that the utilization of domain ontologies and the structural relationships between lexical items enhance the precision and recall of integrated schemas.
Fast Intra Prediction using Pixel Variation in H.264
Lee, Tak-Gi ; Kim, Sung-Min ; Sin, Kwang-Mu ; Chung, Ki-Dong ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 956~965
H.264/AVC is the newest video coding standard of ITU-T VCEG and the ISO/IEC MPEG, offering a significant performance improvement over previous video coding standards. However, the computational complexity of H.264/AVC is drastically increased because of new technologies such as intra prediction, variable block size, quarter-pels motion estimation/compensation, etc. In this paper, we propose a fast intra prediction scheme which has two step processing. The first step is a fast block size decision which can be calculated only in one block without considering all cases of
block. The complexity of the intra prediction can be reduced by using boundary difference values of macroblock. After selecting the block size, we can make mode decision using the neighbouring reference pixels and representative pixels of the block in the second step. The experimental results show that the proposed algorithm saved on the average 41.5% encoding time without any significant PSNR losses.
A resource reservation method adjusting the delay budgets of a traffic flow allocated to the RSVP-capable routers
Kim, Tae-Joon ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 966~976
Providing Quality-of-Service(QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol(RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method that can adjust adaptively the delay budget of traffic flow allocated to each RSVP-capable router in which the router uses the recently developed general-time fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 90% compared to that in the original one in terms of the number of admitted flows.
Design and Implementation of An Automatic Telemetering/Rate Notification System Using CDMA Mobile Communication Modules
Kang, Chang-Soon ; Kim, Soo-Jeong ; Ko, Eun-Young ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 977~985
This paper is concerned with automatic telemetering system which reads the consumed quantity of electricity, gas, and piped water. The existing metering method such that a meterman visits households and directly reads meters can cause several problems, including violation of privacy and the possibility of criminal accident, as well the inefficiency in viewpoint of system operation and rate notification. In this paper, we propose a new automatic telemetering and rate notification system, in which the system reads several meters at remote locations and notifies the rates to the customer's cellular phone with short message service(SMS). The proposed system has been developed by using CDMA mobile communication modules and personal computers. This system can operate only with cellular communication network even without wired-internet facilities. In particular, the developed system can provide home security and convenience as well as cost reduction, and thus be applied to intelligent home networks.
A Study on the Self-Healing Mechanism using Spanning Tree Algorithm for PLC-based Home Network
Hwang, Min-Tae ; Choi, Sung-Soo ; Lee, Won-Tae ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 986~996
The home network environment based on the power line communication has some unexpected events. The noise source from the home appliances makes the network impedance increased, and the transmission packets distorted. Therefore the packet transmission from the source node may not be delivered to the destination node directly. In this paper we propose a new self-healing mechanism which relays the packet to the directly unreachable destination automatically with the help of intermediate nodes. In order to choose the minimum required intermediate nodes our mechanism makes a spanning tree with both the directly reachable nodes and indirectly reachable nodes via the intermedia nodes. We developed the network simulator in order to compare its performance to the Echelon's repeater selecting mechanism. Though it required more packet relations than Echelon's but the reachable probability to the destination was highly increased about two times.
A RSVP-capable Router to improve the bandwidth utilization efficiency in resource reservation
Kim, Tae-Joon ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 997~1006
SVP-capable router supporting guaranteed services on the internet generally uses a packet scheduler based on the Weighted Fair Queuing(WFQ) algorithm to secure required qualities of traffic flows. In this paper we proposed a RSVP-capable router based on the LOFQ(Latency optimized fair queuing) algorithm that improves the efficiency in bandwidth utilization with keeping the compatibility with the original RSVP procedure. The proposed router reserves the optimal amount of resource for each flow to secure its required quality-of-service with the recently introduced LOFQ scheduler. The results of the simulation applying the proposed router to an evaluation network showed that it may yield the gain of up to 30% compared to that in the original one in terms of the number of admitted flows.
Performance Analysis of Sensor Network Real-Time Traffic for Factory Automation in Intranet Environment
Song, Myoung-Gyu ; Choo, Young-Yeol ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 1007~1015
In order to provide real-time data from sensors and instruments at manufacturing processes on web, we proposed a communication service model based on XML(eXtensible Markup Language). HTML(Hyper Text Markup Language) is inadequate for describing real-time data from manufacturing plants while it is suitable for display of non-real-time multimedia data on web. For applying XML-based web service of process data in Intranet environment, real-time performance of communication services was evaluated to provide the system design criteria. XML schema for the data presentation was proposed and its communication performance was evaluated by simulation in terms of transmission delay due to increased message length and processing delay for transformation of raw data into defined format. For transformation of raw data into XML format, we proposed two structures: one is the scheme where transformation is done at an SCC(Supervisory Control Computer) after receiving real-time data from instruments. the other is the scheme where transformation is carried out at instruments before the data are transmitted to the SCC. Performances of two structures were evaluated on a testbed under various conditions such as six packet sizes and offered loads of 20%, 50% and 80%, respectively. Test results show that proposed schemes are applicable to the systems in Ethernet 100BaseT network if total message traffic is less than 7 Mbps.
Development of a Prototype System for Active Emergency Call Services
Han, Won-Hee ; Song, Eun-Ha ; Han, Sung-Kook ; Jeong, Young-Sik ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 1016~1024
In this paper, we designed and implemented the ACE(ACtive Emergency call service system) system for emergency call service actively. ACE system has two physical components; E-Device(Emergency Mobile Device) and E-Server(Emergency Server). The role of E-Device is the mobile device in order to call emergency by using mild handi-capped, the elderly and children who are able to communicate theirs intention to another. E-Server is the server for management E-devices with realtime monitering. E-Device will be developed to the portable size for easily mild handi-capped, the elderly and children. When they need the service of emergency call, the button of E-device can be used and the call signal is transmitted to the emergency office and the guardian through Internet and CDMA. E-server should be developed the integrated control system for management of E-Devices basically. And it also supported to realtime monitoring of E-devices with respect to high quality of emergency call service for rise the efficiency.
Partition and Caching Mechanism for GML Visualization on Mobile Device
Song, Eun-Ha ; Park, Yong-Jin ; Han, Won-Hee ; Jeong, Young-Sik ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 1025~1034
In this paper, we developed GridGML for efficiently supplying a GML and visualizing the map with partitioning map and caching method to a mobile device. In order to overcome the weighting of a file, which is the biggest weakness of a GML, GridGML extracts only the most necessary parts for the visualization of the map among GML attributes, and makes the file light as a class instance by applying an offset value. GridGML manages a partition based on the visualization area of a mobile device to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the transmission time uniformly.
Learning and Performance Comparison of Multi-class Classification Problems based on Support Vector Machine
Hwang, Doo-Sung ;
Journal of Korea Multimedia Society, volume 11, issue 7, 2008, Pages 1035~1042
The support vector machine, as a binary classifier, is known to surpass the other classifiers only in binary classification problems through the various experiments. Even though its theory is based on the maximal margin classifier, the support vector machine approach cannot be easily extended to the multi-classification problems. In this paper, we review the extension techniques of the support vector machine toward the multi-classification and do the performance comparison. Depending on the data decomposition of the training data, the support vector machine is easily adapted for a multi-classification problem without modifying the intrinsic characteristics of the binary classifier. The performance is evaluated on a collection of the benchmark data sets and compared according to the selected teaming strategies, the training time, and the results of the neural network with the backpropagation teaming. The experiments suggest that the support vector machine is applicable and effective in the general multi-class classification problems when compared to the results of the neural network.