Search Constraints

Start Over
Filtering by: Creator Wright, D. M. Remove constraint Creator: Wright, D. M. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • 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:
    : Computing Entropy for Z2-actions Abstract Approved: Robert M. Burton Abstract: For a certain class of Z2

  • 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

  • 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

  • Learning to Estimate Multi-Relation Aggregation Functions

    Creator:
    Jadhav, Rashmi Suresh
    Abstract:
    Multi-relation aggregation queries process the join operator before computing the aggregation function. This join is arguably the most costly operation since traditional join algorithms spend majority of their time trying to join the parts of the relations that do not generate any output tuples. This causes slow response times with...
    Resource Type:
    Masters Thesis
    Full Text:
    of different learning lengths in m-run (z = 3) (d) Averaged(4 Queries) Response Time z = 3 Figure

  • 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:
    /��+/�@Y��/�A�1�7�<"�Z3[&2@0�!/K< W &2 \<"�X&27�7�#]�.M�D"�9 \'E&2M�7��?$.-0H]&E�+/�D=1GD"�+/G@]�)I^&2 "D

  • Probabilities of voting paradoxes with three candidates

    Creator:
    McDonald, Leslie M.
    Abstract:
    Pardoxes in voting has been an interest of voting theorists since the 1800's when Condorcet demonstrated the key example of a voting paradox: voters with individually transitive rankings produce an election outcome which is not transitive. With Arrow's Impossibility Theorem, the hope of finding a fair voting method which accurately...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Leslie M. McDonald for the

  • Mixing time for a 3-cycle interacting particle system : a coupling approach

    Creator:
    Eves, Matthew Jasper
    Abstract:
    This thesis examines the mixing times for one-dimensional interacting particle systems. We use the coupling method to study the mixing rates for particle systems on the circle which move according to specific permutations e.g., transpositions and 3-cycles.
    Resource Type:
    Masters Thesis
    Full Text:
    each m ≤ n; E[Mn+1|Fm] = Mm Theorem 1.1.5.1 Optional Stopping Theorem. Let Mn be a bounded martingale

  • Action Selection for Heterologous Control of a Continuous-Output Myoelectric Prosthesis

    Creator:
    Sylwester, Sean T.
    Abstract:
    Significance: Movement intent decoding algorithms can interpret human bioelectrical signals to control prosthetic limbs with many degrees of freedom (DOFs). This work involves decoding volitional movement intent from surface electromyogram (sEMG) signals to control prosthetic arms. To train these algorithms, patients flex their muscles to “follow” a movement prompt, and...
    Resource Type:
    Masters Thesis
    Full Text:
    ) algorithms that were developed to address this map creation problem. Given a prosthesis with m DOFs and a

  • 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