arXiv subjects

John Sheehan

Publications and source records attributed to John Sheehan.

5 recordsLinked to original sources

arXiv2025

From Documents to Database: Failure Modes for Industrial Assets

We propose an interactive system using foundation models and user-provided technical documents to generate Failure Mode and Effects Analyses (FMEA) for industrial equipment. Our system aggregates unstructured content across documents to generate an FMEA and stores it in a relational database. Leveraging this tool, the time required for creation of this knowledge-intensive content is reduced, outperforming traditional manual approaches. This demonstration showcases the potential of foundation models to facilitate the creation of specialized structured content for enterprise asset management systems.

cs.DB↗

arXiv2024

FMEA Builder: Expert Guided Text Generation for Equipment Maintenance

Foundation models show great promise for generative tasks in many domains. Here we discuss the use of foundation models to generate structured documents related to critical assets. A Failure Mode and Effects Analysis (FMEA) captures the composition of an asset or piece of equipment, the ways it may fail and the consequences thereof. Our system uses large language models to enable fast and expert supervised generation of new FMEA documents. Empirical analysis shows that foundation models can correctly generate over half of an FMEA's key content. Results from polling audiences of reliability professionals show a positive outlook on using generative AI to create these documents for critical assets.

cs.CL↗

arXiv2021

Even Orientations and Pfaffian graphs

We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}. Our graph theoretical characterization is equivalent to the one proved by Little in \cite{L73} (cf. \cite{LR}) using linear algebra arguments.

math.CO↗

arXiv2021

Optimal Seat Allocation Under Social Distancing Constraints

The Covid-19 pandemic introduces new challenges and constraints for return to work business planning. We describe a space allocation problem that incorporates social distancing constraints while optimising the number of available safe workspaces in a return to work scenario. We propose and demonstrate a graph based approach that solves the optimisation problem via modelling as a bipartite graph of disconnected components over a graph of constraints. We compare results obtained with a constrained random walk and a linear programming approach.

cs.OH↗

arXiv2000

Minimum multiplicities of subgraphs and Hamiltonian systems

Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly $| A(G)|/ | A(G) \cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least this number. If in addition $A(U) \subseteq A(G)$ then U is a strong fixing subgraph. Fixing subgraphs are important in many areas of graph theory. We consider them in the context of Hamiltonian graphs

math.CO↗