‎In this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of Villarreal on bipartite graphs‎. ‎For bipartite graphs two‎ ‎different characterizations were given by Ravindra and Villarreal‎. ‎We show that these two characterizations imply each other‎.

Six laboratory scale biogas mixed anaerobic digesters were operated to study the effect of biogas recycling rates and draft tube height on their performance. The digesters produced methane at 0.40-0.45 L per liter of digester volume per day. A higher methane production rate was observed in unmixed digesters, while increased biogas circulation rate reduced methane production. However, different ...

A randomized, double-blind, placebo-controlled clinical trial was conducted in Nairobi, Kenya, to compare single-dose ciprofloxacin with a 7-day course of erythromycin for the treatment of chancroid. In all, 208 men and 37 women presenting with genital ulcers clinically compatible with chancroid were enrolled. Ulcer etiology was determined using culture techniques for chancroid, serology for sy...

In this paper, an algebraic theory for local rings of finite embedding dimension is developed. Several extensions of (Krull) dimension are proposed, which are then used to generalize singularity notions from commutative algebra. Finally, variants of the homological theorems are shown to hold in equal characteristic. This theory is then applied to Noetherian local rings in order to get: (i) over...

The ”class discovery” problem is the problem of learning a classifier from a mixture of unlabeled and labeled training data, under the constraint that labeled training data exist for only N-1 of the N target classes. The task of distinguishing human from animal footsteps can be framed as a class discovery problem. When humans travel alone, every footstep sound is caused by a human foot, therefo...

Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose Newton polytopes are scaled copies of one polytope, thus taking a step towards systems with arbitrary supports. First, we specify matrices whose determinant equa...

If C is a clutter with n vertices and q edges whose clutter matrix has column vectorsA = {v1, . . . , vq}, we call C an Ehrhart clutter if {(v1, 1), . . . , (vq, 1)} ⊂ {0, 1} n+1 is a Hilbert basis. Letting A(P ) be the Ehrhart ring of P = conv(A), we are able to show that if C is a uniform unmixed MFMC clutter, then C is an Ehrhart clutter and in this case we provide sharp upper bounds on the ...