• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.299-320
• /
• 2011

The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.953-960
• /
• 2002

Rel-time application programs have constraints which need to be met between media-data. It is client-leading synchronization that is absorbing variable transmission delay time and that is synchronizing by feedback control and palyout control. It is the important factor for playback rate and QoS if the buffer level is normal or not. This paper, The method of maintenance buffer normal state transmits in multimedia server by appling feedback of filtering function. And synchronization method is processing adaptive playout time for smooth presentation without cut-off while media frame is skip. When audio frame which is master media is in upper threshold buffer level we decrease play out time gradually, low threshold buffer level increase it slowly.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.582-585
• /
• 2000

인터넷의 급속한 발전으로 빠른 데이터 전송이나 대용량의 데이터 전송이 현실화 되고 있다. 또한 신속한 정보 획득으로 인한 생활의 질적 향상은 물론 국가 경쟁력의 확보등을 이룰 수 있다는 긍정적인 효과가 있는 반면 인터넷의 확장으로 인한 시스템의 불법침입, 중요 정보 유출, 시스템 파괴.변경등의 부정적인 사례들이 계속 증가하고 있다. 특히, 최근에 컴퓨터 시스템의 침해 사고가 국내.외적으로 빈번히 일어나고 있어, 이에 대한 대책이 절실히 요구되고 있다. 이와 같은 요구에 대비하고자 하는 대표적인 보안 대책으로는 암호화, 복호화 기술과 시스템 보안 기술등이 있다. 특히, 이러한 기술중의 하나인 침입 탐지 기술은 침입 차단 기술과 함께 정보 시스템의 안전한 운영을 위해 필수적인 기술이라고 할 수 있다. 본 논문에서는 분산 시스템 환경에서 자연 면역시스템을 적용하여 실시간적으로 침입을 탐지하는 시스템을 제안한다.

• Journal of Biosystems Engineering
• /
• v.23 no.4
• /
• pp.391-398
• /
• 1998

Effective use of agricultural informations is crucial for 21 century farming. An interactive agricultural machinery information system was developed. It consisted of databases, knowledge bases, expert systems, a server engine, clients for a multimedia agricultural machinery information system based on Java and distributed objects technology. It is supposed to be served through a nationwide super information communication network for my farmers to utilize it interactively and quickly. Several user-friendly interface programs for users were developed to use texts, static k dynamic images, and expert systems easily. Tools for providing the informations were built with JAVA. Information providers permitted to access to the system such as agricultural machinery companies can easily add or modify the informations using distributed object technology. This system can interact among three groups : prime information provider (or system manager), permitted information providers, and farmers.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.1-9
• /
• 2009

In recent years, a film restoration has gained increasing attention by many researchers, to support multimedia service of high quality. In general, an old film is degraded by dust, scratch, flick, and so on. Among these, the common factors are scratch and blotch, so that many researchers have been investigated to restore these degradations. However, the methods in literature have one major limitation: A method is working well in dealing with scratches, however it is poorly working in processing the blotches. The goal of this work is to develop a robust technique to restore images degraded by both scratches and blotches. For this, we use MRF-MAP (Markov random field - maximum a posteriori) framework, so that the restoration problem is considered as the minimization problem of the posteriori energy function. As the minimization is one of complex combinatorial problem, we use distributed genetic algorithms (DGAs) that effectively deal with combinatorial problems. To asses the validity of the proposed method, it was tested on natural old films and artificially degraded films, and the results were compared with other methods. Then, the results show that the proposed method is superior to other methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.25-35
• /
• 2002

Many multimedia presentation applications involve retrieval of objects from more than one collaborating server. Presentations of objects from different collaborating servers might be interdependent. This implies that objects should be retrieved from remote servers and delivered continuously according to given time constraints. Such applications need an estimate of the avaliable network resources to each of the collaborating servers and local system resources in order to identify a schedule for retrieving the objects composing the presentation. A collaborating server can suggest modifications of the retrieval schedule depending on its load. these modifications can potentially affect the retrieval schedule for other collaborating applications. Hence, a sequence of negotiations has to be carried out with the collaborating servers in order to commit for a retrieval schedule of the objects composing the presentation. In this paper, we propose an application sub-layer protocol, RLCP(Resource Lock Commit Protocol), for handling the negotiation and commitment of the resources required for a collaborative multimedia presentation and apply it to distributed video presentation application.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.771-781
• /
• 1999

