Search Constraints

Start Over
Filtering by: Creator True, K. Remove constraint Creator: True, K. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Calibrating the highway safety manual predictive methods for Oregon rural state highways

    Creator:
    Xie, Fei
    Abstract:
    The first edition of the Highway Safety Manual (HSM) provides a quantitative approach to predict the safety of transportation facilities based on the recently developed scientific methods. This approach, known as the predictive method, was developed for several states in the United States. Due to differences in driver population, weather...
    Resource Type:
    Masters Thesis
    Full Text:
    : _____________________________________________________________________ Karen K. Dixon The first edition of the Highway Safety Manual (HSM) provides a quantitative

  • Towards reliable and survivable ocean wave energy converters

    Creator:
    Brown, Adam C.
    Abstract:
    Ocean wave energy is a new and developing field of renewable energy with great potential. The energy contained in one meter of an average wave off the coast of Newport Oregon could supply dozens of homes with electricity. However, ocean waves are usually quite irregular which leads to large bursts...
    Resource Type:
    Masters Thesis

  • Incorporating User Feedback into Machine Learning Systems

    Creator:
    Das, Shubhomoy
    Abstract:
    Although machine learning systems are often effective in real-world applications, there are situations in which they can be even better when provided with some degree of end user feedback. This is especially true when the machine learning system needs to customize itself to the end user's preferences, such as in...
    Resource Type:
    Dissertation
    Full Text:
    even better when provided with some degree of end user feedback. This is especially true when the

  • Anomaly Detection: Theory, Explanation and User Feedback

    Creator:
    Siddiqui, Md Amran
    Abstract:
    Anomaly detection has been used in variety of applications in practice, including cyber-security, fraud detection and detecting faults in safety critical systems, etc. Anomaly detectors produce a ranked list of statistical anomalies, which are typically examined by human analysts in order to extract the actual anomalies of interest. Unfortunately, most...
    Resource Type:
    Dissertation
    Full Text:
    form of true/false positive feedback from the analyst. We show empirically the efficacy and the

  • 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:
    select k ≥ 1 points to be evaluated. The results of those points are then added to the set of

  • 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:
    . The last part of the thesis gives results on generating edge disjoint Hamilto­ nian cycles in k-ary n

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    4.4.5 Condition on the Step Size Schedule {αk} . . . . . . . . 102 4.4.6 Conclusions of the Convergence

  • Nonuniform Sampling Of Band-limited Functions

    Creator:
    Al-Hammali, Hussain Y.
    Abstract:
    In this thesis, we will study certain generalizations of the classical Shannon Sampling Theorem, which allows for the reconstruction of a pi-band-limited, square-integrable function from its samples on the integers. J. R. Higgins provided a generalization where the integers can be perturbed by less than 1/4, which includes nonuniform and...
    Resource Type:
    Dissertation
    Full Text:
    , t 2 R, (1.1) for some function g 2 L2(�⇡,⇡), then f can be reconstructed from its samples, f(k), k

  • A study on student perceptions of principles of logic and their application to the principle of mathematical induction

    Creator:
    Boone, Allan R.
    Abstract:
    The purpose of this article is to explore student reasoning with regard to problems in logic, particularly those related to the Principle of Mathematical Induction (PMI). The five case studies presented build off of work done by other researchers, most notably Dubinsky and Harel, who both looked at how students'...
    Resource Type:
    Masters Thesis
    Full Text:
    𝑃(1), 𝑃(2), … be a sequence of statements involving 1,2,… respectively. Then if 𝑃(1) is true and

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    Influence Relations 109 5.3 Example of Compiling maintain-true 112 5.4 Geometric Intersection 119 6

  • Reinforcement learning-based off-equilibrium incentives to approximate the VCG mechanism

    Creator:
    Moissinac, Béatrice
    Abstract:
    Auctions are used to solve resource allocation problem between many agents and many items in real-world settings. Unfortunately, in most cases, it is possible for selfish agents to manipulate the system for their own interest at the expense of the social welfare. Such manipulation can be prevented using the Vickrey-Clarke-Groves...
    Resource Type:
    Masters Thesis
    Full Text:
    . ~k∗ denotes the set of optimal allocation. • Θ is a non-empty set of true type: ∀i ∈ N , ∃θi ∈ Θ. 1

  • Scheduling and Online Planning in Stochastic Diffusion Networks

    Creator:
    Xue, Shan
    Abstract:
    Diffusion processes in networks are common models for many domains, including species colonization, information/idea cascade, disease propagation and fire spreading. In diffusion networks, a diffusion event occurs when a behavior spreads from one node to the other following a probabilistic model, where the behavior could be species, an idea, a...
    Resource Type:
    Dissertation
    Full Text:
    marketing setting, Kempe et al. [34] address the problem of selecting k of individuals to initiate a

  • Machine learning for improving the quality of citizen science data

    Creator:
    Yu, Jun
    Abstract:
    Citizen Science is a paradigm in which volunteers from the general public participate in scientific studies, often by performing data collection. This paradigm is especially useful if the scope of the study is too broad to be performed by a limited number of trained scientists. Although citizen scientists can contribute...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 5.4 The average log-likelihood on the holdout data for different values of K in four states. The

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    characterized as a graph that is the cross product of cycles. The graphs of the k-ary n-cube (Qk,,) and the

  • Object highlighting : real-time boundary detection using a Bayesian network

    Creator:
    Jia, Jin
    Abstract:
    Image segmentation continues to be a fundamental problem in computer vision and image understanding. In this thesis, we present a Bayesian network that we use for object boundary detection in which the MPE (most probable explanation) before any evidence can produce multiple non-overlapping, non-self-intersecting closed contours and the MPE with...
    Resource Type:
    Masters Thesis
    Full Text:
    = (X, L). X is the set of nodes which corresponding to random variables, each having two states: true

  • 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:
    spectral clustering. CSP is the proposed spectral clustering with bag constraints. . 15 2.2 Scenario of K

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    matrix and the entry Bjk represents the probability of observation k being generated by state j. The

  • 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:
    [27] introduce a soft k-max attention model to weigh the importance of other entities in the document

  • Learning and Improving Policies for Probabilistic Planning Problems

    Creator:
    Issakkimuthu, Murugeswari
    Abstract:
    In this work, we study the problem of learning and improving policies for probabilistic planning problems. In the first part, we train neural network policies for probabilistic planning problems modeled as factored Markov decision problems. The objective is to train problem-specific neural networks via supervised learning to imitate the action...
    Resource Type:
    Dissertation
    Full Text:
    nodes (I l k) in the previous layer Z l−1 via real-valued weights, where wli,k is the weight from z l

  • Variational Satisfiability Solving

    Creator:
    Young, Jeffrey M.
    Abstract:
    Over the last two decades, satisfiability and satisfiability-modulo theory (SAT/SMT) solvers have grown powerful enough to be general purpose reasoning engines throughout software engineering and computer science. However, most practical use cases of SAT/SMT solvers require not just solving a single SAT/SMT problem, but solving sets of related SAT/SMT problems....
    Resource Type:
    Dissertation
    Full Text:
    under substitution the formula evaluates to true (T). We formalize the problem and terms in the