The one- and multi-sample problem for functional data with application to projective shape analysis

In this paper tests are derived for testing neighborhood hypotheses for the one- and multi-sample problem for functional data. Our methodology is used to generalize testing in projective shape analysis, which has traditionally involving data consisting of finite number of points, to the functional case. The one-sample test is applied to the problem of scene identification, in the context of the projective shape of a planar curve.     

LSPR Biosensor Signal Enhancement Using Nanoparticle-Antibody Conjugates

A method to amplify the wavelength shift observed from localized surface plasmon resonance (LSPR) bioassays is developed using gold nanoparticle-labeled antibodies. The technique, which involves detecting surface-bound analytes using gold nanoparticle conjugated antibodies, provides a way to enhance LSPR shifts for more sensitive detection of low-concentration analytes. Using the biotin and antibiotin binding pair as a model, we demonstrate up to a 400% amplification of the shift upon antibody binding to analyte. In addition, the antibody-nanoparticle conjugate improves the observed binding constant by 2 orders of magnitude, and the limit of detection by nearly 3 orders of magnitude. This amplification strategy provides a way to improve the sensitivity of plasmon-based bioassays, paving the way for single molecule-based detection and clinically relevant diagnostics.     

Syntheses of the opioid substructures 1,2,3,4,5,6-hexahydro-2,6-methano-3-benzazocine and 2,3,4,5-tetrahydro-1,5-methano-1H-2-benzazepine

Concise syntheses of 1,2,3,4,5,6-hexahydro-2,6-methano-3-benzazocine (12) and 2,3,4,5-tetrahydro-1,5-methano-1H-2-benzazepine (18) are described and involve an intramolecular Friedel-Crafts alkylation and an intramolecular Heck cyclization as their respective key ring-forming steps.     

One octarepeate expansion to the human prion protein alters both the Zn2+ and Cu2+ coordination environments within the octarepeate domain

The influence of a single octarepeat expansion on the Cu(II) and Zn(II) coordination environments within the octarepeat domain of the human prion protein is examined. Using X-ray absorption spectroscopy and diethyl pyrocarbonate labeling studies, we find that at low copper concentrations the "normal" octarepeat domain (four PHGGGWGQ repeats) coordinates Zn(II) in an (N/O)(6) coordination environment with two histidine residues and Cu(II) in a redox-inactive (N/O)(4) coordination environment using one imidazole residue. Expansion of the octarepeat region by one repeat (five PHGGGWGQ repeats) yields a three-histidine (N/O)(6) coordination environment for Zn(II) and a two-histidine (N/O)(4) coordination environment for Cu(II) at low copper concentrations. This Cu(II)[(N/O)(2)-histidine(2)] coordination motif is redox-active and capable of generating H(2)O(2) under reducing aerobic conditions.     

An adaptive control scheme for a continuous plant under Known output delay, unmodelled dynamics, and input saturation

This paper deals with robustness of adaptive control of continuoussystems subject to known output delay, input saturation, unmodelledlinear dynamics, and bounded disturbances. A simple gradient-typealgorithm with a relative deadzone is used. The relative deadzoneis built with an estimated contribution of the unmodelled dynamicsto the system output. The basic tool used for stability androbustness analysis is Gronwall's lemma.     

Why Aren't There Any Trioxygenyl or Ozonium Salts? Or,Why Does Our Reaction of O3 and PtF6 Give O2PtF6?

The reaction of ozone and gaseous platinum hexafluoride led to O₂PtF₆(s) and not the desired O₃PtF₆(s). Suggestions as to why the synthesis of O₃PtF₆(s) failed are made in terms of the known chemistry of the gaseous O ₃ ⁺ cation with O ₊ ⁵ proposed as an intermediate.     

Program derivation with verified transformations — a case study

A program development methodology based on verified program transformations is described and illustrated through derivations of a high level bisimulation algorithm and an improved minimum-state DFA algorithm. Certain doubts that were raised about the correctness of an initial paper-and-pencil derivation of the DFA minimization algorithm were laid to rest by machine-checked formal proofs of the most difficult derivational steps. Although the protracted labor involved in designing and checking these proofs was almost overwhelming, the expense was somewhat offset by a successful reuse of major portions of these proofs. In particular, the DFA minimization algorithm is obtained by specializing and then extending the last step in the derivation of the high level bisimulation algorithm. Our experience suggests that a major focus of future research should be aimed towards improving the technology of machine checkable proofs — their construction, presentation, and reuse. This paper demonstrates the importance of such a technology to the verification of programs and program transformations. We believe that the utility of transformational systems to program development will ultimately rest on a practical program correctness technology. © 1996 John Wiley & Sons, Inc.