• Title/Summary/Keyword: semi normal (pair)

Search Result 4, Processing Time 0.02 seconds

GENERALIZED NORMALITY IN RING EXTENSIONS INVOLVING AMALGAMATED ALGEBRAS

  • Kwon, Tae In;Kim, Hwankoo
    • Korean Journal of Mathematics
    • /
    • v.26 no.4
    • /
    • pp.701-708
    • /
    • 2018
  • In this paper, seminormality and t-closedness in ring extensions involving amalgamated algebras are studied. Let $R{\subseteq}T$ be a ring extension with ideals $I{\subseteq}J$, respectively such that J is contained in the conductor of R in T. Assume that T is integral over R. Then it is shown that ($R{\bowtie}I$, $T{\bowtie}J$) is a seminormal (resp., t-closed) pair if and only if (R, T) is a seminormal (resp., t-closed) pair.

Rational Approximation of Multiple Input Delay Systems Using the Hankel Singular Values Vectors (한켈특이치와 특이벡터를 이용한 복수 입력 시간지연 시스템의 유리근사화)

  • 황이철
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.299-304
    • /
    • 1996
  • This paper studies the rational approximation of multiple input delay systems using the Hankel singular values and vectors, which are the soultion of a transcendental equation. Rational approximatants are obtained from output normal realizations which are constructed by the Hankel singular values and vectors. Consequently, it is shown that rational approximants by output normal realization preserve intrinsic properties of time delay systems than Pade approximants.

  • PDF

An Efficient PSI-CA Protocol Under the Malicious Model

  • Jingjie Liu;Suzhen Cao;Caifen Wang;Chenxu Liu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.720-737
    • /
    • 2024
  • Private set intersection cardinality (PSI-CA) is a typical problem in the field of secure multi-party computation, which enables two parties calculate the cardinality of intersection securely without revealing any information about their sets. And it is suitable for private data protection scenarios where only the cardinality of the set intersection needs to be calculated. However, most of the currently available PSI-CA protocols only meet the security under the semi-honest model and can't resist the malicious behaviors of participants. To solve the problems above, by the application of the variant of Elgamal cryptography and Bloom filter, we propose an efficient PSI-CA protocol with high security. We also present two new operations on Bloom filter called IBF and BIBF, which could further enhance the safety of private data. Using zero-knowledge proof to ensure the safety under malicious adversary model. Moreover, in order to minimize the error in the results caused by the false positive problem, we use Garbled Bloom Filter and key-value pair packing creatively and present an improved PSI-CA protocol. Through experimental comparison with several existing representative protocols, our protocol runs with linear time complexity and more excellent characters, which is more suitable for practical application scenarios.

Rational approximation of multiple input delay systems (복수입력 시간지연 시스템의 유리근사화)

  • HWANG, I Cheol;PARK, Kyoung Taik
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.1
    • /
    • pp.194-204
    • /
    • 1997
  • In this paper, we consider the rational approximation of multiple input delay systems. The method of computing Hankel singular values and vectors is firstly introduced, where explicitly shows the structure of the corresponding Hankel singular vectors. Secondly, rational approximants are obtained from output nor- mal relizations, which are constructed by Hankel singular values and vectors. As a result, it is shown that rational approximants by output normal realization preserve intrinsic properties of time delay systems than Pad'e approximants.

  • PDF