User:Daniel/Sandbox: Difference between revisions

From MaRDI portal
test edit
Tag: Replaced
RCC-5
Line 1: Line 1:
This page is for test edits and unsorted notes.
This page is for test edits and unsorted notes.


*test
== Interwiki links to Wikidata ==
* [[:wikidata:Q192760|fundamental theorem of algebra (Q192760)]]
* [[:wikidata:Q670235|fundamental theorem of arithmetic (Q670235)]]
* [[:wikidata:Q1217677|fundamental theorem of calculus (Q1217677)]]
* [[:wikidata:Q2185349|fundamental theorem of Riemannian geometry (Q2185349)]]
* [[:wikidata:Q5508975|fundamental theorem of linear algebra (Q5508975)]]
* [[:wikidata:Q17015004|fundamental theorem of algebraic K-theory (Q17015004)]]
 
== Math videos ==
* [https://www.youtube.com/watch?v=OmJ-4B-mS-Y The Map of Mathematics]
* [https://www.youtube.com/watch?v=yxSM7_tn_N8 Data and Mathematics, or Mathematics and Data]
* [https://www.youtube.com/watch?v=FbqnaoU-3VI Why is algebra so hard?]
* [https://www.youtube.com/watch?v=q3T1T51cH3A Wikidata on Apache Jena and Fuseki]
 
== Math & biology ==
 
* RCC-5 classification
:[[:wikidata:Q114740027|Merging taxonomies under RCC-5 algebraic articulations (Q114740027)]]: "CLEANTAX uses the RCC-5 [Randell et al. 1992] topological algebra as the basis for representing articulations. This algebra describes relationships between sets, and supports the expression of incomplete knowledge when stating articulations. The RCC-5 algebra uses the same five basic relations (B5) as several biological taxonomic alignments and taxonomic reasoning systems [Berendsohn 2003; Koperski et al. 2000; Franz et al. 2007]. Given any two non-empty sets N and M, exactly one of the B5 relations holds (cf. Figure 5) between them: (i) congruence (N ≡ M), (ii) proper inclusion (N # M), (iii) proper inverse inclusion (N ! M), (iv) partial overlap (N ⊕ M), or (v) exclusion (disjointness) (N ! M)."

Revision as of 17:41, 18 October 2022

This page is for test edits and unsorted notes.

Interwiki links to Wikidata

Math videos

Math & biology

  • RCC-5 classification
Merging taxonomies under RCC-5 algebraic articulations (Q114740027): "CLEANTAX uses the RCC-5 [Randell et al. 1992] topological algebra as the basis for representing articulations. This algebra describes relationships between sets, and supports the expression of incomplete knowledge when stating articulations. The RCC-5 algebra uses the same five basic relations (B5) as several biological taxonomic alignments and taxonomic reasoning systems [Berendsohn 2003; Koperski et al. 2000; Franz et al. 2007]. Given any two non-empty sets N and M, exactly one of the B5 relations holds (cf. Figure 5) between them: (i) congruence (N ≡ M), (ii) proper inclusion (N # M), (iii) proper inverse inclusion (N ! M), (iv) partial overlap (N ⊕ M), or (v) exclusion (disjointness) (N ! M)."