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....

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.

Bayesian modelling and statistical text analysis rely on informed probability priors to encourage good solutions. This paper empirically analyses whether in medical discharge reports follow Zipf’s law, a commonly assumed property of language where word frequency follows discrete power-law distribution. We examined 20,000 from the MIMIC-III dataset. Methods included splitting into tokens, counti...

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...