Search Results for ""

Flower graphs are a name given in this work to the generalization of the flower snarks J_n for positive n=5, 7, 9, ... to all integer n>=5. They are illustrated above for n=5 ...

The illusion that the two ends of a straight line segment passing behind an obscuring rectangle are offset when, in fact, they are aligned. The Poggendorff illusion was ...

A plane image or pair of two-dimensional images that, when appropriately viewed using both eyes, produces an image which appears to be three-dimensional. By taking a pair of ...

A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

Continuum percolation can be thought of as a continuous, uncountable version of percolation theory-a theory which, in its most studied form, takes place on a discrete, ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...

A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...