● view-driven mesh refinement / level-of-detail scheme with geomorphing ● ‘ambient’ (procedural) waves with dispersion property ● ‘interactive’ waves with dispersion property (which we believe is a technological first for games) ● real-time procedural normal maps, with distance-based cross-over into geometry ● optical effects including Fresnel reflectance, cloudy water, and refraction ● special...

Insecure land tenure and property rights for women are both contributing to the spread of HIV and weakening their ability to cope with the consequences of AIDS. These links are particularly acute in subSaharan Africa, and are leading to decreased agricultural production, food insecurity, rural outmigration, and additional infection. Strengthening women’s property and inheritance rights (WPIRs) ...

We review results which have been obtained in the last few years on the topic whether various measures of physical interest, deened on lattice systems, have the Gibbs property or not. Most of the measures we consider occur either within renormalization-group theory or within models of non-equilibrium statistical mechanics. In renormalization-group theory examples we discuss in particular the un...

Painlevé and his school [1 – 3] studied the certain class of second order ordinary differential equations (ODEs) and found fifty canonical equations whose solutions have no movable critical points. This property is known as the Painlevé property. Distinguished among these fifty equations are six Painlevé equations, PI – PVI. The six Painlevé transcendents are regarded as nonlinear special funct...

The Benjamini–Hochberg step-up procedure controls the false discovery rate (FDR) provided the test statistics have a certain positive regression dependency. We show that this procedure controls the FDR under a weaker property and is optimal in the sense that its critical constants are uniformly greater than those of any step-up procedure with the FDR controlling property. c © 2008 Elsevier B.V....

We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation ...

We present an approach for the verification aggregation protocols, which may be used to perform critical tasks and thus should be verified. We formalize the class of track topology aggregation protocols and provide a parameterized proof of correctness where the problem is reduced to checking a property of the node’s aggregation algorithm. We provide a verification rule based on our property and...

We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z 2 by removing all horizontal edges off the x-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation ...