Arrays of Ru nanoclusters with narrow size distribution templated by monolayer graphene on Ru

Ru nanoclusters self-assemble over macroscopic sample areas during vapor deposition of Ru on monolayer graphene (MLG) on Ru(0001). The Ru nanoclusters form arrays with a mean lateral cluster diameter of ~ 20 Å, cluster heights of 1 or 2 ML, and a size distribution that remains nearly constant with increasing coverage. Combined scanning tunneling microscopy and density functional theory (DFT) show that the clusters are templated by the MLG/Ru(0001) moiré unit cell and identify the preferred binding site of the clusters as the low fcc region of the moiré. Cross-sectional transmission electron microscopy (TEM) and high-resolution TEM contrast simulations experimentally demonstrate that the interaction of the Ru clusters with the underlying MLG/Ru(0001) leads to a local lifting of the graphene layer of the template. DFT calculations confirm this mechanism of interaction of the Ru clusters with the strongly coupled MLG/Ru(0001). Weakening of the graphene-support coupling via oxygen intercalation is shown to have a major effect on the assembly of Ru nanocluster arrays. With a preferred binding site lacking on decoupled graphene, the Ru nanoclusters grow significantly larger, and clusters with 1 to 4 ML height can coexist.     

Effective location models for sorting recyclables in public management

The recycling of urban solid wastes is a critical point for the “closing supply chains” of many products, mainly when their value cannot be completely recovered after use. In addition to environmental aspects, the process of recycling involves technical, economic, social and political challenges for public management. For most of the urban solid waste, the management of the end-of-life depends on selective collection to start the recycling process. For this reason, an efficient selective collection has become a mainstream tool in the Brazilian National Solid Waste Policy. In this paper, we study effective models that might support the location planning of sorting centers in a medium-sized Brazilian city that has been discussing waste management policies over the past few years. The main goal of this work is to provide an optimal location planning design for recycling urban solid wastes that fall within the financial budget agreed between the municipal government and the National Bank for Economic and Social Development. Moreover, facility planning involves deciding on the best sites for locating sorting centers along the four-year period as well as finding ways to meet the demand for collecting recyclable materials, given that economic factors, consumer behavior and environmental awareness are inherently uncertain future outcomes. To deal with these issues, we propose a deterministic version of the classical capacity facility location problem, and both a two-stage recourse formulation and risk-averse models to reduce the variability of the second-stage costs. Numerical results suggest that it is possible to improve the current selective collection, as well as hedge against data uncertainty by using stochastic and risk-averse optimization models.     

Randomized broadcast in networks

In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.     

Hydrogen bonding in polymer mixtures

The enthalpy–infrared frequency shift correlation for simple acids and bases is extended to study hydrogen bonding in polymer systems. The acidity of a polymer is calibrated by comparing the shifts in hydroxyl absorption frequency of the acidic polymer when mixed with a series of bases with the corresponding spectral shifts of known acids with the same bases. The basicity of a polymer is calibrated by measuring the hydroxyl frequency shifts of known acids when mixed with the basic polymer. For polymers containing carbonyl groups, the shift in carbonyl absorption is also a measure of basicity. The acidity and basicity constants obtained for polymers are in good agreement with the values for small-molecule analogs. The enthalpies of hydrogen bond formation in polymer mixtures are calculated from the acidity or basicity constants.     

Electronic quasiparticles and evolution of Fermi level spin states in thin magnetic layers

Here we report on high-resolution photoemission of iron layers grown on a W(1 1 0) substrate. The evolution of the substrate states upon sub-monolayer adsorption of Fe atoms leads to a shift in surface state binding energy. For thicker (1 1 0) films, sharp metallic surface states are obtained. Their dispersion displays the signature of quasiparticle renormalization due to dressing with excitations. The energy scale is characteristic for the spin wave spectrum in iron, thereby giving evidence of electron-magnon coupling. Furthermore, it is found that quantum well states occur as a function of layer thickness. These modify the spin density of states at the Fermi level in the ferromagnetic film.     

Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA.     

On the surjectivity of some trace maps

LetK be a commutative ring with a unit element 1. Let Γ be a finite group acting onK via a mapt: Γ→Aut(K). For every subgroupH≤Γ define tr _H :K→K ^H by tr _h (x)=Σ_σ∈H σ(x). We proveTheorem: tr_Γ is surjective onto K ^Γ if and only if tr _P is surjective onto K ^P for every (cyclic) prime order subgroup P of Γ. This is false for certain non-commutative ringsK.