background: we investigated whether the lungheart ratio parameter (lhr) can be used to identify the optimum cut off frequency for butterworth filter in 99mtc myocardial spect imaging. materials and methods: this study involved a cardiac phantom system consisting of cardiac insert in which 1.10 cm cold defect was inserted into its myocardium wall and filled with 4.0 μci/ml (0.148 mbq/ml) 99mtc c...

Throughout this section, G = (V,E) is a multi-graph. A cut of G is a bipartition (S, S̄) of the vertex set of G. The capacity of a cut is the number of edges having one endpoint on both sides of the cut. A min-cut is a cut of minimum capacity. A minimum cut can be computed with the help of maxflow computations. For some vertex s and every other vertex t, one computes the minimum cut separating s...

Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...

acres, and you enjoy a variety of activities on your land: watching wildlife, hiking, hunting, picking berries, picnicking or taking photos of wildlife and wildflowers. You delight in the beauty and solitude that comes with owning a woodland. You warm yourself in late fall and winter by cutting a little firewood, and you wouldn’t mind making a little extra cash, though managing your woodland fo...

The cut polyhedron cut(G) of an undirected graph G = (V,E) is the dominant of the convex hull of all its nonempty edge cutsets. After examining various compact extended formulations for cut(G), we study some of its polyhedral properties. In particular, we characterize all the facets induced by inequalities with right-hand side at most 2. These include all the rank facets of the polyhedron.