Proving the correctness of the flight director program EADIFD, volume 1

EADIFD is written in symbolic assembly language for execution on the C4000 airborne computer. It is a subprogram of an aircraft navigation and guidance program and is used to generate pitch and roll command signals for use in terminal airspace. The proof of EADIFD was carried out by an inductive assertion method consisting of two parts, a verification condition generator and a source language independent proof checker. With the specifications provided by NASA, EADIFD was proved correct. The termination of the program is guaranteed and the program contains no instructions that can modify it under any conditions

Solar pumped laser

A solar pumped laser is described in which the lasant is a gas that will photodissociate and lase when subjected to sunrays. Sunrays are collected and directed onto the gas lasant to cause it to lase. Applications to laser propulsion and laser power transmission are discussed

A critique of monetary protectionism

An argument against attempts to achieve current-account objectives through monetary manipulation of nominal exchange rates, with an explanation of why such tampering--which for various reasons might appear politically attractive--ultimately harms economic welfare.Foreign exchange - Law and legislation ; Monetary policy

Hardness of Graph Pricing through Generalized Max-Dicut

The Graph Pricing problem is among the fundamental problems whose approximability is not well-understood. While there is a simple combinatorial 1/4-approximation algorithm, the best hardness result remains at 1/2 assuming the Unique Games Conjecture (UGC). We show that it is NP-hard to approximate within a factor better than 1/4 under the UGC, so that the simple combinatorial algorithm might be the best possible. We also prove that for any $\epsilon > 0$, there exists $\delta > 0$ such that the integrality gap of $n^{\delta}$-rounds of the Sherali-Adams hierarchy of linear programming for Graph Pricing is at most 1/2 + $\epsilon$. This work is based on the effort to view the Graph Pricing problem as a Constraint Satisfaction Problem (CSP) simpler than the standard and complicated formulation. We propose the problem called Generalized Max-Dicut($T$), which has a domain size $T + 1$ for every $T \geq 1$. Generalized Max-Dicut(1) is well-known Max-Dicut. There is an approximation-preserving reduction from Generalized Max-Dicut on directed acyclic graphs (DAGs) to Graph Pricing, and both our results are achieved through this reduction. Besides its connection to Graph Pricing, the hardness of Generalized Max-Dicut is interesting in its own right since in most arity two CSPs studied in the literature, SDP-based algorithms perform better than LP-based or combinatorial algorithms --- for this arity two CSP, a simple combinatorial algorithm does the best.Comment: 28 page

Muon Detection of TeV Gamma Rays from Gamma Ray Bursts

Because of the limited size of the satellite-borne instruments, it has not been possible to observe the flux of gamma ray bursts (GRB) beyond GeV energy. We here show that it is possible to detect the GRB radiation of TeV energy and above, by detecting the muon secondaries produced when the gamma rays shower in the Earth's atmosphere. Observation is made possible by the recent commissioning of underground detectors (AMANDA, the Lake Baikal detector and MILAGRO) which combine a low muon threshold of a few hundred GeV or less, with a large effective area of 10^3 m^2 or more. Observations will not only provide new insights in the origin and characteristics of GRB, they also provide quantitative information on the diffuse infrared background.Comment: Revtex, 12 pages, 3 postscript figures, uses epsfig.st

Thunderstorm Persistence at Cape Kennedy, Florida

Probabilities of thunderstorm persistence at Cape Kennedy, Florid

Finite volume study of electric polarizabilities from lattice QCD

Knowledge of the electric polarizability is crucial to understanding the interactions of hadrons with electromagnetic fields. The neutron polarizability is very sensitive to the quark mass and is expected to diverge in the chiral limit. Here we present results for the electric polarizability of the neutron, neutral pion, and neutral kaon on eight ensembles with nHYP-smeared clover dynamical fermions with two different pion masses (227 and 306 MeV). These are currently the lightest pion masses used in polarizability studies. For each pion mass we compute the polarizability at four different volumes and perform an infinite volume extrapolation for the three hadrons. Along with the infinite volume extrapolation we conduct a chiral extrapolation for the kaon polarizability to the physical point. We compare our results for the neutron polarizability to predictions from chiral perturbation theory.Comment: 7 pages, 11 figure