• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.337-346
• /
• 2000

In a Vod(video0on-demand) system, a scheduling strategy is designed to increase the system efficiency and to eatisfy the isochronous requirements of showing a video to multiple viewers with one disk access. In this paper, we have proposed the Stream Relay Scheme (SRS) which utilizes the client's buffer space to reduce the server's disk I/O, buffer consumption, and stream capacity. Under the SRS which we have proposed in this paper, the server does not service all the requests directly but forwards the new request selectively to the client who is being served currently in order to reduce the initial latency and increase the system throughput. The SRS-BAT which integrated the SRS with the Batching technique is introduced. The results of the simulated experiments which compared the SRS with the conventional technique have shown the noticeable performance improvements in terms of initial latency and the server throughput.

• The Journal of the Korea Contents Association
• /
• v.13 no.9
• /
• pp.1-9
• /
• 2013

In recent, the cloud computing makes it possible to provide the on-demand provision of software, hardware, and data as a service in various IT fields. This paper uses the cloud computing techniques for the real time broadcasting service of virtual 3D contents. However, the existing related solutions have many problems that the load of the server is rapidly increased or the cost of the server is very high when the number of service users is increased. Therefore, we propose a new application virtualization method to solve these problems. It promises their stable operations in multi-user services because the proposed method does not execute the rendering commands of the application at the host server but delivers and executes them to clients via the Internet. Our performance experiments show that our proposed method outperforms the existing methods.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.138-143
• /
• 2015

In this paper we develop a novel human action recognition system based on communication between an ear-mounted Bluetooth camera and an action recognition server to aid scene recognition for the blind. First, if the blind capture an image of a specific location using the ear-mounted camera, the captured image is transmitted to the recognition server using a smartphone that is synchronized with the camera. The recognition server sequentially performs human detection, object detection and action recognition by analyzing human poses. The recognized action information is retransmitted to the smartphone and the user can hear the action information through the text-to-speech (TTS). Experimental results using the proposed system showed a 60.7% action recognition performance on the test data captured in indoor and outdoor environments.

• Smart Media Journal
• /
• v.6 no.3
• /
• pp.21-28
• /
• 2017

There is growing interest in the use of cloud services these days because the amount of sensitive physical information related to u-fitness-based exercise management increase in explosive. However, it is possible to illegally access information stored in a cloud server, and to find out who owns the information, even, to illegally deduce an association among the information stored in its memory. The cloud server may also intentionally pass over the owner's legitimate operation requests such as modification and deletion of stored information, and may lose or damage information due to its malfunction. So, it is strongly required to solve the above problems because we can not trust the cloud server entirely. In this paper, we propose a protocol to preserve the privacy of the owner for u-Fitness-based exercise management in a cloud computing environment. And we show that our proposed architecture is applicable in real environment through security analysis and performance analysis.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.457-466
• /
• 2002

In this paper, we designed and implemented a web-based dictionary of computing which keeps the data up-to-date. This dictionary shows the English information based on the FOLDOC (Free On-Line Dictionary Of Computing) dictionary file at the beginning of searching, and then one or more users can translate the information into Korean. This function is the new one only this dictionary has. Also, we can easily find any words we want to took up, even if we don't know the spelling completely, because the dictionary has various searching interfaces (searching for the words starting with inputted characters, searching for the words including inputted characters in the description, etc.) using a SQL Server DBMS and SQL. The performance test for CPU load factor shows that the server can support at least 1780 users at the same time.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3652-3661
• /
• 1999

To support multimedia applications such as a multimedia communication systems and multimedia broadcasting, an operating system need to predict their timing-constraints. So, In this real-time systems, we must solve the priority inversion problem that may make the behavior of unpredictable systems and need a real-time server model that provides a better preemptability and minimizes a system overhead. In current real-time systems, the single thread server model, the worker model and the dynamic server model are being used for synchronization but they cannot propose an effective structure for managing shared resources. In this paper, the priority inheritance protocol is used to solve the priority inversion problem and the hybrid prioritized worker model is proposed, which can provide a more effective structure and a faster response time minimizing a system overhead. The hybrid prioritized worker model is to combine the static and the dynamic prioritized worker model, and have a better performance than other models in response time which is an important factor in a real-time system.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.391-406
• /
• 2002

In order to realize a practical VOD system, it is necessary for a high-capacity and cost-effective hierarchical VOD server based on tertiary storages such as DVD jukebox. In such a system, it is possible to transfer multiple streams to users by alternatively swapping DVDs using the fixed number of drives. But it takes a long time for loading DVD to a drive. In this paper, we propose a primitive pipelined loading mechanism for hiding the loading time to swap DVDs in a hierarchical VOD server based on DVD jukebox. We also propose a enhanced pipelined loading mechanism for increasing the maximum admittable streams with the fixed number of drives. The enhanced mechanism caches the initial segment of each stream on a disk storage allowing faster data transfer. The performance analysis shows that the proposed mechanisms can admit the maximum allowed stream capacity under the fixed number of disk drives.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.942-947
• /
• 2008

A cluster server usually consists of a front end node and multiple backend nodes. Though increasing the number of bookend nodes can result in the more QoS(Quality of Service) streams for clients, the possibility of failures in backend nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a backend node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. The basic techniques are hewn as providing very high speed data transfer rates suitable for the video streaming. However, without considering the architecture of cluster-based VOD server, the application of these basic techniques causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of backend nodes. To resolve these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.4
• /
• pp.7-17
• /
• 2019

Machine learning is one of the most accurate techniques to predict and analyze various phenomena. K-means clustering is a kind of machine learning technique that classifies given data into clusters of similar data. Because it is desirable to perform an analysis based on a lot of data for better performance, K-means clustering can be performed in a model with a server that calculates the centroids of the clusters, and a number of clients that provide data to server. However, this model has the problem that if the clients' data are associated with private information, the server can infringe clients' privacy. In this paper, to solve this problem in a model with a number of clients, we propose a privacy-preserving K-means clustering method that can perform machine learning, concealing private information using homomorphic encryption.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.5
• /
• pp.112-125
• /
• 2019

An acoustic signal-based, tunnel-incident detection system was developed and evaluated. The system was comprised of three components: algorithm, acoustic signal collector, and server system. The algorithm, which was based on nonnegative tensor factorization and a hidden Markov model, processes the acoustic signals to attenuate noise and detect incident-related signals. The acoustic signal collector gathers the tunnel sounds, digitalizes them, and transmits the digitalized acoustic signals to the center server. The server system issues an alert once the algorithm identifies an incident. The performance of the system was evaluated thoroughly in two steps: first, in a controlled tunnel environment using the recorded incident sounds, and second, in an uncontrolled tunnel environment using real-world incident sounds. As a result, the detection rates ranged from 80 to 95% at distances from 50 to 10 m in the controlled environment, and 94 % in the uncontrolled environment. The superiority of the developed system to the existing video image and loop detector-based systems lies in its instantaneous detection capability with less than 2 s.