• Title/Summary/Keyword: The Simulated Annealing

Search Result 626, Processing Time 0.032 seconds

Optimization of Design Parameters of a EPPR Valve Solenoid using Artificial Neural Network (인공 신경회로망을 이용한 전자비례 감압밸브의 솔레노이드 형상 최적화)

  • Yoon, Ju Ho;Nguyen, Minh Nhat;Lee, Hyun Su;Youn, Jang Won;Kim, Dang Ju;Lee, Dong Won;Ahn, Kyoung Kwan
    • Journal of Drive and Control
    • /
    • v.13 no.2
    • /
    • pp.34-41
    • /
    • 2016
  • Unlike the commonly used On/Off solenoid, constant attraction force which is independent of plunger displacement is a considerably important characteristic to proportional solenoid of the EPPR Valve. Attraction force uniformity is mainly affected by the internal shape design parameters. Due to a number of shape design parameters, the optimal parameter values are very complex and time consuming to find by trial and error method. Much research has been conducted or are still in progress to find the optimal parameter values by applying various optimization techniques like Genetic Algorithm, Evolution Strategy, Simulated Annealing, or the Taguchi method. In this paper, the design parameters which have primary effects on the attraction force uniformity and the average attraction force are decided by main effects analysis of Design of Experiments. Optimal parameter values are derived using finite-element analysis and a neural network model.

A Method of Client-Server Assignment for Minimizing the CPU Power Consumption of Servers in a Game Server Cluster (게임 서버 클러스터에서의 서버의 CPU 전력 소모 최소화를 위한 클라이언트-서버 배정 방법)

  • Kim, Sangchul;Lee, Sunghae
    • Journal of Korea Game Society
    • /
    • v.17 no.4
    • /
    • pp.137-148
    • /
    • 2017
  • Since the power consumption of data centers is large and computer serves take a large portion of it, there have been much research on the power saving of servers in various ways recently. Among the units of severs CPU is one of major power consuming units. In this paper, a method of client-server assignment for minimizing the CPU power consumption of servers in a game server cluster is proposed. We model the client-server assignment problem as an optimization problem, and find a solution to the problem using a simulated annealing-based technique. One of major features of our method is to select a proper operating frequency according to the amount of load on a server. The selection of a lower frequency in case of low load will result in reducing power consumption. To our survey, little research on client-server assignment in consideration of power consumption has been carried out.

Microstructure and Corrosion Behavior of Various Grain Size Cp-Ti (입자크기를 달리한 Cp-Ti의 미세구조 관찰 및 SBF하에서의 부식거동)

  • Lee Seung-Woo;Kim Yun-Jong;Ruy Jae-Gyeoung;Park Joong-Keun;Kim Won-Soo;Kim Taik-Nam
    • Korean Journal of Materials Research
    • /
    • v.15 no.9
    • /
    • pp.585-588
    • /
    • 2005
  • Titanium and Titanium alloys are widely used as an orthopedic and dental implant material because of their excellent biocompatibility and mechanical strength. In this study, ECAP Cp-Ti and Cp-Ti were heat treated for different annealing time of 30 min, 90 min and 3 hours. The grain size for each condition was studied. The micro-Vicker hardness test was carried out f3r each different heat treated samples. The micro-Vicker hardness test for ECAP Cp-Ti, Cp-Ti and Cp-Ti (3hr) revealed hardness values of 239.5, 182 and 144 Hv, respectively. The grain size was increased from approximately $70{\mu}m\;to\;300{\mu}m$ with the increase in heat treatment time from 30 min to 3 hours. The heat treated samples were tested for their biocompatibility in simulated body fluid (SBF) and corrosion rates was determined using Polarization Curve test (PCT). The PCT results showed Cp-Ti with comparatively high corrosion potential of -0.18 V and corresponding corrosion current of $2\times10^{-6}$ A, while the corrosion rate in ECAP Cp-Ti and Cp-Ti (30 min annealed) showed very similar results of corrosion potential about -0.47 V with corresponding corrosion current of $7\times10^{-8}$ A.

The Effect of Magnetic Field Treatment on Enhanced Exchange Coupling of $Nd_{2}Fe_{14}B/Fe_{3}B$ Magnet (자장중 열처리에 의한 $Nd_{2}Fe_{14}B/Fe_{3}B$ 초미세립 복합자성상의 자기특성 향상)

  • 박언병;양충진
    • Journal of the Korean Magnetics Society
    • /
    • v.6 no.2
    • /
    • pp.80-85
    • /
    • 1996
  • An externally applied magnetic field during annealing the $Nd_{2}Fe_{14}B/Fe_{3}B$ based spring magnet was found to enhance the exchange coupling between the hard and soft magnetic grains. More than 30 % increase in remanence values for melt-spun $Nd_{4}Fe_{73.5}Co_{3}(Hf_{1-x}-Ga_{x})B_{18.5}$(x=0, 0.5, 1.0) alloys was resulted from uniform distribution of $Fe_{3}B$, $\alpha$-Fe as well as $(Nd_{2}Fe_{14}B)$, and also from reduced grain size of those phases by 20 %. The result also showed that there is an optimum grain size exhibiting a high coercivity value which will be discussed in terms of previously simulated exchange coupling parameter.

  • PDF

