• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.319-339
• /
• 2010

In this paper, we prove that if $f^nf'\;-\;P$ and $g^ng'\;-\;P$ share 0 CM, where f and g are two distinct transcendental meromorphic functions, $n\;{\geq}\;11$ is a positive integer, and P is a nonzero polynomial such that its degree ${\gamma}p\;{\leq}\;11$, then either $f\;=\;c_1e^{cQ}$ and $g\;=\;c_2e^{-cQ}$, where $c_1$, $c_2$ and c are three nonzero complex numbers satisfying $(c_1c_2)^{n+1}c^2\;=\;-1$, Q is a polynomial such that $Q\;=\;\int_o^z\;P(\eta)d{\eta}$, or f = tg for a complex number t such that $t^{n+1}\;=\;1$. The results in this paper improve those given by M. L. Fang and H. L. Qiu, C. C. Yang and X. H. Hua, and other authors.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.9
• /
• pp.2322-2330
• /
• 1994

The torsion problem in a cylindrical rod is usually formulated in terms of either the warping function or the Prandtl stress function. In a rod whose cross-section is bounded by circles and rectangles, we develop an analytic solution approach based on the warping function, which satisfies Laplace's equation. The present formulation employs polynomials and The Fourier series-type solutions, both of which satisfy exactly the governing differential equation. Using the present method, the maximum shear stress and torsional rigidity are efficiently and accurately calculated and the present results are compared with those by other methods. The specific numerical examples include the case with eccentric holes which was investigated earlier. The finite element results are also compared with the present results.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.369-376
• /
• 2000

For the general loading condition and boundary condition, it is very difficult to obtain closed-form solutions for buckling loads and natural frequencies of thin-walled structures because its behaviour is very complex due to the coupling effect of bending and torsional behaviour. Consequently most of previous finite element formulations introduced approximate displacement fields using shape functions as Hermitian polynomials, isoparametric interpoation function, and so on. The purpose of this study is to calculate the exact displacement field of a thin-walled straight beam element with the non-symmetric cross section and present a consistent derivation of the exact dynamic stiffness matrix. An exact dynamic element stiffness matrix is established from Vlasov's coupled differential equations for a uniform beam element of non-symmetric thin-walled cross section. This numerical technique is accomplished via a generalized linear eigenvalue problem by introducing 14 displacement parameters and a system of linear algebraic equations with complex matrices. The natural frequencies are evaluated for the non-symmetric thin-walled straight beam structure, and the results are compared with available solutions in order to verify validity and accuracy of the proposed procedures.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.411-421
• /
• 2016

In this paper, we investigate the problem of transcendental entire functions that share two values with one of their derivative. Let f be a transcendental entire function, n and k be two positive integers. If $f^n-Q_1$ and $(f^n)^{(k)}-Q_2$ share 0 CM, and $n{\geq}k+1$, then $(f^n)^{(k)}{\equiv}{\frac{Q_2}{Q_1}}f^n$. Furthermore, if $Q_1=Q_2$, then $f=ce^{\frac{\lambda}{n}z}$, where $Q_1$, $Q_2$ are polynomials with $Q_1Q_2{\not\equiv}0$, and c, ${\lambda}$ are non-zero constants such that ${\lambda}^k=1$. This result shows that the Conjecture given by W. $L{\ddot{u}}$, Q. Li and C. Yang [On the transcendental entire solutions of a class of differential equations, Bull. Korean Math. Soc. 51 (2014), no. 5, 1281-1289.] is true. Also we exhibit some examples to show that the conditions of our result are the best possible.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.225-231
• /
• 2013

In this study, we propose the design of optimized pRBFNNs-based night vision face recognition system using PCA algorithm. It is difficalt to obtain images using CCD camera due to low brightness under surround condition without lighting. The quality of the images distorted by low illuminance is improved by using night vision camera and histogram equalization. Ada-Boost algorithm also is used for the detection of face image between face and non-face image area. The dimension of the obtained image data is reduced to low dimension using PCA method. Also we introduce the pRBFNNs as recognition module. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned by using Fuzzy C-Means clustering. In the conclusion part of rules, the connection weights of pRBFNNs is represented as three kinds of polynomials such as linear, quadratic, and modified quadratic. The essential design parameters of the networks are optimized by means of Differential Evolution.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.5
• /
• pp.744-752
• /
• 2012

