Search Results for ""

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...

det(i+j+mu; 2i-j)_(i,j=0)^(n-1)=2^(-n)product_(k=0)^(n-1)Delta_(2k)(2mu), where mu is an indeterminate, Delta_0(mu)=2, ...

The Mills ratio is defined as m(x) = 1/(h(x)) (1) = (S(x))/(P(x)) (2) = (1-D(x))/(P(x)), (3) where h(x) is the hazard function, S(x) is the survival function, P(x) is the ...

Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...

A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A Banach space X is called minimal if every infinite-dimensional subspace Y of X contains a subspace Z isomorphic to X. An example of a minimal Banach space is the Banach ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...