In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...

In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...

Let tw(G), pw(G), c(G), !J.(G) denote, respectively, the tree-width, path-width, cutwidth and the maximum degree of a graph G on 11 vertices . It is known that c (G)~tw (G). We prove that c (G) =0 (tw (G)·!J.(G)·logn), and if ({Xj : iel] ,T=(I,A» is a tree decomposition of G with tree-wid~ then c (G) S (k+ l)·!J.(G)·c (T). In case that a tree decomposition is given, or that the tree-width is bo...

The aim of the study was: to obtain the profile of patients (with regards to age and family history of breast cancer) with a palpable breast mass. To determine the validity of ultrasound in the assessment of the palpable breast mass by determining the sensitivity, specificity, positive predictive value, negative predictive value and accuracy of ultrasound in distinguishing a malignant mass. To ...

this study was carried out in order to determine the leave characteristics of some chestnut genotypes in the central black sea region of turkey and also to determine whether the leaf morphometric characteristics could be used for differentiation of genotypes. in this study, seven chestnut (castanea sativa mill.) genotypes (sa5-1, se 3-12, se 21-2, se 21-9, 552-8, 556-7 and 556-8) and one cultiv...

In the field of parameterized complexity theory, study graph width measures has been intimately connected with development width-based model checking algorithms for combinatorial properties on graphs. this work, we introduce a general framework to convert large class model-checking into that can be used test validity graph-theoretic conjectures classes graphs bounded width. Our is modular and a...

With the development of computer vision technology, its applications in forestry are steadily becoming wider. To address problems inconvenience transporting unmanned aerial vehicles (UAVs), as well complex operation large instruments for measurement, a new method based on multi-vision image segmentation and coordinate fusion (MISF) is proposed this paper measuring size standing trees. In MISF, ...

We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is 0 or 1. This implies that rank-width of a graph is less than or equal to branch-width of the graph unless the branch-width is 0. Moreover, this inequality is tight.

introduction: of the factors leading to false negative results in mammography is breast tissue density, and by increasing the density of breast tissue in mammography, the mammography sensitivity decreases. on the other hand, increasing the breast tissue density leads to increased risk of breast cancer. various factors such as inheritance, genetics, hormonal and reproductive factors, and nutriti...