• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.97-99
• /
• 2001

분산 멀티미디어 데이터 처리는 실시간 처리, 서비스 품질의 균일성, 다수의 사용자에 대한 서비스 제공등과 같은 요구사항을 만족해야 한다. 기존의 범용 운영체제는 클라이언트/서버의 상태에 따라 주어진 서비스가 요구하는 사양을 만족하도록 관련 프로세스나 스레드들을 서로 연동시켜 운영하여야 하는 분산 멀티미디어 환경에서 적합하지 않을 수 있다. 이와같은 문제점을 해결하기 위하여 운영체제 내의 스케쥴링 정책을 바꾸는 방법이 있지만 이 방법은 커널 코드를 직접 수정해야 하기 때문에 구현상의 어려움이 많다. 이에 대한 대안으로 본 논문에서는 사용자 영역의 실시간 스케쥴러(URESPO: An User-level Real=time Scheduling Policy on distributed multimedia systems)를 제안한다. URESPO는 사용자 영역에서 실시간 스케쥴링 할 수 있는 사용자-영역의 스케쥴러를 만들어 하부 운영체제 내의 스케쥴러에게 다음에 수행할 스레드를 선정하는데 여러 가지 힌트를 줌으로써 사용자가 의도한 대로 기존 운영체제의 스케쥴링 정책을 변경할 수 있다. URESPO의 유용성은 실험을 통해 증명하였다.

• Annual Conference of KIPS
• /
• 2001.04a
• /
• pp.111-114
• /
• 2001

기존의 멀티미디어 메일은 대용량 메일이라 개인 사용자에게 그 부담이 크지 않을 수가 없었다. 본 연구에서는 멀티미디어 스트림엔진인 Essence 를 이용하여 동영상 멀티미디어 메일을 전송하는데 필요한 Essence 내에 데이터베이스를 지원하기 위한 DBMedium 개발과 데이터베이스 라이브러리를 개발하기 위한 일련의 과정을 제안하고 있다.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.73-81
• /
• 2020

The number of mobile devices roaming into a ubiquitous city (u-city) continues to rise as wireless systems have been widely deployed. The number of mobile devices also varies with time, and they tend to frequently change their locations. In addition, the available wireless access networks may belong to different domains, administrations, management, and internet service providers (ISPs). A fusion of overlapping heterogeneous wireless access networks (e.g., WiMax, Wi-Fi, LTE, etc.) serves the u-city in order to reach different coverage. In this context, technical challenges arise in mobility management for heterogeneous networks to realize their potential coverage and capacity benefits. This paper deals with the analysis of a decentralized mobility management support for u-City wireless network infrastructure. This scheme takes advantage of the features of the fully-distributed model of networked-based mobility management protocol to alleviate and realize the ubiquitous requirements of a u-City.

• Journal of Advanced Navigation Technology
• /
• v.12 no.6
• /
• pp.666-672
• /
• 2008

This paper explains late comer and error recovery process for home network environment with session management. This system consists of an ED, ES, and ER. ED is an agent that detects an error by hooking techniques for multimedia distance education based on home network environment with session management. ES is an agent that is an error sharing system for multimedia distance education based on home network environment with session management. ER is a system that is suitable for recovering software error for multimedia distance education based on home network environment with session management. This paper explains a performance analysis of an error recovery system running on distributed multimedia environment using the rule-based DEVS modeling and simulation techniques. The proposed method is more efficient than the other method in comparison with error ration and processing time.

• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1098-1104
• /
• 2015

With the widespread use of smartphones and IoT (Internet of Things), data are being generated on a large scale, and there is increased for the analysis of such data. Hence, distributed processing systems have gained much attention. Hadoop, which is a distributed processing system, saves the metadata of stored files in name nodes; in this case, the main problems are as follows: the memory becomes insufficient; load occurs because of massive small files; scheduling and file processing time increases because of the increased number of small files. In this paper, we propose a solution to address the increase in processing time because of massive small files, and thus improve the processing performance, using the Reuse JVM method provided by Hadoop. Through environment setting, the Reuse JVM method modifies the JVM produced conventionally for every task, so that multiple tasks are reused sequentially in one JVM. As a final outcome, the Reuse JVM method showed the best processing performance when used together with CombineFileInputFormat.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.355-361
• /
• 2005

This paper proposed a system collecting image information by agents in multi-threaded environment and then retrieving them with content based image retrieval. This system uses multi threads to retrieve web information effectively, then improves efficiency of CPU cycles to reduce latency time, which is the time requesting queries, executing communication processing 4hat the retrieval agents perform and filtering the retrieval results. Also, the agents for image retrieval use Java language, which is platform independent, to be suitable for distributed environment. Using JDBC to save the retrieved images, the agents are connected to database. The images themselves are stored in distributed agents' databases, and only the image indexes are stored in an index server so that the efficiency of storage and retrieval time can be improved.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• Journal of Korea Multimedia Society
• /
• v.3 no.5
• /
• pp.470-478
• /
• 2000

Color images from various application areas have their own characteristics. Practical segmentation systems need specialized methods to death with the characteristics. In this paper. we propose a distributed genetic algorithm based segmentation method for color breast carcinoma cell images. To extract positive nuclei and negative nuclei from the cell images, a distributed genetic algorithm with improved genetic operations and an evaluation function is used. As initial values, representative colors from images are introduced to work well with the cell images. A test to verify the validity of the proposed method shows well-segmented images. This result suggests that the method is pertinent to be but into practical use for the images haying limited objects with limited colors.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.80-89
• /
• 1998

In this paper, we consider the method which a secret information is distributed in hard-copied image using visual cryptography that the secret can be identifying simply by human eyes. If slides constructed by patterning, which is one of dithering method, are considered from the viewpoint of visual cryptography, each slides will maintain the shape of original image because these slides have different Hamming weights. Therefore, this method has the advantage that information distributed into slides by stacking them can decode and the shape about the original image can be keeping as well. In this paper, we propose the method which shares the secret information into multiple original images by extension of ONM (Oka-Nakamura-Matsui) method which is devised to embed a secret information on hard-copied image. As a result, this proposed method is applicable to digital watermark because the copyright of image can be identified by stacking an image of owner for verification and the distributed multiple images.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1559-1566
• /
• 2017

Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.