Search Constraints

Start Over
Filtering by: Creator Kroll, Andrew J. Remove constraint Creator: Kroll, Andrew J. Degree Field Computer Science Remove constraint Degree Field: Computer Science Non-Academic Affiliation Oregon State University. Graduate School Remove constraint Non-Academic Affiliation: Oregon State University. Graduate School

Search Results

  • 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
    Full Text:
    - Michael J. Quinn Existing parallel file systems are proving inadequate in two important arenas

  • 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

  • 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:
    . 21 Bibliography 1. Quinlan, J. R. (1999). “Some Elements of Machine Learning.” In

  • 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

  • Automatic program generation for scientific computing

    Creator:
    Fu, Zhe
    Abstract:
    The code reuse problem is a common software engineering problem in scientific computing. As a prevailing programming language in many scientific fields, Fortran does not provide support to address this problem. One particular reason is that Fortran lacks the support for generic programming. By applying program-generation techniques, we developed two...
    Resource Type:
    Dissertation
    Full Text:
    )] a2 :: Array (Int,Int) Int a2 = array ((1,1), (3,3)) [((i,j), i*j) | i<-[1..3], j<-[1..3]] The array

  • Layered rendering model for human teeth

    Creator:
    Shetty, Sudarshanram
    Abstract:
    This study introduces a layered model for rendering human teeth. Human teeth exhibit complex light interaction due to their layered structure. While the lighting responses of teeth have been studied in the dental industry for the production of realistic looking dentures, to our knowledge this is the first study of...
    Resource Type:
    Masters Thesis
    Full Text:
    Model for Human Teeth Abstract approved: Michael J. Bailey This study introduces a layered model for

  • Random access machine in secure multi-party computation

    Creator:
    Hu, Zhangxiang
    Abstract:
    Secure multi-party computation (MPC) is a conceptual framework in cryptography. It allows distrusting parties engage in a protocol to perform a computational task while still maintain some secure properties. Most existing approaches are required to interpret functions as a boolean circuit. With the recent state-of-art circuit garbling scheme, the performance...
    Resource Type:
    Masters Thesis
    Full Text:
    approved: Michael J. Rosulek Secure multi-party computation (MPC) is a conceptual framework in

  • 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:
    Abstract approved: __________________________________________ Michael J. Bailey It is possible to

  • Corporate involvement in FOSS projects : an in-depth look at corporate contributions and implications for project governance

    Creator:
    Forrest, Darren J.
    Abstract:
    Free / Open Source Software developers come from a myriad of different backgrounds. While some contribute for personal reasons, many become involved because they receive compensation from corporations or foundations. The motivation for participating in a project can have dramatic impacts on how and what contribution an individual makes. These...
    Resource Type:
    Masters Thesis
    Full Text:
    2 AN ABSTRACT OF THE THESIS OF Darren J. Forrest for the degree of Master of Science in Computer

  • Sequential supervised learning and conditional random fields

    Creator:
    Ashenfelter, Adam J.
    Abstract:
    Supervised learning is concerned with discovering the relationship between example sets of features and their corresponding classes. The traditional supervised learning formulation assumes that all examples are independent from one another. The order of the examples contains no information. Nonetheless, many problems have a sequential nature. Classifiers for these problems...
    Resource Type:
    Masters Thesis
    Full Text:
    thesis.dvi c© Copyright by Adam J. Ashenfelter December 4, 2003