Cyptographic tokens are one of the cornerstones new blockchain world but knowledge about these digital objects is still limited. In this research, we argue that crypto tokens, cryptographically secured connected to DLT systems, form socio-technical systems through their reciprocal relationship with foundational systems. We also today’s token evolved out earlier physical and a transition facilit...

U-Prove is a credential system that allows users to disclose information about themselves in a minimalistic way. Roughly speaking, in the U-Prove system a user obtains certified cryptographic tokens containing a set of attributes and is able to disclose a subset of his attributes to a verifier, while hiding the undisclosed attributes. In U-prove the actual identity of a token holder is hidden f...

Token reinforcement procedures and concepts are reviewed and discussed in relation to general principles of behavior. The paper is divided into four main parts. Part I reviews and discusses previous research on token systems in relation to common behavioral functions--reinforcement, temporal organization, antecedent stimulus functions, and aversive control--emphasizing both the continuities wit...

The potential role of physical correlates of articulatory variability in vowel production was studied by means of EMMA and EPG. In accordance with Perkell & Nelson (1985), the hypothesis to be tested is that the amount and shape of token-totoken variability is influenced by the amount of palatal contact in such a way that high vowels exhibit different variability patterns than the other vowels....

The aim of this article is to discuss some applications of random processes in searching and reaching consensus on finite graphs. The topics covered are: Why random walks?, Speeding up random walks, Random and deterministic walks, Interacting particles and voting, Searching changing graphs. As an introductory example consider the self-stabilizing mutual exclusion algorithm of Israeli and Jalfon...

We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model the problem is NP-complete. For the token sliding model, we show that the problem remains PSPACE-complete.

1.1 Token frequency For completeness, this section demonstrates that relying on token frequency instead of type frequency does not provide a way out for the lexicalist hypothesis. Figure 7 shows the association between accuracy and tokenfrequency measures, analogous to the figures above for the type-frequency measures. The results are similar, albeit less promising: token segmental bigram frequ...

Code obfuscation is one of the most powerful concepts in cryptography. It could yield functional encryption, digital rights management, and maybe even secure cloud computing. However, general code obfuscation has been proven impossible and the research then focused on obfuscating very specific functions, studying weaker security definitions for obfuscation, and using tamper-proof hardware token...