Definition 1.1. Given a (undirected) graph G = (V,E), the maximum cut δ(U) for U ⊆ V is the cut with maximal value |δ(U)|. The Maximum Cut Problem consists of finding a maximal cut. We let MaxCut(G) = max{|δ(U)| : U ⊆ V } be the value of the maximum cut in G, and MaxCut′ = MaxCut(G) |E| be the normalized version (note that both normalized and unnormalized maximum cut values are induced by the s...

where ri(s) is the d-dimensional position coordinate of a monomer point at a contour length s of chain i, each of length N , V is the base pairing interaction at the same contour length (“directed polymer” interaction), Hev is the mutual excluded volume (ev) interaction represented by the u0 > 0 term with δΛ(r) as the usual delta function with an ultraviolet cut-off Λ in the reciprocal space. T...

The order fill rate is less commonly used than the volume fill rate (most often just denoted fill rate) as a performance measure for inventory control systems. However, in settings where the focus is on filling customer orders rather than total quantities, the order fill rate should be the preferred measure. In this paper we consider a continuous review, base-stock policy, where all replenishme...

Variable fill fluid couplings are used in the speed control units. Also, variation in coupling oil volume is used in adapting one size of coupling to a wider range of power transmission applications. Available model for the partially filled fluid couplings, has a good performance for couplings with fixed amount of oil but their performance will be degraded if they are used for the variable fill...

AIM To review the dental literature in terms of efficacy of soft tissue augmentation procedures around dental implants and in partially edentulous sites. METHODS A Medline search was performed for human studies augmenting keratinized mucosa (KM) and soft tissue volume around implants and in partially edentulous areas. Due to heterogeneity in between the studies, no meta-analyses could be perf...

Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117 (1993) 113-125. The set S c V(U) is a cut-set of the vertex v of a graph 9 if v is not adjacent to any vertex in S and, for every maximal clique C of Q, ({v} u S) n C # 0. S is a cut-set of the element v of a partial order 9 if S is a cut-set of v in the comparability graph of 8. Given upper bounds...

Three bioretention field sites in North Carolina were examined for pollutant removal abilities and hydrologic performance. The cells varied by fill media type or drainage configuration. The field studies confirmed high annual total nitrogen mass removal rates at two conventionally drained bioretention cells 40% reduction each . Nitrate-nitrogen mass removal rates varied between 75 and 13%, and ...