Electrochemical reduction of oxygen on gold and boron-doped diamond electrodes in ambient temperature, molten acetamide-urea-ammonium nitrate eutectic melt

The electrochemical reduction of oxygen has been studied on gold, boron-doped diamond (BDD) and glassy carbon (GC) electrodes in a ternary eutectic mixture of acetamide (CH3CONH2), urea (NH2CONH2) and ammonium nitrate (NH4NO3). Cyclic voltammetry (CV), differential pulse voltammetry (DPV), chronoamperometry and rotating disk electrode (RDE) voltammetry techniques have been employed to follow oxygen reduction reaction (ORR). The mechanism for the electrochemical reduction of oxygen on polycrystalline gold involves 2-step. 2-electron pathways of O-2 to H2O2 and further reduction of H2O2 to H2O. The first 2-electron reduction of O-2 to H2O2 passes through superoxide intermediate by 1-electron reduction of oxygen. Kinetic results suggest that the initial 1-electron reduction of oxygen to HO2 is the rate-determining step of ORR on gold surfaces. The chronoamperometric and ROE studies show a potential dependent change in the number of electrons on gold electrode. The oxygen reduction reaction on boron-doped diamond (BOO) seems to proceed via a direct 4-electron process. The reduction of oxygen on the glassy carbon (GC) electrode is a single step, irreversible, diffusion limited 2-electron reduction process to peroxide. (C) 2010 Elsevier Ltd. All rights reserved.

Exploiting the Structure of the Constraint Graph for Efficient Points-to Analysis

Points-to analysis is a key compiler analysis. Several memory related optimizations use points-to information to improve their effectiveness. Points-to analysis is performed by building a constraint graph of pointer variables and dynamically updating it to propagate more and more points-to information across its subset edges. So far, the structure of the constraint graph has been only trivially exploited for efficient propagation of information, e.g., in identifying cyclic components or to propagate information in topological order. We perform a careful study of its structure and propose a new inclusion-based flow-insensitive context-sensitive points-to analysis algorithm based on the notion of dominant pointers. We also propose a new kind of pointer-equivalence based on dominant pointers which provides significantly more opportunities for reducing the number of pointers tracked during the analysis. Based on this hitherto unexplored form of pointer-equivalence, we develop a new context-sensitive flow-insensitive points-to analysis algorithm which uses incremental dominator update to efficiently compute points-to information. Using a large suite of programs consisting of SPEC 2000 benchmarks and five large open source programs we show that our points-to analysis is 88% faster than BDD-based Lazy Cycle Detection and 2x faster than Deep Propagation. We argue that our approach of detecting dominator-based pointer-equivalence is a key to improve points-to analysis efficiency.