Search Results for ""

An asymmetrical apodization function defined by M(x,b,d)={0 for x<-b; (x-b)/(2b) for -b<x<b; 1 for b<x<b+2d; 0 for x<b+2d, (1) where the two-sided portion is 2b long (total) ...

If proofreader A finds a mistakes and proofreader B finds b mistakes, c of which were also found by A, how many mistakes were missed by both A and B? Assume there are a total ...

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...

The intersection of two sets A and B is the set of elements common to A and B. This is written A intersection B, and is pronounced "A intersection B" or "A cap B." The ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...

An outer-totalistic cellular automaton is a generalization of the totalistic cellular automaton. Totalistic rules are a proper superset of outer-totalistic rules. In ...

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...