• 한국세라믹학회지
• /
• 제28권11호
• /
• pp.892-896
• /
• 1991

The cyrstallization behavior of lead titanate powders prepared by sol-gel and coprecipitation techniques was investigated. The lead titanate precursors were derived from a mixed solution of lead nitrate and titanium tetrachloride at 4$0^{\circ}C$ to 43$^{\circ}C$ and pH of 9.00 to 9.75. The X-ray diffraction patterns of the dried gel and coprecipitated powders showed it to be amorphous. DTA runs of the powders indicated crystallization to occur at 475~48$0^{\circ}C$. However, the amorphous powders were partially crystallized at 400~45$0^{\circ}C$ with sufficient annealing time. The room temperature Raman spectra from heat-treated powders changed continuously from amorphous to crystalline state with increasing heat-treating temperature. By annealing coprecipitated powders, a dramatic change in the Raman spectra due to the structural relaxation as the annealing temperatures increased, was clearly visible. i.e., coprecipitated, gel, and crystalline structure, in turn.

• 산업공학
• /
• 제21권3호
• /
• pp.254-261
• /
• 2008

Connected-(r,s)-out of-(m,n) : F system is an important topic in redundancy design of the complex system reliability and it's maintenance policy. Previous studies applied Monte Carlo simulation and genetic, simulated annealing algorithms to tackle the difficulty of maintenance policy problem. These algorithms suggested most suitable maintenance cycle to optimize maintenance pattern of connected-(r,s)-out of-(m,n) : F system. However, genetic algorithm is required long execution time relatively and simulated annealing has improved computational time but rather poor solutions. In this paper, we propose the ant colony optimization approach for connected-(r,s)-out of-(m,n) : F system that determines maintenance cycle and minimum unit cost. Computational results prove that ant colony optimization algorithm is superior to genetic algorithm, simulated annealing and tabu search in both execution time and quality of solution.

• 한국진공학회:학술대회논문집
• /
• 한국진공학회 2014년도 제46회 동계 정기학술대회 초록집
• /
• pp.195.2-195.2
• /
• 2014

Nanodiamond (ND) is composed of inner diamond core and outer graphite shell. The size of ND used in this study was about 5 nm. The ND solution was dropped on silicon substrate and dried in air. Dried ND sample was purified by using annealing method in air. Then, 40 keV Fe ion was irradiated into the sample. The dose was varied from $1{\times}10^{14}$ to $1{\times}10^{16}ions/cm^2$. The post annealing was performed at 1073 K in the vacuum to recover diamond structure. The annealing at 873 K in air was performed to remove the outer graphite shell. The structure of ND was confirmed by X-ray diffraction (XRD) and Raman spectroscopy. We will present the detailed data and results in the conference.

• 한국경영과학회지
• /
• 제21권2호
• /
• pp.125-140
• /
• 1996

Simulated annealing (SA) is a very promising general purpose algorithm which can be conveniently utilized for various complicated combinatorial optimization problems. But its slowness has been pointed as a major drawback. In this paper, we propose an accelerated SA and test its performance experimentally by applying it for two standard combinatorial optimization problems (TSP(Travelling Salesman Problem) and GPP(Graph Partitioning Problem) of various sizes. It turns out that performance of the proposed method is consistently better both in convergenge speed and the quality of solution than the conventional SA or SE (Stochastic Evolution). In the second part of the paper we apply the accelerated SA to solve the virtual path management problem encountered in ATM netowrks. The problem is modeled as a combinatorial optimization problem to optimize the utilizy of links and an efficient SA implementation scheme is proposed. Two application examples are given to demonstrate the validity of the proposed algorithm.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1997년도 추계학술대회
• /
• pp.361-364
• /
• 1997

Bayesian MAP-EM approaches have been quite useful or tomographic reconstruction in that they can stabilize the instability of well-known ML-EM approaches, and can incorporate a priori information on the underlying emission object. However, MAP reconstruction algorithms with expressive priors often suffer from the optimization problem when their objective unctions are nonquadratic. In our previous work [1], we showed that the use of deterministic annealing method greatly reduces computational burden or optimization and provides a good solution or nonquadratic objective unctions. Here, we further investigate the convergence of the deterministic annealing algorithm; our experimental results show that, while the solutions obtained by a simple quenching algorithm depend on the initial conditions, the estimates converged via deterministic annealing algorithm are consistent under various initial conditions.

• Korean Membrane Journal
• /
• 제10권1호
• /
• pp.39-45
• /
• 2008

Polyelectrolyte complex based on two anionic polysaccharides, composed of sodium alginate and carrageenan, were prepared by interacting with divalent calcium ions in solution. The effects of annealing on the structural deformation of polyelectrolyte complex and on their characteristics at removing water from a methanol mixture from the point of molecular sieve were investigated and discussed. The result showed that the structural deformation of the annealed polyelectrolyte complex has an effect on the free volume between these polymer chains and the chelate segments such a shrinking of the overall morphology, which act as a molecular sieve in the separation of methanol and water mixtures.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.1085-1087
• /
• 1998

A distribution systems loss minimum reconfiguration method by simulated annealing is proposed. The problem is a complex mixed integer programming problem and is very difficult to solve by a mathematical programming approach. Simulated annealing generates feasible solutions randomly and moves among these solutions using a strategy leading to a global minimum with high probabilities. The solution algorithm has been implemented in developed software package and tested on 32-bus system.

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

This paper presents an efficient algorithm for the loss minimization of distribution system by automatic sectionalizing switch operation in large scale distribution systems. Simulated annealing is particularly well suited for large combinational optimization problem, but the use of this algorithm is also responsible for an excessive computation time requirement. Tabu search attempts to determine a better solution in the manner of a greatest-descent algorithm, but it can not give any guarantee for the convergence property. The hybrid algorithm of two methods with two tabu lists and the proposed perturbation mechanism is 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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권2호
• /
• pp.120-127
• /
• 2003

In electrical impedance tomography(EIT), various image reconstruction algorithms have been used in order to compute the internal resistivity distribution of the unknown object with its electric potential data at the boundary. Mathematically the EIT image reconstruction algorithm is a nonlinear ill-posed inverse problem. This paper presents a simulated annealing technique as a statistical reconstruction algorithm for the solution of the static EIT inverse problem. Computer simulations with the 32 channels synthetic data show that the spatial resolution of reconstructed images by the proposed scheme is improved as compared to that of the mNR algorithm or genetic algorithm at the expense of increased computational burden.

• 산업공학
• /
• 제19권4호
• /
• pp.270-280
• /
• 2006

The shipping plan for an efficient augmentation of terminal is NP-hard problem which is subordinate to a shipping quantity. The load location problem and stowage planning problem are two important tactical problems for the efficient operations of container terminals. This paper is concerned with reduction of feasible region in constraints for stowage planning. After designing model which minimizes the number of shifting and the travel distance of the transfer crane, the simulated annealing algorithm is employed to search optimal solution quickly and accurately. In order to apply more realistic approach, the partial restriction through adding hatch is complemented to stowage planning decision problem applied in cluster. A variety of numerical experiments demonstrated that solutions by simulated annealing algorithm are useful and applicable in practice.