• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.3
• /
• pp.263-274
• /
• 2006

In this paper, we prove the Hyers-Ulam-Rassias stability of the quadratic mapping in generalized quasi-Banach spaces, and of the quadratic mapping in generalized p-Banach spaces.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.110-112
• /
• 2003

This paper presents an alleviant technique for solving ill-conditioned linear systems using spectral adaptive mapping, which is based on spectral mapping theorem. The conventional approaches to solve the ill-conditioned linear systems are divided into reformulation and alleviant technique. So far, the alleviant technique is evaluated the most effective one. In this paper, an adaptive mapping of spectrum is adopted to alleviate the condition number of ill-conditioned linear systems. A shift constant, which is a dominant factor of the spectral adaptive mapping that are proposed, is assessed by the system spectrum. The proposed spectral adaptive mapping technique is tested to demonstrated the validation on several size Hilbert matrices and small scale power systems, which are provide the promising results.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.757-766
• /
• 2008

We define and characterize a fuzzy pairwise $\gamma$-irresolute open mapping (fuzzy pairwise $\gamma$-irresolute closed mapping) on a fuzzy bitopological space. We also characterize a fuzzy pairwise $\gamma$-irresolute homeomorphism on a fuzzy bitopological space.

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

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3135-3141
• /
• 1996

In order to develop an efficient algorithm for S-to-M mapping in CMCA, characteristics of CMCA mappings is studied and conceptual mapping procedure is physically described. Then, careful observations on the mapping procedure and experience reveal a simple algorithm of the S-to-M mapping. The algorithm is described and compared with other procedures for S-to-M mapping. It is found very efficient in terms of computational operations and processing time.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• Journal of Korea Game Society
• /
• v.19 no.6
• /
• pp.49-60
• /
• 2019

Interior Mapping has been used to reduce graphics resources. In this paper, rendering speed(FPS), the number of polygons, shader complexity and each resource size of Interior Mapping were compared to those of actual modeling in order to examine the performance of 3D games when the technology is adapted by utilizing Unreal Engine 4. In addition, for the efficient application, the difference in performance according to the resolution and detail of cube map texture was verified.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.377-392
• /
• 2008

Let X be a real reflexive Banach space with a uniformly $G\hat{a}teaux$ differentiable norm, C a nonempty closed convex subset of X, T : C $\rightarrow$ X a continuous pseudocontractive mapping, and A : C $\rightarrow$ C a continuous strongly pseudocontractive mapping. We show the existence of a path ${x_t}$ satisfying $x_t=tAx_t+(1- t)Tx_t$, t $\in$ (0,1) and prove that ${x_t}$ converges strongly to a fixed point of T, which solves the variational inequality involving the mapping A. As an application, we give strong convergence of the path ${x_t}$ defined by $x_t=tAx_t+(1-t)(2I-T)x_t$ to a fixed point of firmly pseudocontractive mapping T.

• The Pure and Applied Mathematics
• /
• v.14 no.4
• /
• pp.283-287
• /
• 2007

An extension of the contraction mapping theorem is provided in a Banach space setting to approximate fixed points of operator equations. Our approach is justified by numerical examples where our results apply whereas the classical contraction mapping principle cannot.

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