• Journal of the Mineralogical Society of Korea
• /
• v.16 no.1
• /
• pp.65-73
• /
• 2003

In this study we have derived the two correction methods of hydrogen bonding distance. In case of the intermediate or long hydrogen bond(＞2.5 $\AA$), hydrogen bonding distances can be corrected by using the function d(O-H)=exp((2.173-d(O…O))/0.138)+0.958 obtained by least- squares fit to the data from the neutron diffraction at low temperatures. The valence-least-squares method is effective for the distance correction of very short hydrogen bond(<2.5 $\AA$). The distance correction is necessary for the long intermolecular hydrogen bond obtained from X-ray diffraction analysis.

• Communications for Statistical Applications and Methods
• /
• v.24 no.3
• /
• pp.317-324
• /
• 2017

An influence measure known as Cook's distance has been used for judging the influence of each observation on the least squares estimate of the parameter vector. The distance does not reflect the distributional property of the change in the least squares estimator of the regression coefficients due to case deletions: the distribution has a covariance matrix of rank one and thus it has a support set determined by a line in the multidimensional Euclidean space. As a result, the use of Cook's distance may fail to correctly provide information about influential observations, and we study some reasons for the failure. Three illustrative examples will be provided, in which the use of Cook's distance fails to give the right information about influential observations or it provides the right information about the most influential observation. We will seek some reasons for the wrong or right provision of information.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Journal of the Korean Statistical Society
• /
• v.29 no.3
• /
• pp.361-373
• /
• 2000

A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.4
• /
• pp.282-293
• /
• 2012

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.1
• /
• pp.9-16
• /
• 2014

The localization compensation algorithm for moving objects using the least-squares method is suggested and the performance of the algorithm is analyzed in this paper. The suggested compensation algorithm measures the distance values of the mobile object moving as a constant speed by the TMVS (TWR Minimum Value Selection) method, estimates the location of the mobile node by the trilateration scheme based on the values, and the estimated location is compensated using the least-squares method. By experiments, it is confirmed that the localization performance of the suggested compensation algorithm is largely improved to 58.84% and 40.28% compared with the conventional trilateration method in the scenario 1 and 2, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.2
• /
• pp.219-224
• /
• 2020

Binary classification has been broadly investigated in machine learning. In addition, binary classification can be easily extended to multi class problems. To successfully utilize machine learning methods for classification tasks, preprocessing and feature extraction steps are essential. These are important steps to improve their classification performances. In this paper, we propose a new learning method based on weighted least squares. In the weighted least squares, designing weights has a significant role. Due to this necessity, we also propose a new technique to obtain weights that can achieve feature transformation. Based on this weighting technique, we also propose a method to combine the learning and feature extraction processes together to perform both processes simultaneously in one step. The proposed method shows the promising performance on five UCI machine learning data sets.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.45-61
• /
• 2010

In the communication channel, the received signal is affected by many factors that can cause errors. These effects mean that received signal strength (RSS) based methods incur more errors in measuring distance and consequently result in low precision in the location detection process. As one of the approaches to overcome these problems, we propose using direction calibration to improve the performance of the RSS-based method for distance measurement, and sequentially a weighted least squares (WLS) method using reliability factors in conjunction with a conventional RSS weighting matrix is proposed to solve an over-determined localization process. The proposed scheme focuses on the features of the RSS method to improve the performance, and these effects are proved by the simulation results.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.37-49
• /
• 2004

We are interested in the problem of fitting a sphere to a set of data points in the three dimensional Euclidean space. In Spath [6] a descent algorithm already have been given to find the sphere of best fit in least squares sense of minimizing the orthogonal distances to the given data points. In this paper we present another new algorithm which computes a parametric represented sphere in order to minimize the sum of the squares of the distances to the given points. For any choice of initial approximations our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Smart Structures and Systems
• /
• v.3 no.2
• /
• pp.201-217
• /
• 2007

An active damage detection technique is introduced to locate damage in an isotropic plate using Lamb waves. This technique uses a time-domain energy model of Lamb waves in plates that the wave amplitude inversely decays with the propagation distance along a ray direction. Accordingly the damage localization is formulated as a least-squares problem to minimize an error function between the model and the measured data. An active sensing system with integrated actuators/sensors is controlled to excite/receive $A_0$ mode of Lamb waves in the plate. Scattered wave signals from the damage can be obtained by subtracting the baseline signal of the undamaged plate from the recorded signal of the damaged plate. In the experimental study, after collecting the scattered wave signals, a discrete wavelet transform (DWT) is employed to extract the first scattered wave pack from the damage, then an iterative method is derived to solve the least-squares problem for locating the damage. Since this method does not rely on time-of-flight but wave energy measurement, it is more robust, reliable, and noise-tolerant. Both numerical and experimental examples are performed to verify the efficiency and accuracy of the method, and the results demonstrate that the estimated damage position stably converges to the targeted damage.