• The Journal of the Korea Contents Association
• /
• v.14 no.5
• /
• pp.411-424
• /
• 2014

This study tries to establish the evaluation standards of the service quality of local cultural festivals in an effort to identify public awareness of those festivals. Also, based on the importance-performance importance-performance analysis on the service quality, this research is aimed at finding ways to enhance service quality and to improve operation plans in more efficient ways for the maximization of visitors' use of festivals. Ultimately, the current study seeks to make a contribution to improving the quality of local cultural festivals. The results of the correspondence t-test analysis of importance and performance revealed that significant differences were found in following items of five factors; 1) in the responsiveness factor, the presence or absence of rest space, facility guide, communication, and installation of public restroom/cleanliness 2) in the certainty factor, food prices and staff members' kindness 3) in the reliability factor, all items including festival pamphlets (to the festival venue), guidance facilities/signposts, hospitality, schedule information, and quick responses 4) in the tangibility factor as well, all items such as the awareness of local culture, benefits, and storytelling 5) in the empathy factor, diversity of events and festival contents.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.613-620
• /
• 2016

This paper presents a MOHA(Many-Task Computing on Hadoop) framework which aims to effectively apply the Many-Task Computing(MTC) technologies originally developed for high-performance processing of many tasks, to the existing Big Data processing platform Hadoop. We present basic concepts, motivation, preliminary results of PoC based on distributed message queue, and future research directions of MOHA. MTC applications may have relatively low I/O requirements per task. However, a very large number of tasks should be efficiently processed with potentially heavy inter-communications based on files. Therefore, MTC applications can show another pattern of data-intensive workloads compared to existing Hadoop applications, typically based on relatively large data block sizes. Through an effective convergence of MTC and Big Data technologies, we can introduce a new MOHA framework which can support the large-scale scientific applications along with the Hadoop ecosystem, which is evolving into a multi-application platform.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.506-512
• /
• 2016

Recently, energy harvesting technology is considered as a tool to improve the lifetime of sensor networks by mitigating the battery capacity limitation problem. However, the previous work on energy harvesting has failed to provide practical information since it has assumed an ideal channel knowledge model with perfect channel state information at transmitter (CSIT). This paper proposes an energy efficient resource allocation scheme that takes account of the channel estimation process and the corresponding estimation error. Based on the optimization tools, we provide information on efficient scheduling and power allocation as the functions of channel estimation accuracy, harvested energy, and data rate. The simulation results confirm that the proposed scheme outperforms the conventional energy harvesting networks without considering channel estimation error in terms of energy efficiency. Furthermore, with taking account of channel estimation error, the results provides a new way for allocating resources and scheduling devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1017-1027
• /
• 2006

Recently, Internet service providers are offering triple play service which combines voice and video services with the existing high speed Internet service under the common network infrastructure of IP protocol, so that they can create more benefit from operating a single network architecture. In line with this movement in the convergence of network and services, in this work we propose a bandwidth dimensioning method for the subscriber network of the IP network at flow level. To that purpose, let us propose a series of bandwidth dimensioning methods: bandwidth for best effort service only, bandwidth dimensioning for premium services, and bandwidth dimensioning schemes for the premium Internet services as well as the best effort service which comprise the TPS. Our link dimensioning method is based on the flow level that incorporates the flow blocking probability as a measure of grade of services(GoS), and investigates the characteristics of the proposed methods via extensive numerical experiments. After that, let us carry out a simulation experiment concerning the delay and loss performance of the packet scheduling for the premium services (QoS) using the bandwidth designed by our proposed method, via which the packet level quality of service (QoS) for the proposed link dimensioning method can be observed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.157-165
• /
• 2013

In this paper, efficient digit-serial VLSI architecture for 1D (9,7) lifting-based discrete wavelet transform (DWT) filter has been proposed. The proposed architecture computes the DWT in digit basis, so that the required hardware is reduced. Also, the multiplication is replaced with the shift and add operation to minimize the hardware requirement. Bit allocation for input, output, and the internal data has been determined by analyzing the PSNR. We have carefully designed the data feedback latency not to degrade the performance in the recursive folded scheduling. The proposed digit-serial architecture requires small amount of hardware but achieve 100% of hardware utilization, so we try to optimize the tradeoffs between the hardware cost and the performance. The proposed architecture has been designed and verified by VerilogHDL and synthesized by Synopsys Design Compiler with a DongbuHitek $0.18{\mu}m$ STD cell library. The maximum operating frequency is 330MHz with 3,770 gates in equivalent two input NAND gates.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.35-41
• /
• 2017

To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1380-1386
• /
• 2004

Future communication networks would consist of wired and wireless access networks where there would be various types of traffic services. To meet the QoS requirements of those various traffic services simultaneously, new QoS control schemes are required. Since they are simple to deploy, cheep to manage, and easy to support subscriber mobility, wireless access networks are considered here. In this paper, a wireless joint buffer management and scheduling (W-JoBS) scheme, which is a modified version of the original JoBS algorithm at error-prone wireless access networks, is proposed. W-JoBS scheme is for providing service fairness among traffic classes with service compensation and channel-state dependent packet scheduling schemes. With computer simulation, this proposed W-JoBS scheme is evaluated and the performance of W-JoBS is compared with that of the original JoBS.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.493-505
• /
• 2016

Among modern computer vision and video surveillance systems, the pedestrian counting system is a one of important systems in terms of security, scheduling and advertising. In the field of, pedestrian counting remains a variety of challenges such as changes in illumination, partial occlusion, overlap and people detection. During pedestrian counting process, the biggest problem is occlusion effect in crowded environment. Occlusion and overlap must be resolved for accurate people counting. In this paper, we propose a novel pedestrian counting system which improves existing pedestrian tracking method. Unlike existing pedestrian tracking method, proposed method shows that average filter tracking method can improve tracking performance. Also proposed method improves tracking performance through frame compensation and outlier removal. At the same time, we keep various information of tracking objects. The proposed method improves counting accuracy and reduces error rate about S6 dataset and S7 dataset. Also our system provides real time detection at the rate of 80 fps.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.6
• /
• pp.59-68
• /
• 2002

In this paper, we design the two-dimensional Discrete Wavelet Transform (2D DWT) filter that is widely used in various applications such as image compression because it has no blocking effects and relatively high compression rate. The filter that we used here is two-channel four-taps QMF(Quadrature Mirror Filter) Lattice filter with PR (Perfect Reconstruction) property. The proposed DWT architecture, with two consecutive inputs shows an efficient performance with a minimum of such hardware resources as multipliers, adders, and registers due to a simple scheduling. The proposed architecture was verified by the RTL simulation, and utilizes the hardware 100%. Our architecture shows a relatively high performance with a minimum hardware when compared with other approaches. An efficient memory mapping and address generation techniques are introduced and the fixed-point arithmetic analysis for minimizing the PSNR degradation due to quantization is discussed.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.405-412
• /
• 2006

Real-time operating systems have been used in various computing environments, where a job must be completed in its deadline, with various conditions, such as effective scheduling policies, the minimum of an interrupt delay, and the solutions of priority inversion problems, that should be perfectly satisfied to design and develop optimal real-time operating systems. Up to now, in order to solve priority inversion problems among several those conditions. There have been two representative protocols: basic priority inheritance protocol and priority ceiling emulation protocol. However, these protocols cannot solve complicated priority inversion problems. In this paper, we design a protocol, called recursive priority inheritance (RPI), protocol that effectively solves the complicated priority inversion problems. Our proposed protocol is also implemented in the Linux kernel and is compared with other existing protocols in the aspect of qualitative analysis.