1,375 research outputs found

    Ion microprobe mass spectrometer for analyzing fluid materials Patent

    Get PDF
    Ion microprobe mass spectrometer with cooled electrode target for analyzing traces of fluid

    Device for measuring light scattering wherein the measuring beam is successively reflected between a pair of parallel reflectors Patent

    Get PDF
    Coherent light beam device and method for measuring gas density in vacuum chamber

    Leak detector wherein a probe is monitored with ultraviolet radiation Patent

    Get PDF
    Gas leak detection in evacuated systems using ultraviolet radiation prob

    Measurement of upper atmosphere helium profile Final report

    Get PDF
    Mass spectrometer for measuring helium and hydrogen profiles in upper atmosphere, to be used with Javelin sounding rocke

    Instantaneous monitoring of multicomponent expired gases

    Get PDF
    Expired air analyzers with time-of-flight and magnetic deflection mass spectrometers for spacecraft us

    Sorption vacuum trap

    Get PDF
    Modified sorption trap for use in high vacuum systems contains provisions for online regeneration of sorbent material. Trap is so constructed that it has a number of encapsulated resistance heaters and a valving and pumping device for removing gases from heated sorbing material. Excessive downtime is eliminated with this trap

    Field ionization electrodes Patent

    Get PDF
    Electrodes having array of small surfaces for field ionizatio

    Ionospheric simulator survey

    Get PDF
    Evaluation of D and E region ionospheric simulation technique

    Descriptive Complexity of Deterministic Polylogarithmic Time and Space

    Full text link
    We propose logical characterizations of problems solvable in deterministic polylogarithmic time (PolylogTime) and polylogarithmic space (PolylogSpace). We introduce a novel two-sorted logic that separates the elements of the input domain from the bit positions needed to address these elements. We prove that the inflationary and partial fixed point vartiants of this logic capture PolylogTime and PolylogSpace, respectively. In the course of proving that our logic indeed captures PolylogTime on finite ordered structures, we introduce a variant of random-access Turing machines that can access the relations and functions of a structure directly. We investigate whether an explicit predicate for the ordering of the domain is needed in our PolylogTime logic. Finally, we present the open problem of finding an exact characterization of order-invariant queries in PolylogTime.Comment: Submitted to the Journal of Computer and System Science
    • …
    corecore