Matching 2-lattice polyhedra are a special class of lattice polyhedra that include network 3ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, etc. In this paper we develop a polynomial-time extreme point algorithm for #nding a maximum cardinality vector in a matching 2-lattice polyhedron. c © 2001 Elsevier Science B.V. All rights reserved.

This work studies the structure of origami bases via graph drawings of origami polyhedra. In particular, we propose a new class of polyhedra, called extreme-base polyhedra, that capture the essence of \extreme" origami bases. We develop a linear-time algorithm to nd the \natural" straight-line planar drawing of these polyhedra. This algorithm demonstrates a recursive structure in the polyhedra ...

Single Point Mooring (SPM) is a type of offshore facility that is used for the loading and unloading of oil and gas tankers in the sea. In Iran, it is briefly called “floating buoy”. The present study discussed floating type, fixed to the seabed with mooring chain. The mooring chain of SPM, which is considered one of the important parameters of its design, will be evaluated with reg...

Let E be a compact set in C with connected complement and positive logarithmic capacity. For any f continuous on E and analytic in the interior of E, we consider the distribution of extreme points of the error of best uniform polynomial approximation on E. Let Λ = (nj) be a subsequence of N such that nj+1/nj → 1. If, for n ∈ Λ, An(f) ⊆ ∂E denotes the set of extreme points of the error function,...

MDM2 (HDM2) is a ubiquitin ligase that can target the p53 tumor suppressor protein for degradation. The RING domain is essential for the E3 activity of MDM2, and we show here that the extreme C-terminal tail of MDM2 is also critical for efficient E3 activity. Loss of E3 function in MDM2 mutants deleted of the C-terminal tail correlated with a failure of these mutants to oligomerize with MDM2, o...

Let H1,H2 be finite dimensional complex Hilbert spaces describing the states of two finite level quantum systems. Suppose ρi is a state in Hi, i = 1, 2. Let C(ρ1, ρ2) be the convex set of all states ρ inH = H1⊗H2 whose marginal states inH1 andH2 are ρ1 and ρ2 respectively. Here we present a necessary and sufficient criterion for a ρ in C(ρ1, ρ2) to be an extreme point. Such a condition implies,...

We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assigned to an extreme point is therefore assigned to this extreme point in all solutions. We show how linear relaxations and the interior point method can be combined to prune variable domains. We also describe a class o...