Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
schaertl_andreas
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
supervision
schaertl_andreas
Commits
4db5a30e
Commit
4db5a30e
authored
Oct 5, 2020
by
Andreas Schärtl
Browse files
Options
Downloads
Patches
Plain Diff
review q3
parent
2f399560
No related branches found
No related tags found
No related merge requests found
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
doc/report/applications.tex
+19
-19
19 additions, 19 deletions
doc/report/applications.tex
with
19 additions
and
19 deletions
doc/report/applications.tex
+
19
−
19
View file @
4db5a30e
...
...
@@ -291,9 +291,9 @@ solve algorithmic problems.
\subsubsection
{
Contributors and Number of References
}
Finally, query~
$
\mathcal
{
Q
}_
3
$
from literature
~
\cite
{
tetra
}
wants to
Finally, query~
$
\mathcal
{
Q
}_
3
$
from literature wants to
know ``
\emph
{
[a]ll areas of math that
{
Nicolas G.
\
de Bruijn
}
has
worked in and his main contributions
.
}
''
$
\mathcal
{
Q
}_
3
$
~is asking
worked in and his main contributions
}
''
~
\cite
{
tetra
}
.
$
\mathcal
{
Q
}_
3
$
~is asking
for works of a given author~
$
A
$
. It also asks for their main
contributions, for example which particularly interesting paragraphs
or code~
$
A
$
has authored. We picked this particular query as it
...
...
@@ -301,19 +301,18 @@ is asking for metadata, something that should be easily serviced by
organizational knowledge.
\noindent\emph
{
Organizational Aspect.
}
ULO has no concept of authors,
contributors, dates and so on. Rather, the idea is to take
advantage of the Dublin Core project which provides an ontology
for such metadata~
\cite
{
dcreport, dcowl
}
. For example, Dublin Core
provides us with the
\texttt
{
dcterms:creator
}
and
\texttt
{
dcterms:contributor
}
predicates. Servicing~
$
\mathcal
{
Q
}_
3
$
requires us to look for creator~
$
A
$
and then list all associated
objects that they have worked on. Of course this
requires above authorship predicates to actually be in use. With
the Isabelle and Coq exports this was hardly the case; running
some experiments we found less than 15 unique contributors and
creators, raising suspicion that metadata is missing in the
original library files. Regardless, in theory ULO allows us to
query for objects ordered by authors.
contributors, dates and so on. Rather, the idea is to take advantage
of the Dublin Core project which provides an ontology for such
metadata~
\cite
{
dcreport, dcowl
}
. For example, Dublin Core provides us
with the
\texttt
{
dcterms:creator
}
and
\texttt
{
dcterms:contributor
}
predicates. Servicing~
$
\mathcal
{
Q
}_
3
$
requires us to look for
creator~
$
A
$
and then list all associated objects that they have worked
on. Of course this requires above authorship predicates to actually be
in use. With the Isabelle and Coq exports this was hardly the case;
running some experiments we found less than 15 unique contributors and
creators, raising suspicion that metadata is missing in the original
library files. Regardless, existing ULO exports allow us to query for
objects ordered by authors.
\input
{
applications-q3.tex
}
...
...
@@ -324,11 +323,12 @@ of~$A$, that is those works that~$A$ authored that are the most
important. Sorting the result by number of references might be a good
start. To get the main contributions, we rate each individual work by
its number of
\texttt
{
ulo:uses
}
references. Extending the previous
{
SPARQL
}
, we can
query
the database for a ordered list of works,
{
SPARQL
}
query
, we can
ask
the database for a
n
ordered list of works,
starting with the one that has the most
references~(Figure~
\ref
{
fig:q2b
}
). We can formulate~
$
\mathcal
{
Q
}_
3
$
with just one SPARQL query. Because everything is handled by the
database, access should be about as quick as we can hope it to be.
references~(Figure~
\ref
{
fig:q2b
}
). We see that one can
formulate~
$
\mathcal
{
Q
}_
3
$
with just one SPARQL 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
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment