• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.87-102
• /
• 2011

The purpose of this paper is to prove strong convergence theorems for finding a common element of the set of fixed points of a weak relatively nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping by a new hybrid method in a Banach space. We shall give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space $l^2$. Our results improve and extend the corresponding results announced by Ying Liu[Ying Liu, Strong convergence theorem for relatively nonexpansive mapping and inverse-strongly-monotone mapping in a Banach space, Appl. Math. Mech. -Engl. Ed. 30(7)(2009), 925-932] and some others.

• Journal of the Korean Mathematical Society
• /
• v.52 no.6
• /
• pp.1179-1194
• /
• 2015

In this paper, we introduce a new iterative algorithm for finding a common element of the set of solutions of a generalized mixed equilibrium problem related to a continuous monotone mapping, the set of solutions of a variational inequality problem for a continuous monotone mapping, and the set of fixed points of a continuous pseudocontractive mapping in Hilbert spaces. Weak convergence for the proposed iterative algorithm is proved. Our results improve and extend some recent results in the literature.

• Kyungpook Mathematical Journal
• /
• v.58 no.2
• /
• pp.291-305
• /
• 2018

In this paper, we prove a general uniqueness theorem which is useful for proving the uniqueness of the relevant additive mapping, quadratic mapping, cubic mapping, quartic mapping, or the additive-quadratic-cubic-quartic mapping when we investigate the (generalized) Hyers-Ulam stability.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.7 no.4
• /
• pp.215-220
• /
• 2007

Leakage current of CMOS circuits has become a major factor in VLSI design these days. Although many circuit-level techniques have been developed, most of them require significant amount of designers' effort and are not aligned well with traditional VLSI design process. In this paper, we focus on technology mapping, which is one of the steps of logic synthesis when gates are selected from a particular library to implement a circuit. We take a radical approach to push the limit of technology mapping in its capability of suppressing leakage current: we use a probabilistic leakage (together with delay) as a cost function that drives the mapping; we consider pin reordering as one of options in the mapping; we increase the library size by employing gates with larger gate length; we employ a new flipflop that is specifically designed for low-leakage through selective increase of gate length. When all techniques are applied to several benchmark circuits, leakage saving of 46% on average is achieved with 45-nm predictive model, compared to the conventional technology mapping.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.725-736
• /
• 2009

We define a (${\tau}_i$, ${\tau}_j$)-fuzzy strongly preopen set on a fuzzy bitopological space and characterize a fuzzy pairwise strong precontinuous mapping and a fuzzy pairwise strong preopen mapping(a fuzzy pairwise strong preclosed mapping) on a fuzzy bitopological space.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.2
• /
• pp.88-99
• /
• 1992

This paper presents an efficient method of mapping Boolean equations to a set of library gates. The proposed system performs technology mapping by graph covering. To select optimal area cover, a new cost function and local area optimization are proposed. Experimental results show that the proposed algorithm produces effective mapping using given library.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.447-449
• /
• 2012

There are many essential elements in making the realistic 3D games, of which one of the most important is mapping. Mapping can add the details to 3D objects easily, which are impossible or difficult by modeling alone, and can reduce file data capacities to run the game engine. The theory of the mapping is to throw 2D image on 3D object correctly, but they do not match each other at the rate of 1:1 100 percent completely due to the difference of the fundamental property of them. To solve this problem, various kinds of mapping methods are developed and used. This paper will compare and analyze the characteristics, and merits and demerits of these various kinds of mapping methods and will inquire which method is the most efficient one.

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.69-73
• /
• 1997

We show that if T is an $\varepsilon$-approximate Jordan functional such that T(a) = 0 implies $T(a^2) = 0 (a \in A)$ then T is continuous and $\Vert T \Vert \leq 1 + \varepsilon$. Also we prove that every $\varepsilon$-near Jordan mapping is an $g(\varepsilon)$-approximate Jordan mapping where $g(\varepsilon) \to 0$ as $\varepsilon \to 0$ and for every $\varepsilon > 0$ there is an integer m such that if T is an $\frac {\varepsilon}{m}$-approximate Jordan mapping on a finite dimensional Banach algebra then T is an $\varepsilon$-near Jordan mapping.

• Journal of the Chungcheong Mathematical Society
• /
• v.6 no.1
• /
• pp.53-57
• /
• 1993

Let E and F be Banach spaces with $X{\subset}E$ and $Y{\subset}F$. Suppose that X is weakly compact, convex and has the fixed point property for a nonexpansive mapping, and Y has the fixed point property for a multivalued nonexpansive mapping. Then $(X{\oplus}Y)_p$, $1{\leq}$ P < ${\infty}$ has the fixed point property for a multi valued nonexpansive mapping. Furthermore, if X has the generic fixed point property for a nonexpansive mapping, then $(X{\oplus}Y)_{\infty}$ has the fixed point property for a multi valued nonexpansive mapping.

• Journal of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1151-1164
• /
• 2009

Let E be a reflexive Banach space with a weakly sequentially continuous duality mapping, C be a nonempty closed convex subset of E, f : C $\rightarrow$C a contractive mapping (or a weakly contractive mapping), and T : C $\rightarrow$ C a nonexpansive mapping with the fixed point set F(T) ${\neq}{\emptyset}$. Let {$x_n$} be generated by a new composite iterative scheme: $y_n={\lambda}_nf(x_n)+(1-{\lambda}_n)Tx_n$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, ($n{\geq}0$). It is proved that {$x_n$} converges strongly to a point in F(T), which is a solution of certain variational inequality provided the sequence {$\lambda_n$} $\subset$ (0, 1) satisfies $lim_{n{\rightarrow}{\infty}}{\lambda}_n$ = 0 and $\sum_{n=0}^{\infty}{\lambda}_n={\infty}$, {$\beta_n$} $\subset$ [0, a) for some 0 < a < 1 and the sequence {$x_n$} is asymptotically regular.