Separators are needed in microbial fuel cells (MFCs) to reduce electrode spacing and preventing electrode short circuiting. The use of nylon and glass fiber filter separators in single-chamber, aircathode MFCs was examined for their effect on performance. Larger pore nylon mesh were used that had regular mesh weaves with pores ranging from 10 to 160 mm, while smaller pore-size nylon filters (0....

This paper describes a novel algorithm for the unsupervised learning of word separators in raw text. The algorithm requires no language-specific knowledge regarding the text being processed. It relies solely on distributional properties of the text and uses the minimum description length (MDL) principle in order to partition characters into two subsets that correspond well with the traditional ...

Most state-of-the-art ordering schemes for sparse matrices are a hybrid of a bottom-up method such as minimum degree and a top down scheme such as George’s nested dissection. In this paper we present an ordering algorithm that achieves a tighter coupling of bottom-up and topdown methods. In our methodology vertex separators are interpreted as the boundaries of the last elements in a bottom-up o...

Fomin and Villanger ([14], STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most a constant t, can be solved in polynomial time on graph classes with polynomially many minimal separators. We extend these results in two directions. Let Gpoly be the class of graphs with at most poly(n) minimal...

Scattering of particlelike patterns in dissipative systems is studied, especially we focus on the issue how the input-output relation is controlled at a head-on collision in the one-dimensional(1D) space where traveling pulses interact strongly. It remains an open problem due to the large deformation of patterns at a colliding point. We found that a special type of steady or time-periodic solut...

Clique separators in graphs are a helpful tool used by Tarjan as a divideand-conquer approach for solving various graph problems such as the Maximum Weight Stable Set (MWS) Problem, Maximum Clique, Graph Coloring and Minimum Fill-in but few examples of graph classes having clique separators are known. We use this method to solve MWS in polynomial time for two classes where the unweighted Maximu...