• Computational Structural Engineering
• /
• v.10 no.4
• /
• pp.349-358
• /
• 1997

The present paper describes an investigation into the application of the genetic algorithm (GA) in the optimum design of composite laminated structure. Stochastic processes generate an initial population of designs and then apply principles of natural selection/survival of the fittest to improve the designs. The five test functions are used to verify the robustness and reliability of the GA, and as a numerical example, minimum weight of a cantilever composite laminated beam with a mix of continuous, integer and discrete design variables is obtained by using the GA with exterior penalty function method. The design problem has constraints on strength, displacements, and natural frequencies, and is formulated to a multidimensional nonlinear form. From the results, it is found that the GA search technique is very effective to find the good optimum solution as well as has higher robustness.

• ETRI Journal
• /
• v.9 no.2
• /
• pp.96-105
• /
• 1987

The purpose of this paper is to report the implementation of new frame synchroniazation circuit for D3/PCM.When the D3/PCM signal(1.544Mb/s) is received, the performance of the new frame synchronizer is evaluated by the statistical method according to the parameters BER,es, em. For BER=$10^-2$, es=0 and em=2, the implemented hardware will render the initial search time, the maintenance time and there frame time equals to 2.87ms, 9.9hrs and2.69ms, respectively. Also the proposed frame synchronizer can be easily modified to the practical transmission channels environment and the new 1.544Mb/s signal format.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.79-89
• /
• 1998

The Error Back-Propagation(EBP) algorithm is widely applied to train a multi-layer perceptron, which is a neural network model frequently used to solve complex problems such as pattern recognition, adaptive control, and global optimization. However, the EBP is basically a gradient descent method, which may get stuck in a local minimum, leading to failure in finding the globally optimal solution. Moreover, a multi-layer perceptron suffers from locking a systematic determination of the network structure appropriate for a given problem. It is usually the case to determine the number of hidden nodes by trial and error. In this paper, we propose a new algorithm to efficiently train a multi-layer perceptron. OUr algorithm uses stochastic perturbation in the weight space to effectively escape from local minima in multi-layer perceptron learning. Stochastic perturbation probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the probabilistically re-initializes weights associated with hidden nodes to escape a local minimum if the EGP learning gets stuck to it. Addition of new hidden nodes also can be viewed asa special case of stochastic perturbation. Using stochastic perturbation we can solve the local minima problem and the network structure design in a unified way. The results of our experiments with several benchmark test problems including theparity problem, the two-spirals problem, andthe credit-screening data show that our algorithm is very efficient.

• Journal of Digital Convergence
• /
• v.13 no.1
• /
• pp.243-248
• /
• 2015

Recognition model is not defined when you configure a model, Been added to the model after model building awareness, Model a model of the clustering due to lack of recognition models are generated by modeling is causes the degradation of the recognition rate. In order to improve decision tree state tying modeling using parameter estimation of Bayesian method. The parameter estimation method is proposed Bayesian method to navigate through the model from the results of the decision tree based on the tying state according to the maximum probability method to determine the recognition model. According to our experiments on the simulation data generated by adding noise to clean speech, the proposed clustering method error rate reduction of 1.29% compared with baseline model, which is slightly better performance than the existing approach.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.113-118
• /
• 2011

Sequence homology analysis in the substances in the phenomenon of life is to create database by sorting and indexing and to demonstrate the usefulness of informatics. In this paper, Markov models are used in GenScan program to convert the pattern of complex eukaryotic protein sequences. It becomes impossible to navigate the minimum distance, complexity increases exponentially as the exact calculation. It is used scorecard in amino acid substitutions between similar amino acid substitutions to have a differential effect score, and is applied the Markov models sophisticated concealment of the transition probability model. As providing superior method to translate sequences homologous sequences in analysis using blast p, Markov models. is secreted protein structure of sequence translations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.699-701
• /
• 2017

