Fixed-node diffusion Monte Carlo computations for closed-shell jellium spheres

Fixed-node diffusion Monte Carlo computations are used to determine the ground state energy and electron density for jellium spheres with up to N = 106 electrons and background densities corresponding to the electron gas parameter 1 less than or equal to r(s)less than or equal to5.62. We analyze the density and size dependence of the surface energy, and we extrapolate our data to the thermodynamic limit. The results agree well with the predictions of density functional computations using the local density approximation. In the case of N = 20, we extend our computation to higher densities and identify a transition between atomic- and jelliumlike nodal structures occurring at the background density corresponding to r(s)=0.13. In this case the local density approximation is unable to reproduce the changes in the correlation energy due to the discontinuous transition in the ground state nodal structure. We discuss the relevance of our results for nonlocal approximations to density functional theory.

Local and semilocal density functional computations for crystals of 1-alkyl-3-methyl-imidazolium salts

The accuracy and reliability of popular density functional approximations for the compounds giving origin to room temperature ionic liquids have been assessed by computing the T=0 K crystal structure of several 1-alkyl-3-methyl-imidazolium salts. Two prototypical exchange-correlation approximations have been considered, i.e., the local density approximation (LDA) and one gradient corrected scheme [PBE-GGA, Phys. Rev. Lett. 77, 3865 (1996)]. Comparison with low-temperature x-ray diffraction data shows that the equilibrium volume predicted by either approximations is affected by large errors, nearly equal in magnitude (~10%), and of opposite sign. In both cases the error can be traced to a poor description of the intermolecular interactions, while the intramolecular structure is fairly well reproduced by LDA and PBE-GGA. The PBE-GGA optimization of atomic positions within the experimental unit cell provides results in good agreement with the x-ray structure. The correct system volume can also be restored by supplementing PBE-GGA with empirical dispersion terms reproducing the r-6 attractive tail of the van der Waals interactions.

Validated ligand binding sites in CCK receptors. Next step: Computer aided design of novel CCK ligands

Computer-aided drug design becomes an important part of G-protein coupled receptors (GPCR) drug discovery process that is applied for improving the efficiency of derivation and optimization of novel ligands. It represents the combination of methods that-use-structural information of a receptor binding site of known ligands to design new ligands. In this report, we give a brief description of ligand binding sites in cholecystokinin and gastrin receptors (CK1R and CCK2R) which were delineated using experimental and computational methods, and then, we show how the validated ligand binding sites can be used to design and improve novel ligands. The translation of the knowledge of ligand-binding sites of different GPCRs to computer-aided design of novel ligands is summarized.

VLSI processor for high-performance arithmetic computations

A high performance VLSI architecture to perform combined multiply-accumulate, divide, and square root operations is proposed. The circuit is highly regular, requires only minimal control, and can be pipelined right down to the bit level. The system can also be reconfigured on every cycle to perform one or more of these operations. The throughput rate for each operation is the same and is wordlength independent. This is achieved using redundant arithmetic. With current CMOS technology, throughput rates in excess of 80 million operations per second are expected.

Structured data access annotations for massively parallel computations

We describe an approach aimed at addressing the issue of joint exploitation of control (stream) and data parallelism in a skeleton based parallel programming environment, based on annotations and refactoring. Annotations drive efficient implementation of a parallel computation. Refactoring is used to transform the associated skeleton tree into a more efficient, functionally equivalent skeleton tree. In most cases, cost models are used to drive the refactoring process. We show how sample use case applications/kernels may be optimized and discuss preliminary experiments with FastFlow assessing the theoretical results. © 2013 Springer-Verlag.

Managing grid computations: An ORC-based approach

In this paper a model of grid computation that supports both heterogeneity and dynamicity is presented. The model presupposes that user sites contain software components awaiting execution on the grid. User sites and grid sites interact by means of managers which control dynamic behaviour. The orchestration language ORC [9,10] offers an abstract means of specifying operations for resource acquisition and execution monitoring while allowing for the possibility of non-responsive hardware. It is demonstrated that ORC is sufficiently expressive to model typical kinds of grid interactions.