Search Constraints

Start Over
Filtering by: Creator Cullen, J. J. Remove constraint Creator: Cullen, J. J. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Usable and Scalable Querying of Scientific Datasets

    Creator:
    McCamish, Benjamin J.
    Abstract:
    Scientists and engineers have to analyze and query multiple large databases. Analysis over databases created by phasor measurement units can provide insight into the health of the grid, thereby improving control over operations. Realizing this data-driven control, however, requires validating, processing and storing massive amounts of PMU data efficiently, which...
    Resource Type:
    Dissertation
    Full Text:
    ,j = 1, if the ith record falls into the specified value and range of the jth bin, and bi,j = 0

  • Methods for Detection and Recovery of Out-of-Distribution Examples

    Creator:
    Ratzlaff, Neale J.
    Abstract:
    Deep neural networks currently comprise the backbone of many applications where safety is a critical concern, for example: autonomous driving and medical diagnostics. Unfortunately these systems currently fail to detect out-of-distribution (OOD) inputs and can be prone to making dangerous errors when exposed to them. In addition, these same systems...
    Resource Type:
    Masters Thesis
    Full Text:
    Ij is a j × j identity matrix, and generate parameters using a generator from s. Figure 2.1 shows

  • 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

  • Revenue-based spectrum management via Markov decision process

    Creator:
    Zhu, Pingan
    Abstract:
    We consider the problem of wireless spectrum management in cognitive wireless networks that maximizes the revenue for a spectrum operator. Specifically, we study the problem on how a wireless spectrum operator can optimally allocate its limited spectrum to various classes users/devices who pay differently for their spectrum per unit time....
    Resource Type:
    Masters Thesis
    Full Text:
    be leaving the system and 11 a probability βj that the new user of application class j will

  • Adaptive Movement Intent Decoding for Intuitive Control of Neuroprostheses

    Creator:
    George, Damon A.
    Abstract:
    Movement intent decoders, which interpret volitional movement intent from human bioelectric signals, can be incorporated into modern neuroprostheses to offer people living with limb loss or paralysis the potential to regain their lost motor control. Machine learning methods have become the research standard for continuous decoders with high degrees of...
    Resource Type:
    Masters Thesis
    Full Text:
    problem described by the following loss minimization: min ✓[n] Lo↵ (3.2) Lo↵ = J(x,�✓[n](z)) where Lo

  • Planning in multi-agent partially observable domains using sparse sampling

    Creator:
    Donneau-Golencer, Thierry D.
    Abstract:
    A large number of sequential decision-making problems in uncertain environments can be modeled as Markov Decision Processes (MDPs). In such settings, an agent can observe at each time step the state of the environment and then executes an action, causing a stochastic transition to a new state of the environment...
    Resource Type:
    Masters Thesis
    Full Text:
    \<>�9I_<"��� D\� -2:s<"��� �!/K')�+ \-0/�HJ�!/K<j&2/�*t<>���9/_�quG�q3 8!1�<>�!D &E/v&289<"�+-0/sQ

  • Efficient Incremental Panorama Reconstruction from Multiple Videos

    Creator:
    Feng, Zhongyuan
    Abstract:
    Constructing a panorama from a set of videos is a long-standing problem in computer vision. A panorama represents an enhanced still-image representation of an entire scene captured in a set of videos, where each video shows only a part of the scene. Importantly, a panorama shows only the scene background,...
    Resource Type:
    Capstone Project
    Full Text:
    Estimation Given an image pair Ii, Ij , as well as matched features f m i ,f n j indexed by m,n respec

  • Efficient Algorithms for Robust Spatiotemporal Data Analysis

    Creator:
    Moore, Travis W.
    Abstract:
    Many large-scale data analysis applications involve data that can vary over both time and space. Often the primary goal of analyzing spatiotemporal data is identifying trends, movements, and sudden changes with respect to time, location, or both. This can include a variety of applications in economics (housing prices, unemployment, job...
    Resource Type:
    Dissertation
    Full Text:
    a row selector matrix, where K[j,j] = 1 if point j is in C, and all other values are zero. For a

  • Computing entropy for Z²-actions

    Creator:
    Pierce, Larry A.
    Abstract:
    For a certain class of Z²-actions, we provide a proof of a conjecture that the ratio of the Perron eigenvalues of the transfer matrices of the free boundary restrictions converge to the entropy of that action. Also, a novel method for computing the entropy of Z²-actions is conjectured.
    Resource Type:
    Dissertation
    Full Text:
    projection of α onto the ith coordinate. For i < j, by αji we mean the word of length j − i+ 1 which is the

  • Network Coding, Random Matrices, and Their Applications to Communication Systems

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
    Resource Type:
    Dissertation
    Full Text:
    ) = ( D k ) αki (1− αi)D−k P(Ki ≤ k) = F (k,D, αi) = k∑ j=0 ( D k ) αji (1− αi)D−j (3.3) Now since K