Search Results for ""
10981 - 10990 of 13134 for catastrophe theorySearch Results

The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
By analogy with the squircle, a term first apparently used by Fernández Guasti et al. (2005), the term "rectellipse" (used here for the first time) is a natural ...
The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...
An auxiliary latitude which gives a sphere having correct distances along the meridians. It is denoted mu (or omega) and is given by mu=(piM)/(2M_p). (1) M_p is evaluated for ...
A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...
Let a sequence be defined by A_(-1) = s (1) A_0 = 3 (2) A_1 = r (3) A_n = rA_(n-1)-sA_(n-2)+A_(n-3). (4) Also define the associated polynomial f(x)=x^3-rx^2+sx+1, (5) and let ...
A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...
A method of proof which proceeds by stating a proposition and then showing that it results in a contradiction, thus demonstrating the proposition to be false. In the words of ...
A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...
A system in which words (expressions) of a formal language can be transformed according to a finite set of rewrite rules is called a reduction system. While reduction systems ...

...