Symbolic trajectory evaluation (STE) is a model checking technique that has been successfully used to verify industrial designs. Existing implementations of STE, however, reason at the level of bits, allowing signals to take values in {0, 1, X}. This limits the amount of abstraction that can be achieved, and presents inherent limitations toion that can be achieved, and presents inherent limitat...

We describe a lattice generation method that produces highquality lattices with less than 10% increased computation over standard Viterbi decoding. Using the North American Business News (NAB) task, we show our method is within 0.2% in lattice word-error rate of ‘full lattices’, which are those that contain all the recognition hypotheses within the search beam. Our method is closely related to ...

Analogical proportions are statements involving four entities, of the form ‘A is to B as C is to D’. They play an important role in analogical reasoning. Their formalization has received much attention from different researchers in the last decade, in particular in a propositional logic setting. Analogical proportions have also been algebraically defined in terms of factorization, as a generali...

The classical and quantum mechanics of isolated, nonlinear resonances in integrable systems with N ≥ 2 degrees of freedom is discussed in terms of geometry in the space of action variables. Energy surfaces and frequencies are calculated and graphically presented for invariant tori inside and outside the resonance zone. The quantum mechanical eigenvalues, computed in the semiclassical WKB approx...

We shed some light on the problem of determining the orbits of the braid group action on semiorthonormal bases of Mukai lattices as considered in [7] and [8]. We show that there is an algebraic (and in particular algorithmic) equivalence between this problem and the Hurwitz problem for integer matrix groups finitely generated by involutions. In particular we consider the case of K0(P n) n > 4 w...

Property-oriented concept lattices are systems of conceptual clusters called property-oriented concepts, which are partially ordered by the subconcept/superconcept relationships. Property-oriented concept lattices are basic structures used in formal concept analysis. In general, a property-oriented concept lattice may contain overlapping clusters and is not to be a tree construction. Additional...

The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a general theorem on independence complexes using discrete Morse theory: If G is a graph and D a subset of its vertex set such that G\D is a forest, then P i d...

We illustrate how the recursive algorithm of Reeves & Pettitt (2004) for general factorizable models can be extended to allow exact sampling, maximization of distributions and computation of marginal distributions. All of the methods we describe apply to discrete-valued Markov random fields with nearest neighbour integrations defined on regular lattices; in particular we illustrate that exact i...

Let X be a discrete subset of Euclidean d-space. We allow subsequently continuous movements of single elements, whenever the minimum distance to other elements does not decrease. We discuss the question, if it is possible to move all elements of X in this way, for example after removing a finite subset Y from X . Although it is not possible in general, we show the existence of such finite subse...

Incoherent transport of excitations in one-dimensional disordered lattices with pairs of traps placed at random is studied by numerically solving the corresponding master equation. Results are compared to the case of lattices with the same concentration of unpaired traps, and it is found that pairing of traps causes a slowdown of the decay rate of both the mean square displacement and the survi...