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

Computer Sciences Commons

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

Articles 1 - 3 of 3

Full-Text Articles in Computer Sciences

The Pawn System: How Procedurally Adaptive Webbed Narratives Create Stories, Steven T. Bordelon May 2024

The Pawn System: How Procedurally Adaptive Webbed Narratives Create Stories, Steven T. Bordelon

University of New Orleans Theses and Dissertations

This thesis describes the design, implementation, and testing of a novel procedural narrative system called the Procedurally Adaptive Webbed Narrative (PAWN) system. PAWN procedurally generates characters and, responding to choices made by the player, produces more responsive characters and relationships involving the player and these narrative agents. Initially, this thesis discusses other interactive narrative types that exist, such as emergent or event-driven narratives, along with their strengths and weaknesses. It then examines each aspect of PAWN, starting with initial actor generation, then moving to the capturing of game events and translating them into logical objects called Occurrences. These Occurrences are …


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

University of 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

University of 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 …