• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.891-900
• /
• 2005

This paper studies network recovery methods for WDM optical mesh networks, concentrating on improving spare resource utilization. The resource efficiency can be obtained by sharing spare resources needed for network recovery. To improve the sharability of spare resources in WDM networks, methods to share backup paths us well as spare capacity should be studied. The proposed method in this paper uses multiple ring-covers and this method provides fast and simple recovery operation by exploiting the characteristics of logical ring topology, and also provides efficient resource utilization by using multiple distributed backup paths to improve the sharability of overall spare resources in the networks. This method can provide layered reliability to network service by enabling hierarchical robustness against multiple failures. The performance results show that the proposed method provide improved resource efficiency for single failure and enhanced robustness for multiple failures.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.1
• /
• pp.27-34
• /
• 2013

Background subtraction is one of the key techniques for automatic video content analysis, especially in the tasks of visual detection and tracking of moving object. In this paper, we present a new sample-based technique for background extraction that provides background image as well as background model. To handle both high-frequency and low-frequency events at the same time, multiple interval background models are adopted. The main innovation concerns the use of a confidence factor to select the best model from the multiple interval background models. To our knowledge, it is the first time that a confidence factor is used for merging several background models in the field of background extraction. Experimental results revealed that our approach based on multiple interval sampling works well in complicated situations containing various speed moving objects with environmental changes.

• Journal of KIISE:Information Networking
• /
• v.34 no.1
• /
• pp.27-32
• /
• 2007

Next-generation wireless networks are expected to support a wide range of services, including high-rate data applications, Various service types request differentiated QoSs(Qualities of Service) such as minimum data rate, accuracy, fairness and so on. Although resources of radio systems are limited, for many applications, it is important that certain QoS targets are required to be met. In this paper, we propose a QoS based scheduling algorithm for next generation systems, based on analyzing previous researches, and we develop the proposed QoS algorithm only for MIMO(multi-Input Multi-Output) systems. Moreover, we subsequently prove that the proposed algorithm optimize throughput relative to prespecified target values and converge to certain throughput.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.500-506
• /
• 2007

얼굴에 대한 시각적 인지는 오랫동안 인간에게 중요한 문제로 인식되어 왔다. 수 세기 동안 이루어져 왔던 미용 화장과 성형, 치아 교정 등의 다양한 연구는 사람의 얼굴을 감성적 측면에서 어떻게 하면 아름답게 만들 수 있는 가에 초점을 두었다. 본 논문에서는 휴먼 입출력 인터페이스로서 햅틱 장치와 스테레오 디스플레이를 혼합한 다중 감각 인터랙션 기반의 감성적인 3차원 얼굴 메이크업 시뮬레이션 프레임워크를 개발한다. 본 연구는 3차원 스캐너 장비로부터 사용자의 얼굴 모델을 추출하고, 그 데이터를 이용하여 자연스럽고 직관적인 얼굴 메이크업 시뮬레이션을 수행하는 것을 목표로 하고 있다. 이를 위하여 본 연구에서는 surface elements 표현 기반의 3차원 얼굴 필터링 방법과 얼굴 메이크업을 지원하는 페인팅 방법을 개발한다. 우선 사용자의 얼굴 모델을 3차원 스캐너로 획득한 후, 전처리 얼굴 필터링을 수행하여 조명, 그리고 사용자 얼굴 피부 상태에 기인하는 에러 및 속성들을 보정하고 피부 톤을 사용자가 선호하는 색으로 변경한다. 최종적으로 사용자는 햅틱 및 스테레오 디스플레이 장치를 이용하여 두 개의 레이어로 구성된 페인팅 표면 모델에 메이크업을 수행한다. 본 연구에서 적용한 surface elements 표현 기반의 그래픽 렌더링은 일반적인 메쉬 기반 페인팅의 문제점인 텍스쳐 왜곡 현상을 완화하고, 3차원 스캐너 장치에 기인하는 표면 에러를 보정한다. 그리고 전처리 얼굴 필터링과 메이크업 페인팅 방법은 사용자 중심의 감성적인 3차원 얼굴을 재구성하도록 한다. 결과적으로 본 연구에서 개발한 이러한 기술들이 다중 감각 인터페이스 기반의 메이크업 시뮬레이터의 기본 프레임워크가 되어, 차후 메이크업이나 코디네이션 분야 등의 디지털 콘텐츠 산업에서 활용될 수 있음을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.511-520
• /
• 2011

