• Title/Summary/Keyword: inverse polynomial

Search Result 92, Processing Time 0.024 seconds

THE CONSTRUCTION OF A NON-UNIMODAL GORENSTEIN SEQUENCE

  • Ahn, Jea-Man
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.443-450
    • /
    • 2011
  • In this paper, we construct a Gorenstein Artinian algebra R/J with non-unimodal Hilbert function h = (1, 13, 12, 13, 1) to investigate the algebraic structure of the ideal J in a polynomial ring R. For this purpose, we use a software system Macaulay 2, which is devoted to supporting research in algebraic geometry and commutative algebra.

A study on the systolic architecture of R-S decoder (R-S 복호기의 Systolic 설계에 관한 연구)

  • Park, Young-Man;Kim, Chang-Kyu;Rhee, Man-Young
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.165-167
    • /
    • 1988
  • In this paper, the design of decoder for R-S code using discrete finite-field Fourier transform is presented. An important ingredient of this design is a modified Euclid algorithm for computing the error-locator polynomial. The computation of inverse elements is completely avoided in this modification of Euclid algorithm. This decoder is regular and simple, and naturally suitable for VLSI implementation.

  • PDF

GENERALIZED RSA CIPHER AND DIFFIE-HELLMAN PROTOCOL

  • MATYSIAK, LUKASZ
    • Journal of applied mathematics & informatics
    • /
    • v.39 no.1_2
    • /
    • pp.93-103
    • /
    • 2021
  • In this paper I am considering several cryptological threads. The problem of the RSA cipher, like the Diffie-Hellman protocol, is the use of finite sets. In this paper, I generalize the RSA cipher and DH protocol for infinite sets using monoids. In monoids we can not find the inverse, which makes it difficult. In the second part of the paper I show the applications in cryptology of polynomial composites and monoid domains. These are less known structures. In this work, I show different ways of encrypting messages based on infinite sets.

Induction of the High Order Calibration Equation of Metal Oxide Semiconductor Gas Sensors (산화물 반도체식 가스센서의 입출력 고차 캘리브레이션 방정식 도출)

  • Park, Gyoutae;Kim, Kangmin;Lee, Hyeonggi;Yoon, Myeongsub
    • Journal of the Korean Institute of Gas
    • /
    • v.24 no.2
    • /
    • pp.44-49
    • /
    • 2020
  • In this paper, a measuring circuit is designed through analyzing manufacture specification of the sensor based on MOS. And the best input-output polynomial are induced that really gas sensors are used in gas safety management industrial fields. Response characteristics of a MOS gas sensor is analysed by through sensor's output voltages are measured after standard gases with six kinds of concentrations are manufactured and are injected to the sensor. A lookup table is created by relations of sensor's output voltages by injecting gases with other concentrations. Because data of the formed lookup table are equal interval, a polynomial can be induced of method of approximation function. So the 5th polynomial of input-output for a sensor is defined, coefficients are calculated by using least squares method, and the 5th polynomial is completed for representing characteristics of the sensor. If the proposed polynomial is applied to gas leak detectors, an inverse transformation of polynomial and programing of array codes are recreated. In this research, polynomial is implemented with array types that intervals of values of a lookup table are one-fifth sampled and interpolated. The performance of proposed 5th calibration equation is verified that errors are reduced than a linear expression when tests are performed by measurement of concentrations against injection of standard gases.

Comparison and Evaluation of Root Mean Square for Parameter Settings of Spatial Interpolation Method (공간보간법의 매개변수 설정에 따른 평균제곱근 비교 및 평가)

  • Lee, Hyung-Seok
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.13 no.3
    • /
    • pp.29-41
    • /
    • 2010
  • In this study, the prediction errors of various spatial interpolation methods used to model values at unmeasured locations was compared and the accuracy of these predictions was evaluated. The root mean square (RMS) was calculated by processing different parameters associated with spatial interpolation by using techniques such as inverse distance weighting, kriging, local polynomial interpolation and radial basis function to known elevation data of the east coastal area under the same condition. As a result, a circular model of simple kriging reached the smallest RMS value. Prediction map using the multiquadric method of a radial basis function was coincident with the spatial distribution obtained by constructing a triangulated irregular network of the study area through the raster mathematics. In addition, better interpolation results can be obtained by setting the optimal power value provided under the selected condition.

