Monitoring distributed computations provides a practical way of learning about and coming to understand a class of applications that are becoming increasingly common. The beneets of distribution arise from processes cooperating together to achieve a common goal. Coordination among the processes is a fundamental ingredient for the cooperation to occur both correctly and eeciently. One common for...

Four pigeons responded on a two-component multiple token-reinforcement schedule, in which tokens were produced according to a random-interval 30-sec schedule and exchanged according to a variable-ratio 4 schedule in both components. To assess the effects of contingent token loss, tokens were removed after every second response (i.e., fixed-ratio 2 loss) in one of the components. Response rates ...

laws and have a correct physical description, " writes H. Pattee, at the State University of New York. But despite such statements there is no doubt the field has a lot of ground to cover to avoid inventing new and sometimes unnecessary words or using the same words to mean different things, and redescribing the familiar for no obvious reason. The Introduction to Biosemiotics is not an easy rea...

Platooning is both a challenging and rewarding application. Challenging since strict timing and reliability requirements are imposed by the distributed control system required to operate the platoon. Rewarding since considerable fuel reductions are possible. As platooning takes place in a vehicular ad hoc network, the use of IEEE 802.11p is close to mandatory. However, the 802.11p medium access...

1 Supported in part by a grant from the Texas Advanced Research Program. Abstract-The token protocols of FDDI and FDDI-M support both 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 on-time timed-token protocol. Its main feature is the addition of information to ...

The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of combinatorial and stochastic parts of media theory hold almost in identical form for cubical token systems, although some underlying concepts are quite different...

Recurrent Neural Networks can be trained to produce sequences of tokens given some input, as exemplified by recent results in machine translation and image captioning. The current approach to training them consists in maximizing the likelihood of each token in the sequence given the current (recurrent) state and the previous token. At inference, the unknown previous token is then replaced by a ...

A common problem when writing compilers for programming languages or little, domain-specific languages is that an input token may have several interpretations, depending on context. Solutions to this problem demand programmer intervention, obfuscate the language’s grammar, and may introduce subtle bugs. We present a technique which is simple and without the above drawbacks—allowing a token to s...