Härpfer's Extended Indispensability Algorithm in Z
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915291238236160 |
|---|---|
| author | Lepper, Markus Härpfer, Bernd Widemann, Baltasar Trancón y |
| author_facet | Lepper, Markus Härpfer, Bernd Widemann, Baltasar Trancón y |
| contents | Since 1978, Clarence Barlow developed the ``Indispensability Function''. It operates on a metric tree that is bound to the same prime number of branches for all subtrees of each particular level. It assigns to all leaf postions of this tree a numeric value which indicates how important the acoustic presence of an event at this position is for the meter to be recognized as such.
Bernd Härpfer extended this concept in 2015 to deal with meters which have arbitrary groupings into two or three at any position of the tree hierarchy. This is called ``Extended Indispensability Algorithm''.
This article gives a specification of the Extended Algorithm in a slightly extended version of the Z specification language, and a possible generalization to arbitrary metric trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_07966 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Härpfer's Extended Indispensability Algorithm in Z Lepper, Markus Härpfer, Bernd Widemann, Baltasar Trancón y Programming Languages Since 1978, Clarence Barlow developed the ``Indispensability Function''. It operates on a metric tree that is bound to the same prime number of branches for all subtrees of each particular level. It assigns to all leaf postions of this tree a numeric value which indicates how important the acoustic presence of an event at this position is for the meter to be recognized as such. Bernd Härpfer extended this concept in 2015 to deal with meters which have arbitrary groupings into two or three at any position of the tree hierarchy. This is called ``Extended Indispensability Algorithm''. This article gives a specification of the Extended Algorithm in a slightly extended version of the Z specification language, and a possible generalization to arbitrary metric trees. |
| title | Härpfer's Extended Indispensability Algorithm in Z |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2502.07966 |