Graphs are attached to 2r where 2r is the ring with 2 r elements using an analogue of Euclidean distance. M.R. DeDeo (2003) showed that these graphs are non-Ramanujan for r 4. In this paper, we will show that finite Euclidean graphs attached to 2r are non Ramanujan for r 2 except for r = 2 and d = 2, 3. Together with the results in Medrano et al. (1998), this implies that finite Euclidean graph...

We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in concrete circumstances.

This pilot study investigates the phonetic realisation of Estonian Swedish long close vowels comparing them with Central Swedish and Finland Swedish counterparts. It appears that in the Rickul variety of Estonian Swedish there is a distinction between only three long close vowels. The analysed vowels of Estonian Swedish are more similar to those of Central Swedish than Finland Swedish, as measu...

The feature of our method different from other fuzzy grey relation method for supermixed multiple attribute group decision-making is that all of the subjective and objective weights are obtained by interval grey number and that the group decisionmaking is performed based on the relative approach degree of grey TOPSIS, the relative approach degree of grey incidence and the relative membership de...

Consider a population of citizens uniformly spread over the entire plane, that faces a problem of locating public facilities to be used by its members. The cost of every facility is financed by its users, who also face an idiosyncratic private access cost to the facility. We assume that the facilities’ cost is independent of location and access costs are linear with respect to the Euclidean dis...

Let n points be arbitrarily placed in B(D), a disk in R having diameter D. Denote by lij the Euclidean distance between point i and j. In this paper, we show n ∑ i=1 ( min j 6=i l ij ) ≤ D 2 0.3972 . We then extend the result to R.

disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. therefore, in this paper a disguised face recognition algorithm based on local phase quantization (lpq) method and singular value decomposition (svd) is presented which deals with two main challenges. the first challenge is when an individual intentionally alters the appearance ...

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...

This paper presents a boundary-based, topological shape descriptor: the distance profile. It is inspired by the LBP (= local binary pattern) scale space – a topological shape descriptor computed by a filtration with concentric circles around a reference point. For rigid objects, the distance profile is computed by the Euclidean distance of each boundary pixel to a reference point. A geodesic di...

By propagating a vector for each pixel, we show that nearly Euclidean distance maps can be produced quickly by a region growing algorithm using hierarchical queues. Properties of the propagation scheme are used to detect potentially erroneous pixels and correct them by using larger neighbourhoods, without significantly affecting the computation time. Thus, Euclidean distance maps are produced i...