5,591 research outputs found

    Development and Validation of the Colorado Learning Attitudes about Science Survey for Experimental Physics

    Full text link
    As part of a comprehensive effort to transform our undergraduate physics laboratories and evaluate the impacts of these efforts, we have developed the Colorado Learning Attitudes about Science Survey for Experimental Physics (E-CLASS). The E-CLASS assesses the changes in students' attitudes about a variety of scientific laboratory practices before and after a lab course and compares attitudes with perceptions of the course grading requirements and laboratory practices. The E-CLASS is designed to give researchers insight into students' attitudes and also to provide actionable evidence to instructors looking for feedback on their courses. We present the development, validation, and preliminary results from the initial implementation of the survey in three undergraduate physics lab courses.Comment: 8 pages, 4 figures, 1 table, submitted to 2012 PERC Proceeding

    No quantum advantage for nonlocal computation

    Full text link
    We investigate the problem of "nonlocal" computation, in which separated parties must compute a function with nonlocally encoded inputs and output, such that each party individually learns nothing, yet together they compute the correct function output. We show that the best that can be done classically is a trivial linear approximation. Surprisingly, we also show that quantum entanglement provides no advantage over the classical case. On the other hand, generalized (i.e. super-quantum) nonlocal correlations allow perfect nonlocal computation. This gives new insights into the nature of quantum nonlocality and its relationship to generalised nonlocal correlations.Comment: 4 page

    SAT Modulo Monotonic Theories

    Full text link
    We define the concept of a monotonic theory and show how to build efficient SMT (SAT Modulo Theory) solvers, including effective theory propagation and clause learning, for such theories. We present examples showing that monotonic theories arise from many common problems, e.g., graph properties such as reachability, shortest paths, connected components, minimum spanning tree, and max-flow/min-cut, and then demonstrate our framework by building SMT solvers for each of these theories. We apply these solvers to procedural content generation problems, demonstrating major speed-ups over state-of-the-art approaches based on SAT or Answer Set Programming, and easily solving several instances that were previously impractical to solve
    • …
    corecore