• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.2-2
• /
• 2000

This paper presents an adaptive control against uncertainties in tail-controlled STT (skid-to-Turn) missiles. First, we derive an analytic uncertainty model from a parametricaffine missile model developed by the authors. Based on this analytic model, an adaptive feedbacklinearizing control law accompanied by a sliding model control law is proposed. We provide analyses of stability and output tracking performance of the overall adaptive missile system. The performance and validity of the proposed adaptive control scheme is demonstrated by simulation.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.171-182
• /
• 2009

In this paper, we consider the parameter space of the rational plane curves with uni-branched singularity. We show that such a parameter space is decomposable into irreducible components which are rational varieties. Rational parametrizations of the irreducible components are given in a constructive way, by a repeated use of Abhyankar-Moh Epimorphism Theorem. We compute an enumerative invariant of this parameter space, and include explicit computational examples to recover some classically-known invariants.

• Honam Mathematical Journal
• /
• v.43 no.3
• /
• pp.403-416
• /
• 2021

It is known that the rank 2 stably free syzygy module P⁽²⁾ is not free. This algebraic fact was proved analytically, but this remarkable fact still lacks of a simple algebraic proof. The main purpose of this paper is to give a partially algebraic proof by making use of a theorem whose proof is quite topological, and the further properties of the module will be discussed.

• ALGAE
• /
• v.36 no.4
• /
• pp.299-314
• /
• 2021

Some species in the dinoflagellate genus Alexandrium are bioluminescent. Of the 33 formally described Alexandrium species, the bioluminescence capability of only nine species have been tested, and eight have been reported to be bioluminescent. The present study investigated the bioluminescence capability of seven Alexandrium species that had not been tested. Alexandrium mediterraneum, A. pohangense, and A. tamutum were bioluminescent, but A. andersonii, A. hiranoi, A. insuetum, and A. pseudogonyaulax were not. We also measured the bioluminescent intensity of A. affine, A. fraterculus, A. mediterraneum, A. ostenfeldii, A. pacificum, A. pohangense, A. tamarense, and A. tamutum. The mean 200-second-integrated bioluminescence intensity per cell ranged from 0.02 to 32.2 × 10⁴ relative luminescence unit per cell (RLU cell^-1), and the mean maximum bioluminescence intensity per cell per second (BL_Max) ranged from 0.01 to 10.3 × 10⁴ RLU cell^-1 s^-1. BL_Max was significantly correlated with the maximum growth rates of Alexandrium species, except for A. tamarense. A phylogenetic tree based on large subunit ribosomal DNA (LSU rDNA) showed that the bioluminescent species A. affine, A. catenella, A. fraterculus, A. mediterraneum, A. pacificum, and A. tamarense formed a large clade. However, the toxicity or mixotrophic capability of these species was split. Thus, their bioluminescence capability in this clade was more consistent than their toxicity or mixotrophic capability. Phylogenetic trees based on LSU rDNA and the luciferase gene of Alexandrium were consistent except for A. pohangense. The results of the present study can provide a basis for understanding the interspecific diversity in bioluminescence of Alexandrium.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.261-264
• /
• 2004

본 논문에서 는 muti-channel lattice 예측기를 사용하여 AP(affine projection) 알고리듬을 근사적으로 구현하는 알고리즘을 제안한다. Lattice 예측기의 예측 오차를 사용하여 TDL 필터 계수를 적응적으로 조정함으로써 AP 알고리듬을 근사화한다. 또한 전처리단으로 사용된 lattice 예측기를 TDL 필터와 결합함으로써 기존의 방법보다 계산량을 더욱 줄일 수 있는 알고리듬을 제안한다. 제안된 알고리즘은 기존의 알고리즘보다 적은 계산량을 필요로 하지 만 AP 알고리즘을 보다 근사적으로 구현할 수 있다는 장점이 있다.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.489-501
• /
• 2016

In this paper, we study the rigidity under $K{\ddot{a}}hler$ deformation of the complex structure of odd Lagrangian Grassmannians, i.e., the Lagrangian case $Gr_{\omega}$(n, 2n+1) of odd symplectic Grassmannians. To obtain the global deformation rigidity of the odd Lagrangian Grassmannian, we use results about the automorphism group of this manifold, the Lie algebra of infinitesimal automorphisms of the affine cone of the variety of minimal rational tangents and its prolongations.

• Journal of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.855-867
• /
• 1998

In the present paper, we introduce the notions of quaternionically planar curves and quaternionically projective transformations to the case of almost quaternionic manifold with symmetric affine connection. Also, we obtain an invariant tensor field under the quaternionically projective transformation, and show that a quaternionic Kahlerian manifold with such a vanishing tensor field is of constant Q-sectional curvature.

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1759-1786
• /
• 2017

We examine the moduli space of oriented locally homogeneous manifolds of Type ${\mathcal{A}}$ which have non-degenerate symmetric Ricci tensor both in the setting of manifolds with torsion and also in the torsion free setting where the dimension is at least 3. These exhibit phenomena that is very different than in the case of surfaces. In dimension 3, we determine all the possible symmetry groups in the torsion free setting.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.93-100
• /
• 1998

The researches of Linear Programming are Khachiyan Method, which uses Ellipsoid Method, and Karmarkar, Affine, Path-Following and Interior Point Method which have Polynomial-Time complexity. In this study, Karmarkar Method is more quickly solved as 50 times then Simplex Method for optimal solution. but some special problem is not solved by Karmarkar Method. As a result, the algorithm by APL Language is proved time efficiency and optimal solution in the Primal-Dual interior point algorithm. Furthermore Karmarkar Method and Primal-Dual interior point Method is compared in some examples.

• Kyungpook Mathematical Journal
• /
• v.61 no.1
• /
• pp.205-212
• /
• 2021

We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour moves necessary to transform a diagram of the virtual knot into the trivial knot diagram. Some upper and lower bounds on the forbidden detour number are given in terms of the minimal number of real crossings or the coefficients of the affine index polynomial of the virtual knot.