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 14A, Issue 7 - Dec 2007
Volume 14A, Issue 6 - Dec 2007
Volume 14A, Issue 5 - Oct 2007
Volume 14A, Issue 4 - Aug 2007
Volume 14A, Issue 3 - Jun 2007
Volume 14A, Issue 2 - Apr 2007
Volume 14A, Issue 1 - Feb 2007
Selecting the target year
MIPI CSI-2 & D-PHY Camera Controller Design for Future Mobile Platform
Hyun, Eu-Gin ; Kwon, Soon ; Jung, Woo-Young ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 391~398
DOI : 10.3745/KIPSTA.2007.14-A.7.391
In this paper, we design a future mobile camera standard interface based on the MIPI CSI-2 and D-PHY specification. The proposed CSI-2 have the efficient multi-lane management layer, which the independent buffer on the each lane are merged into single buffer. This scheme can flexibly manage data on multi lanes though the number of supported lanes are mismatched in a camera processor transmitter and a host processor. The proposed CSI-2 & D-PHY are verified under test bench. We make an experiment on CSI-2 & D-PHY with FPGA type test-bed and implement them onto a mobile handset. The proposed CSI-2 & D-PHY module are used as both the bridge type and the future camera processor IP for SoC.
Development of Ubiquitous Sensor Network Applications based on Software Product Line Approach
Kim, Young-Hee ; Lee, Woo-Jin ; Choi, Il-Woo ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 399~408
DOI : 10.3745/KIPSTA.2007.14-A.7.399
Currently various techniques for efficiently developing sensor network applications are developed. However, these techniques provide the method for developing only single sensor network application easily and rapidly. Since sensor network applications control various sensor nodes based on core components of operating system, the technique to develop applications by defining common functionalities of various applications and selecting variable functionalities according to the work flow of specific application is efficient. Accordingly, this paper presents an experimental study that identifies commonality of sensor network application domain and supports optional development according to the variability of application by applying product line approach to developing sensor network application. Through the experimental study, we describe the characteristics of sensor network application domain compared with general business domain for product line development. Also, we show the effectiveness of the proposed approach by presenting that core assets designed using the proposed variability feature model and VEADL are reused according to the functionalities of each sensor node.
A Framework for Dynamic Growing of Web Service Applications based on ESB and Agent
Lee, Chang-Ho ; Kim, Jin-Han ; Lee, Jae-Jeong ; Lee, Byung-Jeong ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 409~420
DOI : 10.3745/KIPSTA.2007.14-A.7.409
Software adaptation may be required to interact between heterogeneous platforms and to react to rapid change of environment in ubiquitous computing. Web service provides a way to use heterogeneous and distributed services or resources to utilize and organize them. But it is not easy to retrieve appropriate services when we search services because web service lacks of semantic information. Semantic web service provides additional information of services, but it does not support a method to match them in various ways. We can adapt and extend web applications by using web service, but a method for management and administration is still needed. Therefore in this paper, we propose a framework for dynamic growing of web service applications based on ESB(Enterprise Service Bus) and agent and provide a prototype to show its usefulness.
Synthesis of Ocean Wave Models and Simulation Using GPU
Lee, Dong-Min ; Lee, Sung-Kee ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 421~434
DOI : 10.3745/KIPSTA.2007.14-A.7.421
Among many other CG generated natural scenes, the representation of ocean surfaces is one of the most complicated and time-consuming problem because of its large extent and complex surface movement. We present a hybrid method to represent and animate unbound deep-water ocean surfaces by utilizing graphics processor as both simulation and rendering core. Our technique is mainly based on spectral approaches that generate a high-detailed height field using Fourier transform on a 2D regular grid. Additionally, we incorporate Gerstner model and generate low-detailed height field on a 2D projected grid in order to represent large waves and main structure of ocean surface. There is no interruption between CPU and GPU, and no need to transfer simulation results from the system memory to graphics hardware because the entire simulation and rending processes are done on graphics processor. As a result we can synthesize and render realistic water surfaces in real-time. Proposed techniques are readily adoptable to real-time applications such as computer games that have heavy work load on CPU but still demand plausible natural scenes.
A Mesh Segmentation Reflecting Global and Local Geometric Characteristics
Im, Jeong-Hun ; Park, Young-Jin ; Seong, Dong-Ook ; Ha, Jong-Sung ; Yoo, Kwan-Hee ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 435~442
DOI : 10.3745/KIPSTA.2007.14-A.7.435
This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the
number of clusters by adopting the
-means clustering method  based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.
A Dynamic Hashing Based Load Balancing for a Scalable Wireless Internet Proxy Server Cluster
Kwak, Hu-Keun ; Kim, Dong-Seung ; Chung, Kyu-Sik ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 443~450
DOI : 10.3745/KIPSTA.2007.14-A.7.443
Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.
A Fair Scheduling of Heterogeneous Multi-Server Systems by Cumulative Extra Capacity Sharing
Park, Kyeong-Ho ; Hwang, Ho-Young ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 451~456
DOI : 10.3745/KIPSTA.2007.14-A.7.451
In this paper, we regard computer systems as heterogeneous multi-server systems and propose a cumulative fair scheduling scheme that pursues long-term fairness. GPS(generalized processor sharing)-based scheduling algorithms, which are usually employed in single-server systems, distribute available capacity in an instantaneous manner. However, applying them to heterogeneous multi-server systems may cause unfairness, since they may not prevent the accumulation of scheduling delays and the extra capacities are distributed in an instantaneous manner. In our scheme, long-term fairness is pursued by proper distribution of extra capacities while guaranteeing reserved capacities. A reference capacity model to determine the ideal progresses of applications is derived from long-term observations, and the scheduler makes the applications gradually follow the ideal progresses while guaranteeing their reserved capacities. A heuristic scheduling algorithm is proposed and the scheme is examined by simulation.
Operational Semantics for Instruction List with Functions
Shin, Seung-Cheol ; Rho, Sang-Hoon ;
The KIPS Transactions:PartA, volume 14A, issue 7, 2007, Pages 457~466
DOI : 10.3745/KIPSTA.2007.14-A.7.457
IEC61131-3 is the standard of control languages in which special purpose controllers and motion controllers such as PLC can be programmed. IL(Instruction List), one of the standard languages, is in assembly level but has some high-level features. This paper describes a formal semantics of IL in operational style. Previous works on IL semantics do not include functions and function blocks, which is not so practical. We define IL semantics including functions and function blocks.