Multilayering microelectrode techniques have been developed to construct large-area travelling-wave dielectrophoresis (TWD) separators. Novel electrode designs have enabled arrays with up to 25 000 electrodes to be constructed. The separation capacity of a 1000 electrode (20 mm) array has been demonstrated by separating components of whole blood. The development of sophisticated bio-particle se...

This papers shows that using separators, which is a pair of two complementary contractors, we can easily and efficiently solve the localization problem of a robot with sonar measurements in an unstructured environment. We introduce separators associated with the Minkowski sum and the Minkowski difference in order to facilitate the resolution. A test-case is given in order to illustrate the prin...

Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in...

Atmospheric pressure non equilibrium plasma treatments have been implemented to produce solvent-free Poly-L-lactic acid (PLLA) scaffolds, to improve biocompatibility of PLLA mats and to increase electrolyte uptake of Poly(vinylidene fluoride) (PVDF) separators for lithium batteries. It has been observed that plasma treatments are a suitable way to improve polymeric solution electrospinnability,...

The paper presents an entropy-based approach to segment a corpus into words, when no additional information about the corpus or the language, and no other resources such as a lexicon or grammar are available. To segment the corpus, the algorithm searches for separators, without knowing a priory by which symbols they are constituted. Good results can be obtained with corpora containing "clearly ...

Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by minimal separators always inducing complete subgraphs). A new characterization of unichord-free graphs corresponds to a suitable reformulation of...