• ETRI Journal
• /
• v.31 no.2
• /
• pp.121-128
• /
• 2009

In this paper, we describe a fixed-threshold sequential minimal optimization (FSMO) for structured SVM problems. FSMO is conceptually simple, easy to implement, and faster than the standard support vector machine (SVM) training algorithms for structured SVM problems. Because FSMO uses the fact that the formulation of structured SVM has no bias (that is, the threshold b is fixed at zero), FSMO breaks down the quadratic programming (QP) problems of structured SVM into a series of smallest QP problems, each involving only one variable. By involving only one variable, FSMO is advantageous in that each QP sub-problem does not need subset selection. For the various test sets, FSMO is as accurate as an existing structured SVM implementation (SVM-Struct) but is much faster on large data sets. The training time of FSMO empirically scales between O(n) and O($n^{1.2}$), while SVM-Struct scales between O($n^{1.5}$) and O($n^{1.8}$).

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.161-166
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDA) for supporting natural and convenient data input. One of the most important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.16-28
• /
• 2000

In this paper, we implemented by describing a pipeline processor using a HDL in functional level, simulated and verified it's operation. When simulating a implemented processor. We first specify assembly instruction that is Performed in the processor. entered by programming using the instruction sets at the experimental framework. Thus, the procedure that is presented in this paper can easily identify and verify the purpose for implementation and operation of a system by using test vector. Also, it was possible that exactly simulate a system. The method was comfortable that document a system operation to implement.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.2
• /
• pp.170-177
• /
• 1993

In robotic arc welding, the roll (rotation) of the torch about its direction vector does not have any effect on the welding operation. Thus we could use this redundant degree of greedom for the motion control of the robot manipulator. This paper presents an algorithm for the pseudo- inverse kinematic motion control of the 6-axis robot, which utilizes the above mentioned redunancy. The prototype welding operation and the tool path are also graphically simulated. Since the proposed algorithm requires only the position and normal vector of the weldine as an input data, it is useful for the CAD-based off-line programming of the arc welding robot. In addition, it also has the advantages of the redundant manipulator motion control, like singularity avoidance and collision free motion planning, when compared with the other motion control method based on the direct inverse kinematics.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.211-218
• /
• 2003

Let H be a Hilbert space, X be a real Banach space, A : H \longrightarrow X be an operator with D(A) dense in H, G： H \longrightarrow H be positive definite, $\chi$ $\in$ D(A) and b $\in$ H. Consider the quadratic programming problem: QP： Minimize $\frac{1}{2}$〈p, $\chi$〉 + 〈$\chi$, G$\chi$〉 subject to A$\chi$= b In this paper, we obtain an explicit solution to the above problem using generalized inverses.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.120-128
• /
• 2010

In this paper, we describe a modified fixed-threshold sequential minimal optimization (FSMO) for 1-slack structural support vector machine (SVM) problems. Because the modified FSMO uses the fact that the formulation of 1-slack structural SVMs has no bias, it breaks down the quadratic programming (QP) problems of 1-slack structural SVMs into a series of smallest QP problems, each involving only one variable. For various test sets, the modified FSMO is as accurate as existing structural SVM implementations (n-slack and 1-slack SVM-struct) but is faster on large data sets.

• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.829-835
• /
• 2012

When the input features are generated by factors in a classification problem, it is more meaningful to identify important factors, rather than individual features. The $F_{\infty}$-norm support vector machine(SVM) has been developed to perform automatic factor selection in classification. However, the $F_{\infty}$-norm SVM may suffer from estimation inefficiency and model selection inconsistency because it applies the same amount of shrinkage to each factor without assessing its relative importance. To overcome such a limitation, we propose the adaptive $F_{\infty}$-norm ($AF_{\infty}$-norm) SVM, which penalizes the empirical hinge loss by the sum of the adaptively weighted factor-wise $L_{\infty}$-norm penalty. The $AF_{\infty}$-norm SVM computes the weights by the 2-norm SVM estimator and can be formulated as a linear programming(LP) problem which is similar to the one of the $F_{\infty}$-norm SVM. The simulation studies show that the proposed $AF_{\infty}$-norm SVM improves upon the $F_{\infty}$-norm SVM in terms of classification accuracy and factor selection performance.

• Structural Engineering and Mechanics
• /
• v.87 no.1
• /
• pp.19-28
• /
• 2023

This paper describes the experimental investigation of steel pallet rack beam-to-column connec-tions. Total behavior of moment-rotation (M-φ) curve and the effect of particular characteristics on the behavior of connection were studied and the associated load strain relationship and corre-sponding failure modes are presented. In this respect, an estimation of SPRBCCs moment and rotation are highly recommended in early stages of design and construction. In this study, a new approach based on Support Vector Machines (SVMs) coupled with discrete wavelet transform (DWT) is designed and adapted to estimate SPRBCCs moment and rotation according to four input parameters (column thickness, depth of connector and load, beam depth,). Results of SVM-WAVELET model was compared with genetic programming (GP) and artificial neural networks (ANNs) models. Following the results, SVM-WAVELET algorithm is helpful in order to enhance the accuracy compared to GP and ANN. It was conclusively observed that application of SVM-WAVELET is especially promising as an alternative approach to estimate the SPRBCCs moment and rotation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1765-1794
• /
• 2019

Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.177-188
• /
• 2022

The support vector machine (SVM) has been successfully applied to various classification areas with a high level of classification accuracy. However, it is infeasible to use the SVM in analyzing massive data because of its significant computational problems. When analyzing imbalanced data with different class sizes, furthermore, the classification accuracy of SVM in minority class may drop significantly because its classifier could be biased toward the majority class. To overcome such a problem, we propose the DOC-SVM method, which uses divide-oversampling and conquers techniques. The proposed DOC-SVM divides the majority class into a few subsets and applies an oversampling technique to the minority class in order to produce the balanced subsets. And then the DOC-SVM obtains the final classifier by aggregating all SVM classifiers obtained from the balanced subsets. Simulation studies are presented to demonstrate the satisfactory performance of the proposed method.