A Comparison of Induction Motor Starting Methods Being Powered by a Diesel-Generator Set

Starting induction motors on isolated or weak systems is a highly dynamic process that can cause motor and load damage as well as electrical network fluctuations. Mechanical damage is associated with the high starting current drawn by a ramping induction motor. In order to compensate the load increase, the voltage of the electrical system decreases. Different starting methods can be applied to the electrical system to reduce these and other starting method issues. The purpose of this thesis is to build accurate and usable simulation models that can aid the designer in making the choice of an appropriate motor starting method. The specific case addressed is the situation where a diesel-generator set is used as the electrical supplied source to the induction motor. The most commonly used starting methods equivalent models are simulated and compared to each other. The main contributions of this thesis is that motor dynamic impedance is continuously calculated and fed back to the generator model to simulate the coupling of the electrical system. The comparative analysis given by the simulations has shown reasonably similar characteristics to other comparative studies. The diesel-generator and induction motor simulations have shown good results, and can adequately demonstrate the dynamics for testing and comparing the starting methods. Further work is suggested to refine the equivalent impedance presented in this thesis.

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.

Generalizing the dynamic field theory of spatial cognition across real and developmental time scales

Within cognitive neuroscience, computational models are designed to provide insights into the organization of behavior while adhering to neural principles. These models should provide sufficient specificity to generate novel predictions while maintaining the generality needed to capture behavior across tasks and/or time scales. This paper presents one such model, the Dynamic Field Theory (DFT) of spatial cognition, showing new simulations that provide a demonstration proof that the theory generalizes across developmental changes in performance in four tasks—the Piagetian A-not-B task, a sandbox version of the A-not-B task, a canonical spatial recall task, and a position discrimination task. Model simulations demonstrate that the DFT can accomplish both specificity—generating novel, testable predictions—and generality—spanning multiple tasks across development with a relatively simple developmental hypothesis. Critically, the DFT achieves generality across tasks and time scales with no modification to its basic structure and with a strong commitment to neural principles. The only change necessary to capture development in the model was an increase in the precision of the tuning of receptive fields as well as an increase in the precision of local excitatory interactions among neurons in the model. These small quantitative changes were sufficient to move the model through a set of quantitative and qualitative behavioral changes that span the age range from 8 months to 6 years and into adulthood. We conclude by considering how the DFT is positioned in the literature, the challenges on the horizon for our framework, and how a dynamic field approach can yield new insights into development from a computational cognitive neuroscience perspective.