• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.179-192
• /
• 1997

An algorithm to get an optimal choice for the number of symmetric quadrature points is given to find symmetric quadrature points is given to find symmetric quadrature for-mulas over a unit disk with a minimal number of points even when a high degree of polynomial precision is required. The symmetric quad-rature formulas for numerical integration over a unit disk of complete polynomial functions up to degree 19 are presented.

• 대한전자공학회논문지SP
• /
• 제42권4호
• /
• pp.143-152
• /
• 2005

본 연구는 협대역 응용 시스템을 위한 전처리기-등화기 구조의 여파기에서, 최소의 복잡도를 갖는 곱셈기 없는 디지털 IIR 여파기의 설계 방식을 제안한다. 제안하는 여파기는 순환 다항식 (cyclotomic polynomial (CP)) 여파기와 1차 내삽 다항식(interpolated second order polynomial (EOP))을 근간으로 하는 al1-pole 등화기로 구성 되며, 이 두 여파기가 동시에 혼합 정수 선형계획법(miked integer linear programming (MILP))으로 최적 설계된다. 설계된 여파기는 최소의 복잡도를 갖는 특성을 가지고 있다. 뿐만 아니라, 이 MILP 방식은 계산 복잡도와 위상 응답의 비선형 특성을 모두 최소화하도록 설계한다. 설계 예제를 통하여 제안된 설계 방식으로 설계된 여파기는 구현 요구사항을 만족하면서 기존의 설계 방식에 비하여 복잡도면에서 월등히 우수한 특성을 보임을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1181-1184
• /
• 1996

As usual systems, robot manipulators have also physical constraints for operating. It is a difficult problem that we operate manipulator in the minimal time under these constraints. In this paper, we solve this problem dividing it into two steps. In the first step, we find the minimal time trajectories by optimizing qubic polynomial joint trajectories using evolutionary algorithms. In the second step, we optimize controller for robot manipulator to track precisely trajectories optimized in the previous step.

• ETRI Journal
• /
• 제33권4호
• /
• pp.656-659
• /
• 2011

In ICISC 2007, Comuta and others showed that among the methods for constructing pairing-friendly curves, those using cyclotomic polynomials, that is, the Brezing-Weng method and the Freeman-Scott-Teske method, are affected by Cheon's algorithm. This paper proposes a method for searching parameters of pairing-friendly elliptic curves that induces minimal security loss by Cheon's algorithm. We also provide a sample set of parameters of BN-curves, FST-curves, and KSS-curves for pairing-based cryptography.

• Kyungpook Mathematical Journal
• /
• 제61권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.

• 대한수학회논문집
• /
• 제20권2호
• /
• pp.275-290
• /
• 2005

Let $S\;=\;R[\chi_{ij}\mid1\;{\le}\;i\;{\le}\;m,\;1\;{\le}\;j\;{\le}\;n]$ be the polynomial ring over a noetherian commutative ring R and $I_p$ be the determinantal ideal generated by the $p\;\times\;p$ minors of the generic matrix $(\chi_{ij})(1{\le}P{\le}min(m,n))$. We describe a minimal free resolution of $S/I_{p}$, in the case m = n = p + 2 over $\mathbb{Z}$.

• 대한수학회논문집
• /
• 제31권2호
• /
• pp.395-414
• /
• 2016

In this work, we study on subdivision schemes reproducing polynomials and build a symmetric subdivision scheme reproducing polynomials of a certain predetermined degree, which is a slight variant of the family of Deslauries-Dubic interpolatory ones. Related to polynomial reproduction, a necessary and sufficient condition for a subdivision scheme to reproduce polynomials of degree L was recently established under the assumption of non-singularity of subdivision schemes. In case of stepwise polynomial reproduction, we give a characterization for a subdivision scheme to reproduce stepwise all polynomials of degree ${\leq}L$ without the assumption of non-singularity. This characterization shows that we can investigate the polynomial reproduction property only by checking the odd and even masks of the subdivision scheme. The minimal-support condition being relaxed, we present explicitly a general formula for the mask of (2n + 4)-point symmetric subdivision scheme with two parameters that reproduces all polynomials of degree ${\leq}2n+1$. The uniqueness of such a symmetric subdivision scheme is proved, provided the two parameters are given arbitrarily. By varying the values of the parameters, this scheme is shown to become various other well known subdivision schemes, ranging from interpolatory to approximating.

• 한국전자통신학회논문지
• /
• 제11권3호
• /
• pp.293-302
• /
• 2016

본 논문에서는 전이규칙이 모두 102인 Uniform CA(Uniform Cellular Automata, UCA) $\mathbb{C}_u$와 특성다항식이 $(x+1)^m$인 m-셀 90/150 hybrid CA $\mathbb{C}_h$를 합성한 CA의 특성을 분석한다. 먼저 $\mathbb{C}_u$로부터 유도된 여원 그룹 CA의 사이클 구조를 분석하고 이를 통해 모든 사이클의 길이가 같아지는 여원 CA의 조건을 제시한다. 그리고 $\mathbb{C}_u$와 $\mathbb{C}_h$를 합성한 CA $\mathbb{C}$의 최소다항식이 $(x+1)^q$일 때 $(T+I)^{q-1}F{\neq}0$을 만족하는 F를 여원벡터로 택하여 구성한 여원 그룹 CA $\mathbb{C}^{\prime}$의 사이클 구조를 분석한다.

• 대한수학회보
• /
• 제52권3호
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• 대한수학회보
• /
• 제22권2호
• /
• pp.117-119
• /
• 1985

Let R be a commutative noetherian ring with 1.neq.0, denoting by .nu.(I) the cardinality of a minimal basis of the ideal I. Let A be a polynomial ring in n>0 variables with coefficients in R, and let M be a maximal ideal of A. Generally it is shown that .nu.(M $A_{M}$).leq..nu.(M).leq..nu.(M $A_{M}$)+1. It is well known that the lower bound is not always satisfied, and the most classical examples occur in nonfactional Dedekind domains. But in many cases, (e.g., A is a polynomial ring whose coefficient ring is a field) the lower bound is attained. In [2] and [3], the conditions when the lower bound is satisfied is investigated. Especially in [3], it is shown that .nu.(M)=.nu.(M $A_{M}$) if M.cap.R=p is a maximal ideal or $A_{M}$ (equivalently $R_{p}$) is not regular or n>1. Hence the problem of determining whether .nu.(M)=.nu.(M $A_{M}$) can be studied when p is not maximal, $A_{M}$ is regular and n=1. The purpose of this note is to provide some conditions in which the lower bound is satisfied, when n=1 and R is a regular local ring (hence $A_{M}$ is regular)./ is regular).