In this study, the Polynomial-based Radial Basis Function Neural Networks is proposed as an one of the recognition part of overall face recognition system that consists of two parts such as the preprocessing part and recognition part. The design methodology and procedure of the proposed pRBFNNs are presented to obtain the solution to high-dimensional pattern recognition problems. In data preprocessing part, Principal Component Analysis(PCA) which is generally used in face recognition, which is useful to express some classes using reduction, since it is effective to maintain the rate of recognition and to reduce the amount of data at the same time. However, because of there of the whole face image, it can not guarantee the detection rate about the change of viewpoint and whole image. Thus, to compensate for the defects, Linear Discriminant Analysis(LDA) is used to enhance the separation of different classes. In this paper, we combine the PCA&LDA algorithm and design the optimized pRBFNNs for recognition module. The proposed pRBFNNs architecture consists of three functional modules such as the condition part, the conclusion part, and the inference part as fuzzy rules formed in 'If-then' format. In the condition part of fuzzy rules, input space is partitioned with Fuzzy C-Means clustering. In the conclusion part of rules, the connection weight of pRBFNNs is represented as two kinds of polynomials such as constant, and linear. The coefficients of connection weight identified with back-propagation using gradient descent method. The output of the pRBFNNs model is obtained by fuzzy inference method in the inference part of fuzzy rules. The essential design parameters (including learning rate, momentum coefficient and fuzzification coefficient) of the networks are optimized by means of Differential Evolution. The proposed pRBFNNs are applied to face image(ex Yale, AT&T) datasets and then demonstrated from the viewpoint of the output performance and recognition rate.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.185-223
• /
• 2022

The classical equation of Jonathan Homer Lane and Robert Emden, a nonlinear second-order ordinary differential equation, models the isothermal spherical clouded gases under the influence of the mutual attractive interaction between the gases' molecules. In this paper, the Adomian decomposition method (ADM) is presented to obtain highly accurate and reliable analytical solutions of a class of generalised Lane-Emden equations with strong nonlinearities. The nonlinear term f(y(x)) of the proposed problem is given by the integer powers of a continuous real-valued function h(y(x)), that is, f(y(x)) = h^m(y(x)), for integer m ≥ 0, real x > 0. In the end, numerical comparisons are presented between the analytical results obtained using the ADM and numerical solutions using the eighth-order nested second derivative two-step Runge-Kutta method (NSDTSRKM) to illustrate the reliability, accuracy, effectiveness and convenience of the proposed methods. The special cases h(y) = sin y(x), cos y(x); h(y) = sinh y(x), cosh y(x) are considered explicitly using both methods. Interestingly, in each of these methods, a unified result is presented for an integer power of any continuous real-valued function - compared with the case by case computations for the nonlinear functions f(y). The results presented in this paper are a generalisation of several published results. Several examples are given to illustrate the proposed methods. Tables of expansion coefficients of the series solutions of some special Lane-Emden type equations are presented. Comparisons of the two results indicate that both methods are reliably and accurately efficient in solving a class of singular strongly nonlinear ordinary differential equations.

• Structural Engineering and Mechanics
• /
• v.53 no.5
• /
• pp.981-995
• /
• 2015

This paper presents a finite element procedure for dynamic analysis of non-uniform Timoshenko beams made of axially Functionally Graded Material (FGM) under multiple moving point loads. The material properties are assumed to vary continuously in the longitudinal direction according to a predefined power law equation. A beam element, taking the effects of shear deformation and cross-sectional variation into account, is formulated by using exact polynomials derived from the governing differential equations of a uniform homogenous Timoshenko beam element. The dynamic responses of the beams are computed by using the implicit Newmark method. The numerical results show that the dynamic characteristics of the beams are greatly influenced by the number of moving point loads. The effects of the distance between the loads, material non-homogeneity, section profiles as well as aspect ratio on the dynamic responses of the beams are also investigated in detail and highlighted.

• Research in Mathematical Education
• /
• v.8 no.2
• /
• pp.107-114
• /
• 2004

University teachers of linear algebra often feel annoyed and disarmed when faced with the inability of their students to cope with concepts that they consider to be very simple. Usually, they lay the blame on the impossibility for the students to use geometrical intuition or the lack of practice in basic logic and set theory. J.-L. Dorier [(2002): Teaching Linear Algebra at University. In: T. Li (Ed.), Proceedings of the International Congress of Mathematicians (Beijing: August 20-28, 2002), Vol. III: Invited Lectures (pp. 875-884). Beijing: Higher Education Press] mentioned that the situation could not be improved substantially with the teaching of Cartesian geometry or/and logic and set theory prior to the linear algebra. In East Asian countries, science-orientated mathematics curricula of the high schools consist of calculus with many other materials. To understand differential and integral calculus efficiently or for other reasons, students have to learn a lot of content (and concepts) in linear algebra, such as ordered pairs, n-tuple numbers, planar and spatial coordinates, vectors, polynomials, matrices, etc., from an early age. The content of linear algebra is spread out from grades 7 to 12. When the high school teachers teach the content of linear algebra, however, they do not concern much about the concepts of content. With small effort, teachers can help the students to build concepts of vocabularies and languages of linear algebra.