• Proceedings of the Korean Fiber Society Conference
• /
• 2003.10a
• /
• pp.59-60
• /
• 2003

The undrawn monofilament of poly (trimethylene terephthalate) (PTT) was obtained by melt-spinning. After being annealed at 40 C it was analyzed by the measurements of DSC, DMA, WAXD and ATR FT-IR. Tg of PTT fiber after annealing for more than 96 hours was 20 C higher than that before annealing as determined by the DSC and DMA measurements. The WAXD analysis showed very weak diffraction peaks at 2$\theta$=17$^{\circ}$ and 2$\theta$=24$^{\circ}$ for the annealing time of more than 96 hours. The ATR FT-IR measurements made clear the conformational change of methylene chains of PTT glycol residue from random to gauche-gauche conformation.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.1
• /
• pp.16-21
• /
• 2015

In this study, the effects of forming gas post metallization annealing (PMA) on recessed AlGaN/GaN-on-Si MOSHFET were investigated. The device employed an ICPCVD $SiO_2$ film as a gate oxide layer on which a Ni/Au gate was evaporated. The PMA process was carried out at $350^{\circ}C$ in forming gas ambient. It was found that the device instability was improved with significant reduction in interface trap density by forming gas PMA.

• Journal of Mechanical Science and Technology
• /
• v.18 no.9
• /
• pp.1512-1518
• /
• 2004

Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.13 no.8
• /
• pp.619-625
• /
• 2003

A successful design approach for noise barriers should be multidisciplinary because noise reduction goals influence both acoustical and non-acoustical considerations, such as maintenance, safety, physical construction, cost, and visual impact. These various barrier design options are closely related with barrier dimensions. In this study, we have proposed an optimal design method of noise barriers using simulated annealing algorithm, providing a harrier having the smallest dimension and achieving the specified noise reduction at a receiver region exposed to the noise due to Industry and infrastructure, to help a successful barrier design.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 2002.05a
• /
• pp.240-247
• /
• 2002

The rolling wear behavior of SM55C is investigated under lubrication. This is a comparative tribological behavior of heat treatment effect for SM55C. Rolling wear test method is used for Ball-on-disk type. Specimens can be classified into two main groups: as-annealing and non-annealing. As result of wear behavior, flanking initial time of non-annealing specimen keep at retard but it have not under high normal load. One of the notable features of annealing specimen is steady flanking initial time for a normal load in this experiment. Failure mechanism of SM55C is due to the fatigue wear such like flanking, pitting etc.. Flanking leads to abruptly fracture of worn surface. Fracture mechanism has a connection with normal load and polishing direction of specimens.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.4
• /
• pp.1331-1335
• /
• 2011

We report the results of the characterization of Cu oxide thin films deposited by radio frequency (r.f.) magnetron sputtering at different annealing temperatures. The deposited Cu oxide thin films were investigated by scanning electron microscopy, spectroscopic ellipsometry, X-ray diffraction, atomic force microscopy, Xray photoelectron spectroscopy, and contact angle measurements. The thickness of the films was about 180 nm and the monoclinic CuO phase was detected. The $CuO_2$ and $Cu(OH)_2$ phases were grown as amorphous phase and the ratio of the three phases were independent on the annealing temperature. The surface of Cu oxide films changed from hydrophilic to hydrophobic as the annealing temperature increased. This phenomenon is due to the increase of the surface roughness. The direct optical band gap was also obtained and laid in the range between 2.36 and 3.06 eV.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.153-159
• /
• 1998

Clustering or classification is a very fundamental task that may occur almost everywhere for the purpose of grouping. Optimal clustering is an example of very complicated combinatorial optimization problem and it is hard to develop a generally applicable optimal algorithm. In this paper we propose a general-purpose algorithm for the optimal clustering based on SA(simulated annealing). Among various iterative global optimization techniques imitating natural phenomena that have been proposed and utilized successfully for various combinatorial optimization problem, simulated annealing has its superiority because of its convergence property and simplicity. We first present a version of accelerated simulated annealing(ASA) and then we apply ASA to develop an efficient clustering algorithm. Application examples are also given.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.139-155
• /
• 2006

The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.409-412
• /
• 2004

Today, meta-heuristic algorithms have been much attention by researcher because they have the power of solving combinational optimization problems efficiently. As the result, many variants of a meta-heuristic algorithm (e.g., simulated annealing) have been proposed for specific application domains. However, there are few efforts to classify them into a unified software framework, which is believed to provide the users with the reusability of the software, thereby significantly reducing the development time of algorithms. In this paper, we present an object-oriented framework to be used as a general tool for efficiently developing variants of simulated annealing algorithm. The interface classes in the framework achieve the modulization of the algorithm, and the users are allowed to specialize some of the classes appropriate for solving their problems. The core of the framework is Algorithm Configuration Pattern (ACP) which facilitates creating user-specific variants flexibly. Finally, we summarize our experiences and discuss future research topics.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.