Artificial Intelligence and Robotics Commons^™

Synthetic-Chicken-Fillets, Chirantan Sen Mukherjee, Seung-Chul Yoon, William J. Beksi

Agriculture

This Synthetic-Chicken-Fillets dataset contains 1,000 synthetic 3D meshes designed to capture the natural variance and size diversity of real broiler fillets. The collection was developed to test automated woody breast detection algorithms within a physics-based simulation environment. We utilized a seed dataset of 2D depth maps derived from 40 real-world RGBD point cloud scans. These real depth maps were fed into a few-shot transfer learning pipeline using a generative adversarial network architecture. The resulting generated depth maps were reconstructed back into 3D meshes. The length and thickness of each mesh were randomly scaled based on physical measurements of real broiler …

3dcotton, Md Ahmed Al Muzaddid, William J. Beksi

Agriculture - Archive

3DCotton is an image dataset consisting of 8 cotton plants recorded at the Texas A&M University Research Farm. The images were captured using an Apple iPhone at a resolution of 1040x1920 pixels. Approximately 150 images per plant were taken from a distance of 1 m by recording multiple viewpoints. These images can be utilized for developing 3D reconstruction methods.

Llms In Compiler Construction, Raffi Khatchadourian

Open Educational Resources

These lecture slides survey the use of large language models (LLMs) in compiler construction for a graduate compiler course (CSc 81010). They situate LLMs across the compiler pipeline and examine representative work: foundation models trained on LLVM IR and assembly (Meta's LLM Compiler), LLM-driven code optimization, binary decompilation (LLM4Decompile), and LLM-assisted automated refactoring—alongside the challenges of applying probabilistic models to tasks that demand correctness. The slides are a self-contained HTML (W3C Slidy) deck with editable Pandoc Markdown source. Part of a two-session unit on advanced compiler topics; see also "Deep Learning Compilers."

Deep Learning Compilers, Raffi Khatchadourian

Open Educational Resources

These lecture slides introduce deep learning compilers for a graduate compiler-construction course (CSc 81010). Building on the classical compiler pipeline, they show how modern machine-learning systems compile tensor programs: static tensor and type analysis (illustrated by a WALA/Ariadne-based refactoring of imperative TensorFlow code to graph mode), MLIR-based end-to-end compilation with IREE, and the PyTorch 2.x stack—TorchDynamo graph capture, AOTAutograd, PrimTorch operator decomposition, and TorchInductor lowering to Triton (GPU) and C++/OpenMP (CPU). The slides are a self-contained HTML (W3C Slidy) deck with editable Pandoc Markdown source. Part of a two-session unit on advanced compiler topics; see also "LLMs in Compiler Construction."

Ueof, Nick Truong, Pritam P. Karkomar, William J. Beksi

Event-Based Vision - Archive

UEOF is the first synthetic underwater event-based optical flow dataset derived from physically-based ray-traced RGBD sequences. It was constructed using a modern video-to-event pipeline applied to rendered underwater videos. It consists of realistic event data streams with dense ground-truth flow, depth, and camera motion. The dataset is composed of 12 minutes and 51 seconds of data across 13,714 RGB frames. This results in a total of 4.94 billion events across all scenes. UEOF exhibits a high dynamic range of motion with a mean flow magnitude of 6.1 px and a median of 3.6 px. The motion distribution is heavy-tailed. While …

Challenges In Engineering Machine Learning (Software) Systems, Raffi T. Khatchadourian Ph.D.

Open Educational Resources

Lecture slides on the software engineering challenges unique to machine learning systems, for an undergraduate software engineering course. After contrasting traditional programming with machine learning, the deck examines why the usual tools for managing complexity—abstraction, reuse, and composition—are harder to apply to ML, given the lack of clear specifications and modularity. It covers concept drift, feedback loops (illustrated with crime-prediction and recommendation examples), and the accumulation of technical debt in ML systems, including the role and pitfalls of notebooks in moving from experimentation to production. Based on "Machine Learning in Production/AI Engineering" by Christian Kaestner and Eunsuk Kang (Carnegie Mellon …

Introduction To Machine Learning And Machine Learning Systems, Raffi T. Khatchadourian Ph.D.

Open Educational Resources

Lecture slides introducing machine learning and machine learning systems for an undergraduate software engineering course. Topics include what machine learning is and how it differs from traditional programming, foundation models, the major types of learning (supervised, unsupervised, reinforcement, and others), and applications across domains. Using a food-delivery time-prediction case study, the deck walks through a typical ML pipeline—data collection and cleaning, feature engineering, model training, and evaluation—and covers evaluation methods (precision and recall, confusion matrices, error measures) along with underfitting versus overfitting and the realities of learning and evaluation in production. Based on "Machine Learning in Production/AI Engineering" by Christian …

Closing Remarks, Jay Yang

Value and Responsibility in AI Technologies

Closing remarks from director of Gonzaga's Institute for Informatics and Applied Technology, Dr. Jay Yang, with a reception to follow.

Identification And Characterization Of Intrinsically Disordered Protein Regions, Guy Wayne Dayhoff Ii

USF Tampa Graduate Theses and Dissertations

This dissertation investigates protein intrinsic disorder and intrinsically disordered protein regions (IDPRs) through the development and application of advanced computational and experimental techniques. Chapter 1 provides an introduction to protein intrinsic disorder, outlining the historical context and fundamental concepts that highlight the importance of intrinsically disordered proteins (IDPs) and IDPRs in various biological processes. Chapter 2 focuses on the rapid prediction and analysis of protein intrinsic disorder. We introduce RIDAO (Rapid Intrinsic Disorder Analysis Online), a high-efficiency web-based tool that integrates multiple disorder predictors. RIDAO significantly outperforms existing predictors in computational efficiency, making it suitable for large-scale proteomic studies. We …

Optimizing Cybersecurity Operations Using Data-Driven Intelligence, Jalal Ghadermazi

USF Tampa Graduate Theses and Dissertations

Cybersecurity operations centers (CSOCs) play a crucial role in safeguarding organizations from cyber threats. CSOC operations are divided into two main areas: Intrusion detection systems (IDS) and security response team (SRT) operations. Machine learning (ML) and deep learning (DL) advancements have significantly improved IDSs. IDS can be either flow-based, suitable for offline analysis, or packet-based, which analyze traffic in real-time. However, packet-based IDS often treat packets independently, ignoring the sequential nature of network communication. Additionally, recent ML/DL approaches also struggle with capturing global and structural information and novel attack detection due to their reliance on labeled data. The SRT within …

Citdet, Jordan A. James, Heather K. Manching, Matthew R. Mattia, Kim D. Bowman, Amanda M. Hulse-Kemp, William J. Beksi

Computer Science and Engineering Datasets - Archive

The CitDet dataset is composed of images captured at the USDA Agricultural Research Service Subtropical Insects and Horticulture Research Unit in Fort Pierce, FL, USA. Data was collected between October 2021 and October 2022. 579 images were captured from different sections of the orchard using the open-source application Field Book on Android tablets. While collecting images, we faced the camera in a portrait orientation directly centered on the tree of interest. All images were taken at the edge of the soil in the tree row to simulate a ground-based robot imaging the tree while moving between two rows of trees. …

Texcot22, Md Ahmed Al Muzaddid, William J. Beksi

Computer Science and Engineering Datasets - Archive

The TexCot22 dataset is a set of cotton crop video sequences for training and testing multi-object tracking methods. Each tracking sequence is 10 to 20 seconds in length. The dataset contains of a total of 30 sequences of which 17 are for training and the remaining 13 are for testing. Among the training sequences, 2 of them consist of roughly 5,000 annotated images, which can be used to train a cotton boll detection model. The video sequences were captured at 4K resolution and at distinct frame rates (e.g., 10, 15, 30). There are typically 2 to 10 cotton bolls per …

Cs04all: Machine Learning Module, Hunter R. Johnson

Open Educational Resources

These are materials that may be used in a CS0 course as a light introduction to machine learning.

The materials are mostly Jupyter notebooks which contain a combination of labwork and lecture notes. There are notebooks on Classification, An Introduction to Numpy, and An Introduction to Pandas.

There are also two assessments that could be assigned to students. One is an essay assignment in which students are asked to read and respond to an article on machine bias. The other is a lab-like exercise in which students use pandas and numpy to extract useful information about subway ridership in NYC. …

Cs04all: Natural Language Processing Project, Hunter R. Johnson

Open Educational Resources

In this archive there are two activities/assignments suitable for use in a CS0 or Intro course which uses Python.

In the first activity, students are asked to "fill in the code" in a series of short programs that compute a similarity metric (cosine similarity) for text documents. This involves string tokenization, and frequency counting using Python string methods and datatypes.

https://cocalc.com/share/bde99afd-76c8-493d-9608-db9019bcd346/171/Proj1?viewer=share/

In the second activity (taken directly from Think Python 2e) students use a pronunciation dictionary to solve a riddle involving homophones.

https://cocalc.com/share/bde99afd-76c8-493d-9608-db9019bcd346/171/Dicts2?viewer=share/

This OER material was produced as a result of the CS04ALL CUNY OER project

Computational Thinking And Literacy, Sharin Rawhiya Jacob, Mark Warschauer

Journal of Computer Science Integration

Today’s students will enter a workforce that is powerfully shaped by computing. To be successful in a changing economy, students must learn to think algorithmically and computationally, to solve problems with varying levels of abstraction. These computational thinking skills have become so integrated into social function as to represent fundamental literacies. However, computer science has not been widely taught in K-12 schools. Efforts to create computer science standards and frameworks have yet to make their way into mandated course requirements. Despite a plethora of research on digital literacies, research on the role of computational thinking in the literature is sparse. …

Concept Drift Datasets, Patrick Lindstrom

Doctoral

This zip file contains the datasets used in the PhD thesis:

Lindstrom, P., 2013. Handling Concept Drift in the Context of Expensive Labels. Technological University Dublin. For more information about the datasets please see the README file and the aforementioned thesis.

Delayed Observation Planning In Partially Observable Domains, Pradeep Reddy Varakantham, Janusz Marecki

Research Collection School Of Computing and Information Systems

Traditional models for planning under uncertainty such as Markov Decision Processes (MDPs) or Partially Observable MDPs (POMDPs) assume that the observations about the results of agent actions are instantly available to the agent. In so doing, they are no longer applicable to domains where observations are received with delays caused by temporary unavailability of information (e.g. delayed response of the market to a new product). To that end, we make the following key contributions towards solving Delayed observation POMDPs (D-POMDPs): (i) We first provide an parameterized approximate algorithm for solving D-POMDPs efficiently, with desired accuracy; and (ii) We then propose …

Dragon Age: Origins - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Dragon Age: Origins with help and explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 156 maps and benchmark problem sets.

Maze Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 60 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated mazes with corridor widths of 1, 2, 4, 8, 16, or 32. There are 10 maps and problem sets for each corridor size.

Room Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 40 maps of size 512x512 and problem sets. Maps are divided into rooms of size 8x8, 16x16, 32x32, and 64x64. There are 10 maps and problem sets for each room size. Maps with differing room sizes are not scaled: thickness of walls and passages differs.

Random Obstacle Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 70 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated by blocking grid cells. Maps contain 10%, 15%, 20%, 25%, 30%, 35%, or 40% blocked cells. There are 10 maps and problem sets for each percentage.

Warcraft Iii - Maps & Benchmark Problems, Nathan R. Sturtevant, Blizzard Corp.

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Warcraft III from Blizzard Corp. for use and distribution as benchmark problems.

Contains 36 maps and benchmark problem sets, scaled to 512x512 and converted to a simple grid-based format.

Baldur's Gate Ii - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted by Yngvi Björnsson from Baldur's Gate II with explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 75 maps and benchmark problem sets scaled to 512 x 512 and 120 original scale maps.

Starcraft - Maps & Benchmark Problems, Nathan R. Sturtevant, Blizzard Corp.

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Starcraft from Blizzard Corp. for use and distribution as benchmark problems.

Contains 75 maps and benchmark problem sets, converted to standard format by Dave Churchill and post-processed to remove all but the largest connected component.