• Proceedings of the KIEE Conference
• /
• 2006.07c
• /
• pp.1455-1456
• /
• 2006

반도체 에칭분야에 많이 이용되고 있는 $CF_4$, $C_{2}F_6$, $C_{3}F_8$가스들의 전자수송계수들을 볼츠만 방정식을 이용하여 해석하고자 한다. 특히 혼합가스를 이용하여 확산방전스위치에서 요구되어지는 특성을 파악하고자 할 때 시뮬레이션에 의한 적절한 혼합비 구현을 위하여 이들 순수가스들이 가지고 있는 전자충돌단면적을 해석하고, 전자이동속도와 부착계수 값을 2항과 다항근사 볼츠만 해석을 통해 $0.1{\sim}300$ Td에 걸친 광범위 표에서 해석하고자 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.149-155
• /
• 2013

Commonly, one seeks a particular pattern suitable for stock cutting and the number of such patterns through linear programming. However, since the number of the patterns increases exponentially, it is nearly impossible to predetermine all the existing patterns beforehand. This paper thus proposes an algorithm whereby one could accurately predetermine the number of existing patterns by applying Suliman's feasible pattern method. Additionally, this paper suggests a methodology by which one may obtain exact polynomial-time solutions for feasible patterns without applying linear programming or approximate algorithm. The suggested methodology categorizes the feasible patterns by whether the frequency of first occurrence of all the demands is distributed in 0 loss or in various losses. When applied to 2 data sets, the proposes algorithm is found to be successful in obtaining the optimal solutions.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.111-118
• /
• 2015

This paper deals with the routing and wavelength assignment problem (RWAP) that decides the best lightpaths for multiple packet demands for (s,t) in optical communication and assigns the minimum number of wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain the optimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain the approximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath with same hop count for all (s,t) for given network in advance. When the actual demands of communication for particular multiple packet for (s,t), we decrease the maximum utilized edge into b utilized number using these dual-paths. Then, we put these (s,t) into b-wavelength bins without duplicated edge. This algorithm can be get the optimal solution within O(kn) computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.9
• /
• pp.799-804
• /
• 2015

The purpose of this study is to analyse the dynamic disturbances(disturbed forces and disturbed torques) due to attitude control thruster's plume impingement on the solar arrays. To produce database of the dynamic disturbances a sweep analysis was done, in which the two parameters are used; the distance between the thruster and solar arrays and the thruster tilt angle. Based on the database, a third order polynomial approximation is computed to represent the characteristics of the disturbed forces and torques. The final results are the coefficients of the approximation for each solar array angle position. These results as input data are used to optimize the configuration of the attitude control thrusters. This analysis is appled to the two candidate solar arrays for Geo-Kompsat-2 satellite and the results of the disturbed forces and disturbed torques are compared and analysed.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.153-161
• /
• 2011

As the problem of GOSST building belongs to NP compete domain, heuristics for the problem ask for immense amount execution time and computations in large scale inputs. In this paper, we propose an efficient mechanism for GOSST construction using space locality PTAS. For 40,000 input nodes with maximum weight 100, the proposed space locality PTAS GOSST with 16 unit areas can reduce about 4.00% of connection cost and 89.26% of execution time less than weighted minimum spanning tree method. Though the proposed method increases 0.03% of connection cost more, but cuts down 96.39% of execution time less than approximate GOSST method (SGOSST) without PTAS. Therefore the proposed space locality PTAS GOSST mechanism can work moderately well to many useful applications where a greate number of weighted inputs should be connected in short time with approximate minimum connection cost.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.475-478
• /
• 2005

