Sequential composition of voting rules, by making use of structural properties of the voters’ preferences, provide computationally economical ways for making a common decision over a Cartesian product of finite local domains. A sequential composition is usually defined on a set of legal profiles following a fixed order. In this paper, we generalize this by order-independent sequential compositi...

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...

Let S be a set whose items are sorted with respect to d > 1 total orders 1 ; : : : ; d , and which is subject to dynamic operations, such as insertions of a single item, deletions of a single item, split and concatenate operations performed according to any chosen order i (1 i d). This generalizes to dimension d > 1 the notion of concatenable data structures, such as the 2-3-trees, which suppor...

To understand which soil chemical properties are the best predictors of CH4 production in rice paddy soils, a model was developed with empirical data from nine types of rice soils collected around Japan and anaerobically incubated at 30 degrees C for 16 wk in laboratory conditions. After 1, 2, 4, 8, and 16 wk of incubation, CO2, CH4, and Fe(II) were measured to understand soil organic matter de...

We consider digraphs – called extended locally semicomplete digraphs, or extended LSD’s, for short – that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. We characterize Hamiltonian extended LSD’s as well as extended LSD’s containing Hamiltonian paths. These results as well as some additional ones imply polynomial algorithms for finding a longes...

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 ...