Intersection cuts are a family of cutting planes for pure and mixedinteger linear programs, developed in the 1970s. Most papers on them consider only cuts that come from so-called maximal lattice-point-free polyhedra. We define a completely different family of intersection cuts, called “natural”. Their key property is that they can be generated very quickly and easily from a simplex tableau. In...

Intersection cuts are generated from a polyhedral cone and a convex set S whose interior contains no feasible integer point. We generalize these cuts by replacing the cone with a more general polyhedron C. The resulting generalized intersection cuts dominate the original ones. This leads to a new cutting plane paradigm under which one generates and stores the intersection points of the extreme ...

This paper presents a novel graph-cuts algorithm that can take into account a multiple-shape constraint and reports a lung segmentation process from a three-dimensional computed tomography (CT) image, based on the graph-cuts algorithm. A major contribution of this paper is the proposal of a segmentation algorithm that can consider multiple shapes in a graph-cuts framework. Using experiments, we...

two main forms of copd (chronic obstructive pulmonary disease) refer to a group of lung diseases that block airflow and cause a huge degree of human suffering. a new method for identifying and estimating the severity of copd from three-dimensional (3-d) pulmonary x-ray ct images would be helpful for evaluation of treatment effects and early diagnosing is presented in this paper. this method has...

Let X be a set of vectors in R m. X is said to be a Hilbert base if every vector in R m which can be written both as a linear combination of members of X with nonnegative coeecients and as a linear combination with integer coeecients can also be written as a linear combination with nonnegative integer coeecients. Denote by H the collection of the graphs whose family of cuts is a Hilbert base. I...

We show that theMinimal Length-Bounded L-But problem can be computed in linear time with respect to L and the tree-width of the input graph as parameters. In this problem the task is to find a set of edges of a graph such that after removal of this set, the shortest path between two prescribed vertices is at least L long. We derive an FPT algorithm for a more general multi-commodity length boun...

Kotzig, A. S uvislost' a pravidelnn a s uvislost' kone cn yh grafov. maintenance of the four-connected components of a graph. Proc. A fast algorithm for optimally increasing the edge-connectivity. Figure 9: A 4-edge-connected graph and 3-edge{cuts in its 3-vertex-components for incremental maintenance of this structure is suggested. No general l-cuts description, l k + 1, is known. To item 4. T...

The objectives of this study were to determine the prevalence of Campylobacter jejuni and Campylobacter coli in retail beef, beef livers, and pork meats purchased from the Tulsa (OK, USA) area and to further characterize the isolates obtained through antimicrobial susceptibility testing. A total of 97 chilled retail beef (50 beef livers and 47 other cuts), and 100 pork samples were collected. T...

Variants of Herbelin’s λ-calculus, here collectively named Herbelin calculi, have proved useful both in foundational studies and as internal languages for the efficient representation of λ-terms. An obvious requirement of both these two kinds of applications is a clear understanding of the relationship between cut-elimination in Herbelin calculi and normalisation in the λ-calculus. However, thi...

OBJECTIVE To evaluate visual outcomes and complications after phacoemulsification in eyes with cataract and previous radial keratotomy (RK) cuts using different sizes of clear corneal incisions. METHODS The study was a retrospective study. Thirty eyes with cataract and previous RK underwent phacoemulsification and intraocular lens (IOL) implantation. Among them 7 eyes had 8 RK cuts, 13 eyes h...