نتایج جستجو برای: sweeping flow
تعداد نتایج: 485294 فیلتر نتایج به سال:
A microfluidic manifold has been designed, fabricated, and tested which hydrodynamically focuses a sample into the center of a microchannel and provides control over the vertical position of the focused sample via the flow-rates of the focusing fluids [1]. To characterize the focusing action, a mixing experiment was performed in which the sample fluid and focusing fluid contained spectrally uni...
Experimental results are described to evaluate the diffuse pollution profile according to land use in the catchments and street sweeping as a best management practice (BMP). We studied the variation of pollutant concentrations in outfalls discharging runoff from residential, commercial and high-traffic areas and in street sweeping. Pollution profiles varied with the land use in the catchments a...
In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics...
Mark and sweep garbage collectors are known for using time proportional to the heap size when sweeping memory, since all objects in the heap, regardless of whether they are live or not, must be visited in order to reclaim the memory occupied by dead objects. This paper introduces a sweeping method which traverses only the live objects, so that sweeping can be done in time dependent only on the ...
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...
Episodic control has been proposed as a third approach to reinforcement learning, besides model-free and model-based control, by analogy with the three types of human memory. i.e. episodic, procedural and semantic memory. But the theoretical properties of episodic control are not well investigated. Here I show that in deterministic tree Markov decision processes, episodic control is equivalent ...
We report unconventional flow visualization coupled with two-dimensional numerical modeling in the Heliotron solar reactor used for nanomaterial synthesis. The effect of operating conditions, such as gas ejection velocity and configurations sweeping on particle transport were investigated order to map different regimes experienced during ablation. experimentally observed phenomena satisfactoril...
The skyline problem can be easily solved in linear I/Os in 2D space, after sorting the points of P by x-coordinate (think: how). We will show that the 3D version of the problem can also be settled in O(NB logM/B N B ) I/Os. Our description below follows that of [3]. Algorithm. Our algorithm accepts as input a dataset P whose points are sorted by x-coordinate. If N ≤ M (i.e., the memory capacity...
We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series of algorithms for specific problems the feasibility of the method in a cache oblivious setting. The problems al...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید