‎The aim of this paper is to establish the equivalence between the concepts‎ ‎of an $S$-metric space and a cone $S$-metric space using some topological‎ ‎approaches‎. ‎We introduce a new notion of a $TVS$-cone $S$-metric space using‎ ‎some facts about topological vector spaces‎. ‎We see that the known results on‎ ‎cone $S$-metric spaces (or $N$-cone metric spaces) can be directly obtained‎ from...

the sequential $p$-convergence in a fuzzy metric space, in the sense of george and veeramani, was introduced by d. mihet as a weaker concept than convergence. here we introduce a stronger concept called $s$-convergence, and we characterize those fuzzy metric spaces in which convergent sequences are $s$-convergent. in such a case $m$ is called an $s$-fuzzy metric. if $(n_m,ast)$ is a fuzzy metri...

equality of -curvatures of the berwald and cartan connections leads to a new class of finsler metrics, so-called bc-generalized landsberg metrics. here, we prove that every bc-generalized landsberg metric of scalar flag curvature with dimension greater than two is of constant flag curvature.

Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...

recently, rahimi et al. [comp. appl. math. 2013, in press] dened the conceptof quadrupled xed point in k-metric spaces and proved several quadrupled xed pointtheorems for solid cones on k-metric spaces. in this paper some quadrupled xed point resultsfor t-contraction on k-metric spaces without normality condition are proved. obtainedresults extend and generalize well-known comparable result...

This paper is directed to the question of how to model and design an efficient tool for the intelligent mapping which is based on both dynamic and efficient storage of data and soft computing. The former is performed by our method that learns how to store, search and delete the data. After pointing out the limitation of the crisp evaluation of the distance between two points, we argue in favor ...