• 통합자연과학논문집
• /
• 제7권4호
• /
• pp.283-285
• /
• 2014

We investigate irreducibility of the quadrinomial $F_m(x)=x^{2m}-x^{m+1}-x^{m-1}-1$ where m is an even integer ${\geq}2$ using only basic techniques that can be often used in many classes of polynomials.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권1_2호
• /
• pp.112-117
• /
• 2004

본 논문에서는 유한 체 $GF(2^m)$상에서 셀룰라 오토마타 (Cellular Automata)의 구조에 적합한 곱셈기 구조를 제안한다. 제안된 LSB 우선 곱셈 구조는 AOP(All One Polynomial)를 기약 다항식으로 사용하며, m＋1의 지연시간과 $ 1-D_{AND}＋1-D{XOR}$의 임계경로를 갖는다. 특히 정규성, 모듈성, 병렬성을 가지기 때문에 VLSI구현에 효율적이고 나눗셈기, 지수기 및 역원기를 설계하는 데 기본 구조로 사용될 수 있다 또한, 이 구조는 유한 체 상에서 Diffie-Hellman 키 교환 프로토콜, 디지털 서명 알고리즘, 및 ElGamal 암호화와 같이 잘 알려진 공개키 정보 보호 서비스를 위한 기본 구조로 사용될 수 있다.

• 한국컴퓨터정보학회논문지
• /
• 제20권2호
• /
• pp.1-10
• /
• 2015

본 논문에서는 유한체 $GF(3^m)$상에서 모든 항에 0이 아닌 계수를 갖는 기약 다항식에 대하여 m이 홀수 및 짝수인 경우 $GF(3^m)$상의 곱셈 알고리즘을 제시하였으며, 제시한 곱셈 알고리즘을 이용하여 고속의 병렬 입-출력 모듈구조의 곱셈기를 설계하였다. 제시한 곱셈기의 구성은 $(m+1)^2$개의 동일한 기본 셀들로 설계되었으며, 셀에 메모리를 사용하지 않았으므로 회로가 간단하며 셀당 $T_A+T_X$의 지연시간을 갖는다. 본 논문에서 제안한 곱셈기는 규칙성과 셀 배열에 의한 모듈성을 가지므로 m이 큰 회로의 확장이 용이하며 VLSI회로 실현에 적합할 것이다.

• 대한수학회보
• /
• 제54권1호
• /
• pp.1-15
• /
• 2017

Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

• Journal of Multimedia Information System
• /
• 제5권1호
• /
• pp.63-66
• /
• 2018

In this work, the smoothing and the interpolation basis splines are analyzed. As well as the possibility of using the spectral properties of the basis splines for digital signal processing are shown. This takes into account the fact that basic splines represent finite, piecewise polynomial functions defined on compact media.

• Communications for Statistical Applications and Methods
• /
• 제10권3호
• /
• pp.695-705
• /
• 2003

In this article, we propose a regression and correlation analysis via dynamic graphs and implement them in Java Web Start. For the polynomial relations between dependent and independent variables, dynamic graphics are implemented for both polynomial regression and spline estimates for an instant model selection. The results include basic statistics. They are available both as a web-based service and an application.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.169-180
• /
• 2006

We study convergence of multisplitting method associated with a block diagonal conformable multisplitting for solving a linear system whose coefficient matrix is a symmetric positive definite matrix which is not an H-matrix. Next, we study the validity of m-step multisplitting polynomial preconditioners which will be used in the preconditioned conjugate gradient method.

• Korean Journal of Mathematics
• /
• 제23권1호
• /
• pp.37-46
• /
• 2015

We in this note introduce the concept of semi-IFP rings which is a generalization of IFP rings. We study the basic structure of semi-IFP rings, and construct suitable examples to the situations raised naturally in the process. We also show that the semi-IFP does not go up to polynomial rings.

• 한국국방경영분석학회지
• /
• 제9권2호
• /
• pp.57-60
• /
• 1983

We show that the complexity of Simplex Method for Linear Programming problem is equivalent to the complexity of finding just an adjacent basic feasible solution if exists. Therefore a simplex type method which resolves degeneracy in polynomial time with respect to the size of the given linear programming problem can solve the general linear programming problem in polynomial steps.

• 통합자연과학논문집
• /
• 제10권1호
• /
• pp.40-42
• /
• 2017

In this note, we study a generalization of a certain polynomial $z^n-{\sum\limits_{k=0}^{n-1}}a_kz^k$, where $\sum\limits_{k=0}^{n-1}a_k=1$, $a_k{\geq}0$ for each k, whose all zeros except for z=1 lie on the circle of radius 1/2 with center at the origin.