• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.3
• /
• pp.117-124
• /
• 2013

In this paper we propose a TFRC(TCP Friendly Rate Control) which guarantees a minimum rate in order to improve the efficiency of the previous TFRC which cannot distinguish congestion losses and wireless losses and decreases throughput both in wired and wireless networks. This TFRC technique is able to guarantee a minimum rate for video by restricting a loss event rate with packet loss probability about existing TFRC and constraining a rate reduction from the feedback timeout. When we experimented both the existing TFRC and the new one with TCP in the same network, we found that the latter is better than the former. Consequently, it shows that the proposed TFRC can improve video streaming quality using a guaranteed minimum transmission rate.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.19 no.3
• /
• pp.515-522
• /
• 2024

Energy consumption is steadily increasing, and buildings in particular account for more than 20% of the total energy consumption around the world. As an effort to cost-effectively manage the energy consumption of buildings, many research groups have recently focused on Smart Building Energy Management Systems (BEMS), which are deepening the research depth by applying artificial intelligence(AI). In this paper, we propose a reinforcement learning-based energy control method for smart energy buildings integrated with V2G station, which aims to reduce the total energy cost of the building. The results of performance evaluation based on the energy consumption data measured in the real-world building shows that the proposed method can gradually reduce the total energy costs of the building as the learning process progresses.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1053-1068
• /
• 2003

In this paper, we propose a new scheduling method without timing covert channel of real-time transaction for secure database systems that implement mandatory access control. Our scheduling method use the wait queue based on security level to remove timing covert channel. And it use priority queue that consider transaction type, deadline, and weight. Therefore, the proposed scheduling method prevents timing covert channel because it is kept noninterference between transactions with different security level, and maximizes the sum of the weight of transactions that satisfy its deadline. The simulation results, is a comparison of traditional methods, show that our scheduling method is improved to 30%.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.67-73
• /
• 2014

Due to the development of the communication technology and the high-performance mobile device, the number of video streaming service user has been increasing. Video streaming services in the restricted network environments need error control to support users for the Ultra High Definition(UHD) video delivery. Packet-level FEC method was used to control the error for delay-sensitive video service, but it has a defect in huge occupation of network resources by redundant packets. In this paper, we proposed a packet-level FEC algorithm which maintains the video quality by previous FEC methods and also reduces the occupation of network resource in the restricted network environments. The proposed algorithm controls the redundant rate with using the delivery characteristic of the video coding technology, and improves the efficiency of network resources by reducing the traffic by around 33% in comparison with the previous FEC methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.172-183
• /
• 2010

Virtual memory systems (VM) reduce disk I/Os caused by page faults using page prefetching, which reads pages together with a desired page at a page fault in a single disk I/O. Operating systems including 4.4BSD attempt to prefetch as many pages as possible at a page fault regardless of page access patterns of applications. However, such an approach increases a disk access time taken to service a page fault when a high portion of the prefetched pages is not referenced. More seriously, the approach can cause the memory pollution, a problem that prefetched pages not to be accessed evict another pages that will be referenced soon. To solve these problems, we propose an adaptive page prefetching control scheme (APC), which periodically monitors access patterns of prefetched pages in a process unit. Such a pattern is represented as the ratio of referenced pages among prefetched ones before they are evicted from memory. Then APC uses the ratio to adjust the number of pages that 4.4BSD VM intends to prefetch at a page fault. Thus APC allows 4.4BSD VM to prefetch a proper number of pages to have a better effect on reducing disk I/Os, though page access patterns of an application vary in runtime. The experiment of our technique implemented in FreeBSD 6.2 shows that APC improves the execution times of SOR, SMM, and FFT benchmarks over 4.4BSD VM by up to 57%.

• Journal of IKEEE
• /
• v.16 no.3
• /
• pp.274-282
• /
• 2012

In this paper, we propose the design of lighting control algorithm for intelligent LED lighting system. The proposed lighting control algorithm transmitted to MCU through a data bus the environmental information detected from respectively sensor node. The MCU control software was designed to determine the level maintained to depending on the set control method by comparing the results that calculated the dimming level using a signal value. Also, it was designed to be lighting by cross-performed periodically the rotation and reverse method by created fully symmetrical pattern using the control algorithm to LED lighting device. In this paper, the proposed lighting control algorithm improved the reliability of the data sent by designed the system that can be controlled lighting to stable, and it was maintained the event delivery ratio of 91%. Also, the lighting device was decreased the luminous intensity of 32%, the power consumption of 49%, and heat generation of 32%. As a result, it were could be improved the energy efficiency that the life-cycle of LED has been increased 50%.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.102-105
• /
• 2019

본 논문에서는 심층 신경망 검색 방법을 사용하여 이미지 고해상도화를 위한 심층 신경망을 설계하는 방법을 구현하였다. 일반적으로 이미지 고해상도화, 잡음 제거 및 번짐 제거를 위한 심층신경망 구조는 사람이 설계하였다. 최근에는 이미지 분류 등 다른 영상처리 기법에서 사용하는 심층 신경망 구조를 검색하기 위한 방법이 연구되었다. 본 논문에서는 강화학습을 사용하여 이미지 고해상도화를 위한 심층 신경망 구조를 검색하는 방법을 제안하였다. 제안된 방법은 policy gradient 방법의 일종인 REINFORCE 알고리즘을 사용하여 심층 신경망 구조를 출력하여 주는 제어용 RNN(recurrent neural network)을 학습하고, 최종적으로 이미지 고해상도화를 잘 실현할 수 있는 심층 신경망 구조를 검색하여 설계하였다. 제안된 심층 신경망 구조를 사용하여 이미지 고해상도화를 구현하였고, 약 36.54dB 의 피크 신호 대비 잡음 비율(PSNR)을 가지는 것을 확인할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.307-314
• /
• 2003

In the general multiple video object coder, more interested objects such as speaker or moving object is consistently coded with higher priority. Since the priority of each object may not be fixed in the whole sequence and be variable on frame basis, it must be adjusted in a frame. In this paper, we analyze the independent rate control algorithm and global algorithm that the QP value is controled by the static parameters, object importance or priority, target PSNR, weighted distortion. The priority among static parameters is analyzed and adjusted into dynamic parameters according to the visual interests or importance obtained by camera interface. Target PSNR and weighted distortion are proportionally derived by using magnitude, motion, and distortion. We apply those parameters for the weighted distortion control and the priority-based control resulting in the efficient bit-rate distribution. As results of this paper, we achieved that fewer bits are allocated for video objects which has less importance and more bits for those which has higher visual importance. The duration of stability in the visual quality is reduced to less than 15 frames of the coded sequence. In the aspect of PSNR, the proposed scheme shows higher quality of more than 2d13 against the conventional schemes. Thus the coding scheme interfaced to human- eye proves an efficient video coder dealing with the multiple number of video objects.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.484-493
• /
• 2001

As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.115-121
• /
• 2010

It always must guarantee preceding process of the transaction with the higher priority in real-time database systems. The pessimistic concurrency control method resolves a conflict through aborting or blocking of a low priority transaction. However, if a high priority transaction is eliminated in a system because of its deadline missing, an unnecessary aborting or blocking of a low priority transaction is occurred. In this paper, the proposed method eliminates a transaction that is about to miss its deadline. And it prevents needless wastes of resources and eliminates unnecessary aborting or blocking of a low priority transaction. It is shown through the performance evaluation that the proposed method outperforms the existing methods in terms of the deadline missing ratio of transactions.