• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.12
• /
• pp.793-798
• /
• 2004

In this paper, the problem of adaptively identifying time-varying nonlinear systems is considered. For that purpose, the discrete time-varying Volterra series is employed as a system model, and the filtered weighted least squares (FWLS) algorithm, developed for adaptive identification of linear time-varying systems, is utilized for the adaptive identification of time-varying quadratic Volterra systems. To demonstrate the performance of the proposed approach, some simulation results are provided. Note that the FWLS algorithm, decomposing the conventional weighted basis function (WBF) algorithm into a cascade of two (i.e., estimation and filtering) procedures, leads to fast parameter tracking with low computational burden, and the proposed approach can be easily extended to the adaptive identification of time-varying higher-order Volterra systems.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.1
• /
• pp.227-235
• /
• 2017

When the spatial information of each location is given specifically as coordinates it is popular to use the geographically weighted regression to incorporate the spatial information by assuming that the regression parameters vary spatially across locations. In this paper, we relax the linearity assumption of geographically weighted regression and propose a geographically weighted least squares-support vector machine for estimating geographically weighted mean by using the basic concept of kernel machines. Generalized cross validation function is induced for the model selection. Numerical studies with real datasets have been conducted to compare the performance of proposed method with other methods for predicting geographically weighted mean.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.319-322
• /
• 1992

This paper proposes indirect adaptive pole placement adaptive controller using a modified least squares method. If an adaptive controller has good performance, it is necessary that an estimator have fast convergence. This paper presents a modified least squares method which guarantees the stability of estimator and has fast convergence. In this algorithm, information on signal level is obtained from the determinent of covariance matrix and according to it, weighting factor is tuned.

• Journal of Mechanical Science and Technology
• /
• v.17 no.7
• /
• pp.1026-1035
• /
• 2003

A computer simulation method for investigating the form generation mechanism in the centerless infeed (plunge) grinding process is described. For a 3-D simulation model of form generation, contact points are assumed to be on least squares contact lines at the grinding wheel, regulating wheel, and work-rest blade. Using force and deflection analyses, the validity of this assumption is shown. Based on the 2-D simulation model developed in the previous work and the least squares contact line assumption, a 3-D model is presented. To validate this model, simulation results were compared with the experimental works. The experiments and computer simulations were carried out using three types of cylindrical workpiece shapes with varying flat length. The experimental results agree well with the simulation. It can be seen that the effect of flat end propagated to the opposite end through workpiece reorientation.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.7
• /
• pp.3145-3149
• /
• 2014

Gene expression profiling facilitates the understanding of biological characteristics of gliomas. Previous studies mainly used regression/variance analysis without considering various background biological and environmental factors. The aim of this study was to investigate gene expression differences between grade III and IV gliomas through partial least squares (PLS) based analysis. The expression data set was from the Gene Expression Omnibus database. PLS based analysis was performed with the R statistical software. A total of 1,378 differentially expressed genes were identified. Survival analysis identified four pathways, including Prion diseases, colorectal cancer, CAMs, and PI3K-Akt signaling, which may be related with the prognosis of the patients. Network analysis identified two hub genes, ELAVL1 and FN1, which have been reported to be related with glioma previously. Our results provide new understanding of glioma pathogenesis and prognosis with the hope to offer theoretical support for future therapeutic studies.

• Journal of Mechanical Science and Technology
• /
• v.17 no.5
• /
• pp.698-707
• /
• 2003

A new quadratic response surface modeling method is presented. In this method, the incomplete small composite design (ISCD) is newly proposed to .educe the number of experimental runs than that of the SCD. Unlike the SCD, the proposed ISCD always gives a unique design assessed on the number of factors, although it may induce the rank-deficiency in the normal equation. Thus, the singular value decomposition (SVD) is employed to solve the normal equation. Then, the duality theory is used to newly develop the conservative least squares fitting (CONFIT) method. This can directly control the ever- or the under-estimation behavior of the approximate functions. Finally, the performance of CONFIT is numerically shown by comparing its'conservativeness with that of conventional fitting method. Also, optimizing one practical design problem numerically shows the effectiveness of the sequential approximate optimization (SAO) combined with the proposed ISCD and CONFIT.

• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.2
• /
• pp.108-108
• /
• 1996

This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.20 no.2
• /
• pp.40-47
• /
• 1996

This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1882-1887
• /
• 2003

The response surface method (RSM) became one of famous meta modeling techniques, however its approximation errors give designers several restrictions. Classical RSM uses the least squares method (LSM) to find the best fitting approximation models from the all given data. This paper discusses how to construct RSM efficiently and accurately using moving least squares method (MLSM) with sensitivity information. In this method, several parameters should be determined during the construction of RSM. Parametric study and optimization for these parameters are performed. Several difficulties during approximation processes are described and numerical examples are demonstrated to verify the efficiency of this method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.743-747
• /
• 2010

This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.