• 제어로봇시스템학회논문지
• /
• 제13권1호
• /
• pp.19-25
• /
• 2007

The MFC(Mass Flow Controller) is an equipment that measures and controls mass flow rates of fluid. Most of the HFC system is still using the PID algorithm. The PID algorithm shows superior performance on the MFC system. But the PID algorithm in the MFC system has a few problems as followed. The characteristic of the MFC system is changed according to the operating environment. And, when the piezo valve that uses the control valve is assembled in the MFC system, a coupling error is generated. Therefore, it is very difficult to find out the exact parameters of MFC system. In this paper, we propose adaptive PID algorithm in order to compensate these problems of a traditional PID algorithm. The adaptive PID algorithm estimates the parameters of MFC system using LMS(Least Mean Square) algorithm and calculates the coefficients of PID controller. Besides, adaptive PID algorithm shows better transient response because adaptive PID algorithm includes a feedforward. And we implement MFC system using proposed adaptive PID algorithm with self-tuning and Ziegler and Nickels's method. Finally, comparative analysis of the proposed adaptive PID and the traditional PID is shown.

• 제어로봇시스템학회논문지
• /
• 제12권8호
• /
• pp.746-751
• /
• 2006

In this paper, we present tracking algorithm for the indoor moving object. We research passive method using a camera and image processing. It had been researched to use dynamic based estimators, such as Kalman Filter, Extended Kalman Filter and Particle Filter for tracking moving object. These algorithm have a good performance on real-time tracking, but they have a limit. If the shape of object is changed or object is located on complex background, they will fail to track them. This problem will need the complicated image processing algorithm. Finally, a large algorithm is made from integration of dynamic based estimator and image processing algorithm. For eliminating this inefficiency problem, image based estimator, Mean-shift Algorithm is suggested. This algorithm is implemented by color histogram. In other words, it decide coordinate of object's center from using probability density of histogram in image. Although shape is changed, this is not disturbed by complex background and can track object. This paper shows the results in real camera system, and decides 3D coordinate using the data from mean-shift algorithm and relationship of real frame and camera frame.

• 산업경영시스템학회지
• /
• 제28권3호
• /
• pp.149-155
• /
• 2005

In this paper, we optimize simulation model of a manufacturing system using the real-coded genetic algorithm. Because the manufacturing system expressed by simulation model has stochastic process, the objective functions such as the throughput of a manufacturing system or the resource utilization are not optimized by simulation itself. So, in order to solve it, we apply optimization methods such as a genetic algorithm to simulation method. Especially, the genetic algorithm is known to more effective method than other methods to find global optimum, because the genetic algorithm uses entity pools to find the optimum. In this study, therefore, we apply the real-coded genetic algorithm to simulation optimization of a manufacturing system, which is known to more effective method than the binary-coded genetic algorithm when we optimize the constraint problems. We use the reproduction operator of the applied real-coded genetic algorithm as technique of the remainder stochastic sample with replacement and the crossover operator as the technique of simple crossover. Also, we use the mutation operator as the technique of the dynamic mutation that configures the searching area with generations.

• 공학논문집
• /
• 제1권1호
• /
• pp.49-57
• /
• 1997

본 논문에서는 Habermann의 deadlock 회피책에 대한 기존의 방안을 향상시킬 수 있는 방법을 고안하였다. 먼저 correction, efficiency, concurrency 측면에서 기존의 개선 방법들을 비교 분석한 다음, 대표적인 Kameda의 개선방안을 심도있게 논의한다. Dinic의 알고리듬을 채택한 Kamedia의 방법에서는 실행시간 O($mn^1.5$)이 요구되지만 Karzanov의 wave method를 응용하여 본고에서 제안한 faster algorithm에서는 실행시간 O($mn^1.5$)이 됨을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3455-3474
• /
• 2018

As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes Hamming weight by removing a stream of non-zero bits from the binary representation of positive integer. Thanks to this strong point, NAF has been used in various applications such as cryptography, packet filtering and so on. In this paper, to improve the NAF conversion speed of the $NAF_w$ algorithm, we propose a new NAF conversion algorithm, called w-bit Shifting Non-Adjacent Form($SNAF_w$), where w is width of scanning window. By skipping some unnecessary bit comparisons, the proposed algorithm improves the NAF conversion speed of the $NAF_w$ algorithm. To verify the excellence of the $SNAF_w$ algorithm, the $NAF_w$ algorithm and the $SNAF_w$ algorithm are implemented in the 8-bit microprocessor ATmega128. By measuring CPU cycle counter for the NAF conversion under various input patterns, we show that the $SNAF_2$ algorithm not only increases the NAF conversion speed by 24% on average but also reduces deviation in the NAF conversion time for each input pattern by 36%, compared to the $NAF_2$ algorithm. In addition, we show that $SNAF_w$ algorithm is always faster than $NAF_w$ algorithm, regardless of the size of w.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.163-171
• /
• 2013

