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 10A, Issue 6 - Dec 2003
Volume 10A, Issue 5 - Oct 2003
Volume 10A, Issue 4 - Oct 2003
Volume 10A, Issue 3 - Aug 2003
Volume 10A, Issue 2 - Jun 2003
Volume 10A, Issue 1 - Mar 2003
Volume 10, Issue 6 - 00 2003
Volume 10, Issue 4 - 00 2003
Volume 10, Issue 3 - 00 2003
Volume 10, Issue 2 - 00 2003
Volume 10, Issue 1 - 00 2003
Selecting the target year
Efficient Architecture of an n-bit Radix-4 Modular Multiplier in Systolic Array Structure
박태근 ; 조광원 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 279~279
In this paper, we propose an efficient architecture for radix-4 modular multiplication in systolic array structure based on the Montgomery's algorithm. We propose a radix-4 modular multiplication algorithm to reduce the number of iterations, so that it takes (3/2)n+2 clock cycles to complete an n-bit modular multiplication. Since we can interleave two consecutive modular multiplications for 100% hardware utilization and can start the next multiplication at the earliest possible moment, it takes about only n/2 clock cycles to complete one modular multiplication in the average. The proposed architecture is quite regular and scalable due to the systolic array structure so that it fits in a VLSI implementation. Compared to conventional approaches, the proposed architecture shows shorter period to complete a modular multiplication while requiring relatively less hardware resources.
Performance Evaluation of Request Scheduling Techniques in the Linux Cluster Web Server
이규한 ; 이종우 ; 이재원 ; 김성동 ; 채진석 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 285~285
The request scheduling algorithms being used for the cluster web servers are mostly in two categories : load-balancing and contents-based cache affinity The goal of the load-balancing algorithms is to balance the loads between real servers. On the other hand, contents-based scheduling algorithm exploits the cache affinity in a way that the same type of requests are to be directed to a dedicated real server allowing load imbalance. So the performance comparison of the two algorithms is necessary, nevertheless the related experiment results are not much suggested. In this paper, performance evaluations have been done to compare the performance of the two scheduling algorithms. To accomplish this, we first implement a linux cluster web server, and then present the performance measurement results. The main contribution of this paper is to help the cluster web server administrators to select an algorithm fitting in with their circumstances from the two algorithms.
ART : An Implementation on the Active_object RunTime Systems Applicable for the Embedded Systems
박윤용 ; 임동선 ; 정부금 ; 이경오 ; 박정호 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 295~295
Active object is an Independent runnable unit which is scheduled by CPU in creation time. In this paper, we define the active object and suggest ART(Active object RunTime support systems) which controls creation and execution of the active object. ART can Provide users locational transparency and support easy method call mechanism. We also designed a communication model among active objects and implemented a communication method to make the distributed programing possible. The implementation target platform of ART is an embedded system which has only limited resources and runs in the distributed computing environment.
Design and Implementation of a Remote Debugger for Concurrent Debugging of Multiple Processes based on Embeded Linux System
심현철 ; 강용혁 ; 엄영익 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 305~305
In the embedded Linux environments, developers can concurrently debug multiple processes that have parent-child relationships using multiple gdbs and gdbservers. But, it needs additional coding efforts and messy works of activating another gdbs and gdbservers for each created process, and so, it may be inefficient in the viewpoint of developers. In this paper, we propose a mgdb library and mgdbserver that supports concurrent debugging of multiple processes in the embedded Linux systems by using the library wrapping mechanism without modifying the kernel. Also, through the experimentation of concurrent debugging for multiple processes that communicate by an unnamed pipe, we show that our proposed debugging mechanism is more efficient than the preexisting mechanisms.
A synchronized mobile agent in Distributed Database Environments
국윤규 ; 김운용 ; 정계동 ; 김영철 ; 최영근 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 313~313
This paper design and implements a synchronized agent mechanism that be able to synchronize SFT (Slow Frequency Transaction) data among e-business processes in distributed environment. This synchronized agent system is adopted to use mobile agent to guarantee the interoperability of the distributed processes and to solve some problems at the client/server architecture and proposes a policy to synchronize data of e-business processes on the any platforms of distributed heterogeneous systems. The proposed synchronization policy is based on the time-stamp transaction with the system priority on the unicasting transportation.
Fuzzy Set Based Agent System for Adaptive Tutoring
최숙영 ; 양형정 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 321~321
This paper proposes an agent-based adaptive tutoring system that monitors learning process of learners' and provides learning materials dynamically according to the analyzed learning character. Furthermore, it uses fuzzy concept to evaluate learners' ability and to provide learning materials appropriate to the level of learners'. For this, we design a courseware knowledge structure systematically and then construct a fuzzy level set on the basis of it considering importance of learning targets, difficulty of learning materials and relation degree between learning targets and learning materials. Using agent, monitoring continually the learning process of learners 'inferencing to offer proper hints in case of incorrect answer in learning assesment, composing dynamically learning materials according to the learning feature and the evaluation of assesment, our system implements effectively adaptive instruction system. Moreover, appling the fuzzy concept to the system could naturally consider and ideal with various and uncertain items of learning environment thus could offer more flexible and effective instruction-learning methods.
Adapted GSS Load Sharing Algorithm for Heterogeneous Cluster
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 331~331
Cluster is the cost-effective parallel processing environment, and consists of the off-the-shelf computers connected by the computer net works. The characteristics of cluster are the node heterogeneity, the variety of node load, and the variety of network load. Because these characteristics influence the performance of parallel program executions, the load sharing for cluster is important, and by using the proper load sharing strategy, we can reduce the execution time of parallel programs. In this paper, we propose modified GSS algorithm, αGSS. In the proposed load sharing algorithms α GSS, the size of tasks are decided using the BogoMIPS of node. From the result of out experiments, we conclude that the proposed αGSS algorithm is effective in the heterogeneous cluster.
Application of Multi-Resolution Modeling in Collaborative Design
김태성 ; 한정현 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 339~339
This paper provides a framework for information assurance within collaborative design, based on a technique we call role-based viewing. Such role-based viewing is achieved through integration of multi-resolution geometry and security models. 3D models are geometrically partitioned, and the partitioning is used to create multi-resolution mesh hierarchies. Extracting a model suitable for access rights for individual designers within a collaborative design environment Is driven by an elaborate access control mechanism.
Design of 1-D DCT processor using a new efficient computation sharing multiplier
이태욱 ; 조상복 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 347~347
The DCT algorithm needs efficient hardware architecture to compute inner product. The conventional methods have large hardware complexity. Because of this reason. a computation sharing multiplier was proposed for implementing inner product. However, the existing multiplier has inefficient hardware architecture in precomputer and select units. Therefore it degrades the performance of the multiplier. In this paper, we proposed a new efficient computation sharing multiplier and applied it to implementation of 1-D DCT processor. The comparison results show that the new multiplier is more efficient than an old one when hardware architectures and logic synthesis results were compared. The designed 1-D DCT processor by using the proposed multiplier is more high performance than typical design methods.
Evaluation of shape similarity for 3D models
김정식 ; 최수미 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 357~357
Evaluation of shape similarity for 3D models is essential in many areas -medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.
A Study of Ant Colony System Design for Multicast Routing
이성근 ; 한치근 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 369~369
Ant Algorithm is used to find the solution of Combinatorial Optimization Problems. Real ants are capable of finding the shortest path from a food source to their nest without using visual informations. This behavior of real ants has inspired ant algorithm. There are various versions of Ant Algorithm. Ant Colony System (ACS) is introduced lately. ACS is applied to the Traveling Salesman Problem (TSP) for verifying the availability of ACS and evaluating the performance of ACS. ACS find a good solution for TSP When ACS is applied to different Combinatorial Optimization Problems, ACS uses the same parameters and strategies that were used for TSP. In this paper, ACS is applied to the Multicast Routing Problem. This Problem is to find the paths from a source to all destination nodes. This definition differs from that of TSP and differs from finding paths which are the shortest paths from source node to each destination nodes. We introduce parameters and strategies of ACS for Multicasting Routing Problem.
A Design and Implementation of a Web-based Learning System for English Vocabulary
유혜진 ; 이미정 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 375~375
Although vocabulary is one of the most important aspects in learning English, it is not dealt with as extensively as the grammar and reading comprehension in the classes due to time limitation. Furthermore, it is also dealt with in only a limited way at most of the English learning web sites compared to the other aspects such as grammar and reading comprehension. In this study, a web-based learning system for English vocabulary which allows a student to study the vocabulary before or after the classes by herself in order to supplement the English classes provided at school. Especially, it allows the students to learn the vocabulary within the context of sentences. It also provides an efficient structure for a repeated study of vocabulary that is new or difficult to the student.
Performance Analysis of Call Arrival History-Based Location Update Algorithm
이종민 ; 권보섭 ; 맹승렬 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 381~381
Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.
Design and Implementation of an InfiniBand System Interconnect for High-Performance Cluster Systems
모상만 ; 박 경 ; 김성남 ; 김명준 ; 임기욱 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 389~389
InfiniBand technology is being accepted as the future system interconnect to serve as the high-end enterprise fabric for cluster computing. This paper presents the design and implementation of the InfiniBand system interconnect, focusing on an InfiniBand host channel adapter (HCA) based on dual ARM9 processor cores The HCA is an SoC tailed KinCA which connects a host node onto the InfiniBand network both in hardware and in software. Since the ARM9 processor core does not provide necessary features for multiprocessor configuration, novel inter-processor communication and interrupt mechanisms between the two processors were designed and embedded within the KinCA chip. Kinch was fabricated as a 564-pin enhanced BGA (Bail Grid Array) device using 0.18㎛ CMOS technology Mounted on host nodes, it provides 10 Gbps outbound and inbound channels for transmit and receive, respectively, resulting in a high-performance cluster system.
Analysis of the ROMizer of simpleRTJ Embedded Java Virtual Machine
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 397~397
Dedicated-purpose embedded Java system usually takes such model that all class files are converted into a single ROM Image by the ROMizer in the host computer, and then the Java virtual machine in the embedded system executes the image. Defining the ROM Image is a very important issue for embedded system with limited memory resource and low-performance processor since the format directly influences on the memory usage and effectiveness of accessing entries in classes. In this paper we have analyzed the ROMizer and especially the format of the ROM image implemented in the simpleRTJ embedded Jana virtual machine. The analysis says that memory space can be saved up to 50% compared to the original class file and access speed exceeds up to six times with the use of the ROMizer. The result of this study will be applied to develop a more efficient ROMizer for a ROM-based embedded Java system.
Implementation of an E-Book Exchange Server based on Open E-Book Fourm
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 405~405
In this paper, we have designed and implemented an E-Book Exchange System which is based on the Open E-Book Exchange protocol of Open E-book forum. The ebook is described digital contents composed of variable media and should require secured ebook server for copyright guarantee. Also, contents manufactures, circulation company, and user must access the ebook contents easily. So, Linux-based ebook server and reader can satisfy this requirements. Therefore, this research has developed Linux-based ebook server and reader which is cost-effective.
A Development Works of Post PC Platform Technology
박우출 ; 이상학 ; 조수형 ; 김대환 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 411~411
After the general and multi-function PC age is gone, A new type of computing devices is developing. The need of consumer increases a new device with very necessary function instead of all-mighty functional PC. The operating system of this works is linux because of open source licensing and a strong developer community. The Post PC industry represents and environment that will foster dramatic growth and new development. The adoption of embedded linux in this market will not be driven by simple replacement of expensive proprietary operating systems. In this paper we describe the practical design and implementation project of Post-PC Platform. We illustrate “the development of digital consumer Post-PC platform technology,” focus the fourth project, and describe the development works of this project.
A Study on Improvement of Contents Classification System in Wireless Internet
이명섭 ; 김병기 ;
The KIPS Transactions:PartA, volume 10, issue 4, 2003, Pages 419~419
Every CP has its own contents classification system for charging. Currently most classification system is based on the CPID and Service ID of the WAP. An service ID from a common CPID pool is provided to CP for each service. Then charges are computed for each service ID. But in this system CPID range must be changed whenever the CP adds a new service. Therefore all CPIDs of the existing services must be updated. Another problem is that when a CP provides several services, it has multiple CPIDS. Therefore with increasing number of services CPID would be exhausted in the future. In this paper, we proposes a new contents ,classification system. We remove CPID range and instead we propose a new CPID composed of a system n, service classification ID and a serial number. The new CPID is assigned to each service. By this scheme we improve the contents classification system.