Computer Engineering Commons^™

The Effects Of Social Media On Mental Health And Career Planning, Spencer A. Rowan

Honors Theses

Social media use is prevalent and necessary in society—nearly anything can be accomplished with a mobile device or smartphone. Among the US population, two thirds of American adults admit to using social media (Perrin, 2015) and in 2022, Georgiev (2023) found Americans spent an average of two and a half hours daily on social media. Furthermore, social media use is tied to mental well-being, work confidence levels, and feelings of being an imposter (Johnson et al., 2020; Uram & Skalski, 2022; Hernandez & Chalk, 2021; Myers, 2021; Ramm, 2019).

This project examined the role of social media use among college …

Comparative Analysis Of Fullstack Development Technologies: Frontend, Backend And Database, Qozeem Odeniran

Electronic Theses and Dissertations

Accessing websites with various devices has brought changes in the field of application development. The choice of cross-platform, reusable frameworks is very crucial in this era. This thesis embarks in the evaluation of front-end, back-end, and database technologies to address the status quo. Study-a explores front-end development, focusing on angular.js and react.js. Using these frameworks, comparative web applications were created and evaluated locally. Important insights were obtained through benchmark tests, lighthouse metrics, and architectural evaluations. React.js proves to be a performance leader in spite of the possible influence of a virtual machine, opening the door for additional research. Study b …

Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector

LSU Doctoral Dissertations

In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …

Exploring The Efficiency Of Neural Architecture Search (Nas) Modules, Joshua Dulcich

Honors Theses

Machine learning is obscure and expensive to develop. Neural architecture search (NAS) algorithms automate this process by learning to create premier ML networks, minimizing the bias and necessity of human experts. From this recently emerging field, most research has focused on optimizing a promisingly unique combination of NAS’s three segments. Despite regularly acquiring state of the art results, this practice sacrifices computing time and resources for slight increases in accuracy; this also obstructs performance comparison across papers. To resolve this issue, we use NASLib’s modular library to test the efficiency per module in a unique subset of combinations. Each NAS …

Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari

Dissertations

A myriad of emerging applications from simple to complex ones involve human cognizance in the computation loop. Using the wisdom of human workers, researchers have solved a variety of problems, termed as “micro-tasks” such as, captcha recognition, sentiment analysis, image categorization, query processing, as well as “complex tasks” that are often collaborative, such as, classifying craters on planetary surfaces, discovering new galaxies (Galaxyzoo), performing text translation. The current view of “humans-in-the-loop” tends to see humans as machines, robots, or low-level agents used or exploited in the service of broader computation goals. This dissertation is developed to shift the focus back …

Exploring The Behavior Repertoire Of A Wireless Vibrationally Actuated Tensegrity Robot, Zongliang Ji

Honors Theses

Soft robotics is an emerging field of research due to its potential to explore and operate in unstructured, rugged, and dynamic environments. However, the properties that make soft robots compelling also make them difficult to robustly control. Here at Union, we developed the world’s first wireless soft tensegrity robot. The goal of my thesis is to explore effective and efficient methods to explore the diverse behavior our tensegrity robot. We will achieve that by applying state-of-art machine learning technique and a novelty search algorithm.

Way-Finding: A New Approach To Studying Digital Communications, William Daniel Glade

Theses and Dissertations

This work further develops the way-finding model first proposed by Pearson and Kosicki (2017) which examines the flow of information in the digital age. Way-finding systems are online systems that help individuals find information—i.e. social media, search engines, email, etc. Using a grounded theory methodology, this new framework was explored in greater detail. Way-finding theory was created using the context of the elaboration likelihood model, gatekeeping theory, algorithmic gatekeepers, and the existence of the filter bubble phenomenon. This study establishes the three basic pillars of way-finding theory: the user’s mindset when accessing way-finding systems, the perception of how popular way-finding …

Recipe For Disaster, Zac Travis

MFA Thesis Exhibit Catalogs

Today’s rapid advances in algorithmic processes are creating and generating predictions through common applications, including speech recognition, natural language (text) generation, search engine prediction, social media personalization, and product recommendations. These algorithmic processes rapidly sort through streams of computational calculations and personal digital footprints to predict, make decisions, translate, and attempt to mimic human cognitive function as closely as possible. This is known as machine learning.

The project Recipe for Disaster was developed by exploring automation in technology, specifically through the use of machine learning and recurrent neural networks. These algorithmic models feed on large amounts of data as a …

