Artificial Intelligence and Robotics Commons^™

Design And Analysis Of Modern Quantum Neural Network Architectures For Intelligent Systems, Lakshmi Chandrakanth Kasireddy, Prabhakara Rao Kapula, Dineshkumar Rajendran, Neha Bharani, Srikanth Pulipeti, Islombek Khushvaktov

Computer Science Faculty Publications

Quantum neural networks (QNNs) offer a principled pathway for integrating quantum computation with machine learning through superposition- and entanglement-based representations. This chapter proposes an architecture-aware design and evaluation framework for modern QNNs, emphasizing robustness and system feasibility alongside predictive performance. Multiple architectures variational QNNs, quantum convolutional neural networks, tensor-network hybrids, and fully quantum models—are assessed under a unified protocol. Experimental analysis shows that the proposed architecture-search–guided QNN achieves 91.8% classification accuracy and an F1-score of 0.914, outperforming fixed-template variational QNNs by approximately 5.6 percentage points. Under depolarizing noise with probability p = 0.10, the proposed model retains 85.3% accuracy, whereas …

Maxgrnet: A Multi-Axis Vision Transformer With Improved Generalization For Eye Disease Classification Using Explainable Ai With Insertion-Deletion Operations On Fundus Images, Md Mehedi Hasan Santo, Fuyad Hasan Bhoyan, Fuad Ibne Jashim Farhad, Fahmid Al Farid, Sovon Chakraborty, Md Humaion Kabir Mehedi, Jia Uddin, Hezerul Bin Abdul Karim

Computer Science Faculty Publications

Eye diseases, including diabetic retinopathy (DR), glaucoma, and cataracts, represent a major global health concern and can lead to severe visual impairment or blindness if not identified in a timely manner. This study proposes a novel eye disease classification framework based on a multi-axis vision transformer (MaxViT) applied to color fundus images with Explainable Artificial Intelligence (XAI) techniques to enhance model transparency. The proposed architecture integrates transformer-based attention mechanisms with Global Response Normalization (GRN)-based multi-layer perceptron (MLP) layers to capture complex spatial and contextual relationships within fundus images effectively. The model was evaluated on a publicly available eye disease classification …

Toward An Event-Level Analysis Of Hadron Structure Using Differential Programming, Kevin Braga, Markus Diefenthaler, Steven Goldenberg, Daniel Lersch, Yaohang Li, Jian-Wei Qiu, Kishansingh Rajput, Felix Ringer, Nobuo Sato, Malachi Schram

Computer Science Faculty Publications

Reconstructing the internal properties of hadrons in terms of fundamental quark and gluon degrees of freedom is a central goal in nuclear and particle physics. This effort lies at the core of major experimental programs, such as the Jefferson Lab 12 GeV program and the upcoming Electron-Ion Collider. A primary challenge is the inherent inverse problem: converting large-scale observational data from collision events into the fundamental quantum correlation functions (QCFs) that characterize the microscopic structure of hadronic systems within the theory of QCD. Recent advances in scientific computing and machine learning have opened new avenues for addressing this challenge using …

The Crucial Role Of Machine Learning Models In Predicting Current Childhood Asthma: Model Comparison, Calibration, And Shap-Based Interpretation, Aditya Chakraborty, A. K.M. Raquibul Bashar

Epidemiology, Biostatistics, & Environmental Health Faculty Publications

Background: Asthma is one of the most prominent chronic diseases in children and one of the most challenging ailments to diagnose in infants and preschoolers in the United States. Predictive models can be instrumental in improving early diagnosis, personalized treatment strategies, and disease progression. By utilizing nationalized data, this study focuses on building and comparing high-performing analytical predictive models based on the relevant risk factors and identifying the most influential predictors.

