• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.53.1-53
• /
• 2002

$\textbullet$ Contents 1. Introduction $\textbullet$ Contents 2. Error Models of Navigation $\textbullet$ Contents 3. Observablity Properties of GPS/INS $\textbullet$ Contents 4. Measurement System for INS Error Estimation $\textbullet$ Contents 5. Numerical Simulation Results $\textbullet$ Contents 6. Conclusions

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.67-71
• /
• 1988

We present an algorithm that uses trajectory following errors to improve a feedforward command to a robot in the iterative manner. It has been shown that when the manipulator handles an unknown object, the P-type learning algorithm can make the trajectory converge to a desired path and also that the proposed learning control algorithm performs better than the other type learning control algorithm. A numerical simulation of a three degree of freedom manipulator such as PUMA-560 ROBOT has been performed to illustrate the effectiveness of the proposed learning algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.3
• /
• pp.252-261
• /
• 1988

Employed the new invese scattering scheme based on the moment mehtod, which was presented in the Part I of these companion papers, numerical simulations are performed to investigate the effect of measurement errors and noise contaminating the field scattered from dielectric objects. In order to reduce those effects on the reconstructed permittivity profiles, some techniques such as regularization, iterative matrix inversion, and multiple incidence are applied to this problem.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.23-37
• /
• 2011

In this paper, we use a modified Tikhonov regularization method to solve the Fredholm integral equation of the first kind. Under the assumption that measured data are contaminated with deterministic errors, we give two error estimates. The convergence rates can be obtained under the suitable choices of regularization parameters and the number of measured points. Some numerical experiments show that the proposed method is effective and stable.

• Journal of Mechanical Science and Technology
• /
• v.14 no.5
• /
• pp.490-498
• /
• 2000

The authors have proposed methods (lead crowning and profile modification) for modifying the geometry of spur gears and investigated the contact pattern as well as the transmission errors to recommend the appropriate amount of modification. Based on the investigation, dynamic load of the modified spur gear drive has been calculated, which is helpful to predict the life of the designed gear drive. Computer programs for simulation of meshing, contact and dynamics of the modified spur gears have been developed. The developed theory is illustrated with numerical examples.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.69-80
• /
• 1983

The purpose of this paper is to obtain representation of the mathematical special functions and the numerical values of the mean square errors for the quasi-ranges in random small smaples ($n \leq 30$) from the Weibull distribution with a shape and a scale parameters, and to estimate the scale parameter by use of unbiased estimator based on the quasi-range. It will be shown that the jackknife estimator of the range is worse than the range of random samples from the given distribution in the sense of the mean square error.

• Journal of the korean Society of Automotive Engineers
• /
• v.6 no.1
• /
• pp.71-77
• /
• 1984

Stress analysis of split ring with four different radius ratios under the compressive load is made by the photoelastic experiment and the numerical analysis through the FEM. The results of the two methods agreed well. Above results are also compared with those of the theoretical formula in order to confirm the range in which the formula of the curved bar is applied in connection with the radius ratio. The results of the two methods agreed well with those of the formula for the radius ratio, 3/2 and 9/7 within small errors of around 7% and 5% respectively.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1997.10a
• /
• pp.151-158
• /
• 1997

The main concern of numerical dynamic analysis of large structures is to find an acceptable solution with fewer mode shapes and less computational efforts. component mode method utilizes substructure technique to reduce the degrss of freedom but have a disadvantage to not consider the dynamic characteristics of loads. Ritz Vector method consider the load characteristics but requires many integrations and errors are accumulated. In this study, to prove the effectiveness of component mode method, Lanczos algorithm are introduced. To prove the effectiveness of this method, example structures areanalyzed and the results are compared with SAP90.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.61-72
• /
• 1990

In the past, a fundamental technique in inventory control system was to rank the items of a inventory from a distribution by value to draw an ABC curve. Unfortunately the use of ABC categorization technique has created problems and introduced some gross errors into the inventory control system. First, the author considers the possible applications of the technique in the real world and then attempts to discuss ABC fallacies through the literatures. Finally, an inventory categorization algorithm by the principal component analysis is derived and a numerical example is also presented to illustrate the algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.28-31
• /
• 1991

In this paper, it is proposed to improve the robustness of the Fast Recursive Least Squarea(FRLS) algolithms with the exponential weighting, which is an important class of algolithms for adaptive filtering. It is well known that the FRLSalgolithm is numerically unstable with exponential weighting factor λ<1. However, introducing some gains into this algolithms, numerical errors can be reduced. An accurately choice of thegains then leads to a numerically stable FRLS algolithm with a complexity of 8m mulitiplications and we shown it by computer simulations.