• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.4
• /
• pp.355-374
• /
• 2008

This paper reports a case study in which Saracevic and Kantor's derived taxonomy of library services was applied to qualitative data gathered from sixteen university library users. Using face-to-face interview method, we collected user responses related to the reasons of using services, aspects of interaction, and results of using services. Specific codes from the taxonomy were applied to the verbal expressions. The results show that library services are being used for a variety of purposes and that this approach enables us to effectively capture and classify service value expressed in users' own words. The taxonomy is evaluated to be quite comprehensive and scalable.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.254-260
• /
• 2005

In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.89-97
• /
• 2008

Recently, many organizations such as companies or institutions have demanded induction of very large-scale workflow management system in order to process a large number of business-instances. Workflow-related vendors have focused on physical extension of workflow engines based on device-level clustering, so as to provide very large-scale workflow services. Performance improvement of workflow engine by simple physical-connection among computer systems which don't consider logical-level software architecture lead to wastes of time and cost for construction of very large-scale workflow service environment. In this paper, we propose methodology for performance improvement based on logical software architectures of workflow engine. We also evaluate scalable performance between workflow engines using the activity instance based architecture and workcase based architecture, our proposed architecture. Through analysis of this test's result, we can observe that software architectures to be applied on a workflow engine have an effect on scalable performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.131-136
• /
• 2007

Ad hoc networks enable efficient resource aggregation in decentralized manner, and are inherently scalable and fault-tolerant since they do not depend on any centralized authority. However, lack of a centralized authority prompts many security-related challenges. Moreover, the dynamic topology change in which network nodes frequently join and leave adds a further complication in designing effective and efficient security mechanism. Security services for ad hoc networks need to be provided in a scalable and fault-tolerant manner while allowing for membership change of network nodes. In this paper, we investigate distributed certification mechanisms using a threshold cryptography in a way that the functions of a CA(Certification Authority) are distributed into the network nodes themselves and certain number of nodes jointly issue public key certificates to future joining nodes. In the process, we summarize one interesting report [5] in which the recently proposed RSA-based ad hoc signature scheme, called URSA, contains unfortunate yet serious security flaws. We then propose new scheme by fixing their security flaws.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.179-187
• /
• 2008

In this paper, we proposed the qualify metric based on SVC and the subjective quality. The proposed quality metric is for a general purpose. It means we can use it for any video sequences regardless of its temporal and spatial characteristics. The Quality of Service(QoS) is one of the important issues in heterogeneous environment which has diverse restrictions such as limited network bandwidth and limited display resolution. Scalable Video Coding(SVC) is the efficient video coding skill in heterogeneous environment. Because SVC can be adapted to various quality bitstreams using three scalabilities(spatial, temporal, and SNR) from one bitstream which has full scalability. To maximize the QoS in this environment, we should consider the subjective quality which is the viewer response. And also we should consider temporal and spatial characteristics of video sequence because the subjective quality is affected by temporal and spatial characteristics of video sequence. To verify the efficiency of the proposed method, we perform subjective assessments. The experimental results show that the proposed method has high correlation with subjective quality. The proposed method can be a decision tool of SVC birstream extraction.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.177-180
• /
• 2008

최근 유/무선 통신망과 접속 기술의 발달로 사용자들은 다양한 네트워크로의 접근이 가능하게 되었다. 하지만 이러한 여러 종류의 접속 기술은 접속 기술간 서비스 이동에 따른 이동성 보장이 서로 독립적이기 때문에 핸드오버 시 부가적인 지연이 발생하는 문제가 있다. 또한 다른 접속 서비스로의 비디오 전송 시 QoS 보장이 어려운 문제점이 있다. 따라서 본 논문에서 IEEE 802.21 Media Independent Handover 정보 서비스를 이용하여 네트워크 접속망에서 스케일러블 비디오 코딩 전송 방법을 제안한다. 이는 MIH Function에서 각 단말기에 대한 데이터 전송률과 QoS 정보를 MIH 정보 서버로부터 얻어 비디오 스케일링 레이어를 결정한다. 이렇게 결정된 스케일링 레이어를 이용하여 스케일러블 비디오 코딩을 수행한 후, 각각의 단말기에게 비디오를 전송하게 된다. 이러한 새로운 스케일러블 비디오 전송 모델은 서로 다른 여러 종류의 해상도, 화질, 프레임 전송률을 갖는 영상을 다양한 네트워크의 다양한 디바이스로 적응적인 비디오 전송이 가능하다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06d
• /
• pp.95-99
• /
• 2007