본 논문은 할당 문제의 최적해를 간단히 찾을 수 있는 알고리즘을 제안하였다. 일반적으로 할당 문제의 최적해는 Hungarian 알고리즘으로 구한다. 제안된 알고리즘은 Hungarian 알고리즘의 4단계 수행 과정을 2단계로 단축시켰다. 첫 번째로, 행렬의 최소 비용을 선택하고 행과 열의 값을 삭제하는 과정을 거쳐 초기 할당을 수행하였다. 두 번째로 할당을 조정하는 과정을 수행하였다. 제안된 알고리즘을 27개의 균형 할당 문제와 7개의 불균형 할당 문제에 적용한 결과 Genetic 알고리즘으로 찾지 못한 최적해를 찾는데 성공하였다. 따라서 제안된 알고리즘은 Hungarian 알고리즘을 대체하여 일반적으로 적용할 수 있을 것이다.

• 한국정보통신학회논문지
• /
• 제19권9호
• /
• pp.2037-2043
• /
• 2015

본 논문에서는 제안한 알고리즘은 이전 유전 알고리즘의 분산처리를 위해 라우터 그룹 단위인 셀을 도입하였다. 셀 단위로 유전 알고리즘을 시행하여 전체 네트워크의 탐색 지연시간을 줄이는 방법을 제시하였다. 또한, 실험을 통하여 기존 최적경로 알고리즘인 Dijkstra 알고리즘에서 네트워크가 손상되었을 경우 제안한 알고리즘에는 대체 경로 설정의 연산시간이 단축되었으며 손상된 네트워크의 셀 안에서 2순위의 경로를 가지고 있으므로 Dijkstra 알고리즘보다 신속하게 대체경로를 설정하도록 설계되었다. 이는 제안한 알고리즘이 네트워크상에서 Dijkstra 알고리즘이 손상되었을 경우 대체 경로설정을 보완할 수 있음을 확인하였다.

• 한국컴퓨터정보학회논문지
• /
• 제12권2호
• /
• pp.131-139
• /
• 2007

본 논문에서는 다중해상도 알고리즘을 제안하여 탐색점과 복잡도를 블록정합 알고리즘과 비교하여 나타내었다. 또한 스피드 업을블록정합 알고리즘과 비교 하였다. 제안한 다중해상도 NTSS-3 Level 알고리즘을 비교대상인 TSS-3 Level 알고리즘과 NTSS 알고리즘에 비교하였다. 비교 결과 탐색점과 스피드업에서 제안한 NTSS-3 Level 알고리즘이 우수함을 나타내었다. 따라서 제안한 NTSS-3 Level 알고리즘이 비교 대상인 블록정합 알고리즘에 비해 탐색점에서 $2{\sim}3$배 우수한 성능을 나타내었고 복잡도 계산에서도 $2{\sim}4$배의 우수함을 나타내었다. 스피트업에서도 제안한 NTSS-3 Level 알고리즘이 2배 이상의 성능을 나타내었다. 따라서 제안한 다중해상도 NTSS-3 Level 알고리즘이 탐색점과 스피드 업 대비 PSNR 우수함을 나타내었다.

• ETRI Journal
• /
• 제18권2호
• /
• pp.53-60
• /
• 1996

Blind equalization is a technique for adaptive equalization of a communication channel without the aid of training sequences. This paper proposes a new blind equalization algorithm. The advantage of the new algorithm is that it has the lower residual error than the GA (proposed by Godard) and Sign_GA (proposed by Weerackody et al.). The superior performance of the proposed algorithm is illustrated for the 16-QAM signal constellation. A Rummler channel model is assumed as a transmission medium. The performance of the proposed algorithm is compared to the GA, Sign_GA and Stop & Go Algorithm (SGA). The simulation results demonstrate that an improvement in performance is achieved with the proposed equalization algorithm.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1993년도 춘계공동학술대회 발표논문 및 초록집; 계명대학교, 대구; 30 Apr.-1 May 1993
• /
• pp.343-352
• /
• 1993

In this study, a modified algorithm for the exchange heuristic is developed and applied to a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The exchange heuristkc is a multiple pass algorithm which makes improvements upon a given initial feasible schedule. Four different modified algorithms are proposed. The original algorithm and the new algorithms were compared through an experimental investigation. All the proposed algorithms reduce the maximum completion time much more effectively than the original algorithm. Especially, one of four proposed algorithms obviously outperforms the other three algorithms. The algorithm of the best performance produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time. However, in most situations, a reduction in schedule length means a significant reduction in the total cost.