9 \framesubtitle{Infotainment
}
12 \includegraphics[width=
0.2\linewidth]{hyperleaplogo
}
15 \item Information $+$ Entertainment $=$ Infotainment
18 \item Leisure industry
24 \frametitle{Current situation
}
27 \includegraphics[width=
\linewidth]{informationflow
}
29 \note{Show automated path and manual path
}
33 \subsection{Goal \& Research question
}
35 \frametitle{Current feedback loop
}
36 \framesubtitle{Indepth in the automated path
}
39 \includegraphics<
1>
[width=
\linewidth]{feedbackloop
}
40 \includegraphics<
2>
[width=
\linewidth]{feedbackloop2
}
43 \note{Expensive programmer time for usually trivial changes
}
46 \subsection{Crash course graphs
}
48 \frametitle{Directed graphs
}
49 \pause\begin{columns
}[T
]
53 $
\quad\quad V=\
{n_1, n_2,
\ldots, n_k\
}$\\
54 \pause$
\quad\quad E
\subseteq V
\times V$
57 \pause\includegraphics[width=
\linewidth]{graphexample
}
61 \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)\
})$$
66 \frametitle{Directed acyclic graphs
}
67 \pause\begin{block
}{Arrow notation
}
68 If $e
\in E$ and $e=(v_1,v_2)$ or $v_1
\rightarrow v_2$ then\\
69 $
\quad v_1
\xrightarrow{+
}v_n$ which means
70 $v_1
\rightarrow v_2
\rightarrow\ldots\rightarrow v_
{n-
1}\rightarrow v_n$
72 \pause\begin{block
}{Cyclicity
}
73 $
\nexists v
\in V: v
\xrightarrow{+
}v$
74 \pause\begin{figure
}[H
]
75 \includegraphics[scale=
0.4]{dagexample
}
81 \frametitle{Directed acyclic word graphs (DAWGs)
}
82 \pause\begin{figure
}[H
]
83 \includegraphics[width=
\textwidth]{dawgexample
}
85 \pause\begin{block
}{Mathematical definition
}
91 \subsection{Algorithm
}
94 \section{Conclusion \& Discussion
}
95 \subsection{Conclusion
}
96 \subsection{Discussion
}