QR Codes in Education

QR codes, developed by a Japanese company, have been around for over fifteen years. With the advent of smart and Web capable mobile devices, we witness a steady growth of interesting commercial applications using QR codes. As the movement of using QR codes in education is still in its infancy, this paper serves to be one of the first comprehensive papers in journal publication to fully delineate (a) the user characteristics of QR codes, (b) the processes of making and reading QR codes, (c) the survey of commercial applications using QR codes, (d) the literature review of educational applications using QR codes, and (e) offer suggestions and implementations of QR codes in school education

Generation of graph-state streams

We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.Comment: Accepted for publication at PRA Rapid Communication

Democracy From Afar: States Show Progress on Military and Overseas Voting

Gives an overview of reforms in state laws to provide military and overseas voters enough time to vote, electronic transmission of unvoted ballots, elimination of notarization or witness requirements, and expanded use of federal write-in absentee ballots

Trajectory-Based Dynamic Map Labeling

In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem is NP-complete and W[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms. For the general case we present a practical ILP formulation with an experimental evaluation as well as approximation algorithms.Comment: 19 pages, 7 figures, extended version of a paper to appear at ISAAC 201