The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in network design when quality of service is of concern. We solve a strong integer linear programming formulation based on so-called jump cuts by a novel Branch&Cut algorithm, using various heuristics including tabu search to solve the separation problem.

Graph Cut has proven to be an effective scheme to solve a wide variety of segmentation problems in graphics community. The main limitation of conventional graph-cut implementations is that they can hardly handle largescale datasets because of high computational complexity. Even though there are some parallelization solutions, they commonly suffer from the problems of low parallelism (on CPU) or...

Combining the computational fluid dynamics (CFD) and the design of experiments (DOE) methods, as a mixed approach in modeling was proposed so that to simultaneously benefit from the advantages of both modeling methods. The presented method was validated using a coal hydraulic classifier in an industrial scale. Effects of operating parameters including feed flow rate, solid content and baffle le...

background : most diagnostic tests for biliary atresia (ba) are invasive. this study evaluates the sensitivity and specificity of serum  tumor necrosis factor-α (tnf-α) for diagnosing extra hepatic biliary duct atresia (ehba) in infants. materials and methods : infants with cholestasis who were admitted to children′s medical center hospital were evaluated. a total of 50 infants (20 with ehba an...

In this paper we consider the problem of the evaluation of system reliability, in which the lifetimes of components are described using a fuzzy exponential distribution. Formula of a fuzzy reliability function and its α-cut set are presented. The fuzzy reliability of structures is defined on the basis of fuzzy number. Furthermore, the fuzzy reliability functions of k -out-ofm system, series sys...

In graph clustering methods, MinMax Cut tends to provide more balanced clusters as compared to Ratio Cut and Normalized Cut. The traditional approach used spectral relaxation to solve the graph cut problem. The main disadvantage of this approach is that the obtained spectral solution has mixed signs, which could severely deviate from the true solution and have to resort to other clustering meth...

Following a strategy introduced earlier by the authors, we show that it is possible to extract |Vub| from the cut hadronic mass spectrum of B decays without large systematic errors which usually arise from having to model the Fermi motion of the heavy quark. We present a closed form expression for |Vub|/|Vts| which is accurate up to corrections of order α 2 s, αsρ, (Λ/mb) 2/ρ, where ρ is the ex...

In the framework of analytic approach to QCD the nonperturbative contributions in running coupling of strong interaction up to 4-loop order are obtained in an explicit form. For all Q > Λ they are shown to be represented in the form of an expansion in inverse powers of Euclidean momentum squared. The expansion coefficients are calculated for different numbers of active quark flavors nf and for ...