Search Constraints

Start Over
Filtering by: Creator Helgerson, O. T. Remove constraint Creator: Helgerson, O. T. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • 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:
    AN ABSTRACT OF THE THESIS OF Sean T. Sylwester for the degree

  • A tool for visualizing sequence alignments and associating annotations

    Creator:
    Zhang, Wenpeng
    Abstract:
    Alignment of genomic sequences from different species is becoming an increasingly powerful method in biology, and is being used for many purposes. The result of sequence alignments is a list of pairs of matched locations between the pattern string and the text string. However, without any proper visualization tools to...
    Resource Type:
    Capstone Project
    Full Text:
    ,inn ie,OSU _De l'ee,P,-o ec t,Code,An not at ion> Figure 15. This picture shows the result of

  • Parsing with Recurrent Neural Networks

    Creator:
    Cross, James Henry, III
    Abstract:
    Machine learning models for natural language processing have traditionally relied on large numbers of discrete features, built up from atomic categories such as word forms and part-of-speech labels, which are considered completely distinct from each other. Recently however, the advent of dense feature representations coupled with deep learning techniques has...
    Resource Type:
    Dissertation
    Full Text:
    result that the entire space of possible parser states for a sentence of length n can be reduced to O

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    Length 0.0 0.5 1.0 1.5 2.0 T im e ( se c) Chart Parsing: O(n2. 26) Beam 20 No Cube-Pruning: O

  • 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:
    . Sum of values of a period of time: ∑T i=1 si. O(N) 2. Mean: µs = 1 T ∑T i=1 si. O(N) 3. Standard

  • Improving automated email tagging with implicit feedback

    Creator:
    Sorower, Mohammad Shahed
    Abstract:
    Machine learning systems are generally trained offline using ground truth data that has been labeled by experts. However, these batch training methods are not a good fit for many applications, especially in the cases where complete ground truth data is not available for offline training. In addition, batch methods do...
    Resource Type:
    Dissertation
    Full Text:
    learning systems are generally trained o�ine using ground truth data that has been labeled by experts

  • 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:
    ')�+ \-0/�HJ�!/K<>DN8!&2/ŒMO�„H_-)*��97+�!* &2D(T�UWV�XZYR[ \ �^]`_ �`_aYRbdceV�Y8] � � � � �]m‡AC$ W D>o

  • Principles of Variational Databases

    Creator:
    Ataei, Parisa S.
    Abstract:
    Data variations are prevalent in real-world applications. For example, software vendors have to handle numerous variations in the business requirements, conventions, and environmental settings of a software product. In database-backed software, the database of each version may have a different schema and content. As another example, data scientists often need...
    Resource Type:
    Masters Thesis
    Full Text:
    semantics of variational queries using the selection operator. The part function takes a tuple t and a set

  • 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:
    . Once U t+1 is found, T t+1 can be calculated in O(np) time by computing b̂U t+1 = u, and then finding

  • 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:
    in distribution. 2 For two random Processes Xt and Yt a coupling is a process (Xt, Yt)∞t=0 with