The $k$-token graph $T_k(G)$ is the whose vertices are $k$-subsets of a $G$, with two adjacent if their symmetric difference an edge $G$. We explore when well-covered graph, that is, all its maximal independent sets have same cardinality. For bipartite graphs we classify well-covered. arbitrary show $T_2(G)$ well-covered, then girth $G$ at most four. include upper and lower bounds on independen...

The Institute of Electrical and Electronic Engineers 802.5 (1) standard has become a widely accepted protocol for token ring local area networks (LANs). A major part of its success is the advantages it offers over other network architectures. These advantages include its reliability and simplicity of hardware interfacing the transmission medium to the stations’ electronics. Because each station...

Introduction The Token Economy Advantages of Token Economies Problems of Token Economies Management/Control Goals Disruptive Behavior Ward Care Behavior Self-care Behavior Therapeutic/Educative Goals Verbal Behaviors Social Behaviors Implementation of the Token Economy Staff Training Backup Reinforcers Social Reinforcement Economic Balance and Savings Intermittant Reinforcement Su~ary and Concl...

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

There has been an increasing need of timely and predictable communication services for embedded real-time systems in automated factories and industrial process controls. Work has been done on real-time communication with deadline guarantees in point-to-point, token bus/token ring/FDDI, and DQDB (Distributed Queue Dual Bus) networks. However, due to the random access nature of the CSMA/CD type m...

This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...

Variability in the speech production patterns of children with developmental apraxia of speech (DAS) was investigated in a three-year longitudinal study of three children with DAS. A metric was developed to measure token-to-token variability in repeated word productions from connected speech samples. Results suggest that high levels of total token and error token variability and low levels of w...

Consider a connected graph with nodes (or processes) and edges (or communication links). An edge token associated with an edge is a token maintained by the two nodes connected by the edge; one and only one of the two nodes holds the token. An edge token can be passed from one node to the other if so desired. This paper first presents a randomized self-stabilizing algorithm to implement the edge...