We present a class of toric varieties V which, over any algebraically closed field of characteristic zero, are defined by codim V +1 binomial equations .

(Abstract) In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory of Boolean functions, and there have been developed fast symmetry checking methods based on BDDs (Binary Decision Diagrams). Here we discuss the property of symmetric items in data mining problems, and des...

Using super-efficiency, with regard to ranking efficient units, is increasing in DEA. However, this model has some problems such as the infeasibility. Thus, this article studies infeasibility of the input-based super-efficiency model (because of the zero inputs and outputs), and presents a solution by adding two virtual DMUs with mean values (one for inputs and one for outputs). Adding virtual ...

Zero-suppressed binary decision diagrams (ZDDs) are important data structures that are used in a number of combinatorial optimization settings. This paper explores a ZDD characterization for the maximal independent sets of a graph; a necessary and sufficient condition for when nodes in the ZDD can be merged is provided, and vertex orderings of the graph are studied to determine which orderings ...

We first describe how to “fuzzify” the estimated binary columns to create a [0,1]-valued column. Werefer to this [0,1] -valued column as the soft segmentation column of the noisy spectrogram column.Similarly to the collection of soft segmentation columns as the soft segmentation image, or simply asthe soft segmentation. The band-dependent posterior probability that the hard segmentation columnv...