• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.97-114
• /
• 2022

Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.1-7
• /
• 2006

Linear stability analysis of 2-dimensional wall jet is conducted by using parabolized stability equation (PSE). Wall jet is found to be modelled well by boundary layer approximation except for the neighborhood of the nozzle exit, and the introduction of local similarity variable makes the streamwise basic flow Reynolds number independent. Stability characteristics of the wall jet obtained

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.05a
• /
• pp.141-146
• /
• 1999

A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.4
• /
• pp.603-611
• /
• 2003

In this paper we extend the definition of K-positive definite operators from linear to Frechet differentiable operators. Under this setting, we derive from the inverse function theorem a local existence and approximation results corresponding to those of Theorems land 2 of the authors [8], in an arbitrary real Banach space. Furthermore, an asymptotically K-positive definite operator is introduced and a simplified iteration sequence which converges to the unique solution of an asymptotically K-positive definite operator equation is constructed.

• Communications for Statistical Applications and Methods
• /
• v.24 no.6
• /
• pp.673-683
• /
• 2017

The least absolute shrinkage and selection operator (LASSO) has been a popular regression estimator with simultaneous variable selection. However, LASSO does not have the oracle property and its robust version is needed in the case of heavy-tailed errors or serious outliers. We propose a robust penalized regression estimator which provide a simultaneous variable selection and estimator. It is based on the rank regression and the non-convex penalty function, the smoothly clipped absolute deviation (SCAD) function which has the oracle property. The proposed method combines the robustness of the rank regression and the oracle property of the SCAD penalty. We develop an efficient algorithm to compute the proposed estimator that includes a SCAD estimate based on the local linear approximation and the tuning parameter of the penalty function. Our estimate can be obtained by the least absolute deviation method. We used an optimal tuning parameter based on the Bayesian information criterion and the cross validation method. Numerical simulation shows that the proposed estimator is robust and effective to analyze contaminated data.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.12 no.3
• /
• pp.397-406
• /
• 1999

A new solution procedure for approximate reanalysis, using the staged hybrid methods with substructuring, is proposed in this study. Displacements are calculated with two step mixed procedures. First step is to introduce the conservative approximation, which is a hybrid form of the linear and reciprocal approximation, as local approximation. In the next step, it is combined with the global approximation by reduced basis approach. Stresses are evaluated from the displacements by matrix transformation. The quality of reanalyzed quantities can be greatly improved through these staged hybrid approximations, specially for large changes in the design. Overall procedures are based on substructuring scheme. Several numerical examples illustrate the validity and effectiveness of the proposed methods.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.607-617
• /
• 2003

This paper offers a practical comparison of efficiency between local likelihood approach and conventional kernel approach in density estimation. The local likelihood estimation procedure maximizes a kernel smoothed log-likelihood function with respect to a polynomial approximation of the log likelihood function. We use two types of data driven bandwidths for each method and compare the mean integrated squares for several densities. Numerical results reveal that local log-linear approach with simple plug-in bandwidth shows better performance comparing to the standard kernel approach in heavy tailed distribution. For normal mixture density cases, standard kernel estimator with the bandwidth in Sheather and Jones(1991) dominates the others in moderately large sample size.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.249-256
• /
• 2002

A new optimization procedure with approximate reanalysis module, using the staged hybrid methods with substructuring, is proposed in is study. In this procedure, displacements are calculated with two step mixed procedures. First step is to introduce the conservative approximation, which is a hybrid form of the linear and reciprocal approximation, as local approximation. In the next step, it is combined with the global approximation by reduced basis approach. The quality of reanalyzed quantities can be greatly improved through these staged hybrid approximations, specially for large changes in the design. Overall procedures are based on substructuring scheme. Several numerical examples illustrate the validity and effectiveness of the proposed methods.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.419-424
• /
• 1999

In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.7
• /
• pp.1320-1326
• /
• 2010

In this paper, we develop a design methodology of granular-based neurocomputing networks realized with the aid of the clustering techniques. The objective of this paper is modeling and evaluation of approximation and generalization capability of the Linear-Type Superconducting Power Supply (LTSPS). In contrast with the plethora of existing approaches, here we promote a development strategy in which a topology of the network is predominantly based upon a collection of information granules formed on a basis of available experimental data. The underlying design tool guiding the development of the granular-based neurocomputing networks revolves around the Fuzzy C-Means (FCM) clustering method and the Radial Basis Function (RBF) neural network. In contrast to "standard" Radial Basis Function neural networks, the output neuron of the network exhibits a certain functional nature as its connections are realized as local linear whose location is determined by the membership values of the input space with the aid of FCM clustering. To modeling and evaluation of performance of the linear-type superconducting power supply using the proposed network, we describe a detailed characteristic of the proposed model using a well-known NASA software project data.