• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.10
• /
• pp.1874-1881
• /
• 2010

A recursive linear stochastic error compensation algorithm is newly proposed for target localization in sensor network which provides range difference of arrival(RDOA) measurements. Target localization with RDOA is a well-known nonlinear estimation problem. Since it can not solve with a closed-form solution, the numerical methods sensitive to initial guess are often used before. As an alternative solution, a pseudo-linear estimation scheme has been used but the auto-correlation of measurement noise still causes unacceptable estimation errors under low SNR conditions. To overcome these problems, a stochastic error compensation method is applied for the target localization problem under the assumption that a priori stochastic information of RDOA measurement noise is available. Apart from the existing methods, the proposed linear target localization scheme can recursively compute the target position estimate which converges to true position in probability. In addition, it is remarked that the suggested algorithm has a structural reconciliation with the existing one such as linear correction least squares(LCLS) estimator. Through the computer simulations, it is demonstrated that the proposed method shows better performance than the LCLS method and guarantees fast and reliable convergence characteristic compared to the nonlinear method.

• Computers and Concrete
• /
• v.18 no.6
• /
• pp.1065-1082
• /
• 2016

The main aim of this study is to predict the compressive and flexural strengths of self-compacting mortar (SCM) containing $nano-SiO_2$, $nano-Fe_2O_3$ and nano-CuO using wavelet-based weighted least squares-support vector machines (WLS-SVM) approach which is called WWLS-SVM. The WWLS-SVM regression model is a relatively new metamodel has been successfully introduced as an excellent machine learning algorithm to engineering problems and has yielded encouraging results. In order to achieve the aim of this study, first, the WLS-SVM and WWLS-SVM models are developed based on a database. In the database, nine variables which consist of cement, sand, NS, NF, NC, superplasticizer dosage, slump flow diameter and V-funnel flow time are considered as the input parameters of the models. The compressive and flexural strengths of SCM are also chosen as the output parameters of the models. Finally, a statistical analysis is performed to demonstrate the generality performance of the models for predicting the compressive and flexural strengths. The numerical results show that both of these metamodels have good performance in the desirable accuracy and applicability. Furthermore, by adopting these predicting metamodels, the considerable cost and time-consuming laboratory tests can be eliminated.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.131-142
• /
• 1991

The concept of criterion function is proposed as a framework for comparing the geometric and computational characteristics of various nonlinear programming approaches to linear programming such as the method of centers, Karmakar's algorithm and the gravitational method. Also, we discuss various computational issues involved in obtaining an efficient parallel implementation of these methods. Clearly, the most time consuming part in solving a linear programming problem is the direction finding procedure, where we obtain an improving direction. In most cases, finding an improving direction is equivalent to solving a simple optimization problem defined at the current feasible solution. Again, this simple optimization problem can be seen as a least squares problem, and the computational effort in solving the least squares problem is, in fact, same as the effort as in solving a system of linear equations. Hence, getting a solution to a system of linear equations fast is very important in solving a linear programming problem efficiently. For solving system of linear equations on parallel computing machines, an iterative method seems more adequate than direct methods. Therefore, we propose one possible strategy for getting an efficient parallel implementation of an iterative method for solving a system of equations and present the summary of computational experiment performed on transputer based parallel computing board installed on IBM PC.

• Communications of Mathematical Education
• /
• v.37 no.3
• /
• pp.467-482
• /
• 2023

In this paper, we present our new teaching and learning materials on gradient descent method, which is widely used in artificial intelligence, available for college mathematics. These materials provide a good explanation of gradient descent method at the level of college calculus, and the presented SageMath code can help students to solve minimization problems easily. And we introduce how to solve least squares problem using gradient descent method. This study can be helpful to instructors who teach various college-level mathematics subjects such as calculus, engineering mathematics, numerical analysis, and applied mathematics.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.3.2-3
• /
• 2003

We propose a method of surface extension method using several functions. Interpolation theory is well developed in curve and surface. But extrapolation theory is not well developed because it is not unique outside the useful domain. It requires continuous, first derivative, second derivative continuous extension for matching in NC(Numerical Control) machine. In the past, we generate data outside the useful area and refit those data using least squares method. this has some problems which have some errors within the useful area. We keep the useful area and extend the unuseful area by a function

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.753-758
• /
• 1988

In this paper, we propose a new method of designing a reduced-order controller for a linear discrete-time system. Firstly, we study a design problem for a two-degree-of-freedom control system with a feedforward controller. Secondly, in order to obtain a reduced-order controller, frequency-weighted least squares approximation problems are considered. Thirdly, we propose a synthesis procedure of a reduced-order controller. Finally, an example is given to illustrate the effectiveness of this proposed method.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.33-36
• /
• 1998

Most image restoration problems are ill-posed and need to e regularized. A difficult task in image regularization is to avoid smoothing of image edges. In this paper, were proposed an edge-preserving image restoration algorithm using block-based edge classification. In order to exploit the local image characteristics, we classify image blocks into edge and no-edge blocks. We then apply an adaptive constrained least squares (CLS) algorithm to eliminate noise around the edges. Experimental results demonstrate that the proposed algorithm can preserve image edges during the regularization process.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.28A no.9
• /
• pp.671-679
• /
• 1991

In adaptive antenna, several models are known according to a prior knowledge about jammer signal. Among those, Frost model with contraint is generally used however it has the problem that convergence speed is slow and that stability is not good. To improve such problems, this paper proposes constrained NLMS algorithm using LS method. In addition, the result obtained by applying this algorithm to Duvall antenna model is compared with that of Frost model.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.4
• /
• pp.895-903
• /
• 2011

A two dimensional version of LSQR iterative algorithm which takes advantages of working solely with the 2-dimensional arrays is developed and applied to the image deblurring problem. The efficiency of the method comparing to the Fourier-based LSQR method and the 2-D version CGLS algorithm methods proposed by Hanson ([4]) is analyzed.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.239-244
• /
• 2009

The gridless (or meshfree) methods, such as MPS, SPH, FPM an so forth, are feasible and robust for the problems with moving boundary and/or complicated boundary shapes, because these methods do not need to generate a grid system. In this study, a gridless solver, which is based on the combination of moving least square interpolations on a cloud of points with point collocation for evaluating the derivatives of governing equations, is presented for two-dimensional unsteady incompressible Navier-Stokes problem in the low Reynolds number. A MAC-type algorithm was adopted and the Poission equation for the pressure was solved by successively in the moving least square sense. Some weighing functions were tested in order to investigate the up-winding effect for the convection term. Some typical problems were solved by the presented solver for the validation and the results obtained were compared with analytic solutions and the numerical results by conventional CFD methods, such as FVM.