ABSTRACT: In this paper, a complete construction of quaternary complex Hadamard matrices of order 2 n is obtained using the method of Sylvester construction and Williamson construction. Williamson construction has been generalized to obtain any kind of Hadamard matrices (Complex or Real Numbers). Non-equivalent family of Hadamard Matrices can be obtained using the Generalized Williamson constru...

The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space. This proves that in general the powerset is an intractable operator for implementing xpoint queries.

From the assumption that there is a measurable cardinal κ with o(κ) = κ, we produce a model in which for all x ⊆ אω, HODx does not contain the powerset of אω. We also prove that this assertion requires large cardinals.

Functors which are determined, up to natural isomorphism, by their values on objects, are called DVO (Defined by Values on Objects). We focus on the collection of polynomial functors on a category of sets (classes), and we give a characterization theorem of the DVO functors over such collection of functors. Moreover, we show that the (κ-bounded) powerset functor is not DVO.

The inversion method proposed by Glück and Kawabe uses grammar programs as intermediate results that comprise sequences of operations (data generation, matching, etc.). The determinization method used in the inversion method fails for a grammar program of which the collection of item sets causes a conflict even if there exists a deterministic program equivalent to the grammar program. In this p...

A principle is proposed that organizes verbs in the lexicon according to their meaning and the number of arguments they require. This principle, which we call the Paradigmatic Structure, acts as a filter for the permanent lexicon, letting all verb stems into the lexicon but only some morphological derivatives. The effects of the Paradigmatic Structure are observed in blocking, in which some but...

The stochastic shortest path problem (SSP) is a highly expressive model for probabilistic planning. The computational hardness of SSPs has sparked interest in determinization-based planners that can quickly solve large problems. However, existing methods employ a simplistic approach to determinization. In particular, they ignore the possibility of tailoring the determinization to the specific c...

The two determinization procedures of Safra and MullerSchupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.

Preconcepts are basic units of knowledge that form the basis formal concepts in concept analysis (FCA). This paper investigates relations among different kinds preconcepts, such as protoconcepts, meet and join-semiconcepts concepts. The first contribution this paper, is to present a fuzzy powerset lattice gradation, coincides with preconcept at its 1-cut. second more significant contribution, i...