• 한국정보디스플레이학회:학술대회논문집
• /
• 2004.08a
• /
• pp.650-653
• /
• 2004

We have synthesized some phosphors in the system MO-$Al_2O_3-SiO_2$(M=Sr, Ba) by combinatorial polymerized-complex method. Composition and synthetic temperature of phosphors in the liblary was screened from the emission intensities of individual samples under 365nm excitation. As we were screened the higher luminescent candidate composition (or candidate host lattice) at 365nm excitation, investigated whether good radiation was possible at the 405 or 465nm excitation by give the host lattice to be discovered more various change. From libraries about 2 systems, the compound to be expected in long wavelength among the compound to be screened are $Sr_4Al_{14}O_{25}$, $Sr_3Al_2O_6$, $SrAl_2Si_2O_8$, and $BaAl_2Si_2O_8$.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.201-208
• /
• 2010

This research is about developing an efficient solution procedure for the vehicle routing problem under varying vehicle moving speeds for hour-based time interval. Different moving speeds for every hour is too difficult condition to solve for this type of combinatorial optimization problem. A methodology to divide the 12 hour based time interval offered by government into 5 different time intervals and then divide delivery area into 12 small divisions first and then re-organizing them into 5 groups. Then vehicle moving speeds are no longer varying in each of the 5 divisions. Therefore, a typical TSP solution procedure may be applied to find the shortest path for all 5 divisions and then connect the local shortest paths to form a delivery path for whole area. Developed solution procedures are explained in detail with 60 points example.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2003.07a
• /
• pp.836-839
• /
• 2003

We have synthesized some phosphors in the system $CaO-Y_{2}O_3-Al_{2}O_{3}$ by combinatorial polymerized-complex method. Composition and synthetic temperature of phosphors in the liblary was screened from the emission intensities of individual samples under VUV excitation. In $Tb^{3+}$-activated $CaO-Y_{2}O_3-Al_{2}O_{3}$, green phosphors showing good intensity were found to be $CaYAl_{3}O_{7}$, $CaYalO_{4}$, $YAlO_{3}$, $Y_{3}Al_{5}O_{12}$, $Y_{4}Al_{2}O_{9}$, $Ca_{3}Al_{2}O6$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.27-36
• /
• 2000

We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.892-894
• /
• 2005

Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

• Proceedings of the Korean Powder Metallurgy Institute Conference
• /
• 2006.09a
• /
• pp.254-255
• /
• 2006

Powder library of pseudo four components Li-Ni-Co-Ti compounds were prepared for exploring the composition region with the single phase of the layer-type structure by using combinatorial high-throuput preparation system "M-ist Combi" based on electrostatic spray deposition method. The new layer-type compounds were found wider composition region than the previous report. This process is promising way to find multi component functional materials.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.49.3-49
• /
• 2001

In 1994 Adelman´s pioneer work demonstrated that deoxyribonucleic acid (DNA) could be used as a medium for computation to solve mathematical problems. He described the use of DNA based computational approach to solve the Hamiltonian Path Problem (HPP). Since then a number of combinatorial problems have been analyzed by DNA computation approaches including, for example: Maximum Independent Set (MIS), Maximal Clique and Satisfaction (SAT) Problems. In the present paper we propose a method of solving another classic combinatorial optimization problem - the eraph Coloring Problem (GCP), using specifically designed circular DNA plasmids as a computation tool. The task of the analysis is to color the graph so that no two nodes ...

• ETRI Journal
• /
• v.46 no.3
• /
• pp.367-378
• /
• 2024

We propose a number-theory-based quantized mathematical optimization scheme for various NP-hard and similar problems. Conventional global optimization schemes, such as simulated and quantum annealing, assume stochastic properties that require multiple attempts. Although our quantization-based optimization proposal also depends on stochastic features (i.e., the white-noise hypothesis), it provides a more reliable optimization performance. Our numerical analysis equates quantization-based optimization to quantum annealing, and its quantization property effectively provides global optimization by decreasing the measure of the level sets associated with the objective function. Consequently, the proposed combinatorial optimization method allows the removal of the acceptance probability used in conventional heuristic algorithms to provide a more effective optimization. Numerical experiments show that the proposed algorithm determines the global optimum in less operational time than conventional schemes.

• Bulletin of the Korean Mathematical Society
• /
• v.25 no.2
• /
• pp.247-251
• /
• 1988

This note gives a combinatorial treatment to the problem finding a generating set among conjugating automorphisms of a free group and to the method deciding when a conjugating endomorphism of a free group is an automorphism. Our group of pseudo-conjugating automorphisms can be thought of as a generalization of the artin's braid group.