Institution
Sandia National Laboratories
Facility•Livermore, California, United States•
About: Sandia National Laboratories is a facility organization based out in Livermore, California, United States. It is known for research contribution in the topics: Laser & Thin film. The organization has 21501 authors who have published 46724 publications receiving 1484388 citations. The organization is also known as: SNL & Sandia National Labs.
Topics: Laser, Thin film, Hydrogen, Combustion, Silicon
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, the authors review the experimental procedures used in FIM surface diffusion studies and discuss the results in relation to the atomistics of crystal and epitaxial growth processes.
342 citations
••
Pacific Northwest National Laboratory1, Lawrence Berkeley National Laboratory2, National Center for Computational Sciences3, Brookhaven National Laboratory4, Argonne National Laboratory5, Intel6, University of Texas at Arlington7, State University of New York System8, Pennsylvania State University9, Oak Ridge National Laboratory10, Washington University in St. Louis11, Wellesley College12, Maria Curie-Skłodowska University13, Iowa State University14, Academy of Sciences of the Czech Republic15, University of Tennessee at Martin16, Université libre de Bruxelles17, Facebook18, Russian Academy of Sciences19, University of Minnesota20, University of Washington21, United States Naval Research Laboratory22, Georgia Institute of Technology23, University of St Andrews24, Universidad Autónoma Metropolitana25, University of California, San Diego26, Saarland University27, Sandia National Laboratories28, University of Illinois at Urbana–Champaign29, University of Iceland30, Australian National University31, Florida Institute of Technology32, University of Science and Technology of China33, Oswaldo Cruz Foundation34, Cardiff University35, Louisiana State University36, Chinese Academy of Sciences37, National Autonomous University of Mexico38, University of Florida39, Los Alamos National Laboratory40, University of Oviedo41, Prince of Songkla University42, Ames Laboratory43, University of Utah44, Northwestern University45, Universal Display Corporation46, Federal University of Pernambuco47, CD-adapco48, Cray49, Massachusetts Institute of Technology50, Nvidia51, University of Tennessee52, Shandong Normal University53, University of Cambridge54, Advanced Micro Devices55, Technische Universität München56, Stanford University57, Wuhan University of Technology58, Stony Brook University59
TL;DR: The NWChem computational chemistry suite is reviewed, including its history, design principles, parallel tools, current capabilities, outreach, and outlook.
Abstract: Specialized computational chemistry packages have permanently reshaped the landscape of chemical and materials science by providing tools to support and guide experimental efforts and for the prediction of atomistic and electronic properties. In this regard, electronic structure packages have played a special role by using first-principle-driven methodologies to model complex chemical and materials processes. Over the past few decades, the rapid development of computing technologies and the tremendous increase in computational power have offered a unique chance to study complex transformations using sophisticated and predictive many-body techniques that describe correlated behavior of electrons in molecular and condensed phase systems at different levels of theory. In enabling these simulations, novel parallel algorithms have been able to take advantage of computational resources to address the polynomial scaling of electronic structure methods. In this paper, we briefly review the NWChem computational chemistry suite, including its history, design principles, parallel tools, current capabilities, outreach, and outlook.
342 citations
••
05 Jan 2009TL;DR: Performance of PCE and SC is shown to be very similar, although when differences are evident, SC is the consistent winner over traditional PCE formulations, and this performance gap can be reduced, and in some cases, eliminated.
Abstract: Non-intrusive polynomial chaos expansion (PCE) and stochastic collocation (SC) methods are attractive techniques for uncertainty quantification (UQ) due to their strong mathematical basis and ability to produce functional representations of stochastic variability PCE estimates coefficients for known orthogonal polynomial basis functions based on a set of response function evaluations, using sampling, linear regression, tensor-product quadrature, or Smolyak sparse grid approaches SC, on the other hand, forms interpolation functions for known coefficients, and requires the use of structured collocation point sets derived from tensor-products or sparse grids When tailoring the basis functions or interpolation grids to match the forms of the input uncertainties, exponential convergence rates can be achieved with both techniques for general probabilistic analysis problems In this paper, we explore relative performance of these methods using a number of simple algebraic test problems, and analyze observed differences In these computational experiments, performance of PCE and SC is shown to be very similar, although when differences are evident, SC is the consistent winner over traditional PCE formulations This stems from the practical difficulty of optimally synchronizing the formof the PCE with the integration approach being employed, resulting in slight over- or under-integration of prescribed expansion form With additional nontraditional tailoring of PCE form, it is shown that this performance gap can be reduced, and in some cases, eliminated
341 citations
••
TL;DR: It is demonstrated that computer analysis of mammograms can provide a substantial and statistically significant increase in radiologist screening efficacy.
Abstract: PURPOSE: To study the use of a computer vision method as a second reader for the detection of spiculated lesions on screening mammograms. MATERIALS AND METHODS: An algorithmic computer process for the detection of spiculated lesions on digitized screen-film mammograms was applied to 85 four-view clinical cases: 36 cases with cancer proved by means of biopsy and 49 cases with negative findings at examination and follow-up. The computer detections were printed as film with added outlines that indicated the suspected cancers. Four radiologists screened the 85 cases twice, once without and once with the computer reports as ancillary films. RESULTS: The algorithm alone achieved 100% sensitivity, with a specificity of 82%. The computer reports increased the average radiologist sensitivity by 9.7% (P = .005), moving from 80.6% to 90.3%, with no decrease in average specificity. CONCLUSION: The study demonstrated that computer analysis of mammograms can provide a substantial and statistically significant increase ...
341 citations
••
22 Feb 2004TL;DR: This paper examines the impact of Moore's Law on the peak floating-point performance of FPGAs and results show that peak FPGA floating- point performance is growing significantly faster than peak CPU performance for a CPU.
Abstract: Moore's Law states that the number of transistors on a device doubles every two years; however, it is often (mis)quoted based on its impact on CPU performance. This important corollary of Moore's Law states that improved clock frequency plus improved architecture yields a doubling of CPU performance every 18 months. This paper examines the impact of Moore's Law on the peak floating-point performance of FPGAs. Performance trends for individual operations are analyzed as well as the performance trend of a common instruction mix (multiply accumulate). The important result is that peak FPGA floating-point performance is growing significantly faster than peak floating-point performance for a CPU.
341 citations
Authors
Showing all 21652 results
Name | H-index | Papers | Citations |
---|---|---|---|
Lily Yeh Jan | 162 | 467 | 73655 |
Jongmin Lee | 150 | 2257 | 134772 |
Jun Liu | 138 | 616 | 77099 |
Gerbrand Ceder | 137 | 682 | 76398 |
Kevin M. Smith | 114 | 1711 | 78470 |
Henry F. Schaefer | 111 | 1611 | 68695 |
Thomas Bein | 109 | 677 | 42800 |
David Chandler | 107 | 424 | 52396 |
Stephen J. Pearton | 104 | 1913 | 58669 |
Harold G. Craighead | 101 | 569 | 40357 |
Edward Ott | 101 | 669 | 44649 |
S. Das Sarma | 100 | 951 | 58803 |
Richard M. Crooks | 97 | 419 | 31105 |
David W. Murray | 97 | 699 | 43372 |
Alán Aspuru-Guzik | 97 | 628 | 44939 |