• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• 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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• 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
• /
• v.1 no.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.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• 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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.135-143
• /
• 2006

PQ(Priority Queue) and WRR(Weighted Round Robin) are the most famous schedulers, however, these schedulers have both points of advantages and disadvantages. In this paper, we propose an algorithm that can be adopted in my kind of scheduling type with making up for weak points of PQ and WRR. The proposed algorithm includes a fuzzy theory in the scheduler to assign priorities dynamically in the DiffServ network. This algorithm produces the control discipline by the fuzzy theory to assign priorities of the Queue effectively with checking the Queue status of each class dynamically under the discipline.

• Transactions on Electrical and Electronic Materials
• /
• v.6 no.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
• /
• v.28 no.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.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.649-655
• /
• 2009

Mean acquisition time (MAT) is the most important performance measure for code acquisition systems, where a shorter MAT implies a better code acquisition performance. Keshavarzian and Salehi proposed the multiple-shift (MS) algorithm for code acquisition in optical code division multiple access (O-CDMA) systems. Performing two steps acquisition, the MS algorithm has a shorter MAT than that of the conventional serial-search (SS) algorithm. In this paper, we propose a rapid code acquisition algorithm for O-CDMA systems. By using an efficient combination of local signals, correlation value, and the sign of correlation value, the proposed algorithm can provide a shorter MAT compared with that of the MS algorithm. The simulation results show that the proposed algorithm presents a shorter MAT than that of the MS algorithm.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.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.