Methods: We analyzed cross-sectional BRFSS Asthma Call-Back Survey data (2011-2020; N = 9,813) and randomly split participants into training and testing sets. An XGBoost model (hyperparameters tuned via grid …

Error-Driven Density Control For Compact Gaussian Splatting Under Sparse Supervision, Abdelrhman Elrawy

Theses and Dissertations (Comprehensive)

This thesis studies efficiency and stability challenges in Gaussian-splatting-based reconstruction under sparse supervision. In few-shot novel view synthesis, standard 3D Gaussian Splatting (3DGS) can overfit the limited training views and grow an unnecessarily large number of primitives due to limitations in its Adaptive Density Control (ADC) mechanism. This thesis introduces an error-driven reformulation of ADC that triggers densification using opacity gradients as a lightweight proxy for rendering error, and shows that such aggressive densification must be paired with delayed and conservative pruning to prevent destructive create--destroy cycles. When combined with depth-based geometric regularization, the resulting framework produces substantially more compact …

Evops: Evolutionary Patch Selection In The Embedding Space Of Whole Slide Images, Saya Hashemian

Theses and Dissertations (Comprehensive)

Computational pathology increasingly relies on the analysis of Whole-Slide Images (WSIs), which capture tissue specimens at gigapixel resolution. Because a single slide is far too large to process directly, the

prevailing paradigm decomposes each WSI into thousands of small patches and encodes them as high- dimensional feature embeddings using deep learning backbones. While effective, this paradigm carries a

substantial cost: the resulting collections of patch embeddings are computationally expensive to store and process, and they are frequently dominated by redundant, homogeneous, or otherwise uninformative tissue regions that dilute the diagnostic signal. Existing patch selection methods largely depend on heuristic or …

Explainable Physics-Based Constraints On Reinforcement Learning For Accelerator Optimization, Jonathan Colen, Malachi Schram, Kishansingh Rajput, Armen Kasparian

Data Science Faculty Publications

We present a reinforcement learning (RL) framework for optimizing particle accelerator experiments that builds explainable physics-based constraints on agent behavior. The goal is to increase transparency and trust by letting users verify that the agent’s decision-making process incorporates suitable physics. Our algorithm uses a learnable surrogate function for physical observables, such as energy, and uses them to fine-tune how actions are chosen. This surrogate can be represented by a neural network or by an interpretable sparse dictionary model. We test our algorithm on a range of particle accelerator optimization environments designed to emulate the Continuous Electron Beam Accelerator Facility at …

Deep Incomplete Multi-View Clustering Via Hierarchical Imputation And Alignment, Yiming Du, Ziyu Wang, Jian Li, Rui Ning, Lusi Li

Computer Science Faculty Publications

Incomplete multi-view clustering (IMVC) aims to discover shared cluster structures from multi-view data with partial observations. The core challenges lie in accurately imputing missing views without introducing bias, while maintaining semantic consistency across views and compactness within clusters. To address these challenges, we propose DIMVC-HIA, a novel deep IMVC framework that integrates hierarchical imputation and alignment with four key components: (1) view-specific autoencoders for latent feature extraction, coupled with a view-shared clustering predictor to produce soft cluster assignments; (2) a hierarchical imputation module that first estimates missing cluster assignments based on cross-view contrastive similarity, and then reconstructs missing features using …

Untrained Position-Encoded Multilayer Perceptron Network For Structured Illumination Microscopy Reconstruction, Sahil Sharma, Leonidas Zimianitis, Krishnendu Samanta, Balpreet Singh Ahluwalia, Joby Joseph, Dushan N. Wadduwage

Computer Science Faculty Publications

Structured Illumination Microscopy (SIM) enables super-resolution imaging by encoding high-frequency spatial information through patterned light. While traditional Fourier-based reconstruction methods are prone to artifacts under suboptimal conditions, recent deep learning approaches often require large training datasets and lack adaptability across different imaging setups. In this work, we present Position Encoded Multi-Layer Perceptron (PEM) network that leverages implicit neural representations (INRs) and SIM forward-model-driven modeling to reconstruct super-resolved images without any training data. PEM-SIM represents each spatial coordinate as a combination of sinusoidal functions across multiple frequencies, enabling rich encoding of fine spatial detail. A forward model grounded in SIM image …

Geovig And Purevig: Geometry-Aware Architectures For Efficient Computer Vision, Omar Ismail

Theses and Dissertations (Comprehensive)

Deploying deep learning models for medical image analysis on mobile devices requires a balance between inference latency, memory footprint, and delineating anatomical boundaries with high accuracy. While Convolutional Neural Networks (CNNs) and mobile Vision Transformers (ViTs) offer efficiency, they often struggle to model the irregular, non-local geometric structures inherent in biological tissues without incurring prohibitive computational costs. In this thesis, we introduce GeoViG (Geometric Vision Graph), an architecture that bridges the gap between efficient grid-based processing and explicit Geometric Deep Learning. GeoViG introduces a novel transition from high-resolution pixel grids to low-resolution dynamic graphs via a SpreadEdgePool operator, a geometry-aware …

Markov Chain Wave Generative Adversarial Network For Bee Bioacoustic Signal Synthesis, Kumudu Samarappuli, Iman Ardekani, Mahsa Mohaghegh, Abdolhossein Sarrafzadeh

Electrical & Computer Engineering Faculty Publications

This paper presents a framework for synthesizing bee bioacoustic signals associated with hive events. While existing approaches like WaveGAN have shown promise in audio generation, they often fail to preserve the subtle temporal and spectral features of bioacoustic signals critical for event-specific classification. The proposed method, MCWaveGAN, extends WaveGAN with a Markov Chain refinement stage, producing synthetic signals that more closely match the distribution of real bioacoustic data. Experimental results show that this method captures signal characteristics more effectively than WaveGAN alone. Furthermore, when integrated into a classifier, synthesized signals improved hive status prediction accuracy. These results highlight the potential …

Machine Learning-Based Lifetime Prediction Of Lithium Batteries: A Comparative Assessment For Electric Vehicle Applications, Abdelilah Hammou, Raffaele Petrone, Demba Diallo, Boubekeur Tala-Ighil, Philippe Makany Boussiengue, Hicham Chaoui, Hamid Gualous

Electrical & Computer Engineering Faculty Publications

This paper evaluates and compares four data-driven methods (Gaussian Process Regression (GPR), echo state network (ESN), gated recurrent unit (GRU), and long short-term memory (LSTM)) for lithium-ion capacity prognostics adapted to electric vehicle conditions. This comparison aims to find the most efficient prognosis method considering two constraints: the limitation of computational power and the unavailability of on-board capacity measurement that requires full charge and discharge conditions. The machine learning models are trained using capacity values estimated under vehicle conditions. The ageing data is collected from cycling tests of two battery chemistries, Lithium Fer Phosphate (LFP) and Nickel Manganese Cobalt (NMC), …

Face Value: A Computational Approach To Subjective Impressions Of Faces, Kevin Kpankou

Undergraduate Research Symposium

Various computational models of first impressions have been developed to uncover the mechanisms driving these judgments. However, the implicit notion of a singular ``human'' often overlooks meaningful individual differences in beliefs, attitudes, and associations, as well as culturally grounded group-level constructs. In this paper, we extend Cultural Consensus Theory (CCT) to estimate culturally shared beliefs about faces by incorporating latent constructs structured around interpretable facial features extracted via computer vision algorithms. We apply our model to a large-scale dataset of people’s first impressions of faces. Our approach reveals a robust mapping between facial features and culturally constructed impressions, allowing us …

Privacy Preserving-Based Artificial Intelligence For Precision Agriculture, Partha P. Sengupta

Dissertations

The research work finds a solution to precision agriculture of cotton cultivation using artificial intelligence (AI) models. Two sets of model performance based on the application are selected namely a low resource and a high resource setting. This is because using drone surveys to capture images identifying the classes of stressed and unstressed cotton plantation requires limited model architecture and CPU based computation. Thus, traditional AI models were selected for low resource settings. Again, for high computation intensive models like transfer learning-convolution neural network (CNN) based architectures were grouped into high resource settings. There was another issue of class imbalance …

Topic Modeling And Culturomic Analysis Of 30,000 Books Over 100 Years Using Gensim, Michael A. Freeman

Electronic Theses and Dissertations

This thesis explores the cultural influence of historical events on English-language fiction published between 1820 and 1929. Using a corpus of 30,256 digitized books from Project Gutenberg, Latent Dirichlet Allocation (LDA) topic modeling was applied to identify recurring themes across eleven decades. The study sought to determine whether historically significant events could be detected within fictional narratives. One clear instance emerged: Napoleon Bonaparte and the Napoleonic Wars appeared explicitly in the 1820s corpus. Beyond this, several thematic patterns were observed—such as maritime language in the 1840s, national identity in the 1880s, and youth-oriented dialogue in the early 20th century—that plausibly …

Attorneys And Ai: How Lawyers Use Artificial Intelligence And Analyze Its Impacts, Matthew I. Hall, Christian Turner, Eddie A. Gomez Schieber, Nathaniel Kite, Ari Schlesinger

Scholarly Works

AI systems are testing lawyers' professional ethics obligations of competence, confidentiality, and candor. In the legal profession, the widespread availability of AI systems presents opportunities, like improving the review of documents during the discovery stage of a lawsuit, and challenges, illustrated by the handful of high-profile incidents where lawyers submitted legal briefs in court citing and describing fictitious cases based on AI-generated output. We conducted interviews with 44 legal professionals in the U.S. to understand how attorneys are making sense of AI technology and the impacts these technologies are having on their profession, legal ethics, and legal institutions. We describe …

Spatio-Temporal Gcn With Softmax Classifier For Skeleton-Based Human Action Recognition, Kabul Khudaybergenov, Avazjon Marakhimov, Zahriddin Muminov

Chemical Technology, Control and Management

Skeleton-based human action recognition is an important research area with many practical applications. Most existing methods rely on single representations of skeletal sequences, which cannot totally obtain all the complex features of human movements. This paper presents LFHAR (Latent Features for Human Action Recognition), a new framework that uses multiple spatio-temporal latent representations to improve the extraction of action features. Our method captures how skeletal poses change over time and combines motion information from both individual joints and connected body parts. The proposed approach applies graph-based processing to each skeleton frame in a sequence, then arranges the resulting graph features …

Branch-And-Cut-And-Price For Agile Earth Observation Satellite Scheduling, Guansheng Peng, Jianjiang Wang, Guopeng Song, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The Agile Earth Observation Satellite scheduling selects and sequences satellite observations of possible targets on the Earth’s surface, each with a specific profit and multiple time windows. The objective is to maximize the collected profit of all observations completed under some operational constraints. The problem can be modeled as a variant of the Team Orienteering Problem with Time Windows (TOPTW). The key differences with the regular TOPTW are twofold: first, a time-dependent transition time is required for each pair of consecutive observations to adjust the camera’s look angles. Second, the time windows of each target vary during different observation cycles, …

Csc36000 - Modern Distributed Computing Assignment, Saptarashmi Bandyopadhyay

Open Educational Resources

This assignment covers standard performance metrics for Distributed Systems and the basics of Multiprocessing for CSC36000 - Modern Distributed Computing at the City College of New York CUNY. It is an interactive coding assignment intended to be executed in a Python notebook.

Search Trajectory Network-Enhanced Multi-Objective Dynamic Algorithm Configuration, Robbert Reijnen, Zaharah Bukhsh, Hoong Chuin Lau, Yaoxin Wu, Yingqian Zhang

Research Collection School Of Computing and Information Systems

Deep reinforcement learning (DRL) has emerged as an effective technique for dynamic algorithm configuration, particularly in evolutionary computation, enabling adaptive parameter updates during algorithmic execution. DRL-based methods have shown broad applicability across different problem domains and are designed to configure algorithms without problem-specific information, making them highly transferable across problem variants and scalable to different problem sizes. This paper proposes a novel graph neural network-based approach that learns representations of Search Trajectory Networks (STNs) to track the convergence behavior of multiple objectives and dynamically reconfigures multiobjective evolutionary algorithms during execution. By capturing how solutions evolve and interact over time, the …

Heuristic Weight Initialization For Transfer Learning In Classification Problems, Musulmon Lolaev, Anand Paul, Jeonghong Kim

School of Public Health Faculty Publications

Transfer learning is the predominant method for adapting pre-trained models on another task to new domains while preserving their internal architectures and augmenting them with requisite layers in Deep Neural Network models. Training intricate pre-trained models on a sizable dataset requires significant resources to fine-tune hyperparameters carefully. Most existing initialization methods mainly focus on gradient flow-related problems, such as gradient vanishing or exploding, or other existing approaches that require extra models that do not consider our setting, which is more practical. To address these problems, we suggest employing gradient-free heuristic methods to initialize the weights of the final new-added fully …

L3net: Localized And Layered Reparameterization For Incremental Learning, Xuandi Luo, Huaidong Zhang, Yi Xie, Hongrui Zhang, Xuemiao Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

Model-based class incremental learning (CIL) methods aim to address the challenge of catastrophic forgetting by retaining certain parameters and expanding the model architecture. However, retaining too many parameters can lead to an overly complex model, increasing inference overhead. Additionally, compressing these parameters to reduce the model size can result in performance degradation. To tackle these challenges, we propose a novel three-stage CIL framework called Localized and Layered Reparameterization for Incremental Learning (L3Net). The rationale behind our approach is to balance model complexity and performance by selectively expanding and optimizing critical components. Specifically, the framework introduces a Localized Dual-path Expansion structure, …

Solving Two-Stage Stochastic Integer Programs Via Representation Learning, Yaoxin Wu, Zhiguang Cao, Wen Song, Yingqian Zhang

Research Collection School Of Computing and Information Systems

Solving stochastic integer programs (SIPs) is extremely intractable due to the high computational complexity. To solve two-stage SIPs efficiently, we propose a conditional variational autoencoder (CVAE) for scenario representation learning. A graph convolutional network (GCN) based VAE embeds scenarios into a low-dimensional latent space, conditioned on the deterministic context of each instance. With the latent representations of stochastic scenarios, we perform two auxiliary tasks: objective prediction and scenario contrast, which predict scenario objective values and the similarities between them, respectively. These tasks further integrate objective information into the representations through gradient backpropagation. Experiments show that the learned scenario representations can …

Pure And Strong Nash Equilibrium Computation In Compactly Representable Aggregate Games, Jared Soundy, Mohammad T. Irfan, Hau Chan

Research & Publications

Aggregate games model interdependent decision making when an agent’s utility depends on their own choice and the aggregation of everyone's choices. We define a compactly representable subclass of aggregate games we call additive aggregate games, which encompasses popular games like congestion games, anonymous games, Schelling games, etc. We study computational questions on pure Nash equilibrium (PNE) and pure strong Nash equilibrium (SNE). We show that PNE existence is NP-complete for very simple cases of additive aggregate games. We devise an efficient algorithmic scheme for deciding the existence of a PNE and computing one (if it exists) for bounded aggregate space. …

Syntax-Enhanced Boundary-Aware Named Entity Recognition Model, Chuanming Yu, Bin Deng, Zhengang Zhang

Journal of Scientific Information Research

[Purpose/significance] This study addresses the issue of inadequate perception of entity boundaries in traditional character-level modeling-based named entity recognition models by integrating syntax information containing entity boundary features into the task using a multi-head graph attention network with dense connections. This integration enhances the effectiveness of named entity recognition.

[Method/process] This study proposes a Syntax-enhanced Boundary-aware Named Entity Recognition Model (SynBNER), which utilizes BERT for text semantic representation and integrates syntax information using a dense-connected graph attention network. This integration incorporates implicit entity boundary information from syntax information into word representations, thereby enhancing the model's entity boundary perception capability.

[Result/conclusion] …

Multi-Label Classification Of Acoustic And Electronic Drum Sounds Using Machine Learning, Sean Perman

Electronic Theses and Dissertations

This paper presents a system for multi-class classification of drum sounds using audio signal processing and machine learning techniques. The project utilizes a diverse dataset of both acoustic and electronic drum samples and extracts ten distinct audio features to capture the timbral and temporal characteristics of each sound. The methodology includes signal preprocessing, feature extraction, and the application of supervised classification algorithms to distinguish between multiple drum classes. Experimental evaluations demonstrate that the selected features significantly enhance classification accuracy across a varied dataset. These findings underscore the effectiveness of combining traditional audio processing with modern machine learning, offering promising applications …

Topodino: Self-Supervised Topological Representation Learning For Neuronal Morphologies, Yasser Binbisher

Master's Theses

Neuronal cell types are categorized by transcriptomic identity, yet their morphological heterogeneity defies this classification. In response, researchers have adopted unsupervised graph representation learning as a tool to reveal morphological variation within single-class transcriptomic types. However, the complex geometry of neuronal morphology—especially long axons and dense dendrites—challenges graph neural networks, which struggle with message propagation across extended structures. To mitigate this, current approaches enforce sub-sampling on neuronal graphs and omit axons entirely, sacrificing critical biological features for computational efficiency. To overcome this trade-off, this thesis introduces TopoDINO, a self-supervised, topology-aware representation learning model designed to preserve the full hierarchical organization …

Property Testing Ai: An Efficient Frontier, Paul Sopher Lintilhac

Dartmouth College Ph.D Dissertations

In this dissertation, we take a step towards addressing the major problem of a lack of standardized and rigorous approaches to testing and evaluation of AI systems. Taking inspiration from both the fields of Property Testing and Property Based Testing (for programs), we develop a novel taxonomy of partially overlapping classes of properties of AI systems, including simple properties, compound properties, higher order properties, data relation properties, and architecture-utility properties. We argue that this taxonomy categorizes a diverse set of AI traits -- including accuracy, fairness, robustness, monotonicity, point-wise and global privacy properties, sensitivity, and more -- according to the …

Data Encoding, Compilation, And Algorithms For Quantum Machine Learning, Aviraj Sinha

Computer Science and Engineering Theses and Dissertations

Quantum computing enables new approaches to data processing, especially in quantum machine learning. Unlike classical systems, quantum data must be synthesized through operations and can exist in superposition. Encoding choices affect efficiency, noise resilience, and trainability—key factors in quantum machine learning models. This dissertation enhances quantum data encodings by extending quantum read-only memory (QROM) beyond binary representations, improving efficiency and parallelism. It introduces new compilation methods for quantum random number generators (QRNGs), supporting non-parametric distributions for post-quantum cryptography. Additionally, it explores Cayley graph-based encodings to extract spectral features for quantum machine learning.

Algorithms To Estimate Contours: Two Applications Of Analytical Tools In Differential Geometry And Topology, Mohammad Abirul Islam

Computer Science ETDs

We develop distributed robotics algorithms with analytical tools needed to define and analyze angle turned and distance traversed by robots executing geometric algorithms. We then use these analytical tools to obtain information, via sensor measurements, about an a priori unknown surface. Our contributions are threefold. First, we develop the Sketch Algorithm, which estimates the boundary of any unknown contour and is asymptotically optimal in terms of distance traversed and angle turned. Second, we present experimental field work that validates the Sketch Algorithm. Finally, we propose an approach to find multiple sources of a surface with potential applications to approximate that …