Search Constraints

Start Over
Filtering by: Creator Cullen, J. J. Remove constraint Creator: Cullen, J. J. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Resource Type Dissertation Remove constraint Resource Type: Dissertation

Search Results

  • Advancing Power Grid Computing: Analysis and Synthesis of Wide-Area Data, Distributed Real-Time Hardware-In-the-Loop Simulations, and Machine Learning for Event Detection

    Creator:
    Hagan, Travis
    Abstract:
    Global Positioning Systems have allowed for precise timing of power system measurements over wide areas. This newly found capability has the potential to provide much greater insight into the operation of the power system and its response to contingencies, but few analytical techniques currently exist that provide enough robustness and...
    Resource Type:
    Dissertation
    Full Text:
    (�%������������������������ A6 ��)IF&�+'#2�!�'#,�%��H2'��'"�!&(�%����������������������� A6 ��)�J'!!:�"���#(%���#�#��++���+42

  • Reaction Pathways of Oxo-Hydroxo Group 5 Clusters to Metal Oxide Thin Films

    Creator:
    Mansergh, Ryan H.
    Abstract:
    Oxo-hydroxo Group 5 metal clusters are an untapped resource to study and advance aqueous solution processing of metal oxide thin films. The tetramethylammonium (TMA) hexatantalate salt (TMA6[H2Ta6O19]) yields dense Ta2O5 films (~95% of the bulk ß-Ta2O5 density) with atomically smooth surfaces (<4 Å root mean square surface roughness). This same...
    Resource Type:
    Dissertation
    Full Text:
    . Abstract approved: _____________________________________________________ Douglas A. Keszler Brady J

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    to abstraction α = 〈χ, µ〉 is given by Jα(h) = max a∈A Q∗(h, a)−Q∗(h, ↓π∗(h)). (3.9) 17 We now

  • Analytical Methods for Improving Causal Inference

    Creator:
    Sinha, Meghamala
    Abstract:
    Causal inference is an important analytical tool to bridge the gap between prediction and decision-making. However, learning a causal network solely from data is a challenging task. In this work, various techniques have been explored for a better and improved causal network learning from data. Firstly, the problem of learning...
    Resource Type:
    Dissertation
    Full Text:
    distribution of p after intervention is: p(V1, ..., Vn) = ∏ Vi∈Oe pi(Vi | Pa(Vi)) · ∏ Vj∈Ie p′j(Vj | Pa(Vj

  • 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:
    resource nodes, (2) j- adjacency problem: here, a non-resource node is adjacent to at least j resource

  • 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:
    . J. R. Higgins provided a generalization where the integers can be perturbed by less than 1/4, which

  • 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:
    . Correlation between each pair of axes:∑T i=1(si−µs)(vi−µv)√∑T i=1(si−µs) ∑T j=1(vj−µv) . O(N) Table 2.1

  • 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:
    Function Jπ(θ) . . . . . . . . 98 4.4.3 Condition on the Derivatives of Jπ(θ) . . . . . . . . . . . 98

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    use in�x notation throughout the thesis. exp ! term j (+ term term-set) j ! (� term term-set) j

  • Computational Approaches for RNA Structure Prediction with Dynamic Programming and Deep Neural Networks

    Creator:
    Deng, Dezhong
    Abstract:
    Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
    Resource Type:
    Dissertation
    Full Text:
    programming-based pseudoknot- free RNA secondary structure prediction algorithm. The next (i, j) returns the