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
Connected Korean Digit Speech Recognition Using Vowel String and Number of Syllables
Youn, Jeh-Seon ; Hong, Kwang-Seok ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 1~6
DOI : 10.3745/KIPSTA.2003.10A.1.001
In this paper, we present a new Korean connected digit recognition based on vowel string and number of syllables. There are two steps to reduce digit candidates. The first one is to determine the number and interval of digit. Once the number and interval of digit are determined, the second is to recognize the vowel string in the digit string. The digit candidates according to vowel string are recognized based on CV (consonant vowel), VCCV and VC unit HMM. The proposed method can cope effectively with the coarticulation effects and recognize the connected digit speech very well.
A Scheme of Resource Reallocation and Server Replication against DoS Attacks
Min, Byoung-Joon ; Kim, Sung-Ki ; Na, Yong-Hi ; Lee, Ho-Jae ; Choi, Joong-Sup ; Kim, Hong-Geun ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 7~14
DOI : 10.3745/KIPSTA.2003.10A.1.007
In order to cope with DoS (Denial of Service) attacks disturbing delivery of intended services by exhausting resources of computing nodes, we need a solution to recognize important resources for the essential services which have to be maintained under any circumstances and to adapt the system to the urgent situation and reconfigure itself properly. In this paper, we present a two-phase scheme to handle the problem. In the first phase, by means of dynamic resource reallocation within a computing node, we try to make the selected essential services survive even after the occurrence of an attack. For the second phase when it becomes impossible to continue the service in spite of the actions taken in the first phase, we apply server replication in order to continue the transparent provision of the essential services with the end users by utilizing redundant computing nodes previously arranged. Experimental result obtained on a testbed reveals the validity of the proposed scheme. A comparison with other proposed schemes has been conducted by analyzing the performance and the cost.
A Genetic-Based Optimization Model for Clustered Node Allocation System in a Distributed Environment
Park, Kyeong-mo ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 15~24
DOI : 10.3745/KIPSTA.2003.10A.1.015
In this paper, an optimization model for the clustered node allocation systems in the distributed computing environment is presented. In the presented model with a distributed file system framework, the dynamics of system behavior over times is carefully thought over the nodes and hence the functionality of the cluster monitor node to check the feasibility of the current set of clustered node allocation is given. The cluster monitor node of the node allocation system capable of distributing the parallel modules to clustered nodes provides a good allocation solution using Genetic Algorithms (GA). As a part of the experimental studies, the solution quality and computation time effects of varying GA experimental parameters, such as the encoding scheme, the genetic operators (crossover, mutations), the population size, and the number of node modules, and the comparative findings are presented.
Hybrid Channel Model in Parallel File System
Lee, Yoon-Young ; Hwangbo, Jun-Hyung ; Seo, Dae-Wha ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 25~34
DOI : 10.3745/KIPSTA.2003.10A.1.025
Parallel file system solves I/O bottleneck to store a file distributedly and read it parallel exchanging messages among computers that is connected multiple computers with high speed networks. However, they do not consider the message characteristics and performances are decreased. Accordingly, the current study proposes the Hybrid Channel model (HCM) as a message-management method, whereby the messages of a parallel file system are classified by a message characteristic between control messages and file data blocks, and the communication channel is divided into a message channel and data channel. The message channel then transfers the control messages through TCP/IP with reliability, while the data channel that is implemented by Virtual Interface Architecture (VIA) transfers the file data blocks at high speed. In tests, the proposed parallel file system that is implemented by HCM exhibited a considerably improved performance.
A Mobile Agent Tracking Using Distributed Event Service
Bang, Dae-Wook ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 35~42
DOI : 10.3745/KIPSTA.2003.10A.1.035
In this paper, we analyzed the known agent tracking models and proposed a new agent tracking model based on the distributed event service that always assures reliable tracking. Also we experimented the Performance of the event servers on the agent monitoring system that implements the distributed event service and showed their performance to decrement gracefully. The proposed tracking model doesn`t make only several clients trace a mobile agent which moves among agent servers autonomously, but also supports two types of agent tracking agent location tracking that notifies agent location to the clients and path establishment that maintains reliable connection between agent servers for message delivery.
Theoretical Performance Bounds and Parallelization of a Two-Dimensional Packing Algorithm
Hwang, In-Jae ; Hong, Dong-Kweon ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 43~48
DOI : 10.3745/KIPSTA.2003.10A.1.043
Two-dimensional packing algorithm can be used for allocating submeshes in mesh multiprocessor systems. Previously, we developed an efficient packing algorithm called TP heuristic, and showed how the results of the packing could be used for allocating submeshes. In this paper, we present theoretical performance bounds for TP heuristic. We also present a parallel version of the algorithm that consumes reduced time when it is executed by multiple processors in mesh multiprocessors.
A Dynamic Load Balancing Scheme Using Genetic Algorithm in Heterogeneous Distributed Systems
Lee, Dong-woo ; Lee, Seong-Hoon ; Hwang, Jong-Sun ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 49~58
DOI : 10.3745/KIPSTA.2003.10A.1.049
In a sender-initiated load balancing algorithm, a sender (overloaded processor) continues to send unnecessary request messages for load transfer until a receiver (underloaded processor) is found while the system load is heavy. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the sender receives an accept message from the receiver in this environment. This paper presents an approach based on genetic algorithm (GA) for dynamic load balancing in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.
Domain Selection Using Asymptotic Decider Criterion in Volume Modeling Based on Tetrahedrization
Lee, Kun ; Gwun, Ou-Bong ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 59~68
DOI : 10.3745/KIPSTA.2003.10A.1.059
3-D data modeling of a volumetric scattered data is highly demanded for geological structure inspection, environment visualization and supersonic testing. The data used in these area are generally irregularly scattered in a volume data space, which are much different from the structured points data (cuberille data) used in Marching cube algorithm. In this paper, first we explore a volume modeling method for the scattered data based on tetrahedral domain. Next we propose a method for solving the ambiguity of tetrahedral domain decision using asymptotic decider criterion. Last we implement a simple visualization system based on the proposed asymptotic decider criterion and compare it with a system based on sphere criterion. In deciding tetrahedral domain, sphere criterion considers only positional values but asymptotic decider criterion considers not only positional values but also functional values, so asymptotic decider criterion is more accurate on deciding tetrahedral domain than sphere criterion.
Web Based rSPC System Supporting XML Protocol
Oh, Kyoung-Je ; Han, Sang-Yong ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 69~74
DOI : 10.3745/KIPSTA.2003.10A.1.069
Accurate process control in the manufacturing industry is essential to survive in the competitive market. Statistical process control (SPC) system has been widely used to satisfy the ever-increasing quality control requirements. However, most commercial products in the market are not flexible, semi-automatic, and difficult to interface with other tools. In this paper, we propose an advanced rSPC (Real-Time SPC) system which is based on the web and supports XML protocol. We also provide a powerful graphic facility and an efficient file system to handle the data in real time. Even though the idea can be applied to any manufacturing system, our system is optimized to the semi-conductor industry and TFT/LCD industry. The system is implemented in C++ and COM/DCOM, and shows a good result.
Taxonomy of Procedural Abstraction and Polymorphism
Kim, Sung-Ki ;
The KIPS Transactions:PartA, volume 10A, issue 1, 2003, Pages 75~81
DOI : 10.3745/KIPSTA.2003.10A.1.075
Many abstraction techniques are introduced in programming languages in order to facilitate the development, maintenance and extension of softwares. But several concepts and terms related to abstraction have not been uniformly defined and have been explained differently. Expecially in object-oriented paradigm strongly based on abstraction common consensus was not derived. In this paper, we analyse procedural abstraction, propose the taxonomy of procedural abstraction and show that procedural abstraction contains the concept of abstraction on abstraction in addition to the transformation of procedures into abstraction. We also explain polymorphism in the view of abstraction. These analysis and consideration will make it possible to understand procedural abstraction more intensively.