Results 1  10
of
498,164
Algebraic Properties of Cellular Automata
, 1984
"... This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary c ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
This paper details and extends the discussion of global proper72 L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties of Cellular Automata (1984) Figure 2. Global state transition diagrams for finite cellular automata with size N and periodic boundary
Algebraic Properties for Free! ∗
"... Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational
Algebraic Graph Theory
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 868 (12 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
Algebraic laws for nondeterminism and concurrency
 Journal of the ACM
, 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract

Cited by 600 (13 self)
 Add to MetaCart
observation congruence class. The paper demonstrates, for a sequence of simple languages expressing finite (terminating) behaviors, that in each case observation congruence can be axiomatized algebraically. Moreover, with the addition of recursion and another simple extension, the algebraic language described
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 672 (18 self)
 Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical methods are necessarily incomplete and imprecise. Using the singular value decomposition (SVD), one can take advantage of the implicit higherorder structure in the association of terms with documents by determining the SVD of large sparse term by document matrices. Terms and documents represented by 200300 of the largest singular vectors are then matched against user queries. We call this retrieval method Latent Semantic Indexing (LSI) because the subspace represents important associative relationships between terms and documents that are not evident in individual documents. LSI is a completely automatic yet intelligent indexing method, widely applicable, and a promising way to improve users...
On algebraic properties of bicomplex and hyperbolic
, 2004
"... In this article we present, in a unified manner, a variety of algebraic properties of both bicomplex numbers and hyperbolic numbers. In particular, using three types of conjugations, we describe in detail some specific moduli with complex and hyperbolic ranges. We also specify for hyperbolic numbe ..."
Abstract

Cited by 23 (13 self)
 Add to MetaCart
In this article we present, in a unified manner, a variety of algebraic properties of both bicomplex numbers and hyperbolic numbers. In particular, using three types of conjugations, we describe in detail some specific moduli with complex and hyperbolic ranges. We also specify for hyper
Algebraic Properties of Cryptosystem PGM
 Journal of Cryptology
, 1992
"... In the late 1970's, S. Magliveras invented a privatekey cryptographic system called Permutation Group Mappings (PGM). PGM is based on the prolific existence of certain kinds of factorization sets, called logarithmic signatures, for finite permutation groups. PGM is an endomorphic system with m ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
with message space Z jGj , for a given finite permutation group G. In this paper we prove several algebraic properties of PGM. We show that the set of PGM transformations TG is not closed under functional composition and hence not a group. This set is 2transitive on Z jGj if the underlying group G
BERNSTEIN SETS WITH ALGEBRAIC PROPERTIES
"... Abstract. We construct Bernstein sets in R having some additional algebraic properties. In particular, solving a problem of Kraszewski, RaÃlowski, Szczepaniak and Żeberski, we construct a Bernstein set which is a < ccovering and improve some other results of RaÃlowski, Szczepaniak and Żebersk ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We construct Bernstein sets in R having some additional algebraic properties. In particular, solving a problem of Kraszewski, RaÃlowski, Szczepaniak and Żeberski, we construct a Bernstein set which is a < ccovering and improve some other results of RaÃlowski, Szczepaniak
Results 1  10
of
498,164