• Journal of the Korea Computer Industry Society
• /
• v.7 no.5
• /
• pp.513-520
• /
• 2006

In this paper, we propose a novel real-time frame-layer rate control algorithm using sliding window method for low bit rate video coding. The proposed rate control method performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. A new frame-layer rate-distortion model is derived, and a non-iterative optimization method is used for low computational complexity. In order to reduce the quality fluctuation, we use a sliding window scheme which does not require the pre-analysis process. Therefore, the proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performance than the existing TMN8 rate control method.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2011.10a
• /
• pp.171-177
• /
• 2011

In this paper, a square simply supported panel flutter have been considered at high supersonic flow by using coupled fluid-structure (FSI) analysis that based on time domain method. The Reynolds-Average Navier Stokes (RANS) equation with Spalart-Allmaras turbulent model were applied for unsteady flow problems of panel flutter. A fully implicit time marching schemed based on the Newmark direct integration method is used for calculating the coupled aeroelastic governing equations of it. In addition, the SOL 145 solver of MSC.NASTRAN was used to investigate flutter velocity based on PK-method of Piston theory. Our numerical results indicated that there is a good agreement result between Piston Theory in MSC.NASTRAN and coupled fluid-structure analysis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.5
• /
• pp.510-516
• /
• 2010

In this paper, a dynamic GTS allocation method of wireless control networks is proposed for the use of factory automation using IEEE 802.15.4 MAC protocol. A superframe of IEEE 802.15.4 is applied to the transmission method of real-time periodic I/O data of wireless control systems within the limited time in factory environment. The method is proposed for efficient transmission of real-time periodic I/O traffic. The simulation results show the average network utilization and available I/O node numbers could be increased by the proposed method.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.20-24
• /
• 2001

We propose the computation reduction method of real root method that is mainly used in the CELP(Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSF[1]. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. But, the important characteristic of LSF is that most of coefficients are occurred in specific frequency region. So, the searching frequency region is ordered by each coefficient's distribution. And coefficients are searched in ordered frequency region. Transformation time can be reduced by this method than the sequential searching method in frequency region. When we compare this proposed method with the conventional real root method, the experimental result is that the searching time was reduced about 46% in average.

• Nuclear Engineering and Technology
• /
• v.43 no.6
• /
• pp.531-546
• /
• 2011

The backward differentiation formula (BDF) method is applied to a three-dimensional reactor kinetics calculation for efficient yet accurate transient analysis with adaptive time step control. The coarse mesh finite difference (CMFD) formulation is used for an efficient implementation of the BDF method that does not require excessive memory to store old information from previous time steps. An iterative scheme to update the nodal coupling coefficients through higher order local nodal solutions is established in order to make it possible to store only node average fluxes of the previous five time points. An adaptive time step control method is derived using two order solutions, the fifth and the fourth order BDF solutions, which provide an estimate of the solution error at the current time point. The performance of the BDF- and CMFD-based spatial kinetics calculation and the adaptive time step control scheme is examined with the NEACRP control rod ejection and rod withdrawal benchmark problems. The accuracy is first assessed by comparing the BDF-based results with those of the Crank-Nicholson method with an exponential transform. The effectiveness of the adaptive time step control is then assessed in terms of the possible computing time reduction in producing sufficiently accurate solutions that meet the desired solution fidelity.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.284-286
• /
• 2009

In this paper, we consider a cognitive radio system operating as secondary user. It uses an empty channel that is not currently used by primary users having the license to the channel. In the previous works, secondary user looks for an empty channel by choosing any channel in order or randomly and by sensing the channel to distinguish whether primary users are using. But if primary user is fixed type, we will find an empty channel faster than the mentioned channel selecting methods by using a method considering prior information about cases that primary user used the channel, since it is possible to analogize the channel access possibility of primary user according to regular time and position. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving throughput of secondary users. Firstly, we determine a weighting value of each channel based on the history of channel activities of primary users. This value is added to current channel state buffer and we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of the average channel searching time and the average number of transmissions of secondary user.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.461-468
• /
• 2018

Developers spend a significant amount of time exploring and trying to understand source code to find a source location to modify. To reduce such time, existing studies have recommended the source location using statistical language model techniques. However, in these techniques, the recommendation does not occur if input data does not exactly match with learned data. In this paper, we propose a code location recommendation method using Recurrent Neural Networks and interaction histories, which does not have the above problem of the existing techniques. Our method achieved an average precision of 91% and an average recall of 71%, thereby reducing time for searching and exploring code more than the existing recommendation techniques.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.768-773
• /
• 2004

This work deals with the synthesis of discrete-time nonlinear controller for input time-delay existing nonlinear system and proposes a new effective method to compensate the influence of input time-delay. The controller is synthesised by using input/output linearization. Under the circumstance that input time-delay exist, controller have to produce future value that will be needed for system. On account of this reason described, a weighted average predictor of combined states is adopted. Using the discretization via Euler method, numerical simulations about Van der Pol system are performed to evaluate performance of the proposed method.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.230-239
• /
• 2011

Dynamic memory allocators for real-time embedded systems need to fulfill three fundamental requirements: bounded worst-case execution time, fast average execution time, and minimal fragmentation. Since embedded systems generally run continuously during their whole lifetime, fragmentation is one of the most important factors in designing the memory allocator. This paper focuses on minimizing fragmentation while other requirements are still satisfied. To minimize fragmentation, a part of a memory region is segregated by the proposed budgeting method that exploits the memory profile of the given application. The budgeting method can be applied for any existing memory allocators. Experimental results show that the memory efficiency of allocators can be improved by up to 18.85% by using the budgeting method. Its worst-case execution time is analyzed to be bounded.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.293-297
• /
• 2007

This thesis suggests a new algorithm to detects multiple moving objects using a CMODE(Correct Multiple Object DEtection) method in the color images acquired in real-time and to track the interested pedestrian using motion and hue information. The multiple objects are detected, and then shaking trees or moving cars are removed using structural characteristics and shape information of the man , the interested pedestrian can be detected, The first similarity judgment for tracking an interested pedestrian is to use the distance between the previous interested pedestrian's centroid and the present pedestrian's centroid. For the area where the first similarity is detected, three feature points are calculated using k-mean algorithm, and the second similarity is judged and tracked using the average hue value for the $3{\times}3$ area of each feature point. The zooming of camera is adjusted to track an interested pedestrian at a long distance easily and the FOV(Field of View) of camera is adjusted in case the pedestrian is not situated in the fixed range of the screen. As a experiment results, comparing the suggested CMODE method with the labeling method, an average approach rate is one fourth of labeling method, and an average detecting time is faster three times than labeling method. Even in a complex background, such as the areas where trees are shaking or cars are moving, or the area of shadows, interested pedestrian detection is showed a high detection rate of average 96.5%. The tracking of an interested pedestrian is showed high tracking rate of average 95% using the information of situation and hue, and interested pedestrian can be tracked successively through a camera FOV and zooming adjustment.