• Publications of The Korean Astronomical Society
• /
• v.28 no.3
• /
• pp.65-73
• /
• 2013

We have developed a data integration system for ground-based space weather facilities in Korea Astronomy and Space Science Institute (KASI). The data integration system is necessary to analyze and use ground-based space weather data efficiently, and consists of a server system and data monitoring systems. The server system consists of servers such as data acquisition server or web server, and storage. The data monitoring systems include data collecting and processing applications and data display monitors. With the data integration system we operate the Space Weather Monitoring Lab (SWML) where real-time space weather data are displayed and our ground-based observing facilities are monitored. We expect that this data integration system will be used for the highly efficient processing and analysis of the current and future space weather data at KASI.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1229-1240
• /
• 1998

In this paper, we provide a design of DAVIC VOD service system with proxy servers which perform caching of video streams. Proxy servers are placed between a service provider system and service consumer systems. They provide video services to consumers on behalf of the service provider, therefore they reduce the loads of service providers and network. The operation of a proxy server depends on whether the requested program is in its storage. If this is the case, the prosy servere takes all the controls, but if the proxy does not have the program, it forwards the service request the proxy server takes all the controls, but if the prosy does not have the program, it forwards the service request to a service provider. While the service provider system provides the program to the consumer, the proxy copies and caches the program. The proxy server executes cache replacement, if necessary. We show by simultion that the LFU is the most efficiency caching replacement algorithm among the typical algorithms such as LRU, LFU, FIFO.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1428-1434
• /
• 2006

In this paper, we propose the scheme solving privacy infringement in RFID systems with improving the scalability of back-end server. With RFID/USN becoming important subject, many approaches have been proposed and applied. However, limits of RFID, low computation power and storage, make the protection of privacy difficult. The Hash Chain scheme has been known as one guaranteeing forward security, confidentiality and indistinguishability. In spite of that, it is a problem that requires much of computation to identify tags in Back-End server. In this paper, we introduce an efficient key search method, the Hellman Method, to reduce computing complexity in Back-End server. Hellman Method algorism progresses pre-computation and (re)search. In this paper, after applying Hellman Method to Hash chain theory, We compared Preservation and key reference to analyze and apply to parallel With guaranteeing requistes of security for existing privacy protecting Comparing key reference reduced computation time of server to reduce computation complex from O(m) to $O(\frac{m{^2/3}}{w})$ than the existing form.

• The Journal of the Korean dental association
• /
• v.43 no.1 s.428
• /
• pp.41-52
• /
• 2005

Information Technology has extended its scope to the medical field as well as dental field. Like medical field, network ststem for dental field requires acquisition, storage, and display of images. However, unlike the medical field, the system to integrate several information including medical images has not been developed according to industrial standard for management of digital image for medical use, so called DICOM conformance. which makes the digital environment in dental field more and more difficult and expensive for this standardization and comfortable communication in LAN and WAN. To solve this problem, the DICOM encoder and server has to be developed because the DICOM file can be easily retrieved with patient's information from the DICOM server in the system as DICOM file has the standard specification to integrate the patient's information. The information including image and other discrete data can be easily integrated in DICOM file and can be used without any difficulty for precise diagnosis and for contribution to the decision making for each treatment protocol. Therefore, the system composed of DICOM encoder and server in dental practive for DICOM file must be developed with prudent consideration of the several strategic factors: I) Enhanced diagnostic capability through the integrated information of image and clinical data. ii) Clinician-friendly interface to simulate the systemic treatment procedure in clinical practice iii) Implementation of multidisciplinary treatment protocol The development of DICOM encoder and server based on these strategic considerations will provide paperless and filmless hospital environments by the seamless integration and management of patient's history, several clinical data and clinical images through image processing for quantitative analysis. The system also allows clinicians to provide more predictable dental care for the patients.

• Journal of Digital Convergence
• /
• v.13 no.9
• /
• pp.287-295
• /
• 2015