Typical operating method for long-range observation cameras are to detect the target at a wide angle of view and to recognize/identify the target with a telephoto angle of view. And the detection/recognition range performance is an important item to evaluate the performance of the defense infrared camera. To increased the detection range performance, the camera's field of view should be narrowed. Due to the narrow field of view, the probability of finding target is relatively low. In this paper, we propose a method to search for target by providing a wide angle view while maintaining detection range performance. M&S and optimized design were used to develop infrared camera with extended field of view and the results of the test summarized.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1271-1277
• /
• 2008

This paper proposes the code acquisition scheme on a MIMO channel for preamble search in a CDMA-MIMO uplink system. The multiple transmit/receive antennas are used for beamforming. The performance of a ML code acquisition technique based on transmit and receive beamforming is analyzed by considering rho detection probability. The acquisition performance and MAT for a MIMO code acquisition system are numerically evaluated. It is shown that multiple transmit antennas can give the code acquisition system a transmit beamforming gain and result in much better performance than a SIMO case.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.108-108
• /
• 2018

상수관의 노후화 혹은 공사 중 작업자의 실수, 또는 자연재해 등에 의해 상수관망 내 파손 관이 발생할 경우 파손된 관의 보수 및 교체 작업을 위해서는 파손 관과 인접한 밸브를 차폐하게 된다. 이로 인하여 관망의 일부 지역에 물 공급이 차단되는 단수구역이 발생하게 되며, 단수구역은 밸브를 닫음으로 인해 파손 관과 함께 격리되는 직접고립지역(segment)과 직접고립지역을 차폐함으로써 의도치 않게 수원으로부터 물 공급이 차단되는 간접고립지역(unintended isolation)으로 구분할 수 있다. 간접고립지역은 차폐된 직접고립지역으로 인해 수원으로부터의 유일한 용수공급 노선이 차단되어 발생한다. 관 파손에 의한 단수 피해를 현실적으로 모의하기 위해서는 밸브위치에 따른 단수구역을 정확히 산정할 필요가 있다. 단수구역은 파손관의 위치뿐만 아니라 차단 밸브의 개수 및 위치에 따라 달라진다. 따라서, 관 파손에 의한 단수피해를 최소화하기 위해서는 각 관로의 파손확률과 절점의 중요도를 고려하여, 적절한 밸브의 위치를 선정해야 한다. 본 연구에서는 관 파손에 따른 단수상황을 모의하여 파손 관에 의한 직, 간접 단수구역을 탐색한 후, 단수용량을 파악하고 이를 최소화하기 위한 밸브의 적정 위치를 최적화 알고리즘을 이용하여 결정하는 방안을 제시하였다.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.315-318
• /
• 2019

본 논문은 화학에서 사용되는 2가지 산, 염기 모델에 대한 이해를 높이고자 각 모델의 핵심 알고리즘가 반영된 단계별 교육용 콘텐츠를 개발하는데 목적이 있다. 이를 위해 먼저 Arrhenius와 Brønsted-Lowry 모델이 갖는 핵심 알고리즘을 탐색하였으며, 이러한 핵심 알고리즘을 반영된 단계별 교육용 콘텐츠를 JAVA를 이용하여 개발하였다. 개발된 교육용 콘텐츠는 총 5단계로 구성되어 있다. 1단계는 화학에서 다루어지는 입자들이 개별적으로 무작위하게 운동함으로 표현하였으며, 2단계는 화학반응이란 이러한 무작위적 운동 중 입자 간 충돌에 의해 반응이 개시됨을 보여주었다. 3단계에서는 단일입자에 대해 정반응과 역반응을 동시에 고려한 진행되는 상황을, 4단계는 여러 입자가 동시다발적으로 정반응과 역반응에 참여한 상황을 구현하였다. 마지막 5단계는 정반응과 역반응의 공존의 비율이 다른 상황을 통해 평형상수의 의미를 고찰하도록 하였다. 창발적 사고의 핵심은 여러 입자를 생각하는 확률적 사고와 이러한 여러 입자가 개별적으로 움직인다는 사고가 반영되어야 한다. 이 연구에서 개발한 교육콘텐츠를 활용한다면 학생들이 보다 창발적 사고를 하는데 도움을 줄 것으로 기대된다.