We describe an algorithm for the sequential sampling of entries in multiway contingency tables with given constraints. The algorithm can be used for computations in exact conditional inference. To justify the algorithm, a theory relates sampling values at each step to properties of the associated toric ideal using computational commutative algebra. In particular, the property of interval cell c...

This paper proposes a multiplicative approach to solve defective issues in lexicographic goal programming of the analytic hierarchy process (LGPAHP). Although the LGPAHP can handle inconsistent interval comparison matrices, it generates different weights in the upper and lower triangular interval judgments. Instead of adopting additive constraints, the proposed method uses multiplicative constr...

Attacks against computer networks are becoming more sophisticated, with adversaries using new attacks or modifying existing attacks. The research uses two types of multiobjective approaches, lexicographic and Pareto-based, in an evolutionary programming algorithm to develop a new method for detecting such attacks. This development extends the Computer Defense Immune System, an artificial immune...

A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in ...

In this paper, we introduce a notion of epistemic equivalence between hierarchies of conditional beliefs and hierarchies of lexicographic beliefs, thus extending the standard equivalence results of Halpern (2010) and Brandenburger et al. (2007) to an interactive setting, and we show that there is a Borel surjective function, mapping each conditional belief hierarchy to its epistemically equival...