Heuristics For Client Assignment And Load Balancing Problems In Online Games, Shawn Michael Farlow

LSU Doctoral Dissertations

Massively multiplayer online games (MMOGs) have been very popular over the past decade. The infrastructure necessary to support a large number of players simultaneously playing these games raises interesting problems to solve. Since the computations involved in solving those problems need to be done while the game is being played, they should not be so expensive that they cause any noticeable slowdown, as this would lead to a poor player perception of the game. Many of the problems in MMOGs are NP-Hard or NP-Complete, therefore we must develop heuristics for those problems without negatively affecting the player experience as a …

Inference In Networking Systems With Designed Measurements, Chang Liu

Doctoral Dissertations

Networking systems consist of network infrastructures and the end-hosts have been essential in supporting our daily communication, delivering huge amount of content and large number of services, and providing large scale distributed computing. To monitor and optimize the performance of such networking systems, or to provide flexible functionalities for the applications running on top of them, it is important to know the internal metrics of the networking systems such as link loss rates or path delays. The internal metrics are often not directly available due to the scale and complexity of the networking systems. This motivates the techniques of inference …

Region-Based Approach For Single Image Super-Resolution, Min Zhang

Electrical & Computer Engineering Theses & Dissertations

Single image super-resolution (SR) is a technique that generates a high- resolution image from a single low-resolution image [1,2,10,11]. Single image super- resolution can be generally classified into two groups: example-based and self-similarity based SR algorithms. The performance of the example-based SR algorithm depends on the similarity between testing data and the database. Usually, a large database is needed for better performance in general. This would result in heavy computational cost. The self-similarity based SR algorithm can generate a high-resolution (HR) image with sharper edges and fewer ringing artifacts if there is sufficient recurrence within or across scales of the …

On Applications Of Relational Data, Samamon Khemmarat

Doctoral Dissertations

With the advances of technology and the popularity of the Internet, a large amount of data is being generated and collected. Much of these data is relational data, which describe how people and things, or entities, are related to one another. For example, data from sale transactions on e-commerce websites tell us which customers buy or view which products. Analyzing the known relationships from relational data can help us to discover knowledge that can benefit businesses, organizations, and our lives. For instance, learning the products that are commonly bought together allows businesses to recommend products to customers and increase their …

Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Topic of this master's thesis is connected with task allocation algorithms and mesh networks. Author of this work has already graduated from Wroclaw, University of Technology (Poland) where during his studies he created software simulation environment for two different task allocation algorithms for mesh networks:Adaptive ScanandFrame Sliding. Those algorithms were compared by two, main parame- ters: simulation time and average mesh fulfillment (utilization level). All simulations were done in software environment which was developed specially for that research. This application was based on few, different types of objects: task (width, height, processing time), task queue (different number of tasks), task …

Validation Of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation, Elton Lewis Freeman

Masters Theses

Extremization of a weak form for the continuum energy conservation principle differential equation naturally implements fluid convection and radiation as flux Robin boundary conditions associated with unsteady heat transfer. Combining a spatial semi-discretization via finite element trial space basis functions with time-accurate integration generates a totally node-based algebraic statement for computing. Closure for gray body radiation is a newly derived node-based radiosity formulation generating piecewise discontinuous solutions, while that for natural-forced-mixed convection heat transfer is extracted from the literature. Algorithm performance, mathematically predicted by asymptotic convergence theory, is subsequently validated with data obtained in 24 hour diurnal field experiments for …

Constellation Design Of Geosynchronous Navigation Satellites Which Maximizes Availability And Accuracy Over A Specified Region Of The Earth, Halil Ibrahim Ozdemir

Theses and Dissertations

Currently, there are four Global Navigation Satellite Systems (GNSS) either being developed or in existence-GPS, GLONASS, Compass, and Galileo. Additionally, there are several Regional Navigation Satellite Systems (RNSS) planned or in existence, as well as numerous augmentation systems (which require a GNSS for operation). It can be anticipated that there will be interest in developing additional independent regional navigation satellite systems to cover areas of interest to particular countries or regions, who want to have their own system. In this paper, a genetic algorithm is used in an effort to determine near-optimal RNSS constellations. First, a cost function is setup, …

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …

Multivariate Discretization Of Continuous Valued Attributes., Ehab Ahmed El Sayed Ahmed 1978-

Electronic Theses and Dissertations

