• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.3
• /
• pp.445-453
• /
• 2012

In this paper, we introduce the concept of multiplier in a Hilbert algebra and obtained some properties of multipliers. Also, we introduce the simple multiplier and characterized the kernel of multipliers in Hilbert algebras.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.4
• /
• pp.357-367
• /
• 2017

In this paper, we introduce the notion of multiplier of AC-algebra and consider the properties of multipliers in AC-algebras. Also, we characterized the fixed set $Fix_d(X)$ by multipliers. Moreover, we prove that M(X), the collection of all multipliers of AC-algebras, form a semigroup under certain binary operation.

• 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.

• Journal of Convergence for Information Technology
• /
• v.9 no.5
• /
• pp.7-13
• /
• 2019

Role-based access or attribute-based access control in cloud environment or big data environment need requires a suitable mathematical structure to represent a hierarchical model. This paper define the notion of multipliers and simple multipliers of lattice implication algebras that can implement a hierarchical model of role-based or attribute-based access control, and prove every multiplier is simple multiplier. Also we research the relationship between multipliers and homomorphisms of a lattice implication algebra L, and prove that the lattice [0, u] is isomorphic to a lattice $[u^{\prime},1]$ for each $u{\in}L$ and that L is isomorphic to $[u,1]{\times}[u^{\prime},1]$ as lattice implication algebras for each $u{\in}L$ satisfying $u{\vee}u^{\prime}=1$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1561-1564
• /
• 2004

A CMOS-based Electronically Tunable Capacitance Multipliers, which can be magnified the value of a grounded unit capacitance, is presented in this article. The multiplication factor is varied by the ratio of the bias currents. The proposed circuit is simple, small in size and suitable for implementing in standard CMOS process. PSPICE simulation results demonstrating the characteristics of the proposed circuit are included.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.915-928
• /
• 2013

In this paper, we will provide an alternative proof to characterize the pointwise multipliers which maps a Sobolev space $\dot{H}^r(\mathb{R}^d)$ to its dual $\dot{H}^{-r}(\mathb{R}^d)$ in the case 0 < $r$ < $\frac{d}{2}$ by a simple application of the definition of fractional Sobolev space. The proof relies on a method introduced by Maz'ya-Verbitsky [9] to prove the same result.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.267-281
• /
• 2016

In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1238-1244
• /
• 1999

In this paper, a new design of a triple-erroe-correcting (TEC) Reed-Solomon decoder is presented based on direct decoding method which is more efficient for the case of relatively small error correction capability. The proposed decoder requires only 9 GF(2m) multipliers in obtaining the error-locator polynomial and the error-evaluator polynomial, whereas other decoders needs 24 multipliers. Thus, the attractive feature of this decoder is its remarkable simplicity from the point of view of implementation. Futhermore, the proposed TEC Reed-Solomon decoder has very simple control circuit and short decoding delay. Therefore this decoder can be implemented by simple hardware and also save buffer memory which stores received sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4C
• /
• pp.191-196
• /
• 2011

In this paper, we propose a design method of Reed-Solomon (23, 17) decoder for UWB using direct decoding method. The direct decoding algorithm is more efficient for the case of relatively small error correction capability. The proposed decoder requires only 9 $GF(2^m)$ multipliers in obtaining the error-locator polynomial and the error-evaluator polynomial, whereas other decoders need about 20 multipliers. Thus, the attractive feature of this decoder is its remarkable simplicity from the point of view of hardware implementation. Futhermore, the proposed decoder has very simple control circuit and short decoding delay. Therefore this decoder can be implemented by simple hardware and also save buffer memory which stores received sequence.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.261-275
• /
• 2003

In this paper we study two stage problems of stochastic convex programming. Solving the problems is very hard. A L-shaped method for it is given. The implement of the algorithm is simple, so less computation work is needed. The result of computation shows that the algorithm is effective.