TOPICS
Search

Search Results for ""


591 - 600 of 1136 for turbulence image gallerySearch Results
A cross-handle is a topological structure which can be thought of as the object produced by puncturing a surface twice, attaching a zip around each puncture travelling in the ...
Ueberhuber (1997, p. 71) and Krommer and Ueberhuber (1998, pp. 49 and 155-165) use the word "quadrature" to mean numerical computation of a univariate integral, and ...
The point on the positive ray of the normal vector at a distance rho(s), where rho is the radius of curvature. It is given by z = x+rhoN (1) = x+rho^2(dT)/(ds), (2) where N ...
The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...
Amazingly, the catacaustic of the deltoid when the rays are parallel in any direction is an astroid. In particular, for a deltoid with parametric equations x = 2cost+cos(2t) ...
A Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.
A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...
The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...
A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...
A n-dipyramidal graph is the skeleton of an n-sided dipyramid. It is isomorphic to the (m,2)-cone graph C_m+K^__2, where C_m is a cycle graph, K^__2 is the empty graph on 2 ...
1 ... 57|58|59|60|61|62|63 ... 114 Previous Next

...