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

In the area of tracking control, it is important to design not only the controllers but also the trajectories to which a system has to follow. $5^{th}$ order polynomial is often used with constraints of initial and final states. Smooth ending with possible minimum time is important for many systems because of vibration or jerky motions. Examples are increased with development of technology in smaller, more accurate systems. On the base of a polynomial like trajectory generation method from a paper in ACC2002 and RIC(Robust Internal-loop Compensator) control scheme of Robotics and Bio-mechanics lab. of POSTECH, generalized and expanded polynomial like trajectory generation method is showed.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.59-64
• /
• 2014

We investigate $p(n){\cdot}2^{O(\sqrt{n})}$ algorithm for 0/1 knapsack problem where x is the total bit length of a list of sizes of n objects. The algorithm is adaptable of method that achieves a similar complexity for the partition and Subset Sum problem. The method can be applied to other optimization or decision problem based on a list of numerics sizes or weights. 0/1 knapsack problem can be used to solve NP-Complete Problems with pseudo-polynomial time algorithm. We try to apply this technique to bio-informatics problem which has pseudo-polynomial time complexity.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.948-955
• /
• 1987

The model reduction method of the high order linear time invariant systems is proposed. The continuous fraction expansion of Auxiliary denominator polynomial is used to obtain denominator polynomial of the reduced order model, and the numerator polynomial of the reduced order model is obtained by equating the first some moments of the original and the reduced order model, using simplified moment function. This methiod does not require the calculation of the reciprocal transformation which should be calculated in Routh approximation, furthemore the stability of the reduced order model is guaranted if original system is stable. Responses of this method showed us good characteristics.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2007

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form G(X)=$A_0X^m+A_1X^{m-1}+{\cdots}+A_m$ where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ real matrices. We show how the minimization methods can be used to solve the matrix polynomial G(X) and give some numerical experiments. We also compare Polak and Ribi$\acute{e}$re version and Fletcher and Reeves version of conjugate gradient method.

• Journal for History of Mathematics
• /
• v.36 no.1
• /
• pp.1-17
• /
• 2023

Paper folding is a versatile tool that can be used not only as a mathematical model for analyzing the geometric properties of plane and spatial figures but also as a visual method for finding the real roots of polynomial equations. The historical evolution of origami's geometric and algebraic techniques has led to the discovery of definitions and properties that can enhance one's cognitive understanding of mathematical concepts and generate mathematical interest and motivation on an emotional level. This paper aims to examine the history of origami geometry, the utilization of origami for solving polynomial equations, and the process of determining the real roots of quadratic, cubic, and quartic equations through origami techniques.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.7
• /
• pp.378-388
• /
• 2000

In this paper, we propose Fuzzy Polynomial Neural Networks(FPNN) based on Polynomial Neural Networks(PNN) and Fuzzy Neural Networks(FNN) for model identification of complex and nonlinear systems. The proposed FPNN is generated from the mutually combined structure of both FNN and PNN. The one and the other are considered as the premise part and consequence part of FPNN structure respectively. As the consequence part of FPNN, PNN is based on Group Method of Data Handling(GMDH) method and its structure is similar to Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and self-organizing networks that can be generated. FPNN is available effectively for multi-input variables and high-order polynomial according to the combination of FNN with PNN. Accordingly it is possible to consider the nonlinearity characteristics of process and to get better output performance with superb predictive ability. As the premise part of FPNN, FNN uses both the simplified fuzzy inference as fuzzy inference method and error back-propagation algorithm as learning rule. The parameters such as parameters of membership functions, learning rates and momentum coefficients are adjusted using genetic algorithms. And we use two kinds of FNN structure according to the division method of fuzzy space of input variables. One is basic FNN structure and uses fuzzy input space divided by each separated input variable, the other is modified FNN structure and uses fuzzy input space divided by mutually combined input variables. In order to evaluate the performance of proposed models, we use the nonlinear function and traffic route choice process. The results show that the proposed FPNN can produce the model with higher accuracy and more robustness than any other method presented previously. And also performance index related to the approximation and prediction capabilities of model is evaluated and discussed.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.501-506
• /
• 2007

A generalized finite difference method for solving solid mechanics problems such as elasticity and crack problems is presented. The method is constructed in framework of Taylor polynomial based on the Moving Least Squares method and collocation scheme based on the diffuse derivative approximation. The governing equations are discretized into the difference equations and the nodal solutions are obtained by solving the system of equations. Numerical examples successfully demonstrate the robustness and efficiency of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.119-124
• /
• 2011

Interpolation filters are widely used in many communication and multimedia applications. Polynomial interpolation computes the coefficients of the polynomial according to the input information to obtain the interpolated value. Recently, FIR interpolation method using supplementary filters was proposed to improve the performances of polynomial interpolation methods. In this paper, by combining a weighting factor approach with the supplementary filter method, we propose a weighted interpolation method which can be efficiently used to compute the maximum or minimum values of a given curve using only a restricted number of sample values. With application to the interpolation of normal distribution curves used in XRF systems, it is shown that the proposed approach exhibits improved performances compared with conventional interpolation methods.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.19 no.4
• /
• pp.447-457
• /
• 2021

Graphite Isotope Ratio Method (GIRM) can be used to estimate plutonium production in a graphite-moderated reactor. This study presents verification results for the GIRM combined with a 3-D polynomial regression function to estimate cumulative plutonium production in a graphite-moderated reactor. Using the 3-D Monte-Carlo method, verification was done by comparing the cumulative plutonium production with the GIRM. The GIRM can estimate plutonium production for specific sampling points using a function that is based on an isotope ratio of impurity elements. In this study, the ¹⁰B/¹¹B isotope ratio was chosen and calculated for sampling points. Then, 3-D polynomial regression was used to derive a function that represents a whole core cumulative plutonium production map. To verify the accuracy of the GIRM with polynomial regression, the reference value of plutonium production was calculated using a Monte-Carlo code, MCS, up to 4250 days of depletion. Moreover, the amount of plutonium produced in certain axial layers and fuel pins at 1250, 2250, and 3250 days of depletion was obtained and used for additional verification. As a result, the difference in the total cumulative plutonium production based on the MCS and GIRM results was found below 3.1% with regard to the root mean square (RMS) error.

• Proceedings of the Optical Society of Korea Conference
• /
• 2005.07a
• /
• pp.240-241
• /
• 2005