𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The generalized Foster theorem and network-Q

✍ Scribed by Changhong Liang; Tao Su


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
113 KB
Volume
37
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

This paper proves the generalized Foster theorem, which can be applied to any lossy situation, while the original Foster theorem [1] only applied to reactive termination. Furthermore, the formula of Q with network parameters is described. One example, the quality factor Q of a pass‐through resonant cavity, is given here. It is clearly seen that the slope of the reactance function may be negative in a lossy situation. Β© 2003 Wiley Periodicals, Inc. Microwave Opt Technol Lett 37: 40–45, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10819


πŸ“œ SIMILAR VOLUMES


The generalized sine theorem and inequal
✍ Gangsong Leng; Yao Zhang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 463 KB

For an n-dimensional simplex in E", we establish a sine theorem and some inequalities for k-order vertex angles which are defined in this paper. To prove these results. we give a formula about the inverse matrix of the metric matrix of an n-parallelotope.

On the generalized virial theorem and Es
✍ Jean-FranΓ§ois Ganghoffer πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 304 KB

The formal relationships between the scalar and tensorial virials and Eshelby tensors have been presently investigated. The key idea is to evaluate the Eshelby stress from discrete or atomistic simulations for a structured body, conceived as a numerical homogenization method to reconstitute the macr

Vulnerability of scheduled networks and
✍ Berman, Kenneth A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 859 KB

An edge-scheduled network N is a multigraph G = (V, E), where each edge e E E has been assigned two real weights: a start time a(e) and a finish time p(e). Such a multigraph models a communication or transportation network. A multiedge joining vertices u and v represents a direct communication (tran