Search Constraints

Start Over
Filtering by: Creator Pinkerton, J. N. Remove constraint Creator: Pinkerton, J. N. Committee Member Bose, Bella Remove constraint Committee Member: Bose, Bella

Search Results

  • Implementation of processor allocation in an N-Cube multiprocessor on Macintosh

    Creator:
    Liu, Jinyue
    Abstract:
    The processor allocation in an n-dimensional hypercube multiprocessor using buddy strategy, gray code strategy, and a new strategy is implemented on Macintosh. Our implementations show that when processor relinquishment is not considered (i.e. static allocation), all these strategies are optimal in the sense that each incoming request sequence is always...
    Resource Type:
    Capstone Project
    Full Text:
    State University Corvallis, Oregon April, 1990 l fl n n n n I l d 1 I IH d l J u

  • Target-based coverage extension of 802.11 MANETs via constrained UAV mobility

    Creator:
    Johnson, Taylor N.
    Abstract:
    MANETs are known to be useful in situations where mobile nodes need to communicate and coordinate in dynamic environments with no access to fixed network infrastructure. However, connectivity problems can occur when sub-groups within a MANET move out of communication range from one another. The increasingly prolific use of UAVs...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Taylor N. Johnson for the

  • Dynamic and Dual Streaming Methods for H.264 Video and Parallel Performance Modeling

    Creator:
    Johnson, Taylor N.
    Abstract:
    Traditional approaches to streaming H.264 video over a network typically rely on a single method of transport (i.e., reliable or unreliable) and/or use static values for parameters that can have a significant negative impact on the perceptual quality of the received video. This dissertation presents a dynamic method for wireless...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Taylor N. Johnson for the

  • Translating MATLAB scripts into SPMD-style parallel programs

    Creator:
    Seelam, Nagajagadeswar Reddy
    Abstract:
    In this report., we address the issues of translating MATLAB scripts into SPMD-style C programs. The resulting programs, when linked with our run-time library are suitable for execution on parallel computers. We describe the design of the compiler and improvements made to it in the current version. We also describe...
    Resource Type:
    Capstone Project
    Full Text:
    Programs N agajagadeswar Reddy Seelam Major Professor: Dr. Michael J. Quinn A Research Paper

  • WebWEPP version 2.0 : Web-based water erosion prediction project

    Creator:
    Gyu Han, Hong
    Abstract:
    The WEPP (Water Erosion Prediction Project) application computes soil loss and sediment yield from a field based on the data on crops, management practices, and operations. In order to make WEPP, which is a Windows-based application, easily accessible, Web WEPP (Web-based WEPP) was developed by our research group. Web WEPP...
    Resource Type:
    Capstone Project
    Full Text:
    .=" eoun11es ' ! p ,,, US/Stale t· l '\ Hishways ) ! ; I ·P'. N Interstate t '- / Highways j ij,,J

  • A pipelined baseband digital predistortion architecture for RF amplifier linearization

    Creator:
    Xu, Xiangqing
    Abstract:
    This thesis describes the design of a baseband digital predistortion architecture for radio frequency (RF) amplifier linearization. Existing amplifier linearization techniques are first examined. The nonlinearity of an amplifier can be characterized as amplitude-to-amplitude distortion and amplitude-to-phase distortion. The distortion can be corrected by providing a predistorted driver signal (both...
    Resource Type:
    Masters Thesis

  • Maximum flow in planar digraphs

    Creator:
    Harutyunyan, Anna
    Abstract:
    Worst-case analysis is often meaningless in practice. Some problems never reach the anticipated worst-case complexity. Other solutions get bogged down with impractical constants during implementation, despite having favorable asymptotic running times. In this thesis, we investigate these contrasts in the context of finding maximum flows in planar digraphs. We suggest...
    Resource Type:
    Masters Thesis
    Full Text:
    planar graphs is an augmenting- paths algorithm with O(n) iterations. Using dynamic trees, each

  • Low-complexity high-speed VLSI design of low-density parity-check decoders

    Creator:
    Cui, Zhiqiang
    Abstract:
    Low-Density Parity-check (LDPC) codes have attracted considerable attention due to their capacity approaching performance over AWGN channel and highly parallelizable decoding schemes. They have been considered in a variety of industry standards for the next generation communication systems. In general, LDPC codes achieve outstanding performance with large codeword lengths (e.g.,...
    Resource Type:
    Dissertation
    Full Text:
    ., N>1000 bits), which lead to a linear increase of the size of memory for storing all the soft

  • Responder tracking application

    Creator:
    Wanalertlak, Naroot
    Abstract:
    We have developed a prototype web-based GIS application for tracking the locations of moving entities. This application, which is called the Responder application, consists of two parts: the Responder client and the Responder server. The Responder client is a .NET application written in C#. It reads the location data from...
    Resource Type:
    Capstone Project
    Full Text:
    l n n n n l 1 ) I I I J J I J u

  • Scheduling system of affine recurrence equations by means of piecewise affine timing functions

    Creator:
    Mui, Lap K.
    Abstract:
    Many systematic methods exist for mapping algorithms to processor arrays. The algorithm is usually specified as a set of recurrence equations, and the processor arrays are synthesized by finding timing and allocation functions which transform index points in the recurrences into points in a space-time domain. The problem of scheduling...
    Resource Type:
    Masters Thesis
    Full Text:
    three equations: tii, j) = i + j; for 0 ..'c. i, j N A piecewise affine schedule can also be found for