Finding a minimum spanning tree (MST) is a fundamental graph algorithm with applications in many fields. This paper presents ECL-MST, a fast MST implementation designed specifically for GPUs. ECL-MST is based on a parallelization approach that unifies Kruskal's and Borůvka's algorithm and incorporates new and existing optimizations from the literature, including implicit path compression and edge-centric operation. On two test systems, it outperforms leading GPU and CPU codes from the literature on all of our 17 input graphs from various domains. On a Titan V GPU, ECL-MST is, on average, 4.6 times faster than the next fastest code, and on an RTX 3080 Ti GPU, it is 4.5 times faster. On both systems, ECL-MST running on the GPU is roughly 30 times faster than the fastest parallel CPU code.

This paper describes the results of an investigation into methods of preprocessing architectural plots to enable them to be processed very quickly via OCR, detecting the region containing the relevant metadata legend and obtaining it in machine-readable form for e.g. automated folding and filenaming applications. We show how a processing pipeline adapted to this type of content can vastly decrease processing time, maintaining acceptable accuracy. Initial results show a reduction in total processing time from 2--3 minutes to around 15 seconds for most documents encountered, with the folding orientation being correctly detected in 78% of cases and the legend region being completely detected in 60% of cases, high enough for the use-case at hand.

Accessibility features in the Adobe Portable Document Format (PDF) help facilitate access to electronic information for people with disabilities. This workshop explores how to create accessible PDF documents, from within Adobe Acrobat and other applications; how to use the Adobe Acrobat PDF accessibility checker and repair workflow; best practices for accessibility; and how accessibility has been built into forthcoming ISO standards (PDF/UA, PDF 32000-2).