Search Constraints

Start Over
Filtering by: Creator Henderly%2C Herschel H. Remove constraint Creator: Henderly%2C Herschel H. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science

Search Results

  • Distributed OpenCL : a platform for distributed, heterogeneous computing for domain scientists

    Creator:
    Dillon, William H.
    Abstract:
    It is possible to purchase, for as little as $10,000, a cluster of computers with the capability to rival the supercomputers of only a few years ago. Now, users that have little to no experience developing distributed applications or managing a cluster are in a position to do so. To...
    Resource Type:
    Dissertation
    Full Text:
    William H. Dillon for the degree of Doctor of Philosophy in Computer Science presented on May 29, 2012

  • Routerless Network-on-chip

    Creator:
    Alazemi, Fawaz
    Abstract:
    Traditional bus-based interconnects are simple and easy to implement, but the scalability is greatly limited. While router-based networks-on-chip (NoCs) offer superior scalability, they also incur significant power and area overhead due to complex router structures. In this thesis, a new class of on-chip networks, referred to as Routerless (RL) NoCs,...
    Resource Type:
    Dissertation
    Full Text:
    . Rakesh Bobba, and William H. Warnes. • Prof. Ziad Najem for being a role model. • Prof. Mehmet Karaata

  • Deletions and Insertions of the Symbol 0 and Asymmetric/Unidirectional Error Control Codes for the L₁ Metric

    Creator:
    Alqwaifly, Nawaf
    Abstract:
    This work gives some theory and efficient design of binary block codes capable of controlling the deletions of the symbol “0” (referred to as 0-deletions) and/or the insertions of the symbol “0” (referred to as 0-insertions). This problem of controlling 0-deletions and/or 0-insertions (referred to as symmetric 0-errors) is shown...
    Resource Type:
    Dissertation
    Full Text:
    g(z). If g(z)∈F[z] is monic and has the following factorization in F[z], g(z) = h ∏ i=1 [pi(z)]mi

  • Multiple Nonlinear Model Predictive Control for a Six-body System Oscillating Water Column Wave Energy Converters Array

    Creator:
    Xu, Zhicheng
    Abstract:
    This research presents the design of three nonlinear model predictive controllers (NMPCs) for floating oscillating water column (OWC) wave energy converters (WECs) array to maximize generated power, augmented with the control of the high-speed stop valves (HSSVs). Key to this design is the development of a high-fidelity discretized model for...
    Resource Type:
    Masters Thesis
    Full Text:
    Jinsub Kim, and graduate council representative, Prof. William H. Warnes. I truly appreciate the

  • Switch-capacitor Power Amplifier with Enhanced Power Back-off Efficiency and Linearity

    Creator:
    Qiao, Bo
    Abstract:
    Nowadays, wireless communication systems use high-order quadrature amplitude modulation (QAM) together with orthogonal frequency-division multiplexing (OFDM) to increase the link capacity and robustness. These signals always have large peak-to-average power ratio (PAPR) and require power amplifiers (PAs) achieve both high efficiency and linearity simultaneously. For the efficiency, the complementary metal...
    Resource Type:
    Dissertation
    Full Text:
    . Arun Natarajan, Prof. Gabor C. Temes and Prof. William H. Warnes for being committee members during

  • Development of high efficiency solar absorbers

    Creator:
    Ravichandran, Ram
    Abstract:
    Current cadmium telluride and copper indium gallium diselenide thin-film solar cells (TFSCs) utilize thick absorbers (2 - 4 μm). For efficient carrier extraction in these TFSCs, the absorber layer requires high carrier mobilities and a long minority carrier lifetime, which necessitates the use of a high purity, defect-free thin film....
    Resource Type:
    Dissertation
    Full Text:
    strong light-emitting material [8]. hν > EG EC EV Absorption Relaxation/Emission EF hν = EG (a) (b

  • Structural Results and Approximation Algorithms in Minor-free Graphs

    Creator:
    Le, Hung V.
    Abstract:
    Planarity has been successfully exploited to design faster and more accurate approximation algorithms for many graph optimization problems. The celebrated theorem of Kuratowski completely characterizes planar graphs as those excluding K_5 and K_{3,3} as minors. Kuratowski's theorem allows one to generalize planar graphs to H-minor-free graphs: those that exclude a...
    Resource Type:
    Dissertation
    Full Text:
    planar graphs to H-minor-free graphs: those that exclude a fixed graph H as a minor. The deep results of

  • Design of high-performance pipeline analog-to-digital converters in low-voltage processes

    Creator:
    Myers, Charles Grant
    Abstract:
    Pipeline analog-to-digital converters (ADCs) have long been used in high-speed systems for power-efficient data conversion. Broadband communication and video processing systems are placing high demands on converter accuracy and speed (above 14 bits and in the multiple-MHz range). The increasing converter requirements coupled with lower supply voltages in modern processes...
    Resource Type:
    Masters Thesis
    Full Text:
    improved signal power and sample-and-hold (S/H) removal for noise and power savings. The presented

  • New Directions in Search-based Structured Prediction: Multi-Task Learning and Integration of Deep Models

    Creator:
    Ma, Chao
    Abstract:
    This thesis studies the problem of structured prediction (SP), where the agent needs to predict a structured output for a given structured input (e.g., Part-of-Speech tagging sequence for an input sentence). Many important applications including machine translation in natural language processing (NLP) and image interpretation in computer vision can be...
    Resource Type:
    Dissertation
    Full Text:
    Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 5.2.3 H and C Networks

  • On edge disjoint Hamiltonian cycles in torus and Gaussian networks

    Creator:
    Alazemi, Fawaz M.
    Abstract:
    Many algorithms in parallel systems can be easily solved if we can generate a Hamiltonian cycle on the underly network. Finding Hamiltonian cycle is a well known NP-complete problem. For specific instances of regular graphs, such as Torus and Gaussian network, one can easily find Hamiltonian cycles. In this thesis,...
    Resource Type:
    Masters Thesis
    Full Text:
    Gaussian network G bn/2c α , for 1 ≤ 2r ≤ n < 2r+1. c©Copyright by Fawaz M. Alazemi December 4, 2014