نتایج جستجو برای: separators

تعداد نتایج: 2888  

Journal: :Bioresource technology 2011
Xiaoyuan Zhang Shaoan Cheng Peng Liang Xia Huang Bruce E Logan

The combined use of brush anodes and glass fiber (GF1) separators, and plastic mesh supporters were used here for the first time to create a scalable microbial fuel cell architecture. Separators prevented short circuiting of closely-spaced electrodes, and cathode supporters were used to avoid water gaps between the separator and cathode that can reduce power production. The maximum power densit...

2005
Shuo Wang Dushan Boroyevich Douglas K. Lindner Douglas J. Nelson

Five chapters of this dissertation concentrate on the characterization and cancellation of high frequency parasitic parameters in EMI filters. One chapter addresses the interaction between the power interconnects and the parasitic parameters in EMI filters. The last chapter addresses the characterization, evaluation and design of noise separators. Both theoretical and experimental analyses are ...

2016
Yu-Xiong Wang Martial Hebert

This work explores CNNs for the recognition of novel categories from few examples. Inspired by the transferability analysis of CNNs, we introduce an additional unsupervised meta-training stage that exposes multiple top layer units to a large amount of unlabeled real-world images. By encouraging these units to learn diverse sets of low-density separators across the unlabeled data, we capture a m...

2016
Yu-Xiong Wang Martial Hebert

This work explores CNNs for the recognition of novel categories from few examples. Inspired by the transferability properties of CNNs, we introduce an additional unsupervised meta-training stage that exposes multiple top layer units to a large amount of unlabeled real-world images. By encouraging these units to learn diverse sets of low-density separators across the unlabeled data, we capture a...

Journal: :Computers & Chemical Engineering 2009
István Heckl Ferenc Friedler L. T. Fan

Among separation systems, the ones comprising separators effected by different separationmethods have been steadily gaining attention lately. Our earlier work has revealed that it is exceedingly complicated to optimally synthesize via super-structure any of these separation networks featuring simple and sharp separators, multiple feed and product streams, and mixed products. This complication c...

2009
R. ARCHIBALD C. MACK

Use of angle iron separators in two evaporator vessels at Darnall resulted in a marked reduction in entrainment rates. Efficiencies in excess of 90% were observed with negligible pressure differential across the separator. Separator efficiency can be evaluated rapidly by using a centrally based Auto-Analyser. Introduction To avoid sugar losses by entrainment, all evaporator vessels are fitted w...

2003
A. Berry

A. Berry Abstra t: Many problems related to knowledge dis overy an be modelized by an undire ted graph, whi h in turn has a strong stru ture asso iated with its minimal separators. On several well-known graph lasses whi h are used in appli ations, the graph extremities and the related elimination orderings are an eÆ ient algorithmi tool. Often, these extremities turn out to be related to the mi...

Journal: :In silico biology 2007
Bangaly Kaba Nicolas Pinet Gaëlle Lelandais Alain Sigayret Anne Berry

Recent work has used graphs to modelize expression data from microarray experiments, in view of partitioning the genes into clusters. In this paper, we introduce the use of a decomposition by clique separators. Our aim is to improve the classical clustering methods in two ways: first we want to allow an overlap between clusters, as this seems biologically sound, and second we want to be guided ...

Journal: :Discrete Applied Mathematics 2016
Jorge L. Ramírez Alfonsín Serge Tishchenko

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...

2001
Rahul Santhanam

We give the first extension of the result due to Paul, Pippenger, Szemeredi and Trotter [24] that deterministic linear time is distinct from nondeterministic linear time. We show that NTIME(n √ log∗(n)) 6= DTIME(n √ log∗(n)). We show that if the class of multi-pushdown graphs has (o(n), o(n/log(n))) segregators, then NTIME(nlog(n)) 6= DTIME(nlog(n)). We also show that atleast one of the followi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید