• Title/Summary/Keyword: 담금질

Search Result 92, Processing Time 0.029 seconds

Projection Pursuit Regression for Binary Responses using Simulated Annealing (모의 담금질을 이용한 이진반응변수 사용추적회귀)

  • 박종선
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.2
    • /
    • pp.321-332
    • /
    • 2001
  • 본 논문에서는 반응변수가 두 가지의 값을 갖는 회귀분석에 적용할 수 있는 사영추적회귀를 고려하였다. 회귀모형에 필요한 설명변수들의 선형결합이 하나이고 연결함수의 형태를 사전에 알지 못한다는 가정하에서 모의담금질 기법을 이용하여 모형에 필요한 선형결합을 찾는 알고리즘을 제시하였다. 이진 반응변수의 경우에는 평활모수의 값에 따라 잔차이탈도함수의 반응표면이 단봉의 형태를 갖지 않는 경우가 있어 비동질적 마코프체인을 이용한 모의담금질 기법을 적용하면 효율적으로 선형결합을 탐색할 수 있다.

  • PDF

Fast Simulated Annealing with Greedy Selection (Greedy 선택방법을 적용한 빠른 모의 담금질 방법)

  • Lee, Chung-Yeol;Lee, Sun-Young;Lee, Soo-Min;Lee, Jong-Seok;Park, Cheol-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.541-548
    • /
    • 2007
  • Due to the mathematical convergence property, Simulated Annealing (SA) has been one of the most popular optimization algorithms. However, because of its problem of slow convergence in the practical use, many variations of SA like Fast SA (FSA) have been developed for faster convergence. In this paper, we propose and prove that Greedy SA (GSA) also finds the global optimum in probability in the continuous space optimization problems. Because the greedy selection does not allow the cost to become worse, GSA is expected to have faster convergence than the conventional FSA that uses Metropolis selection. In the computer simulation, the proposed method is shown to have as good performance as FSA with Metropolis selection in the viewpoints of the convergence speed and the quality of the found solution. Furthermore, the greedy selection does not concern the cost value itself but uses only dominance of the costs of solutions, which makes GSA invariant to the problem scaling.

The comparative analysis of component-substitution based image fusion algorithm by simulated annealing (담금질 모사기법을 이용한 성분대입기반 영상융합 알고리즘의 평가)

  • Choi, Jae-Wan;Kim, Hye-Jin;Kim, Yong-Il
    • Proceedings of the KSRS Conference
    • /
    • 2008.03a
    • /
    • pp.74-79
    • /
    • 2008
  • 영상 융합은 센서의 자료 저장 능력과 센서에 들어오는 방사에너지 감지의 한계를 해결하고 고해상도의 멀티스펙트럴 영상을 생성할 수 있다는 측면에서 중요한 의의를 지닌다. 특히, 성분대입(component-substitution) 기반의 영상융합 기법은 대용량의 자료를 빠르게 처리할 수 있고, 융합된 영상의 분광왜곡이 적다는 장점을 지니고 있다. 본 연구에서는 최적화기법 중의 하나인 담금질 모사기법(Simulated Annealing, SA)을 이용하여 다양한 성분대입 기반 영상융합 알고리즘들을 분석 및 평가하였다. 담금질 모사기법은 원하는 목적함수가 지역적 최소값이 아닌 광역적 최소값에 수렴이 가능하도록 하는 기법으로 다양한 분야에서의 광역 최적화 기법에 사용된다. 융합 기법의 최적화된 변수를 추출하기 위하여 인위적으로 공간해상도를 낮춘 위성영상을 입력자료로, 원 멀티스펙트럴영상을 참조자료로 사용하였으며, 두 영상간의 분광유사 척도를 담금질 모사 기법의 목적 함수로 구성하였다. 이를 통해 해당 목적함수의 광역적 최소값을 추출하고, 최종적으로 해당 영상에 융합 기법 별 최적화된 변수를 결정하였다. 제안된 최적화 변수의 평가를 위하여 IKONOS 위성영상에 융합을 적용하고, 알고리즘별 분광왜곡량을 비교하였으며 이를 통하여 고해상도 위성영상에 가장 적합한 성분대입 기반 영상융합 기법 및 그에 따른 최적화 변수를 도출할 수 있었다.

  • PDF

A Comparison of the Search Based Testing Algorithm with Metrics (메트릭에 따른 탐색 기반 테스팅 알고리즘 비교)

  • Choi, HyunJae;Chae, HeungSeok
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.480-488
    • /
    • 2016
  • Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

