Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings

We carry on investigating the line of research questioning the power of randomization for the design of distributed algorithms. In their seminal paper, Naor and Stockmeyer [STOC 1993] established that, in the context of network computing in which all nodes execute the same algorithm in parallel, any construction task that can be solved locally by a randomized Monte-Carlo algorithm can also be solved locally by a deterministic algorithm. This result, however, holds only for distributed tasks such that the correctness of their solutions can be locally checked by a deterministic algorithm. In this article, we extend the result of Naor and Stockmeyer to a wider class of tasks. Specifically, we prove that the same derandomization result holds for every task such that the correctness of their solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm.

Postquantum common-cause channels: the resource theory of local operations and shared entanglement

We define the type-independent resource theory of local operations and shared entanglement (LOSE). This allows us to formally quantify postquantumness in common-cause scenarios such as the Bell scenario. Any nonsignaling bipartite quantum channel which cannot be generated by LOSE operations requires a postquantum common cause to generate, and constitutes a valuable resource. Our framework allows LOSE operations that arbitrarily transform between different types of resources, which in turn allows us to undertake a systematic study of the different manifestations of postquantum common causes. Only three of these have been previously recognized, namely postquantum correlations, postquantum steering, and non-localizable channels, all of which are subsumed as special cases of resources in our framework. Finally, we prove several fundamental results regarding how the type of a resource determines what conversions into other resources are possible, and also places constraints on the resource's ability to provide an advantage in distributed tasks such as nonlocal games, semiquantum games, steering games, etc.

Decentralized Control for Swarm Robots That Can Effectively Execute Spatially Distributed Tasks

A swarm robotic system is a system in which multiple robots cooperate to fulfill a macroscopic function. Many swarm robots have been developed for various purposes. This study aims to design swarm robots capable of executing spatially distributed tasks effectively, which can be potentially used for tasks such as search-and-rescue operation and gathering scattered garbage in rooms. We propose a simple decentralized control scheme for swarm robots by extending our previously proposed non-reciprocal-interaction-based model. Each robot has an internal state, called its workload. Each robot first moves randomly to find a task, and when it does, its workload increases, and then it attracts its neighboring robots to ask for their help. We demonstrate, via simulations, that the proposed control scheme enables the robots to effectively execute multiple tasks in parallel under various environments. Fault tolerance of the proposed system is also demonstrated.

Begin at the Beginning: Revamping Collection Development Workflows

“Begin at the beginning,” the King said, very gravely, “and go on till you come to the end: then stop.” This paper describes how two librarians newer to the University of Tennessee Libraries refreshed collection development workflows at the Libraries after a reorganization. This reorganization distributed tasks across departments in a different manner due to the new departmental configurations. In this new matrix environment, more communication was required to achieve desired outcomes, but more buy-in was also needed from constituents such as the subject librarians. This paper describes how a new Collections Committee was formed to make decisions on high-dollar resources; what information was added to the traditional request form to facilitate the committee’s decisions; what information was asked of vendors at the point of trial or initial interest; and how this fed into a new collection development policy. By revamping the workflows to ask for more information up front, the presenters were able to help the new Collections Committee obtain all the information needed for decision-making at the point of decision. The authors share insights into how organizational changes can be used as an opportunity to instigate workflow changes that help libraries acquire resources more nimbly and flexibly.