No description available.

No description available.

This thesis project presents a MATLAB based application which is designed to synthesize any arbitrary stable transfer function. Our application is based on the Cauer synthesis procedure. It has an interactive front which allows inputs either in the form of residues and poles of a transfer function, in the form of coefficients of the numerator and denominator of the transfer impedance or in the form of samples of an impulse response. The program synthesizes either a single or double resistively terminated LC ladder network. Our application displays a chart showing the variation of stability of an impulse response with the addition of delay. An attempt is made to synthesize usually unstable impulse responses by calculating the delay that would make them stable.

Freddy Ba Hli. / "July 31, 1953." "This report is based on a thesis submitted to the Department of Electrical Engineering, ... for the degree of Doctor of Science, 1953." / Bibliography: p. 65. / Army Signal Corps Contract DA36-039 sc-42607 Project 132B Dept. of the Army Project 3-99-12-022

M.V. Cerrillo, E.F. Bolinder. / "August 15, 1952." / Bibliography: p. 168. / Army Signal Corps Contract DA36-039 sc-100 Project 8-102B-0 Dept. of the Army Project 3-99-10-022

Manuel V. Cerrillo, Ernest A. Guillemin. / "June 4, 1952." / Bibliography: p. 46. / Army Signal Corps Contract DA36-039 sc-100 Project 8-102B-0 Dept. of the Army Project 3-99-10-022

Decreasing fossil fuel reserves and environmental concerns necessitate a shift toward biofuels. However, the chemistry of many biomass to fuel conversion pathways remains to be thoroughly studied. The future of biorefineries thus depends on developing new pathways while optimizing existing ones. Here, potential chemicals are added to create a superstructure, then an algorithm is run to enumerate every feasible reaction stoichiometry through a mixed integer linear program (MILP). An optimal chemical reaction pathway, taking into account thermodynamic, safety, and economic constraints is then found through reaction network flux analysis (RNFA). The RNFA is first formulated as a linear programming problem (LP) and later recast as an MILP in order to solve multiple alternate optima through integer cuts. A graphical method is also developed in order to show a shortcut method based on thermodynamics as opposed to the reaction stoichiometry enumeration and RNFA methods. A hypothetical case study, based on the conversion of woody biomass to liquid fuels, is presented at the end of the work along with a more detailed look at the glucose and xylose to 2-mthyltetrahydrofuran (MTHF) biofuel production pathway.

This thesis is concerned with the synthesis of passive networks, motivated by the recent invention of a new mechanical component, the inerter, which establishes a direct analogy between mechanical and electrical networks. We investigate the minimum numbers of inductors, capacitors and resistors required to synthesise a given impedance, with a particular focus on transformerless network synthesis. The conclusions of this thesis are relevant to the design of compact and cost-effective mechanical and electrical networks for a broad range of applications. In Part 1, we unify the Laplace-domain and phasor approach to the analysis of transformerless networks, using the framework of the behavioural approach. We show that the autonomous part of any driving-point trajectory of a transformerless network decays to zero as time passes. We then consider the trajectories of a transformerless network, which describe the permissible currents and voltages in the elements and at the driving-point terminals. We show that the autonomous part of any trajectory of a transformerless network is bounded into the future, but need not decay to zero. We then show that the value of the network's impedance at a particular point in the closed right half plane can be determined by finding a special type of network trajectory. In Part 2, we establish lower bounds on the numbers of inductors and capacitors required to realise a given impedance. These lower bounds are expressed in terms of the extended Cauchy index for the impedance, a property defined in that part. Explicit algebraic conditions are also stated in terms of a Sylvester and a Bezoutian matrix. The lower bounds are generalised to multi-port networks. Also, a connection is established with continued fraction expansions, with implications for network synthesis. In Part 3, we first present four procedures for the realisation of a general impedance with a transformerless network. These include two known procedures, the Bott-Duffin procedure and the Reza-Pantell-Fialkow-Gerst simplification, and two new procedures. We then show that the networks produced by the Bott-Duffin procedure, and one of our new alternatives, contain the least possible number of reactive elements (inductors and capacitors) and resistors, for the realisation of a certain type of impedance (called a biquadratic minimum function), among all series-parallel networks. Moreover, we show that these procedures produce the only series-parallel networks which contain exactly six reactive elements and two resistors and realise a biquadratic minimum function. We further show that the networks produced by the Reza-Pantell-Fialkow-Gerst simplification, and the second of our new alternatives, contain the least possible number of reactive elements and resistors for the realisation of almost all biquadratic minimum functions among the class of transformerless networks. We group the networks obtained by these two procedures into two quartets, and we show that these are the only quartets of transformerless networks which contain exactly five reactive elements and two resistors and realise all of the biquadratic minimum functions. Finally, we investigate the minimum number of reactive elements required to realise certain impedances, of greater complexity than the biquadratic minimum function, with series-parallel networks.

No description available.

This study presents an optimization approach to heat exchanger network synthesis (HENS). HENs are widely used in industry and bring several fluid streams into their desired temperatures by using available heat in the process for efficient usage of energy. Our aim is to provide a network design coupled with a detailed equipment design for heat exchangers. The suggested approach involves discretization of temperatures based on heat load equalities and reformulation as a shortest-path problem, rather than dealing with a nonlinear model and a previously structured HEN, which are common methods in the literature. We generate a shortest path network whose every node corresponds to a heat exchanger alternative and each path represents a HEN design alternative. A mixed-integer nonlinear programming model is solved to design each exchanger alternative in detail, considering all thermo-physical and transport properties of streams at their temperatures and pressures. Our approach has modeling flexibility and successfully finds the required number of heat exchangers and their connections. In addition, one can control the solution quality by deciding on the heat load steps between stream inlet and outlets. Several HEN examples from the literature are solved to assess the performance of our approach and comparable results are obtained.