In this paper, we introduce a multiuser (MU) scheduling method for multiuser amplify-and-forward relay systems, which selects both the transmission mode, i.e., either one- or two-hop transmission, and the desired user via two steps. A closed-form expression for the average achievable rate of the proposed scheduling is derived under two transmission modes with MU scheduling, and its asymptotic solution is also analyzed in the limit of large number of mobile stations. Based on the analysis, we perform our two-step scheduling algorithm: the transmission mode selection followed by the user selection that needs partial feedback for instantaneous signal-to-noise ratios (SNRs) to the base station. We also analyze the average SNR condition such that the MU diversity gain is fully exploited. In addition, it is examined how to further reduce a quantity of feedback under certain conditions. The proposed algorithm shows the comparable achievable rate to that of the optimal one using full feedback information, while its required feedback overhead is reduced below half of the optimal one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.15-30
• /
• 2000

The important considerations in the design of fiber-optic networks are reliability and survivability preparing against a failure. The SDH(Synchronous Digital Hierarchy), the international standard of optical transmission, offers several network reconfiguration methods that enable network to be automatically restored from failure. One of the methods is the SHR(Self Healing Ring), which is a ring topology system. Most network providers have constructed their backbone networks with SHR architecture since it can provide survivability economically. The network architecture has eventually evolved into a multi-ring network comprised of interconnected rings. This paper addresses multi-ring network design problems is to minimize ring-construction cost. This problem can be formulated with MIP(mixed integer programming) model. However, it is difficult to solve the model within reasonable computing time on a large scale network because the model is NP-complete. Furthermore, in practice we should consider the problem of routing demands on rings to minimize total cost. This routing problem involves multiplex bundling at the intermediate nodes. A family of heuristic algorithms is presented for this problem. These algorithms include gateway selection and routing of inter-ring demands as well as load balancing on single rings. The developed heuristic algorithms are applied to some network provider's regional and long-distance transmission networks. We show an example of ring design and compare it with another ring topology design. Finally, we analysis the effect bundling.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.197-203
• /
• 2012

This paper studies network recovery method using logical multiple ring architecture embedded in WDM optical Internet environment. The multiple ring-based recovery method provides fast and simple network restoration operation, and performs local recovery that is detouring the failed link. The multiple ring architecture can provide higher resource efficiency by sharing the backup routes and reducing the number of spare wavelengths. This paper calculates the required spare capacity ratio using Cut-Sets in the given network topology and performs simulation for comparative analysis.

• The KIPS Transactions:PartA
• /
• v.17A no.6
• /
• pp.259-264
• /
• 2010

In case of scheduling tasks with shared resources in multiprocessor systems, Global Earliest Deadline First (GEDF) algorithm, equally applied Earliest Deadline First (EDF) which runs scheduling with deadline criterion, makes schedulability decline because GEDF typically does not have a specific process in order to handle tasks with shared resources. In this paper, we propose Earliest Deadline First with Partitioning (EDFP) for tasks with shared resources which partitions a task into two kinds of subtasks that include critical sections to access to shared resources, gives their own deadline respectively and manages them. As a result of simulations, EDFP shows better performance than GEDF for tasks with shared resources since system load goes up and the number of processor increases.

• The KIPS Transactions:PartA
• /
• v.18A no.1
• /
• pp.11-18
• /
• 2011

Cloud computing is a new computing paradigm for sharing resources. Various applications used for cloud services are represented as workflows. These workflow applications must be appropriately allocated to resources or services in cloud. In this paper, a new scheduling algorithm is proposed for multiple workflow applications considering cloud computing environment. The cost-based rank scheduling algorithm considers not only multiple workflow applications, but various QoS metrics for evaluating services. Simulation results show that the proposed algorithm can improve the mean makespan and the availability significantly over two well-known algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.05a
• /
• pp.233-237
• /
• 1998

다중의 연속 미디어 데이타를 출력 마감시간(playout deadline)전에 검색 및 전송하여 자연스럽게 처리하기 위한 가장 효율적인 처리방안은 메모리 버퍼를 이용하는 것이다. 본 논문에서는 다중 스트림의 데이타 전송 요구 및 해제시의 버퍼 상태를 파악하여 버퍼를 동적으로 할당하고 물리작인 버퍼를 윈도우 크기의 논리버퍼로 분할하여 동적으로 관리하는 매핑관리자를 설계하여 버퍼이용률을 높일 수 있는 방안을 제시하였다. 또한, 서로 다른 소비율로 발생된 여분의 버퍼 공간을 활용할 수 있는 지능적인 선반입 기법과 마감시간을 고려한 전송 스케줄링 기법을 통해 실시간에 동기식으로 다중 미디어 스트림을 전송할 수 있는 동적 버퍼 관리 기법을 제안하였다. 마지막으로, 버퍼의 이용율을 높이기 위해 입출력 주기에 따라 버퍼 공간을 여러 스트림들이 파이프라이닝 방식으로 버퍼를 공유하는 기법과 잔여 버퍼공간의 할당 여부를 결정하기 위한 수락제어 기법을 적용하였다.