Waveform inversion of shallow seismic refraction data using hybrid heuristic search method (하이브리드 발견적 탐색기법을 이용한 천부 굴절법 자료의 파형역산)

  • Takekoshi, Mika;Yamanaka, Hiroaki
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.1
    • /
    • pp.99-104
    • /
    • 2009
  • We propose a waveform inversion method for SH-wave data obtained in a shallow seismic refraction survey, to determine a 2D inhomogeneous S-wave profile of shallow soils. In this method, a 2.5D equation is used to simulate SH-wave propagation in 2D media. The equation is solved with the staggered grid finite-difference approximation to the 4th-order in space and 2nd-order in time, to compute a synthetic wave. The misfit, defined using differences between calculated and observed waveforms, is minimised with a hybrid heuristic search method. We parameterise a 2D subsurface structural model with blocks with different depth boundaries, and S-wave velocities in each block. Numerical experiments were conducted using synthetic SH-wave data with white noise for a model having a blind layer and irregular interfaces. We could reconstruct a structure including a blind layer with reasonable computation time from surface seismic refraction data.

A Neighbor Selection Technique for Improving Efficiency of Local Search in Load Balancing Problems (부하평준화 문제에서 국지적 탐색의 효율향상을 위한 이웃해 선정 기법)

  • 강병호;조민숙;류광렬
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.2
    • /
    • pp.164-172
    • /
    • 2004
  • For a local search algorithm to find a bettor quality solution it is required to generate and evaluate a sufficiently large number of candidate solutions as neighbors at each iteration, demanding quite an amount of CPU time. This paper presents a method of selectively generating only good-looking candidate neighbors, so that the number of neighbors can be kept low to improve the efficiency of search. In our method, a newly generated candidate solution is probabilistically selected to become a neighbor based on the quality estimation determined heuristically by a very simple evaluation of the generated candidate. Experimental results on the problem of load balancing for production scheduling have shown that our candidate selection method outperforms other random or greedy selection methods in terms of solution quality given the same amount of CPU time.

NMR Studies on Turn Mimetic Analogs Derived from Melanocyte-stimulating Hormones

  • Cho, Min-Kyu;Kim, Sung-Soo;Lee, Myung-Ryul;Shin, Joon;Lee, Ji-Yong;Lim, Sung-Kil;Baik, Ja-Hyun;Yoon, Chang-Ju;Shin, In-Jae;Lee, Weon-Tae
    • BMB Reports
    • /
    • v.36 no.6
    • /
    • pp.552-557
    • /
    • 2003
  • Oligomers with $\alpha$-aminooxy acids are reported to form very stable turn and helix structures, and they are supposed to be useful peptidomimetics for drug design. A recent report suggested that homochiral oxa-peptides form a strong eight-member-ring structure by a hydrogen bond between adjacent aminooxy-acid residues in a $CDCl_3$ solution. In order to design an $\alpha$-MSH analog with a stable turn conformation, we synthesized four tetramers and one pentamer, based on $\alpha$-MSH sequence, and determined the solution structures of the molecules by two-dimensional NMR spectroscopy and simulated annealing calculations. The solution conformations of the three peptidomimetic molecules (TLV, TDV, and TLL) in DMSO-$d_6$ contain a stable 7-membered-ring structure that is similar to a $\gamma$-turn in normal peptides. Newly-designed tetramer TDF and pentamer PDF have a ball-type rigid structure that is induced by strong hydrogen bonds between adjacent amide protons and carbonyl oxygens. In conclusion, the aminooxy acids, easily prepared from natural or unnatural amino acids, can be employed to prepare peptidomimetic analogues with well-defined turn structures for pharmaceutical interest.

