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

Theory and Algorithms Commons

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

LSU New Orleans Theses and Dissertations

Discipline
Keyword
Publication Year

Articles 1 - 12 of 12

Full-Text Articles in Theory and Algorithms

Coupled Machine Learning Models: Combining Observations And Numerical Analysis In A Physics-Regularized Approach, Austin B. Schmidt Dec 2025

Coupled Machine Learning Models: Combining Observations And Numerical Analysis In A Physics-Regularized Approach, Austin B. Schmidt

LSU New Orleans Theses and Dissertations

This dissertation investigates surrogate modeling for fixed-location environmental forecasting using novel data-combination techniques. The work surveys the landscape of observational measurements and numerically generated data, identifying similar research and gaps in current methodologies. The ratio-coupled training framework is introduced to combine two data sources per predicted feature through a tunable parameter that weights training signal strength. An optimization scheme is developed to simultaneously tune surrogate weights and the coupled signal ratio, allowing relative influence between signals to act as an explicit regularizer. Three case studies demonstrate the methodology and approach in a variety of contexts. The first study is based …


Comparative Predictive Analysis Of Stock Performance In The Tech Sector, Asaad Sendi May 2024

Comparative Predictive Analysis Of Stock Performance In The Tech Sector, Asaad Sendi

LSU New Orleans Theses and Dissertations

This study compares the performance of deep learning models, including Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU), and Transformer, in predicting stock prices across five companies (AAPL, CSCO, META, MSFT, and TSLA) from July 2019 to July 2023. Key findings reveal that GRU models generally exhibit the lowest Mean Absolute Error (MAE), indicating higher precision, particularly notable for CSCO with a remarkably low MAE. While LSTM models often show slightly higher MAE values, they outperform Transformer models in capturing broader trends and variance in stock prices, as evidenced by higher R-squared (R2) values. Transformer models generally exhibit higher MAE …


Choreographing The Rhythms Of Observation: Dynamics For Ranged Observer Bipartite-Unipartite Spatiotemporal (Robust) Networks, Edward A. Holmberg Iv May 2024

Choreographing The Rhythms Of Observation: Dynamics For Ranged Observer Bipartite-Unipartite Spatiotemporal (Robust) Networks, Edward A. Holmberg Iv

LSU New Orleans Theses and Dissertations

Existing network analysis methods struggle to optimize observer placements in dynamic environments with limited visibility. This dissertation introduces the novel ROBUST (Ranged Observer Bipartite-Unipartite SpatioTemporal) framework, offering a significant advancement in modeling, analyzing, and optimizing observer networks within complex spatiotemporal domains. ROBUST leverages a unique bipartite-unipartite approach, distinguishing between observer and observable entities while incorporating spatial constraints and temporal dynamics.

This research extends spatiotemporal network theory by introducing novel graph-based measures, including myopic degree, spatial closeness centrality, and edge length proportion. These measures, coupled with advanced clustering techniques like Proximal Recurrence, provide insights into network structure, resilience, and the effectiveness …


Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar Aug 2022

Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar

LSU New Orleans Theses and Dissertations

Parallel computing plays a crucial role in processing large-scale graph data. Complex network analysis is an exciting area of research for many applications in different scientific domains e.g., sociology, biology, online media, recommendation systems and many more. Graph mining is an area of interest with diverse problems from different domains of our daily life. Due to the advancement of data and computing technologies, graph data is growing at an enormous rate, for example, the number of links in social networks is growing every millisecond. Machine/Deep learning plays a significant role for technological accomplishments to work with big data in modern …


Accelerating The Information-Theoretic Approach Of Community Detection Using Distributed And Hybrid Memory Parallel Schemes, Md Abdul Motaleb Faysal May 2020

Accelerating The Information-Theoretic Approach Of Community Detection Using Distributed And Hybrid Memory Parallel Schemes, Md Abdul Motaleb Faysal

LSU New Orleans Theses and Dissertations

There are several approaches for discovering communities in a network (graph). Despite being approximating in nature, discovering communities based on the laws of Information Theory has a proven standard of accuracy. The information-theoretic algorithm known as Infomap developed a decade ago for detecting communities, did not foresee the tremendous growth of social networking, multimedia, and massive information boom. To discover communities in massive networks, we have designed a distributed-memory-parallel Infomap in the MPI framework. Our design reaches scalability of over 500 processes capable of processing networks with millions of edges while maintaining quality comparable to the sequential Infomap. We have …


Scalable Community Detection Using Distributed Louvain Algorithm, Naw Safrin Sattar May 2019

Scalable Community Detection Using Distributed Louvain Algorithm, Naw Safrin Sattar

LSU New Orleans Theses and Dissertations

Community detection (or clustering) in large-scale graph is an important problem in graph mining. Communities reveal interesting characteristics of a network. Louvain is an efficient sequential algorithm but fails to scale emerging large-scale data. Developing distributed-memory parallel algorithms is challenging because of inter-process communication and load-balancing issues. In this work, we design a shared memory-based algorithm using OpenMP, which shows a 4-fold speedup but is limited to available physical cores. Our second algorithm is an MPI-based parallel algorithm that scales to a moderate number of processors. We also implement a hybrid algorithm combining both. Finally, we incorporate dynamic load-balancing in …


