• Bulletin of the Korean Chemical Society
• /
• v.34 no.5
• /
• pp.1473-1476
• /
• 2013

Solution-based deposition of $CuIn_xGa_{1-x}Se_2$ (CIGSe) thin films is well known non-vacuum process for the fabrication of CIGSe solar cells. However, due to the usage of organic chemicals in the preparation of CIG precursor solutions, the crystallization of the polycrystalline CIGSe and the performance of CIGSe thin film solar cells were significantly affected by the carbon residues from the organic chemicals. In this work, we have tried to eliminate the carbon residues in the CIG precursor thin films efficiently by using soft-annealing process. By adjusting soft-annealing temperature, it is possible to control the amount of carbon residues in CIG precursor thin films. The reduction of the carbon residues in CIG precursors by high temperature soft-annealing improves the grain size and morphology of polycrystalline CIGSe thin films, which are also closely related with the electrical properties of CIGSe thin film solar cells.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.25-32
• /
• 1998

A modified simulated annealing algorithm is proposed and applied to the permutation flowshop scheduling with the makespan objective. Based on the job deletion and insertion method, a newly defined Max-min perturbation scheme is proposed to obtain a better candidate solution in the simulated annealing process. The simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm against the existing heuristics and results are reported.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.284-289
• /
• 2002

In this paper, we propose the fast simulated annealing algorithm to decrease convergence rate in image segmentation using MRF. Simulated annealing algorithm has a good performance in noisy image or texture image, But there is a problem to have a long convergence rate. To fad a solution to this problem, we have labeled each pixel adaptively according to its intensity before simulated annealing. Then, we show the superiority of proposed method through experimental results.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.1
• /
• pp.177-185
• /
• 2005

We consider the optimization problem of the geostationary satellite orbital positions. which is very fundamental and important in setting up the new satellite launching plan. We convert the problem into a discrete optimization problem. However, the converted problem is too complex to find an optimal solution. Therefore, we develope the solution procedures using simulated annealing technique. The results of applying our method to some examples are reported.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.2
• /
• pp.77-93
• /
• 1995

A mathematical model for long-rage water supply planning was formulated as a dynamic plant location problem with network arc capacity expansion, and illustative example was presented. The proposed solution procedure identifies economical construction timings of surface water supply facilities and water conveyence systems and the best water supply operating patterns as well. In this study, we present a heuristic solution procedure using Simulated annealing Method in conjunction with Bertsekas & Tseng's RELAXT-II for the 0-1 integer network problem.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.1-26
• /
• 1994

Simulated annealing is an attractive, but expensive, heuristic method for approximating the solution to combinatorial optimization problems. Attempts to parallel simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm's requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. To mitigate this bottleneck, it becomes necessary to amortize the overhead of these state updates over as many parallel state changes as possible. By using this technique, errors in the actual cost C(S) of a particular state S will be introduced into the annealing process. This paper places analytically derived bounds on this error in order to assure convergence to the correct optimal result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the annealing control parameter, i.e. temperature. Implementation results on an Intel iPSC/2 are reported.

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• v.17 no.1
• /
• pp.11-17
• /
• 2007

The spherical NiZn ferrite particles were prepared by ultrasonic spray pyrolysis with mixed solution of aqueous metal nitrates. The NiZn ferrite particle was observed with nano-sized primary particles of about 10 nm or less before annealing which represented as paramagnetic behavior measured at 77 K and room temperature. The typical abnormal growth of primary particles like polyhedral primary particles was observed by annealing at 1273 K with Zn-concentration dependency. The XRD patterns showed good crystallinity of NiZn ferrite powder after annealing. In annealing process, the intra-particle sintering phenomenon was observed and the spherical particle morphology was collapsed at 1673 K. The saturation magnetization of NiZn ferrite powder for each annealing temperature was decreased with measuring temperature of $77{\sim}$300K.

• Corrosion Science and Technology
• /
• v.13 no.2
• /
• pp.48-55
• /
• 2014

Influence of annealing temperature on the microstructure and resistance to pitting corrosion of the hyper duplex stainless steel was investigated in acid and neutral chloride environments. The pitting corrosion resistance is strongly dependent on the microstructure, especially the presence of chromium nitrides ($Cr_2N$), elemental partitioning behavior and volume fraction of ferrite phase and austenite phase. Precipitation of deleterious chromium nitrides reduces the resistance to pitting corrosion due to the formation of Cr-depleted zone. The difference of PREN (Pitting Resistance Equivalent Number) values between the ferrite and austenite phases was the smallest when solution heat-treated at $1060^{\circ}C$. Based on the results of electrochemical tests and critical crevice temperature tests, the optimal annealing temperature is determined as $1060^{\circ}C$.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.2
• /
• pp.111-119
• /
• 1995

In this paper, we propose an efficient SA(simulated annealing) algorithm for the synthesis of binary phase computer generated hologram. SA algorithm is a method to find the optimal solution through iterative technique. It is important that selecting cost function and parameters within this algorithm. The aplications of converentional SA algorithm to synthesize parameters within this algorithm. The applications of conventional SA algorithm to synthesize binary hologram have many problems because of inappropriate paramters and cost function. So, we propose a new cost function and a calculation technique of proper parameters required to achieve the optimal solution. Computer simulation results show that the proposed method is better than conventional method in terms of diffraction efficiency and reconstruction error. Also, we show the reconstructed images by the proposed method through optical esperiment.