• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.261-262
• /
• 2007

This paper proposed a model algorithm control (MAC) method for trajectory tracking control of the differentially steeredwheeled mobile robots (WMRs) subject to nonholonomic constraint. The dynamic model of the wheeled mobile robot is presented and used as the model to be controlled. The performance of the proposed control algorithm is verified via computer simulations in which the WMR is controlled to track several different reference paths. It is shown that the control strategy is feasible.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.724-728
• /
• 1995

A new dynamic channel assignment (DCA) algorithm with rearrangement for cellular mobile communication systems is suggested. Our DCA algorithm is both traffic and interference adaptive, which is based on the mathematical formulation of the maximum packing under a realistic propagation model. In developing the algorithm, we adopt the Lagrangean relaxation technique that has been successfully used in the area of mathematical programming. Computational experiments of the algorithm reveal quite encouraging results. Although our algorithm primarily focuses on microcellular systems, it can be effectively applied to conventional cellular systems under highly nonuniform traffic distributions and interference conditions.

• Industrial Engineering and Management Systems
• /
• 제1권1호
• /
• pp.79-86
• /
• 2002

This paper proposes a new algorithm for estimating ARMA model parameters. In estimating ARMA model parameters, several methods such as generalized least square method, instrumental variable method have been developed. Among these methods, the utilization of a bootstrap type algorithm is known as one of the effective approach for the estimation, but there are cases that it does not converge. Hence, in this paper, making use of a cross correlation function and utilizing the relation of structural a priori knowledge, a new bootstrap algorithm is developed. By introducing theoretical relations, it became possible to remove terms, which is liable to include much noise. Therefore, this leads to robust parameter estimation. It is shown by numerical examples that using this algorithm, all simulation cases converge while only half cases succeeded with the previous one. As for the calculation time, judging from the fact that we got converged solutions, our proposed method is said to be superior as a whole.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2005년도 추계학술대회 논문집
• /
• pp.190-200
• /
• 2005

In this paper, the image modelling of road's lane markings is established using view frustum(VF) modeling. This algorithm also involve the real time processing of the 3D position coordinate and the distance data from the camera to the points on the 3D world coordinate by the camera calibration. In order to reduce their measurement error, an useful algorithm for which analyze the geometric variations clue to traveling vehicle's fluctuation using VF model is proposed. In experiments, without correction, for instance, the $0.4^{\circ}$ of pitching rotation gives the error of $0.4^{\sim}0.6m$ at the distance of 10m, but the more far distance cause exponentially the more error. We confirmed that this algorithm can be reduced less than 0.1m of error at the same condition.

• 대한전자공학회논문지TC
• /
• 제43권3호
• /
• pp.135-143
• /
• 2006

DiffServ망에서 많이 거론되고 있는 대표적인 스케줄러로 PQ(Priority Queue), WRR(Weighted Round Robin)등의 스케줄러가 연구되어져 있다. 그러나 이러한 스케줄러들은 장점을 가지고 있는 동시에 단점을 가지고 있다. 본 논문에서는 PQ와 WRR의 단점을 보완하면서 어떠한 스케줄링 방법에도 적용이 가능한 스케줄러 알고리즘을 제안한다. 본 논문에서 제안된 알고리즘은 DiffServ 망에서 퍼지 이론을 스케줄러에 적용하여 동적으로 가중치를 할당하는 알고리즘을 개발하였다. 따라서 퍼지이론을 통하여 퍼지 제어 규칙을 생성하여 유동적으로 각 클래스의 큐 상태를 체크하여 클래스가 가지고 있는 큐의 가중치를 효율적으로 할당하도록 하였다.

• Transactions on Electrical and Electronic Materials
• /
• 제6권2호
• /
• pp.63-66
• /
• 2005

Several ways for monitoring the soundness of ZnO lightning arresters have been suggested, and all of which are based on the measurement of leakage current since it is well known that the resistive leakage current is a main indicator of arrester deterioration. In this paper, we proposed an algorithm to measure the resistive leakage current, which is quite different from the conventional method that eliminates capacitive current from the total leakage current. The proposed algorithm is based on that the magnitudes of the resistive leakage current are equal at the same applied voltage levels. To confirm the reliability of the algorithm, we fabricated a leakage current detector and designed an analysis program. Experimental results showed that the method does not need a complex circuitry and is useful to analyze the resistive leakage current.

• ETRI Journal
• /
• 제28권4호
• /
• pp.435-443
• /
• 2006

This paper presents an efficient carrier recovery algorithm combined with a turbo-coding technique in a mobile communication system. By using a block turbo code made up of independently decodable block codes, we can efficiently recover the fast time-varying carrier phase as well as correct channel errors. Our simulation results reveal that the proposed scheme can accommodate mobiles with high speed, and at the same time can reduce the number of iterations to lock the phase.

• 한국의학물리학회:학술대회논문집
• /
• 한국의학물리학회 2002년도 Proceedings
• /
• pp.298-299
• /
• 2002

WERC (Wakasa Wan Energy Research Center) has started the proton cancer therapy since June 2002. We use Hitachi 3D treatment planning (version 1.6) that can calculate the proton dose distribution by use of the pencil beam algorithm as well as the broad beam algorithm practically fast. This treatment planning software satisfies almost functions required in the proton therapy and includes some advanced techniques such as the 3D region glowing function that can search the target region three-dimensionally based on the CT-values. In this paper, we will introduce this planning system and present our evaluation from point of view of both clinical usage and QA.

• 한국통신학회논문지
• /
• 제34권6C호
• /
• pp.649-655
• /
• 2009

평균 부호 획득 시간은 (mean acquisition time: MAT) 부호 획득 시스템의 성능을 나타내는 가장 중요한 지표이며, MAT가 짧을수록 부호 획득 시스템의 성능이 좋다고 일컬어진다. 광 부호 분할 다중 접속 (optical code division multiple access: O-CDMA) 시스템의 부호 획득을 위해 Keshavarzian과 Salehi가 제안한 multiple-shift (MS) 알고리즘은 부호 획득을 두 단계로 나누어 수행함으로써, 기존 serial-search (SS) 알고리즘에 비해 짧은 MAT를 제공한다. 본 논문에서는 효율적으로 결합된 로컬 신호와 그에 따른 상관값 및 부호를 이용하여 기존 MS 알고리즘에 비해 더 짧은 MAT를 제공할 수 있는 알고리즘을 제안한다. 또한, 모의실험을 통해 제안한 알고리즘이 기존 MS 알고리즘에 비해 더 짧은 MAT를 제공함을 보인다.

• Journal of Microbiology and Biotechnology
• /
• 제16권6호
• /
• pp.863-869
• /
• 2006

The behavior of submerged membrane bioreactor (SMBR) filtration systems utilizing rapid air backpulsing as a cleaning technique to remove reversible foulants was investigated using a genetic algorithm (GA). A customized genetic algorithm with suitable genetic operators was used to generate optimal time profiles. From experiments utilizing short and long periods of forward and reverse filtration, various experimental process parameters were determined. The GA indicated that the optimal values for the net flux fell between 263-270 LMH when the forward filtration time ($t_f$) was 30-37 s and the backward filtration time ($t_b$) was 0.19-0.27 s. The experimental data confirmed the optimal backpulse duration and frequency that maximized the net flux, which represented a four-fold improvement in 24-h backpulsing experiments compared with the absence of backpulsing. Consequently, the identification of a region of feasible parameters and nonlinear flux optimization were both successfully performed by the genetic algorithm, meaning the genetic algorithm-based optimization proved to be useful for solving SMBR flux optimization problems.