Peer-to-peer networking is a hot buzzword that has been sweeping through the computing industry over the past year or so. Gnutella, as one of the first operational pure P2P systems, is considered as an important case study for P2P networking. By analyzing the Gnutella network topology data, we can discover both the small diameter and the clustering properties characteristic of "small-world" net...

While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new algorithm for embedding a global ambient occlusion computation within the fast sweeping algorithm while determining isosurfaces. With this method we can approximate ambient occlusion for rendering volumetric data with mi...

We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...

A sweep net with a flexible plastic frame was compared to a dipper for sampling efficacy for Aedes aegypti larvae in different-sized tires. When known numbers of mosquito larvae were introduced into tires, from 2 to 6.8 times more larvae were recovered by sweeping than by dipping. Sediment in the tires significantly reduced the recovery of larvae by both methods. Sampling efficacy was affected ...

BACKGROUND Despite the widely accepted use of membrane sweeping to prevent postmaturity pregnancies, the optimal frequency for this procedure has not been established. AIM To determine if the frequency of membrane sweeping in women with an unfavorable cervix at term results in fewer labor inductions. METHODS This was a randomized trial of women with an unfavorable cervix (Bishop's score of ...

A sweeping automaton is a two-way deterministic finite automaton which makes turns only at the endmarkers. Sipser [12] has proved that one-way nondeterministic finite automata can be exponentially more succinct in sizes than sweeping automata. In this paper, we propose a technique based on the work in [6] for establishing lower bounds on the size of sweeping automata. We show that Sipser’s tech...

An algorithm for an extended reactive dynamic user equilibriummodel of pedestrian counterflow as a continuum is developed. It is based on a cell-centered high-resolution finite volume scheme with a fast sweeping method for an Eikonal-type equation on an orthogonal grid. A high-order total variation diminishing Runge–Kutta method is adopted for the time integration of semi-discrete equations. Th...

The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have been studied so far, including integer li...