• 한국광물학회지
• /
• 제16권1호
• /
• pp.65-73
• /
• 2003

이 연구에서는 X-선 회절법으로 측정한 수소결합의 거리를 보정하는 두 가지 방법을 제시하였다 O…O 거리가 2.5 $\AA$ 이상인 수소결합의 경우는 저온에서 측정한 중성자 회절에 의한 수소결합 데이터를 이용하여 얻은 최적화 곡선 식 d(O-H)=exp((2.173-d(O…O))/0.138)+0.958을 이용하여 수소결합 거리를 보정한다. O…O 거리가 2.5 $\AA$ 이하의 짧은 수소결합의 경우는 결합원자가 최적화 방법(valence-least-squares)을 이용하는 것이 효과적이다. X-선 회절분석으로 얻은 긴 O…O 거리를 갖는 분자간 수소결합의 경우는 수소결합의 거리보정을 해주어야 한다.

• Communications for Statistical Applications and Methods
• /
• 제24권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
• /
• 제7권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
• /
• 제29권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.

• 한국CDE학회논문집
• /
• 제17권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.

• 한국통신학회논문지
• /
• 제39C권1호
• /
• pp.9-16
• /
• 2014

본 논문에서는 이동객체의 위치인식 정확도 향상을 위하여 최소자승법을 적용한 이동객체 위치인식 보정 알고리즘을 제안하고, 성능을 분석하였다. 제안한 보정 알고리즘은 일정한 속도로 이동 중인 이동객체의 거리 값들을 TMVS (TWR Minimum Value Selection) 기법으로 측정 한 후, 이 값들을 사용하여 삼변측량법으로 이동객체의 위치를 측정하고, 최소자승법을 적용하여 위치인식 값을 보정한다. 실험결과, 시나리오 1 및 2에서 제안하는 보정알고리즘을 적용한 위치인식의 성능은 기존의 삼변측량법을 적16용한 위치인식의 성능에 비해 위치인식 정확도가 시나리오별 각각 58.84%, 40.28% 개선됨을 확인하였다.

• 한국정보통신학회논문지
• /
• 제24권2호
• /
• pp.219-224
• /
• 2020

이진 분류(binary classification)는 머신러닝(machine learning) 분야에서 많이 다루어진 주제이다. 게다가 이진 분류는 다중 분류로 쉽게 발전될 수 있는 중요한 분야이다. 머신러닝 방법들을 적용할 때에 전처리(preprocessing)이나 특징 추출(feature extraction)과 같은 작업이 필수적이다. 이는 분류기 성능을 향상시키기 위한 중요한 작업이다. 본 논문에서는 가중된 최소 자승법을 기반으로 새로운 머신러닝 방법을 제안한다. 또한, 특징 변환시킬 수 있는 새로운 가중치 계산 방법을 제안한다. 이를 통해 특징 변환과 동시에 학습을 진행할 수 있는 방법을 제안한다. 본 제안을 다섯 개의 머신러닝 데이터베이스에서 실험을 진행하였으며 이 데이터베이스에서 우수한 성능을 얻을 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권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
• /
• 제3권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.