Search Constraints

Start Over
Filtering by: Creator Turina, Claire B. Remove constraint Creator: Turina, Claire B. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Deep Learning Temporal Logic Specifications

    Creator:
    Hekkala, Claire M.
    Abstract:
    This thesis seeks to explain a new method of extracting temporal logic formulas from time series data using machine learning. Two strategies were followed during the development of this research: first, a generative adversarial network was combined with already-existing temporal logic extraction code by Belta. This was achieved by injecting...
    Resource Type:
    Honors College Thesis
    Full Text:
    Claire Hekkala A THESIS submitted to Oregon State University

  • Gender and participation in early stages of the free/open source software joining process

    Creator:
    Gilbertson, Claire E.
    Abstract:
    Free/Open Source Software (FOSS) is a powerful development paradigm for creating software. Increasingly more FOSS projects, like Firefox and Android, are integrated into mainstream technology. It is important that FOSS projects serve its diverse user base well. Several surveys have found that existing FOSS communities are very homogenous populations and...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Claire E

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    confidence interval should be employed to bound the optimality of the policy and (b) how should samples be

  • Learning with Partial Supervision for Clustering and Classification

    Creator:
    Pei, Yuanli
    Abstract:
    In the field of machine learning, clustering and classification are two fundamental tasks. Traditionally, clustering is an unsupervised method, where no supervision about the data is available for learning; classification is a supervised task, where fully-labeled data are collected for training a classifier. In some scenarios, however, we may not...
    Resource Type:
    Dissertation
    Full Text:
    bag-level labels; b) clustering with constraints, where the partial supervision is expressed as

  • Machine learning methods for public policy : simulation, optimization, and visualization

    Creator:
    McGregor, Sean
    Abstract:
    Society faces many complex management problems, particularly in the area of shared public resources such as ecosystems. Existing decision making processes are often guided by personal experience and political ideology rather than state-of-the-art scientific understanding. This dissertation envisions a future in which multiple stakeholders are provided with computational tools for...
    Resource Type:
    Dissertation
    Full Text:
    immensely. My collaborators in forestry economics, especially Claire Montgomery and Rachel Houtman

  • A Structural Theorem For Shortest Vertex-Disjoint Paths Computation in Planar Graphs

    Creator:
    Zafarani, Farzad
    Abstract:
    Given k terminal pairs (s₁,t₁),(s₂,t₂),..., (s[subscript k],t[subscript k]) in an edge-weighted graph G, the k Shortest Vertex-Disjoint Paths problem is to find a collection P₁, P₂,..., P[subscript k] of vertex-disjoint paths with minimum total length, where P[subscript i] is an s[subscript i]-to-t[subscript i] path. As a special case of the...
    Resource Type:
    Masters Thesis
    Full Text:
    Untwisting chains of bigons Let Γ = OPTk−1 and Π = OPTk. A free bigon B is a connected component of R2\(Γ∪Π

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation
    Full Text:
    | ≥ |O| − |B| where B will be the multiset of boundary vertices. Since |B| is at most O(|X|/�), we can

  • Investigating the Effect of Using Mobile Touchscreen Device on Children's Tactile Skills

    Creator:
    Almurshed, Rana
    Abstract:
    To users, mobile touchscreen devices have appealing characteristics; among these characteristics is intuitiveness, which leads to mobile devices being used almost everywhere by almost everyone to accomplish almost anything. This statement, to some degree, holds for children too. Despite touchscreen devices’ intuitiveness and popularity, we don’t know much about how...
    Resource Type:
    Dissertation
    Full Text:
    RECOMMENDATIONS FROM SURVEYED LITERATURE (BY AGE) ........................................ 51 APPENDIX B: FAMILY

  • A domain-specific embedded language for probabilistic programming

    Creator:
    Kollmansberger, Steven
    Abstract:
    Functional programming is concerned with referential transparency, that is, given a certain function and its parameter, that the result will always be the same. However, it seems that this is violated in applications involving uncertainty, such as rolling a dice. This thesis defines the background of probabilistic programming and domain-specific...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80 APPENDIX B Source Code Availability

  • Building Self Adaptive Software Systems via Test-based Modifications

    Creator:
    Christi, Arpit M.
    Abstract:
    Building software systems that adapt to the changing environment is challenging. Developers cannot anticipate all the changes in advance, and even if they could, the effort required to handle such situations is too onerous for practical purposes. Self Adaptive Software (SAS) adapts itself as per changing environment. The area of...
    Resource Type:
    Dissertation
    Full Text:
    transmit ",b,"bytes"); ... if (failed) { log.error("Transmit ",b," failed"); handle_failure(); } else