1. |
Lpconvergence of a process identification algorithm |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 401-407
G. J. VACHTSEVANOS,
Preview
|
PDF (206KB)
|
|
摘要:
This paper is concerned with some aspects of the adaptive optimal control of processes whose dynamic characteristics are not completely specified but assumed to be varying slowly with time. It is shown that the identification procedure involves the evaluation of process output differentials, without requiring the explicit determination of the unknown process parameters. The process input and output functions are taken to be elements ofLp-spaces and the optimization procedure is briefly outlined. For any practical application of the identification algorithm the process output differentials are approximated by first-order differences of output time segments, and their corresponding adjoints by a truncated series of time sequences. Utilizing the techniques of functional analysis the Lp-space convergence of these approximating algorithms is shown.
ISSN:0020-7721
DOI:10.1080/00207727508941826
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
2. |
Generation of delayed replicas of linearp-levelm-sequences |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 409-416
K. S. SASTRI,
Preview
|
PDF (254KB)
|
|
摘要:
This paper is concerned with the generation of phase-delayed versions of a linear multilevel (p-Ievel) feedback shift registerm-sequence, A method is described to determine thep-nary shift register connections for obtaining phase-delayed copies of the basicm-sequence, in which use is made of the concept of generating function associated with them-sequence. The method provides quick results as the only calculation involved is simple modulo-paddition.
ISSN:0020-7721
DOI:10.1080/00207727508941827
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
3. |
A universal building block for all pulse computing systems |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 417-431
ROLAND YII,
Preview
|
PDF (524KB)
|
|
摘要:
Proposed in this paper is a universal building block for the implementation of all computing systems including various types of calculators, high speed largo size computers and generalized computing systems (Yii 1974). The word ‘ universal ’implies that the unique basic building blocks can be shared by both the arithmetic unit and the memory for a given system and utilized as the basic building blocks for the implementation of any conceivable computing system. It is essentially an electronic counterpart of a hypothetical mechanical gear with the number of teeth variable. From the circuit point of view, it is conceivable of being either a variable pulse train generator or a variable scalar with memory. The use of the magnetic core as a memory core is no longer restricted to be a bistable element. It is enabled to memorize a digit of an arbitrary radix by introducing a brand new circuit technique of partial switchings with alterable current biases. The interconnections between the basic blocks can be made either directly or by way of the conventional binary logic elements. Consequently, any existing computing systems, however complex, can be duplicated with the additional feature of being able to vary the radix.
ISSN:0020-7721
DOI:10.1080/00207727508941828
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
4. |
Stackelberg strategy for linear quadratic partial differential games |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 433-441
W. L. CHAN,
Preview
|
PDF (233KB)
|
|
摘要:
Characterizations of open-loop Stackelberg strategy for two-person nonzero-sum dynamic games described by linear operators (including unbounded ones) in Hilbert spaces are presented. The method of Lions is used and it guarantees the existence, uniqueness, as well as necessary and sufficient conditions for the open-loop Stackelberg strategy of such games. Special cases considered include games governed by ordinary differential equations, linear elliptic and parabolic partial differential equations with quadratic cost functions.
ISSN:0020-7721
DOI:10.1080/00207727508941829
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
5. |
Secondary state assignment using connected matrices |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 443-464
S. C DE SARKAR,
D. K. CHATTOPADHYAY,
A. SEN GUPTA,
A. K. CHOUDHURY,
Preview
|
PDF (716KB)
|
|
摘要:
This paper deals with the problem of state assignment of a sequential machine so as to achieve reduced dependent assignment of each of the internal variables of the machine. Suitable rearrangement of the flow table in a form referred to as the connected matrix arrangement has been proposed and it has been shown that such an arrangement gives an easy visualization of the existence of reduced dependent assignments. It has been further shown that the connected matrix arrangement enables one to have directly the valid partitions with substitution property (SP) (Stearns and Hartmanis 1966) that can give rise to reduced dependent assignment and thus makes the conventional laborious process of generating all the partitions with SP on the set of states of the machine completely unnecessary.
ISSN:0020-7721
DOI:10.1080/00207727508941830
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
6. |
Multiplier method and optimal control problems with terminal state constraints |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 465-477
H. NAKAYAMA,
H. SAYAMA,
Y. SAWARAGI,
Preview
|
PDF (328KB)
|
|
摘要:
The multiplier method for constrained optimization problems is considered geometrically with the concept of supporting hypersurfaces. This geometric interpretation simplifies the comparison of the multiplier method with other existing methods and provides a basis from which to develop new algorithms. Moreover, though it is proved that the algorithm of the multiplier method can be derived from different viewpoints, the convergence of the multiplier method as a successive approximation algorithm is verified in this paper. Finally, the multiplier method is applied to optimal control problems with terminal state constraints, and some numerical experiments are presented.
ISSN:0020-7721
DOI:10.1080/00207727508941831
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
7. |
On the stability of discrete non-linear feedback systems with state-dependent noise |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 479-490
M. K. P. MISHRA,
A. K. MAHALANABIS,
Preview
|
PDF (402KB)
|
|
摘要:
The problem of deriving frequency-domain conditions that ensure asymptotic stability with probability one (ASWP1) of discrete time non-linear feedback systems with state-dependent noise is considered. It is shown that if the noise is linearly related with the state of the system, a relatively simple frequency-domain inequality that guarantees ASWPl of the system, exists. The discrete stochastic version of the second method of Liapunov, along with Szegö-Kalman typo lemmae are used to derive such conditions, assuming that only sector information or both sector and slope information are available. The case of a difference system with white-noise parameter perturbation is also considered and an illustrative example is presented.
ISSN:0020-7721
DOI:10.1080/00207727508941832
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|
8. |
A directional derivative computer algorithm for non-linear optimization† |
|
International Journal of Systems Science,
Volume 6,
Issue 5,
1975,
Page 491-500
ROBERTN. BRASWELL,
PATRICIAJANE COLEE,
Preview
|
PDF (308KB)
|
|
摘要:
This paper describes the computer solution to a non-linear optimization problem by the use of directional derivatives. Newton's method is used to find stationary points and when these points satisfy conditions of sufficiency, they are determined optima.
ISSN:0020-7721
DOI:10.1080/00207727508941833
出版商:Taylor & Francis Group
年代:1975
数据来源: Taylor
|