E-Chord is a Distributed Hash Table algorithm (DHT) inspired from Chord, Pastry and CAN algorithms. It meant to provide a keyword-based search in the Three-Layer Mediation Architecture. The E-Chord is deployed in the middle layer (Integration Layer) of the architecture and provides services to the higher layer (Presence Layer) and the lower layer (Homogenization Layer).

Listeners judged whether two sequentially presented major chords were the same. When both chords were based on the same root, listeners discriminated between different chord positions, e.g., root position, first inversion, second inversion. The ability of listeners to discriminate between chord positions suggests that harmonic equivalence of different chord positions does not depend on perceptu...

This paper proposes a semantic-based P2P resource organization model R-Chord by incorporating the Resource Space Model (RSM), the P2P Semantic Link Network Model (P2PSLN) and the DHT Chord protocol. Peers provide services with each other according to the content of their resources and the related configuration information. It incorporates the classification semantics and the relational semantic...

In view of the result of Kontsevich, [5] now often called “the fundamental theorem of Vassiliev theory”, identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear span of chord diagrams modulo the “4T-relation” (and in the unframed case, originally considered in [7], [5], and [1], the “1T-” or “isolated chord relati...

Tonal melody can imply vertical harmony through a sequence of tones. Current methods for automatic chord estimation commonly use chroma-based features extracted from audio signals. However, the implied harmony of unaccompanied melodies can be difficult to estimate on the basis of chroma content in the presence of frequent nonchord tones. Here we present a novel approach to automatic chord estim...

This paper presents probabilistic n-gram models for symbolic chord sequences. To overcome the fundamental limitations in conventional models—that the model optimality is not guaranteed, that the value of n is fixed uniquely, and that a vocabulary of chord types (e.g., major, minor, · · · ) is defined in an arbitrary way—we propose a vocabulary-free infinity-gram model based on Bayesian nonparam...

This paper presents a method that identifies musical chords in polyphonic musical signals. As musical chords mainly represent the harmony of music and are related to other musical elements such as melody and rhythm, the performance of chord recognition should improve if this interrelationship is taken into consideration. Nevertheless, this interrelationship has not been utilized in the literatu...

Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of O(logN) in networks of N nodes. While the routing performance has bee...

precepts and example of John Hunter, and traced the nervous system in its gradations, step by step, from the lower to the higher classes of the animal kingdom, we should have been spared those long discussions to disprove that the spinal chord is made up of an assemblage of nerve tubes, which pass in an unbroken line from the periphery to the brain; or those figurative expressions, so productiv...

We present a new approach to evaluate chord recognition systems on songs which do not have full annotations. The principle is to use online chord databases to generate high accurate “pseudo annotations” for these songs and compute “pseudo accuracies” of test systems. Statistical models that model the relationship between “pseudo accuracy” and real performance are then applied to estimate test s...