• Title/Summary/Keyword: All-one polynomial

Search Result 98, Processing Time 0.034 seconds

Multiple Constrained Optimal Experimental Design

  • Jahng, Myung-Wook;Kim, Young Il
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.3
    • /
    • pp.619-627
    • /
    • 2002
  • It is unpractical for the optimal design theory based on the given model and assumption to be applied to the real-world experimentation. Particularly, when the experimenter feels it necessary to consider multiple objectives in experimentation, its modified version of optimality criteria is indeed desired. The constrained optimal design is one of many methods developed in this context. But when the number of constraints exceeds two, there always exists a problem in specifying the lower limit for the efficiencies of the constraints because the “infeasible solution” issue arises very quickly. In this paper, we developed a sequential approach to tackle this problem assuming that all the constraints can be ranked in terms of importance. This approach has been applied to the polynomial regression model.

UPPERS TO ZERO IN POLYNOMIAL RINGS WHICH ARE MAXIMAL IDEALS

  • Chang, Gyu Whan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.2
    • /
    • pp.525-530
    • /
    • 2015
  • Let D be an integrally closed domain with quotient field K, X be an indeterminate over D, $f=a_0+a_1X+{\cdots}+a_nX^n{\in}D[X]$ be irreducible in K[X], and $Q_f=fK[X]{\cap}D[X]$. In this paper, we show that $Q_f$ is a maximal ideal of D[X] if and only if $(\frac{a_1}{a_0},{\cdots},\frac{a_n}{a_0}){\subseteq}P$ for all nonzero prime ideals P of D; in this case, $Q_f=\frac{1}{a_0}fD[X]$. As a corollary, we have that if D is a Krull domain, then D has infinitely many height-one prime ideals if and only if each maximal ideal of D[X] has height ${\geq}2$.

The Sinkage Speed by Ship's under Water Damage (선저파공이 침수속도에 미치는 영향)

  • 박석주;이동섭;박성현
    • Journal of the Korean Institute of Navigation
    • /
    • v.25 no.4
    • /
    • pp.417-422
    • /
    • 2001
  • Every ship might be exposed to collision, grounding and/or various accidents. They may make some underwater holes on the hull. An underwater damage would cause her loss of buoyancy, trim, and inclination. Although a ship has some provisions against these accidents, if the circumstance is serious, she would be sunk or upsetted. Because of varieties of type of accidents, one could not prepare all of them. Many subdivision could prevent them, but it is difficult to realize it due to rising costs. This paper deals with physical phenomena of sinkage and an application on box type ship, and some results are earned as follows; 1. sinkage speed up to the level of the damage hole is increased proportionally, and is decreased proportionally after filling the level. 2. the curve of draft shows cup type of second order polynomial up to the damage hole level, and shows cap type of second order polynomial after filling the level. 3. if damage occurs beneath half of the draft, changes of head and displacement, and sinking speed follow almost straight lines. 4. by careful observation, sinkage speed could be predicted.

  • PDF

SPECTRAL PROPERTIES OF VOLTERRA-TYPE INTEGRAL OPERATORS ON FOCK-SOBOLEV SPACES

  • Mengestie, Tesfa
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.1801-1816
    • /
    • 2017
  • We study some spectral properties of Volterra-type integral operators $V_g$ and $I_g$ with holomorphic symbol g on the Fock-Sobolev spaces ${\mathcal{F}}^p_{{\psi}m}$. We showed that $V_g$ is bounded on ${\mathcal{F}}^p_{{\psi}m}$ if and only if g is a complex polynomial of degree not exceeding two, while compactness of $V_g$ is described by degree of g being not bigger than one. We also identified all those positive numbers p for which the operator $V_g$ belongs to the Schatten $S_p$ classes. Finally, we characterize the spectrum of $V_g$ in terms of a closed disk of radius twice the coefficient of the highest degree term in a polynomial expansion of g.

