Results 11  20
of
8,258
1. PRELIMINARIES ON FINITE SEQUENCES
"... Summary. This paper is a continuation of [15]. We prove that the family of cosets in the Segre’s product of partial linear spaces remains invariant under automorphisms. ..."
Abstract
 Add to MetaCart
Summary. This paper is a continuation of [15]. We prove that the family of cosets in the Segre’s product of partial linear spaces remains invariant under automorphisms.
Reversing a Finite Sequence
, 1995
"... .52> J gp+1 (x 0 ) is a row matrix of type 1 \Theta m, while the matrices in the product are square matrices of type m \Theta m except the leftmost one, which is a row matrix of type 1 \Theta m. The first idea which comes to mind is the following. We compute J f1 (x 0 ) and we store it; next we c ..."
Abstract
 Add to MetaCart
.52> J gp+1 (x 0 ) is a row matrix of type 1 \Theta m, while the matrices in the product are square matrices of type m \Theta m except the leftmost one, which is a row matrix of type 1 \Theta m. The first idea which comes to mind is the following. We compute J f1 (x 0 ) and we store it; next we compute x 1 , the Jacobian matrix J f2 (x 1 ) and the product J g2 (x 0 ) = J f2 (x 1 ) \Theta J f1 (x 0 ); we store this product, we compute x 2 , the matrix J f3 (x 2 ), the product J<F
Fitting a mixture model by expectation maximization to discover motifs in biopolymers.
 Proc Int Conf Intell Syst Mol Biol
, 1994
"... Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a twocomponent finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model to th ..."
Abstract

Cited by 947 (5 self)
 Add to MetaCart
Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a twocomponent finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Minimal Polynomial Synthesis of Finite Sequences
"... We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid’s algorithm, and the other is in essence a minimal polynomial version of the BerlekampMassey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up s ..."
Abstract
 Add to MetaCart
We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid’s algorithm, and the other is in essence a minimal polynomial version of the BerlekampMassey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1060 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
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 608 (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
Constrained model predictive control: Stability and optimality
 AUTOMATICA
, 2000
"... Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence and t ..."
Abstract

Cited by 738 (16 self)
 Add to MetaCart
Model predictive control is a form of control in which the current control action is obtained by solving, at each sampling instant, a finite horizon openloop optimal control problem, using the current state of the plant as the initial state; the optimization yields an optimal control sequence
Sorting Operators for Finite Sequences Yatsuka Nakamura
"... Summary. Two kinds of sorting operators, descendent one and ascendent one, are introduced for finite sequences of reals. They are also called rearrangement of finite sequences of reals. Maximum and minimum values of finite sequences of reals are also defined. We also discuss relations between these ..."
Abstract
 Add to MetaCart
Summary. Two kinds of sorting operators, descendent one and ascendent one, are introduced for finite sequences of reals. They are also called rearrangement of finite sequences of reals. Maximum and minimum values of finite sequences of reals are also defined. We also discuss relations between
Results 11  20
of
8,258