Nowadays, trash has become a problem in the society and the ecosystem due to the way people get rid of it. Most of garbage is buried or burnt or even kept in places to which it does not belong. Big volumes of garbage thrown away and the methods used to store it cause air, water, and soil pollution. Fortunately, people can count on other methods to reduce the quantity of produced litter. An answ...

Solids removal across two settling devices, i.e., a swirl separator and a radial-flow settler, and across a microscreen drum filter was evaluated in a fully recirculating system containing a single 150 m ‘Cornell-type’ dual-drain tank during the production of food-size Arctic char and rainbow trout. The flow through the culture tank was 4500–4800 L/min. Approximately 92–93% of the system flow e...

Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere separators of size s(n) = O(n d−1 d ) for a set of points in R. We present dynamic algorithms which maintain separators for a dynamically changing graph. Our algorithms answer queries and process insertions and deletion...

| We nd a large number of \geometric separator theorems" such as: I: Given N disjoint iso-oriented squares in the plane, there exists a rectangle with 2N=3 squares inside, 2N=3 squares outside, and (4 + o(1)) p N partly in & out. II: There exists a rectangle that is crossed by the minimal spanning tree of N sites in the plane at (4 3 1=4 + o(1)) p N points, having 2N=3 sites inside and outside....

this article studied static deflection, natural frequency and nonlinear vibration of a clamped-clamped microbeam under discontinues electrostatic actuation. the electrostatic actuation was induced by applying ac-dc voltage between the microbeam and electrode plate. in contrast to previous works, it was assumed that length of the electrode plate was smaller than that of the microbeam. in additio...

Given a graph G = (V,E) and an integer k ∈ N, we study k-Vertex Separator (resp. k-Edge Separator), where the goal is to remove the minimum number of vertices (resp. edges) such that each connected component in the resulting graph has at most k vertices. Our primary focus is on the case where k is either a constant or a slowly growing function of n (e.g. O(log n) or n). Our problems can be inte...

The equilibrium measure of a compact plane set gives the steady state distribution of charges on the conductor. We show that certain moments of this equilibrium measure, when taken about the electrostatic centroid and depending only on the real coordinate, are extremal for an interval centered at the origin. This has consequences for means of zeros of polynomials, and for means of critical poin...

[1] Plasma, electric, and magnetic field data on the Polar spacecraft have been analyzed for the 29 May 1996 magnetopause traversal searching for evidence of in situ reconnection and traversal of the separator. In this paper we confine our analysis to model-free observations and intrasensor coherence of detection of the environs of the separator. (1) We illustrate the first documented penetrati...

We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at most k · ( 1 + log nk ) , thus refining the previously known bounds, as stated by Robertson and Seymour (1986) and by Bodlaender et al. (1995). Fu...