The area of Knowledge discovery and data mining is growing rapidly. Feature Discretization is a crucial issue in Knowledge Discovery in Databases (KDD), or Data Mining because most data sets used in real world applications have features with continuously values. Discretization is performed as a preprocessing step of the data mining to make data mining techniques useful for these data sets. This thesis addresses discretization issue by proposing a multivariate discretization (MVD) algorithm. It begins withal number of common discretization algorithms like Equal width discretization, Equal frequency discretization, Naïve; Entropy based discretization, Chi square discretization, and orthogonal hyper planes. After …

Performance Analysis Of A Dynamic Bandwidth Allocation Algorithm In A Circuit-Switched Communications Network, Timothy M. Schwamb

Theses and Dissertations

Military communications networks typically employ a gateway multiplexer to aggregate all communications traffic onto a single link. These multiplexers typically use a static bandwidth allocation method via time-division multiplexing (TDM). Inefficiencies occur when a high-bandwidth circuit, e.g., a video teleconferencing circuit, is relatively inactive rendering a considerable portion of the aggregate bandwidth wasted while inactive. Dynamic bandwidth allocation (DBA) reclaims unused bandwidth from circuits with low utilization and reallocates it to circuits with higher utilization without adversely affecting queuing delay. The proposed DBA algorithm developed here measures instantaneous utilization by counting frames arriving during the transmission time of a single …

A Reconfigurable Superscalar Architecture, Christopher B. Mayer

Theses and Dissertations

The invention of the Field Programmable Gate Array (FPGA) has led to a number of interesting developments. One is the idea of providing custom hardware support for applications running on a computer. These reconfigurable computers have been shown to decrease the execution time for some applications. Based on past results, attention has subsequently turned to using reconfigurable computing in general-purpose computers (e.g. desktop and workstation environments). This thesis develops a design for just such a computer. The design, FPGADLX, is based on a hypothetical superscalar computer running the DLX instruction set and is generic enough in principle to be adapted …

Fpga Processor Implementation For The Forward Kinematics Of The Umdh, Steven M. Parmley

Theses and Dissertations

The focus of this research was on the implementation of a forward kinematic algorithm for the Utah MIT Dexterous Hand (UMDH). Specifically, the algorithm was synthesized from mathematical models onto a Field Programmable Gate Array (FPGA) processor. This approach is different from the classical, general purpose microprocessor design where all robotic controller functions including forward Kinematics are executed serially from a compiled programming language such as C. The compiled code and subsequent real time operating system must be stored on some form of nonvolatile memory, typically magnetic media such as a fixed or hard disk drive, along with other computer …

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates

Theses and Dissertations

This thesis investigates the ability of a simulation model to compare and contrast parallel processing algorithms in a high-speed network. The model extends existing modeling, analysis, and comparison of parallel algorithms by providing graphics based components that facilitate the measurement of system resources. Simulation components are based on the Myrinet local area network standard. The models provide seven different topologies to contrast the performance of five variations of Fast Fourier Transform (FFT) algorithms. Furthermore, the models were implemented using a commercially developed product that facilitates the testing of additional topologies and the investigation of hardware variations. Accurate comparisons are statistically …

A Mammographic Registration Method Based On Optical Flow And Multiresolution Computing, Kevin A. Lee

Theses and Dissertations

Mammography is a potent weapon in the fight against Breast Cancer, due in large part to its widespread availability and low cost. Despite the fact that mammography can detect small lesions as early as two years before they become palpable on physical exam, between 10 and 30 percent of cancerous lesions go undetected during evaluation by the radiologist. One approach to improving detection rates involves comparing mammograms of the same breast from successive years. Since most forms of breast cancer develop slowly, multiple view techniques might be able to detect subtle changes indicative of cancerous growth. This thesis proposes a …

Implementation Of Inversion Algorithms In Reconfigurable Systolic Arrays, Haritini E. Andre

Retrospective Theses and Dissertations

Reducing the computing time of the matrix inversion has been a concern of many authors. The use of Systolic architectures containing orthogonally connected processing elements capable of few instructions multiple data have allowed for new algorithms to be implemented. Two algorithms are examined that rely on the triangularization methods for matrix inversion. One can be applied to the general non-singular matrix and the other to the symmetric matrix. The throughput in both implementation is revolutionized. The speed improvement over Liu and Young’s implementation of the symmetric matrix inversion is by a factor of three.

The throughput in both implementation is …