(Abstract) Frequent item set mining is one of the fundamental techniques for knowledge discovery and data mining. In the last decade, a number of efficient algorithms for frequent item set mining have been presented, but most of them focused on just enumerating the item set patterns which satisfy the given conditions, and it was a different matter how to store and index the result of patterns f...

We introduce a new approach to Boolean satisfiability that combines backtrack search techniques and zero-suppressed binary decision diagrams (ZBDDs). This approach implicitly represents satisfiability instances using ZBDDs, and performs search using an efficient implementation of unit propagation on the ZBDD structure. We describe how to perform backtrack search using ZBDDs as the underlying st...

Suppose you have a large volume of an ordinary gas and you examined a small subvolume within it that contains a mean number of particles N. You would expect that the variance of that number, δN2, resulting from repeated measurements, is also equal to N. By “ordinary,” I mean two things. First, the gas is ideal, i.e., composed of particles with negligible interactions, and second, the gas is “cl...