Search Constraints

Start Over
Filtering by: Creator Bogan, Michael T. Remove constraint Creator: Bogan, Michael T. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    OF Michael S. Wynkoop for the degree of Masters of Science in Computer Science presented on June 9

  • Physical activity recognition of free-living data using change-point detection algorithms and hidden Markov models

    Creator:
    Anderson, Michael M.
    Abstract:
    Physical activity recognition using accelerometer data is a rapidly emerging field with many real-world applications. Much of the previous work in this area has assumed that the accelerometer data has already been segmented into pure activities, and the activity recognition task has been to classify these segments. In reality, activity...
    Resource Type:
    Masters Thesis
    Full Text:
    Change-Point Detection Algorithms and Hidden Markov Models AN ABSTRACT OF THE THESIS OF Michael M

  • Porting and optimizing a routing library for C* on the iPSC/860

    Creator:
    Uberoy, Chetan
    Abstract:
    High level data-parallel languages are easy to use and shield the programmer from machine specific details. A simple and efficient way of providing an interface to such languages is to develop a machine-independent compiler and a routing library, which isolates the low-level machine dependent communication functions, The compiler translates the...
    Resource Type:
    Capstone Project
    Full Text:
    requirements for the degree of Master of Science Major Professor: Dr. Michael J. Quinn Minor Professor

  • Porting and optimizing a routing library for Dataparallel C on the nCUBE 2 system

    Creator:
    Sivaramapuram, Krishna
    Abstract:
    Dataparallel C has been designed for various kinds of architectures and was devel­oped jointly at University of New Hampshire and Oregon State University. This project dealt with porting the libraries to the nCUBE 2 system and helping a user compile his programs on nCUBE 2 directly from a Sun workstation...
    Resource Type:
    Capstone Project
    Full Text:
    Professor : Dr. Michael J. Quinn Minor Professor : Dr. Lawrence A. Crowl Committee Member : Dr. Tadepalli

  • A C* development environment for the Meiko CS-2 multicomputer

    Creator:
    Zhang, Chung
    Abstract:
    With sequential computing technology reaching its speed limits, parallel processing is emerg­ing as the key to very-high-speed computation. However, developing a parallel program is by no means a simple task; neither is analyzing the performance of parallel programs. C* is a high-level data-parallel language that hides explicit message passing and...
    Resource Type:
    Capstone Project
    Full Text:
    Corvallis, OR 97331 zhangch@research. cs. orst. edu Major Professor: Dr. Michael J. Quinn Minor

  • Update programming -- a safe approach to software maintenance

    Creator:
    Ren, Deling
    Abstract:
    Software maintenance accounts for a large portion of the software development cost, particularly the process of updating programs either to adapt for requirement change or to enhance design or efficiency. Currently, program updates are generally performed manually by programmers using text editors. This is an unreliable method because syntax and...
    Resource Type:
    Dissertation
    Full Text:
    =LeEK587;3<14M;+47�F;3N14+Z38cZL�L�(D*;+ M;Fb9dc|58$/E (D*�M;Fb9dc|58$:&ucZ*;+ZMdcZ+4$'E/\C…t*�587,()E^9;()E

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    Approved by Committee: Major Professor (Bruce D'Ambrosio) Committee Member (Michael Quinn) Committee

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    (Michael Quinn) Committee Member (Prasad Tadepalli) Graduate School Representative (David Birks) Date

  • Scale effects on reinforced concrete beams strengthened for shear with discrete externally bonded carbon fiber-reinforced polymer U-wraps

    Creator:
    Dawson, Matthew Ryan
    Abstract:
    Current ACI design provisions for shear in reinforced concrete (RC) beams strengthened with externally bonded carbon fiber-reinforced polymer (CFRP) U-wraps may not adequately account for the effect of scale. This paper describes tests of 6 geometrically scaled beams to identify possible scale effects of such beams. Results indicated that effective...
    Resource Type:
    Masters Thesis
    Full Text:
    based on tests of 12 T-beams without transverse steel reinforcement. Eight of those beams were

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    Tadepalli provided useful feedback on EBL related issues and proof-read most of my papers. Michael Scanlan