• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.419-428
• /
• 2008

IEEE 802.15.4 reserves transmission time to support real-time transport by sending GTS request packets to the PAN coordinator in advance. This paper introduces GTS-FAT technique to reduce the reservation time by giving a higher sending priority to GTS request packets than data packets. Differently from the conventional scheme where these two kinds of packets share a single transmission queue, GTS-FAT scheme allocates two queues with two different contention window sizes like IEEE 802.11e. This paper also proposes an analytical GTS delay model by combining the two legacy models for 802.15.4 and 802.11e to accurately predict the GTS-FAT delay over a given network topology. Our analysis shows that GTS-FAT reduces GTS service delay by up to 50% at the expense of the data delay by only up to 6.1% when GTS request packets four times outnumber data packets.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• Journal of Korea Game Society
• /
• v.15 no.2
• /
• pp.105-114
• /
• 2015

We propose a real time user interface that utilizes emotion recognition by physiological signals. To improve the problem that was low accuracy of emotion recognition through the traditional EEG(ElectroEncephaloGram), We developed a physiological signals-based emotion recognition system mixing relative power spectrum values of theta/alpha/beta/gamma EEG waves and autonomic nerve signal ratio of ECG (ElectroCardioGram). We propose both a data map and weight value modification algorithm to recognize six emotions of happy, fear, sad, joy, anger, and hatred. The datamap that stores the user-specific probability value is created and the algorithm updates the weighting to improve the accuracy of emotion recognition corresponding to each EEG channel. Also, as we compared the results of the EEG/ECG bio-singal complex data and single data consisting of EEG, the accuracy went up 23.77%. The proposed interface system with high accuracy will be utillized as a useful interface for controlling the game spaces and smart spaces.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.3
• /
• pp.249-255
• /
• 2007

The building of spatial database such as digital maps has been extensively achieved as a base of geographic information system. However, in the GIS system built by the organizations including local autonomous entities, there are some problems technically and systematically for a promptly updating of GIS DB. This research is to develop the object-oriented database updating system to efficiently update the spatial data at any time for a small area. It could be managed the history of spatial database such as creation, modification and deletion at a object level using the UFID of spatial data. This system could help to modify or update the changed geographical features in an office or in-situ promptly. Finally, it could be made the efficient updating manner of geographic data and the assurance of newest database.

• Annual Conference of KIPS
• /
• 2006.11a
• /
• pp.51-54
• /
• 2006

본 논문에서는 각 사용자들의 취향에 맞는 음악을 추천하는 개인화된 음악 추천 시스템을 소개한다. 추천 시스템이란 사용자의 선호도를 분석하고 아이템들에 대한 사용자의 선호도를 예측하여 영화, 음악, 기사, 책, 웹 페이지 등과 같은 아이템들을 추천하는 시스템을 말한다. 추천 시스템들에서 가장 많이 사용하고 있는 협동적 추천 방식은 선호도 데이터를 기반으로 유사한 사용자들을 찾고, 유사 사용자들의 선호도를 기반으로 예측을 수행하는 것으로서, 여러 장점들이 있으나 희소성(sparsity) 문제와 확장성(scalability) 문제에 대해 취약점을 가지고 있다. 아이템들의 전체 수에 비해 매우 적은 수의 아이템 선호도 데이터만 존재한다면 사용자들의 유사도를 계산하기가 어려우며, 또한 사용자의 수가 늘어날수록 유사도 계산에 걸리는 시간이 급격하게 늘어남으로써 수백만 사용자가 있는 웹 사이트 등에서 실시간 추천을 수행하기 어렵다. 본 논문에서 소개하는 음악 추천 시스템은 이러한 문제점들을 해결하기 위해 그래프 기반 협동적 여과 기법을 사용한다. 그래프 기반 협동적 여과 기법은 기존의 협동적 여과 기법들과 달리 아이템들 사이의 연관관계를 그래프 모델로 표현하고 저장함으로써 묵시적인 선호도 정보들을 누적하여 희소성 문제를 해결하고, 추천 아이템을 선정하는데 필요한 계산 시간을 크게 단축하여 대규모 데이터에서 실시간 추천을 가능하게 한다는 장점이 있다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.147-151
• /
• 2014

