Optimizing the fine lock performance of the Hubble Space Telescope fine guidance sensors

This paper summarizes the on-orbit performance to date of the three Hubble Space Telescope Fine Guidance Sensors (FGS's) in Fine Lock mode, with respect to acquisition success rate, ability to maintain lock, and star brightness range. The process of optimizing Fine Lock performance, including the reasoning underlying the adjustment of uplink parameters, and the effects of optimization are described. The Fine Lock optimization process has combined theoretical and experimental approaches. Computer models of the FGS have improved understanding of the effects of uplink parameters and fine error averaging on the ability of the FGS to acquire stars and maintain lock. Empirical data have determined the variation of the interferometric error characteristics (so-called 's-curves') between FGS's and over each FGS field of view, identified binary stars, and quantified the systematic error in Coarse Track (the mode preceding Fine Lock). On the basis of these empirical data, the values of the uplink parameters can be selected more precisely. Since launch, optimization efforts have improved FGS Fine Lock performance, particularly acquisition, which now enjoys a nearly 100 percent success rate. More recent work has been directed towards improving FGS tolerance of two conditions that exceed its original design requirements. First, large amplitude spacecraft jitter is induced by solar panel vibrations following day/night transitions. This jitter is generally much greater than the FGS's were designed to track, and while the tracking ability of the FGS's has been shown to exceed design requirements, losses of Fine Lock after day/night transitions are frequent. Computer simulations have demonstrated a potential improvement in Fine Lock tracking of vehicle jitter near terminator crossings. Second, telescope spherical aberration degrades the interferometric error signal in Fine Lock, but use of the FGS two-thirds aperture stop restores the transfer function with a corresponding loss of throughput. This loss requires the minimum brightness of acquired stars to be about one magnitude brighter than originally planned

On Deciding Local Theory Extensions via E-matching

Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automating verification problems. A limitation frequently encountered is that verification problems are often not fully expressible in the theories supported natively by the solvers. Many solvers allow the specification of application-specific theories as quantified axioms, but their handling is incomplete outside of narrow special cases. In this work, we show how SMT solvers can be used to obtain complete decision procedures for local theory extensions, an important class of theories that are decidable using finite instantiation of axioms. We present an algorithm that uses E-matching to generate instances incrementally during the search, significantly reducing the number of generated instances compared to eager instantiation strategies. We have used two SMT solvers to implement this algorithm and conducted an extensive experimental evaluation on benchmarks derived from verification conditions for heap-manipulating programs. We believe that our results are of interest to both the users of SMT solvers as well as their developers

Prospective Observational Study of Pazopanib in Patients with Advanced Renal Cell Carcinoma (PRINCIPAL Study)

Background: Real-world data are essential to accurately assessing efficacy and toxicity of approved agents in everyday practice. PRINCIPAL, a prospective, observational study, was designed to confirm the real-world safety and efficacy of pazopanib in patients with advanced renal cell carcinoma (RCC). Subjects, Materials, and Methods: Patients with clear cell advanced/metastatic RCC and a clinical decision to initiate pazopanib treatment within 30 days of enrollment were eligible. Primary objectives included progression-free survival (PFS), overall survival (OS), objective response rate (ORR), relative dose intensity (RDI) and its effect on treatment outcomes, change in health-related quality of life (HRQoL), and safety. We also compared characteristics and outcomes of clinical-trial-eligible (CTE) patients, defined using COMPARZ trial eligibility criteria, with those of non-clinical-trial-eligible (NCTE) patients. Secondary study objectives were to evaluate clinical efficacy, safety, and RDI in patient subgroups. Results: Six hundred fifty-seven patients were enrolled and received ≥1 dose of pazopanib. Median PFS and OS were 10.3 months (95% confidence interval [CI], 9.2–12.0) and 29.9 months (95% CI, 24.7 to not reached), respectively, and the ORR was 30.3%. HRQoL showed no or little deterioration over time. Treatment-related serious adverse events (AEs) and AEs of special interest occurred in 64 (9.7%), and 399 (60.7%) patients, respectively. More patients were classified NCTE than CTE (85.2% vs. 14.8%). Efficacy of pazopanib was similar between the two groups. Conclusion: PRINCIPAL confirms the efficacy and safety of pazopanib in patients with advanced/metastatic RCC in a real-world clinical setting. Implications for Practice: PRINCIPAL is the largest (n = 657) prospective, observational study of pazopanib in patients with advanced/metastatic renal cell carcinoma, to the authors’ knowledge. Consistent with clinical trial results that often contain specific patient types, the PRINCIPAL study demonstrated that the effectiveness and safety of pazopanib is similarly safe and effective in patients with advanced kidney cancer in a real-world clinical setting. The PRINCIPAL study showed that patients with advanced kidney cancer who are treated with first-line pazopanib generally do not show disease progression for approximately 10 months and generally survive for nearly 30 months

A Tableau Calculus for Combining Non-Disjoint Theories

The Nelson-Oppen combination method combines ground satis ability checkers for rst-order theories satisfying certain conditions into a single ground satis ability checker for the union theory. The most signi cant restriction that the combined theories must satisfy, for the Nelson-Oppen combination method to be applicable, is that they must have disjoint signatures. Unfortunately, this is a very serious restriction since many combination problems concern theories over non-disjoint signatures