Fill algorithms are a common graphics utility used to change the colour of regions in the frame bufCer. The propagation algorithm is a key component oC Cilling algorithms. The problem oC propagation within a Cill algorithm is presented and defined, and the diCficulties oC Cormalization and comparison are discussed. The previous algorithms are presented and analyzed under a new comparison metric...

The influence of water filling on the photoluminescence (PL) properties of SWCNTs is studied by ensemble and single-molecule PL spectroscopy. Red-shifted PL and PL excitation spectra are observed upon water filling for 16 chiralities and can be used to unambiguously distinguish empty SWCNTs from filled ones. The effect of water filling on the optical transitions is well-reproduced by a continuu...

dynamic economic load dispatch is one of the most important roles of power generation’s operation and control. it determines the optimal controls of production of generator units with predicted load demand over a certain period of time. economic dispatch at minimum production cost is one of the most important subjects in the power network’s operation, which is a complicated nonlinear constraine...

Simulations of solvated macromolecules often use periodic lattices to account for long-range electrostatics and to approximate the surface effects of bulk solvent. The large percentage of solvent molecules in such models (compared to macromolecular atoms) makes these procedures computationally expensive. The cost can be reduced by using periodic cells containing an optimized number of solvent m...

We describe a microfabricated Fabry-Pérot interferometer with nanochannels of various heights between 6 and 20 nm embedded in its cavity. By multiple beam interferometry, the device enables the study of liquid behavior in the nanochannels without using fluorescent substances. During filling studies of ethanol and water, an intriguing filling mode for partially wetting water was observed, tentat...

We consider the problem of scheduling resource allocation where a change in allocation results in a changeover penalty of one time slot. We assume that we are sending packets over a wireless channel of uncertain and varying capacity. In each time slot, a bandwidth of at most the current capacity can be allocated, but changing the capacity has a cost, which is modeled as an empty time slot. Only...

Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the process of surface reconstruction . Our method can be applied to holes with non-planar geometry as w...

In this paper, we propose a computationally efficient algorithm for transmit power and bit allocations in wireless OFDM systems aiming at maximization of data rate under the constraint of total transmit power and bit error rate. Although the proposed algorithm is based on the water-filling approach, the computational complexity is only ) ( M k O × , where k denotes the number of iterations requ...

We consider a wireless system with multiple userbase pairs randomly distributed in some region, in which users try to greedily optimize their performance without any exchange of information between bases, and for which a fixed point is reached. This is a Nash equilibrium point for the system and corresponds to a simultaneous water filling solution. In this paper we focus on systems with strong ...