• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.296-300
• /
• 1997

Recently, the genetic algorithm has been applied to the various types of optimization problems and these attempts have very successfully. However, in most cases on these approaches, there is not given by investigator about to the theoritical analysis. The reason that the analysis of the dynamics for genetic algorithm is not clear, is the probablitic aspect of genetic algorithm. In this paper, we investigate the analysis of the internal dynamics for genetic algorithm using stochastic differential method. In addition, we provide a new genetic algorithm, based on the study of the convergence property for the genetic algorithm.

• 통합자연과학논문집
• /
• 제7권1호
• /
• pp.57-61
• /
• 2014

This study measured the stream data from the several sensors, and stores the database in MapReduce framework environment, and it aims to design system with the small performance and cluster analysis error rate through the KMSVM algorithm. Through the KM-SVM algorithm, the cluster analysis effective data was used for U-health system. In the results of experiment by using 2003 data sets obtained from 52 test subjects, the k-NN algorithm showed 79.29% cluster analysis accuracy, K-means algorithm showed 87.15 cluster analysis accuracy, and SVM algorithm showed 83.72%, KM-SVM showed 90.72%. As a result, the process speed and cluster analysis effective ratio of KM-SVM algorithm was better.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2000년도 봄 학술발표회논문집
• /
• pp.466-473
• /
• 2000

Optimality Criteria algorithm based on the derivation of reciprocal approximations has been applied to structural optimization of large-scale structures. However, required computational cost for the serial analysis algorithm of large-scale structures consisting of a large number of degrees of freedom and members is too high to be adopted in the solution process of O.C. algorithm Thus, parallel version of O.C. algorithm on the network of personal computers is presented in this Paper. Parallelism in O.C. algorithm may be classified into two regions such as analysis and optimizer part As the first step of development of parallel algorithm, parallel structural analysis algorithm is developed and used in O.C. algorithm The algorithm is applied to optimal design of a 54-story plane frame structure

• 경영과학
• /
• 제31권3호
• /
• pp.61-76
• /
• 2014

There are three methods for calculating the optimal level for spare part inventories in a MIME (Multi Indenture and Multi Echelon) system : marginal analysis, Lagrangian relaxation method, and genetic algorithm. However, their solutions are sub-optimal solutions because the MIME system is neither convex nor separable by items. To be more specific, SRUs (Shop Replaceable Units) are required to fix a defected LRU (Line Replaceable Unit) because one LRU consists of several SRUs. Therefore, the level of both SRU and LRU cannot be calculated independently. Based on the limitations of three existing methods, we proposes a improved algorithm applying marginal analysis on determining LRU stock level and genetic algorithm on determining SRU stock level. It can draw optimal combinations on LRUs through separating SRUs. More, genetic algorithm enables to extend the solution search space of a SRU which is restricted in marginal analysis applying greedy algorithm. In the numerical analysis, we compare the performance of three existing methods and the proposed algorithm. The research model guarantees better results than the existing analytical methods. More, the performance variation of the proposed method is relatively low, which means one execution is enough to get the better result.

• 한국지능시스템학회논문지
• /
• 제17권2호
• /
• pp.252-258
• /
• 2007

In this paper, a face recognition algorithm system using Principal Component Analysis (PCA) is proposed. The algorithm recognized a person by comparing characteristics (features) of the face to those of known individuals of Intelligent Control Laboratory (ICONL) face database. Simulations are carried out to investigate the algorithm recognition performance, which classified the face as a face or non-face and then classified it as known or unknown one. Particularly, a Principal Components of Linear Discriminant Analysis (PCA + LDA) face recognition algorithm is also proposed in order to confirm the recognition performances and the adaptability of a proposed PCA for a certain specific system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• pp.58-63
• /
• 1998

B.Widrow established fundamental relations between the least-mean-square (LMS) algorithm and the digital Fourier transform［1］. By extending these relations, we proposed the short time spectra analysis system using the LMS algorithm［2]. In that paper, we used the normal LMS algorithm on the thought of dealing with only real analytical signal. This algorithm minimizes the real mean-square by recursively altering the complex weight vector at each sampling instant. But, the short time spectra analysis sometimes deals with the complex signal that is outputted from complex analog filter. So, in order to optimize and develop this methods, furthermore it is necessary to derive an algorithm for the complex analytical signal. In this paper, we first discuss the new adaptive system for the spectra analysis using the complex LMS algorithm and then derive convergence condition, time constant of coefficient adjustment and frequency resolution by extending the discussion. Finally, the effectiveness of the proposed method is experimentally demonstrated by applying it to the measurement of transfer performance on complex analog filter.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1425-1429
• /
• 1996

누락펄스가 발생할 시 PRI 분석을 위한 전형적인 sequence search 알고리즘은 harmonic 문제를 발생시킨다. 본 논문에서 이러한 harmonic 문제를 해결할 수 있는 PRI 분석 알고리즘을 제안한다. 분석해야 할 전체 PRI 범위를 harmonic이 없도록 subband 로 나눈 후, sequence search를 forward 및 backward로 행한다. 전형적인 sequence search 알고리즘에 비하여 제안한 알고리즘의 성능이 증대된다.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2000년도 가을 학술발표회논문집(I)
• /
• pp.205-210
• /
• 2000

An optimum design algorithm of PSC box girder bridges using design sensitivity analysis is proposed in this paper. For the efficiency of the proposed algorithm, approximated reanalysis techniques using design sensitivity analysis are introduced. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses is proposed. A design sensitivity analysis of structural response is executed by automatic differentiation(AD). The efficiency and robustness of the proposed algorithm, compared with conventional algorithm, is successfully demonstrated in the numerical example.

• 한국도로학회논문집
• /
• 제16권5호
• /
• pp.59-66
• /
• 2014

PURPOSES : This study is to predict the Sound Pressure Level(SPL) obtained from the Noble Close ProXimity(NCPX) method by using the Extended Kalman Filter Algorithm employing the taylor series and Linear Regression Analysis based on the least square method. The objective of utilizing EKF Algorithm is to consider stochastically the effect of error because the Regression analysis is not the method for the statical approach. METHODS : For measuring the friction noise between the surface and vehicle's tire, NCPX method was used. With NCPX method, SPL can be obtained using the frequency analysis such as Discrete Fourier Transform(DFT), Fast Fourier Transform(FFT) and Constant Percentage Bandwidth(CPB) Analysis. In this research, CPB analysis was only conducted for deriving A-weighted SPL from the sound power level in terms of frequencies. EKF Algorithm and Regression analysis were performed for estimating the SPL regarding the vehicle velocities. RESULTS : The study has shown that the results related to the coefficient of determination and RMSE from EKF Algorithm have been improved by comparing to Regression analysis. CONCLUSIONS : The more the vehicle is fast, the more the SPL must be high. But in the results of EKF Algorithm, SPLs are irregular. The reason of that is the EKF algorithm can be reflected by the error covariance from the measurements.

• 제어로봇시스템학회논문지
• /
• 제10권1호
• /
• pp.87-95
• /
• 2004

We proposed the division algorithm that was aimed at dividing system models. It used a transitive matrix to express the relation between place and transition. And the division algorithm was applied to the scheduling problem, with the division-scheduling algorithm. The division-scheduling algorithm was able to calculate the divided subnet table. And it is able to reduce the analysis complexity. In this study, we applied the proposed division algorithm and division-scheduling algorithm to flexible manufacturing system models. We compared the efficiency and performance of the division-scheduling algorithm with the Hillion algorithm, Korbaa algorithm, and Unfolding algorithm proposed in previous researches.