Search Constraints

Start Over
Filtering by: Creator Opnai, L. Joel Remove constraint Creator: Opnai, L. Joel Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • A block method approach to solving the Laplace equation on a parallel computer

    Creator:
    Hitchcock, Paula Ann
    Abstract:
    This paper continues exploration in the area of programming for parallel computers. The appendix to the paper contains an extensive survey of the literature related to parallel computers and parallel programming techniques. The paper itself presents a new approach to solving the Laplace equation on a. parallel computer. A new...
    Resource Type:
    Masters Thesis
    Full Text:
    : Joel Davis This paper continues exploration in the area of programming for parallel computers. The

  • Computer techniques yielding automatic and rigorous solutions to linear and nonlinear integral equations

    Creator:
    Winter, Lynn Taylor
    Abstract:
    Interval arithmetic is applied to the problem of obtaining rigorous solutions to integral equations on a computer. The integral equations considered are the linear Fredholm equation of the second kind and the nonlinear Urysohn equation. Techniques are presented which enable the computer to find an approximate solution, prove the existence...
    Resource Type:
    Masters Thesis
    Full Text:
    approved: Redacted for privacy Joel Davis Interval arithmetic is applied to the problem of obtaining

  • COMPLOT : Combined PLOT drivers for Tektronix graphic terminals, Calcomp and Hewlett Packard plotters

    Creator:
    Hubble, Larry Robert
    Abstract:
    COMPLOT is a versatile set of plot drivers designed to be used on a Tekterminal, Calcomp, or Hewlett Packard plotter in a time-sharing environment. Although the hardware aspects of each plotting device are quite different, COMPLOT allows the plotting devices to be treated as if they were the same.
    Resource Type:
    Masters Thesis
    Full Text:
    for privacy Abstract approved: Joel Davis COMPLOT is a versatile set of plot drivers designed to be

  • A compiler-compiler for the CDC 3300

    Creator:
    Rucker, Jimmy Ivan
    Abstract:
    This thesis describes a syntax-directed compiler-compiler called COMCOM which has been implemented by the author on the CDC 3300 under the OS-3 operating system. The theory and terminology of the parsing method and compiler-compilers in general are briefly discussed. COMCOM uses Floyd's operator precedence bottom-up parsing technique which avoids backup...
    Resource Type:
    Masters Thesis
    Full Text:
    : Redacted for privacy Curtis R. Cook and Joel Davis This thesis describes a syntax-directed compiler

  • An editor for message passing programs

    Creator:
    Pai, Akash L.
    Abstract:
    Preparing code for parallelization is one of the most time consuming programming tasks; approximately 24% of the program development activity is spend in this phase. In message passing systems, this is usually achieved by the addition of run-time message-passing library calls. The primitives provided by different message-passing libraries are similar,...
    Resource Type:
    Capstone Project
    Full Text:
    ) An Editor for Message Passing Programs by Akash L

  • Characterizing and Addressing Dataset Shift with Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    This dissertation delves into understanding, characterizing, and addressing dataset shift in deep learning, a pervasive issue for deployed machine learning systems. Integral aspects of the problem are examined: We start with the use of counterfactual explanations in order to characterize the behavior of deep reinforcement learning agents in visual input...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Matthew L

  • Improving the Effectiveness of Answering Keyword Queries Using Effective Subsets

    Creator:
    Khodadadi, Abtin
    Abstract:
    Most database users do not know formal query languages, such as SQL, and prefer to express their information needs using usable query languages, such as keyword queries. Keyword queries, however, are inherently ambiguous and challenging for the database systems to understand and answer effectively. We propose a novel approach to...
    Resource Type:
    Capstone Project
    Full Text:
    Conference on Management of data, pages 1005–1010. ACM, 2009. [13] Joel Coffman and Alfred C Weaver. A

  • Re-understanding Finite-State Representations of Recurrent Policy Networks

    Creator:
    Danesh, Mohamad H.
    Abstract:
    We propose an approach for understanding control policies represented as recurrent neural networks. Recent work has approached this problem by transforming such recurrent policy networks into finite-state machines (FSM) and then analyzing the equivalent minimized FSM. While this led to interesting insights, the minimization process can obscure a deeper understanding...
    Resource Type:
    Masters Thesis
    Full Text:
    58 50 0 2 4 5 5 0 0 3 3 1 1 5 00 L u n ar L an d er 32 32 1 95 14 26 11 50 18 0. 48

  • Knowledge Base Completion Leveraging Natural Language Data

    Creator:
    Shahbazi, Hamed
    Abstract:
    Information about named entities (real-world objects) is usually harvested from different sources and organized as a multiple relational directed graph in Knowledge Bases (KBs). KBs play essential roles in many NLP modules including question answering, fact-checking, search engines, etc. KBs are big but still incomplete: relational information among entities is...
    Resource Type:
    Dissertation
    Full Text:
    , ...yik} over context wi as ci = m∑ l=1 αilwil (2.2) The weight vector α is computed using the

  • How do Programmers Forage through Variants? Modeling Hierarchical Foraging and Changelogs

    Creator:
    Pandya, Bhargav Chandravadan
    Abstract:
    Complex information environments are often organized as hierarchies. However, computational models of Information Foraging Theory (IFT) have almost entirely ignored this fact. Models and tools for predicting programmer navigations have ignored people’s foraging behavior across hierarchies —called hierarchical foraging. Without modeling hierarchical foraging, our ability to build tools to support...
    Resource Type:
    Masters Thesis
    Full Text:
    . • For each level L of patches in the patch hierarchy (from top to bottom): o Spread activation from