Applications of DNP-NMR for the measurement of heteronuclear T1 relaxation times

Measurement of heteronuclear spin-lattice relaxation times is hampered by both low natural abundance and low detection sensitivity. Combined with typically long relaxation times, this results in extended acquisition times which often renders the experiment impractical. Recently a variant of dynamic nuclear polarisation has been demonstrated in which enhanced nuclear spin polarisation, generated in the cryo-solid state, is transferred to the liquid state for detection. Combining this approach with small flip angle pulse trains, similar to the FLASH-T(1) imaging sequence, allows the rapid determination of spin-lattice relaxation times. In this paper we explore this method and its application to the measurement of T(1) for both carbon-13 and nitrogen-15 at natural abundance. The effects of RF inhomogeneity and the influence of proton decoupling in the context of this experiment are also investigated.

Measuring distributions of jump rates in disordered metal–hydrogen systems by nuclear magnetic relaxation

Monte Carlo calculations of the nuclear magnetic relaxation rate in a disordered metal–hydrogen system having a distribution of jump rates are reported. The calculations deal specifically with the spin-locked rotating-frame relaxation time T1ρ. The results demonstrate that the temperature variation of the rate is only weakly dependent on the distribution and it is therefore unlikely that the jump rate distribution can be extracted from relaxation measurements in which temperature is the main variable. It is shown that the alternative of measuring the relaxation rate over a wide range of spin-locking field strengths at a constant temperature can lead to an evaluation of the distribution.

Scalable and efficient graph colouring in 3 dimensions using emergence engineering principles

This paper describes ways in which emergence engineering principles can be applied to the development of distributed applications. A distributed solution to the graph-colouring problem is used as a vehicle to illustrate some novel techniques. Each node acts autonomously to colour itself based only on its local view of its neighbourhood, and following a simple set of carefully tuned rules. Randomness breaks symmetry and thus enhances stability. The algorithm has been developed to enable self-configuration in wireless sensor networks, and to reflect real-world configurations the algorithm operates with 3 dimensional topologies (reflecting the propagation of radio waves and the placement of sensors in buildings, bridge structures etc.). The algorithm’s performance is evaluated and results presented. It is shown to be simultaneously highly stable and scalable whilst achieving low convergence times. The use of eavesdropping gives rise to low interaction complexity and high efficiency in terms of the communication overheads.