update presentation
[bsc-thesis1415.git] / pres / pres.tex
index 391c350..eaa1d7f 100644 (file)
@@ -6,24 +6,83 @@
        \subsection{Hyperleap}
        \begin{frame}
                \frametitle{Hyperleap}
+               \framesubtitle{Infotainment}
                \begin{block}{}
                        \begin{figure}[H]
                                \includegraphics[width=0.2\linewidth]{hyperleaplogo}
                        \end{figure}
-               \end{block}
-               
-               \begin{block}{Infotainment}
                        \begin{itemize}[<+->]
-                               \item Information
-                               \item Entertainment
-                               \item biosAgenda.nl
-                               \item theAgenda.nl
-                               \item \ldots
+                               \item Information $+$ Entertainment $=$ Infotainment
+                               \item Nijmegen
+                               \item 1995
+                               \item Leisure industry
                        \end{itemize}
                \end{block}
        \end{frame}
 
-       \subsection{Graphs}
+       \begin{frame}
+               \frametitle{Current situation}
+               \begin{block}{}
+                       \begin{figure}[H]
+                               \includegraphics[width=\linewidth]{informationflow}
+                       \end{figure}
+                       \note{Show automated path and manual path}
+               \end{block}
+       \end{frame}
+
+       \subsection{Goal \& Research question}
+       \begin{frame}
+               \frametitle{Current feedback loop}
+               \framesubtitle{Indepth in the automated path}
+               \begin{block}{}
+                       \begin{figure}[H]
+                               \includegraphics<1>[width=\linewidth]{feedbackloop}
+                               \includegraphics<2>[width=\linewidth]{feedbackloop2}
+                       \end{figure}
+               \end{block}
+               \note{Expensive programmer time for usually trivial changes}
+       \end{frame}
+
+       \subsection{Crash course graphs}
+       \begin{frame}
+               \frametitle{Directed graphs}
+               \begin{columns}[T]
+                       \column{.5\textwidth}
+                               Graph $G=(V, E)$\\
+                               \pause$\quad$ where\\
+                               $\quad\quad V=\{n_1, n_2, \ldots, n_k\}$\\
+                               \pause$\quad\quad E\subseteq V\times V$
+                       \column{.5\textwidth}
+                               \begin{figure}[H]
+                                       \pause\includegraphics[width=\linewidth]{graphexample}
+                               \end{figure}
+               \end{columns}
+               \begin{block}{}
+                       \pause$$G=(\{n_1, n_2, n_3, n_4\}, \{(n_1, n_2), (n_2, n_1), (n_2, n_3), (n_3, n_4), (n_1, n_4)\})$$
+               \end{block}
+       \end{frame}
+
+       \begin{frame}
+               \frametitle{Directed acyclic graphs}
+               \begin{block}{Arrow notation}
+                       If $e\in E$ and $e=(v_1,v_2)$ or $v_1\rightarrow v_2$ then\\
+                       $\quad v_1\xrightarrow{+}v_n$ which means
+                       $v_1\rightarrow v_2\rightarrow\ldots\rightarrow v_{n-1}\rightarrow v_n$
+               \end{block}
+               \pause\begin{block}{Cyclicity}
+                       $\nexists v\in V: v\xrightarrow{+}v$
+                       \pause\begin{figure}[H]
+                               \includegraphics[scale=0.4]{dagexample}
+                       \end{figure}
+               \end{block}
+       \end{frame}
+
+       \begin{frame}
+               \frametitle{Directed acyclic word graphs (DAWGs)}
+               \pause\begin{figure}[H]
+                       \includegraphics[width=\textwidth]{dawgexample}
+               \end{figure}
+       \end{frame}
 
        \section{Methods}
        \subsection{Algorithm}