We develop a dynamic model of platform economy where tokens serve as means payment among users and are issued to finance investment in productivity. Tokens optimally rewarded owners when token supply (normalized by productivity) is low burnt boost franchise value the normalized high. Although price determined liquid market, platform’s financial constraint generates an endogenous issuance cost t...

The present paper describes a MAC protocol for a high-speed ring with multiple tokens. The purpose of this protocol is to increase the throughput and to improve the delay-throughput characteristic of high-speed token-rings. The main concept of the new MAC protocol is to maintain several logical token-rings in the single physical ring. Each logical ring has its own token, and its operation is cl...

Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...

ion_map(BindMapDefn) --> bindings_map_definition(BindMapDefn). abstraction_map(Omd) --> other_map_definition(Omd). abstraction_map([]) --> []. property_s_list([Prop|PropL]) --> property_s(Prop), [token(’;’, misc)], property_s_list(PropL). property_s_list([Prop]) --> property_s(Prop), opt_semi. property_s_list([]) --> []. bindings_map_definition(bindings_map_definition(TypedId, BindL)) --> [toke...

A 3-layer back propagation network is used to implement a pattern association task which learns mappings that are analogous to the present and past tense forms of English verbs, i.e., arbitrary, identity, vowel change, and suffixation mappings. The degree of correspondence between connectionist models of tasks of this type (Rumelhart & McClelland, 1986; 1987) and children’s acquisition of infle...

A 3-layer back propagation network is used to implement a pattern association task which learns mappings that are analogous to the present and past tense forms of English verbs, i.e., arbitrary, identity, vowel change, and suffixation mappings. The degree of correspondence between connectionist models of tasks of this type (Rumelhart & McClelland, 1986; 1987) and children’s acquisition of infle...

In the Token Jumping problem we are given a graph $$G = (V,E)$$ and two independent sets S T of G, each size $$k \ge 1$$ . The goal is to determine whether there exists sequence k-sized in $$\langle S_0, S_1, \ldots , S_\ell \rangle$$ such that for every i, $$|S_i| k$$ $$S_i$$ an set, $$S S_0$$ $$S_\ell T$$ $$|S_i \varDelta S_{i+1}| 2$$ other words, if view set as collection tokens placed on su...

the overall aim of this paper is to highlight a transcendental usage of the religion of islamin the qur’an. i will show that the notion of islamas a unitary religion is used in the qur’an as a genus for religions (adyan) which have appeared throughout human history. this usage will show that there is a sense of religion which guarantees the essential unity of all religions and prepares us to un...

The token protocols in FDDI and FDDI-M support synchronous and asynchronous traffic. However, FDDI suffers from a token-lateness problem, and FDDI-M may starve asynchronous traffic. To remove these two weaknesses, we propose the timely-token protocol. The main feature of this protocol is the addition of information to the token so that each station may determine the reason of an early token arr...