• Proceedings of the KIEE Conference
• /
• 1999.07a
• /
• pp.214-216
• /
• 1999

This paper discussed an optimal designs of 2 pole fan motors in refrigerator using a Niching Algorithm. We applied a Niching method to multi-objective optimal design of air gap construct. This Niching genetic algorithm is called "Restricted Competition Selection"(RCS) that is suitable for real world problem such as shape or structural optimization of electromagnetic device. The finite element method being used for nonlinear numerical characteristic analysis is provided exact solution in the system. Through this process is reduced the cogging torque ripple in air gap.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.344-350
• /
• 2009

In this paper, we propose a new interconnection network, hierarchical odd network HON($C_d,C_d$), which used the odd network as basic modules. We investigate various topological properties of HON($C_d,C_d$), including connectivity, routing algorithm, diameter and broadcasting. We show that HON($C_d,C_d$) outperforms the three networks, i.e. the odd network, HCN(m,m), and HFN(m,m).

• Journal of Computing Science and Engineering
• /
• v.3 no.2
• /
• pp.109-126
• /
• 2009

Taxonomies are widely used to classify information, and multiple (possibly competing) taxonomies often exist for the same domain. Given a set of correspondences between two taxonomies, it is often necessary to "merge" the taxonomies, thereby creating a unied taxonomy (e.g., that can then be used by data integration and discovery applications). We present an algorithm for merging taxonomies that have been related using articulations given as RCC-5 constraints. Two taxa Nand M can be related using (disjunctions of) the ve base relations in RCC-5: M; N ${\subseteq}$M; N ${\supseteq}$; N ${\oplus}$M (partial overlap of Nand M); and N ! M (disjointness: N ${\cap}$M = ${\varnothing}$). RCC-5 is increasingly being adopted by scientists to specify mappings between large biological taxonomies. We discuss the properties of the proposed merge algorithm and evaluate our approach using real-world taxonomies.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.12
• /
• pp.2109-2115
• /
• 2007

The wind generators have been installed with high output power to increase the energy production and efficiency. Hence, Optimal design of the direct-driven PM wind generator, coupled with F.E.M(Finite Element Method) and Genetic Algorithm(GA), has been performed to maximize the Annual Energy Production(AEP) over the whole wind speed characterized by the statistical model of wind speed distribution. Particularly, the parallel computing via internet web service has been applied to loose excessive computing times for optimization. The results of the optimal design of Surface-Mounted Permanent Magnet Synchronous Generator(SPMSG) are compared with each other candidates to verify the usefulness of the maximizing AEP model.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.3E
• /
• pp.12-21
• /
• 1998

In this paper, we describe the one channel five-way, V/U/M/N/S (Voice/Unvoice/Nasal/Silent), classification algorithm for automatically classifying speech. The decision making process is viewed as a pattern viewed as a pattern recognition problem. Two aspects of the algorithm are developed: feature selection and classifier type. The feature selection procedure is studied for identifying a set of features to make V/U/M/N/S classification. The classifiers used are a vector quantization (VQ), a neural network(NN), and a decision tree method. Actual five sentences spoken by six speakers, three male and three female, are tested with proposed classifiers. From a set of measurement tests, the proposed classifiers show fairly good accuracy for V/U/M/N/S decision.

• Communications of Mathematical Education
• /
• v.21 no.4
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.414-422
• /
• 2011

This paper describes a design of low-density parity-check(LDPC) decoder supporting block length 2,304-bit and code rate 1/2 of IEEE 802.16e mobile WiMAX standard. The designed LDPC decoder employs the min-sum algorithm and partially parallel layered-decoding architecture which processes a sub-matrix of $96{\times}96$ in parallel. By exploiting the properties of the min-sum algorithm, a new memory reduction technique is proposed, which reduces check node memory by 46% compared to conventional method. Functional verification results show that it has average bit-error-rate(BER) of $4.34{\times}10^{-5}$ for AWGN channel with Fb/No=2.1dB. Our LDPC decoder synthesized with a $0.18{\mu}m$ CMOS cell library has 174,181 gates and 52,992 bits memory, and the estimated throughput is about 417 Mbps at 100-MHz@l.8-V.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.7
• /
• pp.693-700
• /
• 2016

It is important that we can calculate the order of non-supersingular elliptic curves with large prime factors over the finite field GF(q) to guarantee the security of public key cryptosystems based on discrete logarithm problem(DLP). Schoof algorithm, however, which is used to calculate the order of the non-supersingular elliptic curves currently is so complicated that many papers are appeared recently to update the algorithm. To avoid Schoof algorithm, in this paper, we propose an algorithm to calculate orders of elliptic curves over finite composite fields of the forms $GF(2^m)=GF(2^{rs})=GF((2^r)^s)$ using Weil's theorem. Implementing the program based on the proposed algorithm, we find a efficient non-supersingular elliptic curve over the finite composite field $GF(2^5)^{31})$ of the order larger than $10^{40}$ with prime factor larger than $10^{40}$ using the elliptic curve $E(GF(2^5))$ of the order 36.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.50 no.11
• /
• pp.539-545
• /
• 2001

A simple analysis method for inverter-fed induction motor using F.E.M and harmonic equivalent circuit is proposed. And an optimum shape of rotor slot for 2Hp inverter-fed induction motor is determined by combining the proposed analysis method and an optimization algorithm. Conjugate gradient method is used for the optimization algorithm. The optimization is performed for higher efficiency and reduction of harmonic loss in the inverter-fed induction motor. The optimization results are verified by comparing with those of the time-step F.E.A.

• Steel and Composite Structures
• /
• v.4 no.6
• /
• pp.453-469
• /
• 2004

In this article, a genetic algorithm based optimum design method is presented for non-linear steel frames with semi-rigid connections. The design algorithm obtains the minimum weight frame by selecting suitable sections from a standard set of steel sections such as European wide flange beams (i.e., HE sections). A genetic algorithm is employed as optimization method which utilizes reproduction, crossover and mutation operators. Displacement and stress constraints of Turkish Building Code for Steel Structures (TS 648, 1980) are imposed on the frame. The algorithm requires a large number of non-linear analyses of frames. The analyses cover both the non-linear behaviour of beam-to-column connection and $P-{\Delta}$ effects of beam-column members. The Frye and Morris polynomial model is used for modelling of semi-rigid connections. Two design examples with various type of connections are presented to demonstrate the application of the algorithm. The semi-rigid connection modelling results in more economical solutions than rigid connection modelling, but it increases frame drift.