Manana: A Generalized Heuristic Scoring Approach For Concept Map Analysis As Applied To Cybersecurity Education, Sharon Elizabeth Blake Gatto Aug 2018

Manana: A Generalized Heuristic Scoring Approach For Concept Map Analysis As Applied To Cybersecurity Education, Sharon Elizabeth Blake Gatto

LSU New Orleans Theses and Dissertations

Concept Maps (CMs) are considered a well-known pedagogy technique in creating curriculum, educating, teaching, and learning. Determining comprehension of concepts result from comparisons of candidate CMs against a master CM, and evaluate "goodness". Past techniques for comparing CMs have revolved around the creation of a subjective rubric. We propose a novel CM scoring scheme called MAnanA based on a Fuzzy Similarity Scaling (FSS) score to vastly remove the subjectivity of the rubrics in the process of grading a CM. We evaluate our framework against a predefined rubric and test it with CM data collected from the Introduction to …


Applications Of Artificial Intelligence In Power Systems, Samin Rastgoufard May 2018

Applications Of Artificial Intelligence In Power Systems, Samin Rastgoufard

LSU New Orleans Theses and Dissertations

Artificial intelligence tools, which are fast, robust and adaptive can overcome the drawbacks of traditional solutions for several power systems problems. In this work, applications of AI techniques have been studied for solving two important problems in power systems.

The first problem is static security evaluation (SSE). The objective of SSE is to identify the contingencies in planning and operations of power systems. Numerical conventional solutions are time-consuming, computationally expensive, and are not suitable for online applications. SSE may be considered as a binary-classification, multi-classification or regression problem. In this work, multi-support vector machine is combined with several evolutionary computation …


Spatial Data Mining Analytical Environment For Large Scale Geospatial Data, Zhao Yang Dec 2016

Spatial Data Mining Analytical Environment For Large Scale Geospatial Data, Zhao Yang

LSU New Orleans Theses and Dissertations

Nowadays, many applications are continuously generating large-scale geospatial data. Vehicle GPS tracking data, aerial surveillance drones, LiDAR (Light Detection and Ranging), world-wide spatial networks, and high resolution optical or Synthetic Aperture Radar imagery data all generate a huge amount of geospatial data. However, as data collection increases our ability to process this large-scale geospatial data in a flexible fashion is still limited. We propose a framework for processing and analyzing large-scale geospatial and environmental data using a “Big Data” infrastructure. Existing Big Data solutions do not include a specific mechanism to analyze large-scale geospatial data. In this work, we extend …


Reaper – Toward Automating Mobile Cloud Communication, Daniel R. Ward Aug 2013

Reaper – Toward Automating Mobile Cloud Communication, Daniel R. Ward

LSU New Orleans Theses and Dissertations

Mobile devices connected to cloud based services are becoming a mainstream method of delivery up-to-date and context aware information to users. Connecting mobile applications to cloud service require significant developer effort. Yet this communication code usually follows certain patterns, varying accordingly to the specific type of data sent and received from the server. By analyzing the causes of theses variations, we can create a system that can automate the code creation for communication from a mobile device to a cloud server. To automate code creation, a general pattern must extracted. This general solution can then be applied to any database …


Application Of Digital Forensic Science To Electronic Discovery In Civil Litigation, Brian Roux Dec 2012

Application Of Digital Forensic Science To Electronic Discovery In Civil Litigation, Brian Roux

LSU New Orleans Theses and Dissertations

Following changes to the Federal Rules of Civil Procedure in 2006 dealing with the role of Electronically Stored Information, digital forensics is becoming necessary to the discovery process in civil litigation. The development of case law interpreting the rule changes since their enactment defines how digital forensics can be applied to the discovery process, the scope of discovery, and the duties imposed on parties. Herein, pertinent cases are examined to determine what trends exist and how they effect the field. These observations buttress case studies involving discovery failures in large corporate contexts along with insights on the technical reasons those …


Theoretical Approaches To The Characterization Of Water, Aqueous Interfaces, And Improved Sampling Of Protein Conformational Changes, Alexis J. Lee Aug 2012

Theoretical Approaches To The Characterization Of Water, Aqueous Interfaces, And Improved Sampling Of Protein Conformational Changes, Alexis J. Lee

LSU New Orleans Theses and Dissertations

Methods to advance the understanding of water and other aqueous systems are devel- oped. This work falls into three areas: The creation of better interaction potentials for water, improved methods for sampling configurational space, and the applications of these methods to understand systems of interest. Charge transfer has been shown by ab initio methods to be important in the water–water and water–ion interactions. A model for treating charge transfer in liquid water and aqueous systems is presented in this manuscript. The model is called Discrete Charge Transfer (DCT) and is based on the commonly-used TIP4P/2005 model, which represents the charge …