Sliding Token is a natural reconfiguration problem in which vertices of independent sets are iteratively replaced by neighbors. We develop techniques that may be useful in answering the conjecture that Sliding Token is polynomial-time decidable on bipartite graphs. Along the way, we give efficient algorithms for Sliding Token on bipartite permutation and bipartite distance-hereditary graphs.

This Thesis is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. Recommended Citation Lillig Cotter, Kay Delores, "A Functional Analysis of the Effects of a Token Economy Program on Attending Behavior in Children and Subsequent Test Perform...

We developed courseware for teaching reactive tokens. Reactive tokens are audio or visual signals that structure discourse, and are sent by discourse participants who do not have the floor to those who do. Cultures with much in common sometimes differ markedly in their reactive tokens. Nonnative language learners need to learn how to interpret and convey reactive tokens in order to be perceived...

In a national research project we assessed gender-related communicative patterns in 20 teams from diverse organizations. The sub-sample for this study consisted of two teams with one gender token each: a female token in an industrial team of eleven persons and a male token in a kindergarten team of eight persons. We focused on dominance and support-related behaviour in verbal and nonverbal comm...

Given two independent sets I, J of a graph G, and imagine that a token (coin) is placed at each vertex of I. The Sliding Token problem asks if one could transform I to J via a sequence of elementary steps, where each step requires sliding a token from one vertex to one of its neighbors so that the resulting set of vertices where tokens are placed remains independent. This problem is PSPACE-comp...

We present a design for a Wi-Fi user-authentication token that tunnels data through the SSID field, packet timing, and packet length. Previous attempts to build an online-banking transaction-signing token have been only moderately successful, due in large part to usability problems. Average consumers, especially in the United States, are simply unwilling to transcribe strings of digits from PC ...

The coherence protocol is a first-order design concern in multicore designs. Directory protocols are naturally scalable, as they place no restrictions on the interconnect and have minimal bandwidth requirements; however, this scalability comes at the cost of increased sharing latency due to indirection. In contrast, broadcast-based systems such as snooping protocols and token coherence reduce l...

By run-time characteristic analysis of parallel workloads, we found that a majority of shared data accesses of parallel workload has temporal locality. Based on this characteristic, we present a sharing relation cache (SRC for short) based CMP architecture, saving recently used sharing relations to provide destination set information for following cache-to-cache miss requests. Token-SRC protoco...

A mutual distributed algorithm on a token ring is proposed in this paper. The proposed algorithm is based on the token ring approach and allows simultaneous existence of several tokens in the logical ring of the network. Each process generates a unique token and sends it as request to enter the critical section that travels along the ring. The process can only enter the critical section if it g...

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