The proliferation of database systems based on diierent data models and query languages has created the need for techniques that support interoperability so that information may be shared among the database systems. This dissertation proposal describes a technique to support interoperable query processing when multiple heterogeneous databases are accessed. We will focus on the problem of suppor...

the famous primary and cyclic decomposition theorems along with the tightly related rational and jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.

This paper studies connections between the preprojective representations of a valued quiver, the (+)-admissible sequences of vertices, and the Weyl group by associating to each preprojective representation a canonical (+)-admissible sequence. A (+)-admissible sequence is the canonical sequence of some preprojective representation if and only if the product of simple reflections associated to th...

A theory of non-unitary-invertible as well as unitary canonical transformations is formulated in the context of Weyl's phase space representations. Exact solutions of the transformation kernels and the phase space propagators are given for the three fundamental canonical maps as linear, gauge and contact (point) transformations. Under the nonlinear maps a phase space representation is mapped to...

As IPv6 deployment increases, there will be a dramatic increase in the need to use IPv6 addresses in text. While the IPv6 address architecture in Section 2.2 of RFC 4291 describes a flexible model for text representation of an IPv6 address, this flexibility has been causing problems for operators, system engineers, and users. This document defines a canonical textual representation format. It d...

We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and canonical representation of probability distributions defined over the models of a given propositional theory. Each parameter of a PSDD can be viewed as the (conditional) probability of making a decision in a corresponding Sentential Decision Diagram (SDD). The SDD itself is a recently proposed complete and canonica...

Wythoff s game is a variation of Nim, a two-pile game in which each player removes counters in turn until the winner takes the last counter. The safe-pairs generated in the solution of Wythoff's game have many properties interesting in themselves, and are related to the canonical Zeckendorf representation of an integer using Fibonacci numbers. In Nim, the strategy is related to expressing the n...

Graph isomorphism checking can be used in graph-based model checking to achieve symmetry reduction. Instead of one-to-one comparing the graph representations of states, canonical forms of state graphs can be computed. These canonical forms can be used to store and compare states. However, computing a canonical form for a graph is computationally expensive. Whether computing a canonical represen...

Canonical transformations are studied in the bosonic Fock space using coherent and ultracoherent vectors. The connection between the Weyl operator and the homogeneous canonical transformations (Bogoliubov transformations) is presented. The unitary ray representation of the symplectic group is defined in the bosonic Fock space by the action of the group on the ultracoherent vectors.

In this paper, we derive a canonical representation for the first order hyperbolic equation systems with their coefficient matrices satisfying the Clifford algebra Cl(1, 3), and then demonstrate some of its applications. This canonical formalism can naturally give a unified description for the fundamental fields in physics. PACS numbers: 11.10.-z, 11.10.Cd, 12.10.-g