Search Constraints

Start Over
Filtering by: Creator Bruck, D. J. Remove constraint Creator: Bruck, D. J. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan Language English [eng] Remove constraint Language: English [eng]

Search Results

  • Navigation and coordination of autonomous mobile robots with limited resources

    Creator:
    Knudson, Matthew D.
    Abstract:
    The use of autonomous robots in complex exploration tasks is rapidly increasing. Indeed, robots can provide speed and cost effectiveness in many tasks, as well as allow operation in environments that are hostile to humans. In this dissertation we: 1) provide two adaptive navigation algorithms; 2) develop a coordination mechanism;...
    Resource Type:
    Dissertation
    Full Text:
    AN ABSTRACT OF THE DISSERTATION OF Matthew D. Knudson for

  • Applying hierarchical and adaptive control to coordinating simple robots

    Creator:
    Knudson, Matthew D.
    Abstract:
    Coordinating multiple robots to achieve a complex task requires solving two distinct control problems: the high-level control problem of ensuring that each robot aims to perform a useful task (e.g., coordination) and the low-level control problem of ensuring that each robot actually performs the correct actions to achieve its task...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Matthew D. Knudson for the

  • Part-based and Uncertainty-Aware Few-shot Object Segmentation in Images

    Creator:
    Nguyen, Khoi D.
    Abstract:
    This dissertation addresses few-shot object segmentation in images. The goal of segmentation is to label every image pixel with a class of the object occupying that pixel, where the class may represent a semantic object category or instance. In few-shot segmentation, training and test datasets have different classes. Every new...
    Resource Type:
    Dissertation
    Full Text:
    generated via appropriately masking the anchor. D is the discriminator show in Fig. 3.3

  • 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

  • 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:
    mixed latent space Z ∈ RNd, d < j. An Nd-dimensional Q(s) is then partitioned 15 into N layer

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    representation is the PSI-BLAST profile introduced by D. Jones, which is based on matching sequences of known

  • 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:
    Step Details . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 D Maximization Step Details

  • 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:
    ) d,on(t1, t2) (3.9) L (k) d,on(t1, t2) = J(x̄d[t1, t2],�✓[n](z[t1, t2])d) r✓d[n]L (k) d,on(t1, t2

  • 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:
    each sn ∈ S by n ⎫⎬ ⎧⎨ U ∗ n(sn) = max a∈A rn(sn, a) + p(j|sn, a)U ∗ n+1(j)⎭ . ⎩ j∈S Set d