• Computers and Concrete
• /
• 제27권1호
• /
• pp.63-71
• /
• 2021

In this study, a new stopping criterion, called "backward controlled stopping criterion" (BCSC), was proposed to be used in Genetic Algorithms. In the study, the available stopping citeria; adaptive stopping citerion, evolution time, fitness threshold, fitness convergence, population convergence, gene convergence, and developed stopping criterion were applied to the following four comparison problems; high strength concrete mix design, pre-stressed precast concrete beam, travelling salesman and reinforced concrete deep beam problems. When completed the analysis, the developed stopping criterion was found to be more accomplished than available criteria, and was able to research a much larger area in the space design supplying higher fitness values.

• Journal of information and communication convergence engineering
• /
• 제1권3호
• /
• pp.104-108
• /
• 2003

A biologically inspired fuzzy multilayer perceptron is proposed in this paper. The proposed algorithm is established under consideration of biological neuronal structure as well as fuzzy logic operation. We applied this suggested learning algorithm to benchmark problem in neural network such as exclusive OR and 3-bit parity, and to digit image recognition problems. For the comparison between the existing and proposed neural networks, the convergence speed is measured. The result of our simulation indicates that the convergence speed of the proposed learning algorithm is much faster than that of conventional backpropagation algorithm. Furthermore, in the image recognition task, the recognition rate of our learning algorithm is higher than of conventional backpropagation algorithm.

• 한국정보통신학회논문지
• /
• 제10권7호
• /
• pp.1259-1265
• /
• 2006

본 논문에서는 고속 FPGA 설계를 위한 논리 수준의 조합회로 합성 알고리듬을 제안한다. 제안된 알고리듬은 회로의 지연시간을 줄이기 위해 critical path를 분할한다. 그리고 분할된 회로를 동시에 수행하는 구조를 갖는 회로를 생성한다. 본 커널 선택 알고리듬은 SUN UNIX 환경에서 C 언어로 구현되었다. 제안된 커널 선택 알고리듬은 기존의 FlowMap 지연시간 최적화 알고리듬과 결과를 비교하였다. 제안된 지연시간 최적화 알고리듬이 기존 알고리듬 에 비해 지연시간이 평균 33.3 % 감소된 회로를 생성함을 보였다.

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.394-402
• /
• 1999

In this paper, we present an effective RLS algorithm with forgetting factor of Erlang function for the system identification. In the proposed algorithm, the forgetting factor decreases monotonically in the first stage, and then it increases monotonically in the second stage in contrary to the conventional forgetting factor RLS algorithms. In addition, annealing effect and an asymptotically stability of the proposed algorithm is discussed based on the analysis of convergency property on. Simulation results for the system identification problem indicate the superiority of the proposed algorithm in comparison to the RLS algorithm such as NLMS and Kalman filter based algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2090-2092
• /
• 2003

Adaptive algorithms are widely used for various applications. One challenging application is an echo canceller in the long distance telephony network. This paper proposes the new variable step-size algorithm for adaptive lattice structure for echo cancellation. The new algorithm is using power of the output signal and the error signal to controlled the step of adaptation process. By this technique, the proposed algorithm is an excellent and effective in good stability. Performance comparison of the proposed algorithm and the other algorithm is made through simulation results.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.444-447
• /
• 2008

In this paper, we proposed the recognition system of car license plates to mitigate traffic problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using line scan algorithm and Grassfire algorithm, and then individual codes are extracted from the license plate segment using edge tracking algorithm. Finally the extracted individual codes are recognized by an FCM algorithm. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 100 car images for experiment. In the results, we could verify the proposed method is more effective and recognition performance is improved in comparison with conventional car license plate recognition methods.

• 한국경영과학회지
• /
• 제32권2호
• /
• pp.109-121
• /
• 2007

This paper focuses on algorithms based on the evolution, which is applied to various optimization problems. Especially, among these algorithms based on the evolution, we investigate the simple genetic algorithm based on Darwin's evolution, the Lamarckian algorithm based on Lamark's evolution and the Baldwin algorithm based on the Baldwin effect and also Investigate the difference among them in the biological and engineering aspects. Finally, through this comparison, we suggest a new algorithm to find more various solutions changing the genotype or phenotype search space and show the performance of the proposed method. Conclusively, the proposed method showed superior performance to the previous method which was applied to the constrained minimum spanning tree problem and known as the best algorithm.

• 한국경영과학회지
• /
• 제30권4호
• /
• pp.61-70
• /
• 2005

In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.

• 제어로봇시스템학회논문지
• /
• 제17권2호
• /
• pp.145-148
• /
• 2011

In this paper, we proposed a search method for structured light pixels of omnidirectional structured light image. Since the omnidirectional structured light image is composed of several circular arc segments, the proposed algorithm searches the structured light pixels in radial direction rather than horizontal or vertical directions. The proposed search algorithm is based on the well-known Bresenham raster algorithm for line drawing in discrete integer space, thereby computation of the algorithm is very efficient. Comparison results between the proposed search algorithm and the conventional horizontal search are presented in experiments.