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 18A, Issue 6 - Dec 2011
Volume 18A, Issue 5 - Oct 2011
Volume 18A, Issue 4 - Aug 2011
Volume 18A, Issue 3 - Jun 2011
Volume 18A, Issue 2 - Apr 2011
Volume 18A, Issue 1 - Feb 2011
Selecting the target year
Development of Curriculum Using ROBOTC-based LEGO MINDSTORMS NXT and Analysis of Its Educational Effects
Lee, Kyung-Hee ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 165~176
DOI : 10.3745/KIPSTA.2011.18A.5.165
In this paper, we show how a curriculum using LEGO MINDSTORMS NXT robot based ROBOTC for undergraduate students has been developed, and we analyze the educational effect of the curriculum. The curriculum is composed of basic knowledge learning, practice with basic robots, practice with advanced robots, and creative design and implementation of robots. During the three year period since 2009, educational achievement has been analyzed by surveys for 6 classes, 94 students. According to the analysis, the curriculum has highly motivated the students and made them to achieve effectively our educational and academic goals. Also, we observe that the curriculum helped the students to improve their creativity and the problem solving skill, and that the students were autonomously and deeply involved in the homework and the term projects, which made them be very cooperative. Finally, the intensive practice with ROBOTC programming is shown to help students to improve their programming ability of C language.
An Efficient Record-Replay Mechanism using Hardware Performance Counters and Debugging Facilities
Maeng, Ji-Chan ; Ryu, Min-Soo ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 177~180
DOI : 10.3745/KIPSTA.2011.18A.5.177
In this paper, we present a record-replay technique based on interrupt logging and reproduction. Race conditions have been considered as the main source of nondeterminism in conventional record-replay approaches. However, interrupts are another source of nondeterministic computer system behavior, which must be reproduced at accurate time points, let alone the order of interrupt occurrence. We show that an interrupt-based replayer can be efficiently and effectively implemented by using hardware performance counters and debugging functionality. Experiments also show that the runtime overhead of the interrupt-based replayer is sufficiently low.
A Publish Subscribe Information Exchange Model and A Novel Matching Algorithm for Navy Shipboard Systems
Kim, Hong-Jae ; Oh, Sang-Yoon ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 181~192
DOI : 10.3745/KIPSTA.2011.18A.5.181
Information superiority is an essential factor in modern warfare and it can be archived by efficient information exchange between systems. Various computing systems are installed on the today's navy vessels. However, it is hard to improve interoperability and efficiency of information exchange since the configurations of installed systems are varying. The military standard and commercial standard are mix-used between systems. In this paper, we propose an information exchange architecture based on Pub/Sub model as a communication middleware to improve interoperability as well as enhancing scalability. We also propose a novel tree matching algorithm to improve a performance of PubSub broker. In the proposed algorithm, each tree nodes have information about predicates of subscription that can reduce event matching time. The performance evaluation results show our proposed algorithm reduces time for matching predicates compare with other algorithms.
Implementation of a Static Analyzer for Detecting the PHP File Inclusion Vulnerabilities
Ahn, Joon-Seon ; Lim, Seong-Chae ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 193~204
DOI : 10.3745/KIPSTA.2011.18A.5.193
Since web applications are accessed by anonymous users via web, more security risks are imposed on those applications. In particular, because security vulnerabilities caused by insecure source codes cannot be properly handled by the system-level security system such as the intrusion detection system, it is necessary to eliminate such problems in advance. In this paper, to enhance the security of web applications, we develop a static analyzer for detecting the well-known security vulnerability of PHP file inclusion vulnerability. Using a semantic based static analysis, our vulnerability analyzer guarantees the soundness of the vulnerability detection and imposes no runtime overhead, differently from the other approaches such as the penetration test method and the application firewall method. For this end, our analyzer adopts abstract interpretation framework and uses an abstract analysis domain designed for the detection of the target vulnerability in PHP programs. Thus, our analyzer can efficiently analyze complicated data-flow relations in PHP programs caused by extensive usage of string data. The analysis results can be browsed using a JAVA GUI tool and the memory states and variable values at vulnerable program points can also be checked. To show the correctness and practicability of our analyzer, we analyzed the source codes of open PHP applications using the analyzer. Our experimental results show that our analyzer has practical performance in analysis capability and execution time.
Twisted Cube Torus(TT): A New Class of Torus Interconnection Networks Based on 3-Dimensional Twisted Cube
Kim, Jong-Seok ; Lee, Hyeong-Ok ; Kim, Sung-Won ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 205~214
DOI : 10.3745/KIPSTA.2011.18A.5.205
We propose a new interconnection network, called Twisted cube torus(TT) network based on well-known 3-dimensional twisted cube. Twisted cube torus network has smaller diameter and improved network cost than honeycomb torus with the same number of nodes. In this paper, we propose routing algorithm of Twisted cube torus network and analyze its diameter, network cost, bisection width and hamiltonian cycle.
Efficient Connection of Migration Routes with Their Weights Using EGOSST
Kim, In-Bum ;
The KIPS Transactions:PartA, volume 18A, issue 5, 2011, Pages 215~224
DOI : 10.3745/KIPSTA.2011.18A.5.215
In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.