Results 141 to 150 of about 1,680,496 (171)
Some of the next articles are maybe not open access.
1999
Up to now, we have considered ows or circulations only on a given network. But it is also quite interesting to study the reverse problem of designing a network—as economically as possible—on which a ow meeting given requirements can be realized. In practical terms, one might think of planning a system of roads.
openaire +1 more source
Up to now, we have considered ows or circulations only on a given network. But it is also quite interesting to study the reverse problem of designing a network—as economically as possible—on which a ow meeting given requirements can be realized. In practical terms, one might think of planning a system of roads.
openaire +1 more source
International Journal of Control, 1965
ABSTRACT Using a procedure based on network partitioning, design equations are obtained for evaluating the elements of the two-port, feedback network so as to realize specified low frequency open-loop gain and stability margins. The network is suitable for a shunt-shunt type of feedback amplifier.
openaire +1 more source
ABSTRACT Using a procedure based on network partitioning, design equations are obtained for evaluating the elements of the two-port, feedback network so as to realize specified low frequency open-loop gain and stability margins. The network is suitable for a shunt-shunt type of feedback amplifier.
openaire +1 more source
Product-Form Synthesis of Queueing Networks
IEEE Transactions on Software Engineering, 1985The mathematics of product-form queueing networks has traditionally dealt with the ''analysis'' of computer systems. That is, the system is assumed to be given and the question of how it performs is answered. In this paper the opposite process of system ''synthesis'' is dealt with: i.e., we answer the question of what the system topology and parameters
BALSAMO, Maria Simonetta, G. IAZEOLLA
openaire +2 more sources
Synthesis of Diagnosable FET Networks
IEEE Transactions on Computers, 1973With the advent of field-effect transistor (FET) technology it has become practical and economical to employ complex functions as network primitives. This paper describes a synthesis procedure for diagnosable (all single and multiple faults can be detected) FET networks.
openaire +1 more source
Synthesis of Multithreshold Tree Networks
IEEE Transactions on Computers, 1977-A multithreshold network realizes a multithreshold logic function of an equivalent analog excitation e which in turn could be realized by a weighted input network of Boolean variables. This correspondence presents the synthesis of multithreshold tree networks with conventional single-threshold elements. The maximum number of thresholds realized by the
openaire +2 more sources
2001
In this chapter, the network synthesis problem is introduced. Section 2.2 is devoted to the description of some practical applications, that is, the restoration and the multi-hour problems. In Section 2.3, we first introduce some notation. Then, two linear integer formulations are provided for the general network synthesis problem (with non ...
openaire +1 more source
In this chapter, the network synthesis problem is introduced. Section 2.2 is devoted to the description of some practical applications, that is, the restoration and the multi-hour problems. In Section 2.3, we first introduce some notation. Then, two linear integer formulations are provided for the general network synthesis problem (with non ...
openaire +1 more source
Synthesis of Unbalanced RLC Networks
Journal of Applied Physics, 1953A method is demonstrated for synthesizing an unbalanced RLC network with lossy coils, i.e., each inductance has an associated series resistance. The network realizes a minimum phase transfer function whose numerator and denominator are of degree not higher than the third and fourth, respectively, and whose poles and zeros may lie anywhere in the left ...
openaire +1 more source
Network Synthesis under survivability constraints
2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maurras, Jean-François, Vanier, Sonia
openaire +3 more sources
1989
We consider several families of deterministic network optimization problems (NOPs) of particular importance for the design (synthesis) of real-life transportation, communication, and distribution networks. These families of NOPs include determination of optimal spanning and Steiner trees, multiconnected networks, distance bounded networks.
openaire +1 more source
We consider several families of deterministic network optimization problems (NOPs) of particular importance for the design (synthesis) of real-life transportation, communication, and distribution networks. These families of NOPs include determination of optimal spanning and Steiner trees, multiconnected networks, distance bounded networks.
openaire +1 more source
Synthesis of General Linear Networks
SIAM Journal on Applied Mathematics, 1968Certain problems from Electric Network Synthesis are formulated in an operator theoretic context. A solution to the active synthesis problem and a partial solution of the passive synthesis problem are then obtained by invoking techniques for extending an operator beyond the space in which it is defined.
openaire +2 more sources

