Results 1  10
of
1,744,091
Membership Algebra as a Logical Framework for Equational Specification
, 1998
"... This paper proposes membership equational logica Horn logic in which the basic predicates are equations t = t 0 and membership assertions t : s stating that a term t belongs to a sort sas a logical framework in which a very wide range of total and partial equational specification formalisms ..."
Abstract

Cited by 176 (61 self)
 Add to MetaCart
This paper proposes membership equational logica Horn logic in which the basic predicates are equations t = t 0 and membership assertions t : s stating that a term t belongs to a sort sas a logical framework in which a very wide range of total and partial equational specification formalisms
The selfduality equations on a Riemann surface
 Proc. Lond. Math. Soc., III. Ser
, 1987
"... In this paper we shall study a special class of solutions of the selfdual YangMills equations. The original selfduality equations which arose in mathematical physics were defined on Euclidean 4space. The physically relevant solutions were the ones with finite action—the socalled 'instanton ..."
Abstract

Cited by 524 (6 self)
 Add to MetaCart
In this paper we shall study a special class of solutions of the selfdual YangMills equations. The original selfduality equations which arose in mathematical physics were defined on Euclidean 4space. The physically relevant solutions were the ones with finite action—the socalled &apos
Equationbased congestion control for unicast applications
 SIGCOMM '00
, 2000
"... This paper proposes a mechanism for equationbased congestion control for unicast traffic. Most besteffort traffic in the current Internet is wellserved by the dominant transport protocol, TCP. However, traffic such as besteffort unicast streaming multimedia could find use for a TCPfriendly cong ..."
Abstract

Cited by 832 (29 self)
 Add to MetaCart
This paper proposes a mechanism for equationbased congestion control for unicast traffic. Most besteffort traffic in the current Internet is wellserved by the dominant transport protocol, TCP. However, traffic such as besteffort unicast streaming multimedia could find use for a TCP
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
 ACM Trans. Math. Software
, 1982
"... An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerica ..."
Abstract

Cited by 649 (21 self)
 Add to MetaCart
An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerical properties. Reliable stopping criteria are derived, along with estimates of standard errors for x and the condition number of A. These are used in the FORTRAN implementation of the method, subroutine LSQR. Numerical tests are described comparing I~QR with several other conjugategradient algorithms, indicating that I~QR is the most reliable algorithm when A is illconditioned. Categories and Subject Descriptors: G.1.2 [Numerical Analysis]: ApprorJmationleast squares approximation; G.1.3 [Numerical Analysis]: Numerical Linear Algebralinear systems (direct and
Network Time Protocol (Version 3) Specification, Implementation and Analysis
, 1992
"... Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings are not ava ..."
Abstract

Cited by 522 (18 self)
 Add to MetaCart
Note: This document consists of an approximate rendering in ASCII of the PostScript document of the same name. It is provided for convenience and for use in searches, etc. However, most tables, figures, equations and captions have not been rendered and the pagination and section headings
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization
, 2007
"... The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative ..."
Abstract

Cited by 568 (23 self)
 Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NPhard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
Specificity and mechanism of action of some commonly used protein kinase inhibitors
 Biochem. J
, 2000
"... The specificities of 28 commercially available compounds reported to be relatively selective inhibitors of particular serine� threoninespecific protein kinases have been examined against a large panel of protein kinases. The compounds KT 5720, Rottlerin and quercetin were found to inhibit many prot ..."
Abstract

Cited by 514 (1 self)
 Add to MetaCart
The specificities of 28 commercially available compounds reported to be relatively selective inhibitors of particular serine� threoninespecific protein kinases have been examined against a large panel of protein kinases. The compounds KT 5720, Rottlerin and quercetin were found to inhibit many
Results 1  10
of
1,744,091