Volume rendering has long been used as a key technique for volume data visualization, which works by using a transfer function to map color and opacity to each voxel. Many volume rendering approaches proposed so far for voxels classification have been limited in a single global transfer function, which is in general unable to properly visualize interested structures. In this paper, we propose a...

The technique for order of preference by similarity to ideal solution (TOPSIS) is a method based on the ideal solutions in which the most desirable alternative should have the shortest distance from positive ideal solution and the longest distance from negative ideal solution. Depending on type of evaluations or method of ranking, different approaches have been proposing to calculate distances ...

Since the inception of intuitionistic fuzzy sets in 1986, many authors have proposed different methods for ranking intuitionistic fuzzy numbers (IFNs). How ever, due to the complexity of the problem, a method which gives a satisfactory result to all situations is a challenging task. Most of them contained some shortcomings, such as requirement of complicated calculations, inconsistency with hum...

We present a graph cuts-based image segmentation technique that incorporates an elliptical shape prior. Inclusion of this shape constraint restricts the solution space of the segmentation result, increasing robustness to misleading information that results from noise, weak boundaries, and clutter. We argue that combining a shape prior with a graph cuts method suggests an iterative approach that...

In integer programming, the elementary closure associated with a family of cuts is the convex set de ned by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory’s fractional cuts, three versions of Gomory’s mixed integer cuts, two versions of intersection cuts and their strengt...

Recently, it is shown that graph cuts algorithms can be used to solve some variational image restoration problems, especially connected with noise removal and segmentation. For very large size images, the usage for memory and computation increases dramatically. We propose a domain decomposition method with graph cuts algorithms. We show that the new approach costs effective both for memory and ...

Accurate policy evaluation is central to optimal policymaking, but difficult to achieve. Most often, analysts have to work with observational data and cannot directly observe the counterfactual of a policy to assess its effect accurately. In this paper, we craft a quasi-experimental design and apply two relatively new methods—the differencein-differences estimation and the synthetic controls me...

In a recent paper [4] Balas, Ceria and Cornuejoels provided computational results that their Lift-and-Project method [3] successfully solved a series of pure and mixed 0-1 benchmark programs and performed on the average better than several commercial general mixed integer optimization packages existing at the time. The Lift-and-Project approach uses a linear programming formulation derived by i...

We introduce a new method for concurrent mark-and-sweep garbage collection in objectoriented databases. For this purpose, we define a cut of a database to be a collection containing one or more copies of every page in the database; the copies may have been made at different times during the operation of the database. We define a class of cuts called GC-consistent cuts, and prove formally that a...

Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special c...