• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.40-46
• /
• 1999

The task scheduling has an effect on system execution time in a precedence constrained task graph onto the multiprocessor system. This problem is known to be NP-hard. many people made an effort to obtain near optimal schedule. We compared modified critical path schedule with many other methods(CP, MH, DL Swapping) For testing this subject, we created randomly a directed acyclic task graph with many root nodes and terminal nodes simulation result convinced for us that the modified critical path algorithm is superior to the other scheduling algorithm.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.155-164
• /
• 2002

MPLS is a integrated technology by using routing function and label swapping in the network layer. Based on the previous forwarding equivalence classes, it adds the fixed length label in ingress of the MPLS domain. For the routing, without the packet header information, it uses label for the forwarding decisions. In this paper, traffic engineering requirements in the MPLS internet will be setup. The traffic engineering function have to be performed previously with the network topology. In addition to, we presents the IP network topology and main function with MPLS signaling protocol.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.367-369
• /
• 2004

웹 서비스는 차세대 기술임에도 불구하고, 비즈니스 측면의 중요한 요소인 보안, 핫 스왑핑, 과금 등을 지원하지 않는 문제점을 가지고 있다. 이러한 문제를 해결하기 위해서 본 논문에서는 웹 서비스를 보다 쉽게 배포하고, 사용할 수 있으면서 비즈니스에서 중요한 특성을 지원할 수 있는 프레임워크를 소개한다. 이 프레임워크는 웹 서비스 컨테이너위에서 메타 데이터를 이용해서 자동으로 보안, 탓 스와핑, 과금 등의 기능을 제공한다. 따라서 이 프레임워크를 사용하는 경우에 보다 쉽게 웹 서비스를 개발 및 사용할 수 있기 때문에 시스템 개발에서 많은 비용과 노력을 줄일 수 있을 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.175-177
• /
• 2006

SDR (Software Defined Radio) 기술은 세계적인 공통 표준이 없는 이동통신 시스템을 하나의 단말을 이용하여 소프트웨어적으로 접근 가능하도록 만들어주는 것이다. SDR에서는 소프트웨어 프레임워크의 표준으로 JTRS JPO에서 정의한 SCA (Software Communications Architecture)를 채택하였다. 본 논문에서는 SCA의 구조에 대해서 간단히 살펴보고 소프트웨어 컴포넌트의 실시간 교체 방법이 필요한 부분임을 프로그램 시뮬레이션을 통해 제시한다.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.104-115
• /
• 1994

This paper presents the design of a placement sysyem integrated in PCB design system. to get an optimal component positioning from part and net list. Unplaced components are placed in initial process using modified cluster development algorithm and are swapped in improvement process using the GFDR(Generalized Force Directed Relaxation) algorithm. The result is optimized in post process by component rotating or pin/gate swapping. Experimental results shwo that the placement system produces manufacturable layouts which are optimal in terms of total routing length.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.94-96
• /
• 2002

서비스의 중단 없이 소프트웨어를 동적으로 업그레이드하고 확장하기 위해서는 객체지향 소프트웨어의 작은 단위인 모듈 즉, 객체를 동적으로 교체할 수 있는 구조가 필요하다. 특히 컴퓨터통신 네트워크 분야에서는 서로 영역에 넓게 퍼져 있을 경우 특별히 복잡한 구조를 가지고 된다. 본 논문에서는 이러한 객체 핫 스와핑을 가능하게 방법들을 비교분석 하고 가장 효율적인 방법을 사용해서 객체 핫 스와핑이 가능하게 하는 프레임워크를 설계 및 구현하였다.

• Journal of the Korea Computer Graphics Society
• /
• v.8 no.3
• /
• pp.17-23
• /
• 2002

Motion capture system is widely used nowadays in the entertainment industry like movies, computer games and broadcasting. This system consist of several high resolution and high speed CCD cameras and expensive frame grabbing hardware for image acquisition. KAIST VR laboratory focused on low cost system for a few years and have been developed a LAN based optical motion capture system. But, by using low cost system some problems like occlusion, noise and swapping of markers' trajectory can be occurred. And more labor intensive work is needed for post-processing process. In this thesis, we propose a trajectory rectification algorithm by confidence model of markers attached on actor. Confidence model is based on graph structure and consist of linkage, marker and frame confidence. To reduce the manual work in post-processing, we have to reconstruct the marker graph by maximizing the frame confidence.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.

• Journal of Plant Biotechnology
• /
• v.34 no.2
• /
• pp.81-93
• /
• 2007

Gas hydrates are known to form by physical interactions between host water and guest gas molecules and thus can be treated as a special type of icy materials. The gas hydrates are recently highlighted because of their use to future energy source even though they were discovered naturally in the deep-sea marine sediments a long time ago. However, the present and future urgent task is to develop the efficient and safe production technology for recovering methane from gas hydrates. Here, we propose one of potential recovery processes using swapping phenomenon occurring between gaseous carbon dioxide and methane hydrate deposits. Such a swapping process provide several technological and economical advantages over conventional processes. The carbon dioxide can be directly sequestered into methane hydrate layer and simultaneously methane can be produced with a high recovery rate more than 90%. In addition, the icy powders can be effectively used as a new medium for storing hydrogen. To increase hydrogen storage capacity the icy hydrate networks need to be redesigned to create the more empty cages in which hydrogen gas can be enclathrated. Functionalized icy materials might be used in a variety of energy and environmental fields.