Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.
Optimal nonuniform distributed networks
โ Scribed by T.N. Lee
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 983 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
โฆ Synopsis
Techniques developed in the Sturm-Liouville problem and its Inverse problem are well known in solving the analysis and synthesis problems of non-uniform distributed networks (or NUDN) (l)-(6), (15). However, very few practical results have been obtained from the theory, especially as regards the synthesis part of the problem. In this paper, we show that the chain matrix of an inhomogeneous ladder network (or IHLN) of N sections has undergone exactly the limit process of first-order difference equation approximation of the corresponding differential equation converges to the chain matrix of the corresponding
NUDN uniformly on every compact subset of p = z(s)y(s) plane. Therefore an optimal NUDN is proven to be either symmetrical or antimetrical ( 7). Specifically, a class of optimal NUDN which is optimal on every subinterval of [0, L] has closed-form solutions, and is proven to be both symmetrical and antimetrical.
ZZ.
๐ SIMILAR VOLUMES
On the basis of detailed analysis of reaction times and neurophysiological data from tasks involving choice, it has been proposed that the brain implements an optimal statistical test during simple perceptual decisions. It has been shown recently how this optimal test can be implemented in biologica