Nowadays, the increasing demand for energy in the world is one of the main concerns for energy supply. In fact, the required energy can be obtained by increasing the production rate of fossil fuels such as oil and natural gas. However, improving the efficiency of the equipment and facilities might have a significant impact on production from hydrocarbon resources. With respect to this subject, ...

We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to different classes of separators and various extent measures. This class of geometric problems generalizes two widely studied problem families, namely separability and the computation of statistical estimators.

Electrospun nanofiber membranes have been extensively studied as separators in Li-ion batteries due to their large porosity, unique pore structure, and high electrolyte uptake. However, the electrospinning process has some serious drawbacks, such as low spinning rate and high production cost. The centrifugal spinning technique can be used as a fast, cost-effective and safe technique to fabricat...

[1] A new, efficient, and highly accurate method for tracing magnetic separators in global magnetospheric simulations with arbitrary clock angle is presented. The technique is to begin at a magnetic null and iteratively march along the separator by finding where four magnetic topologies meet on a spherical surface. The technique is verified using exact solutions for separators resulting from an...

In present study, a three-step multi-objective optimization algorithm of cyclone separators is catered for the design objectives. First, the pressure drop (Dp) and collection efficiency (h) in a set of cyclone separators are numerically evaluated. Secondly, two meta models based on the evolved Group Method of Data Handling (GMDH) type neural networks are regarded to model the Dp and h as the re...

In this paper we present the Spike algorithm of Sameh and Polizzi in the context of domain decomposition methods. We present several variants that differ in their treatment of the separators, showing that one of these is equivalent to the Spike algorithm. Eijkhout and van de Geijn Spike factorizations Figure 1: A one-dimensionally partitioned domain with 4 subdomains and 3 separators

We introduce novel approaches of graph decomposition based on optimal separators and atoms generated by minimal clique separators. The decomposition process is applied to co-word graphs extracted from Web Of Science database. Two types of graphs are considered: co-keyword graphs based on the human indexation of abstracts and terminology graphs based on semi-automatic term extraction from abstra...

We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.

We present a new algorithm to compute small node separators on large, undirected graphs ensuring a user defined balance on the induced connected components. Our algorithm uses edge separators computed by the open source graph partitioning package KaHIP [42] and a new technique to transform them into node separators. Given an undirected graph G, our algorithm constructs a flow problem on a subgr...