오늘날의 컴퓨팅 환경은 통신 네트워크의 복잡성과 다양한 멀티미디어 서비스 처리를 위해 객체지향 기술을 분산 시스템에 도입하고 통신망을 소프트웨어 계층적 모델로 구조화한 개방형 정보 통신망 구조 연구가 활발히 진행되고 있다. 본 논문은 분산환경에서 멀티미디어 스트림 데이타를 전송하기 위한 아키텍쳐에 관한 모델의 설계 및 구현에 관한 것으로 분산 환경에서 멀티미디어 스트림 데이타를 효율적으로 전송할 수 있는 구조를 제시하고 있다. 설계한 구조는 Point-to-Point와 멀티캐스트를 지원하며 컴퓨터 통신망에서 멀티캐스트 연결을 효율적으로 관리하고 추후 기능 확장 및 기능 변경이 용이하도록 모듈화하고 유연성을 가지는 연결 관리 구조를 설계하고 구현하였다. 신호기능은 CORBA(Common Object Request Broker Architecture)의 ORB를 이용하여 실현하였으며, 데이타 전송 기능은 TCP/IP연결을 이용하였다. 이렇게 신호처리 부분과 데이타 전송 부분을 독립적으로 만들어서 하부망 기술에 독립적인 연결 관리 구조를 채택하고 있으므로 향후 다른 환경에서도 신호처리 부분을 그대로 적용할 수 있다. 분산 객체 개념을 적용하여 연결 관리 기능을 분산 객체화 하였으며 각 분산 객체간 인터페이스를 OMG(Object Management Group) IDL(Interface Definition Language)로 정의함으로써 유연성을 갖도록 하였다.AbstractThis paper proposes communication service architecture to support dynamic communication configuration and multiple connection management which are required to handle a variety of multimedia multicast application. Our communication service architecture was designed to fulfil the objectives as the following:- To build a common networking system for various multimedia multicast services- To build a platform for rapid service development and provisioning- To provide service networking independent on transport network technologiesWe implemented communication service architecture based on Common Object Request Broker Architecture (CORBA) for multimedia multicast applications. Our communication service architecture is distributed and object-oriented for extensibility and easy modification. The interfaces between the distributed objects are specified in (Object Management Group) OMGs Interface Definition Language.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1355-1363
• /
• 2017

Recently, distributed compressed video sensing (DCVS) has been actively studied in order to achieve a low complexity video encoder by integrating both compressed sensing and distributed video coding characteristics. Conventionally, a motion compensated block compressed sensing with smoothed projected Landweber (MC-BCS-SPL) has been considered as an effective scheme of DCVS with all compressed sensing frames pursuing the simplest sampling. In this scheme, video frames are separately classified into key frames and WZ frames. However, when reconstructing WZ frame with conventional MC-BCS-SPL scheme at the decoder side, the visual qualities are poor for temporally active video sequences. In this paper, to overcome the drawbacks of the conventional scheme, an enhanced MC-BCS-SPL algorithm is proposed, which corrects the initial image with reference to the key frame using a high correlation between adjacent key frames. The proposed scheme is analyzed with respect to GOP (Group of Pictures) structuring method. Experimental results show that the proposed method performs better than conventional MC-BCS-SPL in rate-distortion.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1016-1022
• /
• 2010

Far-talking recognition and distributed speech recognition networking techniques are essential to control various and complex home services conveniently with voices. It is possible to control devices everywhere at home by using only voices. In this paper, we have developed the server-client DSP module for distributed speech recognition network system and proposed a new decision rule to decide intelligently whether to accept the recognition results or not by the transferred confidence rate. Simulation results show that the proposed decision rule delivers better performances than the conventional decision by majority rule or decision by first-arrival. Also, we have proposed the new interrupt-polling technique to remedy the defect of existing delay technique which always has to wait several clients' results for a few seconds. The proposed technique queries all client's status after first-arrival and decides whether to wait or not. It can remove unnecessary delay-time without any performance degradation.