The IPTV service has to be converted into an unified media format that fits for a variety of terminal equipments in terms of the bulk high-capacity media contents, and is spending a lot of time in the conversion time of contents including the process of collecting the media contents and extracting the information for conversion. In order to solve the problem, this paper designed the database in accordance with the automatic collection of time, and proposed a system that could increase the productivity of the contents through the automation process of the entire process using the media server and the transcoder. The media server collected contents and extracted information automatically with respect to the contents servers placed in specific locations and the media files of the storage whereas the transcoder conducted the automatic upload of the converted results to a specific server through the process of automatic conversion. As a result, the various convergence through compared to existing conversion method could minimized unnecessary waste of time.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.145-152
• /
• 2012

Due to the large sizes of streaming media, previous delivery techniques are not providing optimal performance. For this purpose, video proxy server is employed for reducing the bandwidth consumption, network congestion, and network traffic. This paper proposes a fast distributed network file system using state transition model in the media streaming system for efficient utilization of video proxy server. The proposed method is composed of three steps: step 1. Training process using state transition model, step 2. base and decision probability generation, and step 3. storing and deletion based on probability. In addition, storage space of video proxy server is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, the proposed method provides the lowest user start-up latency and the highest bandwidth saving significantly.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.533-540
• /
• 2002

We can buy products everywhere from Web-based shopping mall using desktop, cellular phone or PDA. To guarantee the various services for different equipment, shopping mail systems should allow a lot of different size or quality of images to provide a good service to their customers. Despite of same product image, each shopping mall saves the image in its storage space individually. Furthermore, all the product images in each shopping mall are stored as images of different quality. It may waste resources of shopping mail server and bring us developmental overhead. It is difficult to update all the images for product that is used by distributed e-catalog in everywhere. In this paper, we extended the proposed Web Image Server (WIS) for sharing one image with all clients and processing Image dynamically, so that we strengthened the function of managing shopping mall as a client of WIS and added the function of recording clients'log file and image catalog for shopping mall. We measured the response time from WIS and conventional e-Commerce site using by WAS which is one of the stress test tools for Web application. Furthermore, we measured WIS responses image requests in reasonable time when the current user is increased.

• Journal of Convergence for Information Technology
• /
• v.9 no.1
• /
• pp.19-27
• /
• 2019

In recent years, with the advancement of IT technology, we expect data size of the world to increase 10 times in 2025. The rapid development of this Internet technology leads to the downsizing of the server system of the data center which manages and operates the data, the capacity of the storage medium, and the power consumption of the data center. In this paper, we propose an energy conservation policy and analyze it in real time by analyzing the power consumption pattern of the server system of the data center. The proposed system can monitor and analyze the power consumption pattern of the individual server system in the data center, and it can be expected that about 10% of the total power consumption of the data center will be saved by efficiently managing the actual operation time of the server system.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.83-93
• /
• 2012

HTML5 has developed not to have browser dependancy considering interoperability as same as maintaining compatability with lower versions of HTML. HTML5, the newest web standardization is on going of being structured. Along with the smart phone boom, HTML5 is spotlighted because it can be applied to cross platforms in mobile web environments. Specially the local Storage that has been listed in new features in HTML5 supports offline function for web application that enables web application to be run even when the mobile is not connected to 3G or wifi. With Local storage, development of server-independent web application can be possible. However Local storage stores plaintext data in it without applying any security measure and this makes the plaintext data dangerous to security threats that are already exist in other client side storages like Cookie. In the paper we propose secure Local storage methods to offer a safe way to store and retrieve data in Local storage guaranteeing its performance. Suggested functions in this paper follow localStorage standard API and use a module that provide cryptographic function. We also prove the efficiency of suggested secure Local storage based on its performance evaluation with implementation.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.199-206
• /
• 2011

Removable Storage provides the excellent portability with light weight and small size which fits in one's hand, many users have recently turned attention to the high-capacity products. However, due to the easy of portability for Removable Storage, Removable Storage are frequently lost and stolen and then many problems have been occurred such as the leaking of private information to the public. The advent of remote storage services where data is stored throughout the network, has allowed an increasing number of users to access data. The main data of many users is stored together on remote storage, but this has the problem of disclosure by an unethical administrator or attacker. To solve this problem, the encryption of data stored on the server has become necessary, and a searchable encryption system is needed for efficient retrieval of encrypted data. However, the existing searchable encryption system has the problem of low efficiency of document insert/delete operations and multi-keyword search. In this paper, an efficient searchable encryption system is proposed.