We study the buuer requirements for N identical token bucket streams that are fed to a multiplexor. If the token bucket streams are synchronized the buuer size requirement at the multiplexor is N B, where B is the size of the token bucket. We introduce a new variant of token bucket schemes that we call randomized token bucket schemes that insert random delays to prevent the streams from becomin...

This paper describes an in-home digital network architecture that supports both realtime and non-real-time communication. The architecture deploys a distributed token mechanism to schedule communication streams and to offer guaranteed quality-ofservice. Essentially, the token mechanism prevents collisions to occur in the network, thus making the network deterministic. The distributed token sche...

Abstract Causal Bayes nets (CBNs) provide one of the most powerful tools for modelling coarse-grained type-level causal structure. As in other fields (e.g., thermodynamics) question arises how such characterizations are related to characterization their underlying structure (in this case: token-level relations). Answering meets what is called a “coherence-requirement” reduction debate. It provi...

We present models for embedding words in the context of surrounding words. Such models, which we refer to as token embeddings, represent the characteristics of a word that are specific to a given context, such as word sense, syntactic category, and semantic role. We explore simple, efficient token embedding models based on standard neural network architectures. We learn token embeddings on a la...

A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...

We analyze in this paper the stability of two types of timed-token rings: the existing Fiber Distributed Data Interface (FDDI) token ring protocol, and a new variant of the FDDI that we propose. The FDDI supports two classes of traac: synchronous and asynchronous. The time constraint mechanism of FDDI guarantees the transmission delay of synchronous traac: a Target Token Rotation Time (TTRT) be...

How is the outcome of the categorization process represented? This question has gone virtually unaddressed. A notable exception is Barsalou (2012) which proposes that categorization results in a type–token predication, whereby the type representation (e.g. DOG) is predicated of the token representation of the categorized individual (e.g. Fido). Another is Jackendoff (1983) which proposes that c...

This paper presents a simulation study of diierent token generation policies for a leaky bucket traac shaper. In particular, the paper addresses the following question: Can the performance of a leaky bucket traac shaper be improved by matching the token generation policy to the characteristics of the input traac? Three diierent token generation policies are considered: Deterministic, Bernoulli,...

In this paper, we describe a new token based h-out of-k mutual exclusion solution for mobile ad hoc networks. This protocol does neither use the routing layer nor a logical structure and agrees requests based on their distances away to the token, their olds, and there resources number. A request is sent on the routes of the nodes for which a request is present in the local queue, with a dynamic...

Implementing a mobile One-time Password (OTP) Token on a cellular phone is a hot topic since the past few years. The proposed solutions had made certain improvements on network security. But none of them can fully prevent the OTP seed (K) tracing from MIMT OTP code interception or Shoulder-surfing security attacks while also meet the following criteria – fully compliant with existing authentica...