Make documents/Proseminar-Netzwerkanalyse ready for arxiv

documents/Proseminar-Netzwerkanalyse/Ausarbeitung-Thoma.tex

@@ -1,5 +1,5 @@
 \documentclass[technote,a4paper,leqno]{IEEEtran}
-
+\pdfoutput=1
 %---- Sonderzeichen-------%
 \usepackage[utf8]{inputenc} % this is needed for umlauts
 \usepackage[ngerman]{babel} % this is needed for umlauts
@@ -24,8 +24,9 @@
 \usepackage{subfig}         % multiple figures in one
 \usepackage{caption}
 \usepackage{tikz}
+\let\labelindent\relax
 \usepackage{enumitem}
-\usepackage[german,nameinlink]{cleveref}
+\usepackage[german]{cleveref} % nameinlink - arxiv has too old LaTeX :-(
 \usepackage{braket}
 \allowdisplaybreaks
 \usetikzlibrary{backgrounds}
@@ -39,7 +40,7 @@
 
 \hypersetup{
   pdftitle    = {Über die Klassifizierung von Knoten in dynamischen Netzwerken mit textuellen Inhalten},
-  pdfauthor   = {Martin Thoma},
+  pdfauthor   = {Martin Thoma}, % ORCID: http://orcid.org/0000-0002-6517-1690
   pdfkeywords = {DYCOS}
 }
 

documents/Proseminar-Netzwerkanalyse/Makefile

@@ -13,4 +13,4 @@ ebook:
 	ebook-convert $(SOURCE).html $(SOURCE).epub --language de --no-default-epub-cover
 
 clean:
-	rm -rf  $(TARGET) *.class *.html *.log *.aux *.out *.thm *.idx *.toc *.ind *.ilg *.glg *.glo *.gls *.ist *.xdy *.bbl *.blg *.bak
+	rm -rf  $(TARGET) *.class *.html *.log *.aux *.out *.thm *.idx *.toc *.ind *.ilg *.glg *.glo *.gls *.ist *.xdy *.blg *.bak

documents/Proseminar-Netzwerkanalyse/README.md

@@ -1,5 +1,4 @@
-About
-=====
+# About
 The document in this folder is part of a proseminar at KIT. It is
 written in German.
 
@@ -11,8 +10,7 @@ dauern und 10-15 Minuten Diskussion.
 Zu der Ausarbeitung gehört eine [Präsentation](https://github.com/MartinThoma/LaTeX-examples/tree/master/presentations/Proseminar-Netzwerkanalyse).
 
 
-Abstract - English
-------------------
+## Abstract - English
 This paper explains the DYCOS-Algorithm as it was introduced in by Aggarwal and
 Li in 2011. It operates on graphs whichs nodes are partially labeled and
 automatically adds missing labels to nodes. To do so, the DYCOS algorithm makes
@@ -22,3 +20,10 @@ the missing labels to a Graph with 19396 nodes of which 14814 are labeled and
 another Graph with 806635 nodes of which 18999 are labeld on one core of an
 Intel Xeon 2.5 GHz CPU with 32 G RAM within less than a minute.
 Additionally, extensions of the DYCOS algorithm are proposed.
+
+
+## Possible categories
+
+* cs.LG - learning - http://arxiv.org/list/cs.LG/recent
+* cs.CL - computation and language - http://arxiv.org/list/cs.CL/recent
+* cs.SI - Social and Information Networks - http://arxiv.org/list/cs.SI/recent