In this paper, we investigate rotating electro-osmotic (EO) flow over an infinite plate or in a channel formed by two parallel plates. The analysis is based on the Debye-Hückel approximation for charge distributions and the Navier-Stokes equation for a transport electrolyte in the rotating frame. It is shown that, for the single plate, the nondimensional speed of system rotation ω is the singly...

Laboratory soil column experiments were conducted to study the distribution of preferential flow paths resulting from removal of fine-size clay particles. These experiments specifically studied the influence of clay (kaolinite) percentage in sand-clay mixtures and the effect of hydraulic gradients on pore evolution. Analysis of the effluent during the experiments indicated that clay particles w...

Three-dimensional hydrostratigraphic models created using multiple-point geostatistics promise to help quantify the role of preferential flow paths in a h eterogeneous glacially-deposited aquitard. The preferential flow paths allow for faster transport of fluids and solutes than in the surrounding matrix. Transport in preferential flow paths is governed by the hydraulic properties within the fl...

As an alternative but unified and more fundamental description for quantum physics, Feynman path integrals generalize the classical action principle to a probabilistic perspective, under which physical observables' estimation translates into weighted sum over all possible paths. The underlying difficulty is tackle whole manifold from finite samples that can effectively represent propagator dict...

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow requires two interdepending decisions. One has to decide ...

(b) In the relaxation we can get many fractional paths between each demand pair of total unit value. These paths can be read out of the solution in polynomial time in the following way. We find an edge e of the smallest positive flow value c, and subtract flow of this value from a cycle or a path going through e over edges of positive flow value. Repeating this procedure we will decompose the f...