Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (M.S.)--University of Wisconsin--Madison, 1968. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1958. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 122-123).

Thesis (M.S.)--University of Wisconsin--Madison, 1964. / eContent provider-neutral record in process. Description based on print version record. Bibliography: l. 78.

Thesis (M.S.)--University of Wisconsin--Madison, 1968. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Excitation system models suitable for use in large-scale system stability studies are presented. Important limiters and supplementary controls are also included. The model structures presented are intended to facilitate the use of field test data as a means of obtaining model parameters. The models are valid for frequency deviations of ±5% from rated frequency and oscillation frequencies up to 3 Hz. / "IEEE Std 421.5 -2005 (Revision of IEEE Std 421.5-1992)." "Recognized as an American National Standard (ANSI)." "Approved 29 December 2005, American National Standards Institute ; approved 25 October 2005, IEEE-SA Standards Board." "Published 21 April 2006."--P. [ii]. "SH95364 ; SS95364"--P. [ii] Includes bibliographical references.

A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock. Synchronous algorithms include systolic algorithms; these are algorithms that are well-suited to implementation in VLSI technologies. This thesis provides a mathematical theory for the design and analysis of synchronous algorithms. The theory includes the formal specification of synchronous algorithms; techniques for proving the correctness and performance or time-complexity of synchronous algorithms, and formal accounts of the simulation and top-down design of synchronous algorithms. The theory is based on the observation that a synchronous algorithm can be specified in a natural way as a simultaneous primitive recursive function over an abstract data type; these functions were first studied by J. V. Tucker and J. I. Zucker. The class of functions is described via a formal syntax and semantics, and this leads to the definition of a functional algorithmic notation called PR. A formal account of synchronous algorithms and their behaviour is achieved by showing that synchronous algorithms can be specified in PR. A formal account of the performance of synchronous algorithms is achieved via a mathematical account of the time taken to evaluate a function defined by simultaneous primitive recursion. A synchronous algorithm, when specified in PR, can be transformed into a program in a language called FPIT. FPIT is a language based on abstract data types and on the multiple or concurrent assignment statement. The transformation from PR to FPIT is phrased as a compiler that is proved correct; compiling the PR-representation of a synchronous algorithm thus yields a provably correct simulation of the algorithm. It is proved that FPIT is just what is needed to implement PR by defining a second compiler, this time from FPIT back into PR, which is again proved correct, and thus PR and FPIT are formally computationally equivalent. Furthermore, an autonomous account of the length of computation of FPIT programs is given, and the two compilers are shown to be performance preserving; thus PR and FPIT are computationally equivalent in an especially strong sense. The theory involves a formal account of the top-down design of synchronous algorithms that is phrased in terms of correctness and performance preserving transformations between synchronous algorithms specified at different levels of data abstraction. A new definition of what it means for one abstract data type to be 'implemented' over another is given. This definition generalises the idea of a computable algebra due to A. I. Mal'cev and M. 0. Rabin. It is proved that if one data type D is implementable over another data type D', then there exists correctness and performance preserving compiler mapping high level PR-programs over D to low level PR-programs over D'. The compilers from PR to FPIT and from FPIT to PR are defined explicitly, and our compilerexistence proof is constructive, and so this work is the basis of theoretically well-founded software tools for the design and analysis of synchronous algorithms.

A dual-excited synchronous machine is designed and constructed. A power system is simulated using the machine and a medium length transmission line joined to the laboratory bus energized from B.C. Hydro which is considered the infinite bus. The effect of supplemental excitation control on power system stability is investigated. Feedback control is used in both the direct and quadrature fields. Torque angle, speed, power and terminal current signals are compared in their damping action. The response is also calculated from a ninth order mathematical model. It is found that the shaft speed is the best supplemental signal and that the direct and quadrature fields are equally effective in dynamically controlling the machine when operating near rated output. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

In this thesis, resynchronization of a synchronous machine from a slipping state is considered. A set of equations for the slipping machine are developed. Slip tests on a dynamic test model are done to compare with computed results. A critical damping necessary for resynchronization is investigated, and an expression is derived. Tests are again carried out on a power system set up on the dynamic test model to verify the result. Finally, a nonlinear optimal control is developed and implemented on the test model. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate

More-electric aircraft have been the focus of considerable development in recent years. Increased utilisation of electrical systems on-board the latest generation of aircraft has seen an increase in fuel efficiency, through improved electrical derivation from the gas turbine engine and weight savings from the replacement of mechanical and hydraulic transmission systems. The advancement of power electronic and DC breaker devices has led to the reconsideration of DC power distribution systems for standalone networks. Aircraft can benefit from this through the reduced transmission losses, improved controllability and intelligent networking.Through the use of a multiphase synchronous generator, connected to a diode rectifier, a standalone DC network capable of providing power with redundancy can be produced. The aim of this research project is to investigate the effects that phase number, connection topology and winding pitch have on the behaviour of an AC generator connected to a passive diode rectifier. This thesis develops the methodology for determining the number of phases and the topology of the generator. Static and dynamic modelling is conducted through the use of computer finite element modelling and circuit simulation. The dynamic circuit simulation model is configured using parameters obtained from experimental data. The experimental test-rig, which is constructed to be reconfigurable in phase number, connection topology and winding pitch, is used to validate the simulation and provide detailed results on the steady-state operation of the generator-rectifier system. Open-circuit faults are introduced to assess the fault tolerance of the system and the effects of the inherent phase redundancy on the generator performance.