tex-projects/LaTeX-examples
2
0
Fork 0
mirror of https://github.com/MartinThoma/LaTeX-examples.git synced 2025-04-19 11:38:05 +02:00
Code Activity

misc

Browse source
This commit is contained in:
Martin Thoma 2013-11-27 13:40:31 +01:00
parent 10bc309a7e
commit 1b54402c49
4 changed files with 32 additions and 20 deletions
Download patch file Download diff file Expand all files Collapse all files

BIN
documents/GeoTopo/GeoTopo.pdf
View file

Binary file not shown.

6
documents/GeoTopo/Kapitel2.tex
View file

@ -361,10 +361,8 @@ $\partial X$ ist eine Mannigfaltigkeit der Dimension $n-1$.
\begin{definition}
$S \subseteq \mdr^3$ heißt \textbf{reguläre Fläche}\xindex{Fläche!reguläre} $:\gdw$
zu $s \in S$ ex. eine Umgebung $V \subseteq \mdr^3$ und offene
Teilmengen $U \subseteq \mdr^2$ und differenzierbare Abbildung
$F: U \rightarrow V \cap S$ mit $\text{Rg}(J_f(u)) = 2$
für alle $u \in U$.
$\forall s \in S\;\exists $ Umgebung $V \subseteq \mdr^3$ $\exists U \subseteq \mdr^2$ offen: $\exists$ differenzierbare Abbildung
$F: U \rightarrow V \cap S$: $\text{Rg}(J_F(u)) = 2\;\;\;\forall u \in U$.
$F$ heißt (lokale) reguläre Parametrisierung von $S$.

45
presentations/Datamining-Proseminar/Kurzpraesentation/LaTeX/DYCOS.tex
View file

@ -7,22 +7,35 @@
\end{center}
\end{frame}
\begin{frame}{Der Algorithmus}
\begin{algorithm}[H]
\begin{algorithmic}
\Function{DYCOS}{Network $G_t = (N_t, A_t, T_t), l, h, p_s$}
\ForAll{node $v$ in $T_t$} \Comment{Für jeden gelabelten Knoten}
\For{$i \in 1, \dots, l$}
\State Perform an $h$-hop random walk from $v$
\EndFor
\State Classify $v$ with the class labels most frequent
encountered
\EndFor
\EndFunction
\end{algorithmic}
\caption{DYCOS algorithm for classification with content and structure}
\label{alg:seq1}
\end{algorithm}
\begin{frame}{DYCOS}
DYCOS zeichnet sich aus durch:
\begin{itemize}
\item \textbf{Geschwindigkeit}: < $10\si{\second}$ für
\begin{itemize}
\item $806\,635$ Knoten ($18\,999$ mit Labels)
\item $4\,414\,135$ Kanten
\end{itemize}
\item \textbf{Genauigkeit}: > $65\%$
\end{itemize}
\end{frame}
%\begin{frame}{Der Algorithmus}
%\begin{algorithm}[H]
% \begin{algorithmic}
% \Function{DYCOS}{Network $G_t = (N_t, A_t, T_t), l, h, p_s$}
% \ForAll{node $v$ in $T_t$} \Comment{Für jeden gelabelten Knoten}
% \For{$i \in 1, \dots, l$}
% \State Perform an $h$-hop random walk from $v$
% \EndFor
% \State Classify $v$ with the class labels most frequent
% encountered
% \EndFor
% \EndFunction
% \end{algorithmic}
%\caption{DYCOS algorithm for classification with content and structure}
%\label{alg:seq1}
%\end{algorithm}
%\end{frame}

1
presentations/Datamining-Proseminar/Kurzpraesentation/templates/myStyle.sty
View file

@ -24,6 +24,7 @@
\usepackage{pifont}% http://ctan.org/pkg/pifont
\usepackage{soul}
\usepackage{braket}
\usepackage{siunitx}
% Define some styles for graphs
\tikzstyle{vertex}=[circle,fill=black!25,minimum size=20pt,inner sep=0pt]