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
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
supervision
schaertl_andreas
Commits
26086bb4
Commit
26086bb4
authored
4 years ago
by
Andreas Schärtl
Browse files
Options
Downloads
Patches
Plain Diff
report: [x] implement Q3
parent
59598bd6
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
+77
-73
77 additions, 73 deletions
doc/report/applications.tex
with
77 additions
and
73 deletions
doc/report/applications.tex
+
77
−
73
View file @
26086bb4
...
...
@@ -114,23 +114,27 @@ proof of concept implementations.
think of another ontology for algorithms. We leave this for later
discussion.
\item
\textbf
{$
\mathcal
{
Q
}_{
3
}$
``Find integer sequences whose generating
function is a rational polynomial in
$
\sin
(
x
)
$
that has a Maple
implementation not not affected by the bug in module~
$
x
$
.''
}
We
see that this query is about finding specific instances, integer
sequences, with some property.
This is a case where information would be split between many
sources. The name of the sequences is part of the organizational
data set, the generating function is part of symbolic knowledge,
the Maple implementation could be part of concrete knowledge.
Handling this query would probably start by filtering for all
integer sequences. It is not clear how this should be achieved with
ULO/RDF as it contains no unified concept of a sequence. It might
be possible to take advantage of
\texttt
{
aligned-with
}
or some
similar concept to find all such sequences. If this succeeds, an
ULO index can provide the first step in servicing this query.
\item
\textbf
{$
\mathcal
{
Q
}_
3
$
``Find integer sequences whose
generating function is a rational polynomial in
$
\sin
(
x
)
$
that has
a Maple implementation not not affected by the bug in
module~
$
x
$
.''
}
We see that this query is about finding specific
instances, integer sequences, with some property. This is a case
where information would be split between many sources. The name
of the sequences is part of the organizational data set, the
generating function is part of symbolic knowledge, the Maple
implementation could be part of concrete knowledge.
\textbf
{
Organizational Aspect
}
Handling this query would probably
start by filtering for all integer sequences. It is not clear how
this should be achieved with ULO/RDF as it contains no unified
concept of a sequence. It might be possible to take advantage
of
\texttt
{
aligned-with
}
or some similar concept to find all such
sequences. If this succeeds, an ULO index can provide the first
step in servicing this query. Here we are in a similar situation
as with~
$
\mathcal
{
Q
}_
2
$
. It is not clear whether we should
represent the idea behind ``integer sequences'' as a native
component of ULO or as something building on top of what ULO
provides.
As for the next steps, finding concrete algorithms and in
particular looking inside of them is not organizational data and
...
...
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