207 search results - page 20 / 42 » Canonical Forms for Data-Specifications |
SIAMCO
2008
14 years 9 months ago
2008
We analyze controllability and observability conditions for second order descriptor systems and show how the classical conditions for first order systems can be generalized to this...
MA
2011
Springer
14 years 4 months ago
2011
Springer
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...
127
click to vote
WIA
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...