Notes On Inverse Interval Graph Coloring Problems

  • Chung, Yerim;Kim, Hak-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.10
    • /
    • pp.57-64
    • /
    • 2019
  • In this paper, we study a polynomially solvable case of the inverse interval graph coloring problem. Given an interval graph associated with a specific interval system, the inverse interval graph coloring problem is defined with the assumption that there is no proper K-coloring for the given interval graph, where K is a fixed integer. The problem is to modify the system of intervals associated with the given interval graph by shifting some of the intervals in such a way that the resulting interval graph becomes K-colorable and the total modification is minimum with respect to a certain norm. In this paper, we focus on the case K = 1 where all intervals associated with the interval graph have length 1 or 2, and interval displacement is only allowed to the righthand side with respect to its original position. To solve this problem in polynomial time, we propose a two-phase algorithm which consists of the sorting and First Fit procedure.

Model-based subpixed motion estimation for image sequence compression (도영상 압축을 위한 모델 기반 부화소 단위 움직임 추정 기법)

  • 서정욱;정제창
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.1
    • /
    • pp.130-140
    • /
    • 1998
  • This paper presents a method to estimate subpixel accuracy motion vectors using a mathermatical model withoug interpolation. the proposed method decides the coefficients of mathematical model, which represents the motion vector which is achieved by full search. And then the proposed method estimates subpixel accuracy motion vector from achieved mathematical model. Step by step mathematical models such as type 1, type 2, type 3, modified bype 2, modified type 3, and Partial Interpolation type 3 are presented. In type 1, quadratic polynomial, which has 9 unknown coefficients and models the 3by 3 pixel plane, is used to get the subpixel accuracy motion vectors by inverse matrix solution. In type 2 and 3, each quadratic polynomial which is simplified from type 1 has 5 and 6 unknown coefficients and is used by least square solution. Modified type 2 and modified type 3 are enhanced models by weighting only 5 pixels out of 9. P.I. type 3 is more accurate method by partial interpolation around subpixel which isachieved by type 3. LThese simulation results show that the more delicate model has the better performance and modified models which are simplified have excellent performance with reduced computational complexity.

  • PDF

An efficient technique to generate reusable matrix to solve a problem in the engineering field (공학문제 해결을 위한 프로그램에서의 재사용이 가능한 Matrix의 효율적 자동생성기법)

  • Lee, Mi-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1145-1148
    • /
    • 2003
  • We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

PAPR reduction and Pre-distortion techniques against Non-linear Distortion of Satellite WiBro

  • Shrestha, Robin;Seo, Myung-Hwan;Go, Gyeong-Wan;Lee, Byung-Seub
    • Journal of Satellite, Information and Communications
    • /
    • v.3 no.2
    • /
    • pp.18-25
    • /
    • 2008
  • A major drawback of Orthogonal Frequency Division Multiplexing (OFDM) system is high peak-to-average power ratio (PAPR) of the transmitted signal which introduces inevitable non-linear distortion in the transmission due to the amplifier non-linear property. This causes both in-band distortion and out of band spectrum re-growth. A polynomial based pre-distortion is estimated using the non-linear and inverse non-linear polynomial achieved through the Least Square Error (LSE) method. A new technique of PAPR reduction called 'Phase Realignment' (PR) is proposed which has a optimal effect in improving the BER performance as well as considerable reduction in the PAPR. In this paper we used the PR method along with the 'Peak Clipping' (PC) method is used before the pre-distortion to remove the high peak present in the non constant amplitude of the OFDM signal responsible to drive the amplifier in near saturation region for better performance of the system.

  • PDF

Crack Identification Using Optimization Technique (수학적 최적화기법을 이용한 결함인식 연구)

  • Seo, Myeong-Won;Yu, Jun-Mo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.1 s.173
    • /
    • pp.190-195
    • /
    • 2000
  • It has been established that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure. Nikolakopoulos et. al. used the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However the intersecting point of the superposed contours is not only difficult to find but also incorrect to calculate. A method is presented in this paper which uses optimization technique for the location and depth of the crack. The basic idea is to find parameters which use the structural eigenfrequencies on crack depth and location and optimization algorithm. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. Method of optimization is augmented lagrange multiplier method and search direction method is BFGS variable metric method and one dimensional search method is polynomial interpolation.