143 research outputs found

    Communications technology satellite: United States experiments and disaster communications applications

    Get PDF
    Ground antennas from 0.6 to 5.0 meters in diameter were used as remote earth terminals by the United States for both wideband (television) and narrowband (voice, data) communication in conjunction with the Canadian Hermes satellite's high power transmitter. Experiments summarized cover teleconferencing and duplex videoconferencing for medical, educational, and civic purposes, as well as the remote interpretation of multilingual broadcasts from the United Nations. The capabilities of the system during real and simulated disasters at airports are assessed. Particular attention is given to miniexperiments for flood control in the Mississippi River basin and in Johnstown, Pennsylvania during the 1977 flood

    Description of the SERT 2 spacecraft and mission

    Get PDF
    Performance and orbital flight plan of SERT 2 ion thruster spacecraf

    Least-squares multirate FIR filters

    Full text link

    The Effect of Planarization on Width

    Full text link
    We study the effects of planarization (the construction of a planar diagram DD from a non-planar graph GG by replacing each crossing by a new vertex) on graph width parameters. We show that for treewidth, pathwidth, branchwidth, clique-width, and tree-depth there exists a family of nn-vertex graphs with bounded parameter value, all of whose planarizations have parameter value Ω(n)\Omega(n). However, for bandwidth, cutwidth, and carving width, every graph with bounded parameter value has a planarization of linear size whose parameter value remains bounded. The same is true for the treewidth, pathwidth, and branchwidth of graphs of bounded degree.Comment: 15 pages, 6 figures. To appear at the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

    Parameterized Edge Hamiltonicity

    Full text link
    We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke

    A New MHD Code with Adaptive Mesh Refinement and Parallelization for Astrophysics

    Full text link
    A new code, named MAP, is written in Fortran language for magnetohydrodynamics (MHD) calculation with the adaptive mesh refinement (AMR) and Message Passing Interface (MPI) parallelization. There are several optional numerical schemes for computing the MHD part, namely, modified Mac Cormack Scheme (MMC), Lax-Friedrichs scheme (LF) and weighted essentially non-oscillatory (WENO) scheme. All of them are second order, two-step, component-wise schemes for hyperbolic conservative equations. The total variation diminishing (TVD) limiters and approximate Riemann solvers are also equipped. A high resolution can be achieved by the hierarchical block-structured AMR mesh. We use the extended generalized Lagrange multiplier (EGLM) MHD equations to reduce the non-divergence free error produced by the scheme in the magnetic induction equation. The numerical algorithms for the non-ideal terms, e.g., the resistivity and the thermal conduction, are also equipped in the MAP code. The details of the AMR and MPI algorithms are described in the paper.Comment: 44 pages, 16 figure

    Compact Labelings For Efficient First-Order Model-Checking

    Get PDF
    We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is \emph{nicely locally cwd-decomposable}. This notion generalizes that of a \emph{nicely locally tree-decomposable} class. The graphs of such classes can be covered by graphs of bounded \emph{clique-width} with limited overlaps. We also consider such labelings for \emph{bounded} first-order formulas on graph classes of \emph{bounded expansion}. Some of these results are extended to counting queries
    • …
    corecore