오버레이 멀티캐스트는 응용 계층을 기반으로 멀티캐스트 트리를 구성함으로써 서비스 보급을 위한 비용 소모를 최소화하고 확장성 있는 일대다 통신 구조를 지원한다. 그러나 이를 이동망에 적용하기 위해서는 이동성 지원 메커니즘과 패킷 손실 및 패킷 중복 수신 방지 기능을 함께 지원하는 오버레이 멀티캐스트 기법이 요구된다. 본 논문에서는 이를 해결하기 위하여 오버레이 멀티캐스트 기법인 mRMCP를 제안한다. 이 기법은 응용 계층 기반의 Advertisement 기능을 이용하여 하위계층의 지원 없이 단말의 이동성을 지원한다. 또한 중계기와 단말 간 데이터 전송 시 독립적인 멀티캐스트 채널을 활용함으로써 패킷 중복 수신을 최소화한다. 이와 같은 기능을 통해 mRMCP는 이동 환경에서 확장성 있는 멀티캐스트 서비스를 제공한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.02a
• /
• pp.159-162
• /
• 2008

이 연구는 Ka대역 위성방송 서비스를 제공할 때 발생하는 강우감쇠문제를 해결하기 위하여 MPEG-4 SVC 신호를 이용하는 방안에 대하여 고찰하였다. Ka대역 위성방송시스템은 DVB-S2 VCM 모드를 고려하였으며, JSCC (Joint Source Channel Coding) 기법을 이용하여, SVC신호를 Ka대역 위성방송시스템에 적용하였다. SVC신호는 Spatial Scalability, SNR Scalability 및 Temporal Scalability로 구분되어서, PSNR값의 변화에 따른 비트율 변화정도를 분석하였다. 비트율 변화율이 가장 큰 Spatial Scalability를 적용한 SVC신호가 Ka대역 위성방송서비스의 강우감쇠 문제를 해결하기 위한 방안으로 제안되었으며, 이에 대한 분석이 수행되었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.166-168
• /
• 2018

다양한 분야에서 홀로그램을 서비스하기 위해 다양한 수신 환경을 반영한 전송기술이 필요하다. 따라서 프레넬릿 변환을 이용한 홀로그램을 위한 스케일러블 코딩 기법을 제안한다. 또한 프레넬릿 필터의 특성을 분석하여 각 서브밴드별 중요도 및 서비스된 서브밴드의 수에 따른 복원된 홀로그램을 분석하였다. 분석 결과, 주로 좋지 못한 수신환경에 서비스되는 응용분야에서는 (3,1)이중직교 필터를 이용하는 것이 유리하며, 반대의 경우 (5,5)필터를 이용하는 것이 유리하다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.368-376
• /
• 2009

Over recent years, the development of multimedia devices has meant that a wider multimedia streaming service can be supported, and there are now many ways in which TV channels can communicate with different terminals. Generally, scalable video streaming is known to provide more efficient channel capacity than simulcast video streaming. Simulcast video streaming requires a large network bandwidth for all resolutions, but scalable video streaming needs only one flow for all resolutions. On the contrary, to preserve the same video quality, SVC(Sealable Video Coding) needs a higher bit-rate than AVC(non-layered Video Coding) due to the coding penalty($10%{\sim}30%$). In previous research, scalable video streaming has been compared with simulcast video streaming for network channel capacity, in two-user simulation environments. The simulation results show that the channel capacity of SVC is $16{\sim}20%$ smaller than AVC, but scalable video streaming is not efficient because of the limit of the present network framework. In this paper, we propose a new network framework with a new router using EDE(Extraction Decision Engine) and SVC Extractor to improve network performance. In addition, we compare the SVC environment in the proposed framework with previous research on the same way subject. The proposed network framework shows a channel capacity 50%(maximum) lower than that found in previous research studies.