• Korean Journal of Mathematics
• /
• 제15권1호
• /
• pp.79-85
• /
• 2007

We study codes over the polynomial ring $\mathbb{F}_q[D]$ and introduce the notion of basic codes which play a fundamental role in the theory.

• 통합자연과학논문집
• /
• 제1권2호
• /
• pp.149-159
• /
• 2008

We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid's algorithm, and the other is in essence a minimal polynomial version of the Berlekamp-Massey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up seamlessly with decoding procedure of alternant codes.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권3호
• /
• pp.135-144
• /
• 2004

In this paper, we propose competitive fuzzy polynomial neurons-based advanced Self-Organizing Neural Networks(SONN) architecture for optimal model identification and discuss a comprehensive design methodology supporting its development. The proposed SONN dwells on the ideas of fuzzy rule-based computing and neural networks. And it consists of layers with activation nodes based on fuzzy inference rules and regression polynomial. Each activation node is presented as Fuzzy Polynomial Neuron(FPN) which includes either the simplified or regression polynomial fuzzy inference rules. As the form of the conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as linear, quadratic, and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership (unction are studied and the number of the premise input variables used in the rules depends on that of the inputs of its node in each layer. We introduce two kinds of SONN architectures, that is, the basic and modified one with both the generic and the advanced type. Here the basic and modified architecture depend on the number of input variables and the order of polynomial in each layer. The number of the layers and the nodes in each layer of the SONN are not predetermined, unlike in the case of the popular multi-layer perceptron structure, but these are generated in a dynamic way. The superiority and effectiveness of the Proposed SONN architecture is demonstrated through two representative numerical examples.

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• Nonlinear Functional Analysis and Applications
• /
• 제28권1호
• /
• pp.287-294
• /
• 2023

The goal of this paper is to extend some inequalities of Bernstein as well as Turán type to polar derivative of a polynomial.

• 한국산업정보학회논문지
• /
• 제8권3호
• /
• pp.85-90
• /
• 2003

본 논문에서는 GF(2$^{m}$ ) 상에서 효율적인 공간 복잡도를 가진 LFSR(Linear Feedback Shift Register) 구조 기반의 모듈러 곱셈기를 제안한다. 먼저, 공개키 암호화 시스템의 기본 연산인 모듈러 지수승을 위한 지수승 알고리즘을 살펴보고 이를 위한 기본 구조를 제안한다. 특히, 본 논문은 이러한 지수기를 설계하기 위한 기녈 구조로서 효율적인 모듈러 곱셈기를 제안한다. 제안된 구조는 기약다항식으로 모든 계수가 1인 속성의 AOP(All One Polynomial)를 이용하며 구조복잡도 면에서 기존의 구조들보다 훨씬 효율적이다.

• 대한수학회보
• /
• 제50권5호
• /
• pp.1471-1479
• /
• 2013

In this paper, we study the non-existence of finite order entire solutions of nonlinear differential-difference of the form $$f^n+Q(z,f)=h$$, where $n{\geq}2$ is an integer, $Q(z,f)$ is a differential-difference polynomial in $f$ with polynomial coefficients, and $h$ is a meromorphic function of order ${\leq}1$.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.38-38
• /
• 2000

To fulfill recent requirements for high quality products in steel rolling process, fast responding and easily tunab control system is required and ILQ(Inverse Linear Quadratic) control system may be one of such alternatives. In this paper characteristics of ILQ control and its application to BUR(Back-Up-Roll) eccentricity in strip rolling mill is discussed and compared to polynomial control approaches. Also the rolling mill model and basic principle to control thickness of srip are introduced with control effect by polynomial methods.

• Nonlinear Functional Analysis and Applications
• /
• 제28권3호
• /
• pp.813-830
• /
• 2023

Let p(z) be a polynomial of degree n having no zero in |z| < 1. In this paper, by involving some coefficients of the polynomial, we prove an inequality that not only improves as well as generalizes the well-known result proved by Rivlin but also has some interesting consequences.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제31권1호
• /
• pp.49-56
• /
• 2024

For a Polynomial P(z) = Σⁿ_j=0 a_jz^j with a_j ≥ a_j-1, a₀ > 0 (j = 1, 2, ..., n), a classical result of Enestrom-Kakeya says that all the zeros of P(z) lie in |z| ≤ 1. This result was generalized by A. Joyal et al. [3] where they relaxed the non-negative condition on the coefficents. This result was further generalized by Dewan and Bidkham [9] by relaxing the monotonicity of the coefficients. In this paper, we use some techniques to obtain some more generalizations of the results [3], [8], [9].