• 제목/요약/키워드: generated ideal

검색결과 261건 처리시간 0.033초

영상 피라미드를 위한 최적 Half-Band FIR 필터 (An Optimal Half-Band FIR Filter for Image Pyramied)

  • 박섭형;이상욱
    • 대한전자공학회논문지
    • /
    • 제25권7호
    • /
    • pp.826-835
    • /
    • 1988
  • In this paper, we analyze the generation of an image pyramid as a 2-dimensional decimation-interpolation process, and suggest a performance index of FIR filter for decimation and interpolation filter. Until now, most deciamtion and interpolation filters are designed via the approximation of the impulse response of an ideal filter. In this paper, however, we propose a new performance index that minimizes the maximum frequency-weighted mean square error between the desired and the generated interpolated signal, and propose an optimal half-band filter based on the proposed performance index as an example. Some simulation results with real images show that the proposed optimal half-band filter yields a higher PSNR as well as the more preferable image quality, in comparison with other currently used filters with the same computational complexity.

  • PDF

A Secure Credit Card Transaction Method Based on Kerberos

  • Kim, Jung-Eun;Kim, Yoo-Hwan
    • Journal of Computing Science and Engineering
    • /
    • 제5권1호
    • /
    • pp.51-70
    • /
    • 2011
  • This paper introduces a new credit card payment scheme called No Number Credit Card that can significantly reduce the possibility of credit card fraud. The proposed payment system is loosely based on Kerberos, a cryptographic framework that has stood the test of time. In No Number Credit Card, instead of card numbers, only payment tokens are exchanged between the customers and merchants. The tokens are generated based on the payment amount, payment type, client information, and merchant information. However, it does not contain the credit card number, so the merchant or a database hacker cannot acquire and illegally use any credit card numbers. The No Number Credit Card system is ideal for online e-commerce transactions and can be used with any credit card that users possess. It can be used with minor modifications to the current card payment system. We provide the principles of its operation through scenario analysis, a sample implementation, and a security analysis

Application of Grobner bases to some rational curves

  • Cho, Young-Hyun;Chung, Jae-Myung
    • 대한수학회보
    • /
    • 제34권4호
    • /
    • pp.595-601
    • /
    • 1997
  • Let $C_d$ be the rational curve of degree d in $P_k ^3$ given parametrically by $x_0 = u^d, X_1 = u^{d - 1}t, X_2 = ut^{d - 1}, X_3 = t^d (d \geq 4)$. Then the defining ideal of $C_d$ can be minimally generated by d polynomials $F_1, F_2, \ldots, F_d$ such that $degF_1 = 2, degF_2 = \cdots = degF_d = d - 1$ and $C_d$ is a set-theoretically complete intersection on $F_2 = X_1^{d-1} - X_2X_0^{d-2}$ for every field k of characteristic p > 0. For the proofs we will use the notion of Grobner basis.

  • PDF

IDEALS OF Zpn[X]/(Xl-1)

  • Woo, Sung-Sik
    • 대한수학회논문집
    • /
    • 제26권3호
    • /
    • pp.427-443
    • /
    • 2011
  • In [6, 8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^l\;-\;1)$ is generated by at most two polynomials of the `standard' forms when l is even. The purpose of this paper is to find the `standard' generators of the cyclic codes over $\mathbb{Z}_{p^a}$ of length a multiple of p, namely the ideals of $\mathbb{Z}_{p^a}[X]/(X^l\;-\;1)$ with an integer l which is a multiple of p. We also find an explicit description of their duals in terms of the generators when a = 2.

A NOTE ON GORENSTEIN PRÜFER DOMAINS

  • Hu, Kui;Wang, Fanggui;Xu, Longyu
    • 대한수학회보
    • /
    • 제53권5호
    • /
    • pp.1447-1455
    • /
    • 2016
  • In this note, we mainly discuss the Gorenstein $Pr{\ddot{u}}fer$ domains. It is shown that a domain is a Gorenstein $Pr{\ddot{u}}fer$ domain if and only if every finitely generated ideal is Gorenstein projective. It is also shown that a domain is a PID (resp., Dedekind domain, $B{\acute{e}}zout$ domain) if and only if it is a Gorenstein $Pr{\ddot{u}}fer$ UFD (resp., Krull domain, GCD domain).

