Other Computer Sciences Commons^™

Algorithmic Bias: Causes And Effects On Marginalized Communities, Katrina M. Baha

Undergraduate Honors Theses

Individuals from marginalized backgrounds face different healthcare outcomes due to algorithmic bias in the technological healthcare industry. Algorithmic biases, which are the biases that arise from the set of steps used to solve or analyze a problem, are evident when people from marginalized communities use healthcare technology. For example, many pulse oximeters, which are the medical devices used to measure oxygen saturation in the blood, are not able to accurately read people who have darker skin tones. Thus, people with darker skin tones are not able to receive proper health care due to their pulse oximetry data being inaccurate. This …

Analyzing Yankees And Red Sox Sentiment Over The Course Of A Season, Connor Koch

Honors Projects in Data Science

This paper investigates data collected on twitter which references the Yankees or Red Sox during the 2020 Major League Baseball (MLB) season. The objective is to analyze the sentiment of tweets referencing the Yankees and Red Sox over the course of the season. In addition, an investigation of the networks within the data and the topics that were prevalent will be conducted. The 2020 MLB season was started late because of the COVID-19 pandemic and was a season like no other. The expectation of a dataset revolving around baseball is that the topics discussed would be about baseball. The findings …

Using Natural Language Processing To Categorize Fictional Literature In An Unsupervised Manner, Dalton J. Crutchfield

Electronic Theses and Dissertations

When following a plot in a story, categorization is something that humans do without even thinking; whether this is simple classification like “This is science fiction” or more complex trope recognition like recognizing a Chekhov's gun or a rags to riches storyline, humans group stories with other similar stories. Research has been done to categorize basic plots and acknowledge common story tropes on the literary side, however, there is not a formula or set way to determine these plots in a story line automatically. This paper explores multiple natural language processing techniques in an attempt to automatically compare and cluster …

A Longitudinal Study Of Mammograms Utilizing The Automated Wavelet Transform Modulus Maxima Method, Brian C. Toner

Electronic Theses and Dissertations

Breast cancer is a disease which predominatly affects women. About 1 in 8 women are diagnosed with breast cancer during their lifetime. Early detection is key to increasing the survival rate of breast cancer patients since the longer the tumor goes undetected, the more deadly it can become. The modern approach for diagnosing breast cancer relies on a combination of self-breast exams and mammography to detect the formation of tumors. However, this approach only accounts for tumors which are either detectable by touch or are large enough to be observed during a screening mammogram. For some individuals, by the time …

Technical Report 2019-01: Pupil Labs Eye Tracking User Guide, Joan D. Gannon, Augustine Ubah, Chris Dancy

Other Faculty Research and Publications

No abstract provided.

The Algorithmic Composition Of Classical Music Through Data Mining, Tom Donald Richmond, Imad Rahal

All College Thesis Program, 2016-2019

The desire to teach a computer how to algorithmically compose music has been a topic in the world of computer science since the 1950’s, with roots of computer-less algorithmic composition dating back to Mozart himself. One limitation of algorithmically composing music has been the difficulty of eliminating the human intervention required to achieve a musically homogeneous composition. We attempt to remedy this issue by teaching a computer how the rules of composition differ between the six distinct eras of classical music by having it examine a dataset of musical scores, rather than explicitly telling the computer the formal rules of …

Visualizing Sorting Algorithms, Brian Faria

Honors Projects

This paper discusses a study performed on animating sorting algorithms as a learning aid for classroom instruction. A web-based animation tool was created to visualize four common sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort, and Merge Sort. The animation tool would represent data as a bar-graph and after selecting a data-ordering and algorithm, the user can run an automated animation or step through it at their own pace. Afterwards, a study was conducted with a voluntary student population at Rhode Island College who were in the process of learning algorithms in their Computer Science curriculum. The study consisted of …

Visual Code: Breaking The Binary, Jacob Johannesen, Andrew Adriance

Liberal Arts and Engineering Studies

This project seeks to create an accessible programming language that is more visually based. Although some solutions exist, namely MIT’s Scratch, nothing has caught up to the mobile age. This proj- ect aims to reframe creating a game or app into the context of tell- ing a story, putting character creation first. By researching sto- ry-telling and how people learn, and by applying technical and user interface design knowledge, this project intends to deliver a soft- ware solution that opens introductory coding education to more people.

Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.

