From 12028569502700ec4b2bcbf1a1d63444c86e36d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Andreas=20Sch=C3=A4rtl?= <andreas.schaertl@fau.de>
Date: Mon, 9 Nov 2020 10:54:27 +0100
Subject: [PATCH] report: put emphasis on contributions
---
doc/report/applications.tex | 19 ++++++++++---------
doc/report/conclusion.tex | 10 ++++++----
2 files changed, 16 insertions(+), 13 deletions(-)
diff --git a/doc/report/applications.tex b/doc/report/applications.tex
index 4549842..5f17c4f 100644
--- a/doc/report/applications.tex
+++ b/doc/report/applications.tex
@@ -1,7 +1,7 @@
\section{Applications}\label{sec:applications}
With programming endpoints in place, we can now query the data set
-containing both Isabelle and Coq exports stored in {GraphDB}. We
+containing both Isabelle and Col exports stored in {GraphDB}. We
experimented with the following applications that talk to a GraphDB
Endpoint, our second contribution.
@@ -126,9 +126,10 @@ actually reachable URI on the open web, if that is applicable for a
given library.
While translating from \texttt{ulo:sourceref} to original URI
-introduced some extra work, implementing this application was easy and
-straight-forward. Implementing similar features for other environments
-should not be very difficult.
+introduced some extra work, implementing this application was
+straight-forward. With this we showed that searching through metadata
+in existing ULO data sets is already quite feasible. Implementing
+similar features for other environments should not be very difficult.
\subsection{Querying for Tetrapodal Search}\label{sec:tetraq}
@@ -333,11 +334,11 @@ query. Because everything is handled by the database, access should be
about as quick as we can hope it to be.
While the sparse data set available to use only returned a handful of
-results, we see that queries like~$\mathcal{Q}_3$ are easily serviced
-with organizational knowledge formulated in ULO~triplets. More
-advanced queries could look at the interlinks between authors and even
-uncover ``citation cartels'' as was done previously with similar
-approaches~\cite{citcart}.
+results, we showed that queries such as~$\mathcal{Q}_3$ are easily
+serviced with organizational knowledge formulated in
+ULO~triplets. More advanced queries could look at the interlinks
+between authors and even uncover ``citation cartels'' as was done
+previously with similar approaches~\cite{citcart}.
\subsubsection{Summarizing $\mathcal{Q}_1$ to $\mathcal{Q}_3$}
diff --git a/doc/report/conclusion.tex b/doc/report/conclusion.tex
index 76da74d..7c8f196 100644
--- a/doc/report/conclusion.tex
+++ b/doc/report/conclusion.tex
@@ -50,7 +50,9 @@ necessary to further extend the upper level ontology. It will be
necessary to look at the properties of future exports to make a more
well-funded decision.
-Despite many open questions, \emph{ulo-storage} provides the necessary
-infrastructure for importing ULO triplets into an efficient storage
-engine. A necessary building block for a larger tetrapodal search
-system.
+Despite many remaining open questions, \emph{ulo-storage} provides the
+necessary infrastructure for importing ULO triplets into an efficient
+storage engine. A necessary building block for a larger tetrapodal
+search system. In addition to the concrete implementation, the
+experiences we have made along the way should benefit future research
+towards a greater tetrapodal search system.
--
GitLab