A finite automaton .d with a distance function d is a sextuple, (C, Q, M, S, F, d), such that C is the input alphabet, Q is the finite set of states, M: Q x C -+ 2Q is the transition function, S c Q and F c Q are the sets of initial and final states, respectively, d: Q x C x Q -+ (0, 1, co } is the distance function, where co denotes infinity, and d satisfies the following: for any (q,a,q’)E Q ...

In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q. We recall the algorithm to evaluate this distance and we give some formulae for the maximum distance value between two partitions having exactly or at mos...

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...

1 Distance Fields Given an implicit surface ∂S with S ⊆ R the corresponding distance field (also called signed distance function) D : R → R which maps a point p from the domain of the distance field R to a real-valued distance value is obtained by distance transforming the surface using the formula D(p) = sign(p) ·min{d(p, q) : q ∈ S} (1) The metric d(p, q) used is the standard Euclidean metric...

abstract   background: the purpose of this study was to evaluate the significance of the q angle with respect to the patella position. we assess the correlation between the q angles (calculated by clinical exam) in different positions and ct indices (with more impression on tttg).   method: atotal number of 68 knee joints of 50 cases entered the study. clinical examination was used to measure q...

distances Different distances between two given vectors Description These functions are used for calculating different distances between two given vectors. Thus, L1.dist calculates the L1 distance, cosin.dist calculates the cosine distance, euclidian.dist computes the Euclidian distance, and rank.cor.dist computes the rank correlation distance. The vectors have to have same length. When using r...

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance dw(p, q) between two points p, q ∈ S is defined as w(p) + d(p, q) + w(q) if p 6= q and it is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance between p and q. A graph G(S,E) is called a t-spanner for the additive weighted set S of points if fo...