• 한국군사과학기술학회지
• /
• 제26권5호
• /
• pp.400-408
• /
• 2023

The tracking accuracy of buoy-based LBL(Long Base Line) systems can be significantly influenced by sea environmental conditions. Particularly, the position of buoys that may have drifted due to sea currents. Therefore it is necessary to predict and optimize the drifted-buoy positions in the deploying step. This research introduces a free-drift simulation model using ocean data from the European CMEMS. The simulation model's predictions are validated by comparing them to actual sea buoy drift tracks, showing a substantial match in averaged drift speed and direction. Using this drift model, we optimize the initial buoy layout and compare the tracking performance between the center hexagonal layout and close track layout. Our results verify that the optimized layout achieves lower tracking errors compared to the other two layout.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2008년도 정기 학술대회
• /
• pp.416-421
• /
• 2008

A Metropolis genetic algorithm (MGA) is a newly-developed hybrid algorithm combining simple genetic algorithm (SGA) and simulated annealing (SA). In the algorithm, favorable features of Metropolis criterion of SA are incorporated in the reproduction operations of SGA. This way, MGA alleviates the disadvantages of finding imprecise solution in SGA and time-consuming computation in SA. It has been successfully applied and the efficiency has been verified for the practical structural design optimization. However, applicability of MGA for the wider range of problems should be rigorously proved through the solution of mathematical optimization problems. Thus, performances of MGA for the typical mathematical problems are investigated and compared with those of conventional algorithms such as SGA, micro genetic algorithm (${\mu}GA$), and SA. And, for better application of MGA, the effects of acceptance level are also presented. From numerical Study, it is again verified that MGA is more efficient and robust than SA, SGA and ${\mu}GA$ in the solution of mathematical optimization problems having various features.

• 대한산업공학회지
• /
• 제34권1호
• /
• pp.49-56
• /
• 2008

Reliability has been considered as an important design measure in various industrial systems. We discuss a reliability optimization problem with component choices (ROP-CC) subject to a budget constraint. This problem has been known as a NP-hard problem in the reliability design fields. Several researchers have been working to find the optimal solution through different heuristic methods. In this paper, we describe our development of simulated annealing (SA) and tabu search (TS) algorithms and a reoptimization procedure of the two algorithms for solving the problem. Experimental results for some examples are shown to evaluate the performance of these methods. We compare the results with the solutions of a previous study which used ant system (AS) and the global optimal solution of each example obtained through an optimization package, CPLEX 9.1. The computational results indicate that the developed algorithms outperform the previous results.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2007년도 춘계학술대회A
• /
• pp.349-353
• /
• 2007

The main functions of excavator are mainly carried out by excavator attachments such as arm and boom. These components should be designed to be light as well as durable enough because their effects on the whole structure are significant. In this paper, an optimization procedure for lightweight design considering fatigue strength for excavator attachments is presented. The weight of attachments and allowable fatigue stresses at critical areas are used as objective function and constraints, respectively, in which design variables are the thickness of the plates of attachments. The simulated annealing search method is adopted for a global optimization solution. Besides, the response surface method using the artificial neural network is used to simulate constraint function for the sake of practical fast calculation. Some example case of optimization is presented here for a sample excavator. This weight optimization is expected to contribute to a considerable improvement of fuel efficiency of excavator.

• 전자공학회논문지C
• /
• 제35C권12호
• /
• pp.23-30
• /
• 1998

본 논문에서는 시스템 수준에서의 전력 최적화를 위한 한가지 방법으로 부분 버스 반전 부호화를 제안한다. 제안하는 방법에서는 버스 부호화가 버스선의 일부분에만 행해지는데, 이것은 버스선 전체를 부호화 함으로써 필요 없는 버스반전이 생기는 것을 피하기 위해서이다. 부분 버스 반전화를 위해서는 어떠한 버스선들을 선택하여 부호화하는가가 중요한데, 본 논문에서는 이러한 선택을 위한 알고리즘을 제안한다. 벤치마크 예제를 통한 모의 실험에서 부분 버스 반전 부호화 방법을 사용해 버스의 천이수를 평균 62.6% 줄일 수 있다는 것을 보였다. 또한 제안한 알고리즘의 성능을 평가하기 위해 시뮬레이티드 어닐링 방법과 비교하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4438-4460
• /
• 2017

