Prediction of annual joint rain fade on EHF networks by weighted rain field selection

©2015. American Geophysical Union. All Rights Reserved. We present a computationally efficient method to predict joint rain fade on arbitrary networks of microwave links. Methods based on synthetic rain fields composed of a superposition of rain cells have been shown to produce useful predictions of joint fade, with low computational overhead. Other methods using rain fields derived from radar systems have much higher computational overhead but provide better predictions. The proposed method combines the best features of both methods by using a small number of measured rain fields to produce annual fade predictions. Rain fields are grouped into heavy rain and light rain groups by maximum rain rate. A small selection of rain fields from each group are downscaled and fade predictions generated by pseudointegration of specific attenuation. This paper presents a method to optimize the weights used to combine the heavy rain and light rain fade predictions to yield an estimate of the average annual distribution. The algorithm presented yields estimates of average annual fade distributions with an error small compared to year-to-year variation, using only 0.2% of the annual data set of rain fields

Growth and characterization of crystals for IR detectors and second harmonic gereration devices

Two types of materials, L-arginine phosphate (LAP) and doped triglycine sulfate (TGS), are examined for their growth characteristics and relevant properties for second harmonic generation and IR detector applications, respectively

Texting & Walking: A Dual-Task Study on Gait Patterns in a College-Aged Sample

Please refer to the pdf version of the abstract located adjacent to the title

The Effects of Vision Impairment on Balance in Athletes and Non-Athletes

Please download pdf version here

Rubidium and lead abundances in giant stars of the globular clusters M 13 and NGC 6752

We present measurements of the neutron-capture elements Rb and Pb in five giant stars of the globular cluster NGC 6752 and Pb measurements in four giants of the globular cluster M 13. The abundances were derived by comparing synthetic spectra with high resolution, high signal-to-noise ratio spectra obtained using HDS on the Subaru telescope and MIKE on the Magellan telescope. The program stars span the range of the O-Al abundance variation. In NGC 6752, the mean abundances are [Rb/Fe] = -0.17 +/- 0.06 (sigma = 0.14), [Rb/Zr] = -0.12 +/- 0.06 (sigma = 0.13), and [Pb/Fe] = -0.17 +/- 0.04 (sigma = 0.08). In M 13 the mean abundance is [Pb/Fe] = -0.28 +/- 0.03 (sigma = 0.06). Within the measurement uncertainties, we find no evidence for a star-to-star variation for either Rb or Pb within these clusters. None of the abundance ratios [Rb/Fe], [Rb/Zr], or [Pb/Fe] are correlated with the Al abundance. NGC 6752 may have slightly lower abundances of [Rb/Fe] and [Rb/Zr] compared to the small sample of field stars at the same metallicity. For M 13 and NGC 6752 the Pb abundances are in accord with predictions from a Galactic chemical evolution model. If metal-poor intermediate-mass asymptotic giant branch stars did produce the globular cluster abundance anomalies, then such stars do not synthesize significant quantities of Rb or Pb. Alternatively, if such stars do synthesize large amounts of Rb or Pb, then they are not responsible for the abundance anomalies seen in globular clusters.Comment: Accepted for publication in Ap

Machine-Checked Proofs For Realizability Checking Algorithms

Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions, assume/guarantee contracts, and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system construction. For these proofs to be meaningful, each leaf-level component contract must be realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output value that the component can produce that satisfies the contract guarantees. We have recently proposed (in [1]) a contract-based realizability checking algorithm for assume/guarantee contracts over infinite theories supported by SMT solvers such as linear integer/real arithmetic and uninterpreted functions. In that work, we used an SMT solver and an algorithm similar to k-induction to establish the realizability of a contract, and justified our approach via a hand proof. Given the central importance of realizability to our virtual integration approach, we wanted additional confidence that our approach was sound. This paper describes a complete formalization of the approach in the Coq proof and specification language. During formalization, we found several small mistakes and missing assumptions in our reasoning. Although these did not compromise the correctness of the algorithm used in the checking tools, they point to the value of machine-checked formalization. In addition, we believe this is the first machine-checked formalization for a realizability algorithm.Comment: 14 pages, 1 figur

Effects of Exercise Intensity on Post-Exercise Oral Glucose Tolerance Test Response

Please refer to the pdf version of the abstract located adjacent to the title