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:PartA
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 16A, Issue 6 - Dec 2009
Volume 16A, Issue 5 - Oct 2009
Volume 16A, Issue 4 - Aug 2009
Volume 16A, Issue 3 - Jun 2009
Volume 16A, Issue 2 - Apr 2009
Volume 16A, Issue 1 - Feb 2009
Selecting the target year
A Gene Clustering Method with Hierarchical Visualization of Alignment Pairs
Jin, Hee-Jeong ; Park, Su-Hyun ; Cho, Hwan-Gue ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 143~152
DOI : 10.3745/KIPSTA.2009.16-A.3.143
One of the main issues in comparative genomics is to study chromosomal gene order in one or more related species. For this purpose, the whole genome alignment is usually applied to find the horizontal gene transfer, gene duplication, and gene loss between two related genomes. Also it is well known that the novel visualization tool with whole genome alignment is greatly useful for us to understand genome organization and evolution process. There are a lot of algorithms and visualization tools already proposed to find the "gene clusters" on genome alignments. But due to the huge size of whole genome, the previous visualization tools are not convenient to discover the relationship between two genomes. In this paper, we propose AlignScope, a novel visualization system for whole genome alignment, especially useful to find gene clusters between two aligned genomes. This AlignScope not only provides the simplified structure of genome alignment at any simplified level, but also helps us to find gene clusters. In experiment, we show the performance of AlignScope with several microbial genomes such as B. subtilis, B.halodurans, E. coli K12, and M. tuberculosis H37Rv, which have more than 5000 alignment pairs (matched DNA subsequence).
The Study of Protein Structure Visualization and Rendering Speed Using the Geometry Instancing
Park, Chan-Yong ; Hwang, Chi-Jung ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 153~158
DOI : 10.3745/KIPSTA.2009.16-A.3.153
Analysis of 3-dimensional (3D) protein structure plays an important role of structural bioinformatics. The protein structure visualization is the one of the structural bioinformatics and the most fundamental problem. As the number of known protein structure increases rapidly and the study of protein-protein interaction is prevalent, the fast visualization of large scale protein structure becomes essential. The fast protein structure visualization system we proposed is sophisticated and well designed visualization system using geometry instancing technique. Because this system is optimized for recent 3D graphics hardware using geometry instancing technique, its rendering speed is faster than other visualization tools.
OpenGL ES 1.1 Implementation Using OpenGL
Lee, Hwan-Yong ; Baek, Nak-Hoon ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 159~168
DOI : 10.3745/KIPSTA.2009.16-A.3.159
In this paper, we present an efficient way of implementing OpenGL ES 1.1 standard for the environments with hardware-supported OpenGL API, such as desktop PCs. Although OpenGL ES was started from the existing OpenGL features, it becomes a new three-dimensional graphics library customized for embedded systems through introducing fixed-point arithmetic operations, buffer management with fixed-point data type supports, completely new texture mapping functionalities and others. Currently, it is the official three dimensional graphics library for Google Android, Apple iPhone, PlayStation3, etc. In this paper, we achieved improvements on the arithmetic operations for the fixed-point number representation, which is the most characteristic data type for OpenGL ES. For the conversion of fixed-point data types to the floating-point number representations for the underlying OpenGL, we show the way of efficient conversion processes even with satisfying OpenGL ES standard requirements. We also introduced a simple memory management scheme to mange the converted data for the buffer containing fixed-point numbers. In the case of texture processing, the requirements in both standards are quite different and thus we used completely new software-implementations. Our final implementation result of OpenGL ES library provides all of over than 200 functions in OpenGL ES 1.1 standard and completely passed its conformance test, to show its compliance with the standard. From the efficiency viewpoint, we measured its execution times for several OpenGL ES-specific application programs and achieved at most 33.147 times improvements, to become the fastest one among the OpenGL ES implementations in the same category.
Availability based Scheduling Scheme for Fair Data Collection with Mobile Sink in Wireless Sensor Networks
Lee, Joa-Hyoung ; Jo, Young-Tae ; Jung, In-Bum ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 169~180
DOI : 10.3745/KIPSTA.2009.16-A.3.169
With fixed sinks, the network stability could be improved while the network life time could be decreased by the rapid energy dissipation around the fixed sink because of the concentrated network traffic from sensor nodes to the fixed sink in wireless sensor network. To address this problem, mobile sinks, which decentralize the network traffic, has received a lot of attention from many researchers recently. Since a mobile sink has a limited period to communicate with each sensor nodes, it is necessary for a scheduling algorithm to provide the fairness of data collection from each sensor nodes. In the paper, we propose the new scheduling algorithm, ASF(Availability based Scheduling scheme for Fair data collection), for the fair data collection by a mobile in the sensor networks. The ASF takes account of the distance between each sensor nodes and the mobile sink as scheduling metric, as well as the amount of collected data from each sensor nodes. Experiment results shows that the ASF improves the fairness of data collection among the sensor nodes, comparing to existing algorithm.
A Degraded Quality Service Policy for reducing the transcoding loads in a Transcoding Proxy
Park, Yoo-Hyun ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 181~188
DOI : 10.3745/KIPSTA.2009.16-A.3.181
Transcoding is one of core techniques that implement VoD services according to QoS. But it consumes a lot of CPU resource. A transcoding proxy transcodes multimedia objects to meet requirements of various mobile devices and caches them to reuse later. In this paper, we propose a service policy that reduces the load of transcoding multimedia objects by degrading QoS in a transcoding proxy. Due to the tradeoff between QoS and the load of a proxy system, a transcoding proxy provides lower QoS than a client`s requirement so that it can accomodate more clients.
Priority- and Budget-Based Protocol Processing Using The Bottom-Half Mechanism for End-to-End QoS Support
Kim, Ji-Min ; Ryu, Min-Soo ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 189~198
DOI : 10.3745/KIPSTA.2009.16-A.3.189
The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.
Embedded System Integrated Prototyping Mechanism Based on Reusable Component
Sukmana, Husni Teja ; Lee, Jeong-Bae ; Rim, Kee-Wook ; Hwang, Young-Sup ; Kim, Young-Jin ; Ahn, Sung-Soon ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 199~208
DOI : 10.3745/KIPSTA.2009.16-A.3.199
Recently, there are many embedded system prototyping tools for helping embedded system designers to trial their product before it releases to the market. A prototype is very important for early embedded system design to grasp the desire functions, to get a good performance, to create delightful user interface, and to increase the valuable of the product. Prototyping tools can be classified by three categories: Physical, Virtual and Modeling prototyping. The integration of these prototyping tools becomes valuable for speed up time-to-market and for decrease design cost when design embedded system. The problem comes up because these tools sometime do not provide an instrument for communicating each other. In this paper, we propose a flexible and reusable mechanism for integrate these tools base on JavaBeans and ActiveX technology. We show how this mechanism can be employed in various prototyping tools.
Real-Time Human Tracker Based on Location and Motion Recognition of User for Smart Home
Choi, Jong-Hwa ; Park, Se-Young ; Shin, Dong-Kyoo ; Shin, Dong-Il ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 209~216
DOI : 10.3745/KIPSTA.2009.16-A.3.209
The ubiquitous smart home is the home of the future that takes advantage of context information from the human and the home environment and provides an automatic home service for the human. Human location and motion are the most important contexts in the ubiquitous smart home. We present a real-time human tracker that predicts human location and motion for the ubiquitous smart home. We used four network cameras for real-time human tracking. This paper explains the real-time human tracker`s architecture, and presents an algorithm with the details of two functions (prediction of human location and motion) in the real-time human tracker. The human location uses three kinds of background images (IMAGE1: empty room image, IMAGE2: image with furniture and home appliances in the home, IMAGE3: image with IMAGE2 and the human). The real-time human tracker decides whether the human is included with which furniture (or home appliance) through an analysis of three images, and predicts human motion using a support vector machine. A performance experiment of the human`s location, which uses three images, took an average of 0.037 seconds. The SVM`s feature of human`s motion recognition is decided from pixel number by array line of the moving object. We evaluated each motion 1000 times. The average accuracy of all the motions was found to be 86.5%.
A Double-Ended Priority Queue with O(1) Insertion Amortized Time
Jung, Hae-Jae ;
The KIPS Transactions:PartA, volume 16A, issue 3, 2009, Pages 217~222
DOI : 10.3745/KIPSTA.2009.16-A.3.217
Priority queues can be used in applications such as scheduling, sorting, retrival based on a priority like gene searching, shortest paths computation. This paper proposes a data structure using array representation for double-ended priority queue in which insertion and deletion takes O(1) amortized time and O(logn) time, respectively. To the author`s knowledge, all the published array-based data structures for double ended priority queue support O(logn) time insertion and deletion operations.