For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator S is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal vertex separator of least cardinality. A clique is a set of mutually adjacent vertices. A 2-tree is a connected graph in which every maximal clique is of size...

This work combines experimental and modeling investigations to monitor the dynamics of creaming in oil-in-water emulsions. Turbidity Raman spectroscopy methods were compared for monitoring n-hexadecane droplets water. A model is developed based on convection-diffusion equation. The accounts full droplet size distribution. data used identify diffusion coefficient oil Richardson–Zaki correcting e...

Two challenges for improving the performance of air cathode, single-chamber microbial fuel cells (MFCs) include increasing Coulombic efficiency (CE) and decreasing internal resistance. Nonbiodegradable glass fiber separators between the two electrodes were shown to increase power and CE, compared to cloth separators (J-cloth) that were degraded over time. MFC tests were conducted using glass fi...

A model to account for observed solar flare statistics in terms of a superposition of independent random flaring elements (assumed to be sites of magnetic reconnection in the coronal magnetic field and hence termed ‘‘ separators ’’) is described. A separator of length l is assumed to flare as a Poisson process in time, with a rate ðlÞ inversely proportional to the Alfvén transit time for the st...

In pipeline-riser systems, pressure fluctuations which result from the formation of large liquid slugs and gas surges due to operational changes or low mass flow rate from production wells and the profile of pipeline-riser systems often lead to trips at the inlet of the separator; and thereby, the problem causes a a loss of the production.In this study, on a sample deep-water oil field off the ...

We introduce the notion of the width bounded geometric separator and develop the techniques for the existence of the width bounded separator in any fixed ddimensional Euclidean space. The separator is applied in obtaining 2O( √ n) time exact algorithms for a class of NP-complete geometric problems, whose previous algorithms take nO( √ n) time . One of those problems is the well known disk cover...

We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O(N/ √ r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O( √ r) can be computed in O(sort(N)) I/Os. This bound holds provided that M ≥ 56r log B. Together...