Journal of the Franklin Institute, Volume 339Pergamon Press, 2002 Vols. 1-69 include more or less complete patent reports of the U. S. Patent Office for years 1825-1859. cf. Index to v. 1-120 of the Journal, p. [415] |
From inside the book
Results 1-3 of 82
Page 46
... given , respectively , by y ( k ) = A sin [ ∞ , t ( k ) + 0 ( k ) ] + n ( k ) , x ( k ) = A sin [ ∞ , t ( k ) + O ( k ) − ¥ ] + n ' ( k ) , where 0 ( k ) = 0 [ t ( k ) ] , _n ( k ) = n ( t ( k ) ) , and n ' ( k ) = n ' ( t ( k ) ...
... given , respectively , by y ( k ) = A sin [ ∞ , t ( k ) + 0 ( k ) ] + n ( k ) , x ( k ) = A sin [ ∞ , t ( k ) + O ( k ) − ¥ ] + n ' ( k ) , where 0 ( k ) = 0 [ t ( k ) ] , _n ( k ) = n ( t ( k ) ) , and n ' ( k ) = n ' ( t ( k ) ...
Page 408
... Given a finite semiautomaton with state set Q , input set X and next - state function 8 , we can associate with it a unique semigroup ( S , ) [ 21,11,12 ] . The construction of S is as follows : for every input sequence of finite length ...
... Given a finite semiautomaton with state set Q , input set X and next - state function 8 , we can associate with it a unique semigroup ( S , ) [ 21,11,12 ] . The construction of S is as follows : for every input sequence of finite length ...
Page 417
... Given the LTI system and given encoding matrix G and decoding matrix L , the following theorem from [ 20,32,33 ] provides a characterization of the class of possible redundant implementations : Theorem 3. In the setting described above ...
... Given the LTI system and given encoding matrix G and decoding matrix L , the following theorem from [ 20,32,33 ] provides a characterization of the class of possible redundant implementations : Theorem 3. In the setting described above ...
Contents
Contents | 1 |
Vol 339 No 2 MARCH 2002 | 129 |
PERGAMON ISSN 00160032 | 248 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
2002 The Franklin adaptive algorithm analysis angiogenesis applied approach Benjamin Franklin Medal Chebyshev Chebyshev polynomials chirp closed-loop computation consider constraints corresponding coset defined denote detection domain dynamic systems Elsevier Science Ltd encoding energy equation estimation example fault fault-tolerant feedback finite flywheel Franklin Institute Franklin Institute 339 Franklin Institute www.elsevier.com/locate/jfranklin frequency response frequency response functions gain given group machine homomorphism IEEE IEEE Trans implementation input k₁ mapping Mathematics matrix method NARMAX model noise nomograph nonlinear systems observer obtained optimal control optimal control problem output packet paleomagnetic paper parameters performance Petri net phase error PID controller polynomials proposed Published by Elsevier quadratic redundant residual ScienceDirect Section selectivity semiautomata semigroup shown in Fig signal processing simulation solution solve SPRO stability T₁ TDTL Theorem trajectories transfer function transform transitional filter University v₁ variables vector Widrow zero
Bibliographic information
| Title | Journal of the Franklin Institute, Volume 339 Journal of the Franklin Institute, Franklin Institute (Philadelphia, Pa.) |
| Author | Franklin Institute (Philadelphia, Pa.) |
| Publisher | Pergamon Press, 2002 |
| Original from | University of Minnesota |
| Digitized | 22 Jan 2018 |
| Export Citation | BiBTeX EndNote RefMan |