A Global Optimization Method of Radial Basis Function Networks for Function Approximation (함수 근사화를 위한 방사 기저함수 네트워크의 전역 최적화 기법)

  • Lee, Jong-Seok;Park, Cheol-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.14B no.5
    • /
    • pp.377-382
    • /
    • 2007
  • This paper proposes a training algorithm for global optimization of the parameters of radial basis function networks. Since conventional training algorithms usually perform only local optimization, the performance of the network is limited and the final network significantly depends on the initial network parameters. The proposed hybrid simulated annealing algorithm performs global optimization of the network parameters by combining global search capability of simulated annealing and local optimization capability of gradient-based algorithms. Via experiments for function approximation problems, we demonstrate that the proposed algorithm can find networks showing better training and test performance and reduce effects of the initial network parameters on the final results.

a improved neighborhood selection of simulated annealing technique for test data generation (테스트 데이터 생성을 위한 개선된 이웃 선택 방법을 이용한 담금질 기법 기술)

  • Choi, Hyun Jae;Lee, Seon Yeol;Chae, Heung Seok
    • Journal of Software Engineering Society
    • /
    • v.24 no.2
    • /
    • pp.35-45
    • /
    • 2011
  • Simulated annealing has been studied a long times. And it is one of the effective techniques for test data generation. But basic SA methods showed bad performance because of neighborhood selection strategies in the case of large input domain. To overcome this limitation, we propose new neighborhood selection approach, Branch Distance. We performs case studies based on the proposed approach to evaluate it's performance and to compare it whit basic SA and Random test generation. The results of the case studies appear that proposed approach show better performance than the other approach.

  • PDF

Prediction of Ground Condition and Evaluation of its Uncertainty by Simulated Annealing (모의 담금질 기법을 이용한 지반 조건 추정 및 불확실성 평가에 관한 연구)

  • Ryu Dong-Woo
    • Tunnel and Underground Space
    • /
    • v.15 no.4 s.57
    • /
    • pp.275-287
    • /
    • 2005
  • At the planning and design stages of a development of underground space or tunneling project, the information regarding ground conditions is very important to enhance economical efficiency and overall safety In general, the information can be expressed using RMR or Q-system and with the geophysical exploration image. RMR or Q-system can provide direct information of rock mass in a local scale for the design scheme. Oppositely, the image of geophysical exploration can provide an exthaustive but indirect information. These two types of the information have inherent uncertainties from various sources and are given in different scales and with their own physical meanings. Recently, RMR has been estimated in unsampled areas based on given data using geostatistical methods like Kriging and conditional simulation. In this study, simulated annealing(SA) is applied to overcome the shortcomings of Kriging methods or conditional simulations just using a primary variable. Using this technique, RMR and the image of geophysical exploration can be integrated to construct the spatial distribution of RM and to evaluate its uncertainty. The SA method was applied to solve an optimization problem with constraints. We have suggested the practical procedure of the SA technique for the uncertainty evaluation of RMR and also demonstrated this technique through an application, where it was used to identify the spatial distribution of RMR and quantify the uncertainty. For a geotechnical application, the objective functions of SA are defined using statistical models of RMR and the correlations between RMR and the reference image. The applicability and validity of this application are examined and then the result of uncertainty evaluation can be used to optimize the tunnel layout.

A Study on the Change in Microstructures of Traditional Forged High Tin Bronzes by Quenching (담금질 조건에 따른 방짜유기의 미세조직 변화 연구)

  • Lee, Jae-Sung;Jeon, Ik-Hwan;Park, Jang-Sik
    • Journal of Conservation Science
    • /
    • v.27 no.4
    • /
    • pp.421-430
    • /
    • 2011
  • Thermal conditions in practice at the traditional bronze workshop of the Korean Folk Village in Yongin were examined along with the microstructures of some high tin bronze objects made there. Laboratory experiments approximating the conditions of the workshop were also carried out and the results were compared. The operating temperature of the workshop furnace was measured to range from $750^{\circ}C$ to $850^{\circ}C$ while the surface temperature of an object, upon its removal from the furnace for additional thermo-mechanical treatments, was generally in the range of $600^{\circ}C$ to $685^{\circ}C$. This variation in working temperatures was reflected in varying microstructures developed upon quenching. The products of the Folk Village were found to consist of microstructures where the ${\alpha}$ grains of the Cu-Sn system were distributed in the background of different phases including the ${\beta}$-martensite phase, retained ${\gamma}$ phase, ${\alpha}+{\delta}$ eutectoid or their mixtures. This variability, which is also identified in objects made in ancient times as well as in our laboratory experiments, suggests that the actual thermal conditions given during the quenching treatments are much more complicated than is inferred from the temperature measurements. This paper will present detailed accounts of the thermo-mechanical treatments as observed in the high tin bronze workshop of the Korean Folk Village and discuss the evolution of varying microstructures in terms of the substantial variability involved in the implementation of the traditional forged high tin bronze technology of Korea.