Screening for prostate cancer

Despite recent advances in both the survival and cure rates for many forms of cancer, unfortunately the same has not been true for prostate cancer. In fact, the age-adjusted death rate from prostate cancer has not significantly improved since 1949, and prostate cancer remains the most common cancer in American men, causing the second highest cancer mortality rate. Topics discussed include the following: serum testosterone levels; diagnosis; mortality statistics; prostate-sppecific antigen (PSA) tests; and the Occupational Medicine Services policy at LeRC

Legionella: An overview

The topics discussed include the following: history; bacteriology, ecology, and transmission; epidemiology; clinical manifestations; Pontiac Fever; diagnosis; treatment; and prevention

Tuberculosis: A case for increased screening

The topics discussed include the following: background; epidemiological shifts; pathophysiology of turberculosis; screening for turberculosis; and recommendations

Emerging Investigators Series: Pyrolysis Removes Common Microconstituents Triclocarban, Triclosan, and Nonylphenol from Biosolids

Reusing biosolids is vital for the sustainability of wastewater management. Pyrolysis is an anoxic thermal degradation process that can be used to convert biosolids into energy rich py-gas and py-oil, and a beneficial soil amendment, biochar. Batch biosolids pyrolysis (60 minutes) revealed that triclocarban and triclosan were removed (to below quantification limit) at 200 °C and 300 °C, respectively. Substantial removal (\u3e90%) of nonylphenol was achieved at 300 °C as well, but 600 °C was required to remove nonylphenol to below the quantification limit. At 500 °C, the pyrolysis reaction time to remove \u3e90% of microconstituents was less than 5 minutes. Fate studies revealed that microconstituents were both volatilized and thermochemically transformed during pyrolysis; microconstituents with higher vapor pressures were more likely to volatilize and leave the pyrolysis reactor before being transformed than compounds with lower vapor pressures. Reductive dehalogenation products of triclocarban and suspected dehalogenation products of triclosan were identified in py-gas. Application of biosolids-derived biochar to soil in place of biosolids has potential to minimize organic microconstituents discharged to the environment provided appropriate management of py-gas and py-oil

Abstracting Syntax

Binding is a fundamental part of language specification, yet it is both difficult and tedious to get right. In previous work, we argued that an approach based on locally nameless representation and a particular style for defining inductive relations can provide a portable, transparent, lightweight methodology to define the semantics of binding. Although the binding infrastructure required by this approach is straightforward to develop, it leads to duplicated effort and code as the number of binding forms in a language increases. In this paper, we critically compare a spectrum of approaches that attempt to ameliorate this tedium by unifying the treatment of variables and binding. In particular, we compare our original methodology with two alternative ideas: First, we define variable binding in the object language via variable binding in a reusable library. Second, we present a novel approach that collapses the syntactic categories of the object language together, permitting variables to be shared between them. Our main contribution is a careful characterization of the benefits and drawbacks of each approach. In particular, we use multiple solutions to the POPLMARK challenge in the Coq proof assistant to point out specic consequences with respect to the size of the binding infrastructure, transparency of the definitions, impact to the metatheory of the object language, and adequacy of the object language encoding

System FC with Explicit Kind Equality

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of System F with first-class type equality proofs called coercions. This extensible proof system forms the foundation for type system extensions such as type families (type- level functions) and Generalized Algebraic Datatypes (GADTs). Such features, in conjunction with kind polymorphism and datatype promotion, support expressive compile-time reasoning. However, the core language lacks explicit kind equality proofs. As a result, type-level computation does not have access to kind- level functions or promoted GADTs, the type-level analogues to expression-level features that have been so useful. In this paper, we eliminate such discrepancies by introducing kind equalities to System FC. Our approach is based on dependent type systems with heterogeneous equality and the “Type-in-Type” axiom, yet it preserves the metatheoretic properties of FC. In particular, type checking is simple, decidable and syntax directed. We prove the preservation and progress theorems for the extended language

System FC with Explicit Kind Equality (extended version)

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of System F with first-class type equality proofs called coercions. This extensible proof system forms the foundation for type system extensions such as type families (type- level functions) and Generalized Algebraic Datatypes (GADTs). Such features, in conjunction with kind polymorphism and datatype promotion, support expressive compile-time reasoning. However, the core language lacks explicit kind equality proofs. As a result, type-level computation does not have access to kind- level functions or promoted GADTs, the type-level analogues to expression-level features that have been so useful. In this paper, we eliminate such discrepancies by introducing kind equalities to System FC. Our approach is based on dependent type systems with heterogeneous equality and the “Type-in-Type” axiom, yet it preserves the metatheoretic properties of FC. In particular, type checking is simple, decidable and syntax directed. We prove the preservation and progress theorems for the extended language

Guerrerostrongylus marginalis n. sp. (Trichostrongyloidea: Heligmonellidae) from the Guianan arboreal mouse (Oecomys auyantepui) from French Guiana

Based on the number and arrangement of cuticular ridges and configuration of the dorsal ray, nematode specimens collected from the small intestine of eight Guianan arboreal mice, Oecomys auyantepui (Rodentia: Sigmodontinae), in French Guiana are herein described and characterized. Guerrerostrongylus marginalis n. sp. (Heligmosomoidea: Heligmonellidae) shows a synlophe consisting of more than 40 ridges and a unique bursal arrangement with ray 8 (externo-dorsal) extending to the edge of the bursal margin, and appearing more prominent than the dorsal ray. This bursal arrangement is common in members of Hassalstrongylus Durette-Desset, 1971, but uncommon in the other four species in Guerrerostrongylus Sutton & Durette-Desset, 1991. The placement of the new species in Guerrerostrongylus is based on the number and nature of cuticular ridges and the ray arrangement and symmetry of the caudal bursa. Diagnostic characteristics of Guerrerostrongylus marginalis n. sp. include the length of ray 8 relative to bursal margin, the relative size of the spicules and vestibule, and the number of eggs in the uterus. We propose an amendment to the generic diagnosis of Guerrerostrongylus to modify the characters of the long rays 6 (postero-lateral), rays 8 (externo-dorsal), and dorsal ray as diagnostic, since at least ray 6 appears to be short in two different species in the genus, namely G. ulysi Digiani, Notarnicola & Navone, 2012 and G. marginalis n. sp

Visible Type Application

The Hindley-Milner HM type system automatically infers the types at which polymorphic functions are used. In HM, the inferred types are unambiguous, and every expression has a principal type. Type annotations make HM compatible with extensions where complete type inference is impossible, such as higher-rank polymorphism and type-level functions. However, programmers cannot use annotations to explicitly provide type arguments to polymorphic functions, as HM requires type instantiations to be inferred. We describe an extension to HM that allows visible type application. Our extension requires a novel type inference algorithm, yet its declarative presentation is a simple extension to HM. We prove that our extended system is a conservative extension of HM and admits principal types. We then extend our approach to a higher-rank type system with bidirectional type-checking. We have implemented this system in the Glasgow Haskell Compiler and show how our approach scales in the presence of complex type system features