• 한국컴퓨터산업학회논문지
• /
• 제7권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.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2011년도 추계학술대회 논문집
• /
• 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.

• 제어로봇시스템학회논문지
• /
• 제16권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
• /
• 제20권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
• /
• 제43권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.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• 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.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제7권12호
• /
• pp.461-468
• /
• 2018

개발자들은 소프트웨어 개발과 유지보수 작업 중 하나의 코드를 수정하는데 들이는 시간보다 이를 위해 코드를 탐색하고 이해하는데 더 많은 시간을 소모한다. 코드를 탐색하는 시간을 줄이기 위하여 기존 연구들은 데이터 마이닝과 통계적 언어모델 기법을 이용하여 수정할 코드를 추천하여 왔다. 그러나 이 경우 모델의 학습 데이터와 입력되는 데이터가 정확하게 일치하지 않으면 추천이 발생하지 않는다. 이 논문에서 우리는 딥러닝의 기법 중 하나인 Recurrent Neural Networks에 동작기록을 학습시켜 기존 연구의 상기 문제점 없이 수정할 코드의 위치를 추천하는 방법을 제안한다. 제안 방법은 RNN과 동작기록을 활용한 추천 기법으로 평균 약 91%의 정확도와 71%의 재현율을 달성함으로써 기존의 추천방법보다 코드 탐색 시간을 더욱 줄일 수 있게 해 준다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 춘계학술대회
• /
• 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
• /
• 제33권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.293-297
• /
• 2007

본 논문에서는 실시간으로 획득된 칼라 영상에서 CMODE(Correct Multiple Object DEtection)방법을 이용하여 움직이는 다수 물체를 검출하고, 위치 정보와 색상 정보를 이용하여 관심 보행자만을 추적하는 새로운 알고리즘을 제안한다. 다수 물체가 검출되면, 사람의 구조적 특징과 형태 정보를 이용하여 나무의 흔들림이나 차량의 움직임은 제거하고 관심 보행자만을 검출한다. 검출된 관심 보행자 추적을 위한 1차 유사성 판단은 이전 관심 보행자의 무게중심과 현재 관심 보행자의 무게중심간의 거리차를 이용한다. 1차 유사성이 판단된 영역에 대하여 k-평균 알고리즘으로 세 개의 특징점을 구하고, 각 특징점의 $3{\times}3$ 영역에 대한 평균 색상값으로 2차 유사성을 판단하여 추적하도록 한다. 카메라 배율은 원거리의 보행자에 대한 추적을 용이하게 하기 위해서 조정하고, 카메라 시계(FOV: Field of View)는 보행자의 위치가 화면내의 일정 범위에 있지 않을 경우에 조정한다. 실험 결과, 제안한 CMODE 방법이 라벨링 방법보다 평균 접근 횟수가 1/4배정도 덜 접근하였으며, 평균 검출시간도 3배정도 빠르게 검출됨을 확인할 수 있었다. 나무의 흔들림으로 인한 영역이나 차량의 움직임 영역, 그림자 영역과 같이 복잡한 배경에서도 관심 보행자 검출은 평균 96.5%의 높은 검출률을 보였다. 관심 보행자 추적은 위치 정보와 색상 정보를 이용하여 평균 95%의 높은 추적률을 보였으며, 관심 보행자는 카메라 시계와 배율을 조정함으로써 연속적으로 추적할 수 있었다.