Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗

Extending Moore's Law via Computationally Error Tolerant Computing.

Dennard scaling has ended. Lowering the voltage supply (V dd ) to sub-volt levels causes intermittent losses in signal integrity, rendering further scaling (down) no longer acceptable as a means to lower the power required by a processor core. However, it is possible to correct the occasional errors caused due to lower V dd in an efficient manner and effectively lower power. By deploying the right amount and kind of redundancy, we can strike a balance between overhead incurred in achieving reliability and energy savings realized by permitting lower V dd . One promising approach is the Redundant Residue Number System (RRNS) representation. Unlike other error correcting codes, RRNS has the important property of being closed under addition, subtraction and multiplication, thus enabling computational error correction at a fraction of an overhead compared to conventional approaches. We use the RRNS scheme to design a Computationally-Redundant, Energy-Efficient core, including the microarchitecture, Instruction Set Architecture (ISA) and RRNS centered algorithms. Finally, from the simulation results, this RRNS system can reduce the energy-delay-product by about 3× for multiplication intensive workloads and by about 2× in general, when compared to a non-error-correcting binary core.

97 MATHEMATICS AND COMPUTING↗

Cosmic reionization on computers: the faint end of the galaxy luminosity function

Using numerical cosmological simulations completed under the “Cosmic Reionization On Computers” project, I explore theoretical predictions for the faint end of the galaxy UV luminosity functions at z≳6. A commonly used Schechter function approximation with the magnitude cut at M{sub cut}∼−13 provides a reasonable fit to the actual luminosity function of simulated galaxies. When the Schechter functional form is forced on the luminosity functions from the simulations, the magnitude cut M{sub cut} is found to vary between −12 and −14 with a mild redshift dependence. An analytical model of reionization from Madau et al., as used by Robertson et al., provides a good description of the simulated results, which can be improved even further by adding two physically motivated modifications to the original Madau et al. equation.

79 ASTRONOMY AND ASTROPHYSICS↗

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: performing, for each node, a local reduction operation using allreduce contribution data for the cores of that node, yielding, for each node, a local reduction result for one or more representative cores for that node; establishing one or more logical rings among the nodes, each logical ring including only one of the representative cores from each node; performing, for each logical ring, a global allreduce operation using the local reduction result for the representative cores included in that logical ring, yielding a global allreduce result for each representative core included in that logical ring; and performing, for each node, a local broadcast operation using the global allreduce results for each representative core on that node.

97 MATHEMATICS AND COMPUTING↗

Performing an allreduce operation on a plurality of compute nodes of a parallel computer

Methods, apparatus, and products are disclosed for performing an allreduce operation on a plurality of compute nodes of a parallel computer, each node including at least two processing cores, that include: establishing, for each node, a plurality of logical rings, each ring including a different set of at least one core on that node, each ring including the cores on at least two of the nodes; iteratively for each node: assigning each core of that node to one of the rings established for that node to which the core has not previously been assigned, and performing, for each ring for that node, a global allreduce operation using contribution data for the cores assigned to that ring or any global allreduce results from previous global allreduce operations, yielding current global allreduce results for each core; and performing, for each node, a local allreduce operation using the global allreduce results.

97 MATHEMATICS AND COMPUTING↗

The Radiation Safety Information Computational Center (RSICC) - A Resource for Computational Tools for Nuclear Applications

The Radiation Safety Information Computational Center (RSICC), which has been in existence since 1963, is the principal source and repository in the United States for computational tools for nuclear applications. RSICC collects, organizes, evaluates and distributes nuclear software and data involving the transport of neutral and charged particle radiation, and shielding and protection from radiation associated with nuclear weapons and materials, fission and fusion reactors, outer space, accelerators, medical facilities, and nuclear waste. RSICC serves over 12,000 scientists and engineers from 94 countries. RSICC software provides in-depth coverage of radiation related topics: the physics of the interaction of radiation with matter, radiation production and sources, criticality safety, radiation protection and shielding, radiation detectors and measurements, shielding materials properties, radiation waste management, atmospheric dispersion and environmental dose, medical applications, macro- and micro-dosimetry calculations.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Computer Architecture's Changing Role in Rebooting Computing

In this paper, Windows 95 started the Wintel era, in which Microsoft Windows running on Intel x86 microprocessors dominated the computer industry and changed the world. Retaining the x86 instruction set across many generations let users buy new and more capable microprocessors without having to buy software to work with new architectures.

97 MATHEMATICS AND COMPUTING↗

Computational simulation of vibrationally resolved spectra for spin‐forbidden transitions

