\chapter{Removed systems}

This appendix contains a list of systems that were removed for one of
several reasons:

\begin{itemize}
\item The code used to work, but is no longer working due to updates
  in code that it depends on.  More work is needed for it to be usable
  again.
\item The code never worked, and it needs more work in order for it to
  be considered part of \sysname{}.
\item The code never worked, and we have no ambition to make it work,
  but it nevertheless contains interesting ideas that we might revive
  in the future.
\end{itemize}

Add section for removed C backend.

\chapter{Removed systems}

This appendix contains a list of systems that were removed for one of
several reasons:

\begin{itemize}
\item The code used to work, but is no longer working due to updates
  in code that it depends on.  More work is needed for it to be usable
  again.
\item The code never worked, and it needs more work in order for it to
  be considered part of \sysname{}.
\item The code never worked, and we have no ambition to make it work,
  but it nevertheless contains interesting ideas that we might revive
  in the future.
\end{itemize}

\section{Stack-oriented \clanguage{} backend}

Removed 2016-08-09.

SHA1 ID: b983763485ac5efb6fe3319f015b414b3e7ea5f5


\section{Android application}
\label{sec:android-app}

\subsection{Navigation}
\label{subsec:drawing}
\todo[inline]{\kasia{Describe menu, tabs, ScrollViews, write about managing mind maps.}}
\begin{figure}[h]
	\centering
	\missingfigure{\michal{List view screen}}
	\caption{View of mind map list, initial screen.}
	\label{fig:screen-maplist}
\end{figure}

\subsection{Drawing mind maps}
\label{subsec:drawing}
\todo[inline]{\kasia{Describe all stages of implementation here.}}
\todo[inline]{\kasia{Include positioning.}}

\subsection{Creating, editing and removing mind nodes}
\label{subsec:drawing}

\begin{figure}[h]
	\centering
	\missingfigure{\michal{Mind map view screen}}
	\caption{View of mind map.}
	\label{fig:screen-map}
\end{figure}

\subsection{User interface}
\label{subsec:ui}
\todo[inline]{\kasia{Why we designed UI in such a way.}}

Add a subsection about importing files and a missing figure

\section{Android application}
\label{sec:android-app}

\subsection{Navigation}
\label{subsec:drawing}

\todo[inline]{\kasia{Describe menu, tabs, ScrollViews, write about managing mind maps.}}
\begin{figure}[h]
	\centering
	\missingfigure{\michal{List view screen}}
	\caption{View of mind map list, initial screen.}
	\label{fig:screen-maplist}
\end{figure}

\subsection{Drawing mind maps}
\label{subsec:drawing}
\todo[inline]{\kasia{Describe all stages of implementation here.}}
\todo[inline]{\kasia{Include positioning.}}

\subsection{Creating, editing and removing mind nodes}
\label{subsec:drawing}

\begin{figure}[h]
	\centering
	\missingfigure{\michal{Mind map view screen}}
	\caption{View of mind map.}
	\label{fig:screen-map}
\end{figure}

\subsection{Importing from existing .xmind files}
\label{subsec:import}

\begin{figure}[h]
	\centering
	\missingfigure{\kasia{A file chooser screen}}
	\caption{View of file chooser - importing an existing .xmind file.}
	\label{fig:screen-filechooser}
\end{figure}

\subsection{User interface}
\label{subsec:ui}
\todo[inline]{\kasia{Why we designed UI in such a way.}}


\title{Milestone 4}
\author{Singularity Software}
\date{\today}

\documentclass[12pt]{article}
\usepackage[a4paper]{geometry}
\usepackage{makeidx}
\usepackage{lscape}
\usepackage{amsmath}
\usepackage{graphicx}
\usepackage[final]{pdfpages}

\geometry{top=1.0in, bottom=1.0in, left=1.0in, right=1.0in} % Sets the margins

\setlength{\parindent}{0pt} % Fixes the paragraph spacing problem

\renewcommand*\arraystretch{1.5}

\begin{document}

\begin{center}
	\LARGE{Milestone 5} \\
	\Large{\textit{Singularity Software}} \\
	\vspace{.05in}
	\normalsize{\today} \\
\end{center}

\section*{Sprints 4 Backlogs}
The following pages show the backlog for the previous sprint (sprint 4). \\

%\includepdf[pages={1-3}]{pdfs/MS5VersionOne/OldSprintDetail.pdf}

\section*{Integration Testing}

\section*{Code Maintenance Plan}

\clearpage

\end{document}

Update MS5 to include old sprint backlog.

\title{Milestone 4}
\author{Singularity Software}
\date{\today}

\documentclass[12pt]{article}
\usepackage[a4paper]{geometry}
\usepackage{makeidx}
\usepackage{lscape}
\usepackage{amsmath}
\usepackage{graphicx}
\usepackage[final]{pdfpages}

\geometry{top=1.0in, bottom=1.0in, left=1.0in, right=1.0in} % Sets the margins

\setlength{\parindent}{0pt} % Fixes the paragraph spacing problem

\renewcommand*\arraystretch{1.5}

\begin{document}

\begin{center}
	\LARGE{Milestone 5} \\
	\Large{\textit{Singularity Software}} \\
	\vspace{.05in}
	\normalsize{\today} \\
\end{center}

\section*{Sprints 4 Backlogs}
The following pages show the backlog for the previous sprint (sprint 4). \\

%\includepdf[pages={1-2}]{pdfs/MS5VersionOne/OldSprintDetail.pdf}

\section*{Integration Testing}

\section*{Code Maintenance Plan}

\clearpage

\end{document}


\section{Results}

Here are the results

Add license results to the report

\section{Results}

Here are the results

\subsubsection{Licenses}

73\% of respondents (16 out of 22) reported that they do not know or care about the type of license used in the project. Out of the 27\% (6 out of 22) respondents who reported that they care, one respondent only contributes to copyleft-licensed projects and five respondents only contribute to free software projects (permissive or copyleft). The four largest contributors by number of commits (out of the 22) only contribute to free software.


\section{Bloom filter usage}
\label{sec:bloom_filter}

    %TODO: reference
    A bloom filter is a probabilistic data structure which allows a fast check
    for a potential membership of an item in a set $B$.
    As a data structure, it consists of an array of a constant number $m$ of
    bits $b_0$ to $b_{m-1}$.
    For an empty set, all those bits are set to $0$.
    On insertion of an element into the set, $k$ hash functions $h_0$ to
    $h_{k-1}$ are applied to the element.
    The resulting values are transformed to positions within the array, e.g.
    through the modulo operation.
    Those bits are then set to $1$.
    Given a set of $n$ elements, the membership of an element $e$ may be checked
    by checking whether each bit ``pointed'' to by the hash functions applied to
    the new element are set.
    If one of those bits is not set, the element is not in the corresponding set
    $B$.

    \begin{equation}
        \exists_i : \neg b_{h_i(e)\%m} \Rightarrow e \notin B
    \end{equation}

    If all the bits relevant for the element are set, the element \emph{may} be
    in the set $B$:

    \begin{equation}
        \forall_i : b_{h_i(e)\%m} \Rightarrow
        p(e \in B) = \left(1 - \left(1 - \frac{1}{m} \right)^{kn} \right)^k
    \end{equation}

    In libreset, bloom filters will be used as filters to speed up some
    operations.
    The use of bloom filters will, however, exceed the classical use for
    speeding up lookups.
    The filter may also be used to speed up merges and intersections by allowing
    early recognition of disjunctive sets.


\begin{circuitikz}
	\draw(0,0) node[njfet,yscale=-1] (fet) {};
	\draw(fet.gate) |- (fet.drain);
	\draw(fet.source) to [vR, l_=Decade Box, mirror] ++(0,2)
	to [short] ++(1,0)
	to [ammeter] ++(0,-2) node[] (end) {};
	\draw(fet.drain) to [short] ++(1,0)
	to [V, l_=\SI{16}{\volt}DC \& \SI{32}{\volt}DC] ++(0, 2)
	to [short] ($(end)$);
	\draw (fet.gate) node[anchor=north east] {2N5459};
\end{circuitikz}

Change 'decade box' to 'Param{RD}' to match PSpice

\begin{circuitikz}
	\draw(0,0) node[njfet,yscale=-1] (fet) {};
	\draw(fet.gate) |- (fet.drain);
	\draw(fet.source) to [vR, l_=Param\{RD\}, mirror] ++(0,2)
	to [short] ++(1,0)
	to [ammeter] ++(0,-2) node[] (end) {};
	\draw(fet.drain) to [short] ++(1,0)
	to [V, l_=\SI{16}{\volt}DC \& \SI{32}{\volt}DC] ++(0, 2)
	to [short] ($(end)$);
	\draw (fet.gate) node[anchor=north east] {2N5459};
\end{circuitikz}


\begin{table}[htbp]
\centering
\begin{tabular}{ccc}

\hline
\rowcolor{lightgray}
\textbf{site\_id} & \textbf{lon} & \textbf{lat} \\
\hline
0 & -122.57000 & 38.11300 \\
1 & -122.11400 & 38.11300 \\
2 & -122.00000 & 37.91000 \\
3 & -122.00000 & 38.00000 \\
4 & -122.00000 & 38.11300 \\
5 & -122.00000 & 38.22500 \\
6 & -121.88600 & 38.11300 \\
\hline

