Open Access. Powered by Scholars. Published by Universities.®

Other Computer Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Other Computer Sciences

Using Blockchain For Digital Card Game, Raymond A. Swannack Jan 2020

Using Blockchain For Digital Card Game, Raymond A. Swannack

EWU Masters Thesis Collection

In recent years, the popularity of both online card games and blockchain technology have grown exponentially. While combining these two does not immediately seem like an obvious idea, they in fact complement each other nicely. Blockchain allows for players to actually own their cards, in a way that was unheard of in the digital format just a few years ago. It also gives them the freedom to use them in any way they like, just like in real life. In this thesis we will look into how viable this idea really is. We use the Ethereum virtual machine to simulate …


Comparison Of The Tally Numbering System To Traditional Arithmetic Systems In Field Programmable Gate Arrays, Robert Paul Shredow Jan 2020

Comparison Of The Tally Numbering System To Traditional Arithmetic Systems In Field Programmable Gate Arrays, Robert Paul Shredow

EWU Masters Thesis Collection

This research explores the use of heterogeneous computing platforms for use in machine learning as well as different neural network architectures. These platforms and architectures can be used to accelerate the complex operations that are required for machine learning, more specifically neural networks. The use of different architectures, implementing different types of numbering and mathematics systems is explored in hopes of accelerating mathematical functions. The heterogeneous computing platform explored in this thesis is a Field Programmable Gate Arrays (FPGA), specifically a SoC/FPGA which is a ARM CPU and a FPGA in the same chip. FPGAs are unique because they are …


Relaxed Mental State Detection Using The Emotiv Epoc And Adaptive Threshold Algorithms, Olin L. Anderson Jan 2019

Relaxed Mental State Detection Using The Emotiv Epoc And Adaptive Threshold Algorithms, Olin L. Anderson

EWU Masters Thesis Collection

The electroencephalogram (EEG) has proven to be useful in a wide variety of applications, including: diagnosis of mental disorders, psychological research, neurofeedback, and brain-computer interfacing. Most such applications of the EEG benefit from an ability to automatically detect when the subject is in a relaxed state. Recently, inexpensive and relatively easy to use EEG systems, with multiple electrodes, have become available at prices comparable to cellular phones or game machines. This project’s purpose is to investigate the feasibility of real-time classification of a subject's relaxation state using one such consumer-grade EEG system, the Emotiv Epoc. The subject's state is classified …


Detecting And Mapping Real-Time Influenza-Like Illness Using Twitter Stream Data, Elisha D. Brunette Jan 2019

Detecting And Mapping Real-Time Influenza-Like Illness Using Twitter Stream Data, Elisha D. Brunette

EWU Masters Thesis Collection

Influenza has been identified by the World Health Organization as a global issue that could be more effectively served through an accelerated and widely-accessible public health surveillance tracking process. The ability to map and predict influenza outbreaks in a real-time heat map would be invaluable to health care systems to prepare for influenza outbreaks. In this study, the Twitter stream data is filtered to identify potential influenza-like illness (ILI) cases. Then the tracking of real-time influenza cases is further explored and analyzed through various machine-learning models. Among seven learning models developed to identify ILI tweets, the ELMo deep neural network …


The Application Of Cloud Resources To Terrain Data Visualization, Gregory J. Larrick Jan 2019

The Application Of Cloud Resources To Terrain Data Visualization, Gregory J. Larrick

EWU Masters Thesis Collection

In this thesis, the recent trends in cloud computing, via virtual machine hosted servers, are applied to the field of big data visualization. In particular, we investigate the visualization of terrain data acquired from several major open data sets with a graphics library for browser based rendering. Similar terrain data visualization solutions have not fully taken advantage of remote computational resources. In this thesis, we show that, by using a collection of Amazon EC-2 machines for fetching and decoding of terrain data, in conjunction with modern graphics libraries, three dimensional terrain information may be viewed and interacted with by many …


Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis Jan 2018

Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis

EWU Masters Thesis Collection

Text character segmentation is the process of detecting the bounding box position of individual characters within a written text document image. The character segmentation problem remains extremely difficult for ancient Chinese calligraphy documents. This paper examines a glyph-based segmentation technique for segmenting Chinese Calligraphy characters in the "Collected Characters". The glyph-based character segmentation pipeline utilizes a combination of well-understood image processing techniques in a novel pipeline which is able to detect Chinese calligraphy characters from ink-blots with a good reliability.


A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen Jan 2018

A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen

EWU Masters Thesis Collection

This thesis revisits the k-mismatch shortest unique substring (SUS) finding problem and demonstrates that a technique recently presented in the context of solving the k-mismatch average common substring problem can be adapted and combined with parts of the existing solution, resulting in a new algorithm which has expected time complexity of O(n logk n), while maintaining a practical space complexity at O(kn), where n is the string length. When k > 0, which is the hard case, the new proposal significantly improves the any-case O(n2) time complexity of the prior best method for k-mismatch SUS finding. Experimental study …