Results 1  10
of
20,502
Modules for certain Lie algebras of maximal class
 J. Pure Appl. Algebra
, 1995
"... Let g be a nitedimensional Lie algebra over a eld k of characteristic zero. By Ado's Theorem it is known that there exists a faithful g module M of nite dimension. Hence we may consider the following integer valued invariant of g: (g): = minfdimk M j M is a faithful g moduleg: ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Let g be a nitedimensional Lie algebra over a eld k of characteristic zero. By Ado's Theorem it is known that there exists a faithful g module M of nite dimension. Hence we may consider the following integer valued invariant of g: (g): = minfdimk M j M is a faithful g moduleg:
Contractions of Certain Lie Algebras in the Context of the DLFTheory
, 2013
"... Copyright © 2014 Alexander Levichev, Oleg Sviderskiy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In accordance of the Creative C ..."
Abstract
 Add to MetaCart
Commons Attribution License all Copyrights © 2014 are reserved for SCIRP and the owner of the intellectual property Alexander Levichev, Oleg Sviderskiy. All Copyright © 2014 are guarded by law and by SCIRP as a guardian. Contractions of the Lie algebras d = u(2), f = u(1,1) to the oscillator Lie algebra l
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 521 (18 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
 IEEE Transactions on Automatic Control
, 1992
"... AbstructThe stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN’s) provide a motivation for the consideration of this system. We ..."
Abstract

Cited by 949 (19 self)
 Add to MetaCart
is stable. A policy m,, is obtained which is optimal in the sense that its stability region Cn0 is a superset of the stability region of every other scheduling policy. The stability region Cmo is characterized. Finally, we study the behavior of the network for arrival rates that lie outside the stability
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
be possible. To reflect this view of computation, [Sar89] develops the cc family of languages. We present here one member of the family, CC(.L,+) (pronounced “cc with Ask and Choose”) which provides the basic operations of blocking Ask and atomic Tell and an algebra of behaviors closed under prefixing
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 474 (7 self)
 Add to MetaCart
) of X (where n = dim X). Using this graded ring, we will show that X behaves like projective space in many ways. The paper is organized into four sections as follows. In §1, we define the homogeneous coordinate ring S of X and compute its graded pieces in terms of global sections of certain coherent
Simple statistical gradientfollowing algorithms for connectionist reinforcement learning
 Machine Learning
, 1992
"... Abstract. This article presents a general class of associative reinforcement learning algorithms for connectionist networks containing stochastic units. These algorithms, called REINFORCE algorithms, are shown to make weight adjustments in a direction that lies along the gradient of expected reinfor ..."
Abstract

Cited by 449 (0 self)
 Add to MetaCart
Abstract. This article presents a general class of associative reinforcement learning algorithms for connectionist networks containing stochastic units. These algorithms, called REINFORCE algorithms, are shown to make weight adjustments in a direction that lies along the gradient of expected
Submodular functions, matroids and certain polyhedra
, 2003
"... The viewpoint of the subject of matroids, and related areas of lattice theory, has always been, in one way or another, abstraction of algebraic dependence or, equivalently, abstraction of the incidence relations in geometric representations of algebra. Often one of the main derived facts is that all ..."
Abstract

Cited by 355 (0 self)
 Add to MetaCart
of linear programming. It turns out to be useful to regard “pure matroid theory”, which is only incidentally related to the aspects of algebra which it abstracts, as the study of certain classes of convex polyhedra. (1) A matroid M = (E,F) can be defined as a finite set E and a nonempty family F of so
Data Exchange: Semantics and Query Answering
 In ICDT
, 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract

Cited by 427 (41 self)
 Add to MetaCart
answering in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class
Results 1  10
of
20,502