Telecommunications and data acquisition systems support for Voyager missions to Jupiter and Saturn, 1972-1981, prelaunch through Saturn encounter

The Deep Space Network has supported the Voyager Project for approximately nine years, during which time implementation, testing, and operational support was provided. Four years of this time involved testing prior to launch; the final five years included network operations support and additional network implementation. Intensive and critical support intervals included launch and four planetary encounters. The telecommunications and data acquisition support for the Voyager Missions to Jupiter and Saturn are summarized

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

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

Winners and Losers: Formula versus Competitive Funding of Agricultural Research

Research and Development/Tech Change/Emerging Technologies, O3, O4, Q16,

Effect of baryon density on parton production, chemical equilibration and thermal photon emission from quark gluon plasma

The effect of baryon density on parton production processes of $gg\rightleftharpoons ggg$ and $gg\rightleftharpoons q{\bar q}$ is studied using full phase space distribution function and also with inclusion of quantum statistics i.e. Pauli blocking and Bose enhancement factors, in the case of both saturated and unsaturated quark gluon plasma. The rate for the process $gg \rightleftharpoons q{\bar q}$ is found to be much less as compared to the most commonly used factorized result obtained on the basis of classical approximation. This discrepancy, which is found both at zero as well as at finite baryon densities, however, is not due to the lack of quantum statistics in the classical approximation, rather due to the use of Fermi-Dirac and Bose-Einstein distribution functions for partons instead of Boltzmann distribution which is appropriate under such approximation. Interestingly, the rates of parton production are found to be insensitive to the baryo-chemical potential particularly when the plasma is unsaturated although the process of chemical equilibration strongly depends on it. The thermal photon yields, have been calculated specifically from unsaturated plasma at finite baryon density. The exact results obtained numerically are found to be in close agreement with the analytic expression derived using factorized distribution functions appropriate for unsaturated plasma. Further, it is shown that in the case of unsaturated plasma, the thermal photon production is enhanced with increasing baryon density both at fixed temperature and fixed energy density of the quark gluon plasma.Comment: Latex, 24 pages, 6 postscript figures. Submitted to Phys. Rev.

In-medium Yang-Mills equations: a derivation and canonical quantization

The equations for Yang-Mills field in a medium are derived in a linear approximation with respect to the gauge coupling parameter and the external field. The obtained equations closely resemble the macroscopic Maxwell equations. A canonical quantization is performed for a family of Fermi-like gauges in the case of constant and diagonal (in the group indices) tensors of electric permittivity and magnetic permeability. The physical subspace is defined and the gauge field propagator is evaluated for a particular choice of the gauge. The propagator is applied for evaluation of the cross-section of ellastic quark scattering in the Born approximation. Possible applications to Cherenkov-type gluon radiation are commented briefly.Comment: 27 pages, references added, version extended with emphasis on non-Abelian gauge group impact on medium characteristics. To appear in J. Phys.

Interspecies Interactions Stimulate Diversification of the Streptomyces coelicolor Secreted Metabolome

ABSTRACT Soils host diverse microbial communities that include filamentous actinobacteria (actinomycetes). These bacteria have been a rich source of useful metabolites, including antimicrobials, antifungals, anticancer agents, siderophores, and immunosuppressants. While humans have long exploited these compounds for therapeutic purposes, the role these natural products may play in mediating interactions between actinomycetes has been difficult to ascertain. As an initial step toward understanding these chemical interactions at a systems level, we employed the emerging techniques of nanospray desorption electrospray ionization (NanoDESI) and matrix-assisted laser desorption ionization–time of flight (MALDI-TOF) imaging mass spectrometry to gain a global chemical view of the model bacterium Streptomyces coelicolor interacting with five other actinomycetes. In each interaction, the majority of secreted compounds associated with S. coelicolor colonies were unique, suggesting an idiosyncratic response from S. coelicolor. Spectral networking revealed a family of unknown compounds produced by S. coelicolor during several interactions. These compounds constitute an extended suite of at least 12 different desferrioxamines with acyl side chains of various lengths; their production was triggered by siderophores made by neighboring strains. Taken together, these results illustrate that chemical interactions between actinomycete bacteria exhibit high complexity and specificity and can drive differential secondary metabolite production

Tip-Clearance Actuation With Magnetic Bearings for High-Speed Compressor Stall Control

