Occupational lead neurotoxicity: Improvement in behavioural effects after reduction of exposure.

To evaluate critical exposure levels and the reversibility of lead neurotoxicity a group of lead exposed foundry workers and an unexposed reference population were followed up for three years. During this period, tests designed to monitor neurobehavioural function and lead dose were administered. Evaluations of 160 workers during the first year showed dose dependent decrements in mood, visual/motor performance, memory, and verbal concept formation. Subsequently, an improvement in the hygienic conditions at the plant resulted in striking reductions in blood lead concentrations over the following two years. Attendant improvement in indices of tension (20% reduction), anger (18%), depression (26%), fatigue (27%), and confusion (13%) was observed. Performance on neurobehavioural testing generally correlated best with integrated dose estimates derived from blood lead concentrations measured periodically over the study period; zinc protoporphyrin levels were less well correlated with function. This investigation confirms the importance of compliance with workplace standards designed to lower exposures to ensure that individual blood lead concentrations remain below 50 micrograms/dl.

New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi

Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether a λ-term is beta-strongly normalizing is reduced to the question of whether a λ-term is merely normalizing under one of the new notions of reduction. This leads to a new way to prove beta-strong normalization for typed λ-calculi. Instead of the usual semantic proof style based on Girard's "candidats de réductibilité'', termination can be proved using a decreasing metric over a well-founded ordering in a style more common in the field of term rewriting. This new proof method is applied to the simply-typed λ-calculus and the system of intersection types.

Borohydride Reduction of Fluorenone

A simple experiment to demonstrate nucleophilic addition to a carbonyl. Sodium borohydride-mediated reduction of fluorenone is a fast and high-yielding reaction that is suitable for beginning students. Students isolate their fluorenol product by recrystallization and characterize it by NMR and IR.

Addendum to "New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi"

This is an addendum to our technical report BUCS TR-94-014 of December 19, 1994. It clarifies some statements, adds information on some related research, includes a comparison with research be de Groote, and fixes two minor mistakes in a proof.

Beta-Reduction As Unification

We define a unification problem ^UP with the property that, given a pure lambda-term M, we can derive an instance Gamma(M) of ^UP from M such that Gamma(M) has a solution if and only if M is beta-strongly normalizable. There is a type discipline for pure lambda-terms that characterizes beta-strong normalization; this is the system of intersection types (without a "top" type that can be assigned to every lambda-term). In this report, we use a lean version LAMBDA of the usual system of intersection types. Hence, ^UP is also an appropriate unification problem to characterize typability of lambda-terms in LAMBDA. It also follows that ^UP is an undecidable problem, which can in turn be related to semi-unification and second-order unification (both known to be undecidable).

Search Space Reduction in QoS Routing

To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, and some heuristics have been proposed to find a near-optimal solution. However, these heuristics either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, called DCCR (for Delay-Cost-Constrained Routing), is a variant of the k-shortest path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use the method proposed by Blokh and Gutin to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm SSR+DCCR (for Search Space Reduction+DCCR). Through extensive simulations, we confirm that SSR+DCCR performs very well compared to the optimal but very expensive solution.