• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.185-195
• /
• 2010

In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.18-26
• /
• 2008

In this paper, dynamic GTS scheduling method based on IEEE 802.15.4 is proposed for wireless control system considering reliability and real-time property. The proposed methods can guarantee a transmission of real-time periodic and sporadic data within the limited time frame in factory environment. The superframe of IEEE 802.15.4 is used for the dynamic transmission method of real-time mixed traffic (periodic data, sporadic data, and non real-time message). By separating CFP and CAP properly, the periodic, sporadic, and non real-time messages are transmitted effectively and guarantee real-time transmission within a deadline. The simulation results show the improvement of real-time performance of periodic and sporadic data at the same time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.520-529
• /
• 2002

This paper presents an approach for scheduling network messages with real-time dynamic algorithms. We present the method that calculates an intermediate relative deadline of the message based on the EDF(Earliest Deadline First) scheduling policy. We adjust the slack of message by using this intermediate relative deadline to allocate a priority of message. The priority of the message can be determined accurately by using the slack that calculates in our approach, which increases the schedulability efficiency of the message. As a result, we reduce the worst-case response time and improve the guarantee ratio of real-time messages. Also, we describe the analysis method to check the schedulability on message sets, and show the efficiency of our approach by comparing the results of the DM(Deadline Monotonic) approach and the existing EDF approach with that of the improved EDF in our approach through the simulation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.96-101
• /
• 2014

Wind power is the fastest growing renewable energy source in the world and it is expected to remain so for some times. Recently, there is a constant need for the reduction of Operational and Maintenance(O&M) costs of Wind Energy Conversion Systems(WECS). The most efficient way of reducing O&M cost would be to utilize CMS(Condition Monitoring System) of WECS. CMS allows for early detection of the deterioration of the wind generator's health, facilitating a proactive action, minimizing downtime, and finally maximizing productivity. There are two types of faults such as mass unbalance and aerodynamic asymmetry which are related to wind turbine's rotor faults. Generally, these faults tend to generate various vibrations. Therefore, in this work a simple fault detection algorithm based on spectrums of vibration signals and simple max-min decision logic is proposed. Furthermore, in order to verify its feasibility, several simulation studies are carried out by using GH-bladed software.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.3
• /
• pp.129-138
• /
• 2003

A new methodology for selecting spatially variable model control parameter values through consideration of inference models within a Hydroinformatic system has been developed to overcome problems associated with determination of spatially variable control parameter values for both ungauged and gauged catchment. The adopted Hydroinformatic tools for determination of control parameter values were a GIS(Arc/Info) to handle spatial and non-spatial attribute information, the SWMM(stormwater management model) to simulate catchment response to hydrologic events, and lastly, L_BFGS_B(a limited memory quasi-Newton algorithm) to assist in the calibration process. As a result, high accuracy of control parameter estimation was obtained by considering the spatial variations of the control parameters based on landuse characteristics. Also, considerable time and effort necessary for estimating a large number of control parameters were reduced from the new calibration approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.1028-1037
• /
• 2011

Recently, Selim et al proposed public key cryptography based privacy preserving multi-context RFID authentication protocol. However Selim et al's proposed protocol not only doesn't fit into passive tag based RFID system because it uses public key based encryption algorithm to perform authentication between reader and tag, but also is insecure to an impersonation attack because it doesn't provide mutual authentication. In order to eliminate the above described efficiency problem and security vulnerabilities, this paper proposes a new multi-context RFID mutual authentication protocol that can prevent privacy invasion and tag impersonation attack through providing mutual authentication between single passive tag which is located different application space and readers which provide multi-context purposes and can secure against relay attack and denial-of-service attack. As a result, the proposed protocol performs secure mutual authentication based on the collected space and time information from the RFID reader and provides strong security and high computation efficiency because if performs secure one-way hash function and symmetric encryption operations suitable to the environments of passive RFID tags.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.987-999
• /
• 2014

A PUF is embedded and implemented into a tag or a device, and outputs a noise y with an input of x, based on its own unique physical characteristics. Although x is used multiple times as inputs of PUF, the PUF outputs slightly different noises, ($y_1,{\cdots}y_n$), and also the PUF has tamper-resistance property, hence it has been widely used in cryptographic protocol. In this paper, we study how to design a PUF-based RFID authentication protocol in a secure and an efficient way. Compared with recent schemes, the proposed scheme guarantees both authentication and privacy of backword/forward under the compromise of long-term secrets stored in tag. And also, the most cost and time-consumming procedure, key recovery algorithm used with PUF, has been desgined in the side of RFID reader, not in the tag, and, consequently, gives possibility to minimize costs for implementation and running time.

• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.365-373
• /
• 2023

Unmanned aerial vehicles are widely used in various fields, and real-time path replanning is a critical factor in enhancing the safety and efficiency of these devices. In this paper, we propose a real-time path replanning technique based on RRT* and LOSPO. The proposed technique first generates an initial path using the RRT* algorithm and then optimizes the path using LOSPO. Additionally, the optimized path can be converted into a trajectory that considers actual time and the dynamic limits of the aircraft. In this process, environmental changes and collision risks are detected in real-time, and the path is replanned as needed to maintain safe operation. This method has been verified through simulation-based experiments. The results of this paper make a significant contribution to the research on real-time path replanning for UAVs, and by applying this technique to various situations, the safety and efficiency of UAVs can be improved.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.36 no.1
• /
• pp.39-48
• /
• 2023

Because a railway bridge is designed over a long period of time and covers a large site, it involves various environmental factors and uncertainties. For this reason, design changes often occur, even if the design was thoroughly reviewed in the initial design stage. In particular, design changes of large-scale facilities, such as railway bridges, consume significant time and cost, and it is extremely inefficient to repeat all the procedures each time. In this study, a technique that can improve the efficiency of learning after design change was developed by utilizing the learning result before design change through transfer learning among deep-learning algorithms. For analysis, scenarios were created, and a database was built using a previously developed railway bridge deep-learning-based prediction system. The proposed method results in similar accuracy when learning only 1000 data points in the new domain compared with the 8000 data points used for learning in the old domain before the design change. Moreover, it was confirmed that it has a faster convergence speed.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.635-640
• /
• 2003

Due to the development of information technology and widespread use of telecommunications networks, the design of mesh-survivable net works has received considerable attention in recent years. This paper deals with spare capacity planning scheme in mesh-based fiber-optic networks. In this study, a new spare capacity planning scheme is proposed utilizing path restoration with maximal sharing of share capacity that is traced by the spare capacity incremental factor (after this, we called "SCIF"). We compare it with three other spare capacity planning scheme : link capacity of IP (Integer Programming), SLPA(Spare Link Placement Algorithm) and GA(Genetic Algorithm). The approach shows better performance with heuristics algorithm for determining the spare capacity assignment and the computational time is easily controlled allowing the approach to scale to large networks. The major advantages of the new approach are reduction of spare capacity and a polynomial time complexity.omplexity.