Magnetic bearings are widely used as active suspension devices in rotating machinery, mainly for active vibration control purposes. The concept of active tip clearance control suggests a new application of magnetic bearings as servo-actuators to stabilize rotating stall in axial compressors. This paper presents a first-of-a-kind feasibility study of an active stall control experiment with a magnetic bearing servo-actuator in the NASA Glenn high-speed single-stage compressor test facility. Together with CFD and experimental data a two-dimensional, incompressible compressor stability model was used in a stochastic estimation and control analysis to determine the required magnetic bearing performance for compressor stall control. The resulting requirements introduced new challenges to the magnetic bearing actuator design. A magnetic bearing servo-actuator was designed which fulfilled the performance specifications. Control laws were then developed to stabilize the compressor shaft. In a second control loop, a constant gain controller was implemented to stabilize rotating stall. A detailed closed loop simulation at 100% corrected design speed resulted in a 2.3% reduction of stalling mass flow which is comparable to results obtained in the same compressor by Weigl et al. (1998) using unsteady air injection. The design and simulation results presented here establish the viability of magnetic bearings for stall control in aero-engine high-speed compressors. Furthermore the paper outlines a general design procedure to develop magnetic bearing servo-actuators for high-speed turbomachinery.United States. National Aeronautics and Space Administration (Grant NAG3-1457

Assigning channels via the meet-in-the-middle approach

We study the complexity of the Channel Assignment problem. By applying the meet-in-the-middle approach we get an algorithm for the $\ell$-bounded Channel Assignment (when the edge weights are bounded by $\ell$) running in time $O^*((2\sqrt{\ell+1})^n)$. This is the first algorithm which breaks the $(O(\ell))^n$ barrier. We extend this algorithm to the counting variant, at the cost of slightly higher polynomial factor. A major open problem asks whether Channel Assignment admits a $O(c^n)$-time algorithm, for a constant $c$ independent of $\ell$. We consider a similar question for Generalized T-Coloring, a CSP problem that generalizes \CA. We show that Generalized T-Coloring does not admit a $2^{2^{o\left(\sqrt{n}\right)}} {\rm poly}(r)$-time algorithm, where $r$ is the size of the instance.Comment: SWAT 2014: 282-29

Soft Electromagnetic Radiations From Equilibrating Quark-Gluon Plasma

We evaluate the bremsstrahlung production of low mass dileptons and soft photons from equilibrating and transversely expanding quark gluon plasma which may be created in the wake of relativistic heavy ion collisions. We use initial conditions obtained from the self screened parton cascade model. We consider a boost invariant longitudinal and cylindrically symmetric transverse expansion of the parton plasma and find that for low mass dileptons ($M \leq 0.3$ GeV) and soft photons ($p_{T} \leq 0.5$ GeV), the bremsstrahlung contribution is rather large compared to annihilation process at both RHIC and LHC energies. We also find an increase by a factor of 15-20 in the low mass dileptons and soft photons yield as one goes from RHIC to LHC energies.Comment: 8 pages, including 7 figures To appear in Phys. Rev.

Lower Bounds for the Graph Homomorphism Problem

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-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^{\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 $2^{{\mathcal O}(n\log{h})}$ is almost asymptotically tight. We also investigate what properties of graphs $G$ and $H$ make it difficult to solve HOM$(G,H)$. An easy observation is that an ${\mathcal O}(h^n)$ upper bound can be improved to ${\mathcal O}(h^{\operatorname{vc}(G)})$ where $\operatorname{vc}(G)$ is the minimum size of a vertex cover of $G$. The second lower bound $h^{\Omega(\operatorname{vc}(G))}$ shows that the upper bound is asymptotically tight. As to the properties of the "right-hand side" graph $H$, it is known that HOM$(G,H)$ can be solved in time $(f(\Delta(H)))^n$ and $(f(\operatorname{tw}(H)))^n$ where $\Delta(H)$ is the maximum degree of $H$ and $\operatorname{tw}(H)$ is the treewidth of $H$. This gives single-exponential algorithms for graphs of bounded maximum degree or bounded treewidth. Since the chromatic number $\chi(H)$ does not exceed $\operatorname{tw}(H)$ and $\Delta(H)+1$, it is natural to ask whether similar upper bounds with respect to $\chi(H)$ can be obtained. We provide a negative answer to this question by establishing a lower bound $(f(\chi(H)))^n$ for any function $f$. We also observe that similar lower bounds can be obtained for locally injective homomorphisms.Comment: 19 page