Results 1  10
of
1,872
Mathematical Control Theory: Deterministic Finite Dimensional Systems
 of Texts in Applied Mathematics
, 1990
"... The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics in contro ..."
Abstract

Cited by 485 (121 self)
 Add to MetaCart
The title of this book gives a very good description of its contents and style, although I might have added “Introduction to ” at the beginning. The style is mathematical: precise, clear statements (i.e., theorems) are asserted, then carefully proved. The book covers many of the key topics
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 851 (28 self)
 Add to MetaCart
A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 558 (0 self)
 Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Finite elements in computational electromagnetism
, 2002
"... This article discusses finite element Galerkin schemes for a number of linear model problems in electromagnetism. The finite element schemes are introduced as discrete differential forms, matching the coordinateindependent statement of Maxwell’s equations in the calculus of differential forms. Th ..."
Abstract

Cited by 128 (8 self)
 Add to MetaCart
This article discusses finite element Galerkin schemes for a number of linear model problems in electromagnetism. The finite element schemes are introduced as discrete differential forms, matching the coordinateindependent statement of Maxwell’s equations in the calculus of differential forms
The structure of complete stable minimal surfaces in 3manifolds of nonnegative scalar curvature.
 Comm. Pure Appli. Math.
, 1980
"... The purpose of this paper is to study minimal surfaces in threedimensional manifolds which, on each compact set, minimize area up to second order. If M is a minimal surface in a Riemannian threemanifold N, then the condition that M be stable is expressed analytically by the requirement that o n a ..."
Abstract

Cited by 192 (1 self)
 Add to MetaCart
stable minimal surface M is a plane (Corollary 4). The earliest result of this type was due to S. Bernstein [2] who proved this in the case that M is the graph of a function (stability is automatic in this case). The Bernstein theorem was generalized by R. Osserman [lo] who showed that the statement
A DavisPutnam Program and its Application to Finite FirstOrder Model Search: Quasigroup Existence Problems
, 1994
"... This document describes the implementation and use of a DavisPutnam procedure for the propositional satisfiability problem. It also describes code that takes statements in firstorder logic with equality and a domain size n searches for models of size n. The firstorder modelsearching code transfor ..."
Abstract

Cited by 107 (10 self)
 Add to MetaCart
This document describes the implementation and use of a DavisPutnam procedure for the propositional satisfiability problem. It also describes code that takes statements in firstorder logic with equality and a domain size n searches for models of size n. The firstorder modelsearching code
A formal model of program dependences and its implications for software testing, debugging, and maintenance
 IEEE Transactions on Software Engineering
, 1990
"... AbstractA formal, general model of program dependences is presented and used to evaluate several dependencebased software testing, debugging, and maintenance techniques. Two generalizations of control and data flow dependence, called weak and strong syntactic dependence, are introduced and rela ..."
Abstract

Cited by 151 (2 self)
 Add to MetaCart
and related to a concept called semantic dependence. Semantic dependence models the ability of a program statement to affect the execution behavior of other statements. It is shown, among other things, that weak syntactic dependence is a necessary but not sufficient condition for semantic dependence
RESEARCH STATEMENT
"... My main research interests are in number theory, modular forms and combinatorics. In particular, my focus has been on examining the relationship between hypergeometric series (ordinary, over finite fields and padic), the number of points on algebraic varieties over finite fields and Fourier coeffic ..."
Abstract
 Add to MetaCart
My main research interests are in number theory, modular forms and combinatorics. In particular, my focus has been on examining the relationship between hypergeometric series (ordinary, over finite fields and padic), the number of points on algebraic varieties over finite fields and Fourier
RESEARCH STATEMENT
"... My primary areas of research are computational group theory and the representation theory of finite groups. Generally speaking, representation theory is the study of possible ways to realize a group as a matrix group. More specifically, a representation ρ of a finite group G over a field F is a ho ..."
Abstract
 Add to MetaCart
My primary areas of research are computational group theory and the representation theory of finite groups. Generally speaking, representation theory is the study of possible ways to realize a group as a matrix group. More specifically, a representation ρ of a finite group G over a field F is a
RESEARCH STATEMENT
"... A finite presemifield is a nonassociative division ring. A presemifield possessing a multiplicative identity is a semifield. My research focuses on commutative semifields, which are in essence the closest algebraic structure to a finite field. The only difference is that multiplication in a finite ..."
Abstract
 Add to MetaCart
A finite presemifield is a nonassociative division ring. A presemifield possessing a multiplicative identity is a semifield. My research focuses on commutative semifields, which are in essence the closest algebraic structure to a finite field. The only difference is that multiplication in a finite
Results 1  10
of
1,872