Index: doc/theses/mike_brooks_MMath/background.tex
===================================================================
--- doc/theses/mike_brooks_MMath/background.tex	(revision 037dc57ad1a06c496591a80d9ddae32adb53676e)
+++ doc/theses/mike_brooks_MMath/background.tex	(revision 9c12dd0d4c6ee7140864345a0fd28f78e9b0400d)
@@ -491,5 +491,5 @@
 \end{cfa}
 \end{tabular}
-\caption{Pre-VLA Fixed \vs Variable Contiguous Matrix Styles}
+\caption{Pre-VLA contiguous matrix styles, fixed \vs variable}
 \label{f:FixedVariable}
 \end{figure}
@@ -580,5 +580,5 @@
 \end{cfa}
 \end{tabular}
-\caption{C99 Contiguous \vs Non-contiguous Matrix Styles}
+\caption{C99 matrix styles, contiguous \vs non-contiguous }
 \label{f:ContiguousNon-contiguous}
 \end{figure}
@@ -672,5 +672,6 @@
 \end{cfa}
 \end{tabular}
-\caption{Multiple ways to declare an array parameter.
+\caption[Multiple ways to declare an array parameter]{
+Multiple ways to declare an array parameter.
 Across a valid row, every declaration is equivalent.
 Each column gives a declaration style, where the style for that column is read from the first row.
@@ -955,6 +956,6 @@
 \subfloat[Wrapped value]{\label{f:WrappedValue}\usebox\myboxC}
 
-\caption{
-		Three styles of link attachment:
+\caption[Three styles of link attachment]{
+		Three styles of link attachment.
 		% \protect\subref*{f:Intrusive}~intrusive, \protect\subref*{f:WrappedRef}~wrapped reference, and \protect\subref*{f:WrappedValue}~wrapped value.
 		The diagrams show the memory layouts that result after the code runs, eliding the head object \lstinline{reqs};
@@ -1012,5 +1013,5 @@
 	\lstinput[language=C++]{100-117}{lst-issues-attach-reduction.hpp}
 	\lstinput[language=C++]{150-150}{lst-issues-attach-reduction.hpp}
-	\caption{
+	\caption[Simulation of wrapped using intrusive]{
 		Simulation of wrapped using intrusive.
 		Illustrated by pseudocode implementation of an STL-compatible API fragment using LQ as the underlying implementation.
@@ -1048,5 +1049,5 @@
 		\hspace*{1.5in}\includegraphics[page=2]{lst-issues-direct.pdf}
 	}
-	\caption{
+	\caption[Example of simultaneity using LQ lists]{
 		Example of simultaneity using LQ lists.
 		The zoomed-out diagram (right/top) shows the complete multi-linked data structure.
@@ -1214,5 +1215,5 @@
 	\centering
 	\includegraphics[width=\textwidth]{lst-issues-ident.pdf}
-	\caption{
+	\caption[Comparison of headed and ad-hoc list identities]{
 		Comparison of headed and ad-hoc list identities, for various list lengths.
 		Pointers are logical, meaning that no claim is intended about which part of an object is being targeted.
@@ -1256,6 +1257,6 @@
 	\centering
 	\includegraphics[width=0.55\textwidth]{lst-issues-end.pdf}
-	\caption{
-		LQ sub-object-level representation of links and ends.
+	\caption[LQ field-level representation of links and ends]{
+		LQ field-level representation of links and ends.
 		Each object's memory is pictured as a vertical strip.
 		The location, within a strip, at which an arrow points, is significant.