The aim of the present study was to analyze the fatty acid composition and cholesterol content of the beef and chicken meat most often consumed by a population of type 2 diabetic patients in Southern Brazil: for beef, semimembranosus and biceps femoris; and for chicken, drumstick and thigh. The moisture content (gravimetrically), protein content (Kjeldahl procedure), cholesterol content (HPLC o...

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...

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...

Abstract In this work we study statistical properties of graph-based clustering algorithms that rely on the optimization balanced graph cuts, main example being Cheeger cuts. We consider proximity graphs built from data sampled an underlying distribution supported a generic smooth compact manifold $${\mathcal {M}}$$ M </...

We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator Y . The notion of ‘indicator’ is defined in a novel way, without initially specifying what property is indicated and is used to define a topological space of cuts of the model. Various familiar properties of cuts (strength, regularity, saturation, coding pr...