• 대한산업공학회지
• /
• 제19권1호
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 하계학술대회
• /
• pp.516-517
• /
• 2015

The automatic traffic sign detection and recognition has been one of the highly researched and an important component of advanced driver assistance systems (ADAS). They are designed especially to warn the drivers of imminent dangers such as sharp curves, under construction zone, etc. This paper presents a traffic sign recognition (TSR) system using morphological operations and multiple descriptors. The TSR system is realized in three stages: segmentation, shape classification and recognition stage. The system is designed to attain maximum accuracy at the segmentation stage with the inclusion of morphological operations and boost the computation time at the shape classification stage using MB-LBP descriptor. The proposed system is tested on the German traffic sign recognition benchmark (GTSRB) and on Korean traffic sign dataset.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.956-967
• /
• 2010

Rapid growth of internet applications has increased the importance of intrusion detection system (IDS) performance. String matching is the most computation-consuming task in IDS. In this paper, a new algorithm for multiple string matching is proposed. This proposed algorithm is based on the canonical Aho-Corasick algorithm and it utilizes a bidirectional and parallel processing structure to accelerate the matching speed. The proposed string matching algorithm was implemented and patched into Snort for experimental evaluation. Comparing with the canonical Aho-Corasick algorithm, the proposed algorithm has gained much improvement on the matching speed, especially in detecting multiple keywords within a long input text string.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 제37회 하계학술대회 논문집 B
• /
• pp.709-710
• /
• 2006

This paper deals with an automatic rotor design functional standard computation based on torque/volume for a synchronous reluctance motor (SynRM). The focus of this paper is the design relative to the torque/volume on the basis of each rated watt according to the rotor diameters of a SynRM. The coupled finite elements analysis (FEA) & sequential unconstrained minimization technique (SUMT) have been used to evaluate design solutions. The proposed procedure allows to define the rotor geometric design function according to the rotor diameter and rated watt starting from an existing motor or a preliminary design.

• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.63-67
• /
• 2009

This paper puts forward a method based on the boundary deformation for planar grid generation. Many methods start with the special properties of grid and switch to the solution of a direct optimization or a non-linear minimum cost flow. Though with high theoretical significance, it's hard to realize due to the extremely complicated computing process. This paper brings out the automatic generation of planar grid by studying the boundary deformational properties of planar grid, which leads to uniform grid and enjoys the simplicity of computation and realization.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.114-116
• /
• 2005

This paper deals with an automatic design standard computation based on a rated watt for a synchronous reluctance motor (SynRM). The focus of this paper is mating the design relative to the output rover on the basis of rotor shape of a SynRM in each rated watt using a coupled FEM & sequential unconstrained minimization technique (SUMT). The coupled finite elements analysis (FEA) & Preisach model have been used to evaluate nonlinear solutions. The proposed procedure allows to define the rotor geometric dimensions according to the rotor diameter and rated watt starting from an existing motor or a preliminary design.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.730-734
• /
• 2001

In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권4호
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권1호
• /
• pp.62-73
• /
• 2005

진화 하드웨어(evolvable hardware)는 재구성 가능한 디지털 회로에 진화연산이 적용되어 실시간으로 환경에 적응함으로써 필요한 기능을 자동적으로 구현하는 기술이다. 이는 하드웨어 회로의 자동설계 가능성을 열어 주었지만, 아직 복잡한 회로를 얻기에는 한계가 있다. 본 논문에서는 진화 하드웨어의 적합도 공간을 분석하여, 다양한 개체가 동시에 진화되는 종분화 기법을 제안하고 그 효율성을 실험적으로 보인다. 또한 종분화 기법으로 얻은 다양한 회로를 분석하여 유용한 부가 기능이 창출될 수 있음을 보인다.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권4호
• /
• pp.188-196
• /
• 2001

This paper presents and efficient algorithm for the loss minimization by automatic sectionalizing switch operation in distribution systems. Ant colony algorithm is multi-agent system in which the behaviour of each single agent, called artificial ant, is inspired by the behaviour of real ants. Ant colony algorithm is suitable for combinatiorial optimization problem as network reconfiguration because it use the long term memory, called pheromone, and heuristic information with the property of the problem. The proposed methodology with some adoptions have been applied to improve the computation time and convergence property. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.