We present a self stabilizing token circulation protocol on unidirectional anonymous rings This protocol does not required processor identi ers no distinguished processor i e all processors perform the same algorithm The algorithm can deal with any kind of schedulings even unfair ones Our protocol is a randomized self stabilizing meaning that starting from an arbitrary con guration in response ...

This study investigates the possibility to recover the voice strength, i.e. the sound level produced by the speaker, from the signal recorded. The dataset consists of a set of isolated vowels (720 tokens) recorded in a situation where two interlocutors interacted orally at a distance comprised between 0.40 and 6 meters, in a furnished room. For each token, voice strength is measured at the inte...

This paper deals with the dimensioning of token buckets. Two related problems are formulated and solved. The first is the token bucket allocation problem (TBAP) which is finding the cost-minimal token bucket for the transmission of a given VBR traffic stream, e.g. an MPEG movie, from the user's point of view. This problem has been treated in literature before but as we will show not completely....

Vaidya paper: A mutual exclusion algorithm for ad hoc mobile networks Recall, their network model, changing graph, with links coming and going at any time. Managed mutual exclusion using a token traveling through the changing network. Used Gafni-Bertsekas link reversal ideas to maintain a token-oriented DAG (rather than a destination-oriented DAG as in GB). A node that receives the token may lo...

In token-based distributed mutual exclusion algorithms a unique object (token) is used to grant the right to enter the critical section. For the movement of the token within the computer network, two possible methods can be considered: perpetual mobility of the token and token-asking method. This paper presents a distributed token-based algorithm scheduling mutually exclusive access to a critic...

Monkeys can learn the symbolic meaning of tokens, and exchange them to get a reward. Monkeys can also learn the symbolic value of a token by observing conspecifics but it is not clear if they can learn passively by observing other actors, e.g., humans. To answer this question, we tested two monkeys in a token exchange paradigm in three experiments. Monkeys learned token values through observati...

For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k indistinguishable tokens placed at distinct vertices of G, where two configurations are adjacent whenever...