• ETRI Journal
• /
• 제25권6호
• /
• pp.475-488
• /
• 2003

In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.

• 제어로봇시스템학회논문지
• /
• 제9권4호
• /
• pp.284-295
• /
• 2003

The servo tracks of disk drives are constructed at the time of manufacture with the equipment of servo track writer. Because of the imperfection of servo track writer, disk vibrations and head fluctuations during servo track writing process, the constructed servo tracks might deviate from perfect circles and take eccentric shapes. The servo track writing error should be corrected because it might cause interference with adjacent tracks and irrecoverable operation error of disk drives. The servo track writing error is repeated every disk rotation and so is periodic time function. In this paper, we propose a new correction algorithm of servo track writing error based on iterative teaming approach. Our correction algorithm can learn iteratively the servo track writing error as accurately as is desired. Furthermore, our algorithm is robust to system model errors, is computationally simple, and has fast convergence rate. In order to demonstrate the generality and practical use of our work, we present the convergence analysis of our correction algorithm and some simulation results.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(2)
• /
• pp.553-556
• /
• 2004

In this paper, we present a new efficient multi-level hardware/software partitioning algorithm for system-on-a-chip design. Originally the multi-level partitioning algorithm are proposed to enhance the performance of previous iterative improvement partitioning algorithm for large scale circuits. But when designing very complex and heterogeneous SoCs, the HW/SW partitioning decision needs to be made prior to refining the system description. In this paper, we present a new method, based on multi-level algorithm, which can cover SoC design. The different variants of algorithm are evaluated by a randomly generated test graph. The experimental results on test graphs show improvement average $9.85\%$ and $8.51\%$ in total communication costs over FM and CLIP respectively.

• 한국조명전기설비학회지:조명전기설비
• /
• 제1권1호
• /
• pp.61-66
• /
• 1987

이 연구는 주어진 소요배광을 만족시킬 수 있는 조명기구의 광학계의 설계를 다루고 있다. 지금까지 개인적인 경험과 직관에 의지하여 설계가 수행되었고 또한 기존의 CAD algorithm의 경우에도 반사면에서의 확산특성을 무시하였고 CPU time도 상당히 긴 편이었다. 이러한 한계점들을 극복하기 위하여 새로운 CAD algorithm을 제시하였다. 이 새로운 algorithm은 높은 효율과 적절한 조도분포를 제공하는 설계를 간편하고 바르게 수행할 수 있다.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.125-136
• /
• 2009

The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

• 한국멀티미디어학회논문지
• /
• 제6권4호
• /
• pp.610-619
• /
• 2003

This paper presents a concept of cellular automata and a modular exponentiation algorithm and implementation of a basic EIGamal encryption by using cellular automata. Nowadays most of modular exponentiation algorithms are implemented by a linear feedback shift register(LFSR), but its structure has disadvantage which is difficult to implement an operation scheme when the basis is changed frequently The proposed algorithm based on a cellular automata in this paper can overcome this shortcomings, and can be effectively applied to the modular exponentiation algorithm by using the characteristic of the parallelism and flexibility of cellular automata. We also propose a new fast multiplier algorithm using the normal basis representation. A new multiplier algorithm based on normal basis is quite fast than the conventional algorithms using standard basis. This application is also applicable to construct operational structures such as multiplication, exponentiation and inversion algorithm for EIGamal cryptosystem.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 전문대학교육위원 P
• /
• pp.43-51
• /
• 1999

The power flow calculations(PFc) are the most important and powerful tools in power systems engineering. The conventional power flow problem is solved generally with numerical methods such as Newton-Raphson(NR). The conventional numerical method generally have some convergency problem, which is sensitive to initial value, and numerical stability problem concerned with jacobian matrix inversion. This paper presents a new PFc algorithm based on the improved genetic algorithm (IGA) which can overcome the disadvantages mentioned above. The parameters of GA, with dynamical hierarchy of the coding system, are improved to make GA a practical algorithm in the problem of real system. Some case studies with test bus system also present to show the performance of proposed algorithm. The results of proposed algorithm are compared with the results of PFc obtained using a conventional NR method.

• 응용통계연구
• /
• 제22권6호
• /
• pp.1131-1142
• /
• 2009

We suggest a fast and accurate algorithm to compute ARLs of CUSUM chart for controling process variance. The algorithm solves the characteristic integral equations of CUSUM chart (for controling variance). The algorithm is directly applicable for the cases of odd sample sizes. When the sample size is even, by using well-known approximation algorithm combinedly with the new algorithm for neighboring odd sample sizes, we can also evaluate the ARLs of CUSUM charts efficiently and accurately. Based on the new algorithm we consider the optimal design of upward and downward CUSUM charts for controling process variance.

• The Journal of the Acoustical Society of Korea
• /
• 제25권3E호
• /
• pp.123-130
• /
• 2006

The adaptive echo canceller (AEC) has become an important component in speech communication systems, including mobile station. In these applications, the acoustic echo path has a long impulse response. We propose a running-average least mean square (RALMS) algorithm with a detection method for acoustic echo cancellation. Using colored input models, the result clearly shows that the RALMS detection algorithm has a convergence performance superior to the least mean square (LMS) detection algorithm alone. The computational complexity of the new RALMS algorithm is only slightly greater than that of the standard LMS detection algorithm but confers a major improvement in stability.

• 제어로봇시스템학회논문지
• /
• 제10권6호
• /
• pp.519-528
• /
• 2004

For reappearance of driving perception in a driving simulator, a washout algorithm is required. This algorithm can reappear the vehicle driving motions within workspace of the driving simulator. However classical washout algorithm contains several problems such as selection of order, cut-off frequency of filters, generation of wrong motion cues by characteristics of filters, etc. In order to overcome these problems, this paper proposes a new washout algorithm which gives more accurate sensations to drivers. The algorithm consists of an artificial inclination of the motion plate and human perception model with band pass filter and dead zone. As a result of this study, the motion of a real car could be reappeared satisfactorily in the driving simulator and the workspace of motion plate is restrained without scaling factor.