presentation update and defense start
[bsc-thesis1415.git] / pres / pres.tex
1 %&pres
2 \begin{document}
3 \frame{\titlepage}
4
5 \section{Introduction}
6 \subsection{Hyperleap}
7 \begin{frame}
8 \frametitle{Hyperleap}
9 \framesubtitle{Infotainment}
10 \begin{block}{}
11 \begin{figure}[H]
12 \includegraphics[width=0.2\linewidth]{hyperleaplogo}
13 \end{figure}
14 \pause\begin{itemize}
15 \item Information $+$ Entertainment $=$ Infotainment
16 \item Nijmegen
17 \item 1995
18 \item Leisure industry
19 \end{itemize}
20 \end{block}
21 \end{frame}
22
23 \begin{frame}
24 \frametitle{Current situation}
25 \pause\begin{block}{}
26 \begin{figure}[H]
27 \includegraphics[width=\linewidth]{informationflow}
28 \end{figure}
29 \note{Show automated path and manual path}
30 \end{block}
31 \end{frame}
32
33 \subsection{RSS Feeds}
34 \begin{frame}[fragile]
35 \frametitle{RSS/Atom Feeds}
36 \pause\lstinputlisting[language=xml]{exrss.xml}
37 \end{frame}
38
39 \subsection{Goal \& Research question}
40 \begin{frame}
41 \frametitle{Current feedback loop}
42 \framesubtitle{Indepth in the automated path}
43 \pause\begin{block}{}
44 \begin{figure}[H]
45 \includegraphics<1>[width=\linewidth]{feedbackloop}
46 \includegraphics<2>[width=\linewidth]{feedbackloop2}
47 \end{figure}
48 \end{block}
49 \note{Expensive programmer time for usually trivial changes}
50 \end{frame}
51
52 \subsection{Crash course graphs}
53 \begin{frame}
54 \frametitle{Directed graphs}
55 \pause\begin{columns}[T]
56 \column{.5\textwidth}
57 Graph $G=(V, E)$\\
58 \pause$\quad$ where\\
59 $\quad\quad V=\{n_1, n_2, \ldots, n_k\}$\\
60 \pause$\quad\quad E\subseteq V\times V$
61 \column{.5\textwidth}
62 \begin{figure}[H]
63 \pause\includegraphics[width=\linewidth]{graphexample}
64 \end{figure}
65 \end{columns}
66 \begin{block}{}
67 \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)\})$$
68 \end{block}
69 \end{frame}
70
71 \begin{frame}
72 \frametitle{Remove cyclicity}
73 \pause\begin{block}{Arrow notation}
74 If $e\in E$ and $e=(v_1,v_2)$ or $v_1\rightarrow v_2$ then\\
75 $\quad v_1\xrightarrow{+}v_n$ which means
76 $v_1\rightarrow v_2\rightarrow\ldots\rightarrow v_{n-1}\rightarrow v_n$\\
77 \end{block}
78 \begin{block}{\only<3>{Cyclicity}\only<4>{Directed Acyclic Word Graphs}}
79 \only<4>{$G=(V,v_0,E,F)$}
80 \only<4>{Word: concatenation of labels from $v_0\xrightarrow{+}F_k$}
81 \begin{figure}[H]
82 \only<3>{\includegraphics[scale=0.4]{dagexample}}
83 \only<4>{\includegraphics[width=\textwidth]{dawgexample}}
84 \end{figure}
85 \end{block}
86 \end{frame}
87
88 \section{Methods}
89 \subsection{Program}
90 \begin{frame}
91 \frametitle{Overview}
92 \begin{figure}[H]
93 \includegraphics[width=\linewidth]{appoverview}
94 \end{figure}
95 \end{frame}
96
97 \begin{frame}
98 \frametitle{Frontend}
99 \begin{itemize}[<+->]
100 \item Useable by non programmers
101 \end{itemize}
102 \begin{figure}[H]
103 \only<2>{\includegraphics[width=\linewidth]{frontendfront}}
104 \only<3>{\includegraphics[width=\linewidth]{crawlerpattern}}
105 \end{figure}
106 \end{frame}
107
108 \begin{frame}
109 \frametitle{Backend}
110 \pause\begin{figure}[H]
111 \centering
112 \includegraphics[width=1.1\linewidth]{backend}
113 \end{figure}
114 \end{frame}
115
116 \subsection{Algorithm}
117 \begin{frame}
118 \frametitle{Building minimal DAWGs from user data}
119 \begin{itemize}[<+->]
120 \item Based on Daciuk et al.
121 \item User patterns become nodes/subgraphs
122 \item Incremental construction
123 \end{itemize}
124 \end{frame}
125
126 \section{Conclusion \& Discussion}
127 \subsection{Conclusion}
128 \begin{frame}
129 \frametitle{Conclusion}
130 \pause\begin{itemize}[<+->]
131 \item Yes, feedback loop is shortened
132 \item But\ldots
133 \item Few RSS feeds
134 \item Misuse of HTML
135 \end{itemize}
136 \end{frame}
137
138 \subsection{Discussion}
139 \begin{frame}
140 \frametitle{Discussion}
141 \pause\begin{itemize}[<+->]
142 \item Whiten the black boxes
143 \item Adapt for HTML
144 \item Reuse interfacing technique
145 \end{itemize}
146 \end{frame}
147 \end{document}