• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.103-112
• /
• 2003

We consider multiplier ideals on CR manifolds, which is associated to Kiremidjian's work on CR embedding problem. Similar to the Kohn's result, we found that the multipliers form a nontrivial radical ideal.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.613-629
• /
• 2016

In this paper, we introduced the notion of multiplier of Boolean algebras and discuss related properties between multipliers and special mappings, like dual closures, homomorphisms on B. We introduce the notions of xed set $Fix_f(X)$ and normal ideal and obtain interconnection between multipliers and $Fix_f(B)$. Also, we introduce the special multiplier ${\alpha}_p$a nd study some properties. Finally, we show that if B is a Boolean algebra, then the set of all multipliers of B is also a Boolean algebra.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.201-210
• /
• 2013

In this paper, we introduced the notion of multiplier of a BCC-algebra, and gave some properties of BCC-algebras. Also, we characterized kernels and normal ideals of multipliers on BCC-algebras.

• Kyungpook Mathematical Journal
• /
• v.54 no.2
• /
• pp.321-332
• /
• 2014

In this article we introduce different types of multiplier I-convergent double sequence spaces. We study their different algebraic and topological properties like solidity, symmetricity, completeness etc. The decomposition theorem is established and some inclusion results are proved.

• Communications of the Korean Mathematical Society
• /
• v.18 no.1
• /
• pp.59-63
• /
• 2003

Let A be a $C^*$-algebra and $K_{A}$ its Pedersen's ideal. A is called a PCS-algebra if the multiplier $\Gamma(K_{A})\;of\;K_{A}$ is the multiplier M(A) of A. J. Mack [5]characterized PCS-algebras by weak compactness on the spectrum of A. We give a new simple proof of this Mack's result using the concept of semicontinuity and N. C. Phillips' description of $\Gamma(K_{A})$.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.69-76
• /
• 2012

Let R be a ring, and ${\alpha}$ be an endomorphism of R. An additive mapping H : R ${\rightarrow}$ R is called a left ${\alpha}$-multiplier (centralizer) if H(xy) = H(x)${\alpha}$(y) holds for all x,y $\in$ R. In this paper, we shall investigate the commutativity of prime and semiprime rings admitting left ${\alpha}$-multiplier satisfying any one of the properties: (i) H([x,y])-[x,y] = 0, (ii) H([x,y])+[x,y] = 0, (iii) $H(x{\circ}y)-x{\circ}y=0$, (iv) $H(x{\circ}y)+x{\circ}y=0$, (v) H(xy) = xy, (vi) H(xy) = yx, (vii) $H(x^2)=x^2$, (viii) $H(x^2)=-x^2$ for all x, y in some appropriate subset of R.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.298-305
• /
• 2004

This paper presents an error compensation method for a fixed-width modified Booth multiplier that receives a W-bit input and produces a W-bit product. To efficiently compensate for the quantization error, Booth encoder outputs (not multiplier coefficients) are used for the generation of error compensation bias. The truncated bits are divided into two groups depending upon their effects on the quantization error. Then, different error compensation methods are applied to each group. By simulations, it is shown that quantization error can be reduced up to 50％ by the proposed error compensation method compared with the existing method with approximately the same hardware overhead in the bias generation circuit. It is also shown that the proposed method leads to up to 40％ reduction in area and power consumption of a multiplier compared with the ideal multiplier.

• Journal of Ocean Engineering and Technology
• /
• v.10 no.3
• /
• pp.96-104
• /
• 1996

Hamilton's principle is used to derive Euler-Lagrange equations for free surface flow problems of incompressible ideal fluid. The velocity field is chosen to satisfy the continuity equation a priori. This approach results in a hierarchial set of governing equations consist of two evolution equations with respect to two canonical variables and corresponding boundary value problems. The free surface elevation and the Lagrange's multiplier are the canonical variables in Hamilton's sense. This Lagrange's multiplier is a velocity potential defined on the free surface. Energy is conserved as a consequence of the Hamiltonian structure. These equations can be applied to waves in water of finite depth including generalization of Hamilton's equations given by Miles and Salmon.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.495-502
• /
• 2017

Let R be a 2-torsion free prime ring and J be a nonzero Jordan ideal of R. Let F and G be two generalized derivations with associated derivations f and g, respectively. Our main result in this paper shows that if F(x)x - xG(x) = 0 for all $x{\in}J$, then R is commutative and F = G or G is a left multiplier and F = G + f. This result with its consequences generalize some recent results due to El-Soufi and Aboubakr in which they assumed that the Jordan ideal J is also a subring of R.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.4
• /
• pp.33-41
• /
• 2006

RSA cryptosystem is of great use in systems such as IC card, mobile system, WPKI, electronic cash, SET, SSL and so on. RSA is performed through modular exponentiation. It is well known that the Montgomery multiplier is efficient in general. The critical path delay of the Montgomery multiplier depends on an addition of three operands, the problem that is taken over carry-propagation makes big influence at an efficiency of Montgomery Multiplier. Recently, the use of the Carry Save Adder(CSA) which has no carry propagation has worked McIvor et al. proposed a couple of Montgomery multiplication for an ideal exponentiation, the one and the other are made of 3 steps and 2 steps of CSA respectively. The latter one is more efficient than the first one in terms of the time complexity. In this paper, for faster operation than the latter one we use binary signed-digit(SD) number system which has no carry-propagation. We propose a new redundant binary adder(RBA) that performs the addition between two binary SD numbers and apply to Montgomery multiplier. Instead of the binary SD addition rule using in existing RBAs, we propose a new addition rule. And, we construct and simulate to the proposed adder using gates provided from SAMSUNG STD130 $0.18{\mu}m$ 1.8V CMOS Standard Cell Library. The result is faster by a minimum 12.46% in terms of the time complexity than McIvor's 2 method and existing RBAs.