1.1 Max-flow min-cut A flow network is a directed graph D = (V,E) with two distinguished vertices s and t called the source and the sink, respectively. Moreover, each arc (u, v) ∈ E has a certain capacity c(u, v) ≥ 0 assigned to it. Let X be a proper non-empty subset of V . Let X̄ := V −X , then the pair (X, X̄) forms a partition of V , called a cut of D. The set of arcs of D going from X to X̄ is...

OBJECTIVES To determine the feasibility and impact of a computer-generated rounding report on physician rounding time and perceived barriers to providing clinical care in the nursing home (NH) setting. SETTING Three NHs located in Pittsburgh, PA. PARTICIPANTS Ten attending NH physicians. MEASUREMENTS Time-motion method to record the time taken to gather data (pre-rounding), to evaluate pa...

PURPOSE To present a position statement from the Hematology/Oncology Pharmacy Association (HOPA) that pertains to dose rounding of biologic and cytotoxic anticancer agents. METHODS The HOPA Standards Committee organized a work group of oncology pharmacist specialists to examine the safety and value of dose rounding of biologic and cytotoxic anticancer agents. Primary literature that describes...

We develop a new dependent randomized rounding method for approximation of a number of optimization problems with integral assignment constraints. The core of the method is a simple, intuitive, and computationally efficient geometric rounding that simultaneously rounds multiple points in a multi-dimensional simplex to its vertices. Using this method we obtain in a systematic way known as well a...

Many general purpose processors (including Intel’s) may not always produce the correctly rounded result of a floating-point operation due to double rounding. Instead of rounding the value to the working precision, the value is first rounded in an intermediate extended precision and then rounded in the working precision; this often means a loss of accuracy. We suggest the use of rounding to odd ...

Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signiicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accura...

A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm is compared with the rounding algorithms of Yu and Zyner [23] and of Quach et al. [18]. For each rounding algorithm, a logical description and a block diagram is given and the latency is analyzed. We conclude that the n...