Synthesis and characterization of isotopically enriched methylmercury (CH3201Hg+)

A simple procedure for the synthesis of an important standard, isotopically enriched methylmercury, which is not commercially available, has been established successfully. The isotopically enriched standard synthesized is utilized in conventional isotope dilution mass spectrometry (IDMS), as well as in speciated IDMS (SIDMS), for determination of the true concentration of methylmercury in environmental samples. The CH₃²⁰¹Hg⁺ standard has been synthesized from commercially available ²⁰¹HgO and tetramethyltin. The synthesis time required is 1 h at 60°C. The product is highly pure, yielding more than 90% as ²⁰¹Hg in CH₃²⁰¹Hg⁺. Hazardous dimethylmercury does not occur during this synthesis procedure. The product synthesized was analyzed using high‐performance liquid chromatography coupled with inductively coupled plasma mass spectrometry (ICP‐MS) and ICP‐MS alone in order to determine its concentration, isotopic composition and purity. The stability of the product was also evaluated for over 6 months and found to be stable at 4°C in the dark. The isotopically enriched methylmercury synthesized can be used in SIDMS and IDMS analyses as a standard. Copyright © 2003 John Wiley & Sons, Ltd.     

Lower bounds for sums of Barban-Davenport-Halberstam type (supplement)

This article was processed by the author using the IATEX style filecljourl from Springer-Verlag.     

20-relative neighborhood graphs are hamiltonian

For any two points p and q in the Euclidean plane, define LUN_pq = { v | v ∈ R², d_pv < d_pq and d_qv < d_pq}, where d_uv is the Euclidean distance between two points u and v . Given a set of points V in the plane, let LUN_pq(V) = V ∩ LUN_pq. Toussaint defined the relative neighborhood graph of V, denoted by RNG(V) or simply RNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of RNG(V) if and only if LUN_pq (V) = ?. The relative neighborhood graph has several applications in pattern recognition that have been studied by Toussaint. We shall generalize the idea of RNG to define the k-relative neighborhood graph of V, denoted by kRNG(V) or simply kRNG, to be the undirected graph with vertices V such that for each pair p,q ∈ V, (p,q) is an edge of kRNG(V) if and only if | LUN_pq(V) | < k, for some fixed positive number k. It can be shown that the number of edges of a kRNG is less than O(kn). Also, a kRNG can be constructed in O(kn₂) time. Let E_c = {e_pq| p ∈ V and q ∈ V}. Then G_c = (V,E_c) is a complete graph. For any subset F of E_c, define the maximum distance of F as max_epq∈Fd_pq. A Euclidean bottleneck Hamiltonian cycle is a Hamiltonian cycle in graph G_c whose maximum distance is the minimum among all Hamiltonian cycles in graph G_c. We shall prove that there exists a Euclidean bottleneck Hamiltonian cycle which is a subgraph of 20RNG(V). Hence, 20RNGs are Hamiltonian.     

Finite element computations of two-dimensional arterial flow in the presence of a transverse magnetic field

A finite element solution of the Navier-Stokes equations for steady flow under the magnetic effect through a double-branched two-dimensional section of a three-dimensional model of the canine aorta is discussed. The numerical scheme involves transforming the physical co-ordinates to a curvilinear boundary-fitted co-ordinate system. The shear stress at the wall is calculated for a Reynolds number of 1000 with the branch-to-main aortic flow rate ratio as a parameter. The results are compared with earlier works involving experimental data and found to be in reasonable qualitative agreement. The steady flow, shear stress and branch flow under the effect of a magnetic field have been discussed in detail.     

Numerical study of simultaneous natural convection heat transfer from both surfaces of a uniformly heated thin plate with arbitrary inclination

 Numerical studies were conducted to investigate the natural convection heat transfer around a uniformly heated thin plate with arbitrary inclination in an infinite space. The numerical approach was based on the finite volume technique with a nonstaggered grid arrangement. For handling the pressure–velocity coupling the SIMPLE-algorithm was used. QUICK scheme and first order upwind scheme were employed for discretization of the momentum and energy convective terms respectively. Plate width and heating rate were used to vary the modified Rayleigh number over the range of 4.8×10⁶ to 1.87×10⁸. Local and average heat transfer characteristics were compared with regarding to the inclination angle. The empirical expressions for local and average Nusselt number were correlated. It has been found that for inclination angle less than 10^∘, the flow and heat transfer characteristics are complicated and the average Nusselt number can not be correlated by one equation while for inclination angle larger than 10^∘, the average Nusselt number can be correlated into an elegant correlation. Received on 18 April 2001 / Published online: 29 November 2001     

On path lengths modulo three

We show that between any two nodes of a cubic, planar, three-connected graph there are three paths whose lengths are 0, 1, and 2 modulo 3, respectively. The proof is by a rather extensive case analysis. Counterexamples show that all three hypotheses (i.e., planarity, degree-three, and three-connectivity) are necessary.