• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.1
• /
• pp.63-73
• /
• 2021

This paper presents a algorithm for automatic target recognition robust to the influence of the flame in order to track the target by EOTS(Electro-Optical Targeting System) equipped on UAV(Unmanned Aerial Vehicle) when there is aerial target or marine target with flame at the same time. The proposed method converts infrared images of targets and flames into a gradient vector field, and applies each gradient magnitude to a polynomial curve fitting technique to extract polynomial coefficients, and learns them in a shallow neural network model to automatically recognize targets and flames. The performance of the proposed technique was confirmed by utilizing the various infrared image database of the target and flame. Using this algorithm, it can be applied to areas where collision avoidance, forest fire detection, automatic detection and recognition of targets in the air and sea during automatic flight of unmanned aircraft.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.58-65
• /
• 2021

Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.337-342
• /
• 2013

In this paper, we study a special class of linear codes, called skew cyclic codes, over the ring $R=F_p+vF_p$, where $p$ is a prime number and $v^2=v$. We investigate the structural properties of skew polynomial ring $R[x,{\theta}]$ and the set $R[x,{\theta}]/(x^n-1)$. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes. Based on this fact, we give the enumeration of distinct skew cyclic codes over R.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.929-937
• /
• 2003

Kernel type estimations of discontinuity point at an unknown location in regression function or its derivatives have been developed. It is known that the discontinuity point estimator based on $Gasser-M\ddot{u}ller$ regression estimator with a one-sided kernel function which has a zero value at the point 0 makes a poor asymptotic behavior. Further, the asymptotic variance of $Gasser-M\ddot{u}ller$ regression estimator in the random design case is 1.5 times larger that the one in the corresponding fixed design case, while those two are identical for the local polynomial regression estimator. Although $Gasser-M\ddot{u}ller$ regression estimator with a one-sided kernel function which has a non-zero value at the point 0 for the modification is used, computer simulation show that this phenomenon is also appeared in the discontinuity point estimation.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.581-582
• /
• 2006

This paper presents an integrated machining error compensation method based on PNN(Polynomial Neural Network) approach and inspection database of OMM(On-Machine-Measurement) system. To efficiently analyze the machining errors, two machining error parameters are defined and modeled using the PNN approach, which is used to determine machining errors for the considered cutting conditions. Experiments are carried out to validate the approaches proposed in this paper. In result, the proposed methods can be effectively implemented in a real machining situation, producing much fewer errors.

• The Mathematical Education
• /
• v.54 no.4
• /
• pp.365-383
• /
• 2015

Factorization asks the recognition of the structure of polynomials, compared to polynomial expansion with process characteristic. Therefore it makes students experience a lot of difficulties. This study aims to figure out causes of the difficulties by identifying students' cognitive characteristics in factorizing in the perspective of 'structure sense'. To do this, we gave six factorizing problems of three types to middle school students and selected six participants as interviewees based on the test results. They were classified into two categories, structure sense and non-structure sense. Through this interview, we figured out the interviewee's cognitive characteristics and the causes of difficulty in the perspective of structure sense. Furthermore, we suggested some didactical implications for encouraging structure sense in factorizing by identifying assistances and obstacles for recognition of structures.

• Korean Journal of Mathematics
• /
• v.29 no.3
• /
• pp.483-492
• /
• 2021

This article concerns the property that for any element a in a ring, if a²ⁿ = aⁿ for some n ≥ 2 then a² = a. The class of rings with this property is large, but there also exist many kinds of rings without that, for example, rings of characteristic ≠2 and finite fields of characteristic ≥ 3. Rings with such a property is called reduced-over-idempotent. The study of reduced-over-idempotent rings is based on the fact that the characteristic is 2 and every nonzero non-identity element generates an infinite multiplicative semigroup without identity. It is proved that the reduced-over-idempotent property pass to polynomial rings, and we provide power series rings with a partial affirmative argument. It is also proved that every finitely generated subring of a locally finite reduced-over-idempotent ring is isomorphic to a finite direct product of copies of the prime field {0, 1}. A method to construct reduced-over-idempotent fields is also provided.

• Geomechanics and Engineering
• /
• v.23 no.6
• /
• pp.547-560
• /
• 2020

This paper studies the dynamic foundation-soil-foundation interaction for two square rigid foundations embedded in a viscoelastic soil layer. The vibrations come from only one rigid foundation placed in the soil layer and subjected to harmonic loads of translation, rocking, and torsion. The required dynamic response of rigid surface foundations constitutes the solution of the wave equations obtained by taking account of the conditions of interaction. The solution is formulated using the frequency domain Boundary Element Method (BEM) in conjunction with the Kausel-Peek Green's function for a layered stratum, with the aid of the Thin Layer Method (TLM), to study the dynamic interaction between adjacent foundations. This approach allows the establishment of a mathematical model that enables us to determine the dynamic displacements amplitude of adjacent foundations according to their different separations, the depth of the substratum, foundations masss, foundations embedded, and the frequencies of excitation. This paper attempts to introduce an approach based on a polynomial mathematical tool conducted from several results of numerical methods (BEM-TLM) so that practicing civil engineers can evaluation the dynamic foundations displacements more easy.

• Proceedings of the IEEK Conference
• /
• 2003.07c
• /
• pp.2633-2636
• /
• 2003

This study focuses on the new hardware design of fast and low-complexity multiplier over GF(2$\^$m/). The proposed multiplier based on the irreducible all one polynomial (AOP) of degree m, to reduced the system's complexity. It composed of Cyclic Shift, Partial Product, and Modular Summation Blocks. Also it consists of (m＋1)$^2$2-input AND gates and m(m＋1) 2-input XOR gates. Out architecture is very regular, modular and therefore, well-suited for VLSI implementation.