• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.74-83
• /
• 2000

There is a rapid increase in the use of digital video information in recent years. Especially, user requires the environment which retrieves video from passive access to active access, to be more efficiently. we need to implement video retrieval system including video parsing, clustering, and browsing to satisfy user's requirement. In this paper, we first divide video sequence to shots which are primary unit for automatic indexing, using a hybrid method with mixing histogram method and pixel-based method. After the shot boundaries are detected, corresponding key frames can be extracted. Key frames are very important portion because they help to understand overall contents of video. In this paper, we first analyze camera operation in video and then select different number of key frames depend on shot complexity. At last, we compose panorama images from shots which are containing panning or tilting in order to provide more useful and understandable browsing environment to users.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.1
• /
• pp.29-34
• /
• 2012

Wireless multicast service can be used for video streaming service to save the network resources by sending the same popular multimedia contents to a group of users at once. For better multimedia streaming multicast service, we propose a quality-aware rate adaptation (QARA) scheme for scalable video multicast in rate adaptive wireless networks. In QARA, transmission rate is determined depending on the content's type and users' channel conditions. First, the base layer is transmitted by a low rate for high reliability. That means we provide basic service quality to all users. On the contrary, the transmission rate for enhancement layer is adapted by using channel condition feedback from a randomly selected node. So, the enhancement layer frames in a multimedia content is sent with various transmission rates. Therefore, each node can be provided with differentiated quality services. Consequently, QARA is capable of serving heterogeneous population of mobile nodes. Moreover, it can utilize network resources more efficiently. Our simulation results show that QARA outperforms utilization of the available transmission rate and reduces the data transmission time.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.4
• /
• pp.30-37
• /
• 2014

The Electronic Toll Collection System based on Free-Flow Multi-Lane is needed to solve some yearly problems such as traffic congestion, safety accident, maintenance by hold-up of one way hi-pass system. The hi-pass communication system is first-in, first-out method in one way environment so, it can't handle various running patterns such as vehicle platoon, switching lane and passing in multi-lane environment. In this thesis we compared and analyzed the communication system of foreign countries ETCS operating system and domestic hi-pass communication system, then studied communication system which can run in multiple-way accepting existing hi-pass OBU. And we formed the communication system of Free-Flow Multi-Lane environment as a plan using incoherent of IR antenna and coherent of RF antenna. The communication system in Free-Flow Multi-Lane environment can be used not alone in parking garages but in expressways of ETCS and toll roads from now on.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.57-64
• /
• 2019

In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K = 1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.6
• /
• pp.99-107
• /
• 2020

In this paper, we analyze the characteristics of mobile cache, which is used to improve the data access speed when executing applications on mobile devices, and verify the importance of mobile cache through a cache data access experiment. The mobile device market has grown at a fast pace over the past decade; however, battery limitations and size, price considerations restrict the usage of fast hardware. Thus, their performance are supplemented by using a memory buffer structure such as the cache memory. The analysis mainly focuses on cache size, hierarchical structure of cache, cache replacement policy, and the effect these features has on mobile performance. For the experimental data, we applied a data set from a microprocessor system study, originally used to test the cache performance. In the experimental results, the average data access speed on a mobile device showed a performance improvement of up to 10 times with the presence of cache memory than without. Accordingly, the cache memory was helpful for the performance improvement of a mobile device when the specifications were identical.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.99-104
• /
• 2021

Blockchain technology is a distributed ledger technology that shares the ledger between multiple nodes connected to a distributed network. The data managed through the existing central server is managed through the blockchain, and the transparency, accuracy, and integrity of the transaction data is increased, and the need for data management through the blockchain is increasing. In this paper, recognizing the need for trust-based data sharing between trust-based institutions in the financial industry, this paper describes the process of selecting leader nodes in Raft, a private blockchain consensus algorithm, as a way to increase data management efficiency through blockchain. A modified consensus algorithm is presented. The performance of the modified consensus algorithm and the general Raft consensus algorithm presented in this paper was compared and analyzed based on the transaction processing time, and it was confirmed that the efficiency of the consensus process was increased by applying the proposed consensus algorithm.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.345-351
• /
• 2018

This study was conducted to explain the capacity building policy of local public officials. Especially, it is to derive the policy task that can increase the efficiency within the limit of limited resources. The results of the study are as follows. First, local government officials' job management was the most important policy task in the largest framework to strengthen the capacity of local public officials. Next, the evaluation was in the order of recruitment management of local public officials and personnel management of local public officials. Second, the results of the evaluation of detailed policies. Among the local government officials 'job management, the introduction of the local government officials' rest period was evaluated as the most important. Regarding recruitment management of local public officials, reform of the public official exam courses was evaluated as the most important. In the personnel management of the local public officials, the job training of the elected officials was the most important. The results of this study will help to explain the policy development for strengthening the capacity of local public officials in realistic aspect. In order to strengthen the capacity of local public servants in future, it is necessary to analyze the measurement variables more.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.404-407
• /
• 2014

Delay Tolerant Network (DTN) is a networking architecture that is designed to solve network problem in unstable and stressed environments using the Store-Carry-Forward method. Different form general networks, DTN does not guarantee the end-to-end connectivity, it is hard for the exiting TCP/IP based protocols to normally work due to the characteristic such as large latency and unstable link connectivity. And the condition that send massage without the information of the destination occurs frequently. Thus, suitable routing protocols for DTN are required and being researched. In this paper, we propose a novel routing protocol for DTN utilizing epidemic and prediction based algorithm to prevent the defect of previously DTN routing protocols such as the absence of the holistic view of the network. Proposed algorithm predicted destination using the mobility information recorded in neighbor node's history and utilize epidemic based algorithm when occurred condition without destination's information. This algorithm is enhanced in terms of delivery ratio, decreases latency and overhead in sparse network such as DTN.

• Convergence Security Journal
• /
• v.18 no.5_1
• /
• pp.53-58
• /
• 2018

MANET transmits data by hop-by-hop method because it is composed of mobile nodes without support of any infrastructure. Its structure is very similar to a block chain. However, it is exposed to various threats such as data tampering or destruction by malicious nodes because of transmission method. So, ensuring the integrity of transmitted data is an important complement to MANET. In this paper, we propose a method to apply the block chain technique in order to protect the reliability value of the nodes consisting the network from malicious nodes. For this, hierarchical structure of a cluster type is used. Only cluster head stores the reliability information of the nodes in a block and then, this can be spread. In addition, we applied block generation difficulty automatic setting technique using the number of nodes selecting cluster head and the reliability of cluster head to prevent the spread of wrong blocks. This can prevent block generation and spread by malicious nodes. The superior performance of the proposed technique can be verified by comparing experiments with the SAODV technique.

• Korean Journal of Legislative Studies
• /
• v.24 no.2
• /
• pp.101-134
• /
• 2018

This study examines the effects of members' legislative performance on their renominations in the $19^{th}$ Korean National Assembly. We measure how many bills each member has proposed and passed in the Assembly. In addition, we also include rate of passing bills as an indicator of legislative performance. Particularly, we analyze 320 members in total, and 270 members who got in on the competition for nomination separately. The empirical findings of our study show that, firstly, among the total members in the Assembly, as they propose bills more and pass bills fewer, they are more likely to be renominated in the very next election. However, this is a result of different types of members rather than legislative performance. Secondly, among the members who actually competed for renomination, the legislative performance of members can not affect their renomination. Therefore, we argue that it is necessary to stipulate nominations criteria and transform top-down nomination method to bottom-up one in order to raise responsiveness and enhance representative democracy.