본 논문에서는 자기구성 퍼지다항식 뉴럴 네트워크(SOFPNN)를 구성하고 있는 퍼지 다항식뉴론(FPM)의 구조와 파라미터를 유전자 알고리즘을 이용하여 최적화시킨 새로운 개념의 진화론적 최적 고급 자기구성 퍼지 다항식 뉴릴 네트워크를 소개한다. 기존의 자기구성 퍼지 다항식 뉴럴 네트워크에서 모델을 설계할 때에는 설계자의 주관적인 특징과 시행착오에 의해서 모델을 구축하였다. 이러한 설계자의 경험을 배제하고 객관적이고 효율적인 모델을 구축하기 위해서 본 논문에서는 FPH의 파라미터들을 최적화 알고리즘인 유전자 알고리즘을 이용하여 동조하였다. 즉, 모델을 구축하는데 기본이 되는 FPN의 각각의 파라미터들-입력변수의 수, 다항식 차수, 입력변수, 멤버쉽 함수의 수, 그리고 멤버쉽 함수의 정점-을 동조함으로써 기존의 모델에 비해서 구조적으로 그리고 파라미터적으로 최적화된 네트워크를 생성할 수 있다. 뿐만 아니라 주어진 데이터의 특성을 모델 구축에 반영하고자 멤버쉽 함수의 정점 역시 유전자 알고리즘으로 동조하였다. 실험적 예제를 통하여 제안된 모델의 성능을 확인한 결과 기존의 퍼지모델 및 신경망 모델에 비해서 아주 우수한 근사화 능력과 일반화 능력을 가짐을 알 수 있다.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.05e
• /
• pp.69-72
• /
• 2003

This paper describes the information for the difference between two-term and multi-term approximation of the Boltzmann. In previous paper, we calculated the electron transport coefficients in pure Oxygen and Argon gases by using two-term approximation of Boltzmann equation. Therefore, in this paper, we calculated the electron transport coefficients(W and $N{\cdot}D_L$) in pure Oxygen and Argon gases for range of E/N values from 0.01~500[Td] at the temperature was 300[K] and pressure was 1[Torr] by using multi-term approximation of the Boltzmann equation by Robson and Ness, The results of two-term and multi-term approximation of the Boltzmann equation has been compared with the experimental data for a range of E/N.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.05e
• /
• pp.73-76
• /
• 2003

This paper describes the information for quantitative simulation of weakly ionized plasma. In previous paper, we calculated the electron transport coefficients in pure Xenon gas by using two-term approximation of Boltzmann equation. Therefore, in this paper, we calculated the electron transport coefficients(W, $N{\cdot}D_L$ and $D_{L/{\mu}}$) in pure Xenon gas for range of E/N values from 0.01 ~ 500[Td] at the temperature was 300[K] and pressure was 1[Torr] by using multi-term approximation of the Boltzmann equation by Robson and Ness, The results of two-term and multi-term approximation of the Boltzmann equation has been compared with the experimental data by L. S. Frost and A. V. Phelps for a range of E/N.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.11b
• /
• pp.141-144
• /
• 2001

An accurate cross sections set are necessary for the quantitatively understanding and modeling of plasma phenomena. By using the electron swarm method. we determine an accurate electron cross sections set for objective atoms or molecule at low electron energy range. In previous paper, we calculated the electron transport coefficients in pure $CF_4$ molecular gas by using two-term approximation of the Boltzmann equation. And by using this simulation method. we confirmed erroneous calculated results of transport coefficients for $CF_{4}$ molecule treated in this paper having 'C2v symmetry' as $C_{3}H_{8}$ and $C_{3}F_{8}$ which have large vibrational excitation cross sections which may exceed elastic momentum transfer cross section. Therefore, in this paper, we calculated the electron transport coefficients(W and $ND_L$) in pure $CF_4$ gas by using multi-term approximation of the Boltzmann equation by Robson and Ness which was developed at lames-Cook university, and discussed an application and/or validity of the calculation method by comparing the calculated results by two-term and multi-term approximation code.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.77-85
• /
• 2015

This paper proposes a location algorithm that locates newly built p-facilities in the optimal area with minimum cost in a city of n districts. This problem has been classified as NP-hard, to which no polynomial time algorithm exists. The proposed algorithm improves the shortcomings of existing Myopic algorithm by constructing until p-facilities and exchanging locations of p-th facility for p=[1, n-1]. When applied to experimental data of n=5, 7, 10, 55, the proposed algorithm has obtained an approximate value nearest possible to the optimal solution take precedence of reverse-delete method. This algorithm is also simply executable using Excel.