Search Results for ""

Let u^_ denote the mean of a set of quantities u_i, then the relative deviation is defined by (Deltau_i)/(u^_)=(|u_i-u^_|)/(u^_).

Let the true value of a quantity be x and the measured or inferred value x_0. Then the relative error is defined by deltax=(Deltax)/x=(x_0-x)/x=(x_0)/x-1, where Deltax is the ...

A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...

An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...

Given a sequence of values {a_k}_(k=1)^n, the running maxima are the sequence of values {max(a_1,...,a_k)}_(k=1)^n. So, for example, given a sequence (3,5,7,8,8,5,7,9,2,5), ...