We propose a strategy for disclosure risk evaluation and disclosure control of a microdata set based on fitting decomposable models of a multiway contingency table corresponding to the microdata set. By fitting decomposable models, we can evaluate per-record identification (or re-identification) risk of a microdata set. Furthermore we can easily determine swappability of risky records which doe...

The study of decompositions of sets in U, n ^ 1, into disjoint, mutually isometric subsets has a long and distinguished history. In 1928 J. von Neumann [2] proved that an interval in U (with or without endpoints) is decomposable into Ko disjoint sets which are mutually isometric under translations. In 1951 W. Gustin [1] proved that no such decomposition into n, 2 ^ n < No, sets is possible. A b...

We propose a strategy for disclosure risk evaluation and disclosure control of a microdata set based on fitting decomposable models of a multiway contingency table corresponding to the microdata set. By fitting decomposable models, we can evaluate per-record identification (or re-identification) risk of a microdata set. Furthermore we can easily determine swappability of risky records which doe...

To understand the behavior of a complex system, you must understand the tangled web of interactions between the system’s many parts. The web is tractable in systems that are somewhat decomposable, meaning that the interactions influence only weakly the short-term behavior of the parts. But how to handle complexity in systems that are nowhere near decomposable? Science’s principal tool for deali...

Decomposable Negation Normal Form formulae (DNNFs) form an interesting propositional fragment, both for efficiency and succinctness reasons. A famous subclass of the DNNF fragment is the OBDD fragment which offers many polytime queries and transformations, including quantifier eliminations (under some ordering restrictions). Nevertheless, the decomposable AND nodes at work in OBDDs enable only ...

Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints. Certain classes of these non-binary constraints are “network decomposable” as they can be represented by binary constraints on the same set of variables. We compare theoretically the levels of consistency which are achieved o...

According to Gestalt theory, any image is perceived subconsciously as a coherent structure (or whole) with two contrast substructures: figure and ground. The consists of numerous autogenerated substructures an inherent hierarchy far more smalls than larges. Through these substructures, the structural beauty (L), or equivalently livingness space, can be computed by multiplication number (S) thei...