• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제30권4호
• /
• pp.417-427
• /
• 2023

The purpose of this paper is establish the existence of proximity point for the cyclic B-contraction mapping on metric spaces and uniformly convex Banach spaces. Also, we prove the common proximity point for the S-weakly cyclic B-contraction mapping. In addition, a few examples are provided to demonstrate our findings.

• Korean Journal of Mathematics
• /
• 제31권3호
• /
• pp.373-383
• /
• 2023

The aim of this paper is to prove some new approximate best proximity pair theorems on metric spaces using contraction mappings such as P-Bianchini contraction, P - B contraction and so on. A few examples are provided to exemplify our findings. Finally, we discuss some applications that are related to the main results.

• Nonlinear Functional Analysis and Applications
• /
• 제29권2호
• /
• pp.581-596
• /
• 2024

A new variety of non-self generalized proximal contraction, called Hardy-Rogers α⁺F-proximal contraction, is shown in this work. Also, with an example, we prove that such contractions satisfying some conditions must have a unique best proximity point. For some particular values of the constants, that we have used to generalize the proximal contraction, we conclude different α⁺F-proximal contraction results of the types Ćirić, Chatterjea, Reich, Kannan, and Banach with proof, that all such type of contractions must have unique best proximity point. We also apply our result to solve a functional equation.

• Korean Journal of Mathematics
• /
• 제31권2호
• /
• pp.123-131
• /
• 2023

In this paper, we prove existence of best proximity points for 2-convex contraction, 2-sided contraction, and M-weakly cyclic 2-convex contraction mappings in the setting of complete strongly regular generalized modular metric spaces that generalize many results in the literature.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.119-133
• /
• 2011

This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming. We introduce a special self-regular proximity to induce the feasibility step and also to measure proximity to the central path. The result of polynomial complexity coincides with the best-known iteration bound for infeasible interior-point methods, namely, O(n log n/${\varepsilon}$).

• 대한수학회보
• /
• 제34권2호
• /
• pp.259-271
• /
• 1997

Let K be a nonempty subset of a normed linear space X and let x $\in$ X. An element k$_0$ in K satisfying $\$\mid$$x - k$_0$$\$\mid$$ = d(x, K) := (equation omitted) $\$\mid$$x - k$\$\mid$$ is called a best approximation to x from K. For any x $\in$ X, the set of all best approximations to x from K is denoted by P$_K$(x) = {k $\in$ K : $\$\mid$$ x - k $\$\mid$$ = d(x, K)}. (omitted)

• International Journal of Computer Science & Network Security
• /
• 제24권1호
• /
• pp.23-30
• /
• 2024

This study tries clarify the process of making decisions with geographic information systems and how to choose the best place for Khartoum State displaced people to relocate to in order to be closer to cheaper places with access to commodities and services. For network analysis, use a unique model. The network analysis tool was dependent on the following information: availability of goods and services, cheap cost, and proximity to the state of Khartoum.in choosing the best state. The study came to the conclusion that, in terms of accessibility, affordability, and availability of products and services, Gezira State is the best state for people who have been displaced from Khartoum State.When developing a new model, we recommend that all GIS users apply the theories of spatial analysis.

• Nonlinear Functional Analysis and Applications
• /
• 제29권1호
• /
• pp.209-224
• /
• 2024

The goal of this study is to instigate various new and novel optimum proximity point theorems using the notion of implicit relation type ℶ-proximal contraction for non-self mappings. An illustrated example is used to demonstrate the validity of the obtained results. Furthermore, some uniqueness results for proximal contractions are also furnished with partial order and graph. Various well-known discoveries in the present state-of-the-art are enhanced, extended, unified, and generalized by our findings. As an application, we generate some fixed point results fulfilling a modified contraction and a graph contraction, using the profundity of the established results.

• 응용통계연구
• /
• 제32권3호
• /
• pp.451-462
• /
• 2019

문서-용어 빈도행렬은 텍스트 마이닝 분야에서 보편적으로 사용되는 데이터의 한 유형으로, 여러 개체들이 제공하는 문서를 기반으로 만들어진다. 그러나 대다수의 연구자들은 개체 정보에 무게를 두지 않고 여러 문서에서 공통적으로 등장하는 공통용어 중 핵심적인 용어를 효과적으로 찾아내는 방법에 집중하는 경향을 보인다. 공통용어에서 핵심어를 선별할 경우 특정 문서에서만 등장하는 중요한 용어들이 공통용어 선정단계에서부터 배제될 뿐만 아니라 개별 문서들이 갖는 고유한 정보가 누락되는 등의 문제가 야기된다. 본 연구에서는 이러한 문제를 극복할 수 있는 데이터를 근접성 데이터라 정의한다. 그리고 근접성 데이터를 생성할 수 있는 12가지 방법 중 개체 군집화의 관점에서 가장 최적화된 방법을 제안한다. 개체 특성 파악을 위한 군집화 알고리즘으로는 다차원척도법과 K-평균 군집분석을 활용한다.

• 대한원격탐사학회지
• /
• 제27권6호
• /
• pp.717-728
• /
• 2011

An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.