A QUESTION ON ⁎-REGULAR RINGS

  • Cui, Jian;Yin, Xiaobin
    • 대한수학회보
    • /
    • 제55권5호
    • /
    • pp.1333-1338
    • /
    • 2018
  • A ${\ast}-ring$ R is called ${\ast}-regular$ if every principal one-sided ideal of R is generated by a projection. In this note, several characterizations of ${\ast}-regular$ rings are provided. In particular, it is shown that a matrix ring $M_n(R)$ is ${\ast}-regular$ if and only if R is regular and $1+x^*_1x_1+{\cdots}+x^*_{n-1}x_{n-1}$ is a unit for all $x_i$ of R; which answers a question raised in the literature recently.

철도차량용 공기 스프링의 정적 특성 시뮬레이션 (Simulation of Static Characteristics of Railway Vehicle's Airspring)

  • 허신;구정서;우창수;김유일
    • 연구논문집
    • /
    • 통권26호
    • /
    • pp.15-24
    • /
    • 1996
  • In this study, we performed the static analysis of a cord-reinforced rubber airspring and generated the three-dimensional half-symmetry model which use the finite-strain shell elements to model the airbag. the three-dimensional hydrostatic fluid elements to model the air-filled cavity, and the rebar elements to model the multi-ply nylon reinforcement of airbag. In addition, a three-dimensional rigid surface is used to define the contact between the airspring and metal bead. The air inside the airspring cavity has been modeled as a compressible fluid satisfying the ideal gas law. The conclusions of this study are as follows. 1) In the pressurization step of analysis, we could predict the change of vertical reaction force, cavity volume and pressure within the airspring. 2) In the second step of analyzing vertical static stiffness, the increase of the vertical load increases the vertical stiffness. 3) In case of changing the angle of nylon cord, the increase the angle of nylon cord increases the vertical stiffness.

  • PDF

연속적으로 연결된 스타핑동기장치들에서 발생되는 지터에 관한 연구 (Accumulation of Jitter in a Chain of Stuffing Systems)

  • 최승국
    • 한국통신학회논문지
    • /
    • 제19권8호
    • /
    • pp.1558-1570
    • /
    • 1994
  • 스타핑시스템이 한 개 또는 여러개 연속적으로 연결되었을때 발생되는 이상적인 스타핑지터에 대하여 연구하였다. 스타핑비가 두 개의 서로 나누어 떨어지지 않는 간단한 수로 이루어지는 분수값 근처의 값을 가질때 크기가 큰 지터가 발생한다. 연속적으로 여러 개 연결된 스타핑시스템에서도 각 시스템이 위와 같은 스타핑비로 동작할때 큰 크기의 축적된 지터가 발생한다. 시스템의 수에 따라 증가되는 이러한 지터의 실효치와 확률빌도함수가 계산되었으며 제작된 하드웨어 시뮬레이터를 이용하여 그 결과가 확인되었다.

  • PDF

DEVELOPMENT OF DIGITAL LASER WELDING SYSTEM FOR AUTOMOBILE SIDE PANELS

  • Park, H.S.;Lee, G.B.
    • International Journal of Automotive Technology
    • /
    • 제8권1호
    • /
    • pp.83-91
    • /
    • 2007
  • Nowadays, the increasing global competition forces manufacturing enterprises to apply new technologies such as laser welding to manufacturing of their products. In case of automotive industries, they interest in assembly system for BIW (Body in White) carrying out laser welding. In this paper, the method of implementation for digital laser welding assembly system is proposed. Based on the requirements of assembly tasks obtained through product analysis, process modeling is executed by using the IDEF0 and UML model. For digital assembly system, the selected components are modeled by using 3D CAD tools. According to the system configuration strategy, lots of the alternative solutions for the assembly system of welding side panels are generated. Finally, the optimal laser welding system is chosen by the evaluation of the alternative solutions with TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) method.

페트리네트를 이용한 FMS스케줄링에 대한 발견적 해법 (A Heuristic Algorithm for FMS Scheduling Using the Petri Net)

  • 안재홍;노인규
    • 한국경영과학회지
    • /
    • 제21권2호
    • /
    • pp.111-124
    • /
    • 1996
  • The main purpose of this study is to develop an algorithm to solve the scheduling problems of FMS using Petri-net is well suited to model the dynamics of FMS and Petri-net is an ideal tool to formulate scheduling problems with routing flexibility and shared resources. By using the marking of Petri-net, We can model features of discrete even system, such as concurrency, asynchronous, conflict and non-determinism. The proposed algorithm in this paper can handle back-tracking using the marking of Petri-net. The results of the experiment show that marking is one of the best ways that describe exactly movement of the discrete event system. To show the effectiveness of the algorithm suggested here, we compare it with L1 algorithm using the Petri-net through the test on randomly generated test problems.

  • PDF