scholarly journals An extension to the spherical metric using polar linear interpolation

Author(s):  
Daniel J Greenhoe

The spherical metric d_r operates on the surface of a sphere with radius r centered at the origin in a linear space R^n. Thus, for any pair of points (p,q) on the surface of this sphere, (p,q) is in the domain of d_r and d_r(p,q) is the "distance" between those points. However, if x and y are both in R^n but are not on the surface of a common sphere centered at the origin, then (p,q) is not in the domain of d_r and d_r(p,q) is simply undefined. In certain applications, however, it would be useful to have an extension d of d_r to the entire space R^n (rather than just on a surface in R^n). Real world applications for such an extended metric include calculations involving near earth objects, and for certain distance spaces useful in symbolic sequence processing. This paper introduces an extension to the spherical metric using a polar form of linear interpolation. The extension is herein called the "Lagrange arc distance". It has as its domain the entire space R^n, is homogeneous, and is continuous everywhere in R^n except at the origin. However the extension does come at a cost: The Lagrange arc distance d(p,q), as its name suggests, is a distance function rather than a metric. In particular, the triangle inequality does not in general hold. Moreover, it is not translation invariant, does not induce a norm, and balls in the distance space (R^n,d) are not convex. On the other hand, empirical evidence suggests that the Lagrange arc distance results in structure similar to that of the Euclidean metric in that balls in R^2 and R^3 generated by the two functions are in some regions of R^n very similar in form.

2016 ◽  
Author(s):  
Daniel J Greenhoe

The spherical metric d_r operates on the surface of a sphere with radius r centered at the origin in a linear space R^n. Thus, for any pair of points (p,q) on the surface of this sphere, (p,q) is in the domain of d_r and d_r(p,q) is the "distance" between those points. However, if x and y are both in R^n but are not on the surface of a common sphere centered at the origin, then (p,q) is not in the domain of d_r and d_r(p,q) is simply undefined. In certain applications, however, it would be useful to have an extension d of d_r to the entire space R^n (rather than just on a surface in R^n). Real world applications for such an extended metric include calculations involving near earth objects, and for certain distance spaces useful in symbolic sequence processing. This paper introduces an extension to the spherical metric using a polar form of linear interpolation. The extension is herein called the "Lagrange arc distance". It has as its domain the entire space R^n, is homogeneous, and is continuous everywhere in R^n except at the origin. However the extension does come at a cost: The Lagrange arc distance d(p,q), as its name suggests, is a distance function rather than a metric. In particular, the triangle inequality does not in general hold. Moreover, it is not translation invariant, does not induce a norm, and balls in the distance space (R^n,d) are not convex. On the other hand, empirical evidence suggests that the Lagrange arc distance results in structure similar to that of the Euclidean metric in that balls in R^2 and R^3 generated by the two functions are in some regions of R^n very similar in form.


1982 ◽  
Vol 89 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Amos Tversky ◽  
Itamar Gati
Keyword(s):  

Author(s):  
Brian Street

This chapter discusses a case for single-parameter singular integral operators, where ρ‎ is the usual distance on ℝn. There, we obtain the most classical theory of singular integrals, which is useful for studying elliptic partial differential operators. The chapter defines singular integral operators in three equivalent ways. This trichotomy can be seen three times, in increasing generality: Theorems 1.1.23, 1.1.26, and 1.2.10. This trichotomy is developed even when the operators are not translation invariant (many authors discuss such ideas only for translation invariant, or nearly translation invariant operators). It also presents these ideas in a slightly different way than is usual, which helps to motivate later results and definitions.


Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss

This chapter presents some results about groups generated by reflections and the standard metric on a Bruhat-Tits building. It begins with definitions relating to an affine subspace, an affine hyperplane, an affine span, an affine map, and an affine transformation. It then considers a notation stating that the convex closure of a subset a of X is the intersection of all convex sets containing a and another notation that denotes by AGL(X) the group of all affine transformations of X and by Trans(X) the set of all translations of X. It also describes Euclidean spaces and assumes that the real vector space X is of finite dimension n and that d is a Euclidean metric on X. Finally, it discusses Euclidean representations and the standard metric.


2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.


2020 ◽  
Author(s):  
Morteza Javadi ◽  
Van A. Ortega ◽  
Alyxandra Thiessen ◽  
Maryam Aghajamali ◽  
Muhammad Amirul Islam ◽  
...  

<p>The design and fabrication of Si-based multi-functional nanomaterials for biological and biomedical applications is an active area of research. The potential benefits of using Si-based nanomaterials are not only due to their size/surface-dependent optical responses but also the high biocompatibility and low-toxicity of silicon itself. Combining these characteristics with the magnetic properties of Fe<sub>3</sub>O<sub>4</sub> nanoparticles (NPs) multiplies the options available for real-world applications. In the current study, biocompatible magnetofluorescent nano-hybrids have been prepared by covalent linking of Si quantum dots to water-dispersible Fe<sub>3</sub>O<sub>4</sub> NPs <i>via</i> dicyclohexylcarbodiimide (DCC) coupling. We explore some of the properties of these magnetofluorescent nano-hybrids as well as evaluate uptake, the potential for cellular toxicity, and the induction of acute cellular oxidative stress in a mast cells-like cell line (RBL-2H3) by heat induction through short-term radio frequency modulation (10 min @ 156 kHz, 500 A). We found that the NPs were internalized readily by the cells and also penetrated the nuclear membrane. Radio frequency activated nano-hybrids also had significantly increased cell death where > 50% of the RBL-2H3 cells were found to be in an apoptotic or necrotic state, and that this was attributable to increased triggering of oxidative cell stress mechanisms. </p>


Sign in / Sign up

Export Citation Format

Share Document