1,429 research outputs found

    Tracking and data system support for the Viking 1975 mission to Mars. Volume 1: Prelaunch planning, implementation, and testing

    Get PDF
    The tracking and data acquisition support for the 1975 Viking Missions to Mars is described. The history of the effort from its inception in late 1968 through the launches of Vikings 1 and 2 from Cape Kennedy in August and September 1975 is given. The Viking mission requirements for tracking and data acquisition support in both the near earth and deep space phases involved multiple radar tracking and telemetry stations, and communications networks together with the global network of tracking stations, communications, and control center. The planning, implementation, testing and management of the program are presented

    Field-Programmable-Gate-Array Based Signal Discrimination and Time Digitisation

    Get PDF

    FPGA based multi-channel TDC development

    Get PDF

    Tracking and data system support for the Viking 1975 mission to Mars. Volume 2: Launch through landing of Viking 1

    Get PDF
    Problems inherent in the deployment and management of a worldwide tracking and data acquisition network to support the two Viking Orbiters and two Viking Landers simultaneously over 320 million kilometers (200 million miles) of deep space are discussed. Activities described include tracking coverage of the launch phase, the deep space operations during the long cruise phase that occupied approximately 11 months, and the implementation of the a vast worldwide network of tracking sttions and global communications systems. The performance of the personnel, hardware, and software involved in this vast undertaking are evaluated

    A Systematic Review of the Critical Factors for Success of Mobile Learning in Higher Education (University Students\u27 Perspective)

    Get PDF
    The phenomenon of the use of a mobile learning (m-Learning) platform in educational institutions is slowly gaining momentum. However, the enthusiasm with which mobile phones have been welcomed into every aspect of our lives is not yet apparent in the educational sector. To understand the reason, it is important to understand user expectations of the system. This article documents a systematic review of existing studies to find the success factors for effective m-Learning. Our systematic review collates results from 30 studies conducted in 17 countries, where 13 critical success factors were found to strongly impact m-Learning implementation. Using these results within the framework of the diffusion of innovation model for innovation adoption and the critical success factors together help us see what aspects of the innovation decision process are the likely causes of the reduced take-up of m-Learning by university students

    Further Development of Lattice-FPGA based TDC and Its Implementation on different Platforms

    Get PDF

    Integration of the Pion-Beam Tracker into the HADES DAQ

    Get PDF

    Performances of multi-gap timing RPCs for relativistic ions in the range Z=1-6

    Full text link
    We present the performance of Multi-gap timing RPCs under irradiation by fully stripped relativistic ions (gamma*beta=2.7, Z=1-6). A time resolution of 80 ps at high efficiency has been obtained by just using standard `off the shelf' 4-gap timing RPCs from the new HADES ToF wall. The resolution worsened to 100 ps for ~ 1 kHz/cm2 proton flux and for ~ 100 Hz/cm2 Carbon flux. The chambers were operated at a standard field of E=100 kV/cm and showed a high stability during the experiment, supporting the fact that RPCs are a convenient choice when accommodating a very broad range of ionizing particles is needed. The data provides insight in the region of very highly ionizing particles (up to x 36 mips) and can be used to constrain the existing avalanche and Space-Charge models far from the usual `mip valley'. The implications of these results for the general case of detection based on secondary processes (n, gamma) resulting in highly ionizing particles with characteristic energy distributions will be discussed, together with the nature of the time-charge correlation curve.Comment: 31 pages, 19 figures, submitted to JINS

    Lower Bounds for the Graph Homomorphism Problem

    Full text link
    The graph homomorphism problem (HOM) asks whether the vertices of a given nn-vertex graph GG can be mapped to the vertices of a given hh-vertex graph HH such that each edge of GG is mapped to an edge of HH. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the 22-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound 2Ω(nloghloglogh)2^{\Omega\left( \frac{n \log h}{\log \log h}\right)}. This rules out the existence of a single-exponential algorithm and shows that the trivial upper bound 2O(nlogh)2^{{\mathcal O}(n\log{h})} is almost asymptotically tight. We also investigate what properties of graphs GG and HH make it difficult to solve HOM(G,H)(G,H). An easy observation is that an O(hn){\mathcal O}(h^n) upper bound can be improved to O(hvc(G)){\mathcal O}(h^{\operatorname{vc}(G)}) where vc(G)\operatorname{vc}(G) is the minimum size of a vertex cover of GG. The second lower bound hΩ(vc(G))h^{\Omega(\operatorname{vc}(G))} shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph HH, it is known that HOM(G,H)(G,H) can be solved in time (f(Δ(H)))n(f(\Delta(H)))^n and (f(tw(H)))n(f(\operatorname{tw}(H)))^n where Δ(H)\Delta(H) is the maximum degree of HH and tw(H)\operatorname{tw}(H) is the treewidth of HH. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number χ(H)\chi(H) does not exceed tw(H)\operatorname{tw}(H) and Δ(H)+1\Delta(H)+1, it is natural to ask whether similar upper bounds with respect to χ(H)\chi(H) can be obtained. We provide a negative answer to this question by establishing a lower bound (f(χ(H)))n(f(\chi(H)))^n for any function ff. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page

    Acridine functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C–N cross-coupling

    Get PDF
    Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region the COFs were applied as photocatalysts in metallaphotocatalytic C–N cross coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalysed the organic transformation in presence of green light as energy source
    corecore