• Bulletin of the Korean Mathematical Society
• /
• v.61 no.3
• /
• pp.849-866
• /
• 2024

In this paper, we study the rectifying curves in multiplicative Euclidean space of dimension 3, i.e., those curves for which the position vector always lies in its rectifying plane. Since the definition of rectifying curve is affine and not metric, we are directly able to perform multiplicative differential-geometric concepts to investigate such curves. By several characterizations, we completely classify the multiplicative rectifying curves by means of the multiplicative spherical curves.

• The Mathematical Education
• /
• v.21 no.3
• /
• pp.7-11
• /
• 1983

A measurable function f defined on a measurable subset A of the real line R is called pth power summable on A if │f│$^{p}$ is integrable on A and the set of all pth power summable functions on A is denoted by L$^{p}$ (A). For each member f in L$^{p}$ (A), we define ∥f∥$_{p}$ =(equation omitted) For real numbers p and q where (equation omitted) and (equation omitted), we discuss the Holder's inequality ∥fg∥$_1$<∥f∥$_{p}$ ∥g∥$_{q}$ , f$\in$L$^{p}$ (A), g$\in$L$^{q}$ (A) and the Minkowski inequality ∥＋g∥$_{p}$ <∥f∥$_{p}$ ＋∥g∥$_{p}$ , f,g$\in$L$^{p}$ (A). In this paper also discuss that L$_{p}$ (A) becomes a metric space with the metric $\rho$ : L$^{p}$ (A) $\times$L$^{p}$ (A) longrightarrow R where $\rho$(f,g)=∥f-g∥$_{p}$ , f,g$\in$L$^{p}$ (A). Then, in this paper prove the Riesz-Fischer theorem, i.e., the space L$^{p}$ (A) is complete and that the space L$^{p}$ (A) is separable.

• The Mathematical Education
• /
• v.26 no.1
• /
• pp.41-45
• /
• 1987

In this paper, we give several fixed point theorems in a complete metric space for two multi-valued mappings commuting with two single-valued mappings. In fact, our main theorems show the existence of solutions of functional equations f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ and $\chi$=f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ under certain conditions. We also answer an open question proposed by Rhoades-Singh-Kulsherestha. Throughout this paper, let (X, d) be a complete metric space. We shall follow the following notations : CL(X) = {A; A is a nonempty closed subset of X}, CB(X)={A; A is a nonempty closed and founded subset of X}, C(X)={A; A is a nonempty compact subset of X}, For each A, B$\in$CL(X) and $\varepsilon$>0, N($\varepsilon$, A) = {$\chi$$\in$X; d($\chi$, ${\alpha}$) < $\varepsilon$ for some ${\alpha}$$\in$A}, E$\sub$A, B/={$\varepsilon$ > 0; A⊂N($\varepsilon$ B) and B⊂N($\varepsilon$, A)}, and (equation omitted). Then H is called the generalized Hausdorff distance function fot CL(X) induced by a metric d and H defined CB(X) is said to be the Hausdorff metric induced by d. D($\chi$, A) will denote the ordinary distance between $\chi$$\in$X and a nonempty subset A of X. Let R$\^$+/ and II$\^$+/ denote the sets of nonnegative real numbers and positive integers, respectively, and G the family of functions ${\Phi}$ from (R$\^$+/)$\^$s/ into R$\^$+/ satisfying the following conditions: (1) ${\Phi}$ is nondecreasing and upper semicontinuous in each coordinate variable, and (2) for each t>0, $\psi$(t)=max{$\psi$(t, 0, 0, t, t), ${\Phi}$(t, t, t, 2t, 0), ${\Phi}$(0, t, 0, 0, t)} $\psi$: R$\^$+/ \longrightarrow R$\^$+/ is a nondecreasing upper semicontinuous function from the right. Before sating and proving our main theorems, we give the following lemmas:

• Journal of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.587-601
• /
• 2015

