Search Constraints

Start Over
Filtering by: Creator O'Neill, Larry W. Remove constraint Creator: O'Neill, Larry W. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Computing entropy for Z²-actions

    Creator:
    Pierce, Larry A.
    Abstract:
    For a certain class of Z²-actions, we provide a proof of a conjecture that the ratio of the Perron eigenvalues of the transfer matrices of the free boundary restrictions converge to the entropy of that action. Also, a novel method for computing the entropy of Z²-actions is conjectured.
    Resource Type:
    Dissertation
    Full Text:
    thesis_revisions.dvi AN ABSTRACT OF THE DISSERTATION OF Larry A

  • Efficient Algorithms for Robust Spatiotemporal Data Analysis

    Creator:
    Moore, Travis W.
    Abstract:
    Many large-scale data analysis applications involve data that can vary over both time and space. Often the primary goal of analyzing spatiotemporal data is identifying trends, movements, and sudden changes with respect to time, location, or both. This can include a variety of applications in economics (housing prices, unemployment, job...
    Resource Type:
    Dissertation
    Full Text:
    speeding up the SSS (eg. [Neill and Moore, 2004, Neill, 2012]) is not readily applicable. Finally, Moore

  • Probabilistic models for quality control in environmental sensor networks

    Creator:
    Dereszynski, Ethan W.
    Abstract:
    Networks of distributed, remote sensors are providing ecological scientists with a view of our environment that is unprecedented in detail. However, these networks are subject to harsh conditions, which lead to malfunctions in individual sensors and failures in network communications. This behavior manifests as corrupt or missing measurements in the...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Ethan W. Dereszynski for

  • Mixing time for a 3-cycle interacting particle system : a coupling approach

    Creator:
    Eves, Matthew Jasper
    Abstract:
    This thesis examines the mixing times for one-dimensional interacting particle systems. We use the coupling method to study the mixing rates for particle systems on the circle which move according to specific permutations e.g., transpositions and 3-cycles.
    Resource Type:
    Masters Thesis
    Full Text:
    interest k < n. Previous work has shown by various methods that the bound on the mixing time should be O

  • Agile Bipedal Locomotion via Hierarchical Control by Incorporating Physical Principles, Learning, and Optimization

    Creator:
    Green, Kevin
    Abstract:
    Robotic Bipedal locomotion holds the potential for efficient, robust traversal of difficult terrain. The difficulty lies in the dynamics of locomotion which complicate control and motion planning. Bipedal locomotion dynamics are dimensionally large problems, extremely nonlinear, and operate on the limits of actuator capabilities, which limit the performance of generic...
    Resource Type:
    Dissertation

  • Agile Bipedal Maneuvers Optimized then Learned from Single Rigid-Body Model Dynamics

    Creator:
    Batke, Ryan
    Abstract:
    As bipedal robots move ever closer to being integrated into all manner of real world envi-ronments there is a necessity to push their dynamic capabilities to meet or exceed those of humans and animals. Advancements must be made to address ordinary challenges that arise everyday in the same environments that...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 5.4 Extended Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 6

  • Enhancing Search-Based Techniques with Information Control Dependencies

    Creator:
    Aburas, Ali
    Abstract:
    Software testing is a very important task during software development and it can be used to improve the quality and reliability of the software system. One potential way to reduce the cost and increase the efficiency of software testing is to generate test data automatically. Search-based approaches successfully generate unit...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . 23 3.1 foo class . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 39 4.1

  • Toward Automated Decision-Making in Power Systems Wide-Area Protection

    Creator:
    Meier, Richard John
    Abstract:
    In recent years there have been many improvements in the reliability of critical infrastructure systems. Despite these improvements and despite targeted efforts to improve the operation and control of the electric grid, the power systems industry has seen relatively small advances in this regard. For instance, today's power system is...
    Resource Type:
    Masters Thesis
    Full Text:
    algorithm is tested with experiments on the IEEE 39-bus model as well as the 2383- bus Polish model

  • A tool for visualizing sequence alignments and associating annotations

    Creator:
    Zhang, Wenpeng
    Abstract:
    Alignment of genomic sequences from different species is becoming an increasingly powerful method in biology, and is being used for many purposes. The result of sequence alignments is a list of pairs of matched locations between the pattern string and the text string. However, without any proper visualization tools to...
    Resource Type:
    Capstone Project
    Full Text:
    Science Oregon State University AN ABSTRACT OF THE PROJECT OF W enpeng Zhang for the degree of

  • Parsing with Recurrent Neural Networks

    Creator:
    Cross, James Henry, III
    Abstract:
    Machine learning models for natural language processing have traditionally relied on large numbers of discrete features, built up from atomic categories such as word forms and part-of-speech labels, which are considered completely distinct from each other. Recently however, the advent of dense feature representations coupled with deep learning techniques has...
    Resource Type:
    Dissertation
    Full Text:
    result that the entire space of possible parser states for a sentence of length n can be reduced to O