32,586 research outputs found

    Keyboard Typing via Surface Electromyography (KT-sEMG)

    No full text
    The KT-sEMG (Keyboard Typing via Surface Electromyography) Dataset is copyright 2021 Nokia. Licensed under the Creative Commons Attribution 4.0 International license. SPDX-License-Identifier: CC-BY-4.0 This dataset contains surface EMG recordings taken during a keyboard typing task. Surface EMG data was recorded at 2000 Hz via custom-built forearm sleeves, using 16 electrode channels per arm at 2000 Hz. Computer keystrokes were recorded on the same computer, for synchronization of timestamps. For each recording session, there is: A csv file containing 2000 Hz recordings of the 32 sEMG channels A text file containing all recorded keystrokes, with millisecond-precision timestamps A text file containing the beginning time of the sEMG recording The typist was instructed to take dictation from podcast episodes (the podcast "Jordan, Jesse, Go!" was chosen for its natural conversation between native English speakers without a particular focus or topic). Please contact Michael Crouch ([email protected]) with any questions or comments

    UNSW Startup Road Map

    No full text

    Michael Rodriguez interviews fiction writer Michael Kimball

    No full text
    Author Michael Kimball talks about moving away from Michigan to become a successful writer, his education, the fiction reading series he has started in Baltimore, the life-story-on-postcard project, and his book "Dear everybody." Kimball is interviewed by Michigan State University Librarian Michael Rodriguez for the Michigan State University Libraries' Michigan Writers Series

    Inositol phospholipid turnover and pancreatic exocrine secretion / by Michael Francis Crouch

    No full text
    Offprint of an article by the author insertedBibliography: leaves 351-384384 leaves : ill. (some col.) ; 30 cm.Thesis (Ph.D.)--University of Adelaide, Dept. of Physiology, 198

    Michael Rodriguez interviews author Paul Clemens

    No full text
    Author Paul Clemens talks about his book "Made in Detroit," the genre of memoir, and writing about race. Clemens is interviewed by Michigan State University Librarian Michael Rodriguez for the MSU Libraries' Michigan Writers Series. Held in the MSU Main Library

    Michael Rodriguez interviews author Tom Springer

    No full text
    Author Tom Springer is interviewed about his writing career and his newest book "Looking for hickories". Springer talks about his career following after earning an Environmental Journalism degree from Michigan State University. He calls his genre "creative non-fiction" and explains how he weaves his memories into his books about life in rural and wild Michigan. Part of the Michigan State University Libraries' Michigan Writers Series. Springer is interviewed by Librarian Michael Rodriguez

    Michael Rodriguez interviews author Gary Gildner

    No full text
    Author Gary Gildner explains why he left his tenured teaching position to move to Idaho to became a full-time writer of poetry. Gildner talks about donating his personal papers to Michigan State University Libraries' Special Collections, his writing style and how he approaches writing. Gildner is interviewed by MSU Librarian Michael Rodriguez for the MSU Libraries' Michigan Writer Series. Held at the MSU Main Library

    Gold standard of UK degrees is lost in translation

    No full text
    Inflated marks, overworked staff and politically compromised courses are the price of exploiting offshore UK registered students, says Michael Day

    Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching

    No full text
    We present a (4 + epsilon) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and MapReduce models; this single algorithm improves the previous best algorithm in each model. The algorithm operates by reducing the maximum-weight matching problem to a polylog number of copies of the maximum-cardinality matching problem. The algorithm also extends to provide approximation guarantees for the more general problem of finding weighted independent sets in p-systems (which include intersections of p matroids and p-bounded hypergraph matching)
    corecore