Vitamin B12 deficit is one of the most common vitamin deficiencies. However, there is no consensus on the cut-off points for vitamin B12 and its co-markers, such as folate, holotranscobalamin, methylmalonic acid and homocysteine. In order to establish the state of the art about cut-off points used to determine vitamin B12 deficiency in the last decades, the database MEDLINE was used for searchi...

the importance as well as the diculty of the problem of ranking fuzzy numbers is pointed out. here we consider approaches to the ranking of fuzzy numbers based upon the idea of associating with a fuzzy number a scalar value, its signal/noise ratios, where the signal and the noise are dened as the middle-point and the spread of each a-cut of a fuzzy number, respectively. we use the value of a ...

The cut locus encodes a homeobox protein that is localized in the nuclei of a variety of tissues and is required for proper morphogenesis of those tissues. Cut protein is required in embryonic and adult external sensory organs, where its absence results in conversion of the organs to chordotonal organs. Expression of cut also occurs in the Malpighian tubules, spiracles, central nervous system, ...

We propose a new method for finding the minimum ratio-cut of a graph. Ratio-cut is NP-hard problem for which the best previously known algorithm gi ves an O(log n)-factor approximation by solving its dually related maximum concurrent flow problem. We formulate the minimum ratio-cut as a certain nondifferentiable optimization problem, and sho w that the global minimum of the optimization problem...

We investigate the static and dynamic (phononic) elastic behavior of fractal-cut materials. These materials are novel in the sense that they deform by rotation of “rigid” units rather than by straining these units, can be fabricated by exploiting a simple cutting paradigm, and have properties that can be manipulated by control of the cut pattern and its hierarchy. We show that variation of frac...

We describe deterministic and randomized algorithms for finding global minimum cuts in undirected graphs. 1 Global and s-t cuts in undirected graphs Let G = (V,E,w) be a weighted undirected graph, where w : E → R is a weight (or cost, or capacity) function defined on its edges. A (global) cut (S, T ) of G is a partition of V into two disjoint non-empty sets, i.e., S, T 6= φ and S ∩ T = φ. Edges...

We discuss several criteria for clustering graphs, and identify two criteria which are not biased towards certain cluster sizes: the node-normalized cut (also called cut ratio) and the edge-normalized cut. We present two energy models whose minimum energy drawings reveal clusters with respect to these criteria. The energy model that corresponds to the edge-normalized cut differs from the other ...