We present algebraic equivalences that allow to unnest nested algebraic expressions containing quantifiers for order-preserving algebraic operators. We illustrate how these equivalences can be applied successfully to unnest nested queries formulated in XQuery. Measurements illustrate the performance gains possible by unnesting.

In this paper we introduce the concepts of a multimode multi-relational fuzzy network and a regular fuzzy equivalence on such a network, and provide procedures for computing the greatest regular fuzzy and crisp equivalences contained in a given tuple of fuzzy equivalences.

We present algebraic equivalences that allow to unnest nested algebraic expressions for order-preserving algebraic operators. We illustrate how these equivalences can be applied successfully to unnest nested queries given in the XQuery language. Measurements illustrate the performance gains possible our approach.

In this paper, two kinds of equivalences in limited BCIalgebras will be found. One is from the partial ordering relation while the other one is from the ∗− operation in BCI-algebras. And the internal relevance between the two kinds of equivalences will be discussed, too.

In this paper, we use the Drazin inverse to derive some new equivalences of the reverse order law for the group inverse in unitary rings. Moreover, if the ring has an involution, we present more equivalences when both involved elements are EP.

2 Ep-Groupoids and Generalized Maps 17 2.1 Ep-Groupoids . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2.2 Functors and Equivalences . . . . . . . . . . . . . . . . . . . . 21 2.3 Inversion of Equivalences and Generalized Maps . . . . . . . . 28 2.4 Strong Bundles over Ep-Groupoids . . . . . . . . . . . . . . . 33 2.5 Auxiliary Norms . . . . . . . . . . . . . . . . . . . . . . . . . 4...

In this paper, we introduce almost D-split sequences and establish an elementary but somewhat surprising connection between derived equivalences and Auslander-Reiten sequences via BB-tilting modules. In particular, we obtain derived equivalences from Auslander-Reiten sequences (or n-almost split sequences), and Auslander-Reiten triangles.

This paper applies the theory of Probably Approximately Correct (PAC) learning to multiple output feedforward threshold networks in which the weights conform to certain equivalences. It is shown that the sample size for reliable learning can be bounded above by a formula similar to that required for single output networks with no equivalences. The best previously obtained bounds are improved fo...

We generalize Brenner and Butler’s Theorem as well as Happel’s Theorem on the equivalences induced by a finitely generated tilting module over Artin algebras, to the case of an infinitely generated tilting module over an arbitrary associative ring establishing the equivalences induced between subcategories of module categories and also at the level of derived categories.