Introduction to Voigt's wind power plant

The design and operation of a 100 kilowatt wind driven generator are reported. Its high speed three-bladed turbine operates at a height of 50 meters. Blades are rigidly connected to the hub and turbine revolutions change linearly with wind velocity, maintaining a constant speed ratio of blade tip velocity to wind velocity over the full predetermined wind range. Three generators installed in the gondola generate either dc or ac current. Based on local wind conditions, the device has a maximum output of 720 kilowatts at a wind velocity of 16 meters per second. Total electrical capacity is 750 kilowatts, and power output per year is 2,135,000 kilowatt/hours

Context-guided Diffusion for Label Propagation on Graphs

Existing approaches for diffusion on graphs, e.g., for label propagation, are mainly focused on isotropic diffusion, which is induced by the commonly-used graph Laplacian regularizer. Inspired by the success of diffusivity tensors for anisotropic diffusion in image processing, we presents anisotropic diffusion on graphs and the corresponding label propagation algorithm. We develop positive definite diffusivity operators on the vector bundles of Riemannian manifolds, and discretize them to diffusivity operators on graphs. This enables us to easily define new robust diffusivity operators which significantly improve semi-supervised learning performance over existing diffusion algorithms

Absence of high-level vancomycin resistance in enterococci isolated from meat-processing facilities.

Enterococci isolated from packaging areas of meat-processing facilities that produce ready-to-eat meat products were examined for high-level vancomycin resistance. A total of 406 enterococci isolates from the plants' packaging areas were examined for vancomycin resistance. High-level vancomycin resistance was not demonstrated in any enterococci isolated from 12 meat-processing plants

How Not to Be Seen -- Inpainting Dynamic Objects in Crowded Scenes

Removing dynamic objects from videos is an extremely challenging problem that even visual effects professionals often solve with time-consuming manual frame-by-frame editing. We propose a new approach to video completion that can deal with complex scenes containing dynamic background and non-periodical moving objects. We build upon the idea that the spatio-temporal hole left by a removed object can be filled with data available on other regions of the video where the occluded objects were visible. Video completion is performed by solving a large combinatorial problem that searches for an optimal pattern of pixel offsets from occluded to unoccluded regions. Our contribution includes an energy functional that generalizes well over different scenes with stable parameters, and that has the desirable convergence properties for a graph-cut-based optimization. We provide an interface to guide the completion process that both reduces computation time and allows for efficient correction of small errors in the result. We demonstrate that our approach can effectively complete complex, high-resolution occlusions that are greater in difficulty than what existing methods have shown