As data centers attempt to cope with the exponential growth of data, new techniques for intelligent, software-defined data centers (SDDC) are being developed to confront the scale and pace of changing resources and requirements. For costconstrained environments, like those increasingly present in scientific research labs, SDDCs also may provide better reliability and performability with no addi...

We prove that, given a nontrivial Boolean algebra B, a compact convex set S and a groupG, there is an orthomodular latticeL with the center isomorphic toB, the automorphism group isomorphic to G, and the state space affinely homeomorphic to S. Moreover, given an orthomodular lattice J admitting at least one state, L can be chosen such that J is its subalgebra. Mathematics Subject Classification...

We initiate a study of topological orthoalgebras (TOAs), concentrating on the compact case. Examples of TOAs include topological orthomodular lattices, and also the projection lattice of a Hilbert space. As the latter example illustrates, a lattice-ordered TOA need not be a topological lattice. However, we show that a compact Boolean TOA is a topological Boolean algebra. Using this, we prove th...

We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for...