274 research outputs found

    Introduction

    Full text link

    Zur historischen Epistemologie des Raumes

    Full text link

    IMPLEMENTATION OF A QUASI-OPTICAL FREE-SPACE S-PARAMETERS MEASUREMENT SYSTEM

    Get PDF
    A quasi-optical (QO) free-space test bench, based on two dual reflector Compact Test Range (CTR) systems, has been developed to characterise the RF properties of materials and QO components used in mm-wave astronomical instrumentation. While this facility has been designed to operate for several spectral bandwidths, in the first instance measurements have been performed in the W-band (75-110 GHz). We present the modelled and measured performance of the test bench and the procedure for calibrating and measuring samples under test. First measured results of the field across a 10 cm quiet zone indicate a maximum intensity variation of -4.5 dB and a maximum phase variation of 7°. Measurements of the cross-polarisation indicate higher levels than were predicted. A free-space calibration method has been developed based on the use of 3 calibration standards (Thru-Reflect-Line). Initial measurements of the reflectivity and transmittance for a range of materials have been performed, allowing the deduction of the refractive index

    If you care about social equality, you want a big state: Home, work, care and social egalitarianism

    Get PDF
    Justified scepticism about distant bureaucracies and transactional politics mutated into a wholesale retreat from the state on the left – but to create a just and egalitarian society, say Emily McTernan, Martin O'Neill, Christian Schemmel and Fabian Schuppert, we need a powerful, democratic ‘big state’

    Symbolic Partial-Order Execution for Testing Multi-Threaded Programs

    Full text link
    We describe a technique for systematic testing of multi-threaded programs. We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosion due to interleaving non-determinism, with symbolic execution to handle data non-determinism. Our technique iteratively and exhaustively finds all executions of the program. It represents program executions using partial orders and finds the next execution using an underlying unfolding semantics. We avoid the exploration of redundant program traces using cutoff events. We implemented our technique as an extension of KLEE and evaluated it on a set of large multi-threaded C programs. Our experiments found several previously undiscovered bugs and undefined behaviors in memcached and GNU sort, showing that the new method is capable of finding bugs in industrial-size benchmarks.Comment: Extended version of a paper presented at CAV'2
    corecore