• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.201-210
• /
• 2012

A modified multiplicative update algorithms is presented for computing the nearest correlation matrix. The convergence property is analyzed in details and a sufficient condition is given to guarantee that the proposed approach will not breakdown. A number of numerical experiments show that the modified multiplicative updating algorithm is efficient, and comparable with the existing algorithms.

• 대한전기학회논문지
• /
• 제39권10호
• /
• pp.1098-1107
• /
• 1990

Decentralized iterative learning control methods are presented for a class of large scale interconnected linear dynamic systems, in which iterative learning controller in each subsystem operates on its local subsystem exclusively with no exchange of information between subsystems. Suffcient conditions for convergence of the algorithms are given and numerical examples are illustrated to show the validity of the algorithms. In particular, the algorithms are useful for the systems having large uncertainty of inter-connected terms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.1106-1108
• /
• 1997

This paper presents a new approach on genetic algorithms to economic dispatch problem for valve point discontinuities. Proposed approach in this paper on genetic algorithms improves the performance to solve economic dispatch problem for valve point discontinuities through combination in penalty function with death penalty, generation-apart elitism, atavism and heuristic crossover. Numerical results on an actual utility system consisted of 13 thermal units show that the proposed approach is faster and robuster than classical genetic algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
• /
• pp.454-456
• /
• 1998

Traditional adaptive control algorithms are not robust to dynamic uncertainties. The adaptive control algorithms developed previously to deal with dynamic uncertainties do not facilitate quantitative design. We proposed a new robust adaptive control algorithms consists of an $H^{\infty}$ suboptimal control law and a robust parameter estimator. Numerical examples showing the effectiveness of the $H^{\infty}$ adaptive scheme are provided.

• 한국전자통신학회논문지
• /
• 제14권1호
• /
• pp.219-224
• /
• 2019

연도와 같은 수치 정보가 많은 교과목은 기억법의 적용이 필요하다. 수치 기억법은 점, 선, 막대 등과 같은 많은 방법들을 적용한 정보 이미지는 기억을 도와주는 기호의 역할을 한다. 뇌의 기억 구조는 수치만을 제공하기 보다는 추가 정보를 제공하는 것이 효율적이다. 이전 연구에서는 모바일 환경에 적합한 그래프 알고리즘이나 배열된 이미지 알고리즘을 제시했었다. 본 연구에서는 수치 정보가 많은 교과목을 선정하여 수치와 관련된 추가 정보를 원본 데이터와 연결하고자 한다. 모바일 환경에서 진행되는 특유의 과정을 제안하고, 의미 연결 수치 알고리즘을 구현 평가한다.

• Journal of the Korean Data and Information Science Society
• /
• 제16권4호
• /
• pp.769-780
• /
• 2005

Recently, the discretization algorithms for continuous data have been actively studied. But there are few articles to compare the efficiency of these algorithms. In this paper we introduce the principles of some binary discretization algorithms including C4.5, CART and QUEST and investigate the efficiency of these algorithms through numerical study. For various underlying distribution, we compare these algorithms in view of misclassification rate and MSE. Real data examples are also included.

• 대한기계학회논문집B
• /
• 제27권8호
• /
• pp.1122-1133
• /
• 2003

Numerical characteristics of implicit upwind schemes, such as upwind ADI, line Gauss-Seidel (LGS) and point Gauss-Seidel (LU) algorithms, for Navier-Stokes equations have been investigated. Time-derivative preconditioning method was applied for efficient convergence at low Mach/Reynolds number regime as well as at large grid aspect ratios. All the algorithms were expressed in approximate factorization form and von Neumann stability analysis was performed to identify stability characteristics of the above algorithms in the presence of high grid aspect ratios. Stability analysis showed that for high aspect ratio computations, the ADI and LGS algorithms showed efficient damping effect up to moderate aspect ratio if we adopt viscous preconditioning based on min-CFL/max-VNN time-step definition. The LU algorithm, on the other hand, showed serious deterioration in stability characteristics as the grid aspect ratio increases. Computations for several practical applications also verified these results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.923-926
• /
• 1992

ARMA fast Transversal filter(FTF) algorithm solves the extended least squres estimation problems in a very efficient way. But unfortunately, it exhibits a very unstable behavior, due to the accumulation of round-off errors. So, in this paper, two effective method to stabilize ARMA FTF algorithm is proposed. They are based on the analysis of the propagation of the numerical errors according to a first order linear model. The proposed methods modify the numerical properties of the variables responsible for the numerical instability, while proeserving the theoretical form of the algorithm. The proposed algorithms still have the nice complexity properties of the original algorithm, but have a much more stable brhavior.

• 경영과학
• /
• 제12권2호
• /
• pp.105-127
• /
• 1995

This paper solves different machine-part group formation (MPGF) problems using genetic algorithms to demonstrate that it can be a new robust alternative to the conventional heuristic approaches for optimization problems. We first give an overview of genetic algorithms: Its principle, various considerations required for its implementation, and the method for setting up parameter values are explained. Then, we describe the MPGF problem which are critical to the successful operation of cellular manufacturing or flexible manufacturing systems. We concentrate on three models of the MPGF problems whose forms of the objective function and/or constraints are quite different from each other. Finally, numerical examples of each of the models descibed above are solved by using genetic algorithms. The result shows that the solutions derived by genetic algorithms are comparable to those obtained through problem-specific heuristic methods.

• 경영과학
• /
• 제29권3호
• /
• pp.1-11
• /
• 2012

This paper considers a localization problem in time difference of arrival (TDOA)-based radio frequency identification (RFID) systems. To estimate the position of a target tag, this paper suggests three localization algorithms that use benchmark tags. The benchmark tags are the same type as the target tag, but either the locations or distance of the benchmark tags are known. Two algorithms use the benchmarks for auxiliary information to improve the estimation accuracy of the other localization algorithms such as least squared estimator (LSE). The other one utilizes the benchmarks as essential tags to estimate the location. Numerical tests show that the localization accuracy can be improved by using benchmark tags especially when an algorithm using the LSE is applied to the localization problem. Furthermore, this paper shows that our benchmark algorithm is valuable when the measurement noise is large.