• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2080-2089
• /
• 1997

Recent evolution in compute technology makesthe multimedia processing widely availiable. Conventional storage systems do not meet the requirements of multimedia data. Several approaches were suggested to improve disk storing methods for them. Bocheck proposed a disk partitioning technique for multiple steams assuming that all steams have same retrieval intervals with the same amount data for each access. While Bocheck's one provides a good method for same period, it does not consider the case of different periods of continous media streams. This paper proposes a new partitioning technique in which a fixed number of blocks are assigned for stresms with different retrieval periodicity. The analysis shows this problem is the same as the one scheduling the steams into a given sequence. The simulation was done to compare the proposed m-sequence merge method with the conventional Scan-EDF and Partitioning methods.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.497-511
• /
• 1999

Recently, many parallel processing technologies were developed, ILP(Instruction level Parallelism) processor's performance have been growed very rapidly. especially, EPIC(Explicitly Parallel Instruction computing) architectures attempt to enhance the performance in the predicated execution and speculative execution with the hardware. In this paper to improve the code scheduling possibility by applying to the characteristics of EPIC architectures, a new register allocation algorithm is proposed. And we proves that proposed register allocation algorithm is more efficient scheme than the conventional scheme when predicated execution is applied to our scheme by experiments. In experimental results, it shows much more performance enhancement, about 19% in proposed scheme than the conventional scheme. So, our scheme is verified that it is an effective register allocation method.

• The KIPS Transactions:PartD
• /
• v.13D no.5 s.108
• /
• pp.683-690
• /
• 2006

The CBAM (Cost Benefit Analysis Method) provides a method for deciding the best architectural strategy by considering cost, schedule, and risks as well as the benefits of the architectural strategy. But many parts of the CBAM do not Present quantitative evidence explicitly on whether it is the best architectural strategy among others because it depends on the stakeholders' consensus, vote, and/or intuition. In this study, we apply the AHP (Analytic Hierarchy Process) to CBAM to provide explicit quantitative evidence and to reduce the possibility of subjective decision-making errors that may occur in the CBAM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.2
• /
• pp.240-246
• /
• 2008

It has able to be possible that expression and store visual image from analog to digital without picture quality damaged via improvement of video compression technology. And also, It is possible to broadcasting digital image via transmission of digital image on MPEG-2 standardization. For this reason, the broadcasting business owners have converted broadcasting service from analog to digital. But, local SO(System Operator) has a difficult point which secure HD(High Definition) broadcasting program. In this paper, we designed and implemented Scheduling System for MPEG-2 Digital Broadcasting which gather HD broadcasting program from major broadcasting business owners and broadcast them.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.419-420
• /
• 2023

최근 인공지능 기술과 로봇 기술의 발전으로 인해 비서 로봇을 만드는 기술적인 가능성이 커지면서 업무 자동화를 위해 많은 기업에서 도입하고 있다. 특히 인구 고령화가 진행되면서 노동력 부족이 심각한 문제로 대두되고 있다. 현재 비서로봇은 정형화된 대화는 잘 처리하지만 비정형화된 대화에 대해서는 한계가 있다. 본 논문은 앞선 문제를 해결하기 위해 비정형화된 대화도 가능하면서 사용자가 원하는 행동을 실행할 수 있는 보편화된 비서 로봇을 선보인다. 음성인식 모듈과 구글 어시스턴트를 활용하여 마이크를 통해 비서 로봇에게 스케줄 관리, 날씨 등을 질문하고, 스피커를 통해 대답을 듣는 등 비정형화된 의사소통을 할 수 있으며, 비서 로봇에게 원하는 행동을 지시하여 행동을 구현시킬 수 있는 비서로봇을 제안한다.

• KIISE Transactions on Computing Practices
• /
• v.23 no.12
• /
• pp.691-697
• /
• 2017

Volcanic ash has been predicted to be the main source of damage caused by a potential volcanic disaster around Mount Baekdu and the regions of the Korean peninsula. Computer simulations to predict the diffusion of volcanic ash should be performed according to prevalent meteorological situations within a predetermined time. Therefore, a workflow using pipelining is proposed to parallelize the software used for this computation. Due to the nature of volcanic calamities, the simulations need to be carried out for various plausible conditions given that the parameters cannot be precisely determined during the simulations, even at the time of a volcanic eruption. Among the given conditions, computations need to be first performed for the condition with the highest probability so that a response to the volcanic disaster can be provided using these results. Further action can then be performed later based on subsequent results. The computations need to be performed using a volcanic disaster damage prediction system on a computing server with limited computing performance. Hence, an optimal distribution of the computing resources is required. We propose a method through which specific data can be provided first to the proposed pipeline-based workflow.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1476-1484
• /
• 1999

