• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제9권1호
• /
• pp.55-61
• /
• 2005

A Conjugate Gradient algorithm for unconstrained minimization is proposed which is invariant to a nonlinear scaling of a strictly convex quadratic function and which generates mutually conjugate directions for extended quadratic functions. It is derived for inexact line searches and for general functions. It compares favourably in numerical tests (over eight test functions and dimensionality up to 1000) with the Dixon (1975) algorithm on which this new algorithm is based.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2011년도 정기 학술대회
• /
• pp.278-281
• /
• 2011

The global coordinates generated from Isomap algorithm provide a simple way to analyze and manipulate high dimensional observations in terms of their intrinsic nonlinear degrees of freedom. Thus, Isomap can find globally meaningful coordinates and nonlinear structure of complex data sets, while neither principal component analysis (PCA) nor multidimensional scaling (MDS) are successful in many cases. It is demonstrated that the adapted Isomap algorithm successfully enhances the quality of pattern classification for damage identification in various numerical examples.

• 산업경영시스템학회지
• /
• 제26권1호
• /
• pp.17-21
• /
• 2003

We study clustering algorithm for sequences of categorical values. Clustering is a data mining problem that has received significant attention by the database community. Traditional clustering algorithms deal with numerical or categorical data points. However, there exist many important databases that store categorical data sequences. In this paper, we introduce new similarity measure and develop a hierarchical clustering algorithm. An experimental section shows performance of the proposed approach.

• Journal of electromagnetic engineering and science
• /
• 제11권1호
• /
• pp.56-61
• /
• 2011

In this paper, we consider the topological derivative concept for developing a fast imaging algorithm of thin inclusions with dielectric contrast with respect to an embedding homogeneous domain with a smooth boundary. The topological derivative is evaluated by applying asymptotic expansion formulas in the presence of small, perfectly conducting cracks. Through the careful derivation, we can design a one-iteration imaging algorithm by solving an adjoint problem. Numerical experiments verify that this algorithm is fast, effective, and stable.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• pp.251-254
• /
• 2003

In this paper, we develop an effective method for estimating and predicting interference power strength using the IMM(Interacting Multiple Model) algorithm. Based on the proposed interference prediction algorithm, we adjust transmission power of mobile terminals to maintain a certain level of target signal - to - interference- plus -noise- ratio ( SINR ) at the base station. Results of numerical experiments are presented to show a performance profile of the proposed algorithm.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.365-375
• /
• 1996

We consider an extension of the multiple choice linear knapsack problem and develop a fast algorithm of order $O(r_{max}n^2)$ by exploiting some new properties, where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm has convenient structures for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.461-470
• /
• 2007

Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1131-1141
• /
• 2010

We develop an algorithm for computing a sparse approximate inverse for a nonsymmetric positive definite matrix based upon the FFAPINV algorithm. The sparse approximate inverse is computed in the factored form and used to work with some Krylov subspace methods. The preconditioner is breakdown free and, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Some numerical experiments are given to show the efficiency of the preconditioner.

• 산업경영시스템학회지
• /
• 제14권24호
• /
• pp.53-69
• /
• 1991

This paper is concerned with software developments for scheduling and sequencing of FMS. The scheduling algorithms are developed for 3 types of FMS:single machine type FMS, flowshop type FMS. assembly line type FMS. For the single machine type FMS. full enumeration algorithm is used. For the flowshop type FMS heuristic algorithms are developed. For the assembly type FMS the exsisting PERT/CPM algorithm is applied. Numerical examples are presented for illustration of each algorithm. Each soft ware program list are attached as appendices.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.519-527
• /
• 1995

By finding some new properties, we develop an O($r_{max}n^2$) algorithm for the generalized multiple choice linear knapsack problem where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm can easily be embedded in a branch-and-bound procedure due to its convenient structure for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.