• Communications of the Korean Mathematical Society
• /
• v.24 no.1
• /
• pp.67-83
• /
• 2009

Several common fixed point theorems for a few contractive type mappings in complete metric spaces are established. As applications, the existence and uniqueness of common solutions for certain systems of functional equations arising in dynamic programming are discussed.

• Communications of the Korean Mathematical Society
• /
• v.22 no.4
• /
• pp.513-526
• /
• 2007

In this paper, we give some new definitions of M-fuzzy metric spaces and we prove a common fixed point theorem for six mappings under the condition of compatible mappings of first or second type in two complete M-fuzzy metric spaces.

• Communications of the Korean Mathematical Society
• /
• v.28 no.3
• /
• pp.517-526
• /
• 2013

We give a fixed point theorem for complete fuzzy metric space which generalizes fuzzy Banach contraction theorems established by V. Gregori and A. Spena [Fuzzy Sets and Systems 125 (2002), 245-252] using notion of altering distance, initiated by Khan et al. [Bull. Austral. Math. Soc. 30 (1984), 1-9] in metric spaces.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.305-320
• /
• 2012

The purpose of this paper is to introduce a hybrid projection method for finding a common element of the set of solutions of a generalized equilibrium problem, the set of solutions of a variational inclusion problem and the set of common fixed points of a finite family of strict pseudo-contractions in Hilbert spaces.

• Communications of the Korean Mathematical Society
• /
• v.24 no.4
• /
• pp.581-594
• /
• 2009

In this paper, we establish a common fixed point theorem in complete fuzzy metric spaces which generalizes some results in [9].

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.197-213
• /
• 2009

In this paper, we give some new denitions of $\cal{L}^*_\cal{M}$-fuzzy metric spaces and we prove a common xed point theorem for two mappings in complete $\cal{L}^*_\cal{M}$-fuzzy metric spaces. We get some improved versions of several xed point theorems in complete $\cal{L}^*_\cal{M}$-fuzzy metric spaces.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.599-608
• /
• 2010

In this paper, we introduce the concept of generalized weak contractivity for set-valued maps defined on quasi metric spaces. We analyze the existence of fixed points for generalized weakly contractive set-valued maps. And we have Nadler's fixed point theorem and Banach's fixed point theorem in quasi metric spaces. We investigate the convergene of iterate schem of the form $x_{n+1}{\in}Fx_n$ with error estimates.

• East Asian mathematical journal
• /
• v.25 no.1
• /
• pp.107-117
• /
• 2009

In this paper, we give some new definitions of D-metric spaces and we prove a common fixed point theorem for a class of mappings under the condition of weakly compatible mappings in complete D-metric spaces. We get some improved versions of several fixed point theorems in complete D-metric spaces.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.195-198
• /
• 2000

Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.81-84
• /
• 2000

Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.