Between scylla and charybdis: Hydrophobic graphene-guided water diffusion on hydrophilic substrates

The structure of water confined in nanometer-sized cavities is important because, at this scale, a large fraction of hydrogen bonds can be perturbed by interaction with the confining walls. Unusual fluidity properties can thus be expected in the narrow pores, leading to new phenomena like the enhanced fluidity reported in carbon nanotubes. Crystalline mica and amorphous silicon dioxide are hydrophilic substrates that strongly adsorb water. Graphene, on the other hand, interacts weakly with water. This presents the question as to what determines the structure and diffusivity of water when intercalated between hydrophilic substrates and hydrophobic graphene. Using atomic force microscopy, we have found that while the hydrophilic substrates determine the structure of water near its surface, graphene guides its diffusion, favouring growth of intercalated water domains along the C-C bond zigzag direction. Molecular dynamics and density functional calculations are provided to help understand the highly anisotropic water stripe patterns observed.

Introducing carbon diffusion barriers for uniform, high-quality graphene growth from solid sources.

Carbon diffusion barriers are introduced as a general and simple method to prevent premature carbon dissolution and thereby to significantly improve graphene formation from the catalytic transformation of solid carbon sources. A thin Al2O3 barrier inserted into an amorphous-C/Ni bilayer stack is demonstrated to enable growth of uniform monolayer graphene at 600 °C with domain sizes exceeding 50 μm, and an average Raman D/G ratio of <0.07. A detailed growth rationale is established via in situ measurements, relevant to solid-state growth of a wide range of layered materials, as well as layer-by-layer control in these systems.

A derivation of the source-channel error exponent using nonidentical product distributions

This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight. © 2014 IEEE.