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 15A, Issue 6 - Dec 2008
Volume 15A, Issue 5 - Oct 2008
Volume 15A, Issue 4 - Aug 2008
Volume 15A, Issue 3 - Jun 2008
Volume 15A, Issue 2 - Apr 2008
Volume 15A, Issue 1 - Feb 2008
Selecting the target year
A Real-time Single-Pass Visibility Culling Method Based on a 3D Graphics Accelerator Architecture
Choo, Catherine ; Choi, Moon-Hee ; Kim, Shin-Dug ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 1~8
DOI : 10.3745/KIPSTA.2008.15-A.1.1
An occlusion culling method, one of visibility culling methods, excludes invisible objects or triangles which are covered by other objects. As it reduces computation quantity, occlusion culling is an effective method to handle complex scenes in real-time. But an existing common occlusion culling method, such as hardware occlusion query method, sends objects' data twice to GPU and this causes processing overheads once for occlusion culling test and the other is for rendering. And another existing hardware occlusion culling method, VCBP, can test objects' visibility quickly, but it neither test bounding volume nor return test result to application stage. In this paper, we propose a single pass occlusion culling method which uses temporal and spatial coherency, with effective occlusion culling hardware architecture. In our approach, the hardware performs occlusion culling test rapidly with cache on the rasterization stage where triangles are transformed into fragments. At the same time, hardware sends each primitive's visibility information to application stage. As a result, the application stage reduces data transmission quantity by excluding covered objects using the visibility information on previous frame and hierarchical spatial tree. Our proposed method improved maximum 44%, minimum 14% compared with S&W method based on hardware occlusion query. And the performance is increased 25% and 17% respectively, compared to maximum and minimum performance of CHC method which is based on occlusion culling method.
Boolean Extraction Technique Using Two-cube Divisors and Complements
Kwon, Oh-Hyeong ; Oh, Im-Geol ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 9~16
DOI : 10.3745/KIPSTA.2008.15-A.1.9
This paper presents a new Boolean extraction technique for logic synthesis. This method extracts two-cube Boolean subexpression pairs from each logic expression. It begins by creating two-cube array, which is extended and compressed with complements of two-cube Boolean subexpressions. Next, the compressed two-cube array is analyzed to extract common subexpressions for several logic expressions. The method is greedy and extracts the best common subexpression. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.
An Efficient Cache Mechanism for Improving Response Times in Integrated RFID Middleware
Kim, Cheong-Ghil ; Lee, Jun-Hwan ; Park, Kyung-Lang ; Kim, Shin-Dug ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 17~26
DOI : 10.3745/KIPSTA.2008.15-A.1.17
This paper proposes an efficient caching mechanism appropriate for the integrated RFID middleware which can integrate wireless sensor networks (WSNs) and RFID (radio frequency identification) systems. The operating environment of the integrated RFID middleware is expected to face the situations of a significant amount of data reading from RFID readers, constant stream data input from large numbers of autonomous sensor nodes, and queries from various applications to history data sensed before and stored in distributed storages. Consequently, an efficient middleware layer equipping with caching mechanism is inevitably necessary for low latency of request-response while processing both data stream from sensor networks and history data from distributed database. For this purpose, the proposed caching mechanism includes two optimization methods to reduce the overhead of data processing in RFID middleware based on the classical cache implementation polices. One is data stream cache (DSC) and the other is history data cache (HDC), according to the structure of data request. We conduct a number of simulation experiments under different parameters and the results show that the proposed caching mechanism contributes considerably to fast request-response times.
Postorder Fibonacci Circulants
Kim, Yong-Seok ; Roo, Myung-Gi ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 27~34
DOI : 10.3745/KIPSTA.2008.15-A.1.27
In this paper, We propose a new parallel computer topology, called the Postorder Fibonacci Circulants and analyze its properties. It is compared with Fibonacci cubes, when its number of nodes is kept the same of comparable one. Its diameter is improved from n-2 to
and its topology is changed from asymmetric to symmetric. It includes Fibonacci cube as a spanning graph.
An Access Control System for Ubiquitous Computing based on Context Awareness
Lee, Ji-Yeon ; Ahn, Joon-Seon ; Doh, Kyung-Goo ; Chang, Byeong-Mo ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 35~44
DOI : 10.3745/KIPSTA.2008.15-A.1.35
It is important to manage access control for secure ubiquitous applications. In this paper, we present an access-control system for executing policy file which includes access control rules. We implemented Context-aware Access Control Manager(CACM) based on Java Context-Awareness Framework(JCAF) which provides infrastructure and API for creating context-aware applications. CACM controls accesses to method call based on the access control rules in the policy file. We also implemented a support tool to help programmers modify incorrect access control rules using static analysis information, and a simulator for simulating ubiquitous applications. We describe simulation results for several ubiquitous applications.
An Analysis Method for Detecting Vulnerability to Symbolic Link Exploit
Joo, Seong-Yong ; Ahn, Joon-Seon ; Jo, Jang-Wu ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 45~52
DOI : 10.3745/KIPSTA.2008.15-A.1.45
In this paper we define a vulnerable code to symbolic link exploit and propose a technique to detect this using program analysis. The existing methods to solve symbolic link exploit is for protecting it, on accessing a temporary file they should perform an investigation whether the file is attacked by symbolic link exploit. If programmers miss the investigation, the program may be revealed to symbolic link exploit. Because our technique detects all the vulnerable codes to symbolic link exploit, it helps programmers keep the program safety. Our technique add two type qualifiers to the existing type system to analyze vulnerable codes to symbolic link exploit, it detects the vulnerable codes using type checking including the added type qualifiers. Our technique detects all the vulnerable codes to symbolic link exploit automatically, it has the advantage of saving costs of modifying and of overviewing all codes because programmers apply the methods protecting symbolic link exploit to only the detected codes as vulnerable. We experiment our analyzer with widely used programs. In our experiments only a portion of all the function fopen() is analyzed as the vulnerabilities to symbolic link exploit. It shows that our technique is useful to diminish modifying codes.
Segment-based Cache Replacement Policy in Transcoding Proxy
Park, Yoo-Hyun ; Kim, Hag-Young ; Kim, Kyong-Sok ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 53~60
DOI : 10.3745/KIPSTA.2008.15-A.1.53
Streaming media has contributed to a significant amount of today's Internet Traffic. Like traditional web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple web objects, because the streaming media have features such as huge size and high bandwidth. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. The traditional proxy considers only a single version of the objects, whether they are to be cached or not. However the transcoding proxy has to evaluate the aggregate effect from caching multiple versions of the same object to determine an optimal set of cache objects. And recent researches about multimedia caching frequently store initial parts of videos on the proxy to reduce playback latency and archive better performance. Also lots of researches manage the contents with segments for efficient storage management. In this paper, we define the 9-events of transcoding proxy using 4-atomic events. According to these events, the transcoding proxy can define the next actions. Then, we also propose the segment-based caching policy for the transcoding proxy system. The performance results show that the proposing policy have a low delayed start time, high byte-hit ratio and less transcoding data.
A Detachable Full-HD Multi-Format Video Decoder: MPEG-2/MPEG-4/H.264, and VC-1
Bae, Jong-Woo ; Cho, Jin-Soo ;
The KIPS Transactions:PartA, volume 15A, issue 1, 2008, Pages 61~68
DOI : 10.3745/KIPSTA.2008.15-A.1.61
In this paper, we propose the VLSI design of Multi-Format Video Decoder (MFD) to support video codec standards such as MPEG-2, MPEG-4, H.264 and VC-1. The target of the proposed MFD is the Full HD (High Definition) video processing needed for the high-end D-TV SoC (System-on-Chip). The size of the design is reduced by sharing the common large-size resources such as the RISC processor and the on-chip memory among the different codecs. In addition, a detachable architecture is introduced in order to easily add or remove the codecs. The detachable architecture preserves the stability of the previously designed and verified codecs. The size of the design is about 2.4 M gates and the operating clock frequency is 225MHz in the Samsung 65nm process. The proposed MFD supports more than Full-HD (1080p@30fps) video decoding, and the largest number of video codec standards known so far.