NASA Communications Division (NASCOM) Tracking and Data Relay Satellite System (TDRSS) shuttle multiplexer-demultiplexer data system (MDM) and supporting items

The multiplexer-demultiplexer (MDM) project included the design, documentation, manufacture, and testing of three MDM Data Systems. The equipment is contained in 59 racks, and includes more than 3,000 circuit boards and 600 microprocessors. Spares, circuit card testers, a master set of programmable integrated circuits, and a program development system were included as deliverables. All three MDM's were installed, and were operationally tested. The systems performed well with no major problems. The progress and problems analysis, addresses schedule conformance, new technology, items awaiting government approval, and project conclusions are summarized. All contract modifications are described

Call-by-name Gradual Type Theory

We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism, which were developed in blame calculi and to state the "gradual guarantee" theorem of gradual typing. Combined with the ordinary extensionality ($\eta$) principles that type theory provides, we show that most of the standard operational behavior of casts is uniquely determined by the gradual guarantee. This provides a semantic justification for the definitions of casts, and shows that non-standard definitions of casts must violate these principles. Our type theory is the internal language of a certain class of preorder categories called equipments. We give a general construction of an equipment interpreting gradual type theory from a 2-category representing non-gradual types and programs, which is a semantic analogue of Findler and Felleisen's definitions of contracts, and use it to build some concrete domain-theoretic models of gradual typing

A new efficient method for determining weighted power spectra: detection of low-frequency solar p-modes by analysis of BiSON data

We present a new and highly efficient algorithm for computing a power spectrum made from evenly spaced data which combines the noise-reducing advantages of the weighted fit with the computational advantages of the Fast Fourier Transform (FFT). We apply this method to a 10-year data set of the solar p-mode oscillations obtained by the Birmingham Solar Oscillations Network (BiSON) and thereby uncover three new low-frequency modes. These are the l=2, n=5 and n=7 modes and the l=3, n=7 mode. In the case of the l=2, n=5 modes, this is believed to be the first such identification of this mode in the literature. The statistical weights needed for the method are derived from a combination of the real data and a sophisticated simulation of the instrument performance. Variations in the weights are due mainly to the differences in the noise characteristics of the various BiSON instruments, the change in those characteristics over time and the changing line-of-sight velocity between the stations and the Sun. It should be noted that a weighted data set will have a more time-dependent signal than an unweighted set and that, consequently, its frequency spectrum will be more susceptible to aliasing.Comment: 11 pages, 7 Figures, accepted for publication in MNRAS, Figure 6 had to be reduced in size to upload and so may be difficult to view on screen in .ps versio

Call-by-Name Gradual Type Theory

We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to new judgments for gradual type and term dynamism. These dynamism judgements build on prior work in blame calculi and on the "gradual guarantee" theorem of gradual typing. Combined with the ordinary extensionality (eta) principles that type theory provides, we show that most of the standard operational behavior of casts is uniquely determined by the gradual guarantee. This provides a semantic justification for the definitions of casts, and shows that non-standard definitions of casts must violate these principles. Our type theory is the internal language of a certain class of preorder categories called equipments. We give a general construction of an equipment interpreting gradual type theory from a 2-category representing non-gradual types and programs, which is a semantic analogue of the interpretation of gradual typing using contracts, and use it to build some concrete domain-theoretic models of gradual typing

Gradual Typing for Effect Handlers

We present a gradually typed language, GrEff, with effects and handlers that supports migration from unchecked to checked effect typing. This serves as a simple model of the integration of an effect typing discipline with an existing effectful typed language that does not track fine-grained effect information. Our language supports a simple module system to model the programming model of gradual migration from unchecked to checked effect typing in the style of Typed Racket. The surface language GrEff is given semantics by elaboration to a core language Core GrEff. We equip Core GrEff with an inequational theory for reasoning about the semantic error ordering and desired program equivalences for programming with effects and handlers. We derive an operational semantics for the language from the equations provable in the theory. We then show that the theory is sound by constructing an operational logical relations model to prove the graduality theorem. This extends prior work on embedding-projection pair models of gradual typing to handle effect typing and subtyping.Comment: Extended version with appendi

Inhibition of HIV virus by neutralizing Vhh attached to dual functional liposomes encapsulating dapivirine

Although highly active antiretroviral therapy (HAART) has greatly improved the life expectancy of HIV/AIDS patients, the treatment is not curative. It is a global challenge which fosters an urgent need to develop an effective drug or neutralizing antibody delivery approach for the prevention and treatment of this disease. Due to the low density of envelope spikes with restricted mobility present on the surface of HIV virus, which limit the antibody potency and allow virus mutation and escape from the immune system, it is important for a neutralizing antibody to form bivalent or multivalent bonds with the virus. Liposome constructs could fulfil this need due to the flexible mobility of the membrane with its attached antibodies and the capacity for drug encapsulation. In this study, we evaluated the neutralization activity of a range of liposome formulations in different sizes coated with anti-gp120 llama antibody fragments (Vhhs) conjugated via either non-covalent metal chelation or a covalent linkage. The non-covalent construct demonstrated identical binding affinity to HIV-1 envelope glycoprotein gp120 and neutralizing ability for HIV virus as free Vhh. Although covalently linked Vhh showed significant binding affinity to gp120, it unexpectedly had a lower neutralization potency. This may be due to the comparability in size of the viral and liposome particles restricting the number which can be bound to the liposome surface so involving only a fraction of the antibodies, whereas non-covalently attached antibodies dissociate from the surface after acting with gp120 and free the remainder to bind further viruses. Covalently conjugated Vhh might also trigger the cellular uptake of a liposome-virion complex. To explore the possible ability of the antibody-coated liposomes to have a further function, we encapsulated the hydrophobic antiviral drug dapivirine into both of the non-covalently and covalently conjugated liposome formulations, both of which revealed high efficacy in reducing viral replication in vitro. Thus, dual function liposomes may lead to a novel strategy for the prophylaxis of HIV/AIDS by combining the neutralizing activity of Vhh with antiviral effects of high drug concentrations

Pseudo-global Fitting of Gapped Helioseismic Data

Mode fitting or "peak-bagging" is an important procedure in helioseismology allowing one to determine the various mode parameters of solar oscillations. We have recently developed a new "pseudo-global" fitting algorithm as a way of reducing the systematic bias in the fits of certain mode parameters that are seen when using "local" fitting techniques to analyse "sun-as-a-star" p-mode data. This new algorithm has been designed specifically to gain the advantages of fitting the entire power spectrum, while retaining the efficiency of local fitting techniques. Using simulated data with a full fill we have previously shown that the pseudo-global routine reduces the bias in estimates of the frequencies and asymmetries and in the estimates of the solar background when compared with a traditional fitting technique. Here we present results that show that the pseudo-global routine is also effective in reducing bias in the parameter estimates when the time-series has significant gaps. As such we are now able to employ the routine in order to fit ground based helioseismic data such as that collected by the Birmingham Solar Oscillations Network (BiSON).Comment: 6 pages, 3 figures, to be published in the proceedings of GONG 2008/SOHO XX

Effects of fire on forest soil and nutrient cycling: an annotated bibliography, Station Bulletin, no.514

The Bulletin is a publication of the New Hampshire Agricultural Experiment Station, College of Life Sciences and Agriculture, University of New Hampshire, Durham, New Hampshire