• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.642-652
• /
• 2010

Recently, DVC (Distributed Video Coding) techniques are drawing a lot of interests as one of the future research works to achieve low complexity encoding in various applications. But, due to the limited computational complexity, the performances of DVC algorithms are inferior to those of conventional international standard video coders, which use zig-zag scan, run length code, entropy code and skipped macroblock. In this paper, in order to overcome the performance limit of the DVC system, the distortion for every block is estimated when side information is found at the decoder and then we propose a new selective block encoding scheme which provides the encoder side with the motion information for the highly distorted blocks and then allows the sender to encode the motion compensated frame difference signal. Through computer simulations, it is shown that the coding efficiency of the proposed scheme reaches almost that of the conventional inter-frame coding scheme.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1345-1355
• /
• 2004

In a sender-initiated load redistribution algorithm, a sender(overloaded processor) continues to send unnecessary request messages for load transfer until a receiver(underloaded processor) is found while the system load is heavy. In a receiver-initiated load redistribution algorithm, a receiver continues to send unnecessary request messages for load acquisition until a sender is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications in this environment. This paper presents an approach based on genetic algorithm(GA) for adaptive load sharing in distributed systems. In this scheme, the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.209-218
• /
• 2005

In this paper, we propose CIVE, context-based interactive system for heterogeneous distributed virtual environments that delivers contexts irom real world to virtual environment and vice versa. The proposed system ronsists of obi-UCAM for generating user's contexts, NAVER for managing virtual environment, and Interface for linking obi-UCAM with NAVER. The connection between real and virtual worid through context is brneficial in following ways. Firstly. CIVE Provides a personalized user interface for virtual environment according to a user profile such as identity, age and vernacular. Secondly, translating all input signals into context, it guarantees adaptive access that enables a user to exploit unencumbered input devices controlling a shared object in virtual environment even if he moves with his own device from a virtual system to another. Finally, it provides a mechanism for synchronizing distributed virtual systems that share context representing changes at remote nodes. The context reduces the inconsistency of representing the same data among heterogeneous systems. Therefore, CIVE plays an important role in implementing VR applications such as teleconference, game and entertainment.

• Journal of the Korea Society for Simulation
• /
• v.23 no.2
• /
• pp.1-6
• /
• 2014

CPS (cyber-physical systems) which consists of connected and diverse embedded systems and physical systems are a new paradigm. Traditional systems were usually considered to be passive and dumb parts in physical systems, but with CPS, we have to take into account what are being moved or changed in the physical systems. So, as increasing the complexity of CPS, potential errors in the systems also increase. In this paper, for enhancing the reliability of CPS, we exploit an executable-model-based design methodology and propose a distributed simulation method to verify the design of CPS. For the design of the systems including discrete and continuous factors, we apply DEV&DESS formalism and simulate models in distributed simulation environments through DDS middleware. We also illustrate the applications of CPS with our modeling tool.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.339-347
• /
• 1996

object-oriented programming is used to develop next-generation telecommu- nications services running on the distributed processing environment. In order to test these services efficiently at the system-level during not only in the development phase but also in the operation phase, we define an embedded monitor service within the infrastructure to monitor the operation of the distributed programs, and describe a system-level test mechanism based on the monitor service. By separating the function of monitor server which monitors operations of objects and collects monitored data and that of tester which makes analysis and decides the sequence of test events, the invasive effect of monitoring can be minimized. At the same time, accurate diagnosis on the system can be achieve by exploiting the test mechanism. The mechanism, as a core component for the implementation of real-time fault-tol-erant systems, is applicable to general-purpose distributeded systems as well.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.187-192
• /
• 2008

The Intelligent Space(ISpace) provides challenging research fields for surveillance, human-computer interfacing, networked camera conferencing, industrial monitoring or service and training applications. ISpace is the space where many intelligent devices, such as computers and sensors, are distributed. According to the cooperation of many intelligent devices, the environment, it is very important that the system knows the location information to offer the useful services. In order to achieve these goals, we present a method for representing, tracking and human Jollowing by fusing distributed multiple vision systems in ISpace, with application to pedestrian tracking in a crowd. This paper describes appearance based unknown object tracking with the distributed vision system in intelligent space. First, we discuss how object color information is obtained and how the color appearance based model is constructed from this data. Then, we discuss the global color model based on the local color information. The process of learning within global model and the experimental results are also presented.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.165-171
• /
• 2009

With rapid growth of Mobile Ad-Hoc network(MANET) and P2P service technologies, many attempts for integration of MANET and P2P service and development of such applications are actively introduced recently. The implementation of stable P2P service, however, is very difficult challenge because of the high mobility of mobile users in MANET. In this paper, we propose an efficient mobile P2P service, which shares and manages multimedia data files efficiently in mobile environment, uses distributed caches to store files considering their popularities in order to achieve high performance. The performance of proposed P2P service is evaluated by an analytic model and compared with those of existing DHT based P2P service in peer-to-peer network.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.131-140
• /
• 2011

File pollution (i.e., sharing of corrupted files, or contaminating index information with bogus index records) is a de facto problem in many file sharing Peer-to-Peer (P2P) systems in use today. Since pollution squanders network resources and frustrates users with unprofitable downloads (due to corrupted files) and unproductive download trials (due to bogus index records), the viability of P2P systems (and similar distributed information-sharing applications) is questionable unless properly addressed. Thus, developing effective anti-pollution mechanisms is an immediate problem in this literature. This paper provides useful information and deep insight with future researchers who want to design an effective anti-pollution mechanism throughout an extensive measurement study of user behavior and file pollution in a representative DHT-based P2P system, the Kad network.