Development of fueling technologies for modern and future tokamak reactors is essential for their implementation in a commercial energy production setting. Compared to the presently available fueling technologies, gas or cryogenic pellet injection, compact torus injection presents an effective and efficient method for directly fueling the central core of tokamak plasmas. Fueling of the central core of a tokamak plasma is pivotal for providing efficient energy production. The central core plasma of a reactor contains the greatest density of fusion processes. For consistent and continuous fueling of tokamak fusion reactors, compact torus injectors must be operated in a repetitive mode.<p> The goal of this thesis was to study the feasibility of firing the University of Saskatchewan Compact Torus Injector (USCTI) in a repetitive mode. In order to enable USCTI to fire repetitively, modifications were made to its electrical system, control system and data acquisition system. These consisted primarily of the addition of new power supplies, to enable fast charging of the many capacitor banks used to form and accelerate the plasma. The maximum firing rate achieved on USCTI was 0.33 Hz, an increase from the previous maximum firing rate of 0.2 Hz achieved at UC Davis.<p> Firing USCTI in repetitive modes has been successful. It has been shown that the CTs produced in any given repetitive series are properly formed and repeatable. This is made evident through analysis of data collected from the CTs' magnetic fields and densities as they traveled along the injector barrel. The shots from each experiment were compared to the series' mean data and were shown to be consistent over time. Calculations of their correlations show that there are only minimal deviations from shot to shot in any given series.

Development of fueling technologies for modern and future tokamak reactors is essential for their implementation in a commercial energy production setting. Compared to the presently available fueling technologies, gas or cryogenic pellet injection, compact torus injection presents an effective and efficient method for directly fueling the central core of tokamak plasmas. Fueling of the central core of a tokamak plasma is pivotal for providing efficient energy production. The central core plasma of a reactor contains the greatest density of fusion processes. For consistent and continuous fueling of tokamak fusion reactors, compact torus injectors must be operated in a repetitive mode.<p> The goal of this thesis was to study the feasibility of firing the University of Saskatchewan Compact Torus Injector (USCTI) in a repetitive mode. In order to enable USCTI to fire repetitively, modifications were made to its electrical system, control system and data acquisition system. These consisted primarily of the addition of new power supplies, to enable fast charging of the many capacitor banks used to form and accelerate the plasma. The maximum firing rate achieved on USCTI was 0.33 Hz, an increase from the previous maximum firing rate of 0.2 Hz achieved at UC Davis.<p> Firing USCTI in repetitive modes has been successful. It has been shown that the CTs produced in any given repetitive series are properly formed and repeatable. This is made evident through analysis of data collected from the CTs' magnetic fields and densities as they traveled along the injector barrel. The shots from each experiment were compared to the series' mean data and were shown to be consistent over time. Calculations of their correlations show that there are only minimal deviations from shot to shot in any given series.

In today's high performance computing environment I/O remains the main bottleneck in achieving the optimal performance expected of the ever improving processor and memory technologies. Interconnection networks therefore combines processing units, system I/O and high speed switch network fabric into a new paradigm of I/O based network. It decouples the system into computational and I/O interconnections each allowing "any-to-any" communications among processors and I/O devices unlike the shared model in bus architecture. The computational interconnection, a network of processing units (compute-nodes), is used for inter-processor communication in carrying out computation tasks, while the I/O interconnection manages the transfer of I/O requests between the compute-nodes and the I/O or storage media through some dedicated I/O processing units (I /O-nodes). Considering the special functions performed by the I/O nodes, their placement and reliability become important issues in improving the overall performance of the interconnection system. This thesis focuses on design and topological placement of I/O-nodes in torus based interconnection networks, with the aim of reducing I/O communication latency between compute-nodes and I/O-nodes even in the presence of faulty I/O-nodes. We propose an efficient and scalable relaxed quasi-perfect placement scheme using Lee distance error correction code such that compute-nodes are at distance-t or at most distance-t+1 from an I/O-node for a given t. This scheme provides a better and optimal alternative placement than quasi perfect placement when perfect placement cannot be found for a particular torus. Furthermore, in the occurrence of faulty I/O-nodes, the placement scheme is also used in determining other alternative I/O-nodes for rerouting I/O traffic from affected compute-nodes with minimal slowdown. In order to guarantee the quality of service required of inter-processor communication, a scheduling algorithm was developed at the router level to prioritize message forwarding according to inter-process and I/O messages with the former given higher priority. Our simulation results show that relaxed quasi-perfect outperforms quasi-perfect and the conventional I/O placement (where I/O nodes are concentrated at the base of the torus interconnection) with little degradation in inter-process communication performance. Also the fault tolerant redirection scheme provides a minimal slowdown, especially when the number of faulty I/O nodes is less than half of the initial available I/O nodes.

<p>Let X be a smooth projective variety over C equipped with a C*-action whose fixed points are isolated. Let Y and Z be subvarieties of complementary dimentions in X which intersect properly. In this thesis we present an algorithm for computing the points of intersection between Y and Z based on homotopy continuation and the Bialynicki-Birula decompositions of X into locally closed invariant subsets. As an application we present a new solution to the inverse kinematic problem of a general six-revolute serial-link manipulator.</p>

Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI/Dissertation Abstracts International.

Not available / text

Not available / text

No description available.

Thesis (Ph. D.)--University of Washington, 1992. / Vita. Includes bibliographical references (leaves [104]-105).

Thesis (M.Sc.) - Carleton University, 2006. / Includes bibliographical references (p. 162-164). Also available in electronic format on the Internet.