• Proceedings of the Optical Society of Korea Conference
• /
• 2003.02a
• /
• pp.108-109
• /
• 2003

적응광학(Adaptive optics, AO)계에서 왜곡된 파면을 폐회로 보정하기 위해서는 파면측정 장치와 파면보정 장치인 변형거울의 상관관계를 찾고 보정신호를 제어해주는 알고리즘이 필요하다. 일반적으로 적응광학계를 제어하는 방법을 지역(Zonal)제어와 모드(Modal)제어로 나눌 수 있다. 지역제어는 파면을 영역별로 나누어 파면보정 장치의 각 구동소자 위치에 대응하는 신호를 발생하여 제어하는 방법이고, 모드제어는 파면의 정보를 Zernike 다항식과 같은 일정한 기저함수들의 선형 합으로 표현한 뒤 각 모드에 해당하는 제어신호를 발생하여 전체 파면을 제어하는 방법이다. (중략)

• Communications for Statistical Applications and Methods
• /
• v.17 no.6
• /
• pp.811-827
• /
• 2010

This paper deals with a density estimation method in binary choice models that can be regarded as a statistical inverse problem. We use an orthogonal basis to estimate density function and consider the choice of an appropriate truncation parameter to reflect the model complexity and the prediction accuracy. We propose a data-dependent rule to choose the truncation parameter in the context of binary choice models. A numerical simulation is provided to illustrate the performance of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.5
• /
• pp.473-478
• /
• 2013

In this paper, we develop the Heavy Rain Advisory Decision Model based on intelligent neuro-fuzzy algorithm RBFNNs by using KLAPS(Korea Local Analysis and Prediction System) Reanalysis data. the prediction ability of existing heavy rainfall forecasting systems is usually affected by the processing techniques of meteorological data. In this study, we introduce the heavy rain forecast method using the pre-processing techniques of meteorological data are in order to improve these drawbacks of conventional system. The pre-processing techniques of meteorological data are designed by using point conversion, cumulative precipitation generation, time series data processing and heavy rain warning extraction methods based on KLAPS data. Finally, the proposed system forecasts cumulative rainfall for six hours after future t(t=1,2,3) hours and offers information to determine heavy rain advisory. The essential parameters of the proposed model such as polynomial order, the number of rules, and fuzzification coefficient are optimized by means of Differential Evolution.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.6
• /
• pp.1295-1303
• /
• 2015

In a mixture experiment, one may be interested in estimating not only main effects but also some interactions. Main effects and interactions may be estimated through appropriate designs such as simplex-centroid designs. However, the estimability problems, implied by the sum to one functional relationship among the factors, have strong consequences on the confounding and identifiability of models for such designs. To handle these problems, we address homogeneous polynomial model based on the computational commutative algebra (CCA) instead of using $Scheff{\acute{e}}s$ canonical model which is typically used. The problem posed here is to give how to choose estimable main effects and also some low-degree interactions. The theory is tested using a fraction of simplex-centroid designs aided by a modern computational algebra package CoCoA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.321-327
• /
• 2006

In this paper, when a H-polarized plane wave is incident on the grating consisting of uniform resistive strips, electromagnetic scattering is analyzed using the moment of methods (MoM). The current density of each resistive strip on a grounded dielectric plane is fixed by zero at both edges. To satisfy the condition at both ends of each resistive strip, the induced surface current density is expanded in a series of cosine and sine functions. The scattered electromagnetic fields are expanded in a series of floquet mode functions. The boundary conditions are applied to obtain the unknown current coefficients. According to the variation of the involving parameters such as strip width and spacing and angle of the incident field, numerical simulations are performed by applying the Fourier-Galerkin moment method. The numerical results of the normalized reflected power for resistive strips case for zero and several resistivities are obtained.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.6 s.121
• /
• pp.656-663
• /
• 2007

In this paper, when a E-polarized plane wave is incident on the grating consisting of tapered resistive strips, electromagnetic scattering is analyzed using the method of moments(MoM). The induced current density of each resistive strip in a grounded double dielectric layer is expected to blow up at both edges. To satisfy this, the induced surface current density is expanded in a series of Chebyshev polynomials of the second kind. The scattered electromagnetic fields are expanded in a series of Floquet mode functions. The boundary conditions are applied to obtain the unknown current coefficients. According to the variation of the involving parameters such as strip width and spacing and angle of the incident field, numerical simulations are performed by applying the Fourier-Galerkin moment method. The numerical results of the normalized reflected power for resistive strips case for several resistivities are obtained.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.1
• /
• pp.33-39
• /
• 2007

Finite field multipliers are the basic building blocks in many applications such as error-control coding, cryptography and digital signal processing. Hence, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, a new bit serial structure for a multiplier with low latency in Galois field is presented. To speed up multiplication processing, we divide the product polynomial into several parts and then process them in parallel. The proposed multiplier operates standard basis of $GF(2^m)$ and is faster than bit serial ones but with lower area complexity than bit parallel ones. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.5
• /
• pp.11-22
• /
• 2010

Recently, Fan and Dai introduced a Shifted Polynomial Basis and construct a non-pipeline bit-parallel multiplier for $F_{2^n}$. As the name implies, the SPB is obtained by multiplying the polynomial basis 1, ${\alpha}$, ${\cdots}$, ${\alpha}^{n-1}$ by ${\alpha}^{-\upsilon}$. Therefore, it is easy to transform the elements PB and SPB representations. After, based on the Modified Shifted Polynomial Basis(MSPB), SPB bit-parallel Mastrovito type I and type II multipliers for all irreducible trinomials are presented. In this paper, we present a bit-parallel architecture to multiply in SPB. This multiplier have a space complexity efficient than all previously presented architecture when n ${\neq}$ 2k. The proposed multiplier has more efficient space complexity than the best-result when 1 ${\leq}$ k ${\leq}$ (n+1)/3. Also, when (n+2)/3 ${\leq}$ k < n/2 the proposed multiplier has more efficient space complexity than the best-result except for some cases.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.4
• /
• pp.355-360
• /
• 2015

In this paper, we propose the design of Radial Basis Function Neural Network based on PCA in order to recognize handwritten digits. The proposed pattern classifier consists of the preprocessing step of PCA and the pattern classification step of pRBFNNs. In the preprocessing step, Feature data is obtained through preprocessing step of PCA for minimizing the information loss of given data and then this data is used as input data to pRBFNNs. The hidden layer of the proposed classifier is built up by Fuzzy C-Means(FCM) clustering algorithm and the connection weights are defined as linear polynomial function. In the output layer, polynomial parameters are obtained by using Least Square Estimation (LSE). MNIST database known as one of the benchmark handwritten dataset is applied for the performance evaluation of the proposed classifier. The experimental results of the proposed system are compared with other existing classifiers.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.