We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes. We then show how these descriptions were used to compute the integrality ratio of various relaxations of the max-cut problem, again for up to eight nodes.

In this contribution, a semi-automatic segmentation algorithm for (medical) image analysis is presented. More precise, the approach belongs to the category of interactive contouring algorithms, which provide real-time feedback of the segmentation result. However, even with interactive real-time contouring approaches there are always cases where the user cannot find a satisfying segmentation, e....

Abstract We present the concept of cotorsion pairs cut along subcategories an abelian category. This provides a generalization complete pairs, and represents general framework to find approximations restricted certain subcategories. also exhibit some connections between Auslander–Buchweitz approximation theory, by considering relative analogs for Frobenius contexts. Several applications are giv...

The effectiveness of slicing in cutting soft solids (i.e., transverse motion along the blade) is natural to anyone with even slightest kitchen experience, but underlying mechanism remains intriguing. This study seeks unveil mystic role by looking into effect friction materials. With increase indentation depth, nonlinearity large deformation superficial layer diverts lateral stress from compress...