Multiresolution data representations crucial for key to viewing large volumetric datasets interactively. There are several stages in the visualization pipeline to render large data sets. When a data set is too large to fit into texture memory, or even into main memory, a “cut” must be made through the multiresolution data hierarchy to attain a coarser subset of the data. Ideally, the subset is ...

in descriptive statistics, there are two computational algorithms for determining the variance s2, of a set of observations : algorithm 1: s2= - , algorithm 2: s2= , where . it is interesting to discuss, which of the above formulas is numerically more trustworthy in machine numbers sets. i this paper, based on total effect of rounding error, we prove that the second algorithm is better than ...

medicine had never been error free. medical society has responsibility to reduce the rate of medical errors and should respect to people and patients rights in the case of error occurrence to maintain their trust. waiver of cause of medical errors, what is of importance is recognizing the ethical duty of physician toward her patient in the case of error commitment. in this paper at the first, t...

We develop a conservative cut finite element method for an elliptic coupled bulk-interface problem. The is based on discontinuous Galerkin framework where stabilization added in such way that we retain conservation macroelements containing one with large intersection the domain and possibly number of elements small intersections. derive error estimates present confirming numerical results.

We consider the max-cut problem on a random graph G with n vertices and weights wij being independent bounded random variables with the same xed positive expectation and variance . It is well known that the max-cut number mc(G) always exceeds 2 ∑ i¡j wij . We prove that with probability greater than pn the max-cut number satis es

A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...

We propose Inflate-Paste – a new technique for generating orthogonal polygons with a given number of vertices from a unit square based on gluing rectangles. It is dual to Inflate-Cut – a technique we introduced in [12] that works by cutting rectangles.

In this Brief Communication we present a new mathematical tool, which we call local spectrum analysis, that can be used to obtain information about local spectral content of the commutation error in large eddy simulations and its dependence on the filter shape and the non-uniformity of the filter width. To illustrate these theoretical findings, the local commutation spectrum analysis is applied...

For a positive integer d, the d-CUT is problem of deciding if an undirected graph $$G=(V,E)$$ has nontrivial bipartition (A, B) V such that every vertex in A (resp. at most d neighbors B A). When $$d=1$$ , this MATCHING CUT problem. Gomes and Sau [9] gave first fixed-parameter tractable algorithm for parameterized by maximum number crossing edges cut (i.e., size edge cut). However, their paper ...