• 대한수학회보
• /
• 제42권3호
• /
• pp.609-616
• /
• 2005

In this paper we show that we can extend the purity of left R-modules to the case of polynomial modules, bipolynomial modules, and also inverse polynomial modules.

• 정보보호학회논문지
• /
• 제15권6호
• /
• pp.105-110
• /
• 2005

유한체에서 정의된 선형 다항식의 역원은 함수 거 일반화로 볼 수 있으므로, 암호학적 응용에서 유용한 부울 하수를 설계하는 데 좋은 후보가 될 수 있다 특히, Crypto 2001에서는 선형 다항식 및 선형 부호를 이용하여 큰 대수적 차수를 가지는 resilient 함수를 설계하는 방법이 제안되었다. 그러나 Crypto 2001에서 대수적 차수를 분석한 결과에 오류가 있었으며, 본 논문에서 정확한 대수적 차수를 제시한다.

• East Asian mathematical journal
• /
• 제21권1호
• /
• pp.105-112
• /
• 2005

In this paper we show that we can extend the purity extension properties of left R-modules to the various generalized inverse polynomial modules.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 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.

• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.317-322
• /
• 2010

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• 대한수학회보
• /
• 제47권4호
• /
• pp.693-699
• /
• 2010

In this paper we show that the flat property of a left R-module does not imply (carry over) to the corresponding inverse polynomial module. Then we define an induced inverse polynomial module as an R[x]-module, i.e., given an R-linear map f : M $\rightarrow$ N of left R-modules, we define $N+x^{-1}M[x^{-1}]$ as a left R[x]-module. Given an exact sequence of left R-modules $$0\;{\rightarrow}\;N\;{\rightarrow}\;E^0\;{\rightarrow}\;E^1\;{\rightarrow}\;0$$, where $E^0$, $E^1$ injective, we show $E^1\;+\;x^{-1}E^0[[x^{-1}]]$ is not an injective left R[x]-module, while $E^0[[x^{-1}]]$ is an injective left R[x]-module. Make a left R-module N as a left R[x]-module by xN = 0. We show inj $dim_R$ N = n implies inj $dim_{R[x]}$ N = n + 1 by using the induced inverse polynomial modules and their properties.

• 대한수학회보
• /
• 제44권2호
• /
• pp.225-231
• /
• 2007

Given an injective envelope E of a left R-module M, there is an associative Galois group Gal$({\phi})$. Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope $E[x^{-1}]$ of an inverse polynomial module $M[x^{-1}]$ as a left R[x]-module and we can define an associative Galois group Gal$({\phi}[x^{-1}])$. In this paper we describe the relations between Gal$({\phi})$ and Gal$({\phi}[x^{-1}])$. Then we extend the Galois group of inverse polynomial module and can get Gal$({\phi}[x^{-s}])$, where S is a submonoid of $\mathbb{N}$ (the set of all natural numbers).

• East Asian mathematical journal
• /
• 제24권2호
• /
• pp.139-144
• /
• 2008

Given an injective envelope E of a left R-module M, there is an associative Galois group Gal($\phi$). Let R be a left noetherian ring and E be an injective envelope of M, then there is an injective envelope E[$x^{-1}$] of an inverse polynomial module M[$x^{-1}$] as a left R[x]-module and we can define an associative Galois group Gal(${\phi}[x^{-1}]$). In this paper we extend the Galois group of inverse polynomial module and can get Gal(${\phi}[x^{-s}]$), where S is a submonoid of $\mathds{N}$ (the set of all natural numbers).

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• 호남수학학술지
• /
• 제20권1호
• /
• pp.45-55
• /
• 1998