Search Results for ""

While the above figure appears to be a sequence of nested squares, it actually consists of a single square spiral.

The space of continuously differentiable functions is denoted C^1, and corresponds to the k=1 case of a C-k function.

Contracting tensors lambda with nu in the Bianchi identities R_(lambdamunukappa;eta)+R_(lambdamuetanu;kappa)+R_(lambdamukappaeta;nu)=0 (1) gives ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...

A standard form of the linear programming problem of maximizing a linear function over a convex polyhedron is to maximize c·x subject to mx<=b and x>=0, where m is a given ...

Let f*g denote the cross-correlation of functions f(t) and g(t). Then f*g = int_(-infty)^inftyf^_(tau)g(t+tau)dtau (1) = ...

A fractal curve of infinite length which bounds an area twice that of the original square.