\end{tabular} (\href{https://raw.githubusercontent.com/gem/oq-engine/master/doc/manual/oqum/hazard/verbatim/output_scenario_sites.csv}{Download example})}
\label{output:sitemesh}
\end{table}

Fix a broken link [skip CI]

\begin{table}[htbp]
\centering
\begin{tabular}{ccc}

\hline
\rowcolor{lightgray}
\textbf{site\_id} & \textbf{lon} & \textbf{lat} \\
\hline
0 & -122.57000 & 38.11300 \\
1 & -122.11400 & 38.11300 \\
2 & -122.00000 & 37.91000 \\
3 & -122.00000 & 38.00000 \\
4 & -122.00000 & 38.11300 \\
5 & -122.00000 & 38.22500 \\
6 & -121.88600 & 38.11300 \\
\hline

\end{tabular} \caption{Example of a sites csv output file for a scenario (\href{https://raw.githubusercontent.com/gem/oq-engine/master/doc/manual/oqum/hazard/verbatim/output_scenario_sites.csv}{Download example})}
\label{output:sitemesh}
\end{table}


% -*- mode: latex; TeX-master: "Vorbis_I_spec"; -*-
%!TEX root = Vorbis_I_spec.tex
\section*{Colophon}

\includegraphics[width=5cm]{fish_xiph_org}
\label{footer}

Ogg is a \href{https://xiph.org/}{Xiph.Org Foundation} effort
to protect essential tenets of Internet multimedia from corporate
hostage-taking; Open Source is the net's greatest tool to keep
everyone honest. See \href{https://xiph.org/about/'}{About
the Xiph.Org Foundation} for details.

Ogg Vorbis is the first Ogg audio CODEC.  Anyone may freely use and
distribute the Ogg and Vorbis specification, whether in a private,
public or corporate capacity.  However, the Xiph.Org Foundation and
the Ogg project (xiph.org) reserve the right to set the Ogg Vorbis
specification and certify specification compliance.

Xiph.Org's Vorbis software CODEC implementation is distributed under a
BSD-like license.  This does not restrict third parties from
distributing independent implementations of Vorbis software under
other licenses.

Ogg, Vorbis, Xiph.Org Foundation and their logos are trademarks (tm)
of the \href{https://xiph.org/}{Xiph.Org Foundation}.  These
pages are copyright (C) 1994-2015 Xiph.Org Foundation. All rights
reserved.

This document is set using \LaTeX.

Fix a link typo in the spec colophon.

% -*- mode: latex; TeX-master: "Vorbis_I_spec"; -*-
%!TEX root = Vorbis_I_spec.tex
\section*{Colophon}

\includegraphics[width=5cm]{fish_xiph_org}
\label{footer}

Ogg is a \href{https://xiph.org/}{Xiph.Org Foundation} effort
to protect essential tenets of Internet multimedia from corporate
hostage-taking; Open Source is the net's greatest tool to keep
everyone honest. See \href{https://xiph.org/about/}{About
the Xiph.Org Foundation} for details.

Ogg Vorbis is the first Ogg audio CODEC.  Anyone may freely use and
distribute the Ogg and Vorbis specification, whether in a private,
public or corporate capacity.  However, the Xiph.Org Foundation and
the Ogg project (xiph.org) reserve the right to set the Ogg Vorbis
specification and certify specification compliance.

Xiph.Org's Vorbis software CODEC implementation is distributed under a
BSD-like license.  This does not restrict third parties from
distributing independent implementations of Vorbis software under
other licenses.

Ogg, Vorbis, Xiph.Org Foundation and their logos are trademarks (tm)
of the \href{https://xiph.org/}{Xiph.Org Foundation}.  These
pages are copyright (C) 1994-2015 Xiph.Org Foundation. All rights
reserved.

This document is set using \LaTeX.


% -*- mode: latex; TeX-master: "Vorbis_I_spec"; -*-
%!TEX root = Vorbis_I_spec.tex
\section*{Colophon}

\includegraphics[width=5cm]{fish_xiph_org}
\label{footer}

Ogg is a \href{https://xiph.org/}{Xiph.Org Foundation} effort
to protect essential tenets of Internet multimedia from corporate
hostage-taking; Open Source is the net's greatest tool to keep
everyone honest. See \href{https://xiph.org/about.html}{About
the Xiph.Org Foundation} for details.

Ogg Vorbis is the first Ogg audio CODEC.  Anyone may freely use and
distribute the Ogg and Vorbis specification, whether in a private,
public or corporate capacity.  However, the Xiph.Org Foundation and
the Ogg project (xiph.org) reserve the right to set the Ogg Vorbis
specification and certify specification compliance.

Xiph.Org's Vorbis software CODEC implementation is distributed under a
BSD-like license.  This does not restrict third parties from
distributing independent implementations of Vorbis software under
other licenses.

Ogg, Vorbis, Xiph.Org Foundation and their logos are trademarks (tm)
of the \href{https://xiph.org/}{Xiph.Org Foundation}.  These
pages are copyright (C) 1994-2015 Xiph.Org Foundation. All rights
reserved.

This document is set using \LaTeX.

Fix about link in the specification.

% -*- mode: latex; TeX-master: "Vorbis_I_spec"; -*-
%!TEX root = Vorbis_I_spec.tex
\section*{Colophon}

\includegraphics[width=5cm]{fish_xiph_org}
\label{footer}

Ogg is a \href{https://xiph.org/}{Xiph.Org Foundation} effort
to protect essential tenets of Internet multimedia from corporate
hostage-taking; Open Source is the net's greatest tool to keep
everyone honest. See \href{https://xiph.org/about/'}{About
the Xiph.Org Foundation} for details.

Ogg Vorbis is the first Ogg audio CODEC.  Anyone may freely use and
distribute the Ogg and Vorbis specification, whether in a private,
public or corporate capacity.  However, the Xiph.Org Foundation and
the Ogg project (xiph.org) reserve the right to set the Ogg Vorbis
specification and certify specification compliance.

Xiph.Org's Vorbis software CODEC implementation is distributed under a
BSD-like license.  This does not restrict third parties from
distributing independent implementations of Vorbis software under
other licenses.

Ogg, Vorbis, Xiph.Org Foundation and their logos are trademarks (tm)
of the \href{https://xiph.org/}{Xiph.Org Foundation}.  These
pages are copyright (C) 1994-2015 Xiph.Org Foundation. All rights
reserved.

This document is set using \LaTeX.


% Encoding: UTF-8

@Article{ostgaard2002,
  author = {Foo Bar},
  title =  {energy},
  year =   {2012}
}

@comment{jabref-meta: saveActions:enabled;title;LowerCaseChanger;}

Modify entry so that save actions should be applied

% Encoding: UTF-8

@Article{ostgaard2002,
  author = {Foo Bar},
  title =  {Energy},
  year =   {2012}
}

@comment{jabref-meta: DATABASE_TYPE:BibTeX;}

@comment{jabref-meta: saveActions:enabled;title;LowerCaseChanger;}


## Interface: 40000

## Title: Lib: Ace3
## Notes: AddOn development framework
## Author: Ace3 Development Team
## X-Website: http://www.wowace.com
## X-Category: Library
## X-License: Limited BSD

LibStub\LibStub.lua
CallbackHandler-1.0\CallbackHandler-1.0.xml
AceAddon-3.0\AceAddon-3.0.xml
AceEvent-3.0\AceEvent-3.0.xml
AceTimer-3.0\AceTimer-3.0.xml
AceBucket-3.0\AceBucket-3.0.xml
AceHook-3.0\AceHook-3.0.xml
AceDB-3.0\AceDB-3.0.xml
AceDBOptions-3.0\AceDBOptions-3.0.xml
AceLocale-3.0\AceLocale-3.0.xml
AceLocale-3.1\AceLocale-3.1.xml
AceConsole-3.0\AceConsole-3.0.xml
AceGUI-3.0\AceGUI-3.0.xml
AceConfig-3.0\AceConfig-3.0.xml
AceComm-3.0\AceComm-3.0.xml
AceTab-3.0\AceTab-3.0.xml
AceSerializer-3.0\AceSerializer-3.0.xml

Ace3.lua

Remove AceLocale-3.1 from .toc too, ups.

## Interface: 40000

## Title: Lib: Ace3
## Notes: AddOn development framework
## Author: Ace3 Development Team
## X-Website: http://www.wowace.com
## X-Category: Library
## X-License: Limited BSD

LibStub\LibStub.lua
CallbackHandler-1.0\CallbackHandler-1.0.xml
AceAddon-3.0\AceAddon-3.0.xml
AceEvent-3.0\AceEvent-3.0.xml
AceTimer-3.0\AceTimer-3.0.xml
AceBucket-3.0\AceBucket-3.0.xml
AceHook-3.0\AceHook-3.0.xml
AceDB-3.0\AceDB-3.0.xml
AceDBOptions-3.0\AceDBOptions-3.0.xml
AceLocale-3.0\AceLocale-3.0.xml
AceConsole-3.0\AceConsole-3.0.xml
AceGUI-3.0\AceGUI-3.0.xml
AceConfig-3.0\AceConfig-3.0.xml
AceComm-3.0\AceComm-3.0.xml
AceTab-3.0\AceTab-3.0.xml
AceSerializer-3.0\AceSerializer-3.0.xml

Ace3.lua


\newpage
\section{Use Case - Hugin Link (HL)}
\label{UseCase:HL}

\begin{description}
\item[Priority:] Must
\item[Deadline:] M15
\item[Responsible:]
\end{description}

\subsubsection*{Description of the Use Case}

Enter a textual description of the use case. Link to other use cases or functionalities if needed.

\subsubsection*{Must-Requirements List of the Use Case}

\begin{enumerate}
\item Short Description
\end{enumerate}

\subsubsection*{Should-Requirements List of the Use Case}

\begin{enumerate}
\item Short Description
\end{enumerate}

\subsubsection*{Could-Requirements List of the Use Case}

\begin{enumerate}
\item Short Description
\end{enumerate}

Update in the use case Hugin Link

%!TEX root = ../MainDoc.tex
\newpage
\section{Use Case - Hugin Link (HL)}
\label{UseCase:HL}

\begin{description}
\item[Priority:] Must
\item[Deadline:] M15
\item[Responsible:] A. Fern\'andez
\end{description}

\subsubsection*{Description of the Use Case}

This use case contains all the functionality needed to link the AMIDST toolbox with the HUGIN software. This linkage is addressed by converting Hugin models into AMIDST models, and vice versa. This feature is extremely useful as it allows expanding the testing possibilities of the AMIDST models within a well-stablished platform as Hugin. Also, the link to Hugin can be used for providing some extra functionality to AMIDST that will not be implemented. Finally, the linkage is useful for comparison purposes, i.e., a new inference algorithm implemented in AMIDST could be compared with some state-of-the-art algorithm included in Hugin.

\subsubsection*{Must-Requirements List of the Use Case}

\begin{enumerate}
\item Bayesian network converter from AMIDST to Hugin format.
\item Bayesian network converter from Hugin to AMIDST format.
\item Possibility of saving the converted Hugin network in a \texttt{.net} file.
\end{enumerate}

\subsubsection*{Should-Requirements List of the Use Case}

\begin{enumerate}
\item
\end{enumerate}

\subsubsection*{Could-Requirements List of the Use Case}

\begin{enumerate}
\item Converter from AMIDST to HUGIN  and vice versa of some functionality that is not relevant for model representation.
\end{enumerate}


{% include 'preamble.tex' %}

\begin{document}

\section{Section 1}
\subsection{Subsection A}
{{ content }}

\end{document}

Add title, author, and date.

{% include 'preamble.tex' %}

\begin{document}
\title{Beamer Snippets}\author{Brandon Amos}\date{July 2014}

\section{Section 1}
\subsection{Subsection A}
{{ content }}

\end{document}


\chapter{Example graph}
\label{sec:example-graph}

\begin{figure}[ht]
    \centering
    \includegraphics[scale=\yedscale]{figures/example-graph-without-refreshes}
    \caption{Example graph (without refresh operations).}
    \label{fig:example-graph-without-refreshes}
\end{figure}

\begin{figure}[ht]
    \centering
    \includegraphics[scale=\yedscale]{figures/example-graph-with-refreshes}
    \caption{Example graph with refresh operations (currently deletions, inserts to be added).
    Deletions of a single element (node or edge) are denoted with a red cross \includegraphics[scale=0.14]{patterns/delete-single}, while recursive deletions are denoted with a purple cross \includegraphics[scale=0.14]{patterns/delete-recursively}.}
    \label{fig:example-graph-with-refreshes}
\end{figure}

Add more text to appendix, move includegraphics from caption to regular text

\chapter{Example graph}
\label{sec:example-graph}

\autoref{fig:example-graph-without-refreshes} shows a snapshot of an example graph.

\autoref{fig:example-graph-with-refreshes} shows an example graph with refresh operations. Deletions of a single element (node or edge) are denoted with a red cross \includegraphics[scale=0.14]{patterns/delete-single}, while recursive deletions are denoted with a purple cross \includegraphics[scale=0.14]{patterns/delete-recursively}.

\begin{figure}[ht]
    \centering
    \includegraphics[scale=\yedscale]{figures/example-graph-without-refreshes}
    \caption{Example graph snapshot (without refresh operations).}
    \label{fig:example-graph-without-refreshes}
\end{figure}

\begin{figure}[ht]
    \centering
    \includegraphics[scale=\yedscale]{figures/example-graph-with-refreshes}
    \caption{Example graph with refresh operations (currently deletions, inserts to be added).}
    \label{fig:example-graph-with-refreshes}
\end{figure}


@Proceedings{GordonAISTATS2011,
  booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
  editor = {Geoffrey Gordon and David Dunson and and Miroslav Dud\'ik},
  publisher = {JMLR Workshop and Conference Proceedings},
  logoright = {basic_files/SAIS_logo.jpg},
  volume = {15},
  year = {2011},
  shortname = {AISTATS 2011},
  OPTsections = {preface=Preface|default=Accepted Papers},
  month = {11--13 April},
  address = {Fort Lauderdale, FL, USA},
  sections = {preface=Preface|notable=Part I: Notable Papers|default=Part II: Regular Papers}

}

Remove extra and from editor list

@Proceedings{GordonAISTATS2011,
  booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
  editor = {Geoffrey Gordon and David Dunson and Miroslav Dud\'{i}k},
  publisher = {JMLR Workshop and Conference Proceedings},
  logoright = {basic_files/SAIS_logo.jpg},
  volume = {15},
  year = {2011},
  shortname = {AISTATS 2011},
  OPTsections = {preface=Preface|default=Accepted Papers},
  month = {11--13 April},
  address = {Fort Lauderdale, FL, USA},
  sections = {preface=Preface|notable=Part I: Notable Papers|default=Part II: Regular Papers}

}


%&manual
% The line above is used to indicate to the compiler that the pre-compiled preamble be used if it is available (a manual.fmt file will be searched for)

\documentclass{article}

\usepackage{manual}     % Simply include the package created specifically for lab manuals

\renewcommand{\arraystretch}{1.5}

% Define the variables that are required for generating the title of the document
\coursetitle{Dummy Course}
\experimentnumber{0}
\experimenttitle{Dummy Experiment}

\csname endofdump\endcsname     % This indicates the end of the "static" part of the preamble which is pre-compiled and placed in the manual.fmt file to speed up compilation.

\begin{document}

   \maketitle

   \input{theory}

   \newpage
   \maketitle           % Generate the title using the customized command defined in manual-defs.tex

   \setcounter{equation}{0}     % Restart equation numbering in the experiment section

   \input{experiment}

\end{document}

Reset the section number counter in the experiment half

%&manual
% The line above is used to indicate to the compiler that the pre-compiled preamble be used if it is available (a manual.fmt file will be searched for)

\documentclass{article}

\usepackage{manual}     % Simply include the package created specifically for lab manuals

\renewcommand{\arraystretch}{1.5}

% Define the variables that are required for generating the title of the document
\coursetitle{Dummy Course}
\experimentnumber{0}
\experimenttitle{Dummy Experiment}

\csname endofdump\endcsname     % This indicates the end of the "static" part of the preamble which is pre-compiled and placed in the manual.fmt file to speed up compilation.

\begin{document}

   \maketitle

   \input{theory}

   \newpage
   \maketitle           % Generate the title using the customized command defined in manual-defs.tex

   \setcounter{equation}{0}     % Restart equation numbering in the experiment section
   \setcounter{section}{0}      % Restart section numbering in the experiment section

   \input{experiment}

\end{document}


## Interface: 40200
## Title: FindIt
## Author: Adys
## Version: 1.8.0
## Notes: Find items, spells, achievements...
## eMail: adys.wh@gmail.com
## URL: http://github.com/adys/findit
## LoadOnDemand: 0
## DefaultState: enabled

LibStub.lua
LibWeagleTooltip.lua
FindIt.lua

Update TOC, bump version to 1.8.1

## Interface: 40300
## Title: FindIt
## Author: Adys
## Version: 1.8.1
## Notes: Find items, spells, achievements...
## eMail: jerome.leclanche+findit@gmail.com
## URL: http://github.com/adys/findit
## LoadOnDemand: 0
## DefaultState: enabled

LibStub.lua
LibWeagleTooltip.lua
FindIt.lua


\section{Problem definition}
\epigraph{\textbf{mar - ket - place}

1. An open square or place in a town where markets or public sales are held.

2. The world of trade or economic activity.}{Merriam-Webster}

To combat the issues associated with centralised marketplaces, tsukiji aims to be a fully decentralised marketplace.

A marketplace is a place where public sales are held.
In our case, a marketplace is a place where people can place bids or asks.
A bid is placed when a buyer wants to buy goods for a set price.
An ask is placed when a seller wants to sell goods for a set price.

Using the example of BitTorrent communities, a transaction would occur as follows: a seller places an "ask", wanting to sell 500 MBit for €3.
An interested buyer sees the ask and requests a trade to be made.
The buyer and seller exchange information necessary for the transaction to occur (e.g. bank account numbers).
A trade is made and the original ask is taken down.

Current marketplaces are centralised.
Information passes through one central point.
This means that if this central point fails, the entire marketplace is shut down.
A decentralised system operates without such a single point.
Instead of a central server connected to several users, peers are connected to each other.

Update problem definition with a paragraph on peer discovery + additional clarifying sentences.

\section{Problem definition}
\epigraph{\textbf{mar - ket - place}

1. An open square or place in a town where markets or public sales are held.

2. The world of trade or economic activity.}{Merriam-Webster}

To combat the issues associated with centralised marketplaces, Tsukiji aims to be a fully decentralised marketplace.

A marketplace is a place where public sales are held.
In our case, a marketplace is a place where people can place bids or asks.
A bid is placed when a buyer wants to buy goods for a set price.
An ask is placed when a seller wants to sell goods for a set price.

Using the example of BitTorrent communities, a transaction would occur as follows: a seller places an "ask", wanting to sell 500 MBit for €3.
An interested buyer sees the ask and requests a trade to be made.
The buyer and seller exchange information necessary for the transaction to occur (e.g. bank account numbers).
A trade is made and the original ask is taken down.
A similar transaction occurs when a "bid" is placed.

Current marketplaces are centralised.
Information passes through one central point.
This means that if this central point fails, the entire marketplace is shut down.
A decentralised system operates without such a single point.
Instead of a central server connected to several users, peers are connected to each other.
If a single peer fails, this might impact the marketplace, but it will not shut it down.

For a network of such peers to exist, peers first have to find each other.
Peer discovery is generally done by exchanging information about other peers.
When a peer first signs on, it knows of no other peers.
We can bootstrap its network by having them connect to a predefined set of super peers, who are known to be well connected.
From there, they can exchange information about other peers.


%how to: \input{res/chapters/argumentOfChapter}

Add organizativeProcess into the document

%how to: \input{res/chapters/argumentOfChapter}

\input{res/chapters/organizativeProcess.tex}


\chapter{Removed systems}

This appendix contains a list of systems that were removed for one of
several reasons:

\begin{itemize}
\item The code used to work, but is no longer working due to updates
  in code that it depends on.  More work is needed for it to be usable
  again.
\item The code never worked, and it needs more work in order for it to
  be considered part of \sysname{}.
\item The code never worked, and we have no ambition to make it work,
  but it nevertheless contains interesting ideas that we might revive
  in the future.
\end{itemize}

\section{Stack-oriented \clanguage{} backend}

Removed 2016-08-09.

SHA1 ID: b983763485ac5efb6fe3319f015b414b3e7ea5f5

\section{Concrete \commonlisp{} backend}

Removed 2016-08-09.

SHA1 ID: 3e0ca56b20ab49b27ae16bbe2046b975ac27be3e

\section{Extrinsic HIR interpreter backend}

Removed 2016-08-09.

SHA1 ID: 5a902f694be00857b33e7d79f0ddfa237a6dab7d

Add section for removed abstract machine backend.

\chapter{Removed systems}

This appendix contains a list of systems that were removed for one of
several reasons:

\begin{itemize}
\item The code used to work, but is no longer working due to updates
  in code that it depends on.  More work is needed for it to be usable
  again.
\item The code never worked, and it needs more work in order for it to
  be considered part of \sysname{}.
\item The code never worked, and we have no ambition to make it work,
  but it nevertheless contains interesting ideas that we might revive
  in the future.
\end{itemize}

\section{Stack-oriented \clanguage{} backend}

Removed 2016-08-09.

SHA1 ID: b983763485ac5efb6fe3319f015b414b3e7ea5f5

\section{Concrete \commonlisp{} backend}

Removed 2016-08-09.

SHA1 ID: 3e0ca56b20ab49b27ae16bbe2046b975ac27be3e

\section{Extrinsic HIR interpreter backend}

Removed 2016-08-09.

SHA1 ID: 5a902f694be00857b33e7d79f0ddfa237a6dab7d

\section{Abstract machine backend}

Removed 2016-08-09.

SHA1 ID: b905eba4da8daf89c450b6ab31748242b80e288e


\documentclass[12pt]{letter}
\usepackage[businessenvelope]{envlab}
\makelabels
\begin{document}
\startlabels
%s
\end{document}

Make addresses look less business-like, set envelope size

\documentclass[12pt]{letter}
\usepackage[noprintbarcodes,nocapaddress,norotateenvelopes,personalenvelope]{envlab}
\SetEnvelope{5.75in}{4.4375in}
\makelabels
\begin{document}
\startlabels
%s
\end{document}


\chapter{The \texttt{loop} macro}

Our \texttt{loop} module will use all available Common Lisp functions
for its analysis of syntax and semantics.  We believe this is not a
problem, even though we assume the existence of \texttt{loop} for many
other modules, because the code in this module will be executed during
macro-expansion time, and for a new Common Lisp system, this would be
another full Common Lisp implementation.

For systems without a full implementation of \texttt{loop} we are
planning to provide macro-expanded versions of modules that would
otherwise require \texttt{loop} in order to be compiled.

Our \texttt{loop} module will use only standard Common Lisp code in
its expansion, so that macro-expanded uses of \texttt{loop} will not
require any other \sysname{} module in order to work.

Update state of LOOP macro.

\chapter{The \texttt{loop} macro}

Our \texttt{loop} module uses all available Common Lisp functions for
its analysis of syntax and semantics.  We believe this is not a
problem, even though we assume the existence of \texttt{loop} for many
other modules, because the code in this module will be executed during
macro-expansion time, and for a new Common Lisp system, it would be
executed during cross compilation by another full Common Lisp
implementation.

Our \texttt{loop} module will use only standard Common Lisp code in
its expansion, so that macro-expanded uses of \texttt{loop} will not
require any other \sysname{} module in order to work.

The code for the \sysname{} \texttt{loop} macro is located in the
directory \texttt{Code/Loop}.

For parsing the a \texttt{loop} expression, we use a technique called
\emph{combinatory parsing}.

\section{Current state}

At the moment, the full \texttt{loop} syntax is parsed.  Code
generation is incomplete, however.  Only the constructs have code
generators: \texttt{initially}, \texttt{finally}, \texttt{until},
\texttt{while}, \texttt{do}, \texttt{with}, \texttt{repeat},
\texttt{collect}, \texttt{sum}.


@article{heywood2017data,
  title={Data-parallel agent-based microscopic road network simulation using graphics processing units},
  author={Heywood, Peter and Maddock, Steve and Casas, Jordi and Garcia, David and Brackstone, Mark and Richmond, Paul},
  journal={Simulation Modelling Practice and Theory},
  year={2017},
  publisher={Elsevier}
}

Update simpat bib file with full details

@article{heywood2017data,
  title = "Data-parallel agent-based microscopic road network simulation using graphics processing units",
  journal = "Simulation Modelling Practice and Theory",
  volume = "83",
  pages = "188 - 200",
  year = "2018",
  issn = "1569-190X",
  doi = "https://doi.org/10.1016/j.simpat.2017.11.002",
  url = "http://www.sciencedirect.com/science/article/pii/S1569190X17301545",
  author = "Peter Heywood and Steve Maddock and Jordi Casas and David Garcia and Mark Brackstone and Paul Richmond",
  keywords = "Agent-based simulation, GPU, Simulation framework, Transport microsimulation"
}


%
% Copyright (c) 2006-2012 Citrix Systems, Inc.
%
% All rights reserved.
%
% Authors: Ewan Mellor, Richard Sharp, Dave Scott
%

%% Document title
\newcommand{\doctitle}{Citrix XenServer Management API}

\newcommand{\coversheetlogo}{citrix_logo_black.eps}

%% Document date
\newcommand{\datestring}{\today}

\newcommand{\releasestatement}{}

%% Document revision
\newcommand{\revstring}{API Revision 2.0}

%% Document authors
\newcommand{\docauthors}{
}
\newcommand{\legalnotice}{Copyright \copyright{} 2006-2013 Citrix Systems, Inc. All Rights Reserved.}

Bump API version number on API docs

%
% Copyright (c) 2006-2012 Citrix Systems, Inc.
%
% All rights reserved.
%
% Authors: Ewan Mellor, Richard Sharp, Dave Scott
%

%% Document title
\newcommand{\doctitle}{Citrix XenServer Management API}

\newcommand{\coversheetlogo}{citrix_logo_black.eps}

%% Document date
\newcommand{\datestring}{\today}

\newcommand{\releasestatement}{}

%% Document revision
\newcommand{\revstring}{API Revision 2.4}

%% Document authors
\newcommand{\docauthors}{
}
\newcommand{\legalnotice}{Copyright \copyright{} 2006-2013 Citrix Systems, Inc. All Rights Reserved.}


\usepackage[top=.5in, bottom=.5in, left=1in, right=1in]{geometry}
\usepackage{tgpagella}
\usepackage{titlesec}
\titleformat{\section}{\huge\bfseries}{\thesection}{1em}{}
\titlespacing{\section}{0pt}{0pt}{1em}
\titleformat{\subsection}{\large\bfseries\MakeUppercase}{\thesubsection}{1em}{}

%\usepackage{multicol}
\pagestyle{empty}
\hyphenation{Media-Wiki}

\renewcommand{\labelitemi}{}
%\renewcommand{\labelitemii}{\scale[scale=700]{•}}

% from http://tex.stackexchange.com/a/29796/16139
\newsavebox{\zerobox}
\newenvironment{nospace}
  {\par\edef\theprevdepth{\the\prevdepth}\nointerlineskip
   \setbox\zerobox=\vtop to 0pt\bgroup
   \hrule height0pt\kern\dimexpr\baselineskip-\topskip\relax
  }
  {\par\vss\egroup\ht\zerobox=0pt \wd\zerobox=0pt \dp\zerobox=0pt
   \box\zerobox}

Change bullet style to a small black triangle.

\usepackage[top=.5in, bottom=.5in, left=1in, right=1in]{geometry}
\usepackage{tgpagella}
\usepackage{titlesec}
\titleformat{\section}{\huge\bfseries}{\thesection}{1em}{}
\titlespacing{\section}{0pt}{0pt}{1em}
\titleformat{\subsection}{\large\bfseries\MakeUppercase}{\thesubsection}{1em}{}

%\usepackage{multicol}
\pagestyle{empty}
\hyphenation{Media-Wiki}

\renewcommand{\labelitemi}{}
\renewcommand{\labelitemii}{\raise .5ex\hbox{\tiny$\blacktriangleright$}}

% from http://tex.stackexchange.com/a/29796/16139
\newsavebox{\zerobox}
\newenvironment{nospace}
  {\par\edef\theprevdepth{\the\prevdepth}\nointerlineskip
   \setbox\zerobox=\vtop to 0pt\bgroup
   \hrule height0pt\kern\dimexpr\baselineskip-\topskip\relax
  }
  {\par\vss\egroup\ht\zerobox=0pt \wd\zerobox=0pt \dp\zerobox=0pt
   \box\zerobox}


\section{Weitere nichtfunktionale Anforderungen}%

\begin{description}%
    \item [Auslieferung] Das Produkt wird sowohl als Eclipse-Plugin ausgeliefert als auch als eigenständig lauffähiges Eclipse-basierendes Produkt.
    \item [Referenzplattform] Das Programm muss alle Anforderungen auf den folgenden Referenzplattformen erfüllen:
    \begin{description}
      \item [Eigenständige Applikation] Oracle-Java-VM in der Version ?.? unter Windows und Linux.
      \item [Plugin] Eclipse Indigo SDK in der offiziellen Version von \url{http://www.eclipse.org}, Java und Betriebssystem wie oben.
    \end{description}
\end{description}

Remove reference to Eclipse plugin and mention Z3 license

\section{Weitere nichtfunktionale Anforderungen}%

\begin{description}%
    \item [Referenzplattform] Das Programm muss unter Verwendung der Oracle Java Runtime Environment in der Version 7 unter Linux alle Anforderungen erfüllen.
    \item [Lizenz von Z3] Die Lizenz des von Microsoft entwickelten Beweisers Z3 lässt nur nichtkommerzielle Nutzung zu. Eine kommerzielle Nutzung von \emph{Worthwhile} muss deshalb ausgeschlossen werden.
\end{description}


@inproceedings{DBLP:conf/sigmod/WaudbySPS20,
  author    = {Jack Waudby and
               Benjamin A. Steer and
               Arnau Prat{-}P{\'{e}}rez and
               G{\'{a}}bor Sz{\'{a}}rnyas},
  title     = {Supporting Dynamic Graphs and Temporal Entity Deletions in the {LDBC} {S}ocial {N}etwork {B}enchmark's Data Generator},
  booktitle = {{GRADES-NDA} at {SIGMOD}},
  pages     = {8:1--8:8},
  publisher = {{ACM}},
  year      = {2020},
  url       = {https://doi.org/10.1145/3398682.3399165},
  doi       = {10.1145/3398682.3399165},
  timestamp = {Thu, 11 Jun 2020 19:34:28 +0200},
  biburl    = {https://dblp.org/rec/conf/sigmod/WaudbySPS20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


\documentclass{syllabus}

\setheader{CS 4700}{Programming Languages}

\begin{document}

\section*{Description}
Theories of programming design and implementation. Introduction to variety of programming languages, showing how they represent trade-offs with respect to these theories.

\begin{text}{Concepts of Programming Languages}
\end{text}

\begin{grading}
\gradecategory{Assignments}{60}
\gradecategory{Exams}{40}
\end{grading}

\officehours{By Appointment}

%\finalexam{Monday December $9^{th}$ 7:30~a.m.~-~9:20~p.m.}

%\adddrop{September $16^{th}$}

\cheating

\ada

%\fees{25}

\end{document}


\documentclass{article}

\title{Adversarially learned inference}

\begin{document}

\maketitle

\begin{abstract}
    Add me.
\end{abstract}

\end{document}


Add a starter for the next "What's New" document.

\documentclass{howto}
\title{What's New in Python 2.3}

% We'll let Andrew claim ownership when he's ready.  ;-)
%\author{A.M. Kuchling}
%\authoraddress{\email{akuchlin@mems-exchange.org}}

\begin{document}
\maketitle
\tableofcontents

\section{Introduction \label{intro}}

%======================================================================
\section{Acknowledgements \label{acks}}

\end{document}


% vim: tw=80
\documentclass[letterpaper,twoside,draft]{article}
\usepackage{amsmath, amssymb}
%\usepackage{algorithm}
%\usepackage{algpseudocode}
\usepackage{fancyhdr}
\usepackage{lastpage}
\usepackage{color}
\usepackage{ifdraft}

\newcommand{\union}{\cup}
\newcommand{\intersect}{\cap}

\newcommand{\collaborators}[1]{\noindent\textbf{Collaborators:} #1}
\newcommand{\subprob}[1]{\noindent\textbf{#1} \nopagebreak}
\newcommand{\prob}[1]{\ifdraft{\clearpage}{\cleardoublepage}\subprob{#1}}

\ifdraft{%
    \newcommand{\todo}[1]{{\color{red} TODO:\@ {#1}}}
}{%
    \newcommand{\todo}[1]{}
}

\pagestyle{fancy}
\fancyhf{}
\fancyhf{}%
\rhead{Tej Chajed \\ \today}%
\chead{\textbf{6.856 PS<+NUM+>\ifoptiondraft{: DRAFT}}}%
\rfoot{p.~\thepage{}~of~\pageref{LastPage}}
\renewcommand{\headrulewidth}{.4pt}

\setlength{\headheight}{22.6pt}

%\includeonly{prob1}

\begin{document}

\include{prob1}
\include{prob2}
\include{prob3}

\end{document}


Update the OCCI Core Textile documentation.

\documentclass{article}
\title{OCCI Core Extension} % Title

\author{John \textsc{Smith}} % Author name

\date{\today} % Date for the report

\begin{document}

\maketitle % Insert the title, author and date
\newpage
\section{Objective}
\subsection{Definitions}
\label{definitions}
\section{Experimental Data}
\section{Sample Calculation}
\section{Results and Conclusions}
\section{Discussion of Experimental Uncertainty}
\section{Answers to Definitions}
\end{document}


\documentclass{article}

\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage[english]{babel}
\usepackage{hyperref}

\title{Non-anonymous material for the article\\
  ``Kindly Bent to Free Us''}
\date{}

\begin{document}

\maketitle

An online playground for the type-checker is available at:
\begin{center}
  \url{https://drup.github.io/pl-experiments/affe/}
\end{center}

The implementation is available at
\begin{center}
  \url{https://github.com/Drup/pl-experiments}
\end{center}

\end{document}

%%% Local Variables:
%%% mode: latex
%%% TeX-master: t
%%% End:


Document mathematical model for validation step.

\documentclass{article}
\usepackage{amsmath}

\begin{document}

Let $R=\{T_0, T_1, \ldots, T_n, T_{n + 1}\}$ be the fixed order of
tasks within the route for a given vehicle. The vehicle has to perform
$n$ geolocated tasks ($T_1$ to $T_n$) while $T_0$ and $T_{n + 1}$ are
its optional start and end tasks. For all $i$, we denote $s_i$ the
service time for task $i$, $d_i$ the travel time from task $T_i$ to
task $T_{i + 1}$ and $[a_i, b_i]$ the expected time window for start
of $T_i$ ($a_i \leq b_i$). In particular at vehicle start and end, we
have $s_0 = s_{n + 1} = 0$ while $[a_0, b_{n + 1}]$ is the vehicle
available working time.

The following program aim at deciding start times $t_i$ for all tasks
$T_i$ in order to minimize timing violations measured by variable
$Y_i$: either \textit{lead time} whenever a task starts earlier than
it's available date, either \textit{delay} when a task starts later
that it's deadline.

\begin{quote}
  Minimize
  \begin{align}
    M \times \sum_{i = 0}^{n + 1} Y_i + t_{n +1} - t_0 \label{obj}\tag{Obj}
  \end{align}
  Subject to
  \begin{align}
    t_{i + 1} - t_i &\geq s_i + d_i && 0 \leq i \leq n\label{precedence}\tag{$P_i$}\\
    Y_i + t_i &\geq a_i && 0 \leq i \leq n \label{lead}\tag{$L_i$}\\
    t_i - Y_i &\leq b_i && 1 \leq i \leq n + 1 \label{delay}\tag{$D_i$}\\
    t_i &\geq 0 && 0 \leq i \leq n + 1 \nonumber\\
    Y_i &\geq 0 && 0 \leq i \leq n + 1 \nonumber
  \end{align}
\end{quote}

The optimization objective (\ref{obj}) combines the sum of time
violations and the route makespan\footnote{Using a value $M > 1$
  ensures no \textit{lead time} violation is added to decrease
  makespan.}. Precedence constraints (\ref{precedence}) make sure
service and travel times are accounted for between task start
times. In the time violation constraints for lead time (\ref{lead})
and delay (\ref{delay}), variable $Y_i$ is zero iff task start matches
the expected time window.

\end{document}


All fields present
@article{key,
    author  = {a},
    title   = {b},
    journal = {c},
    year    = {d}
}

Missing author and year fields are missing
@article{key,
    title   = {b},
    journal = {c}
}

Missing title field
@article{key,
    author  = {a},
    journal = {c},
    year    = {e}
}

Missing year field
@article{key,
    author  = {a},
    title   = {b},
    journal = {c},
}

Missing journal field
@article{key,
    author = {a},
    title  = {b},
    year   = {c}
}

All fields present
@book{key,
    publisher = {a},
    title     = {b},
    year      = {d}
}

Missing title field
@book{key,
    publisher = {a},
    year   = {b}
}

Missing year and publisher fields
@book{key,
    title = {b}
}

Missing publisher field
@book{key,
    year  = {a},
    title = {b}
}

All fields present
@booklet{key,
    title  = {a}
}

Missing title field
@booklet{key,
}

Only optional year missing
@inbook{key,
    author = {a},
    title  = {b}
}


@article{lundberg2020local2global,
  title={From local explanations to global understanding with explainable AI for trees},
  author={Lundberg, Scott M. and Erion, Gabriel and Chen, Hugh and DeGrave, Alex and Prutkin, Jordan M. and Nair, Bala and Katz, Ronit and Himmelfarb, Jonathan and Bansal, Nisha and Lee, Su-In},
  journal={Nature Machine Intelligence},
  volume={2},
  number={1},
  pages={2522-5839},
  year={2020},
  publisher={Nature Publishing Group}
}


\documentclass{standalone}
\usepackage{tikz}
\usepackage{amsmath}
\usetikzlibrary{matrix}
\begin{document}

\begin{tikzpicture}
\matrix[matrix of nodes] (mat)
{
    1 & 2 & 3 \\
    4 & 5 & 6 \\
    7 & 8 & 9 \\
};
\end{tikzpicture}
\end{document}


\documentclass[a4paper,11pt]{report}
\usepackage[T1]{fontenc}
\usepackage[utf8]{inputenc}
\usepackage{lmodern}
\usepackage[francais]{babel}

\title{LOG8415 \newline Rapport du laboratoire 1}
\author{Kitandala Fabrice Bohangyo, Mathieu Gamache, Marie Martin}

\begin{document}

\maketitle
\tableofcontents

\input{benchmarking.tex}
\input{sources.tex}

\end{document}


\documentclass{article}
\usepackage{imakeidx}

\makeindex

\begin{document}

Wibble, wibble, foo\index{foo}, foo, bar\index{bar}.

\printindex

\end{document}


Add fun little complex problem to notfound

\nofiles
\documentclass[letterpaper,12pt]{article}
\usepackage{amsmath,amssymb,amsthm,tikz}
\pagenumbering{gobble}
\begin{document}

\[
\vert 80 + 396i \vert
\]

\end{document}
% the complex absolute value of eighty plus the imaginary number times three hundred ninety six


\documentclass[fontsize=10pt]{tccv}
\usepackage[english]{babel}

\begin{document}

\part{$basics.name$}

\section{Select work experience}

\begin{eventlist}
  $for(work)$
\item{$work.startDate$ -- $if(work.endDate)$$work.endDate$$else$Present$endif$}
  {\href{$work.website$}{$work.company$}}
  {$work.position$}

  $work.summary$

  $endfor$

\end{eventlist}

\personal
[blorg.ericb.me] % [$basics.website$]
% {Address}
% {Phone}
{eric@ericb.me}

\section{Education}

\begin{yearlist}

  $for(education)$
\item[$education.area$]{$if(education.startDate)$$education.startDate$ -- $endif$$education.endDate$}
  {$education.studyType$}
  {$education.institution$}

  $endfor$

\end{yearlist}

\section{Interviews}

\begin{yearlist}

  $for(publications)$
\item{$publications.year$}
  {$publications.publisher$ (\href{$publications.website$}{$publications.name$})}
  {$publications.summary$}
  $endfor$

\end{yearlist}

\section{Communication skills}

\begin{factlist}
  $for(languages)$
\item{$languages.language$}{$languages.fluency$}
  $endfor$
\end{factlist}

\section{Software skills}

\begin{factlist}

  $for(programming)$
\item{$programming.fluency$}
  {$for(programming.languages)$$programming.languages$$sep$, $endfor$}
  $endfor$

\end{factlist}

\end{document}


\begin{tabular}{|c|c|}
	\hline
	\tbf{Open Bit} & \tbf{Meaured Voltage (\si{\volt}, P-P)}\\ \hline
	None & 3.750  \\ \hline
	0    & 3.750  \\ \hline
	5    & 3.812  \\ \hline
	7    & 2.437  \\ \hline
\end{tabular}


\documentclass[pdfpagelabels=false]{sig-alternate-2013} % option is to shut down hyperref warnings
\setlength{\paperheight}{11in} % To shut down hyperref warnings
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\usepackage{amssymb}
\usepackage{booktabs}
\usepackage{hyperref}
\usepackage[numbers,square,sort&compress]{natbib}
\renewcommand{\refname}{References}
\renewcommand{\bibsection}{\subsection*{References}}
\renewcommand*{\bibfont}{\raggedright}

\permission{Copyright is held by the author/owner(s).}
\conferenceinfo{WWW'16 Companion,}{April 11--15, 2016, Montr\'eal, Qu\'ebec, Canada.}
\copyrightetc{ACM \the\acmcopyr}
\crdata{978-1-4503-4144-8/16/04. \\
Include the http://DOI string/url }
% be sure to update the red text with your assigned DOI from ACM

\clubpenalty=10000
\widowpenalty = 10000

\begin{document}
\title{Centrality Measures on Big Graphs:\\Exact, Approximated, and Distributed Algorithms}

\numberofauthors{3}
\author{
\alignauthor
Francesco Bonchi\\
       \affaddr{ISI Foundation}\\
       \affaddr{Turin, Italy}\\
       \email{francescobonchi@acm.org}
\end{tabular}\begin{tabular}[t]{p{1.3\auwidth}}\centering
Gianmarco~De~Francisci~Morales\\
       \affaddr{XXX}\\
       \affaddr{XXX}\\
       \email{gdfm@acm.org}
\alignauthor
Matteo Riondato\titlenote{Main contact person}\\
       \affaddr{Two Sigma Investments}\\
       \affaddr{New York, NY, USA}\\
       \email{matteo@twosigma.com}
}

\date{12 February 2016}
\maketitle

\begin{abstract}
\end{abstract}

\section{Introduction}

\end{document}


Add a specification draft for the kind type.

\documentclass[a4paper,10pt]{article}
\usepackage[american]
           {babel} % needed for iso dates
\usepackage{url}
\usepackage{lmodern}
\usepackage{listings}
\usepackage{graphicx}
\usepackage{xcolor}
\usepackage[T1]{fontenc}
\usepackage{textcomp}
\usepackage{hyperref}
\usepackage{array}
\usepackage{underscore}
\usepackage{changepage}   % for the adjustwidth environment

\hypersetup{
  hidelinks
}

\usepackage[top=2cm, bottom=2cm, left=2cm, right=2cm]{geometry}

\title{Draft of the specifications of the NoWork language}
\author{Pierre Talbot}

\begin{document}

\maketitle
\setcounter{tocdepth}{1}
\tableofcontents

\section{Introduction}

\section{Grammar}

Here the EBNF grammar of the language.

\subsection{Kind grammar}
\begin{lstlisting}
kind-kw ::= "kind"
kind-type ::= "type"
           |  "type", "->", kind-type
kind-def ::= "atom" | kind-type
kind-decl ::= kind-kw, identifier, "=", kind-def
\end{lstlisting}

\newpage
\bibliographystyle{plain}
\bibliography{references}

\end{document}


@Manual{BHK,
  title = 	 {{\tt deal.{I}{I}} Differential Equations Analysis Library,
                  Technical Reference},
  author = 	 {Wolfgang Bangerth and Ralf Hartmann and Guido Kanschat},
  organization = IWR,
  month = 	 apr,
  year = 	 {2001},
  note =         {\texttt{http://gaia.iwr.uni}-\texttt{heidelberg.de/\~{}deal/}},
  url =          {http://gaia.iwr.uni-heidelberg.de/~deal/}
}

Remove date of deal.II homepage reference.

@Manual{BHK,
  title = 	 {{\tt deal.{I}{I}} Differential Equations Analysis Library,
                  Technical Reference},
  author = 	 {Wolfgang Bangerth and Ralf Hartmann and Guido Kanschat},
  organization = IWR,
  note =         {\texttt{http://gaia.iwr.uni}-\texttt{heidelberg.de/\~{}deal/}},
  url =          {http://gaia.iwr.uni-heidelberg.de/~deal/}
}


\newcommand\beginRequirement[3] {
	\begin{center}
	\begin{tabular}{ |llllll| }
	\hline
	&&&&&\\
	Requirement \#: & #1 & Requirement Type: & #2 & Event/BUC/PUC \#: & #3 \\
	&&&&&\\
}
%
\newcommand\setDescription[1] {
	Description: & \multicolumn{5}{p{9.5cm}|}{#1}\\
	&&&&&\\
}
%
\newcommand\setOrginator[1] {
	Orginator: & \multicolumn{5}{p{9.5cm}|}{#1}\\
	&&&&&\\
}
%
\newcommand\setCustomer[2] {
	\multicolumn{2}{|l}{Customer Satisfaction:} & #1 & \multicolumn{2}{l}{Customer Dissatisfaction:} & #2\\
	&&&&&\\
}
%
\newcommand\setDependencies[1] {
	Dependencies: & \multicolumn{5}{p{9.5cm}|}{#1}\\
	&&&&&\\
}
%
\newcommand\setMaterials[1] {
	\multicolumn{2}{|l}{Supparting Materials:}& \multicolumn{4}{p{9.5cm}|}{#1}\\
	&&&&&\\
}
%
\newcommand\setConflicts[1] {
	Conclicts: & #1 &&&&\\
	&&&&&\\
}
%
\newcommand\setHistory[1] {
	History: & \multicolumn{2}{l}{#1} &&&\\
	&&&&&\\
	\hline
	\end{tabular}
	\end{center}
}


@article{,
  title = {Sex-Based Differences in Pain Distribution in a Cohort of Patients with Persistent Post-Traumatic Neck Pain},
  volume = {40},
  doi = {10.1080/09638288.2017.1280543},
  language = {en},
  number = {9},
  journal = {Disability and Rehabilitation},
  author = {Westergren, Hans and Larsson, Johan and Freeman, Michael and Carlsson, Anna and J\"oud, Anna and Malmstr\"om, Eva-Maj},
  month = jan,
  year = {2017},
  pages = {1085-1091}
}


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsection*{\label{sec:New-8-4-0}Version 8.4.0}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\noindent Release Notes:

\begin{itemize}

\item HTCondor version 8.4.0 not yet released.
%\item HTCondor version 8.4.0 released on Month Date, 2015.

\end{itemize}

\noindent New Features:

\begin{itemize}

\item None.

\end{itemize}

\noindent Bugs Fixed:

\begin{itemize}

\item None.

\end{itemize}


\documentclass{report}

\usepackage{xspace}
\newcommand{\dadi}{$\partial$a$\partial$i\xspace}

\begin{document}
\title{\dadi manual\\\normalsize $Revision$}
\author{Ryan Gutenkunst}
\maketitle

\end{document}

Update for nicer revision information

\documentclass{report}

\usepackage{xspace}
\newcommand{\dadi}{$\partial$a$\partial$i\xspace}

\begin{document}
\title{\dadi manual\\\normalsize  $$Revision$$}
\author{Ryan Gutenkunst}
\maketitle

\end{document}


Add brief snippet of MLA used to ask on TeX StackExchange

\documentclass{article}
\usepackage[nopar]{lipsum} % for dummy text
\usepackage[american]{babel}
\usepackage[babel]{csquotes}
\usepackage[style=mla,backend=biber]{biblatex}
\begin{filecontents}{\jobname.bib}
@book{Saussure1995,
    Author = {Ferdinand de Saussure},
    Origyear = {1916},
    Publisher = {Payot},
    Title = {Cours de Linguistique G{\'e}n{\'e}rale},
    Year = {1995}}

@book{Labov1972,
    Address = {Philadelphia},
    Author = {William Labov},
    Publisher = {University of Pennsylvania Press},
    Title = {Sociolinguistic Patterns},
    Year = {1972}}

\end{filecontents}
\addbibresource{\jobname.bib}
\begin{document}

\lipsum[1]\autocite{Saussure1995}

\lipsum[2]\autocite{Labov1972}

\newpage

\printbibliography

\end{document}


(deftype Error [val state]
  Stringable
  (string-list [_]
    (list "(Error " (str val) ")")))

(deftype new-se [invoke-fn]
  (assert (instance? Fn invoke-fn))

  Stringable
  (string-list [x]
    (comp (list "<new-se ")
          (string-list (.invoke-fn x))
          (list ">")))

  Function
  (invoke [ev s]
    (invoke-fn s))

  Container
  (map [ev f]
    (new-se (fn [s]
              (let [x (invoke-fn s)]
                (either (instance? Error x)
                        (let [[v new-s] x]
                          (either (= (symbol "v") 'v)
                                  (abort))
                          [(f v) new-s]))))))

  (wrap [_ v]
    (new-se (fn [s]
              [v s])))

  (flat-map [ev f]
    (new-se (fn [s]
              (let [x (invoke-fn s)]
                (either (instance? Error x)
                        (let [[v new-s] x]
                          ((f v) new-s))))))))

(main [_]
  (print-err ((map (new-se (fn [s]
                              [99 s]))
                    (fn [y]
                      'x
                      ))
              'state)))


% Encoding: UTF-8

@InProceedings{Fen2010,
  Title                    = {From the Resource to the Business Process Risk Level},
  Author                   = {Stefan Fenz},
  Booktitle                = {Proceedings of the South African Information Security Multi-Conference (SAISMC'2010)},
  Year                     = {2010},
  Month                    = {1},
  Pages                    = {100--109},
  File                     = {:Fen2010 - From the Resource to the Business Process Risk Level.pdf:PDF},
  Keywords                 = {AirSec},
  Pdf                      = {fenz2010resource.pdf}
}

@InProceedings{HKO2007,
  Title                    = {Rule-based Autocompletion Of Business Process Models},
  Author                   = {Thomas Hornung and Agnes Koschmider and Andreas Oberweis},
  Booktitle                = {CAiSE Forum 2007 Proceedings at the 19th Conference on Advanced Information Systems Engineering (CAiSE)},
  Year                     = {2007},
  Address                  = {Trondheim, Norway},
  Month                    = {Juni},
  Evastar_pdf              = {2007_1430_Hornung_Rule-based_Auto_1.pdf},
  File                     = {HKO2007.pdf:HKO2007.pdf:PDF}
}

@Article{LVOS2009,
  Title                    = {Comparing and Evaluating {Petri} Net Semantics for {BPEL}},
  Author                   = {Niels Lohmann and Eric Verbeek and Chun Ouyang and Christian Stahl},
  Journal                  = {International Journal of Business Process Integration and Management (IJBPIM)},
  Year                     = {2009},
  Number                   = {1},
  Pages                    = {60-73},
  Volume                   = {4},
  DOI                      = {10.1504/IJBPIM.2009.026986},
  Abstract                 = {We compare two Petri net semantics for the Web Services Business Process Execution Language (BPEL). The comparison reveals different modelling decisions. These decisions together with their consequences are discussed. We also give an overview of the different properties that can be verified on the resulting models. A case study helps to evaluate the corresponding compilers which transform a BPEL process into a Petri net model.},
  Pdf                      = {http://www.informatik.hu-berlin.de/top/download/publications/LohmannVOS2008_ijbpim.pdf}
}


\documentclass[10pt,a4paper]{article}
\usepackage[utf8]{inputenc}
\usepackage[francais]{babel}
\usepackage[T1]{fontenc}
\usepackage{hyperref}
\usepackage{eurosym}

\author{Anthony \textsc{Caccia} \and Romain \textsc{Fontaine} \and Nikita \textsc{Marchant} }
\date{}
\title{\textsc{INFO-F-309 : Administration Système} Projet : Rapport d'implémentation}

\setlength{\parindent}{1.5em}
\setlength{\parskip}{1em}
% \renewcommand{\baselinestretch}{1.5}

\begin{document}
\maketitle

\section{Serveur web}
\subsection{Services}
\begin{itemize}
    \item nginx \texttt{systemctl start/stop/status nginx.service}
    \item postgresql \texttt{systemctl start/stop/status nginx.service}
    \item redis \texttt{systemctl start/stop/status redis-server.service}
\end{itemize}

\subsection{Procédure d'installation}

\section{Serveur de compilation}
\subsection{Services}
\begin{itemize}
    \item clamAV :
        \begin{itemize}
            \item clamd \texttt{/usr/local/etc/rc.d/clamav-clamd start/stop}
            \item freshclam \texttt{/usr/local/etc/rc.d/clamav-freshclam ? start/stop}
        \end{itemize}
\end{itemize}

\subsection{Procédure d'installation}

\end{document}


\documentclass{letter}
\usepackage[margin=1in]{geometry}
\usepackage{url}
\address{OOPSLA Paper \#94: \\ Verifying Strong Eventual Consistency \\ in Distributed Systems}
\signature{The authors}
\begin{document}
\begin{letter}{}
\opening{Dear reviewers,}

Thank you for your helpful comments on our paper in the first round.
We enclose a revised version and trust that it addresses your comments.
Our changes compared to the last round are as follows:

\begin{itemize}
\item Our full proof is now published on the Isabelle Archive of Formal Proofs (\url{https://www.isa-afp.org/entries/CRDT.shtml}), and we have referenced it from the paper.
\item As requested by reviewer A, we now back up our claim of flawed proofs of SEC algorithms in the introduction by including a literature reference and a forward reference to Section 8.
\item As requested by reviewer B, we included a brief explanation of the distinction between the $\longrightarrow$ and $\Longrightarrow$ arrows in Isabelle at the bottom of page 5.
It is difficult to explain concisely, because the distinction amounts essentially to an implementation detail of Isabelle, and a full explanation would require several pages of digression into Isabelle's internals.
However, we hope that the brief explanation will nevertheless be useful.
\item Addressing a question by reviewer A, we added the second paragraph of Section 5.2 to explain why our network uses a broadcast abstraction, and to outline how it is often implemented in practice (as an overlay network atop unicast TCP).
\item Reviewer B also suggested discussing the robustness of algorithms to minor variations in infrastructure assumptions, which we have done briefly in the penultimate paragraph of Section 5, on page 14.
\item In Section 8.1 we added the 4th, 5th and 6th paragraphs (top half of page 22) to explain the $\mathit{TP}_1$ and $\mathit{TP}_2$ properties, as requested by reviewer A.
\item Following on from reviewer A's comment on Jepsen testing, we added a final paragraph to Section 9 to explain that the purpose of generating executable OCaml code is not to perform an empirical evaluation, but merely to demonstrate that we have not used any uncomputable functions.
\item We have made the inline Isabelle code snippets easier to read by making the presentation neater (indentation, spacing, line breaks, font size).
The content of the snippets is unchanged.
\item Improved clarity through minor (semantically neutral) rewordings throughout the paper.
\end{itemize}

\closing{Regards,}
\end{letter}
\end{document}


Add in the start of the muon chapter. Also bring in some packages.

\documentclass[herrin-thesis.tex]{subfiles}
\begin{document}

For a particle incident from zenith angle \(\theta\) and azimuthal angle \(\phi\), the effective area of a cylinder on its side is
\begin{equation}
A(\theta,\phi) = \pi r^2 |\cos(\phi)|\sin(\theta) + 2 r h \sqrt{1-\sin(\theta)^2 \cos(\phi)^2}
\end{equation}
when \(\phi=0\) is parallel to the cylinder's axis and where \(r\) is the cylinder's radius and \(h\) is its height.

\end{document}


Add template for specification analysis.

% Distributed under the MIT License.
% (See accompanying file LICENSE.txt)
% (C) Copyright NoWork team

\documentclass[12pt,a4paper]{article}

\usepackage[utf8]{inputenc}
\usepackage[american]{babel}
\usepackage[T1]{fontenc}

\title{NoWork\\
Specification analysis}
\author{NoWork development team\\[2em]}
\date\today

\begin{document}
\maketitle

\section{Introduction}

\end{document}


% Description: Table with Landscape Orientation

% Note
% 1. None

\documentclass{article}

\usepackage{siunitx}
\usepackage{booktabs}
\usepackage{rotating}                                   % To display tables in landscape

\sisetup{
  round-mode          = places, % Rounds numbers
  round-precision     = 2, % to 2 places
}

\begin{document}

\section{Tables in \LaTeX}

\subsection{Landscape tables}

Sometimes when displaying huge tables with many columns, it's better to display them in landscape mode.

\begin{sidewaystable}[h!]
    \begin{center}
    \caption{Landscape table.}
    \label{tab:table1}
    \begin{tabular}{l|S|r}
        \toprule
        \textbf{Value 1} & \textbf{Value 2} & \textbf{Value 3}\\
        $\alpha$ & $\beta$ & $\gamma$ \\
        \midrule
        1 & 1110.1 & a\\
        2 & 10.1 & b\\
        3 & 23.113231 & c\\
        \bottomrule
  \end{tabular}
  \end{center}
\end{sidewaystable}

\end{document}


Add sketch of inference rules for contexts


Add code for ordered and unordered list.

% Description: Ordered and Unordered Lists

% Note
% 1. Unordered lists can be created using the itemize environment.
% 2. Ordered lists can be created using the enumerate environment.
% 3. Lists can be nested and will be aligned and enumerated properly.
% 4. Use the enumitem package to customize the symbols or enumeration.

\documentclass[]{article}

\usepackage{enumitem}

\begin{document}

\section{Unordered Lists}

\begin{itemize}
	\item One
	\item Two
	\item Three
\end{itemize}

\section{Ordered Lists}

\begin{enumerate}
	\item One
	\item Two
	\item Three
\end{enumerate}

\section{Nested Lists}

\begin{enumerate}
	\item One
    \begin{enumerate}
    	\item Two
        \item Three
        \item Four
    \end{enumerate}
    \item Five
    \item Six
\end{enumerate}

\section{Unordered List - Change Symbol For One Item}

\begin{itemize}
	\item[--] N Dash
    \item[$-$] M Dash
    \item[$\ast$] Asterisk
\end{itemize}

\section{Unordered List - Change Symbol For All Items}

\begin{itemize}[label=$\ast$]
	\item One
    \item Two
    \item Three
\end{itemize}

\section{Ordered List - Change Symbol For All Items}

% Roman
\subsection{Roman}
\begin{enumerate}[label=(\roman*)]
	\item One
	\item Two
	\item Three
\end{enumerate}

% Arabic numbers
\subsection{Arabic Numbers}
\begin{enumerate}[label=\arabic*)]
	\item One
	\item Two
	\item Three
\end{enumerate}

% Alphabetical
\subsection{Alphabetical}
\begin{enumerate}[label=\alph*)]
	\item One
	\item Two
	\item Three
\end{enumerate}

\end{document}


Add the initial structure of the INForum paper.


% Description: Table with Landscape Orientation

% Note
% 1. Tikz package can be used to draw graphics from within the LaTeX document.
% 2. Drawing a picture should be programmed.
% 3. Extensive documentation is available for the Tikz package.
% 4. Many examples can be found on the internet.
% 5. Extensions available to easy creation of diagrams, flowcharts and so forth.

\documentclass{article}

\usepackage{tikz}

\begin{document}

\begin{figure}[h!]
    \begin{center}
        % Embed our tikzpicture in a figure environment.
        \begin{tikzpicture}
            % Specifies the rectangle should be red and dashed, no magic here.
            % Location of the rectangle (-2.5,2.5) in cartesian coordinates.
            % Set the size of the rectangle (-1.5,1.5).
            % Text is usually placed as a so-called node (text-node) in our picture.
            % Define the text to have black color and set the position to below our rectangle.
            \draw [red,dashed] (-2.5,2.5) rectangle (-1.5,1.5) node [black,below] {Start};          % Draws a rectangle
            % Draw a line by specifying a path in Tikz
            \draw [thick] (-2,2)                                                                    % Draws a line
            % The to command is used to specify a point of the path.
            % Tikz usually draws straight lines between the points. The bent lines can be accomplished by setting the in
            % and out angle in brackets.
            to [out=10,in=190] (2,2)
            to [out=10,in=90] (6,0)
            % Terminate each command with a semicolon inside of the tikzpicture environment.
            to [out=-90,in=30] (-2,-2);
            \draw [fill] (5,0.1) rectangle (7,-0.1) node [black,right] {Obstacle};                  % Draws a rectangle
            \draw [red,fill] (-2,-2) circle [radius=0.2] node [black,below=4] {Point of interest};  % Draws a circle
        \end{tikzpicture}
        \caption{Example graphic made with tikz.}
    \end{center}
\end{figure}

\end{document}


\documentclass{article}

% Big margins for now so people can take notes/scribbles.
%\usepackage{fullpage}

\title{Parallel Best NBlock First}
\author{Ethan Burns \and Seth Lemons}
\date{\today}

\begin{document}
\maketitle

\begin{abstract}
We are approaching a time where it is no longer beneficial for
hardware manufactures to create micro-processors with greater and
greater clock speeds.  In order to get increased performance, software
will need to be written to take advantage of concurrency and
multi-core processors.  We propose a best-first search algorithm which
makes use of multiple core CPUs in order to solve small to medium
sized problems faster.
\end{abstract}

\end{document}


Add simple .tex file showing special fields functionality

% Encoding: UTF-8

@InProceedings{entry-with-rank1,
  author    = {author},
  title     = {title},
  booktitle = {booktitle},
  year      = {2016},
  keywords  = {rank1},
}

@InProceedings{entry-with-rank2,
  author    = {author},
  title     = {title},
  booktitle = {booktitle},
  year      = {2016},
  keywords  = {rank2},
}

@Comment{jabref-meta: databaseType:bibtex;}


\documentclass{USUexam}

\setheader{CS1400}{Computer Science I}{Final Exam}
\date{August 14, 2015}

\begin{document}

%\section*{Chapter 12}
\shortanswer{10}{Give an example of a literal value}
\shortanswer{10}{Is it better to write ++i or i++? Why?}
%\section*{Chapter 13}
\shortanswer{10}{What are the components of a function signature?}
\shortanswer{10}{When should you use a switch statement}
\shortanswer{10}{What is the purpose of a constructor?}
%\section*{Chapter 14}
\shortanswer{10}{When is it best to use a for loop?  When is a while loop better?}
\shortanswer{10}{Describe scope}
\shortanswer{10}{Write a loop that prints out every member of an array}
\shortanswer{10}{When should data members be public?  When should member functions be public?}
\newpage
Consider the \textbf{Person} class below:

\begin{verbatim}
class Person
{
  public:
    Person();
    void set(string newname, int newage);
    string getName();
    int getAge();
  private:
    string name;
    int age;
};
\end{verbatim}

\shortanswer{10}{Write an implementation of getAge()}

\end{document}


Add solution for first problem (Merge-Sort with Insertion-Sort).

\documentclass[8pt,a4paper]{article}
\pagestyle{empty}
\usepackage{framed}
\usepackage{crlscode3e}

\begin{document}

\section*{Problems}

\begin{framed}
\textbf{\textit{2-1} Insertion sort on small arrays in merge sort}
\end{framed}

\subsubsection*{a}

The worst-case scenario for the insertion sort algorithm is $\Theta(n^{2})$.
Since each sublist has $k$ elements, sorting each one of them takes time
that is $\Theta(k^{2})$. However, all the sublists must be sorted and there
are $\frac{n}{k}$ of them, so sorting them all will take:

\begin{center}
\framebox{$\Theta(k^{2} . \frac{n}{k}) = \Theta(nk)$}
\end{center}

\subsubsection*{b}

We can use a Divide and Conquer approach to merge all the $\frac{n}{k}$ sublists.
We first merge the left $\frac{n}{2k}$ lists and then the right $\frac{n}{2k}$ lists.
To combine the results, the same $\proc{Merge}$ algorithm described in the book, that
is proven to be $\Theta(n)$. Thus, as there are $\frac{n}{k}$ sublists, the algorithm
will span $\lg (\frac{n}{k})$ recursive calls, yielding a complexity of:

\begin{center}
\framebox{$(cn . \lg (\frac{n}{k})) + cn = \Theta(n \lg (\frac{n}{k}))$}
\end{center}

\subsubsection*{c}

In order for the algorithm to have the same running time of the standard merge sort,
its running time must be $\Theta(n \lg n)$. Performing some manipulations on the
new algorithm complexity:

\begin{center}
$nk + n \lg (\frac{n}{k}) =$ \\
$nk + n(\lg n - \lg k) =$ \\
$nk + n \lg n - n \lg k$
\end{center}

Thus, in order for the above function to be $\Theta(n \lg n)$, the highest order
member of it must be $n \lg n$, that is:

\begin{center}
$nk \leq n \lg n \Rightarrow$
\framebox{$k \leq \lg n$}
\end{center}

The maximum value for $k$ is $\lg n$.

\subsubsection*{d}

In practice, the value of $k$ should be chosen for inputs of size for which
the running time of insertion sort is smaller than that of merge sort, considering
constant factors.

\end{document}


\documentclass{book}

\begin{document}

% Folding of multiline comments
%
% -- Lorem ipsum dolor sit amet, consetetur sadipscing elitr, sed diam
% -- nonumy eirmod tempor invidunt ut labore et dolore magna aliquyam erat,
% -- sed diam voluptua. At vero eos et accusam et justo duo dolores et ea
% -- rebum. Stet clita kasd gubergren, no sea takimata sanctus est Lorem
% -- ipsum dolor sit amet.

\frontmatter

\chapter{Preface}
Preface.

\section{Acknowledgements}

\chapter[Other]{Other frontmatter chapter}

\tableofcontents

\mainmatter

\chapter*{Test chapter 1}
Test of starred chapter.

\chapter{Test chapter 1}
This test document is created to test advanced TOC functionality.

\section{Test section 1}

\subsection{sub}

\subsubsection{subsub}

\subsubsubsection{subsub}

\subsection{Test sub section 1}

\section{$\alpha$}

\subsection{Test sub section 1}

\subsection{Test sub section 2}
Some text.

\chapter{Test chapter 2}

\section{Testing TOC levels}
Testing more input and TOC levels.

\subsection{Testing TOC sub levels}

\subsubsection{Testing TOC sub sub levels}
Hello world.

\subsubsection{Text $\Gamma^{r}(\ensuremath{{\mathbf{Z}}}_p^d,\mathbf{K})$}

\subsection{Another test subsection}

\subsubsection{Other text $\Gamma^{r}$}

\section{Testing more appendix levels}
Testing more input and TOC levels.

\subsection{Testing TOC sub levels}

\appendix

\chapter{Appendix 1}
This test document is created to test advanced TOC functionality.

\section{Appendix subsection}

\subsection{sub}

\subsubsection{subsub}

\subsubsubsection{subsub}

\subsection{Test sub section 1}

\chapter{Appendix 2}

\section{Testing TOC levels}
Testing more input and TOC levels.

\subsection{Testing TOC sub levels}

\subsubsection{Testing TOC sub sub levels}
Hello world.

\subsubsection{Text $\Gamma^{r}(\ensuremath{{\mathbf{Z}}}_p^d,\mathbf{K})$}

\subsection{Another test subsection}

\subsubsection{Other text $\Gamma^{r}$}

\section{Testing more appendix levels}
Testing more input and TOC levels.

\subsection{Testing TOC sub levels}

\backmatter

\chapter{No numbers in backmatter 1}

\section{Section 1}

\section{Section 2}

\chapter{No numbers in backmatter 2}

\section{Section 1}

\section{Section 2}

\end{document}


Add verbal of 03-21 meeting. Wainting fon next meeting date.

\documentclass[11pt]{meetingmins}
\usepackage[utf8]{inputenc}

\setcommittee{BugBusters}

\setmembers{

  D.~Polonio,
  D.~Rigoni,
  M.~Di Pirro,
  G.~Mazzocchin,
  L.~Bianco,
  A.~Mantovani,
  E.~Carraro
}

\setdate{March 21, 2016}

\setpresent{

  D.~Polonio,
  L.~Bianco,
  G.~Mazzocchin,
  M.~Di Pirro,
  A.~Mantovani,
  E.~Carraro,
  D.~Rigoni
}

\absent{None}

\alsopresent{None}

\begin{document}

\maketitle

\section{Ordine del giorno}

\begin{enumerate}

  \item Decidere requisiti hardware/software minimi (versione browser, OS, computer...)
  \item Dimostrazione glossario xml

\end{enumerate}

\section{Orari}

\begin{itemize}
\item[Inizio]: ore 10:20
\item[Fine]: ore 10:40
\item[Tempo]: Previsto di 15 min, effettivo di 20 min

\end{itemize}

\section{Verbale}

\subsection{Requisiti hardware/software minimi}

Per 5 voti contro 2 è stato deciso di supportare i seguenti browser:
\begin{enumerate}
\item Google Chrome 49.X;
\item Mozilla Firefox 45.Y.
\end{enumerate}

\subsection{Dimostrazione glossario xml}

M.~Di Pirro illustra il nuovo funzionamento del glossario.

\nextmeeting{Month Day, 2016}

\end{document}


Test for underfull hbox warning supression

% Test suppression of underfull hbox messages

\documentclass{article}

\begin{document}

a\\

\end{document}

%% output:
%% T-underfull-hbox.tex: 1 underfull warning not shown (use -Wall to show them)


\chapter{User Guide}
\label{chap:Guide}

Add first bits of user guide

\chapter{User Guide}
\label{chap:Guide}

Welcome to Viskell!
Viskell is a tool to experiment with the Haskell programming language in a visual and playful way.
You don't need to be a Haskell expert to use Viskell: this User Guide will tell you everything you know to get started.

\textbf{Squares!}
First, we're building a program that calculates the product of two numbers.
To do that, right-click (or tap-and-hold) anywhere to open the \emph{function menu}, if it isn't open already.
(It's the big, purple box: it's hard to miss.)
The function menu has a number of buttons to choose from.
For now, click the button that says \emph{Display Block} to add a display to your program.
The display block doesn't do much on its own: it only displays the value that it's connected to.
Next, add a \emph{value block} by clicking the respective button on the function menu.
You'll be asked to provide a value: something like 1234 will do.
You should now have two blocks: drag the output block so that it's a bit below the value block.
Then, from the \emph{Numeric types} category, click \emph{(*)}, the multiplication function.
The multiplication function has two inputs.
Connect both inputs (the top dots) to the value block you created by clicking and dragging from one dots to the other.
Then attach the function block's output anchor (the bottom dot) to the display block's input.
The square of the number you picked (1522756) should now appear in the output block.
Congratulations!
You've made a real Haskell program!

\textbf{Sliders!}
Our first program isn't very exciting.
You could write the same program in regular Haskell by typing \texttt{5 * 5}.
Viskell has a few tricks up its sleeve, however.
For our second example, we'll try adding a \emph{slider block}.
From the function menu, click the button to get a slider block.
Then connect it to one of the inputs (again, the top dots) of your multiplication function block.
Drag the slider to change its value: you should see the value on the output block change as well.

\textbf{Getting the Haskell code for your program}
Viskell generates Haskell code for you, which you can see by selecting your display block, pressing the \textbf{Z} key, and then selecting the `Haskell Source' tab.
Be careful, though: this is the Haskell code that actually gets executed.
It's probably not `good' Haskell code.


% Encoding: UTF-8

@Article{ostgaard2002,
  author = {Foo Bar},
  title =  {energy},
  year =   {2012}
}

@comment{jabref-meta: saveActions:enabled;title;LowerCaseChanger;}


Add a test Ignore-this: 19f6596aad706a2f11cf630c6c45ccbd

\documentclass{article}
\usepackage{verbatim}
\newenvironment{file}[1]%
  {\endgraf\noindent File: \texttt{#1}%
   \endgraf\verbatim}%
  {\endverbatim}

\begin{document}

The question is whether or not franchise can figure out the
correct package to use when multiple package export the same
module, or if it's just a fluke.

\begin{file}{a/Setup.hs}
import Distribution.Franchise
main = build [] (version "1.0") (package "a" ["Foo"] [])
\end{file}

Note: I shouldn't need to explicitly import the Prelude, but if I don't,
it breaks!

\begin{file}{a/Foo.hs}
module Foo ( foo, a ) where
import Prelude
a :: Int
a = 10
foo :: String
foo = "Foo a"
\end{file}

\begin{file}{b/Setup.hs}
import Distribution.Franchise
main = build [] (version "2.0") (package "b" ["Foo"] [])
\end{file}

\begin{file}{b/Foo.hs}
module Foo ( foo, b ) where
import Prelude
b :: Int
b = 20
foo :: String
foo = "Foo b"
\end{file}

\begin{file}{c/Setup.hs}
import Distribution.Franchise
req a = requireModuleExporting "Foo" a (a++" :: Int")
options = [configureFlag "with-a" "" (req "a"),
           configureFlag "with-b" "" (req "b")]
main = build options (version "1.0") (executable "c" "Main.hs" [])
\end{file}

\begin{file}{c/Main.hs}
import Foo ( foo )
main = print foo
\end{file}

\begin{file}{test.sh}
#!/bin/bash -e
cd a
runghc Setup.hs install --user
cd ../b
runghc Setup.hs install --user
cd ../c
runghc Setup.hs configure --with-a
#runghc Setup.hs build
#diff <(./c) <(echo Foo a)
runghc Setup.hs clean
runghc Setup.hs configure --with-b
#runghc Setup.hs build
#diff <(./c) <(echo Foo b)
\end{file}

Did that work?
\end{document}


\title{Milestone 4}
\author{Singularity Software}
\date{\today}

\documentclass[12pt]{article}
\usepackage[a4paper]{geometry}
\usepackage{makeidx}
\usepackage{lscape}
\usepackage{amsmath}
\usepackage{graphicx}
\usepackage[final]{pdfpages}

\geometry{top=1.0in, bottom=1.0in, left=1.0in, right=1.0in} % Sets the margins

\setlength{\parindent}{0pt} % Fixes the paragraph spacing problem

\renewcommand*\arraystretch{1.5}

\begin{document}

\begin{center}
	\LARGE{Milestone 4} \\
	\Large{\textit{Singularity Software}} \\
	\vspace{.05in}
	\normalsize{\today} \\
\end{center}

\section*{A Non-Trivial Technical Change}

\section*{Sprint 3 Backlog}
The following pages show the backlog for the previous sprint. Any remaining unfinished tasks from this sprint will be finished up over the coming weekend, and the next sprint's progress will begin following the completion of these unfinished tasks.

\includepdf[pages={1-2}]{pdfs/MS4VersionOne/OldSprintDetail.pdf}

\section*{Sprint 4 Backlog}
We are opting not to do TDD for this sprint.
\includegraphics[scale=.85]{pdfs/MS4VersionOne/NewSprintDetail.pdf}

\clearpage

\end{document}


\begin{figure}[ht]
    \centering
    \includegraphics[width=\linewidth]{figures/example-graph}
    \caption{Example graph and deletion operations. Deletions of a single element (node or edge) are denoted with a red cross \includegraphics[scale=0.14]{patterns/delete-single}, while recursive deletions are denoted with a purple cross \includegraphics[scale=0.14]{patterns/delete-recursively}.}
    \label{fig:example-graph}
\end{figure}


% use
% scribble --latex --style ka-style.tex ka.scrbl
% to render the document
\usepackage[utf8]{inputenc}
\usepackage{german}
\usepackage{a4}


\documentclass{article}

\usepackage[margin=3cm]{geometry}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{xspace}

\title{\Large\bfseries
CS 524: Concurrent Programming Languages \\
Fall 2017 \\
Homework 1}
\author{Chiao Hsieh, chsieh16@illinois.edu}

\begin{document}
\maketitle

\begin{enumerate}
\item Consider a computation path from an actor configuration.
Define \textit{global time} using the order of message receives along the
path\textemdash global time is initially zero and is incremented each time a
message is received by some actor.
Define \textit{delivery} time as the difference between the global time of the
transition which causes a given message $(a, m)$ to be sent and the time of
the event in which the message $m$ is received by $a$.
You may assume that the oldest message of the form $(a, m)$ is received before
any subsequent message $m$ sent to $a$.
The order of events on computation paths may be constrained by one of the
following:

\textbf{Local Boundedness Axiom}:
The set of delivery times of all messages which share the same target $a$ has
an upper bound.

\textbf{Global Boundedness Axiom}:
The set of delivery times of all messages has an upper bound.

\textbf{Equiprobable Delivery Axiom}:
All pending events are equally likely to occur next.

Prove or disprove:
\begin{enumerate}
\item Local boundedness implies fairness.

Ans.

No. Consider following Actor system,
\begin{verbatim}
A = rec(lambda b. lambda c. lambda m.
           seq(send(c, m),
               non-terminating lambda expression,
               ready(A(c))))
letactor {a := A(a)} send(a, nil)
\end{verbatim}
The actor program \texttt{A} will send itself a message and does not
terminate. By definition of global time, the time is incremented only when an
actor receives a message. Since there is no other messages being sent, we
know the delivery time of each message sent by \texttt{A} is exactly 1.
Therefore, it's locally bounded. However, the actor is never idle and hence
cannot process the message sent by itself.

\item Local boundedness implies global boundedness.

\item Global boundedness implies fairness.

Ans.

See (a).

\item If global boundedness is assumed, unbounded nondeterminism is not
possible.

\item If local boundedness is assumed then unbounded nondeterminism is not
possible.

\end{enumerate}
\end{enumerate}

\end{document}


Add LaTeX file to generate the MEP partial ordering graph

% Copyright (c) 2021 Morwenn
% SPDX-License-Identifier: MIT

\documentclass{minimal}
\usepackage{pgf, tikz}
\usetikzlibrary{arrows, automata, backgrounds, positioning}

\begin{document}
    \begin{tikzpicture}[
    		background rectangle/.style={fill=white},
    		show background rectangle,
            auto,
            node distance = 1.3cm,
            semithick
        ]

        \tikzstyle{every state}=[
            draw=none,
            shape=rectangle,
            fill=white
        ]

		\node[state] (reg) {$Reg$};
		\node[state] (sms) [above of=reg] {$SMS$};
		\node[state] (enc) [above of=sms] {$Enc$};
		\node[state] (sus) [above of=enc] {$SUS$};
		\node[state] (runs) [above of=sus] {$Runs$};
		\node[state] (rem) [right=1.5cm of sms] {$Rem$};
		\node[state] (exc) [above of=rem] {$Exc$};
		\node[state] (osc) [left=1.5cm of sms] {$Osc$};
		\node[state] (inv) [above of=osc] {$Inv$};
		\node[state] (dis) [left= 0.9cm of runs] {$Dis=Max$};

        \path[-] (reg) edge node {} (sms);
        \path[-] (sms) edge node {} (enc);
        \path[-] (enc) edge node {} (sus);
        \path[-] (sus) edge node {} (runs);
        \path[-] (reg) edge node {} (rem);
        \path[-] (rem) edge node {} (exc);
        \path[-] (reg) edge node {} (osc);
        \path[-] (osc) edge node {} (inv);
        \path[-] (inv) edge node {} (dis);
        \path[-] (sus) edge node {} (dis);
        \path[-] (osc) edge node {} (runs);
    \end{tikzpicture}
\end{document}


Add test data that includes every entry type supported by bibpy

@unpublished{unpubkey,
    author = {Somebody McPerson},
    title  = {How To Parse BibTex},
    year   = {2011}
}

@comment{
    Anything is possible with comments!
}

@string{
    variable = "value"
}

@preamble{ \textbf{\latex} }

This is just a comment


\documentclass{article}

\begin{document}

\title{Proof of Concept Plan}
\author{Daniel Mandel - mandeldr \\ Shandelle Murray - murras25 \\ Connor Sheehan - sheehacg}
\date{\today}
\maketitle

\begin{abstract}
This document contains a detailed plan for the implementation of a Proof of Concept plan for the OpenBazaar redevelopment project.
\end{abstract}

\section{}

\end{document}


One journal entry for the interesting experience of MR debugging

Obviously, 80\% of the debugging was in 20\% of the code: and this law applies recursively, meaning that I spent more than half my time on one percent of the code. Specifically, the interface between Boto and EMR.

Boto is the modular python bindings for calling anything from AWS. I learned it at work, and it was still not overkill for the actual job even though we ended up spending so much time on it, since we really didn't want to call things from the actual AWS REST API. It's designed so that \emph{anything} you can do in AWS, you can do in Boto. We actually use Boto both implicitly and explicitly: MRJobs, in the EMR mode that it has, is a thick wrapper around Boto, but MRJobs is incompatible with running jars like Mr.LDA or Hive directly, so you need to do that by uploading the jar to S3 and using Boto.

We appreciated MRJobs a lot, actually. Saved us a ton of time with niggling about with AWS configurations. However, Boto is at a lower layer (an intermediate layer, between the abstraction of MRJobs but above the abstraction of the REST API itself, which it calls). This meant that we had a crucial mistake with regards to the proper method for data locality. To wit, Amazon's Hive is actually kind of compatible with running on S3 (that is, running the code close to the data in S3), but with some subtle difficulties that made it impossible for our use case. Therefore, I used s3distcp to copy everything to HDFS, where it ran fine. Thanks to my old boss for the reminder. That took up conservatively speaking 35\% of my development time.

Our big scaling problem will undoubtedly now be the Hive job and Mr.LDA, most probably Mr.LDA. However, it may be enough to throw more machines at it.


\begin{circuitikz}
	\draw(0,0) node[njfet,yscale=-1] (fet) {};
	\draw(fet.gate) |- (fet.drain);
	\draw(fet.source) to [vR, l_=Decade Box, mirror] ++(0,2)
	to [short] ++(1,0)
	to [ammeter] ++(0,-2) node[] (end) {};
	\draw(fet.drain) to [short] ++(1,0)
	to [V, l_=\SI{16}{\volt}DC \& \SI{32}{\volt}DC] ++(0, 2)
	to [short] ($(end)$);
	\draw (fet.gate) node[anchor=north east] {Part Number};
\end{circuitikz}

Add JFET part number to schematic 4.

\begin{circuitikz}
	\draw(0,0) node[njfet,yscale=-1] (fet) {};
	\draw(fet.gate) |- (fet.drain);
	\draw(fet.source) to [vR, l_=Decade Box, mirror] ++(0,2)
	to [short] ++(1,0)
	to [ammeter] ++(0,-2) node[] (end) {};
	\draw(fet.drain) to [short] ++(1,0)
	to [V, l_=\SI{16}{\volt}DC \& \SI{32}{\volt}DC] ++(0, 2)
	to [short] ($(end)$);
	\draw (fet.gate) node[anchor=north east] {2N5459};
\end{circuitikz}


% Postscript figures
\usepackage{psfig}

% Float an image in the correct location /begin{figure}[H]
\usepackage{float}

% Citation package
\usepackage{cite}

% For math stuff like \boldsymbol
\usepackage{amsmath}

% Used for printing Matlab m-files with syntax highlighting
% \usepackage[framed,numbered,autolinebreaks,useliterate]{mcode}

\newcommand{\bs}[1]{%
    \boldsymbol{#1}
}

% \usepackage{minted}
% \renewcommand{\theFancyVerbLine}{
%    \sffamily\textcolor[rgb]{0.5,0.5,0.5}{\scriptsize\arabic{FancyVerbLine}}}

% TODO Items
\newcommand\TODO[1]{[TODO: #1]}

Add the nameref package to reference the chapter names

% Include the name of the ref instead of the chapter number
% \nameref{chap:introduction}
\usepackage{nameref}

% Postscript figures
\usepackage{psfig}

% Float an image in the correct location /begin{figure}[H]
\usepackage{float}

% Citation package
\usepackage{cite}

% For math stuff like \boldsymbol
\usepackage{amsmath}

% Used for printing Matlab m-files with syntax highlighting
% \usepackage[framed,numbered,autolinebreaks,useliterate]{mcode}

\newcommand{\bs}[1]{%
    \boldsymbol{#1}
}

% \usepackage{minted}
% \renewcommand{\theFancyVerbLine}{
%    \sffamily\textcolor[rgb]{0.5,0.5,0.5}{\scriptsize\arabic{FancyVerbLine}}}

% TODO Items
\newcommand\TODO[1]{[TODO: #1]}


\documentclass[11pt,a4paper,twoside]{article}
\usepackage[utf8]{inputenc}
\usepackage[danish]{babel}
\usepackage[T1]{fontenc}

\begin{document}

\title{PowerSupply Unit}
\author{M.T.Kaalund \texttt{github.io/mtkaalund}}
\date{\today}

\maketitle

\begin{abstract}
Dette er for fremtidig reference, her ville jeg dokumenter de enklet dele elementer i project: PSU
\end{abstract}

\tableofcontents

\input{voltageinput}
\input{currentshunt}
\input{voltageregulate}
\input{controlpanel}
\input{mcu}

\end{document}

Change language from danish to english

\documentclass[11pt,a4paper,twoside]{article}
\usepackage[utf8]{inputenc}
\usepackage[english]{babel}
\usepackage[T1]{fontenc}

\begin{document}

\title{PowerSupply Unit}
\author{M.T.Kaalund \texttt{github.io/mtkaalund}}
\date{\today}

\maketitle

\begin{abstract}
This for a future reference, this documentation will become a record of the parts in this project.
\end{abstract}

\tableofcontents

\input{voltageinput}
\input{currentshunt}
\input{voltageregulate}
\input{controlpanel}
\input{mcu}

\end{document}


\documentclass[a4paper]{book}

\usepackage[utf8]{inputenc}
\usepackage{ngerman}
\usepackage[a4paper]{geometry}
\usepackage{parskip}
\usepackage{graphicx}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{booktabs}
\usepackage[space]{grffile}
\usepackage[dvipsnames]{xcolor}
\usepackage{verbatim}

\newcommand*{\R}{\mathbb{R}}
\newcommand*{\N}{\mathbb{N}}
\newcommand*{\Z}{\mathbb{Z}}
\newcommand*{\Q}{\mathbb{Q}}
\newcommand*{\C}{\mathbb{C}}

\newcommand*{\sgn}{\operatorname{sgn}}

\theoremstyle{plain}
\newtheorem{theorem}{Satz}[chapter]
\newtheorem{definition}{Definition}[chapter]
\newtheorem{solution}{Lösung}[chapter]
\newtheorem{exercise}{Übung}[chapter]
\newtheorem{solutionprocess}{Lösungsweg}[chapter]
\newtheorem{proofsummary}{Beweiszusammenfassung}[chapter]
\newtheorem{alternativeproof}{Alternativer Beweis}[chapter]

\theoremstyle{remark}
\newtheorem{hint}{Hinweis}[chapter]
\newtheorem{warning}{Warnung}[chapter]
\newtheorem{example}{Beispiel}[chapter]

Add more context for error messages

\documentclass[a4paper]{book}

\usepackage[utf8]{inputenc}
\usepackage{ngerman}
\usepackage[a4paper]{geometry}
\usepackage{parskip}
\usepackage{graphicx}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{booktabs}
\usepackage[space]{grffile}
\usepackage[dvipsnames]{xcolor}
\usepackage{verbatim}

\newcommand*{\R}{\mathbb{R}}
\newcommand*{\N}{\mathbb{N}}
\newcommand*{\Z}{\mathbb{Z}}
\newcommand*{\Q}{\mathbb{Q}}
\newcommand*{\C}{\mathbb{C}}

\newcommand*{\sgn}{\operatorname{sgn}}

\theoremstyle{plain}
\newtheorem{theorem}{Satz}[chapter]
\newtheorem{definition}{Definition}[chapter]
\newtheorem{solution}{Lösung}[chapter]
\newtheorem{exercise}{Übung}[chapter]
\newtheorem{solutionprocess}{Lösungsweg}[chapter]
\newtheorem{proofsummary}{Beweiszusammenfassung}[chapter]
\newtheorem{alternativeproof}{Alternativer Beweis}[chapter]

\theoremstyle{remark}
\newtheorem{hint}{Hinweis}[chapter]
\newtheorem{warning}{Warnung}[chapter]
\newtheorem{example}{Beispiel}[chapter]

\errorcontextlines 10000


% To enable Gameki plugins, add the following before
% \ProcessOptions*\relax
% in LaTeX/gametex.sty:
%
% \input \gamepath/Gameki/lib/plugins.sty
%

% Add stuff to the \STARTINPUTS..\FINISHINPUTS block.
\long\def\ADDINPUTS#1\FINISHINPUTS{%
  \edef\@inputinputs{%
    \expandafter\unexpanded\expandafter{\@inputinputs}%
    \unexpanded{#1}%
  }
}

\input \gamepath/Gameki/Plugins/abilstats.sty
\input \gamepath/Gameki/Plugins/badgeitems.sty
\input \gamepath/Gameki/Plugins/image.sty
%\input \gamepath/Gameki/Plugins/booksheets.sty
\input \gamepath/Gameki/Plugins/memboxes.sty
\input \gamepath/Gameki/Plugins/stickeritems.sty
% Don't put extra space after periods. It's the standard these days, and it
% avoids the complexity of needing to worry about exceptions like ``Mr.''.
\frenchspacing

Make booksheets optional based on a def in the .cls, setstretch{1}.

% To enable Gameki plugins, add the following before
% \ProcessOptions*\relax
% in LaTeX/gametex.sty:
%
% \input \gamepath/Gameki/lib/plugins.sty
%

% Add stuff to the \STARTINPUTS..\FINISHINPUTS block.
\long\def\ADDINPUTS#1\FINISHINPUTS{%
  \edef\@inputinputs{%
    \expandafter\unexpanded\expandafter{\@inputinputs}%
    \unexpanded{#1}%
  }
}

\ifdefined\booksheets
\input \gamepath/Gameki/Plugins/booksheets.sty
\fi

\input \gamepath/Gameki/Plugins/abilstats.sty
\input \gamepath/Gameki/Plugins/badgeitems.sty
\input \gamepath/Gameki/Plugins/image.sty
\input \gamepath/Gameki/Plugins/memboxes.sty
\input \gamepath/Gameki/Plugins/stickeritems.sty
% Don't put extra space after periods. It's the standard these days, and it
% avoids the complexity of needing to worry about exceptions like ``Mr.''.
\frenchspacing
% GameTeX by default sets this to 1.2 for sheets other than the rules for some
% reason.
\AddToOption{sheet}{\setstretch{1}}


---
---

@article{gelman1992,
    author={Gelman, Andrew and Rubin, Donald B.},
    title={Inference from Iterative Simulation Using Multiple Sequences},
    volume={7},
    DOI={10.1214/ss/1177011136},
    number={4},
    journal={Statistical Science},
    year={1992},
    pages={457-472}
},

@article{eddelbuettel2011,
    title = {{Rcpp}: Seamless {R} and {C++} Integration},
    author = {Dirk Eddelbuettel and Romain Fran\c{c}ois},
    journal = {Journal of Statistical Software},
    year = {2011},
    volume = {40},
    number = {8},
    pages = {1--18},
    url = {http://www.jstatsoft.org/v40/i08/},
}

Add reference to tikz manual

---
---

@article{gelman1992,
    author={Gelman, Andrew and Rubin, Donald B.},
    title={Inference from Iterative Simulation Using Multiple Sequences},
    volume={7},
    DOI={10.1214/ss/1177011136},
    number={4},
    journal={Statistical Science},
    year={1992},
    pages={457-472}
},

@article{eddelbuettel2011,
    title = {{Rcpp}: Seamless {R} and {C++} Integration},
    author = {Dirk Eddelbuettel and Romain Fran\c{c}ois},
    journal = {Journal of Statistical Software},
    year = {2011},
    volume = {40},
    number = {8},
    pages = {1--18},
    url = {http://www.jstatsoft.org/v40/i08/},
},

@manual{tantau2013,
    author    = {Till Tantau},
    title     = {The TikZ and PGF Packages},
    subtitle  = {Manual for version 3.0.0},
    url       = {http://sourceforge.net/projects/pgf/},
    date      = {2013-12-20},
}


\def\sll{simply linked list}
\def\Sll{Simply linked list}
\def\dll{doubly linked list}
\def\Dll{Doubly linked list}
\def\ttt{2-3 tree}

Add definitions of TeX macros for semantic markup.


%
% These are utility commands I often use in my documents.
% They're not loaded automatically by any of the templates, so you'll have to do that
% manually if you'd like to use them :)
%

\newcommand{\leadingzero}[1]{\ifnum #1<10 0\the#1\else\the#1\fi}
\newcommand{\todayInNumbers}{\leadingzero{\day}.\leadingzero{\month}.\the\year}

\newcommand{\mcal}[1]{\mathcal{#1}}

\newcommand{\op}[1]{\operatorname{#1}}

\newcommand{\todoin}[1]{\todo[inline]{#1}}

\newcommand{\fig}[2]{
    \begin{figure}[h]
        \centering\footnotesize
        \includegraphics[width=\columnwidth]{figures/#1}
        \caption{#2}
        \label{fig:#1}
    \end{figure}
}

\newcommand{\figw}[2]{
    \begin{figure*}[htbp]
        \centering\footnotesize
        \includegraphics[width=\textwidth]{figures/#1}
        \caption{#2}
        \label{fig:#1}
    \end{figure*}
}

Add command for landscape figures

%
% These are utility commands I often use in my documents.
% They're not loaded automatically by any of the templates, so you'll have to do that
% manually if you'd like to use them :)
%

% Needed for landscape figures
\usepackage{pdflscape}

\newcommand{\leadingzero}[1]{\ifnum #1<10 0\the#1\else\the#1\fi}
\newcommand{\todayInNumbers}{\leadingzero{\day}.\leadingzero{\month}.\the\year}

\newcommand{\mcal}[1]{\mathcal{#1}}

\newcommand{\op}[1]{\operatorname{#1}}

\newcommand{\todoin}[1]{\todo[inline]{#1}}

% Normal figure
\newcommand{\fig}[2]{
    \begin{figure}[h]
        \centering\footnotesize
        \includegraphics[width=\columnwidth]{figures/#1}
        \caption{#2}
        \label{fig:#1}
    \end{figure}
}

% Wide figure (for two-column mode)
\newcommand{\figw}[2]{
    \begin{figure*}[htbp]
        \centering\footnotesize
        \includegraphics[width=\textwidth]{figures/#1}
        \caption{#2}
        \label{fig:#1}
    \end{figure*}
}

% Landscape figure
\newcommand{\figl}[2]{
    \begin{landscape}
         \begin{figure}
             \centering\footnotesize
             \includegraphics[width=\linewidth]{figures/#1}
             \caption{#2}
             \label{fig:#1}
         \end{figure}
    \end{landscape}
}


% Comment to allow building from within this file
%!TEX root = pyconuk2016.tex

\blankscreen{
  Contact Details
}

\begin{frame}{}
  \begin{description}
    \item [Twitter] @opcampbell
    \item [Github] meatballs
  \end{description}

  \speakernote{
    Thank organisers\textCR
    Slides available from my website\textCR
    Produced using Latex and available on github\textCR
    Take questions
  }
\end{frame}

Add omni4d site to contact details

% Comment to allow building from within this file
%!TEX root = pyconuk2016.tex

\blankscreen{
  Contact Details
}

\begin{frame}{}
  \begin{description}
    \item www.omni4d.org
    \item [Twitter] @opcampbell
    \item [Github] meatballs
  \end{description}

  \speakernote{
    Thank organisers\textCR
    Slides available from my website\textCR
    Produced using Latex and available on github\textCR
    Take questions
  }
\end{frame}


%!TEX TS-program = xelatex
%!TEX encoding = UTF-8 Unicode
\documentclass{article}
\usepackage{fontspec}
\usepackage{gettext}

\newcommand{\sandwitches}[1]{
\ngettext{There is one sandwich on the table}{There are #1 sandwiches on the table}{#1}
}

\newcommand{\mercuries}[1]{
\npgettext{first mercury is a person, second is substance, third is planet}{One mercury brings mercury onto Mercury}{#1 mercuries bring mercury onto Mercury}{#1}
}

\begin{document}

{\large get\TeX t}

\gettext{Hello world!}

\sandwitches{1}

\sandwitches{2}

\sandwitches{3}

\sandwitches{4}

\sandwitches{5}

\mercuries{1}

\mercuries{2}

\mercuries{3}

\mercuries{4}

\mercuries{5}

\end{document}

Add \today and \formatdate to example document

%!TEX TS-program = xelatex
%!TEX encoding = UTF-8 Unicode
\documentclass{article}
\usepackage{fontspec}
\usepackage{gettext}

\newcommand{\sandwitches}[1]{
\ngettext{There is one sandwich on the table}{There are #1 sandwiches on the table}{#1}
}

\newcommand{\mercuries}[1]{
\npgettext{first mercury is a person, second is substance, third is planet}{One mercury brings mercury onto Mercury}{#1 mercuries bring mercury onto Mercury}{#1}
}

\begin{document}

{\large get\TeX t}

\gettext{Hello world!}

\today

\formatdate{21}{12}{2012}

\sandwitches{1}

\sandwitches{2}

\sandwitches{3}

\sandwitches{4}

\sandwitches{5}

\mercuries{1}

\mercuries{2}

\mercuries{3}

\mercuries{4}

\mercuries{5}

\end{document}