• Communications of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.265-277
• /
• 2012

In this paper we establish two common fixed point theorems in fuzzy metric spaces. These theorems are generalisations of the Banach contraction mapping principle and the Kannan's fixed point theorem respectively in fuzzy metric spaces. Our result is also supported by examples.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.57-57
• /
• 2017

Chrysanthemum is one of the most important floral crop in Korea produced about 7 billion dollars (1 billion for pot and 6 billion for cutting) in 2013. However, it is difficult to breed and to do genetic study because 1) it is highly self-incompatible, 2) it is outcrossing crop having heterozygotes, and 3) commercial cultvars are hexaploid (2n = 6x = 54). Although low-density genetic map and QTL study were reported, it is not enough to apply for the marker assisted selection and other genetic studies. Therefore, we are trying to make high-density genetic mapping using GBS with about 100 $F_1s$ of C. boreale that is oHohhfd diploid (2n = 2x = 18, about 2.8Gb) instead of commercial culitvars. Since Chrysanthemum is outcrossing, two-way pseudo-testcross model would be used to construct genetic map. Also, genotype-by-sequencing (GBS) would be utilized to generate sufficient number of markers and to maximize genomic representation in a cost effective manner. Those completed sequences would be analyzed with TASSEL-GBS pipeline. In order to reduce sequence error, only first 64 sequences, which have almost zero percent error, would be incorporated in the pipeline for the analysis. In addition, to reduce errors that is common in heterozygotes crops caused by low coverage, two rare cutters (NsiI and MseI) were used to increase sequence depth. Maskov algorithm would also used to deal with missing data. Further, sparsely placed markers on the physical map would be used as anchors to overcome problems caused by low coverage. For this purpose, were generated from transcriptome of Chrysanthemum using MISA program. Among those, 10 simple sequence repeat (SSR) markers, which are evenly distributed along each chromosome and polymorphic between two parents, would be selected.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.183-188
• /
• 2010

A factorization-based 3D reconstruction system is realized to recover 3D scene from an image sequence. The image sequence is captured from uncalibrated perspective camera from several views. Many matched feature points over all images are obtained by feature tracking method. Then, these data are supplied to the 3D reconstruction module to obtain the projective reconstruction. Projective reconstruction is converted to Euclidean reconstruction by enforcing several metric constraints. After many triangular meshes are obtained, realistic reconstruction of 3D models are finished by texture mapping. The developed system is implemented in C++, and Qt library is used to implement the system user interface. OpenGL graphics library is used to realize the texture mapping routine and the model visualization program. Experimental results using synthetic and real image data are included to demonstrate the effectiveness of the developed system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.207-210
• /
• 2009

An efficient algorithm to compress high dynamic range (HDR) videos is proposed in this work. We separate an HDR video sequence into a tone-mapped low dynamic range (LDR) sequence and a ratio sequence. Then, we encode those two sequences using the standard H.264/AVC codec. During the encoding, we allocate a limited amount of bit budget to the LDR sequence and the ratio sequence adaptively to maximize the qualities of both the LDR and HDR sequences. While a conventional LDR decoder uses only the LDR stream, an HDR decoder can reconstruct the HDR video using the LDR stream and the ratio stream. Simulation results demonstrate that the proposed algorithm provides higher performance than the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.153-157
• /
• 2009

In this paper, for even integer N, we propose a new construction method of quaternary low correlation zone(LCZ) sequence set from a binary LCZ sequence set with parameters (N,M,L,$\varepsilon$). Proposed method applies the inverse gray mapping from Krone and Sarwate to binary LCZ sequences and their phase shifts. The only needed condition of binary LCZ sequence set used in this construction is even period.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.103-111
• /
• 2014

Let X be a uniformly convex Banach space, and S, T be pair of mean nonexpansive mappings. Some necessary and sufficient conditions are given for Ishikawa iterative sequence converge to common fixed points, and we prove that the sequence of Ishikawa iterations associated with S and T converges to the common fixed point of S and T. This generalizes former results proved by Z. Gu and Y. Li [4].

• Kyungpook Mathematical Journal
• /
• v.46 no.2
• /
• pp.201-209
• /
• 2006

Suppose C is a nonempty closed convex subset of a real uniformly convex Banach space X. Let T : $C{\rightarrow}C$ be an asymptotically nonexpansive in the intermediate sense mapping. In this paper we introduced the three-step iterative sequence for such map with error members. Moreover, we prove that, if T is completely continuous then the our iterative sequence converges strongly to a fixed point of T.

• Kyungpook Mathematical Journal
• /
• v.63 no.3
• /
• pp.451-461
• /
• 2023

In this paper, we study the fixed point property for generalized asymptotically nonexpansive mappings in the setting of p-Hadamard spaces, with p ≥ 2. We prove the strong convergence of the sequence generated by the modified two-step iterative sequence for finding a fixed point of a generalized asymptotically nonexpansive mapping in p-Hadamard spaces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1710-1718
• /
• 2015

Selected mapping (SLM) is an effective scheme to reduce the peak to average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) system. For data recovery, the receiver needs to know the side information (SI) on the scrambling sequence selected by the transmitter. In this paper, a new SLM scheme is proposed, which can reduce implementation complexity substantially by allowing the receiver to recover the data without SI. In the proposed SLM method, the concept of virtual channel corresponding to the convolution of the multipath channel and the inverse discrete fourier transform (IDFT) of the scrambling sequence is assumed. The receiver can recover the data without SI by using the virtual channel estimated with pilot signals. It is shown by simulation that the proposed SLM has PAPR reduction and BER performances similar to the previous SLM schemes while it can reduce implementation complexity substantially.