Parameters Estimation of Probability Distributions Using Meta-Heuristic Algorithms (Meta-Heuristic Algorithms를 이용한 확률분포의 매개변수 추정)

  • Yoon, Suk-Min;Lee, Tae-Sam;Kang, Myung-Gook;Jeong, Chang-Sam
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.464-464
    • /
    • 2012
  • 수문분야에 있어서 빈도해석의 목적은 특정 재현기간에 대한 발생 가능한 수문량의 규모를 파악하는데 있으며, 빈도해석의 정확도는 적합한 확률분포모형의 선택과 매개변수 추정방법에 의존하게 된다. 일반적으로 각 확률분포모형의 특성을 대표하는 매개변수를 추정하기 위해서는 모멘트 방법, 확률가중 모멘트 방법, 최대우도법 등을 이용하게 된다. 모멘트 방법에 의한 매개변수 추정은 해를 구하기 위한 과정이 단순한 반면, 비대칭형의 왜곡된 분포를 갖는 자료들에 대해서는 부정확한 결과를 나타내게 된다. 확률가중 모멘트 방법은 표본의 크기가 작거나 왜곡된 자료일 경우에도 비교적 안정적인 결과를 제공하는 반면, 확률 가중치가 정수로만 제한되는 단점을 갖고 있다. 그리고 대수 우도함수를 이용하여 매개변수를 추정하게 되는 최우도법은 가장 효율적인 매개변수 추정치를 얻을 수 있는 것으로 알려져 있으나, 비선형 연립방정식으로 표현되는 해를 구하기 위해서는 Newton-Raphson 방법을 사용하는 등 절차가 복잡하며, 때로는 수렴이 되지 않아 해룰 구하지 못하는 경우가 발생되게 된다. 이에 반해, 최근의 Genetic Algorithm, Ant Colony Optimization 및 Simulated Annealing과 같은 Meta-Heuristic Algorithm들은 복잡합 공학적 최적화 문제 있어서 효율적인 대안으로 주목받고 있으며, Hassanzadeh et al.(2011)에 의해 수문학적 빈도해석을 위한 매개변수 추정에 있어서도 그 적용성이 검증된바 있다. 본 연구의 목적은 연 최대강수 자료의 빈도해석에 적용되는 확률분포모형들의 매개변수 추정을 위해 Meta-Heuristic Algorithm을 적용하고자 함에 있다. 따라서 본 연구에서는 매개변수 추정을 위한 방법으로 Genetic Algorithm 및 Harmony Search를 적용하였고, 그 결과를 최우도법에 의한 결과와 비교하였다. GEV 분포를 이용하여 Simulation Test를 수행한 결과 Genetic Algorithm을 이용하여 추정된 매개변수들은 최우도법에 의한 결과들과 비교적 유사한 분포를 나타내었으나 과도한 계산시간이 요구되는 것으로 나타났다. 하지만 Harmony Search를 이용하여 추정된 매개변수들은 최우도법에 의한 결과들과 유사한 분포를 나타내었을 뿐만 아니라 계산시간 또한 매우 짧은 것으로 나타났다. 또한 국내 74개소의 강우관측소 자료와 Gamma, Log-normal, GEV 및 Gumbel 분포를 이용한 실증연구에 있어서도 Harmony Search를 이용한 매개변수 추정은 효율적인 매개 변수 추정치를 제공하는 것으로 나타났다.

  • PDF

Development of a Design System for Multi-Stage Gear Drives (2nd Report: Development of a Generalized New Design Algorithm) (다단 치차장치 설계 시스템 개발에 관한 연구(제 2보: 일반화된 신설계 알고리즘의 개발))

  • Chong, Tae-Hyong;Bae, In-Ho;Park, Gyung-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.10
    • /
    • pp.192-199
    • /
    • 2000
  • The design of multi-stage gear drives is a time-consuming process because it includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has no determine the number of reduction stages and the gear ratios of each reduction stage. In addition, the design problems include not only dimensional design but also configuration design of gear drive elements. There is no definite rule or principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer, and consequently result in undesirable design solution. A new and generalized design algorithm has been proposed to support the designer at the preliminary phase of the design of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, the user determines the number of reduction stages. In the second step, gear ratios of every stage are chosen using the random search method. The values of the basic design parameters of a gear are chose in the third step by using the generate and test method. Then the values of the dimensions, such as pitch diameter, outer diameter and face width, are calculated for the configuration design in the next step. The strength and durability of each gear is guaranteed by the bending strength and the pitting resistance rating practices by using AGMA rating formulas. In the final step, the configuration design is carried out using simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume (size) of a gearbox while avoiding interferences between them. These steps are carried out iteratively until a desirable solution is acquired. The proposed design algorithm is applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution has considerably good results in both aspects of the dimensional and the configuration design.

  • PDF

An Iterative Digital Image Watermarking Technique using Encrypted Binary Phase Computer Generated Hologram in the DCT Domain (DCT 영역에서 암호화된 이진 위상 컴퓨터형성 홀로그램을 이용한 반복적 디지털 영상 워터마킹 기술)

  • Kim, Cheol-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.3
    • /
    • pp.15-21
    • /
    • 2009
  • In this paper, we proposed an iterative digital image watermarking technique using encrypted binary phase computer generated hologram in the discrete cosine transform(OCT) domain. For the embedding process of watermark, using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and repeat the hologram and encrypt it through the XOR operation with key image that is ramdomly generated binary phase components. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using XOR operation with key image. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and encryption technique so it is very secure and robust to the external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.