Search Constraints

Start Over
Filtering by: Creator Thompson, Andrew R. Remove constraint Creator: Thompson, Andrew R. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Interactive visualization of Douglas fir forest growth using 3-PG

    Creator:
    Thompson, Allison
    Abstract:
    Forests are important to Oregon for their beauty as well as economic value, and Douglas fir trees are among the most common and important in the state. Managing and monitoring Oregon’s forests is imperative to ensure they can remain healthy and productive. One tool that helps forest scientists to understand...
    Resource Type:
    Honors College Thesis
    Full Text:
    Growth Using 3-PG by Allison Thompson A THESIS submitted to

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Andrew Emmott for the

  • Mental Models of Mere Mortals with Explanations of Reinforcement Learning

    Creator:
    Anderson, Andrew A.
    Abstract:
    How should reinforcement learning (RL) agents explain themselves to humans not trained in AI? To gain insights into this question, we conducted a 124 participant, four-treatment experiment to compare participants’ mental models of an RL agent in the context of a simple Real-Time Strategy (RTS) game. The four treatments isolated...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Andrew A. Anderson for the

  • New Strategies to Develop Hidden Markov Models Combining KEGG and Pfam

    Creator:
    Gupta, Sonica
    Abstract:
    Profile Hidden Markov Models utilize the information stored in a multiple sequence alignment such as its residues and conserved regions to assign probabilities at each column. This indicates areas in the sequences where similar functionality is observed. These probability weights are then combined to assign a sequence score, which is...
    Resource Type:
    Honors College Thesis
    Full Text:
    _____________________________________________________________________ Andrew Thurber, Committee Member, representing Department of Microbiology

  • MARLA : a chess playing program

    Creator:
    Rood, Andrew Lloyd
    Abstract:
    MARLA is a collection of FORTRAN routines which implements the Shannon-type-chess program with alphabeta cutoffs occurring dynamically. Board positions are updated incrementally. Also involved in position analysis is a production system which models the human chess player's advice-taking, theme, and chess learning in a general sense. Interfacing these two sections,...
    Resource Type:
    Masters Thesis
    Full Text:
    . MARLA: A Chess Playing Program by Andrew Lloyd Rood A THESIS submitted to Oregon State University

  • High-performance data-parallel input/output

    Creator:
    Moore, Jason Andrew
    Abstract:
    Existing parallel file systems are proving inadequate in two important arenas: programmability and performance. Both of these inadequacies can largely be traced to the fact that nearly all parallel file systems evolved from Unix and rely on a Unix-oriented, single-stream, block-at-a-time approach to file I/O. This one-size-fits-all approach to parallel...
    Resource Type:
    Dissertation

  • Learning classification rules by randomized iterative local search

    Creator:
    Chisholm, Michael (Michael Andrew), 1974-
    Abstract:
    Learning easily understandable decision rules from examples is one of the classic problems in machine learning. Most learning algorithms for this problem employ some variation of a greedy separate-and-conquer algorithm. In this paper, we describe a system called LERILS that learns highly accurate and comprehensible rules from examples using a...
    Resource Type:
    Masters Thesis
    Full Text:
    */ for r = 1 to M do pick random seed example of class c and create rule rule from it for t

  • PC++ : an extension of C++ for parallel programming

    Creator:
    Bae, Myungmun
    Abstract:
    Understanding of techniques that can be used to develop software for various parallel machines has not fully matched the dramatic progress in hardware in recent years. Most parallel programming techniques have been closely tied to specific hardware. Different machines have different primitives and architectures. Programming and porting an application with...
    Resource Type:
    Capstone Project
    Full Text:
    ) }; int open() . close (); activity: slave[5] read(cha r *, int); slave[5] write(char *• in t); slave

  • Balanced codes

    Creator:
    Al-Bassam, Sulaiman
    Abstract:
    Balanced codes, in which each codeword contains equally many 1's and 0's, are useful in such applications as in optical transmission and optical recording. When balanced codes are used, the same number of 1's and 0's pass through the channel after the transmission of every word, so the channel is...
    Resource Type:
    Dissertation
    Full Text:
    him for that and for his guidance and support for many years. I would like to thank Dr. Andrew Klein

  • A two level minimal perfect hash function for large data sets

    Creator:
    Barrar, Howard
    Abstract:
    Recently several minimal perfect hashing functions far small static word sets have been developed. However, they are limited to sets of 50 words or less. In this paper, a Two Level Minimal Perfect Hash Function for large data sets is given. It partitions a large static set into small sets...
    Resource Type:
    Capstone Project
    Full Text:
    Theorem that always generate solutions; howev•r, it is much slower than the backtracking algorithms