Search Constraints

Start Over
Filtering by: Creator Danko, Joseph P. Remove constraint Creator: Danko, Joseph P. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Non-Academic Affiliation Oregon State University. Graduate School Remove constraint Non-Academic Affiliation: Oregon State University. Graduate School

Search Results

  • Interactive fault localization techniques to empower the debugging efforts of end-user programmers

    Creator:
    Ruthruff, Joseph Ronald
    Abstract:
    End users develop more software than any other group of programmers, using software authoring devices such as e-mail filtering editors, by-demonstration macro builders, and spreadsheet environments. Despite this, there has been only a little research on finding ways to help these programmers with the dependability of the software they create....
    Resource Type:
    Masters Thesis
    Full Text:
    thesis.dvi AN ABSTRACT OF THE THESIS OF Joseph Ronald Ruthrufffor the

  • OME : A Framework for Running Spatially Explicit System Dynamics Models

    Creator:
    Wingo, Patrick C.
    Abstract:
    The Open Modeling Environment (OME) is a tool developed to address some known shortcomings in ecological System Dynamics (SD) modeling research. OME provides a common set of methods for interacting directly with spatial information, reducing the need for modelers to create their own methods for doing so. The environment is...
    Resource Type:
    Masters Thesis
    Full Text:
    Framework for Running Spatially Explicit System Dynamics Models. Abstract approved: John P. Bolte

  • Learning multiple non-redundant codebooks with word clustering for document classification

    Creator:
    Surve, Akshat Sudhakar
    Abstract:
    The problem of document classification has been widely studied in machine learning and data mining. In document classification, most of the popular algorithms are based on the bag-of-words representation. Due to the high dimensionality of the bag-of-words representation, significant research has been conducted to reduce the dimensionality via different approaches....
    Resource Type:
    Masters Thesis
    Full Text:
    formation of a new technique called the probabilistic Latent Semantic Analysis (p-LSA) model (Hofmann

  • Learning greedy policies for the easy-first framework

    Creator:
    Xie, Jun
    Abstract:
    Easy-first, a search-based structured prediction approach, has been applied to many NLP tasks including dependency parsing and coreference resolution. This approach employs a learned greedy policy (action scoring function) to make easy decisions first, which constrains the remaining decisions and makes them easier. This thesis studies the problem of learning...
    Resource Type:
    Masters Thesis
    Full Text:
    average of MUC, B3, and CEAF-φ4 scores [30]. 16 MUC B3 CEAF-φ4 Approach R P F1 R P F1 R P F1 CoNLL F1

  • 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:
    constraints; “R-C”: abc̄, ab̄c, ābc relative constraints; “P”: pairwise constraints; “-all”: total number

  • 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:
    distribution. Let the MDP be defined byM = 〈S,A, P,R, γ, P0〉, where S is a finite set of (discrete) states of

  • Improving automated email tagging with implicit feedback

    Creator:
    Sorower, Mohammad Shahed
    Abstract:
    Machine learning systems are generally trained offline using ground truth data that has been labeled by experts. However, these batch training methods are not a good fit for many applications, especially in the cases where complete ground truth data is not available for offline training. In addition, batch methods do...
    Resource Type:
    Dissertation
    Full Text:
    probability distribution, P(EF | totalIF). . . . . . . . . . . . . 31 4.2 Implicit feedback captured during

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    Member (Timothy A. Budd) Committee Member (Prasad Tadepalli) uate School Representative (John P

  • The density signature

    Creator:
    Migler-VonDollen, Theresa
    Abstract:
    In real networks, identifying dense regions is of great importance. For example, in a network that represents academic collaboration, authors within the densest component of the graph tend to be the most prolific. Dense subgraphs often identify communities in social networks. And dense subgraphs can be used to discover regulatory...
    Resource Type:
    Dissertation
    Full Text:
    grateful Auntie Theresa. For my brother Joseph, thank you for your support, understanding, and encourage­

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    for computing a p-safe uniform schedule with maximum number of stages given the scheduling