Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (514)
- Old Dominion University (323)
- Air Force Institute of Technology (95)
- University of Dayton (60)
- University of Nevada, Las Vegas (53)
-
- City University of New York (CUNY) (51)
- Portland State University (48)
- California Polytechnic State University, San Luis Obispo (44)
- University of Arkansas, Fayetteville (40)
- Claremont Colleges (30)
- Southern Methodist University (29)
- University of Nebraska - Lincoln (28)
- Loyola University Chicago (26)
- University of Kentucky (26)
- Dartmouth College (23)
- San Jose State University (23)
- Technological University Dublin (19)
- University of Malaya (19)
- Virginia Commonwealth University (19)
- California State University, San Bernardino (18)
- University of Denver (18)
- University of New Mexico (17)
- Edith Cowan University (16)
- Purdue University (16)
- East Tennessee State University (15)
- Georgia Southern University (15)
- Rose-Hulman Institute of Technology (15)
- University of Nebraska at Omaha (15)
- Chapman University (14)
- Institute of Business Administration (14)
- Keyword
-
- Algorithms (150)
- Machine learning (99)
- Artificial intelligence (47)
- Machine Learning (45)
- Algorithm (44)
-
- Deep learning (36)
- Classification (34)
- Computer algorithms (31)
- Image processing (30)
- Genetic algorithms (29)
- Graph theory (29)
- Optimization (29)
- Clustering (27)
- Computer science (27)
- Computer Science (25)
- Neural networks (23)
- Reinforcement learning (23)
- Artificial Intelligence (22)
- Simulation (19)
- Cryptography (18)
- Genetic algorithm (18)
- Computational complexity (17)
- Computer vision (17)
- Data mining (17)
- Deep Learning (17)
- Online learning (16)
- Accuracy (13)
- Big data (13)
- Feature selection (13)
- Graph (12)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (493)
- Theses and Dissertations (122)
- Electrical & Computer Engineering Theses & Dissertations (81)
- Computer Science Faculty Publications (79)
- Electrical & Computer Engineering Faculty Publications (49)
-
- Electronic Theses and Dissertations (33)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (30)
- Master's Theses (28)
- Computer Science: Faculty Publications and Other Works (25)
- Dissertations, Theses, and Capstone Projects (22)
- Theses and Dissertations--Computer Science (21)
- Dissertations (20)
- Publications and Research (20)
- Computer Science and Computer Engineering Undergraduate Honors Theses (19)
- Computer Science Theses & Dissertations (17)
- Faculty Publications (17)
- Graduate Theses and Dissertations (17)
- SMU Data Science Review (17)
- Honors Theses (16)
- VMASC Publications (15)
- Computer Science Faculty Publications and Presentations (14)
- Dissertations and Theses (14)
- International Conference on Information and Communication Technologies (14)
- Mathematical Sciences Technical Reports (MSTR) (14)
- Mathematics & Statistics Faculty Publications (13)
- Engineering Management & Systems Engineering Faculty Publications (12)
- LSU New Orleans Theses and Dissertations (12)
- MAICS: The Modern Artificial Intelligence and Cognitive Science Conference (12)
- Master's Projects (12)
- Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal (11)
- Publication Type
- File Type
Articles 721 - 750 of 2153
Full-Text Articles in Computer Sciences
Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan
Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan
Research Collection School Of Computing and Information Systems
This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster is visited. The objective is to find the best route that maximizes the total collected profit without violating time windows and time budget constraints. We propose an adaptive large neighborhood search algorithm to solve newly introduced benchmark instances. The preliminary results show the capability of the proposed algorithm to obtain good solutions within …
Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan
Self-Adaptive Graph Traversal On Gpus, Mo Sha, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
GPU’s massive computing power offers unprecedented opportunities to enable large graph analysis. Existing studies proposed various preprocessing approaches that convert the input graphs into dedicated structures for GPU-based optimizations. However, these dedicated approaches incur significant preprocessing costs as well as weak programmability to build general graph applications. In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations directly. We propose Tiled Partitioning and Resident Tile Stealing to fully exploit the computing power of GPUs in a runtime and self-adaptive manner. We also propose Sampling-based Reordering to further …
First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro
First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro
Research Collection School Of Computing and Information Systems
Subway system is the main mode of transportation for city dwellers and is a quite signif-icant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus 'bridging' services, temporarily substitut -ing segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and …
Modeling And Solving The Outsourcing Risk Management Problem In Multi-Echelon Supply Chains, Arian A. Nahangi
Modeling And Solving The Outsourcing Risk Management Problem In Multi-Echelon Supply Chains, Arian A. Nahangi
Master's Theses
Worldwide globalization has made supply chains more vulnerable to risk factors, increasing the associated costs of outsourcing goods. Outsourcing is highly beneficial for any company that values building upon its core competencies, but the emergence of the COVID-19 pandemic and other crises have exposed significant vulnerabilities within supply chains. These disruptions forced a shift in the production of goods from outsourcing to domestic methods.
This paper considers a multi-echelon supply chain model with global and domestic raw material suppliers, manufacturing plants, warehouses, and markets. All levels within the supply chain network are evaluated from a holistic perspective, calculating a total …
Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta
Fake News Analysis And Graph Classification On A Covid-19 Twitter Dataset, Kriti Gupta
Master's Projects
Earlier researches have showed that the spread of fake news through social media can have a huge impact to society and also to individuals in an extremely negative way. In this work we aim to study the spread of fake news compared to real news in a social network. We do that by performing classical social network analysis to discover various characteristics, and formulate the problem as a binary classification, where we have graphs modeling the spread of fake and real news. For our experiments we rely on how news are propagated through a popular social media services such as …
Improving Additional Adversarial Robustness For Classification, Michael Guo
Improving Additional Adversarial Robustness For Classification, Michael Guo
McKelvey School of Engineering Graduate Student Theses & Dissertations
Although neural networks have achieved remarkable success on classification, adversarial robustness is still a significant concern. There are now a series of approaches for designing adversarial examples and methods to defending against them. This paper consists of two projects. In our first work, we propose an approach by leveraging cognitive salience to enhance additional robustness on top of these methods. Specifically, for image classification, we split an image into the foreground (salient region) and background (the rest) and allow significantly larger adversarial perturbations in the background to produce stronger attacks. Furthermore, we show that adversarial training with dual-perturbation attacks yield …
Reinforcement Learning For Realistic Robotic Training: A Survey, Andres Jaramillo
Reinforcement Learning For Realistic Robotic Training: A Survey, Andres Jaramillo
Honors Scholar Theses
Reinforcement learning is a widely popular topic that has resulted in a plethora of
research papers and interest from academia and industry. When applied with robotics,
the field has showed some promising signs that robots can achieve levels of complex
cognitive abilities rivaling humans, but the goal of creating sapient robots is far from
a reality due to many challenges involved with training robots in a real world setting.
This paper will provide a survey regarding the keys towards realistic robotic training by
detailing the challenges and overviewing the reinforcement learning solutions involved
in getting a robot to think like …
Semi-Supervised Spatial-Temporal Feature Learning On Anomaly-Based Network Intrusion Detection, Huy Mai
Semi-Supervised Spatial-Temporal Feature Learning On Anomaly-Based Network Intrusion Detection, Huy Mai
Computer Science and Computer Engineering Undergraduate Honors Theses
Due to a rapid increase in network traffic, it is growing more imperative to have systems that detect attacks that are both known and unknown to networks. Anomaly-based detection methods utilize deep learning techniques, including semi-supervised learning, in order to effectively detect these attacks. Semi-supervision is advantageous as it doesn't fully depend on the labelling of network traffic data points, which may be a daunting task especially considering the amount of traffic data collected. Even though deep learning models such as the convolutional neural network have been integrated into a number of proposed network intrusion detection systems in recent years, …
Data-Driven Approaches To Complex Materials: Applications To Amorphous Solids, Dil Kumar Limbu
Data-Driven Approaches To Complex Materials: Applications To Amorphous Solids, Dil Kumar Limbu
Dissertations
While conventional approaches to materials modeling made significant contributions and advanced our understanding of materials properties in the past decades, these approaches often cannot be applied to disordered materials (e.g., glasses) for which accurate total-energy functionals or forces are either not available or it is infeasible to employ due to computational complexities associated with modeling disordered solids in the absence of translational symmetry. In this dissertation, a number of information-driven probabilistic methods were developed for the structural determination of a range of materials including disordered solids to transition metal clusters. The ground-state structures of transition-metal clusters of iron, nickel, and …
A Comparison Of Word Embedding Techniques For Similarity Analysis, Tyler Gerth
A Comparison Of Word Embedding Techniques For Similarity Analysis, Tyler Gerth
Computer Science and Computer Engineering Undergraduate Honors Theses
There have been a multitude of word embedding techniques developed that allow a computer to process natural language and compare the relationships between different words programmatically. In this paper, similarity analysis, or the testing of words for synonymic relations, is used to compare several of these techniques to see which performs the best. The techniques being compared all utilize the method of creating word vectors, reducing words down into a single vector of numerical values that denote how the word relates to other words that appear around it. In order to get a holistic comparison, multiple analyses were made, with …
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Improving Bayesian Graph Convolutional Networks Using Markov Chain Monte Carlo Graph Sampling, Aneesh Komanduri
Computer Science and Computer Engineering Undergraduate Honors Theses
In the modern age of social media and networks, graph representations of real-world phenomena have become incredibly crucial. Often, we are interested in understanding how entities in a graph are interconnected. Graph Neural Networks (GNNs) have proven to be a very useful tool in a variety of graph learning tasks including node classification, link prediction, and edge classification. However, in most of these tasks, the graph data we are working with may be noisy and may contain spurious edges. That is, there is a lot of uncertainty associated with the underlying graph structure. Recent approaches to modeling uncertainty have been …
Trunctrimmer: A First Step Towards Automating Standard Bioinformatic Analysis, Z. Gunner Lawless, Dana Dittoe, Dale R. Thompson, Steven C. Ricke
Trunctrimmer: A First Step Towards Automating Standard Bioinformatic Analysis, Z. Gunner Lawless, Dana Dittoe, Dale R. Thompson, Steven C. Ricke
Computer Science and Computer Engineering Undergraduate Honors Theses
Bioinformatic analysis is a time-consuming process for labs performing research on various microbiomes. Researchers use tools like Qiime2 to help standardize the bioinformatic analysis methods, but even large, extensible platforms like Qiime2 have drawbacks due to the attention required by researchers. In this project, we propose to automate additional standard lab bioinformatic procedures by eliminating the existing manual process of determining the trim and truncate locations for paired end 2 sequences. We introduce a new Qiime2 plugin called TruncTrimmer to automate the process that usually requires the researcher to make a decision on where to trim and truncate manually after …
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
University Scholar Projects
The Riemann Hypothesis, posed in 1859 by Bernhard Riemann, is about zeros
of the Riemann zeta-function in the complex plane. The zeta-function can be repre-
sented as a sum over positive integers n of terms 1/ns when s is a complex number
with real part greater than 1. It may also be represented in this region as a prod-
uct over the primes called an Euler product. These definitions of the zeta-function
allow us to find other representations that are valid in more of the complex plane,
including a product representation over its zeros. The Riemann Hypothesis says that
all …
Dynamic Task Allocation In Partially Defined Environments Using A* With Bounded Costs, James Hendrickson
Dynamic Task Allocation In Partially Defined Environments Using A* With Bounded Costs, James Hendrickson
Doctoral Dissertations and Master's Theses
The sector of maritime robotics has seen a boom in operations in areas such as surveying and mapping, clean-up, inspections, search and rescue, law enforcement, and national defense. As this sector has continued to grow, there has been an increased need for single unmanned systems to be able to undertake more complex and greater numbers of tasks. As the maritime domain can be particularly difficult for autonomous vehicles to operate in due to the partially defined nature of the environment, it is crucial that a method exists which is capable of dynamically accomplishing tasks within this operational domain. By considering …
Evolving Efficient Floor Plans For Hospital Emergency Rooms, Alex Ramsey
Evolving Efficient Floor Plans For Hospital Emergency Rooms, Alex Ramsey
Theses/Capstones/Creative Projects
Genetic Algorithms find wide use in optimization problems across many fields of research, including crowd simulation. This paper proposes that genetic algorithms could be used to create better floor plans for hospital emergency rooms, potentially saving critical time in high risk situations. The genetic algorithm implemented makes use of a hospital-specific crowd simulation to accurately evaluate the effectiveness of produced layouts. The results of combining genetic algorithms with a crowd simulation are promising. Future work may improve upon these results to produce better, more optimal hospital floor plans.
Machine Learning Approaches To Dribble Hand-Off Action Classification With Sportvu Nba Player Coordinate Data, Dembe Stephanos
Machine Learning Approaches To Dribble Hand-Off Action Classification With Sportvu Nba Player Coordinate Data, Dembe Stephanos
Electronic Theses and Dissertations
Recently, strategies of National Basketball Association teams have evolved with the skillsets of players and the emergence of advanced analytics. One of the most effective actions in dynamic offensive strategies in basketball is the dribble hand-off (DHO). This thesis proposes an architecture for a classification pipeline for detecting DHOs in an accurate and automated manner. This pipeline consists of a combination of player tracking data and event labels, a rule set to identify candidate actions, manually reviewing game recordings to label the candidates, and embedding player trajectories into hexbin cell paths before passing the completed training set to the classification …
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …
Cross-Modal Food Retrieval: Learning A Joint Embedding Of Food Images And Recipes With Semantic Consistency And Attention Mechanism;, Hao Wang, Doyen Sahoo, Chenghao Liu, Ke Shu, Achananuparp Palakorn, Ee Peng Lim, Steven Hoi
Cross-Modal Food Retrieval: Learning A Joint Embedding Of Food Images And Recipes With Semantic Consistency And Attention Mechanism;, Hao Wang, Doyen Sahoo, Chenghao Liu, Ke Shu, Achananuparp Palakorn, Ee Peng Lim, Steven Hoi
Research Collection School Of Computing and Information Systems
Food retrieval is an important task to perform analysis of food-related information, where we are interested in retrieving relevant information about the queried food item such as ingredients, cooking instructions, etc. In this paper, we investigate cross-modal retrieval between food images and cooking recipes. The goal is to learn an embedding of images and recipes in a common feature space, such that the corresponding image-recipe embeddings lie close to one another. Two major challenges in addressing this problem are 1) large intra-variance and small inter-variance across cross-modal food data; and 2) difficulties in obtaining discriminative recipe representations. To address these …
Implementation Of Uniform Interpolationalgorithms, Jose A. Castellanos Joo
Implementation Of Uniform Interpolationalgorithms, Jose A. Castellanos Joo
Computer Science ETDs
This thesis discusses algorithms for the uniform interpolation problem and presents their implementation for the following theories: (quantifier-free) equality with uninterpreted functions (EUF), unit two-variable per inequality (UTVPI), and theoretic aspects for the combination of the two previous theories. The uniform interpolation algorithms implemented in this thesis were originally proposed in \cite{KAPUR2017}. Refutational proof-based solutions are the usual approach of many interpolation algorithms \cite{10.1007/978-3-642-00768-2_34, mcmillan2011interpolants, 10.1007/978-3-540-24730-2_2}. The approach taken in \cite{KAPUR2017} relies on quantifier-elimination heuristics to construct a uniform interpolant using one of the two formulas involved in the interpolation problem. The latter makes it possible to study the complexity …
Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Parachuri, Akshat Kumar
Action Selection For Composable Modular Deep Reinforcement Learning, Vaibhav Gupta, Daksh Anand, Praveen Parachuri, Akshat Kumar
Research Collection School Of Computing and Information Systems
In modular reinforcement learning (MRL), a complex decision making problem is decomposed into multiple simpler subproblems each solved by a separate module. Often, these subproblems have conflicting goals, and incomparable reward scales. A composable decision making architecture requires that even the modules authored separately with possibly misaligned reward scales can be combined coherently. An arbitrator should consider different module’s action preferences to learn effective global action selection. We present a novel framework called GRACIAS that assigns fine-grained importance to the different modules based on their relevance in a given state, and enables composable decision making based on modern deep RL …
Deep Learning And Optimization In Visual Target Tracking, Mohammadreza Javanmardi
Deep Learning And Optimization In Visual Target Tracking, Mohammadreza Javanmardi
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Visual tracking is the process of estimating states of a moving object in a dynamic frame sequence. It has been considered as one of the most paramount and challenging topics in computer vision. Although numerous tracking methods have been introduced, developing a robust algorithm that can handle different challenges still remains unsolved. In this dissertation, we introduce four different trackers and evaluate their performance in terms of tracking accuracy on challenging frame sequences. Each of these trackers aims to address the drawbacks of their peers. The first developed method is called a structured multi-task multi-view tracking (SMTMVT) method, which exploits …
Quantum Simulation Using High-Performance Computing, Collin Beaudoin, Christian Trefftz, Zachary Kurmas
Quantum Simulation Using High-Performance Computing, Collin Beaudoin, Christian Trefftz, Zachary Kurmas
Masters Theses
Hermitian matrix multiplication is one of the most common actions that is performed on quantum matrices, for example, it is used to apply observables onto a given state vector/density matrix.
ρ→Hρ
Our goal is to create an algorithm to perform the matrix multiplication within the constraints of QuEST [1], a high-performance simulator for quantum circuits. QuEST provides a system-independent platform for implementing and simulating quantum algorithms without the need for access to quantum machines. The current implementation of QuEST supports CUDA, MPI, and OpenMP, which allows programs to run on a wide variety of systems.
A Deep Analysis And Algorithmic Approach To Solving Complex Fitness Issues In Collegiate Student Athletes, Holly N. Puckett
A Deep Analysis And Algorithmic Approach To Solving Complex Fitness Issues In Collegiate Student Athletes, Holly N. Puckett
Honors College Theses
Sports are not simply an entertainment source. For many, it creates a sense of community, support, and trust among both fans and athletes alike. In order to continue the sense of community sports provides, athletes must be properly cared for in order to perform at the highest level possible. Thus, their fitness and health must be monitored continuously. In a professional sense, one can expect individualized attention to athletes daily due to an abundance of funding and resources. However, when looking at college communities and student athletes within them, the number of athletes per athletic trainer increases due to both …
Sql Injection & Web Application Security: A Python-Based Network Traffic Detection Model, Nyki Anderson
Sql Injection & Web Application Security: A Python-Based Network Traffic Detection Model, Nyki Anderson
Cybersecurity Undergraduate Research Showcase
The Internet of Things (IoT) presents a great many challenges in cybersecurity as the world grows more and more digitally dependent. Personally identifiable information (PII) (i,e., names, addresses, emails, credit card numbers) is stored in databases across websites the world over. The greatest threat to privacy, according to the Open Worldwide Application Security Project (OWASP) is SQL injection attacks (SQLIA) [1]. In these sorts of attacks, hackers use malicious statements entered into forms, search bars, and other browser input mediums to trick the web application server into divulging database assets. A proposed technique against such exploitation is convolution neural network …
Implications Of The Quantum Dna Model For Information Sciences, F. Matthew Mihelic
Implications Of The Quantum Dna Model For Information Sciences, F. Matthew Mihelic
Faculty Publications
The DNA molecule can be modeled as a quantum logic processor, and this model has been supported by pilot research that experimentally demonstrated non-local communication between cells in separated cell cultures. This modeling and pilot research have important implications for information sciences, providing a potential architecture for quantum computing that operates at room temperature and is scalable to millions of qubits, and including the potential for an entanglement communication system based upon the quantum DNA architecture. Such a system could be used to provide non-local quantum key distribution that could not be blocked by any shielding or water depth, would …
Distfold: Distance-Guided Protein Folding, Matthew Bernardini
Distfold: Distance-Guided Protein Folding, Matthew Bernardini
Theses
Protein structure prediction and its associated key sub-problems such as distance map prediction are of significance importance in biology and bioinformatics. The inter-residue distance prediction problem, or distance prediction in short, is to predict the physical distance between amino acids in a three-dimensional (3D) space, given a protein's one-dimensional sequence information. While there exist many methods to predict distance maps, there are currently no methods that can take those predicted distance maps and build 3D models from them in an ab initio way, i.e., without using any other information. This works aims to fill this gap by: a) developing a …
Technological Tethereds: Potential Impact Of Untrustworthy Artificial Intelligence In Criminal Justice Risk Assessment Instruments, Sonia M. Gipson Rankin
Technological Tethereds: Potential Impact Of Untrustworthy Artificial Intelligence In Criminal Justice Risk Assessment Instruments, Sonia M. Gipson Rankin
Faculty Scholarship
Issues of racial inequality and violence are front and center in today’s society, as are issues surrounding artificial intelligence (AI). This Article, written by a law professor who is also a computer scientist, takes a deep dive into understanding how and why hacked and rogue AI creates unlawful and unfair outcomes, particularly for persons of color.
Black Americans are disproportionally featured in criminal justice, and their stories are obfuscated. The seemingly endless back-to-back murders of George Floyd, Breonna Taylor, and Ahmaud Arbery, and heartbreakingly countless others have finally shaken the United States from its slumbering journey towards intentional criminal justice …
A Comprehensive Mapping And Real-World Evaluation Of Multi-Object Tracking On Automated Vehicles, Alexander Bassett
A Comprehensive Mapping And Real-World Evaluation Of Multi-Object Tracking On Automated Vehicles, Alexander Bassett
Doctoral Dissertations and Master's Theses
Multi-Object Tracking (MOT) is a field critical to Automated Vehicle (AV) perception systems. However, it is large, complex, spans research fields, and lacks resources for integration with real sensors and implementation on AVs. Factors such those make it difficult for new researchers and practitioners to enter the field.
This thesis presents two main contributions: 1) a comprehensive mapping for the field of Multi-Object Trackers (MOTs) with a specific focus towards Automated Vehicles (AVs) and 2) a real-world evaluation of an MOT developed and tuned using COTS (Commercial Off-The-Shelf) software toolsets. The first contribution aims to give a comprehensive overview of …
Dijkstra’S Pathfinder, Taylor F. Malamut
Dijkstra’S Pathfinder, Taylor F. Malamut
Honors Theses
Dijkstra’s algorithm has been widely studied and applied since it was first published in 1959. This research shows that Dijkstra’s algorithm can be used to find the shortest path between two stations on the Washington D.C. Metro. After exploring different types of research and applying Dijkstra’s algorithm, it was found that the algorithm will always yield the shortest path, even if visually a shorter path was initially expected.
Toward A Quantum Neural Network: Proposing The Qaoa Algorithm To Replace A Feed Forward Neural Network, Erick Serrano
Toward A Quantum Neural Network: Proposing The Qaoa Algorithm To Replace A Feed Forward Neural Network, Erick Serrano
Undergraduate Research Symposium Posters
With a surge in popularity of machine learning as a whole, many researchers have sought optimization methods to reduce the complexity of neural networks; however, only recent attempts have been made to optimize neural networks via quantum computing methods. In this paper, we describe the training process of a feed forward neural network (FFNN) and the time complexity of the training process. We highlight the inefficiencies of the FFNN training process, particularly when implemented with gradient descent, and introduce a call to action for optimization of a FFNN. Afterward, we discuss the strides made in quantum computing to improve the …