• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.967-976
• /
• 2010

In recent times control functions have been used in several problems of metric fixed point theory. Also weak inequalities have been considered in a number of works on fixed points in metric spaces. Here we have incorporated a control function in certain weak inequalities. We have established two fixed point theorems for mapping satisfying such inequalities. Our results are supported by examples.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.565-585
• /
• 1996

In 1976, Caristi [1] established a celebrated fixed point theorem in complete metric spaces, which is a very useful tool in the theory of nonlinear analysis. Since then, several generalizations of the theorem were given by a number of authors: for instances, generalizations for single-valued mappings were given by Downing and Kirk [4], Park [11] and Siegel [13], and the multi-valued versions of the theorem were obtained by Chang and Luo [3], and Mizoguchi and Takahashi [10].

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.689-701
• /
• 2021

The purpose of this paper is to optimize the number of source places required for the unique representation of the destination using the tools of graph theory. A subset S of vertices of a graph G is called a rational resolving set of G if for each pair u, v ∈ V - S, there is a vertex s ∈ S such that d(u/s) ≠ d(v/s), where d(x/s) denotes the mean of the distances from the vertex s to all those y ∈ N[x]. A rational resolving set is called minimal rational resolving set if no proper subset of it is a rational resolving set. In this paper we study varieties of minimal rational resolving sets defined on the basis of its complements and compute the minimum and maximum cardinality of such sets, respectively called as lower and upper rational metric dimensions for power of a path P_n analysing various possibilities.

• Communications of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.7-21
• /
• 2015

We give the characterization of H$\ddot{o}$lder differentiability points and non-differentiability points of the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs (RNT) singular function ${\Psi}_{a,p}$ satisfying ${\Psi}_{a,p}(a)=p$. It generalizes recent multifractal and metric number theoretical results associated with the RNT function. Besides, we classify the singular functions using the singularity order deduced from the H$\ddot{o}$lder derivative giving the information that a strictly increasing smooth function having a positive derivative Lebesgue almost everywhere has the singularity order 1 and the RNT function ${\Psi}_{a,p}$ has the singularity order $g(a,p)=\frac{a{\log}p+(1-a){\log}(1-p)}{a{\log}a+(1-a){\log}(1-a)}{\geq}1$.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.21-25
• /
• 2009

In this paper, we study the problem to fit a piecewise-quadratic polynomial curve to points in the plane. The curve consists of quadratic polynomial segments and two points are connected by a segment. But it passes through a subset of points, and for the points not to be passed, the error between the curve and the points is estimated in $L^{\infty}$ metric. We consider two optimization problems for the above problem. One is to reduce the number of segments of the curve, given the allowed error, and the other is to reduce the error between the curve and the points, while the curve has the number of segments less than or equal to the given integer. For the number n of given points, we propose $O(n^2)$ algorithm for the former problem and $O(n^3)$ algorithm for the latter.

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.421-426
• /
• 2013

We give a series of discrete random variables which converges to a random variable whose distribution function is the Riesz-N$\acute{a}$gy-Tak$\acute{a}$cs (RNT) distribution. We show this using the correspondence theorem that if the moments coincide then their corresponding distribution functions also coincide.

• Honam Mathematical Journal
• /
• v.30 no.2
• /
• pp.227-231
• /
• 2008

We give some relation between the Riemann-Stieltjes integrals with respect to the Riesz-N$\'{a}$gy-Tak$\'{a}$cs(RNT) distribution $H_{a,p}$ satisfying the equation 1 - a = $a^m$ over different intervals, which generalizes recent results([6]) for a = ${\frac{1}{2}}$.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1173-1183
• /
• 2017

We give some sufficient conditions for the null and infinite derivatives of the $Riesz-N{\acute{a}}gy-Tak{\acute{a}}cs$ (RNT) singular function. Using these conditions, we show that the Hausdorff dimension of the set of the infinite derivative points of the RNT singular function coincides with its packing dimension which is positive and less than 1 while the Hausdorff dimension of the non-differentiability set of the RNT singular function does not coincide with its packing dimension 1.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.99-107
• /
• 1997

We consider a multiechelon repairable-item inventory system where several bases are supported by a central depot and the external repair facilities. Unlike METRIC- based models, there are only a finite number of repair channels at each base, central depot and the external repair facilities. It is desired to find repair capacities and spares level which together guarantee a specified service level at minimum cost. Closed queueing network theory is used to model the stochastic process. The purpose of this paper is to derive the steady-state distributions of this system.

• Journal of Integrative Natural Science
• /
• v.7 no.2
• /
• pp.138-144
• /
• 2014

Fisher information matrix plays an important role in statistical inference of unknown parameters. Especially, it is used in objective Bayesian inference where we calculate the posterior distribution using a noninformative prior distribution, and also in an example of metric functions in geometry. To estimate parameters in a distribution, we can use the Fisher information matrix. The more the number of parameters increases, the more its matrix form gets complicated. In this paper, by using Mathematica programs we derive the Fisher information matrix for 4-parameter generalized gamma distribution which is used in reliability theory.