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 9A, Issue 4 - Dec 2002
Volume 9A, Issue 3 - Sep 2002
Volume 9A, Issue 2 - Jun 2002
Volume 9A, Issue 1 - Mar 2002
Volume 9, Issue 4 - 00 2002
Volume 9, Issue 3 - 00 2002
Volume 9, Issue 2 - 00 2002
Volume 9, Issue 1 - 00 2002
Selecting the target year
Design of Multiple-Valued Logic Circuits on Reed-Muller Expansions Using Perfect Shuffle
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 271~271
In this paper, the input-output interconnection method of the multiple-valued signal processing circuit using Perfect Shuffle technique and Kronecker product is discussed. Using this method, the circuit design method of the multiple-valued Reed-Muller Expansions (MRME) which can process the multiple-valued signal easily on finite fields
is presented. The proposed input-output interconnection methods show that the matrix transform is an efficient and the structures are modular. The circuits of multiple-valued signal processing of MRME on
design the basic cells to implement the transform and inverse transform matrix of MRME by using two basic gates on GF(3) and interconnect these cells by the input-output interconnection technique of the multiple-valued signal processing circuits. The proposed multiple-valued signal processing circuits that are simple and regular for wire routing and possess the properties of concurrency and modularity are suitable for VLSI.
Implementation of a LSB-First Digit-Serial Multiplier for Finite Fields
김창훈 ; 홍춘표 ; 우종정 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 281~281
In this paper we, implement LSB-first digit-serial systolic multiplier for computing modular multiplication A（x）B（x）mod G （x） in finite fields
. If input data come in continuously, the implemented multiplier can produce multiplication results at a rate of one every [m/L] clock cycles, where L is the selected digit size. The analysis results show that the proposed architecture leads to a reduction of computational delay time and it has more simple structure than existing digit-serial systolic multiplier. Furthermore, since the propose architecture has the features of regularity, modularity, and unidirectional data flow, it shows good extension characteristics with respect to m and L.
Dynamic Bitmap for Huge File System
김경배 ; 이용주 ; 박춘서 ; 신범주 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 287~287
In this paper we propose a new mechanism for file system using a dynamic bitmap assignment. While traditional file systems rely on a fixed bitmap structures for metadata such as super block, inode, and directory entries, the proposed file system allocates bitmap and allocation area depends on file system features. Our approach gives a solution of the problem that the utilization of the file system depends on the file size in the traditional file systems. We show that the proposed mechanism is superior in the efficiency of disk usage compared to the traditional mechanisms.
Performance Analysis of Turbo-Code with Random (and s-random) Interleaver based on 3-Dimension Algorithm
공형윤 ; 최지웅 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 295~295
In this paper, we apply the 3-dimension algorithm to the random interleaver and s-random interleaver and analyze the performance of the turbo code system with random interleaver (or s-random interleaver). In general, the performance of interleaver is determined by minimum distance between neighbor data, thus we could improve the performance of interleaver by increasing the distance of the nearest data. The interleaver using 3-dimension algorithm has longer minimum distance and average distance compared to existing random-interleaver (s-random interleaver) because the output data is generated randomly from 3-dimension storage. To verify and compare the performance of our proposed system, the computer simulations have been performed in turbo code system under gaussian noise environment.
Automated Selection System of Examination Questions in Web-Based Instruction
김경아 ; 최은만 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 301~301
Internet has been applied to the educational field such as data search, lecture by motion picture, realtime examination. Most questions made for these remote examinations use methods of making questions randomly using fixed questions or item pools. The designed system in this paper makes questions without knowing MARK-UP language and after undergoing examinations on Web. Also it readjusts degree of difficulty automatically on the basis of the rate of correct answers. In addition, this enables learners to perform feedback learning after examinations and subsequently learners themselves to adjust their degree of difficulty and undergo reexaminations. The automatic selection system makes it easy to select questions, possible to expect average marks and number of questions made, and to prevent that questions may be made too easy or too hard. For a remote examination, as there are much possibilities of dishonesty such as examination by proxy so different types of problems are made, and problems of the rationality caused from that can be avoided.
Hyper-Text Compression Method Based on LZW Dictionary Entry Management
신광철 ; 한상용 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 311~311
LZW is a popular variant of LZ78 to compress text documents. LZW yields a high compression rate and is widely used by many commercial programs. Its core idea is to assign most probably used character group an entry in a dictionary. If a group of character which is already positioned in a dictionary appears in the streaming data, then an index of a dictionary is replaced in the position of character group. In this paper, we propose a new efficient method to find least used entries in a dictionary using counter. We also achieve higher compression rate by preassigning widely used tags in hyper-text documents. Experimental results show that the proposed method is more effective than V.42bis and Unix compression method. It gives 3∼8％ better in the standard Calgary Corpus and 23∼24％ better in HTML documents.
Simulation and Analysis of Base Station Buffer in UMTS Systems
김남기 ; 박인용 ; 정혜영 ; 윤현수 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 317~317
The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS system, has to support the packet data service and it will play the major role in the system. In different from the voice service, the packet data service should store packet data in a buffer at base station before it forwards. Consequently, the performance closely related to the buffer management and its operation. However, until now, there are rare study on the buffer behavior and management. In this paper, we will observe the buffer behavior in the UMTS systems by using simulation and analyze the results. For this research, we generate packet data traffics and model the UMTS system for a simulation. Then we analyze the buffer state by a simulation and calculate the buffer overflow probability by mathematical methods.
Development of a Kernel Thread Web Accelerator (SCALA-AX)
박종규 ; 민병조 ; 임한나 ; 박장훈 ; 장휘 ; 김학배 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 327~327
Conventional proxy web cache, which is generally used to caching server, is a content-copy based system. This method focuses on speeding up the phase delivery not improving the webserver performance. However, if immense clients attempt to connect the webserver simultaneously, the proxy web cache cannot achieve the desired result. In this paper, we propose the web accelerator called the SCALA-AX, whitch improves web server performance by accelerating the delivery contents. The SCALA-AX is built in the Linux-based kernel as a kernel modulo and works in combination with the conventional webserver program. The SCALA-AX speeds up the processing rate of the webserver, because it processes the requests using the kernel thread. The SCALA-AX also applies the well-developed cache algorithm to the processing, and thus it obtains the advantage of the caching server without installing additional hardware. A banchmarking test demonstrates that the SCALA-AX improves webserver performance by up to 500％ for content delivery.
The Fault Tolerance of Interconnection Network HCN(n, n) and Embedding between HCN(n, n) and HFN(n, n)
이형옥 ; 김종석 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 333~333
Embedding is a mapping an interconnection network G to another interconnection network H. If a network G can be embedded to another network H, algorithms developed on G can be simulated on H. In this paper, we first propose a method to embed between Hierarchical Cubic Network HCN(n, n) and Hierarchical Folded-hypercube Network HFN(n, n). HCN(n, n) and HFN(n, n) are graph topologies having desirable properties of hypercube while improving the network cost, defined as degree ×diameter, of Hypercube. We prove that HCN(n, n) can be embedded into HFN(n, n) with dilation 3 and congestion 2, and the average dilation is less than 2. HFN(n, n) can be embedded into HCN(n, n) with dilation 0 (n), but the average dilation is less than 2. Finally, we analyze the fault tolerance of HCN(n, n) and prove that HCN(n, n) is maximally fault tolerant.
A Fast Transmission of Mobile Agents Using Binomial Trees
조수현 ; 김영학 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 341~341
As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM′s Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.
Automatic STG Derivation with Consideration of Special Properties of STG-Based Asynchronous Logic Synthesis
김의석 ; 이정근 ; 이동익 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 351~351
Along with an asynchronous finite state machine, in short AFSM, a signal transition graph, in short STG, is one of the most widely used behavioral description languages for asynchronous controllers. Unfortunately, STGs are not user-friendly, and thus it is very unwieldy and time consuming for system designers to conceive and describe manually the behaviors of a number of asynchronous controllers which constitute an asynchronous control unit for a target system in the form of STGs. In this paper, we suggest an automatic STG derivation method through a process-oriented method. Since the suggested method considers special properties of STG-based asynchronous logic synthesis very carefully, asynchronous controllers which are synthesized from STGs derived through the suggested method are superior in aspects of area, synthesis time, performance and implementability compared to those obtained through previous methods.
Decision of the Node Decomposition Type for the Minimization of OPKFDDs
정미경 ; 황민 ; 이귀상 ; 김영철 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 363~363
OPKFDD (Ordered Pseudo-Kronecker Functional Decision Diagram) is one of ordered-DDs (Decision Diagrams) in which each node can take one of three decomposition types : Shannon, positive Davio and negative Davio decompositions. Whereas OBDD (Ordered Binary Decision Diagram) uses only the Shannon decomposition in each node, OPKFDD uses the three decompositions and generates representations of functions with smaller number of nodes than other DDs. However, this leads to the extreme difficulty of getting an optimal solution for the minimization of OPKFDD. Since an appropriate decomposition type has to be chosen for each node, the size of the representation is decided by the selection of the decomposition type. We propose a heuristic method to generate OPKFDD efficiently from the OBDD of the given function and the algorithm of the decision of decomposition type for a given variable ordering. Experimental results demonstrate the performance of the algorithm.
The Enhanced Analysis Algorithm for an EMFG’s Operation
김희정 ; 여정모 ; 서경룡 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 371~371
The EMFG (Extended Mark Flow Graph) is known as a graph model for representing the discrete event systems. In this paper, we introduce input/output matrixes representing the marking variance of input/output boxes when each transition fires in an EMFG, and compute an incidence matrix. We represent firing conditions of transitions to a firing condition matrix for computing a firable vector, and introduce the firing completion vector to decide completion of each transition’s firing. By using them, we improve an analysis algorithm of the EMFG’s operation to be represented all the process of EMFG’s operation mathematically. We apply the proposed algorithm to the system repeating the forward and reverse revolution, and then confirm that it is valid. The proposed algorithm is useful to analysis the variant discrete event systems.
A Scheduling Approach using Gradual Mobility Reduction for Synthesizing Pipelined Datapaths
유희진 ; 오주영 ; 이준용 ; 박도순 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 379~379
This paper presents a scheduling approach for synthesizing pipelined datapaths under resource constraints. Our approach builds up a schedule based on gradual mobility reduction in contrast to other algorithms of previous researches, where an operation being scheduled is selected by using a priority function. The proposed method consists of a scheduling algorithm and a decision algorithm for detecting any violation against resource constraints. Our approach evaluates whether or not a scheduling solution can exist in case an operation temporarily is assigned to the earliest or latest control step among the assignable steps for the operation. If a solution cannot be found, it is impossible to assign the operation to that step due to a violation against resource constraints, and so we can eliminate that control step. This process is iterated until a reduction of mobility for all operations can not be obtained. Experiments on benchmarks show that this approach gains a considerable improvement over those by previous approaches.
Development of Workbench for Analysis and Visualization of Whole Genome Sequence
최정현 ; 진희정 ; 김철민 ; 장철훈 ; 조환규 ;
The KIPS Transactions:PartA, volume 9, issue 3, 2002, Pages 387~387
As whole genome sequences of many organisms have been revealed by small-scale genome projects, the intensive research on individual genes and their functions has been performed. However on-memory algorithms are inefficient to analysis of whole genome sequences, since the size of individual whole genome is from several million base pairs to hundreds billion base pairs. In order to effectively manipulate the huge sequence data, it is necessary to use the indexed data structure for external memory. In this paper, we introduce a workbench system for analysis and visualization of whole genome sequence using string B-tree that is suitable for analysis of huge data. This system consists of two parts : analysis query part and visualization part. Query system supports various transactions such as sequence search, k-occurrence, and k-mer analysis. Visualization system helps biological scientist to easily understand whole structure and specificity by many kinds of visualization such as whole genome sequence, annotation, CGR (Chaos Game Representation), k-mer, and RWP (Random Walk Plot). One can find the relations among organisms, predict the genes in a genome, and research on the function of junk DNA using our workbench.