In this paper, we investigate the $\mathbb{R}$-complex Hermitian Finsler spaces, emphasizing the differences that separate them from the complex Finsler spaces. The tools used in this study are the Chern-Finsler and Berwald connections. By means of these connections, some classes of the $\mathbb{R}$-complex Hermitian Finsler spaces are defined, (e.g. weakly K$\ddot{a}$hler, K$\ddot{a}$hler, strongly K$\ddot{a}$hler). Here the notions of K$\ddot{a}$hler and strongly K$\ddot{a}$hler do not coincide, unlike the complex Finsler case. Also, some kinds of Berwald notions for such spaces are introduced. A special approach is devoted to obtain the equivalence conditions for an $\mathbb{R}$-complex Hermitian Finsler space to become a weakly Berwald or Berwald. Finally, we obtain the conditions under which an $\mathbb{R}$-complex Hermitian Finsler space with Randers metric is Berwald. We get some clear examples which illustrate the interest for this work.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.372-383
• /
• 2006

Among the approaches to image database management, content-based image retrieval (CBIR) is viewed as having the best support for effective searching and browsing of large digital image libraries. Typical CBIR systems allow a user to provide a query image, from which low-level features are extracted and used to find 'similar' images in a database. However, there exists the semantic gap between human visual perception and low-level representations. An effective methodology for overcoming this semantic gap involves relevance feedback to perform feature re-weighting. Current approaches to feature re-weighting require the number of components for a feature representation to be the same for every image in consideration. Following this assumption, they map each component to an axis in the n-dimensional space, which we call the metric space; likewise the feature representation is stored in a fixed-length vector. However, with the emergence of features that do not have a fixed number of components in their representation, existing feature re-weighting approaches are invalidated. In this paper we propose a feature re-weighting technique that supports features regardless of whether or not they can be mapped into a metric space. Our approach analyses the feature distances calculated between the query image and the images in the database. Two-sided confidence intervals are used with the distances to obtain the information for feature re-weighting. There is no restriction on how the distances are calculated for each feature. This provides freedom for how feature representations are structured, i.e. there is no requirement for features to be represented in fixed-length vectors or metric space. Our experimental results show the effectiveness of our approach and in a comparison with other work, we can see how it outperforms previous work.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.427-446
• /
• 1995

Let S be a set and B be a $\sigma$-field on S. We consider $(\Omega = S^Z, T = B^z, P)$ as the basic probability space. We denote by T the left shift on $\Omega$. We assume that P is invariant under T, i.e., $PT^{-1} = P$, and that T is ergodic. We denote by $X = \cdots, X_-1, X_0, X_1, \cdots$ the coordinate maps on $\Omega$. From our assumptions it follows that ${X_i}_{i \in Z}$ is a stationary and ergodic process.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.983-992
• /
• 1996

Let p(x, dy) be a transition probability function on $(S, \rho)$, where S is a complete separable metric space. Then a Markov process $X_n$ which has p(x, dy) as its transition probability may be generated by random iterations of the form $X_{n+1} = f(X_n, \varepsilon_{n+1})$, where $\varepsilon_n$ is a sequence of independent and identically distributed random variables (See, e.g., Kifer(1986), Bhattacharya and Waymire(1990)).

• Kyungpook Mathematical Journal
• /
• v.59 no.2
• /
• pp.341-352
• /
• 2019

Let M be an n-dimensional closed Riemannian manifold with metric g, $d{\mu}=e^{-{\phi}(x)}d{\nu}$ be the weighted measure and ${\Delta}_{p,{\phi}}$ be the weighted p-Laplacian. In this article we will study the evolution and monotonicity for the first nonzero eigenvalue problem of the weighted p-Laplace operator acting on the space of functions along the Yamabe flow on closed Riemannian manifolds. We find the first variation formula of it along the Yamabe flow. We obtain various monotonic quantities and give an example.

• East Asian mathematical journal
• /
• v.34 no.5
• /
• pp.643-649
• /
• 2018

Let M be a connected n-dimensional submanifold of a Euclidean space $E^{n+k}$ equipped with the induced metric and ${\Delta}$ its Laplacian. If the position vector x of M is decomposed as a sum of three vectors $x=x_1+x_2+x_0$ where two vectors $x_1$ and $x_2$ are non-constant eigenvectors of the Laplacian, i.e., ${\Delta}x_i={\lambda}_ix_i$, i = 1, 2 (${\lambda}_i{\in}R$) and $x_0$ is a constant vector, then, M is called a 2-type submanifold. In this paper we proved that a connected 2-type hypersurface M in $E^{n+1}$ whose postion vector x satisfies ${\langle}{\Delta}x,x-x_0{\rangle}=c$ for a constant c, where ${\langle}$, ${\rangle}$ is the usual inner product in $E^{n+1}$, is of null 2-type and has constant mean curvature and scalar curvature.