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
Embedded Linux for Commercial Digital TV System
문상필 ; 서대화 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 595~595
A Digital TV system is necessary for data Processing as well as video and audio processing. Especially in the case of interactive broadcasting, it should manage returning channel created by the Internet, PSTN, and so on. Because of many functionalities and multitasking jobs, it needs an Operating System. Embedded Linux as open source program can increase a cost effectiveness in market and has many advantages - reusable device drivers and application programs, more convenient developing environment using shell and file system, and easy problem resolution within Open Source Community. In this paper, we modified Embedded Linux kernel and cross developing environment for a big-endian system, redesigned devices for kernel execution, and configured system memory map in order to load a linux kernel. Also we developed an device driver for entire system control.
Design and Implementation of a Language Supporting Compositional Approach to Multiparadigm Programming
최종명 ; 유재우 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 605~605
In this paper we introduce a new style multiparadigm language named Argos which applies a compositional approach  to multiparadigm programming. Argos is a superset of the Java, and its grammar has an extension point which allows other languages to be used in Argos programs. Therefore, Argos can support object-oriented programming and multiparadigm programming by enabling each method in a class to be implemented with one of the Java, C, Prolog, Python, and XML languages. Since Argos allows the existing languages to be used, it has advantages such as easiness of learning and high reusability. The Argos compiler is implemented according to the delegating compiler object (DCO) model[28, 29]. The compiler partitions a program Into several parts according to the languages used in methods and delivers the parts the languages' processors which compile the parts.
Load Control Mechanism for Real-Time Web Server Systems Based on Feedback Control Theory
강봉직 ; 정석용 ; 김영일 ; 최경희 ; 정기현 ; 유해영 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 615~615
This paper proposes a mechanism for managing overload Introduced by excessive web requests in real-time web service system. The many previous mechanisms statically manage the overload and thus the dynamic characteristics are not reflected. This paper proposes a mechanism that models system load based on control theory approach and includes its dynamic characteristics. We design a controller that is able to meet performance requirement. A feedback control system is implemented applying the proposed mechanism and the stable operation of system is verified through various simulation environments.
A Dilation-Improved Embedding of Pyramids into 3-Dimensional Meshes
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 627~627
In this paper, we consider a graph-theoretic problem,, the so-called "graph embedding problem" that maps the vertices and edges of the given guest graph model into the corresponding vertices and paths of the host graph under the condition of maintaining better performance parameters such as dilation, congestion, and expansion. We firstly propose a new mapping function which can embed the pyramid model with height N into the 3-dimensional mesh massively parallel processor system with the height (
+2)/3 and the regular 2-dimensional mesh of one side
and analyze the performance of the embedding in terms of the dilation parameter that reflects the number of communication steps between two adjacent vertices under the embedding. We prove that the dilation of the embedding is (2ㆍ
+4)/3. This is superior to the previous result of
under the same condition.
A Data Transfer Method of the Sub-Cluster Group based on the Distributed and Shared Memory
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 635~635
The radical development of recent network technology provides the basic foundation which can establish a high speed and cheap cluster system. It is a general trend that conventional cluster systems are built as the system over a fixed level based on stabilized and high speed local networks. A multi-distributed web cluster group is a web cluster model which can obtain high performance, high efficiency and high availability through mutual cooperative works between effective job division and system nodes through parallel performance of a given work and shared memory of SC-Server with low price and low speed system nodes on networks. For this, multi-distributed web cluster group builds a sub-cluster group bound with single imaginary networks of multiple system nodes and uses the web distributed shared memory of system nodes for the effective data transmission within sub-cluster groups. Since the presented model uses a load balancing and parallel computing method of large-scale work required from users, it can maximize the processing efficiency.
A Submesh Allocation Scheme Based on Classification of Tasks and Submeshes
이원주 ; 전창호 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 643~643
This paper presents a new submesh allocation scheme for mesh-connected multicomputer systems. The key idea in the proposed allocation scheme is to reduce the submesh search time using classified free submesh lists (CFSL). This scheme reduces the submesh search time by classifying independent free submeshes according to their types (square, horizontal rectangle, vertical rectangle) and searching the best-fit submesh from the classified free submesh list. When no suitable submesh is found, the search can be continued by using the expansion index (El), which is stored as an attribute of each submesh, is used to form a larger submesh. Through simulation, we show that the proposed strategy improves the performance compared to previous strategies with respect to submesh search time.
Mobile Agents Framework for Adaptability Support based on Meta Level
김수중 ; 윤용익 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 651~651
Emerging technologies, such as multimedia and mobile computing, require that middleware platforms can support high adaptability in order to provide more flexible services in heterogeneous environments. To support high quality of service in distributed wired/wireless environments, it will be necessary for applications and middleware to be aware of changes in users requirements as well as environmental conditions, also to be able to adapt their behaviour as such changes. According to the needs of adaptability supporting in middleware, we structure a component-based, mobile agents framework in base level and meta level by using reflection. We propose concepts of meta agents and meta-service agents that are able to reflect changes made by mobile agents to the system. At the meta level of our framework, meta agents monitor execution of mobile agents and it is possible to provide dynamic adaptation of users requirements, deployment of application services and service customization with meta agents and meta-service agents.
Optimal Information Dispersal Scheme for Survivable Storage Systems
송성근 ; 윤희용 ; 이형수 ; 이강신 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 657~657
Supporting the availability, integrity, and confidentiality of the information is crucial. The survivability storage systems require to encode and distribute data over multiple storage nodes or data base to survive failures and malicious attacks Information dispersal scheme is one of the most efficient schemes allowing high availability and security with reasonable overhead. In this paper, we propose an algorithm determining the optimal (m, n)-lDS in terms of availability, given a set of IDS's. The proposed algorithm will be very useful for designing a highly available and secure storage system since many factors such as node number, storage space, operation speed, etc. interact with each other and thereby finding an optimal information dispersal scheme is very difficult.
A Region-based Comparison Algorithm of k sets of Trapezoids
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 665~665
In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, it's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(
(log n+k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O(
log n) as the sweeping-based algorithm when the number k(<
New High Speed Parallel Multiplier for Real Time Multimedia Systems
조병록 ; 이명옥 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 671~671
In this paper, we proposed a new First Partial product Addition (FPA) architecture with new compressor (or parallel counter) to CSA tree built in the process of adding partial product for improving speed in the fast parallel multiplier to improve the speed of calculating partial product by about 20% compared with existing parallel counter using full Adder. The new circuit reduces the CLA bit finding final sum by N/2 using the novel FPA architecture. A 5.14nS of multiplication speed of the 16×16 multiplier is obtained using 0.25㎛ CMOS technology. The architecture of the multiplier is easily opted for pipeline design and demonstrates high speed performance.
A Frame Skipping Transfer Policy for Server based on Clients Dynamic Buffer Control Signal
정홍섭 ; 박규석 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 677~677
Most policies of VOD services are mainly studied about server system, and make no touch on clients buffer stabilization which is the basis of guaranteeing playback quality and playing without cut off. In this paper, we proposed a skipping frame transfer policy that can sending dynamic buffer control signal to server in accordance with clients buffer state of starvation or overrun, and server transfers a skipped frame to client after receive the control signal. And through a simulation, we show the suggested policy is more efficiency on playback quality by buffer stabilization which is by preventing loss and miss for receiving frame due to grow worse client buffer state.
Design and Implementation of Automatic Installation System for Application Synchronization in PDA
나승원 ; 오세만 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 685~685
The application for PDA as a new wireless Internet device is variously developed to improve the function of PDA, and the application software must be installed to PDAs. In addition. when the power supply of PDA becomes fully discharged, all data stored in the RAM (Random Access Memory) could be vanished, and then the application programs should be reinstalled. This paper presents an automatic installation system of application program, PAIS (PDA Automatic Installation System). It is designed to solve the problem of PDA that PDA's users have to install the application programs on their PDA themselves. When this engine is applied, PDA users can save the time and effort for installation. It's convenient for the PDA users. The PDA and application software company can save the cost to create materials to explain the installation process.
Network Adaptive Quality of Service Method in Client/Server-based Streaming Systems
정연일 ; 이정찬 ; 이승룡 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 691~691
Due to the fast development of wire&wireless internet and computer hardware, more and more internet services are being developed, such as Internet broadcast, VoD (Video On Demand), etc. So QoS (Qualify of Service) is essentially needed to guarantee the quality of these services. Traditional Internet is Best-Effort service in which all packets are transported in FIFO (First In First Out) style. However, FIFO is not suitable to guarantee the quality of some services, so more research in QoS router and QoS protocol are needed. Researched QoS router and protocol are high cost and inefficient because the existing infra is not used. To solve this problem, a new QoS control method, named Network Adaptive QoS, is introduced and applied to client/server-based streaming systems. Based on network bandwidth monitoring mechanism, network adaptive QoS control method can be used in wire&wireless networks to support QoS in real-time streaming system. In order to reduce application cost, the existing streaming service is used in NAQoS. A new module is integrated into the existing server and client. So the router and network line are not changed. By simulation in heavy traffic network conditions, we proved that stream cannot be seamless without network adaptive QoS method.
A Fault-Tolerant Mobile Agent Framework and Replication Study for Internet Applications
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 701~701
This paper addresses the issue involved in dependability of distributed mobile agents in the Internet environment. We propose an architectural framework for the Internet applications making mobile agents into fault-tolerant. The replication of agents and data is of great importance to achieve fault tolerance in distributed systems over the Internet. This research focuses on the replication component for the proposed fault-tolerant mobile agent framework. We present and analyze the performance results obtained when doing simulation study on the effects of the degree of replication, the active and passive replication strategies, and the replication scale.
Design and Development of Network Based Competition Learning Model
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 709~709
It is important that the interaction between learners and contents in Educational Contents. But, there is just simple interaction in traditional WBI or CAI. As it is necessary to study for interaction with learners. There is applied more multimedia elements for the fun of learners. But, it is also necessary to study for Network Educational Game Contents which can give virtual environment to learn easily and funny. In this study, Competition Learning Model is designed for network learning environment. We can look at the new view point of Educational Contents by implementation of Network Educational Game Contents and Competition Learning Model.
Design of a XML-based Data Store Architecture for Run-time Process Monitor
정윤석 ; 김태완 ; 장천현 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 715~715
Monitoring is used to see if a real-time system provides a service on time. The target of monitoring is not only an interior system but also a remote system which is located in the remote network. Monitoring needs data store to monitor data from each system. But a data store should be designed on the considerations of time constraints and data accessibility. In this paper, we present an architecture of XML-based data store and network delivery. XML-based data store is based on XML which is a standardized data format. So any platform which supports TCP/IP and HTTP can access data in the data store without any conversion. The XML-based delivery architecture is designed to reduce the time of data access and delivery. In addition, some experiments were tested to provide the timing guideline to be kept by a real-time system which uses the architecture presented in this paper. The architecture of XML-based data store and delivery designed in this paper can be used in the domains of remote real-time monitoring and control.
Two-tiered proxy system architecture : TOPS
김정락 ; 서대화 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 723~723
In this paper, we propose the two-tiered proxy system that offers a seamless media service to mobile nodes in mobile computing environment. This proxy system is composed of a media proxy and a mobile proxy. We also propose the handoff protocol and the transmission mechanism for the seamless media service. The simulation result shows that the media service is improved in the two-tiered proxy system.
Content_based Load Balancing Technique In Web Server Cluster
명원식 ; 장태무 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 729~729
With the rapid growth of the Internet, popular Web sites are visited so frequently that these cannot be constructed with a single server or mirror site of high performance. The rapid increase of Internet uses and uses raised the problems of overweighted transmission traffic and difficult load balancing. To solve these, various schemes of server clustering have been surveyed. Especially, in order to fully utilize the performance of computer systems in a cluster, a good scheduling method that distributes user requests evenly to servers in required. In this paper, we propose a new method for reducing the service latency. In our method, each Web server in the cluster has different content. This helps to reduce the complexity of load balancing algorithm and the service latency The Web server that received a request from the load balancer responds to the client directly without passing through the load balancer. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 16%, 14% respectively.
Implementation of an Efficient Music Retrieval System based on the Analysis of User Query Pattern
노승민 ; 황인준 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 737~737
With the popularity of digital music contents, querying and retrieving music contents efficiently from database has become essential. In this paper, we propose a Fast Melody Finder (FMF) that can retrieve melodies fast and efficiently from music database using frequently queried tunes. This scheme is based on the observation that users have a tendency to memorize and query a small number of melody segments, and indexing such segments enables fast retrieval. To handle those tunes, FMF transcribes all the acoustic and common music notational inputs into a specific string such as UDR and LSR. We have implemented a prototype system and showed on its performance through various experiments.
Design and Implementation of Education On Demand System based on SIP to support Conferencing Service
박시용 ; 윤병남 ; 정기동 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 749~749
Currently, The Internet has been imported in many fields and it's development prompted accordingly. The field of education also has been developed as 'Learners Centered Environment' by combining the existing educational method, so called distance learning, with internet. Learners have become able to adopt the appropriate level of educational service anywhere and anytime they want. In this paper, we propose a EOD system based on SIP. The EOD system is a new conferencing type system in the distance learning field. Using SIP (Session Initial Protocol) for EOD system is more efficient than using H.323, also the more the number of its is increased, and as improvement of its QoS. The EOD system is scalable and provides conferencing service using SIP which suits with web environment. And, the EOD system supports multicast efficiently to utilize bandwidth of networks.
Design of a History Data Management System for the Renewable Energy Resources
오인배 ; 안윤애 ; 김원태 ; 류근호 ; 김광득 ;
The KIPS Transactions:PartA, volume 10, issue 6, 2003, Pages 757~757
Recently, the renewable energy resources play an important role as an energy resources of future due to an environmental pollution and lack of resources and so on. The development and diffusion of information systems related to renewable energy resources have been driven actively abroad. However, at domestic an efficient history management for renewable energy resource data and web retrieve service are not provided. Therefore, in this paper, we propose a history data management system for the renewable energy resources, which stores and manages vast history information of renewable energy resource data systematically. This system collects renewable energy resource data in the outside observation system and stores them in the history database. The stored Information is retrieved through the history query process and can be provided in various forms - table, graph, chart and counter line, etc. - on the internet. Especially, the proposed system manages the history data in real-time so the latest information is always provided to the users through the web interface.