Abstract In this computational study, we illustrate a method for computing phosphorescence and circularly polarized phosphorescence spectra of molecular systems, which takes into account vibronic effects including both Franck‐Condon and Herzberg‐Teller contributions. The singlet and triplet states involved in the phosphorescent emission are described within the harmonic approximation, and the method fully takes mode‐mixing effects into account when evaluating Franck‐Condon integrals. Spin‐orbit couplings, which are responsible for these otherwise forbidden phenomena, are accounted for by means of a relativistic two‐component time‐dependent density functional theory method. The model is applied to two types of chiral systems: camphorquinone, a rigid organic system that allows for an extensive benchmark, and some members of a class of iridium complexes. The merits and shortcomings of the methods are discussed, and some perspectives for future developments are offered.

Egidi, Franco↗

Computer-Assisted Diagnosis System for Breast Cancer in Computed Tomography Laser Mammography (CTLM)

Computed tomography laser mammography (Eid et al. Egyp J Radiol Nucl Med, 37(1): p. 633–643, 1) is a non-invasive imaging modality for breast cancer diagnosis, which is time-consuming and challenging for the radiologist to interpret the images. Some issues have increased the missed diagnosis of radiologists in visual manner assessment in CTLM images, such as technical reasons which are related to imaging quality and human error due to the structural complexity in appearance. The purpose of this study is to develop a computer-aided diagnosis framework to enhance the performance of radiologist in the interpretation of CTLM images. The proposed CAD system contains three main stages including segmentation of volume of interest (VOI), feature extraction and classification. A 3D Fuzzy segmentation technique has been implemented to extract the VOI. The shape and texture of angiogenesis in CTLM images are significant characteristics to differentiate malignancy or benign lesions. The 3D compactness features and 3D Grey Level Co-occurrence matrix (GLCM) have been extracted from VOIs. Multilayer perceptron neural network (MLPNN) pattern recognition has developed for classification of the normal and abnormal lesion in CTLM images. The performance of the proposed CAD system has been measured with different metrics including accuracy, sensitivity, and specificity and area under receiver operative characteristics (AROC), which are 95.2, 92.4, 98.1, and 0.98%, respectively.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Kinetic-j : A computational kernel for solving the linearized Vlasov equation applied to calculations of the kinetic, configuration space plasma current for time harmonic wave electric fields

We present the Kinetic-j code, a computational kernel for evaluating the linearized Vlasov equation withapplication to calculating the kinetic plasma response (current) to an applied time harmonic wave electricfield. This code addresses the need for a configuration space evaluation of the plasma current to enablekinetic full-wave solvers for waves in hot plasmas to move beyond the limitations of the traditional Fourierspectral methods. We benchmark the kernel via comparison with the standard k-space forms of the hotplasma conductivity tensor.

Green, David L.↗

Application of X-ray computed tomography for the characterization of graphite morphology in compact-graphite iron

Highlights: • X-ray Tomography is a powerful technique for graphite morphology characterization. • 3D characterization reveals true nodularity and spatial connectivity of graphite. • Tri-modal distribution of SG suggests a multi-stage graphite nucleation process. - Abstract: In the present study, high-energy X-ray tomography technique was used to characterize the graphite morphology of compact graphite iron. The size, shape, spatial connectivity and structure of different graphite morphologies were examined in 3D using computer-aided image analysis. In addition, nodularity analysis was performed in 3D and the results are compared to the traditional 2D technique. It is found that the variation of nodularity within 2 × 2 × 1.2 mm{sup 3} of the sample can be as high as 20 (%) from 2D analysis and the averaged nodularity (2D) is higher than that from 3D analysis. The size distribution of spheroidal graphite shows a tri-modal distribution, which suggests a multi-step nucleation process during solidification.

36 MATERIALS SCIENCE↗

Exploring the Impact of Nuclear Data Uncertainties in Ultra-high Resolution Gamma Spectroscopy for Isotopic Analysis Using Approximate Bayesian Computation

High purity germanium (HPGe) currently provides the highest readily available resolution gamma detection for a broad range of radiation measurements, but microcalorimetry is a developing option that has considerably higher resolution even than HPGe. Superior microcalorimetry resolution offers the potential to better distinguish closely spaced X-rays and gamma-rays, a common challenge for the low energy spectral region near 100 keV from special nuclear materials, and the higher signal-to-background ratio also confers an advantage in detection limit. As microcalorimetry continues to develop, it is timely to assess the impact of uncertainties in detector and item response functions and in basic nuclear data, such as branching ratios and half-lives, used to interpret spectra in terms of the contributory radioactive isotopes. We illustrate that a new inference option known as approximate Bayesian computation (ABC) is effective and convenient both for isotopic inference and for uncertainty quantification for microcalorimetry. The ABC approach opens a pathway to new and more powerful implementations for practical applications than currently available.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