Can a Procedure for the Growth of Single-layer Graphene on Copper be used in Different Chemical Vapor Deposition Reactors?

In the last decade, catalytic chemical vapor deposition (CVD) has been intensively explored for the growth of single-layer graphene (SLG). Despite the scattering of guidelines and procedures, variables such as the surface texture/chemistry of catalyst metal foils, carbon feedstock, and growth process parameters have been well-scrutinized. Still, questions remain on how best to standardize the growth procedure. The possible correlation of procedures between different CVD setups is an example. Here, two thermal CVD reactors were explored to grow graphene on Cu foil. The design of these setups was entirely distinct, one being a “showerhead” cold-wall type, whereas the other represented the popular “tubular” hot-wall type. Upon standardizing the Cu foil surface, it was possible to develop a procedure for cm²-scale SLG growth that differed only by the carrier gas flow rate used in the two reactors.     

Comparison of fast field-cycling magnetic resonance imaging methods and future perspectives

ABSTRACT

Fast field-cycling (FFC) nuclear magnetic resonance relaxometry is a well-established method to determine the relaxation rates as a function of magnetic field strength. This so-called nuclear magnetic relaxation dispersion gives insight into the underlying molecular dynamics of a wide range of complex systems and has gained interest especially in the characterisation of biological tissues and diseases. The combination of FFC techniques with magnetic resonance imaging (MRI) offers a high potential for new types of image contrast more specific to pathological molecular dynamics. This article reviews the progress in FFC-MRI over the last decade and gives an overview of the hardware systems currently in operation. We discuss limitations and error correction strategies specific to FFC-MRI such as field stability and homogeneity, signal-to-noise ratio, eddy currents and acquisition time. We also report potential applications with impact in biology and medicine. Finally, we discuss the challenges and future applications in transferring the underlying molecular dynamics into novel types of image contrast by exploiting the dispersive properties of biological tissue or MRI contrast agents.     

Interface-related effects on confined excitons in GaAs/AlxGa1−xAs single quantum wells

Confined excitons in non-abrupt GaAs/Al_xGa_1−xAs single quantum wells are studied. The graded interfaces are described taking into account fluctuations in their thickness a and positioning with respect to the abrupt interface picture. Numerical results for confined (0,0),(1,1) and (0,2) excitons in GaAs/Al_0.3Ga_0.7As quantum wells show that while the interfacial fluctuations produce small changes (<0.5 meV) in the exciton binding energies, the confined exciton energies can be red- or blue-shifted as much as 25 meV for wells with mean width of 50 Å and 2 ML wide interfaces.     

The influence of Na<Superscript>+</Superscript> on the anilinepropylsilica xerogel synthesis by using the fluoride nucleophilic catalyst

Anilinepropylsilica xerogel was obtained by using an appropriate organosilane and tetraethyl orthosilicate as precursor reagents. The gelation was carried out using HF and NaF as catalysts. The presence of Na⁺ (when NaF was used) resulted in a decrease in the final organic content of the materials. This effect was interpreted as an inhibition of the organosilane polycondensation possibly due to the Na⁺ interaction with the SiO^- groups of the hydrolyzed organosilane. The presence of Na⁺ also results in morphological changes in the xerogels.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.