Synonymy between Token-Reflexive Expressions

Synonymy, at its most basic, is sameness of meaning. A token-reflexive expression is an expression whose meaning assigns a referent to its tokens by relating each particular token of that particular expression to its referent. In doing so, the formulation of its meaning mentions the particular expression whose meaning it is. This seems to entail that no two token-reflexive expressions are synonymous, which would constitute a strong objection against token-reflexive semantics. In this paper, I propose and defend a notion of synonymy for token-reflexive expressions that allows such expressions to be synonymous, while being a fairly conservative extension of the customary notion of synonymy

Self-Stabilizing Token Distribution with Constant-Space for Trees

Self-stabilizing and silent distributed algorithms for token distribution in rooted tree networks are given. Initially, each process of a graph holds at most l tokens. Our goal is to distribute the tokens in the whole network so that every process holds exactly k tokens. In the initial configuration, the total number of tokens in the network may not be equal to nk where n is the number of processes in the network. The root process is given the ability to create a new token or remove a token from the network. We aim to minimize the convergence time, the number of token moves, and the space complexity. A self-stabilizing token distribution algorithm that converges within O(n l) asynchronous rounds and needs Theta(nh epsilon) redundant (or unnecessary) token moves is given, where epsilon = min(k,l-k) and h is the height of the tree network. Two novel ideas to reduce the number of redundant token moves are presented. One reduces the number of redundant token moves to O(nh) without any additional costs while the other reduces the number of redundant token moves to O(n), but increases the convergence time to O(nh l). All algorithms given have constant memory at each process and each link register

SECURITY TOKEN SERVICE SYSTEM ADMINISTRATOR GUIDE

The Security Token Service (STS) is a partial implementation of the OASIS WS-Trust specification.It is a service that can be used for transforming an existing security token into another security token forma

Inscribed Matter Communication: Part I

We provide a fundamental treatment of the molecular communication channel wherein "inscribed matter" is transmitted across a spatial gap to provide reliable signaling between a sender and receiver. Inscribed matter is defined as an ensemble of "tokens" (molecules, objects, and so on) and is inspired, at least partially, by biological systems where groups of individually constructed discrete particles ranging from molecules through membrane-bound structures containing molecules to viruses and organisms are released by a source and travel to a target -- for example, morphogens or semiochemicals diffuse from one cell, tissue or organism diffuse to another. For identical tokens that are neither lost nor modified, we consider messages encoded using three candidate communication schemes: a) token timing (timed release), b) token payload (composition), and c) token timing plus payload. We provide capacity bounds for each scheme and discuss their relative utility. We find that under not unreasonable assumptions, megabit per second rates could be supported at femtoWatt transmitter powers. Since quantities such as token concentration or bin-counting are derivatives of token arrival timing, individual token timing undergirds all molecular communication techniques. Thus, our modeling and results about the physics of efficient token-based information transfer can inform investigations of diverse theoretical and practical problems in engineering and biology. This work, Part I, focuses on the information theoretic bounds on capacity. Part II develops some of the mathematical and information-theoretic ideas that support the bounds presented here.Comment: 20 pages, 6 figures, 1 Table in revision at IEEE Journal on Molecular, Biological and Multiscale Communicatio