• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.379-384
• /
• 2003

In this paper, we obtain a topology $\tau\delta$ on X. From this topology, we obtain some characterizations of if-closed spaces.

• Kyungpook Mathematical Journal
• /
• v.50 no.4
• /
• pp.537-543
• /
• 2010

Let X be a regular $T_1$-space such that each single point set is a $G_{\delta}$ set. Denot 'hereditarily closure-preserving' by 'HCP'. To consider a question of closed maps of S. Lin in [6], we improve some results of Foged in [1], and prove the following propositions. Proposition 1. $D\;=\;\{x{\in}X\;:\;\mid\{F{\in}\cal{F}:x{\in}F\}\mid{\geq}{\aleph}_0\}$ is discrete and closed if $\cal{F}$ is a collection of HCP. Proposition 2. $\cal{H}\;=\;\{{\cup}\cal{F}'\;:\;F'$ is an fininte subcolletion of $\cal{F}_n\}$ is HCP if $\cal{F}$ is a collection of HCP. Proposition 3. Let (X,$\tau$) have a $\sigma$-HCP k-network. Then (X,$\tau$) has a $\sigma$-HCP k-network F = ${\cup}_n\cal{F}_n$ such that such tat: (i) $\cal{F}_n\;\subset\;\cal{F}_{n+1}$, (ii) $D_n\;=\;\{x{\in}X\;:\;\mid\{F{\in}\cal{F}_n\;:\;x{\in}F\}\mid\;{\geq}\;{\aleph}_0\}$ is a discrete closed set and (iii) each $\cal{F}_n$ is closed to finite intersections.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.575-590
• /
• 2017

A new class of functions called $R_{\theta}$-supercontinuous functions is introduced. Their basic properties are studied and their place in the hierarchy of strong variants of continuity, which already exist in the literature, is elaborated. The class of $R_{\theta}$-supercontinuous functions properly contains the class of $R_z$-supercontinuous functions [39] which in turn properly contains the class of $R_{cl}$-supercontinuous functions [43] and so includes all cl-supercontinuous (clopen continuous) functions ([38], [34]) and is properly contained in the class of $R_{\delta}$-supercontinuous functions [24].

• Communications for Statistical Applications and Methods
• /
• v.15 no.2
• /
• pp.147-159
• /
• 2008

We consider using ranked set sampling methods to draw inference about the three well-known measures of overlap, namely Matusita's measure $\rho$, Morisita's measure $\lambda$ and Weitzman's measure $\Delta$. Two exponential populations with different means are considered. Due to the difficulties of calculating the precision or the bias of the resulting estimators of overlap measures, because there are no closed-form exact formulas for their variances and their exact sampling distributions, Monte Carlo evaluations are used. Confidence intervals for those measures are also constructed via the bootstrap method and Taylor series approximation.

• Communications of the Korean Mathematical Society
• /
• v.9 no.2
• /
• pp.331-336
• /
• 1994

Let $P_{0}$ be a $\delta$-ring (a ring closed with respect to the forming of countable intersections) of subsets of a nonempty set $\Omega$. Let X and Y be Banach spaces and L(X, Y) the Banach space of all bounded linear operators from X to Y. A set function m : $P_{0}$ longrightarrow L(X, Y) is called an operator valued measure countably additive in the strong operator topology if for every x $\epsilon$ X the set function E longrightarrow m(E)x is a countably additive vector measure. From now on, m will denote an operator valued measure countably additive in the strong operator topology.(omitted)

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.35-43
• /
• 2008

Let E be a uniformly convex Banach space and K be a nonempty closed convex subset of E. Let ${\{T_i\}}^N_{i=1}$ be N nonexpansive self-mappings of K with $F\;=\;{\cap}^N_{i=1}F(T_i)\;{\neq}\;{\theta}$ (here $F(T_i)$ denotes the set of fixed points of $T_i$). Suppose that one of the mappings in ${\{T_i\}}^N_{i=1}$ is semi-compact. Let $\{{\alpha}_n\}\;{\subset}\;[{\delta},\;1-{\delta}]$ for some ${\delta}\;{\in}\;(0,\;1)$ and $\{{\beta}_n\}\;{\subset}\;[\tau,\;1]$ for some ${\tau}\;{\in}\;(0,\;1]$. For arbitrary $x_0\;{\in}\;K$, let the sequence {$x_n$} be defined iteratively by $\{{x_n\;=\;{\alpha}_nx_{n-1}\;+\;(1-{\alpha}_n)T_ny_n,\;\;\;\;\;\;\;\;\; \atop {y_n\;=\;{\beta}nx_{n-1}\;+\;(1-{\beta}_n)T_nx_n},\;{\forall}_n{\geq}1,}$, where $T_n\;=\;T_{n(modN)}$. Then {$x_n$} convergence strongly to a common fixed point of the mappings family ${\{T_i\}}^N_{i=1}$. The result presented in this paper generalized and improve the corresponding results of Chidume and Shahzad [C. E. Chidume, N. Shahzad, Strong convergence of an implicit iteration process for a finite family of nonexpansive mappings, Nonlinear Anal. 62(2005), 1149-1156] even in the case of ${\beta}_n\;{\equiv}\;1$ or N=1 are also new.

• Communications of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.301-319
• /
• 2020

In this paper, we show that the system of difference equations $x_n={\frac{ay^p_{n-1}+b(x_{n-2}y_{n-1})^{p-1}}{cy_{n-1}+dx^{p-1}_{n-2}}}$, $y_n={\frac{{\alpha}x^p_{n-1}+{\beta}(y_{n-2}x_{n-1})^{p-1}}{{\gamma}x_{n-1}+{\delta}y^{p-1}_{n-2}}}$, n ∈ ℕ₀ where the parameters a, b, c, d, α, β, γ, δ, p and the initial values x-2, x-1, y-2, y-1 are real numbers, can be solved. Also, by using obtained formulas, we study the asymptotic behaviour of well-defined solutions of aforementioned system and describe the forbidden set of the initial values. Our obtained results significantly extend and develop some recent results in the literature.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.10
• /
• pp.1012-1015
• /
• 2011

The decision-directed blind equalization algorithm is often used due to its simplicity and good convergence property when the eye pattern is open. However, in a channel where the eye pattern is closed, the decision-directed algorithm is not guaranteed to converge. Hence, a modified Bussgang-type algorithm using a hyperbolic tangent function for zero-memory nonlinear(ZNL) function has been proposed and applied to avoid this problem by Filho et al. But application of this algorithm includes the calculation of hyperbolic tangent function and its derivative or a look-up table which may need a large amount of memory due to channel variations. To reduce the computational and/or hardware complexity of Filho's algorithm, in this paper, an improved method for the decision-directed algorithm is proposed. In the proposed scheme, the ZNL function and its derivative are respectively set to be the original signum function and a narrow rectangular pulse which is an approximation of Dirac delta function. It is shown that the proposed scheme, when it is combined with decision-directed algorithm, reduces the computational complexity drastically while it retains the convergence and steady-state performance of the Filho's algorithm.