• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.1-20
• /
• 2003

A modified ABS algorithm for solving a class of singular non-linear systems, $F(x) = 0, $F\;\in \;R^n$, constructed by combining the discreted ABS algorithm and a method of Hoy and Schwetlick (1990), is presented. The second differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.45-52
• /
• 2001

In this paper, we examine the method for evaluating the security of SPN structures against differential cryptanalysis and linear cryptanalysis. We present an example of SPN structures in which there is a considerable difference between the differential probabilities and the characteristic probabilities. Then we 7pose an algorithm for estimating the maximum differential probabilities and the maximum linear hull probabilities of SPN structures and an useful method for accelerating the proposed algorithm. By using this method, we obain the maximum differential probabilities and the maximum linear probabilities of round function F of block cipher E2.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.4
• /
• pp.541-553
• /
• 1995

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

• Proceedings of the KSRS Conference
• /
• 2008.03a
• /
• pp.164-169
• /
• 2008

한국해양연구원에서 수신한 자료인 NOAA 12, 16, 17, 18호등의 Advanced Very High Resolution Radiometer(AVHRR) 센서자료와 국립조사원에서 제공하는 해양실측자료인 정선 관측 자료를 이용하여 두 가지의 알고리즘 적용을 통하여 비교 및 분석을 해보고자 한다. 연구 기간은 2006년 1월부터 4월 자료 중 구름의 영향이 없는 영상에서 실측자료와 동일한 날짜 총 107개의 정점 값을 추출하였다. 위성 자료에서 해수면 온도 추출방법은 split window 방법으로, 고정계수 값을 사용하는 linear algorithm(MCSST), nonlinear algorithm(NLMCSST)을 이용하였다. 연구 지역은 동해, 황해, 남해 지역에 대한 지역별로 두 알고리즘을 비교 적용하였다. 전 해역의 값을 이용하여 위성자료와 실측자료를 비교 분석한 결과 linear algorithm방법의 평균 오차 값은 0.71$^{\circ}C$이고 상관도는 1%이고, nonlinear 방법의 오차 값은 0.35$^{\circ}C$ 상관도는 1%로 나타났다. 해역별로는 linear한 알고리즘을 적용하여 동해는(ES)는 R=1, 오차 값은 0.37$^{\circ}C$ 황해(YS)는 R=0.99 오차 값은 0.125$^{\circ}C$ 남해(SS)는 R=0.99 오차 값은 1.2$^{\circ}C$보였다. nonlinear한 알고리즘을 적용하여 동해는(ES)는 R=1, 오차 값은 0.4$^{\circ}C$ 황해(YS)는 R=0.99 오차 값은 0.13$^{\circ}C$ 남해(SS)는 R=0.99 오차 값은 0.82$^{\circ}C$의 결과를 보여 주었다. 동해와 황해지역은 linear한 알고리즘을 적용한 결과가 실측자료와의 오차 값이 작았고, 남해지역은 linear한 알고리즘을 적용한 결과보다 nonlinear 알고리즘을 적용한 것이 작은 오차 값을 보여주었다. 이는 남해 해역의 자료가 대기의 상태나 다른 영향을 받아 해수면온도 값이 추정된 것으로 보여 진다. 해역별로 최적화된 알고리즘을 적용하여 해수면온도의 산출을 통해서 위성자료의 정밀도 지구환경변화 모니터링 등 많은 연구에 위성자료의 활용이 증대될 것으로 기대한다.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.4
• /
• pp.184-190
• /
• 2006

Recently, Lee et al. have proposed an algorithm utilizing the signals from different paths by using bottom mounted simple linear array to estimate 3-D location of oceanic target. But this algorithm assumes that sound velocity is constant along depth of sea. Consequently, serious performance loss is appeared in real oceanic environment that sound speed is changed variously. In this paper, we present a 3-D near field localization algorithm for inhomogeneous sound speed. The proposed algorithm adopt localization function that utilize ray propagation model for multipath environment with linear sound speed profile(SSP), after that, the proposed algorithm searches for the instantaneous azimuth angle, range and depth from the localization cost function. Several simulations using linear SSP and non linear SSP similar to that of real oceans are used to demonstrate the performance of the proposed algorithm. The estimation error in range and depth is decreased by 100m and 50m respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.444-448
• /
• 2003

In this paper, the Lagrange dynamics is studied. A state space representation of Lagrange dynamics and control algorithm based on the state feedback pole placement are presented. The state space model presented is descriptor type linear parameter dependent system. It is shown that the control algorithms based on the linear system theory can be applicable to the state space representation of Lagrange dynamics. To show that the linear system theory can be applicable to the state space representation of Lagrange dynamics, the LMI based regional pole-placement design algorithm is developed and present two examples.

• Journal of the Korea Convergence Society
• /
• v.5 no.4
• /
• pp.163-169
• /
• 2014

A stable neural network control scheme for unknown non-linear systems is developed in this paper. While the control variable is optimised to minimize the performance index, convergence of the index is guaranteed asymptotically stable by a Lyapnov control law. The optimization is achieved using a gradient descent searching algorithm and is consequently slow. A fast convergence algorithm using an adaptive learning rate is employed to speed up the convergence. Application of the stable control to a single input single output (SISO) non-linear system is simulated. The satisfactory control performance is obtained.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.172-177
• /
• 1988

In this paper, a new fast algorithm of FIR least squares filter with linear phase is presented. The general unknown statistics case is considered, whereby only sample records of the data are available. Taking advantage of the near-to-Toeplitz+Hankel structure of the resulting normal equation, a fast algorithm which gurantees the linear phase constraint, is developed that recursively produces the filter coefficient of linear phase FIR filter for a single block of data.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.161-166
• /
• 2016

This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.1
• /
• pp.13-20
• /
• 2005

This paper has proposed an algorithm for the initial pole position estimation of a permanent magnet linear synchronous motor(PMLSM). The algorithm finds the initial pole position observing the maximum values of a position generated by the new proposed two reference frames for the same force input. So, the proposed algorithm does not utilize the motor parameters and is insensitive to them. Moreover, the proposed algorithm is easily realized because the proposed method is just using PI controller