TV 방송 분야에서 다양한 정보와 상호 작용성을 제공하기 위해서 최근 기존 방송 내용인 A/V 스트림 외 부가정보 방송이 시도되고 있다. 데이타 방송에 대한 기존 연구는 대부분 고정된 내용의 데이타를 방송하는 환경을 가정하고 있어서 그 결과가 방송 내용의 변화가 많은 환경에 부적합하다. 본 논문에서는 데이타에 대한 접근이 반복되지 않을 가능성이 높고 사용자 접근 확률을 예상하기 어려운 상황에서 응답 시간을 개선하는 방안으로 수신 데이타를 무조건 캐쉬에 반입하고 교체가 필요한 경우 다음 방송 시각이 가장 가까운 페이지를 축출하는 사용자 단말 시스템에서의 캐슁 정책을 제안하였다. 제안된 캐쉬 관리 정책은 평균적인 캐쉬 접근 실패 비용을 줄임으로써 사용자 응답 시간을 개선하며, 서로 다른 스케줄링 기법을 사용하는 다양한 방송 제공자가 공존하는 환경에서 보편적으로 효과를 가져올 수 있다.Abstract Recently, many television broadcasters have tried to disseminate digital multimedia data in addition to the traditional content (audio-visual stream). The broadcast data need to be cached by a client system, to provide a reasonable response time for a user request. Previous studies assumed the dissemination of a fixed set of items, and the results are not suitable when broadcast items are frequently changed. In this paper, we propose a novel cache management scheme that chooses the replacement victim based on the remaining time to the next broadcast instance. The proposed scheme reduces response time, where it is hard to predict the probability distribution of user accesses. The caching policy we present here significantly reduces expected response time by minimizing expected cache miss penalty, and can be applied without difficulty to different scheduling algorithms.

• Archives of design research
• /
• v.18 no.2 s.60
• /
• pp.273-282
• /
• 2005

In this study, we proposed Context Cube as a conceptual model of user context, and a Multi-modal Interaction Design framework to develop ubiquitous service through understanding user context and analyzing correlation between context awareness and multi-modality, which are to help infer the meaning of context and offer services to meet user needs. And we developed a case study to verify Context Cube's validity and proposed interaction design framework to derive personalized ubiquitous service. We could understand context awareness as information properties which consists of basic activity, location of a user and devices(environment), time, and daily schedule of a user. And it enables us to construct three-dimensional conceptual model, Context Cube. Also, we developed ubiquitous interaction design process which encloses multi-modal interaction design by studying the features of user interaction presented on Context Cube.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.17-24
• /
• 2004

This paper proposes an efficient technique to protect e-mail server from DDoS attack using the CBQ (Class Based Queuing) algorithm The proposed method classifies incoming trafic to an e-mail server into three classes: 'more important mail traffic', 'less important traffic' and 'unknown traffic' and assigns bandwidths differently to the traffics. By differentiating the bandwidths of classes, normal mail traffic may flow even under DDoS attack in the proposed technique. The proposed technique is implemented on an embedded system which hires a switching processor with the WFHBD(Weighted Fair Hashed Bandwidth Distribution) engine that has been known as an efficient algorithm to distribute a given bandwidth to multiple sources, and it is verified that it can be an efficient way to protect e-mail server from DDoS attack.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1785-1796
• /
• 1998

This paper is concerned with the relationships between optimal number of wavelengths and tuning time in time division multiplexing(TDM) scheduling on wavelength division multiplexing(WDM) optical passive star networks. We assume that the traffic is nonuniform and each node has a tunable transmitter and a fixed receiver. Each node transmits spckets to all other nodes. Most of the earlier protocols on TDM based scheduling for WDM star networks [7, 8, etc.] use whold given wavelength chnnels. But in this paper, we investigate the optimal number of wavelengths that yidels minimum frame length when tuning time exists. It appears within the availble number of wavelengths that yields minimum frame length when tuning time exists. It appears within the available number of wavelengths. We analyze the relationships between optimal number of wavelengths and tuning time by experiments. We analyze the reationships between optimal number of wavelengths and tuning time by experiments. We also discuss on the possibility of reduction of frame length by increasing the number of nodes trans-mitters and receivers.