This paper tends to investigate the performance of a separator cyclone used in cement industries in Iran. This investigation was performed using CFD modeling, which is validated by other valid studies. Separator cyclone performance includes of two important parameters as pressure drop and collection ratio. In this presented study, the pressure drop has been considered to assess the performance ...

Let w = w(x1, ..., xd) denote a group word in d variables, that is, an element of the free group of rank d. For a finite group G we may define a word map that sends a d-tuple, (g1, ..., gd) of elements of G, to its w-value, w(g1, ..., gd), by substituting variables and evaluating the word in G by performing all relevant group operations. In this thesis we study a number of problems to do with t...

For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a special, explicitly described form.

A dispersed-ozone flotation (DOF) separator was devised for a pilot study of tertiary wastewater treatment for re-use purposes. As a compact device combining coagulation, ozonation and flotation in an integrated unit, the DOF separator achieved a very high removal of SS, TOC, UV254 and colour, as well as effective inactivation of coliform and total bacteria within a short hydraulic retention ti...

Microbial fuel cells (MFCs) with hydrophilic poly(vinyl alcohol) (PVA) separators showed higher Coulombic efficiencies (94%) and power densities (1220 mW m(-2)) than cells with porous glass fiber separators or reactors without a separator after 32 days of operation. These remarkable increases in both the coublomic efficiency and the power production of the microbial fuel cells were made possibl...

One wishes to remove k − 1 edges of a vertex-weighted tree T such that the weights of the k induced connected components are approximately the same. How well can one do it ? In this paper, we investigate such k-separator for quasi-binary trees. We show that, under certain conditions on the total weight of the tree, a particular k-separator can be constructed such that the smallest (respectively...

A famous result of Graham and Pollak states that the complete graph with n vertices can be edge partitioned into n − 1, but no fewer, complete bipartite graphs. This result has led to the study of the relationship between the chromatic and biclique partition numbers of graphs. It has become even more exciting with recent connections to the clique versus stable set problem, communication protoco...

We answer a question raised by Walter Morris, and independently by Alon Efrat, about the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes. We approach this problem by establishing the equivalence with the problem of the maximum monotone path in an arrangement of n lines. A related problem on convex pseudo-discs is also discu...

In this paper we introduce a new notion by the help of idealizer. This is separator subset semigroup. We investigate properties in an arbitrary semigroup and characterize unitary subsemigroups prime ideals their separator. The last section treats free subsemigroup

I present an efficient algorithm which lists the minimal separators of a planar graph in O(n) per separator.