With the advent of tiny and inexpensive computer systems like Raspberry Pi, it has become possible to construct an experimental environment of MANETs (Mobile Ad hoc Networks) at a relatively low cost. In this paper, we implement a node of MANETs with a Raspberry Pi equipped with two 802.11 wireless LAN cards and dynamic routing software running on it. In an outdoor MANETs environment with moving mobile nodes automatically rebuilding broken routes, we conducted a real-time video streaming experiment over the MANET. The video stream is transmitted from a node with a video camera installed on it to another node through the route established dynamically. Each node is equipped with a display device, with which the current status of the node can be checked out. We also implemented software that automatically collects data stored in each node and analyzes the performance of the MANETs. Through this experiment, we could evaluate the performance of realistic video streaming service in a MANETs environment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.4
• /
• pp.795-804
• /
• 2009

An HSS(Home Subscriber Server) system requires a main-memory database on main-memory unit for the real-tine management of the subscriber information in the mobile communication service, in that the system controls not only basic data for handling calls of users, but also additional service data related to user authentication and operational data. Nonetheless, HSS-DBS system, requiring the reliability and stability, need more secure data store method and a back-up technique because the system have a long startup time and the big problem on the failures of main-memory. This paper proposes an efficient back-up replication technique, on the basis of enhancing the stability and performance of HSS system. The proposed shadowing back-up technique adopting the delayed recovery process, can help minimize the real-time back-up overloads by location registration, while the proposed backup replication method enables more stable system operations with replicating the data to remote server in real time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.3
• /
• pp.202-207
• /
• 2016

Checkpoint placement is an effective fault tolerance technique against transient faults in which the task is re-executed from the latest checkpoint when a fault is detected. In this paper, we propose a new checkpoint placement strategy separating data saving and fault detection processes that are performed together in conventional checkpoints. Several fault detection processes are performed in one checkpoint interval in order to decrease the latency between the occurrence and detection of faults. We address the placement method of fault detection processes to maximize the probability of successful execution of a task within the given deadline. We develop the Markov chain model for a real-time task having the proposed checkpoints, and derive the optimal fault detection and checkpoint interval.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.103-106
• /
• 2012

A memory access method that data are read with different sequences with writing order is a simple but important procedure in many image compression standards, such as JPEG, MPEG1/2/4, H.264, and HEVC. For real time processing, double buffering is widely used using two block sized buffers, that accesses buffers concurrently with alternative way to read and write. In some cases like a transpose memory in 2D DCT with a simple and regular access order, a single buffering which requires only single block sized buffer can be used. This paper shows that even in complex access orders there is a regularity among updating orders within a finite turns, and suggested an effective implementation method using a single block sized buffer to process concurrent read/write operation with different access orders.

• Bulletin of the Korean Space Science Society
• /
• 2009.10a
• /
• pp.42.1-42.1
• /
• 2009

한국천문연구원은 우주측지용 레이저 추적 시스템 개발 사업 중 현재 이동형 시스템(ARGO-M) 1기를 개발 중에 있으며, 2009년 5월에 시스템 개념 설계 검토(SDR) 회의를 수행하였고 현재는 예비 설계 단계를 진행 중이다. ARGO-M을 구성하는 5개의 서브시스템 중 하나인 운영시스템은 레이저 관측에 필요한 각종 서브시스템을 제어하고 환경을 종합 판단 후 이를 관측에 반영하며, 실제 관측을 통해 획득한 데이터를 통합 처리 및 전송하는 역할을 담당하고 있다. 현재 본격적인 예비 설계 수행 단계에 있는 운영시스템은 우선적으로 핵심이 되는 소프트웨어의 설계를 위해 오스트리아의 Graz에 위치한 IWF(Institut fur Weltraumforschung) 소속 SLR(Satellite Laser Ranging) 관측소를 2009년도에 방문하여 운영 전반에 관련한 소프트웨어의 로직분석 작업을 수행하였다. Graz 운영시스템 중 소프트웨어관련 시스템은 크게 KHz급 반복율을 가진 레이저를 사용하여 위성까지의 거리 측정에 해당되는 실시간 시스템과 실시간 측정을 통해 저장된 관측 원시 자료를 이후 분석을 수행하는 비 실시간(Non-real time) 시스템으로 나눌 수 있다. 이 중에서 비 실시간 시스템은 원시 자료 분석을 통해 시간 및 거리 바이어스 적용, 노이즈 제거 등의 후처리 과정과 다양한 통계 분석 그리고 SLR시스템의 최종 산출물인 정규점(Normal Point) 생성 등을 수행한다. 이번 소프트웨어 분석 연구를 통해 얻어진 주요 알고리즘과 다양한 다이어그램을 포함한 결과물은 ARGO-M 운영시스템에 최적화하도록 소프트웨어 재구성 및 개발에 반영할 예정이다.