Very Large Scale Analysis of Surfaces for Diamond Turned Machine Diagnosis (다이아몬드 선삭 가공기의 진단을 위한 대영역 표면 해석)

  • 김승우;장인철;김동식
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2000.05a
    • /
    • pp.687-691
    • /
    • 2000
  • Diamond turning machines for manufacture of precision optics require deliberate diagnosis to ensure that all the machine elements are properly operating, kinematically, dynamically and thermally, to produce demanded work qualities. One effective way is to directly inspect topographical features of work surfaces that have been carefully generated with prescribed machining conditions intended to exaggerate faulty consequences of any ill-operating machine elements. In this research, a very-large-scale Phase measuring interferometric system that has been developed for years at Korea Advanced Institute of Science and Technology is used to fulfill the metrological requirements fur the surface analysis. A special stitching technique is used to extend the measuring range, which integrates all the patches that are separately sampled over the whole surface while moving the stage. Then, the measured surface profile is analyzed to releated the machine error sources. For this, zernike polynomial fitting is used together with the wavelet filter and the fourier transform. Experimental results showed that the suggested technique in this study is very effective in diagnosing actual diamond turning machines

  • PDF

A Polynomial-Time Algorithm for Linear Cutting Stock Problem (선형 재료절단 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.7
    • /
    • pp.149-155
    • /
    • 2013
  • Commonly, one seeks a particular pattern suitable for stock cutting and the number of such patterns through linear programming. However, since the number of the patterns increases exponentially, it is nearly impossible to predetermine all the existing patterns beforehand. This paper thus proposes an algorithm whereby one could accurately predetermine the number of existing patterns by applying Suliman's feasible pattern method. Additionally, this paper suggests a methodology by which one may obtain exact polynomial-time solutions for feasible patterns without applying linear programming or approximate algorithm. The suggested methodology categorizes the feasible patterns by whether the frequency of first occurrence of all the demands is distributed in 0 loss or in various losses. When applied to 2 data sets, the proposes algorithm is found to be successful in obtaining the optimal solutions.

A Commutativity Theorem for Rings

  • KHAN, M.S.S.
    • Kyungpook Mathematical Journal
    • /
    • v.43 no.4
    • /
    • pp.499-502
    • /
    • 2003
  • The aim of the present paper is to establish for commutativity of rings with unity 1 satisfying one of the properties $(xy)^{k+1}=x^ky^{k+1}x$ and $(xy)^{k+1}=yx^{k+1}y^k$, for all x, y in R, and the mapping $x{\rightarrow}x^k$ is an anti-homomorphism where $k{\geq}1$ is a fixed positive integer.

  • PDF

Low Complexity GF(2$^{m}$ ) Multiplier based on AOP (회로 복잡도를 개선한 AOP 기반의 GF(2$^{m}$ ) 승산기)

  • 변기영;성현경;김흥수
    • Proceedings of the IEEK Conference
    • /
    • 2003.07c
    • /
    • pp.2633-2636
    • /
    • 2003
  • This study focuses on the new hardware design of fast and low-complexity multiplier over GF(2$\^$m/). The proposed multiplier based on the irreducible all one polynomial (AOP) of degree m, to reduced the system's complexity. It composed of Cyclic Shift, Partial Product, and Modular Summation Blocks. Also it consists of (m+1)$^2$2-input AND gates and m(m+1) 2-input XOR gates. Out architecture is very regular, modular and therefore, well-suited for VLSI implementation.

  • PDF

JACOBSON RADICAL AND NILPOTENT ELEMENTS

  • Huh, Chan;Cheon, Jeoung Soo;Nam, Sun Hye
    • East Asian mathematical journal
    • /
    • v.34 no.1
    • /
    • pp.39-46
    • /
    • 2018
  • In this article we consider rings whose Jacobson radical contains all the nilpotent elements, and call such a ring an NJ-ring. The class of NJ-rings contains NI-rings and one-sided quasi-duo rings. We also prove that the Koethe conjecture holds if and only if the polynomial ring R[x] is NJ for every NI-ring R.

Design of an LFSR Multiplier with Low Area Complexity (효율적인 공간 복잡도의 LFSR 곱셈기 설계)

  • 정재형;이성운;김현성
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2003.07a
    • /
    • pp.33-36
    • /
    • 2003
  • 본 논문에서는 GF(2$^{m}$ ) 상에서 효율적인 공간 복잡도를 가진 LFSR(Linear Feedback Shift Register) 구조 기반의 모듈러 곱셈기를 제안한다. 제안된 구조는 기약다항식으로 모든 계수가 1인 속성의 AOP(All One Polynomial)를 이용한다. 제안된 구조는 구조복잡도 면에서 기존의 구조들보다 훨씬 효율적이다. 제안된 곱셈기는 공개키 암호의 기본 구조로 사용될 수 있다.

  • PDF