The Kernelized Correlation Filters (KCF) tracker has caused the extensive concern in recent years because of the high efficiency. Numerous improvements have been made successively. However, due to the abrupt motion between the consecutive image frames, these methods cannot track object well. To cope with the problem, we propose an extended KCF tracker based on swarm intelligence method. Unlike existing KCF-based trackers, we firstly introduce a swarm-based sampling method to KCF tracker and design a unified framework to track smooth or abrupt motion simultaneously. Secondly, we propose a global motion estimation method, where the exploration factor is constructed to search the whole state space so as to adapt abrupt motion. Finally, we give an adaptive threshold in light of confidence map, which ensures the accuracy of the motion estimation strategy. Extensive experimental results in both quantitative and qualitative measures demonstrate the effectiveness of our proposed method in tracking abrupt motion.

• 해양환경안전학회지
• /
• 제1권2호
• /
• pp.69-82
• /
• 1995

This study is concerned with developing a heuristic algorithm for solving a class of ninlinear integer programs(NLIP). Exact algrithm for solving a NLIP either may not exist, or may take an unrealistically large amount of computing time. This study develops a new heuristic, the Excursion Algorithm(EA), for solving a class of NLIP's. It turns out that excursions over a bounded feasible and/or infeasible region is effective in alleviation the risks of being trapped at a lical optimum. The developed EA is applied to the redundancy optimization problems for improving the system safety, and is compared with other existing heuristic methods. We also include simulated annealing(SA) method in the comparision experiment due to ist populatrity for solving complex combinatorial problems. Computational results indicate that the proposed EA performs consistently better than the other in terms of solution quality, with moderate increase in computing time. Therefore, the proposed EA is believed to be an attractive alternative to other heuristic methods.

• Bulletin of the Korean Chemical Society
• /
• 제29권5호
• /
• pp.1013-1017
• /
• 2008

Syndecan-3 is a cell-surface heparan sulfate proteoglycan, which performs a variety of functions during cell adhension process. It is also a coreceptor for growth factor, mediating cell-cell and cell-matrix interaction. Syndecan-3 contains a cytoplasmic domain potentially associated with the cytoskeleton. Syndecan-3 is specifically expressed in neuron cell and has related to neuron cell differentiation and development of actin filament in cell migration. Syndecans each have a unique, central, and variable (V) region in their cytoplasmic domains. And that region of syndecan-3 may modulate the interactions of the conserved C1 regions of the cytoplasmic domains by tyrosine phosphorylation. Cytoplasmic domain of syndecan-3 has been synthesized for NMR structural studies. The solution structure of syndecan-3 cytoplasmic domain has been determined by two-dimensional NMR spectroscopy and simulated-annealing calculation. The cytoplasmic domain of the syndecan proteins has a tendency to form a dimmer conformation with a central cavity, however, that of syndecan-3 demonstrated a monomer conformation with a flexible region near C-terminus. The structural information might add knowledge about the structure-function relationships among syndecan proteins.

• 한국멀티미디어학회논문지
• /
• 제10권7호
• /
• pp.912-922
• /
• 2007

원격교육 시스템의 평가 시스템에서 평가의 공정성을 위하여 매 평가 시 평가지의 난이도를 일정하게 유지할 수 있는 방법이 요구된다. 본 논문에서는 유전자 알고리즘 기반의 평가지 생성 알고리즘을 제안한다. 평가지의 각 문항에 대한 난이도가 제출자에 의해서 지정되는 기존의 방법과는 달리 제안한 알고리즘에서는 각 문항의 난이도가 학생들의 평가 결과에 따라 적응적으로 조절되고, 평가지의 평균 난이도를 일정한 수준으로 유지할 수 있다. 제안한 알고리즘에서는 평가지에 동일한 문항이 중복으로 포함되는 것을 배제하고, 이전 평가의 결과를 반영하여 적응적으로 난이도가 조절될 수 있는 새로운 형태의 유전 연산자를 설계하고 구현한다. 그리고 모의실험을 통해 기존의 임의선택 방법과 모의 담금질 방법에 비해 균일한 난이도를 갖는 평가지가 생성될 수 있음을 보인다.

• 산업경영시스템학회지
• /
• 제33권2호
• /
• pp.48-55
• /
• 2010

Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.