CCE Theses and Dissertations

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …

Mutable Class Design Pattern, Nikolay Malitsky

CCE Theses and Dissertations

The dissertation proposes, presents and analyzes a new design pattern, the Mutable Class pattern, to support the processing of large-scale heterogeneous data models with multiple families of algorithms. Handling data-algorithm associations represents an important topic across a variety of application domains. As a result, it has been addressed by multiple approaches, including the Visitor pattern and the aspect-oriented programming (AOP) paradigm. Existing solutions, however, bring additional constraints and issues. For example, the Visitor pattern freezes the class hierarchies of application models and the AOP-based projects, such as Spring AOP, introduce significant overhead for processing large-scale models with fine-grain objects. The …

A Study Of The Success Of Group Formation In Virtual Teams Using Computer-Mediated Communications, Eliel Melón-Ramos

CCE Theses and Dissertations

In the digital domain, virtual teams within organizations and corporations are becoming common. Restructuring an organization or corporation is vital because competition and globalization are increasing. In this era of globalization, distributed working groups need to develop a competitive advantage in these ever-changing environments. Historically, teams had experienced problems stemming from geographical and temporal limitations. With the increase of technology in telecommunications, organizations are increasingly forming virtual teams, which have become critical to the survival of nearly any corporate entity.

Virtual teams have some of the same problems that regular teams have. One of the key challenges is the method …

Algorithmic Music Composition And Accompaniment Using Neural Networks, Daniel Wilton Risdon

Senior Projects Spring 2016

The goal of this project was to use neural networks as a tool for live music performance. Specifically, the intention was to adapt a preexisting neural network code library to work in Max, a visual programming language commonly used to create instruments and effects for electronic music and audio processing. This was done using ConvNetJS, a JavaScript library created by Andrej Karpathy.

Several neural network models were trained using a range of different training data, including music from various genres. The resulting neural network-based instruments were used to play brief pieces of music, which they used as input to create …

Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov

Zhongmei Yao

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …

On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Zhongmei Yao

Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …

Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang

Zhongmei Yao

Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …

Determinants Of Intention To Use New Technology: An Investigation Of Students In Higher Education, Yolanda Dupree

CCE Theses and Dissertations

The federal government continues to monitor the cost of paper texts as an essential component of postsecondary education expenses. The Higher Education Act (HEA), which was initially passed in 1965, was created to buttress the educational resources of colleges and universities. Along with addressing the benefits of financial aid in postsecondary and higher education, the act referenced the projected financial burdens of paper texts. The last 2008 reauthorization suggested that colleges and universities develop plans to reduce the costs of college. Congress is currently working to reauthorize the legislation. Based on this information, the problem identified in this study explored …

Characterizing Conflict In Wikipedia, Nathaniel Miller

Mathematics, Statistics, and Computer Science Honors Projects

Wikipedia serves as the Internet's most widely viewed reference. In order to ensure its success, editors who create and maintain articles must resolve conflicts over appropriate article content. Previous research has measured Wikipedia conflict at two levels: single articles and categories of pages. I observe conflicts within small groups of articles, identifying their frequency, size, and intensity. Additionally, I identify individual conflicts spanning multiple articles and effects of conflict upon users' editing habits. I analyze cross-article conflict in three stages. First, I cluster a group of 1.4 million Wikipedia articles. Next, I find individual user conflicts within each article cluster …

Back-Up Server For Computer Science Department, Victoria Gaylord

Mahurin Honors College Capstone Experience/Thesis Projects

Because Western Kentucky University does not maintain a back-up system for its departments, the Computer Science Department has implemented its own. Using Bacula software on a Unix server, files from faculty desktop computers and servers are backed up to a tape drive on a daily basis. The server is protected from outside threats with a carefully configured firewall script. This paper explains how both the firewall and the back-up software were implemented and how successful that implementation has been.

Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov

Computer Science Faculty Publications

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …

On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …

Proe: Pseudo Random Optimized Encryption, Louis J. Ricci

Honors Projects

Examines the development and testing of the PROE encryption algorithm, including design decisions ensuring security and speed. Demonstrates implementation in the x86-64 assembler.

Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang

Computer Science Faculty Publications

Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …

On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …