• Bulletin of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.29-53
• /
• 2001

This note presents a an indirect adaptive control scheme for first-order continuous-time systems. The estimated plant model is controllable and then the adaptive scheme is free from singularities. The singularities are avoided through a modification of the estimated plant parameter vector so that its associated Sylvester matrix is guaranteed to be nonsingular. That properties is achieved by ensuring that the absolute value of its determinant does not lie below a positive threshold. A modification scheme based on the achievement of a modified diagonally dominant Sylvester matrix of the parameter estimates is also given as an alternative method. This diagonal dominance is achieved through estimates modification as a way to guarantee the controllability of the modified estimated model when a controllability measure of the ‘a priori’ estimated model fails. In both schemes, the use of a hysteresis switching function for the modification of the estimates is not required to ensure the nonsingularity of the Sylvester matrix of the estimates.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.142-148
• /
• 1996

It is shown that a simple vector analysis method can provide beam cone shapes for laser bemas non-paraxially input to dielectric boundaries with inclination. Acceptance coen shapes for angled-endface fibers are calculated by the method. Beam cone shapes inside InP substrates are also calculated by the method for the coupling of an optical fiber and an InP-based photodiode using a Si v-groove. The effectiveness and errors of the recently suggested matrix method for inclined boundaries are also studied.

• Journal of Environmental Science International
• /
• v.25 no.4
• /
• pp.603-613
• /
• 2016

Fog may have a significant impact on road conditions. In an attempt to improve fog predictability in Jeju, we conducted machine learning with various data mining techniques such as tree models, conditional inference tree, random forest, multinomial logistic regression, neural network and support vector machine. To validate machine learning models, the results from the simulation was compared with the fog data observed over Jeju(184 ASOS site) and Gosan(185 ASOS site). Predictive rates proposed by six data mining methods are all above 92% at two regions. Additionally, we validated the performance of machine learning models with WRF (weather research and forecasting) model meteorological outputs. We found that it is still not good enough for operational fog forecast. According to the model assesment by metrics from confusion matrix, it can be seen that the fog prediction using neural network is the most effective method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2189-2196
• /
• 2016

This paper proposes a new finite control set-model predictive control (FCS-MPC) method for induction motors. In the method, the reference state that satisfies the given torque and rotor flux requirements is derived. Cost indices for the FCS-MPC are defined using the state tracking error, and a linear matrix inequality is formulated to obtain a proper weighting matrix for the state tracking error. The on-line procedure of the proposed FCS-MPC comprises of two steps: select the output voltage vector of the two level inverter minimizing the cost index and compute the optimal modulation factor of the minimizing output voltage vector in order to reduce the state tracking error and torque ripple. The steady state tracking error is removed by using an integrator to adjust the reference state. The simulation and experimental results demonstrated that the proposed FCS-MPC shows good torque, rotor flux control performances at different rotating speeds.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.32-41
• /
• 1990

This paper proposes a method of using image features in serving a robot manipulator. Specifically, the con-cept 'feature' is first mathematically defined and then differential relationship between the robot motion and feature vector is derived in terms of Feature Jacobian Matrix and its generalized inverse. Also, by using more features than the number of DOFs of the robot, the visual servoing performance is shown to be improv-ed. Via various examples, the method of feature-based servoing of a robot proposed in this paper is proved to be effective for conducting object-oriented robotic tasks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.248-251
• /
• 1999

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at i(oration n upon the arrival of new data. The RLS algorithm may be viewed as a special case of the Kalman filter. Indeed this special relationship between the RLS algorithm and the Kalman filter is considered. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. The resulting rate of convergence is therefore typically an order of magnitude faster than the simple LMS algorithm. This improvement in performance, however, Is achieved at the expensive of a large increase in computational complexity.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1302-1309
• /
• 2008

Traditional clustering methods, like k-means or fuzzy clustering, are prototype-based methods which are applicable only to convex clusters. On the other hand, spectral clustering tries to find clusters only using local similarity information. Its ability to handle concave clusters has gained the popularity recent years together with support vector machine (SVM) which is a kernel-based classification method. However, as is in SVM, the kernel width plays an important role and has a great impact on the result. Several methods are proposed to decide it automatically, it is still determined based on heuristics. In this paper, we proposed an adaptive method deciding the kernel width based on distance histogram. The proposed method is motivated by the fact that the affinity matrix should be formed into a block diagonal matrix to generate the best result. We use the tradition Euclidean distance together with the random walk distance, which make it possible to form a more apparent block diagonal affinity matrix. Experimental results show that the proposed method generates more clear block structured affinity matrix than the existing one does.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.523-538
• /
• 1999

A new preconditioning method is investigated to reduce the roundoff error in computing derivatives using Chebyshev col-location methods(CCM). Using this preconditioning causes ration of roundoff error of preconditioning method and CCm becomes small when N gets large. Also for accuracy enhancement of differentiation we use a domain decomposition approach. Error analysis shows that for this domain decomposition method error reduces proportional to the length of subintervals. Numerical results show that using domain decomposition and preconditioning simultaneously gives super accu-rate approximate values for first derivative of the function and good approximate values for moderately high derivatives.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.75-78
• /
• 1997

In this paper we present new sound spectral analysis methods or prosthetic heart valve sounds. Phonocardiograms(PCG) of prosthetic heart valve were analyzed in order to derive frequency domain feature suitable or the classification of the valve state. The fast orthogonal search method and MUSIC (MUltiple SIgnal Classification) method are described or finding the significant frequencies in PCG. The fast orthogonal search method is effective with short data records and cope with noisy, missing and unequally-spaced data. MUSIC method's key to the performance is the division of the information in the autocorrelation matrix or the data matrix into two vector subspaces, one a signal subspace and the other a noise subspace.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2092-2095
• /
• 2001

In this paper, the performance of a new alternative form of three-axis attitude estimation algorithm for a rigid body is evaluated via simulation for the situation where the observed vectors are the estimated baselines of a GPS antenna array. This method is derived based on a simple iterative nonlinear least-squares with four elements of quaternion parameter. The representation of quaternion parameters for three-axis attitude of a rigid body is free from singularity problem. The performance of the proposed algorithm is compared with other eight existing methods, such as, Transformation Method (TM), Vector Observation Method (VOM), TRIAD algorithm, two versions of QUaternion ESTimator (QUEST), Singular Value Decomposition (SVD) method, Fast Optimal Attitude Matrix (FOAM), Slower Optimal Matrix Algorithm (SOMA).