Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Software algorithms”

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 109 records · Page 6

Software Requirements Document: Benchmarking Algorithm for RadioNuclide Identification (BARNI)

This document provides the requirements for the Benchmark Algorithm for Radio-Nuclide Identification (BARNI) software, an open-source tool for comparing radionuclide identification algorithm performance. It specifies the requirements for the user interface, maintainability, documentation and testing. In addition, this document outlines the core functionality of the product, which will align with the needs of the Office of Nuclear Smuggling Detection and Deterrence (NSDD). Specifically, these include interoperability with RASE, and compatibility with the FLIR R400.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Secret Life of Quarks: National Computational Infrastructure for Lattice Gauge Theory

The objective of this grant was to develop algorithms and software for the numerical study of quantum chromodynamics (QCD) and of quantum field theories of interest for the understanding of physical phenomena that go beyond the standard model of high energy physics. Thirteen institutions were involved in this effort. The roles of the University of California, Santa Barbara in the project were to supply overall leadership and coordination, and to administer travel funds for participants at institutions that did not receive direct funding from the DOE. The purposes of these trips were to enable collaborative research on algorithms and software, and to report on algorithm and software development, and on scientific results obtained from it, at scientific meetings. These funds were also used to support travel by the Santa Barbara Principal Investigator in support of the project, and by co-Principal Investigators at institutions not receiving DOE funding. A total of 126 trips were supported.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Utilizing High Performance Computing for Chemistry: Parallel Computational Chemistry

Parallel hardware has become readily available to the computational chemistry research community. This perspective will review the current state of parallel computational chemistry software utilizing high-performance parallel computing platforms.Hardware and software trends and their effect on quantum chemistry methodologies, algorithms, and software development will also be discussed.

99 GENERAL AND MISCELLANEOUS↗

Modeling of fracture of protective concrete structures under impact loads

This paper presents results of numerical simulation of interaction between a Boeing 747-400 aircraft and the protective shell of a nuclear power plant. The shell is presented as a complex multilayered cellular structure consisting of layers of concrete and fiber concrete bonded with steel trusses. Numerical simulation was performed three-dimensionally using the original algorithm and software taking into account algorithms for building grids of complex geometric objects and parallel computations. Dynamics of the stress-strain state and fracture of the structure were studied. Destruction is described using a two-stage model that allows taking into account anisotropy of elastic and strength properties of concrete and fiber concrete. It is shown that wave processes initiate destruction of the cellular shell structure; cells start to destruct in an unloading wave originating after the compression wave arrival at free cell surfaces.

36 MATERIALS SCIENCE↗

The WTP Immobilized LAW Formulation Algorithm: Recent Efforts Toward Software Development - 17342

The immobilized low-activity waste (ILAW) product from WTP must meet certain requirements and processing constraints. The strategy for controlling ILAW product composition uses the ILAW formulation algorithm. This algorithm is approved by the DOE Office of River Protection (ORP) for use in calculating melter feed recipes that will produce acceptable ILAW product during Low-Activity Waste (LAW) Facility commissioning. The calculations performed by the algorithm have been demonstrated using a sophisticated spreadsheet, but this spreadsheet is not expected to support continuous operation. Efforts are underway to develop software that will support glass formulation during operation. Recent work toward software development includes an examination of assumptions made in the algorithm about expected LAW Facility operation, and spreadsheet calculations to formulate glass for potential LAW compositions under the direct feed LAW (DFLAW) strategy that ORP has adopted. The documentation of the ILAW algorithm is the planned basis for software development. However, some assumptions made in the current algorithm's mass balance logic do not match the matured design and expected operation of the LAW Facility. A self-assessment effort evaluated the validity of these assumptions by reviewing design documents, in order to identify opportunities to align the algorithm's mass balance logic with the matured design and ensure that the developed software supports continuous LAW Facility operation. Several improvement opportunities were identified and are discussed. The results of ILAW algorithm calculations to formulate glass for eighteen challenging LAW compositions indicate that the current WTP baseline LAW glass models are sufficiently robust to accommodate DFLAW. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Final Report: Quantification of Uncertainty in Extreme Scale Computations (QUEST)

QUEST (\url{www.quest-scidac.org}) is a SciDAC Institute that is focused on uncertainty quantification (UQ) in large-scale scientific computations. Our goals are to (1) advance the state of the art in UQ mathematics, algorithms, and software; and (2) provide modeling, algorithmic, and general UQ expertise, together with software tools, to other SciDAC projects, thereby enabling and guiding a broad range of UQ activities in their respective contexts. QUEST is a collaboration among six institutions (Sandia National Laboratories, Los Alamos National Laboratory, the University of Southern California, Massachusetts Institute of Technology, the University of Texas at Austin, and Duke University) with a history of joint UQ research. Our vision encompasses all aspects of UQ in leadership-class computing. This includes the well-founded setup of UQ problems; characterization of the input space given available data/information; local and global sensitivity analysis; adaptive dimensionality and order reduction; forward and inverse propagation of uncertainty; handling of application code failures, missing data, and hardware/software fault tolerance; and model inadequacy, comparison, validation, selection, and averaging. The nature of the UQ problem requires the seamless combination of data, models, and information across this landscape in a manner that provides a self-consistent quantification of requisite uncertainties in predictions from computational models. Accordingly, our UQ methods and tools span an interdisciplinary space across applied math, information theory, and statistics. The MIT QUEST effort centers on statistical inference and methods for surrogate or reduced-order modeling. MIT personnel have been responsible for the development of adaptive sampling methods, methods for approximating computationally intensive models, and software for both forward uncertainty propagation and statistical inverse problems. A key software product of the MIT QUEST effort is the MIT Uncertainty Quantification library, called MUQ (\url{muq.mit.edu}).

97 MATHEMATICS AND COMPUTING↗

Software Barrier Performance on Dual Quad-Core Opterons

Multi-core processors based SMP servers have become building blocks for Linux clusters in recent years because they can deliver better performance for multi-threaded programs through on-chip multi-threading. However, a relative slow software barrier can hinder the performance of a data-parallel scientific application on a multi-core system. In this paper we study the performance of different software barrier algorithms on a server based on newly introduced AMD quad-core Opteron processors. We study how the memory architecture and the cache coherence protocol of the system influence the performance of barrier algorithms. We present an optimized barrier algorithm derived from the queue-based barrier algorithm. We find that the optimized barrier algorithm achieves speedup of 1.77 over the original queue-based algorithm. In addition, it has speedup of 2.39 over the software barrier generated by the Intel OpenMP compiler.

99 GENERAL AND MISCELLANEOUS↗

Interface for Parallel I/O from Componentized Visualization Algorithms

The software is an interface layer over file I/O with features specifically designed for efficient parallel reads and writes. The interface provides multiple concrete implementations that easily allow the replacement of one interface with another. This feature allows a reader or writer implementation to work independently of whether parallel file I/O is available or desired. The software also contains extensions to some readers to allow it to use the file I/O functionality.

MORELAND, KENNETH↗

Performance Evaluation of the CHKED Multi-Elemental Analysis and Software

The Hybrid K-edge Densitometer (HKED) is a high precision safeguards assay system developed by Ottmar and Eberle [1] for quantification of the U and Pu concentrations of dissolver solutions in spent nuclear fuel reprocessing. The HKED measurement supplements traditional destructive assay methods such as Isotope Dilution Mass Spectrometry (IDMS) and is an essential component of the international safeguards program implementation at these facilities. The Canberra Hybrid K-Edge Densitometry (CHKED) software was recently developed by Canberra Industries to better address the changing composition of the nuclear fuel cycle by addition of a multi-elemental analysis capability to the K-Edge transmission measurement. Our evaluation of the CHKED software was performed at the request of the International Atomic Energy Agency (IAEA) to examine the functionality and performance of the CHKED software and algorithms and identify potential areas for improvement of the software. The reader is assumed to be familiar with the HKED technique and its current implementation in safeguards assay of U and Pu in the nuclear fuel cycle. The Canberra Hybrid K-Edge Densitometry CHKED software replicates functionality of the older VMSbased Hybrid K-Edge Densitometer (HKED) software and incorporates additional analysis algorithms and tools. When the traditional HKED analyses are selected, the CHKED software appears to faithfully reproduce the measurement results as reported by the older software. The CHKED software includes a Multi-elemental K-Edge (MEKED) analysis based in part on algorithms devised at Los Alamos National Laboratory. In principle, the MEKED analysis represents a significant advancement over the traditional HKED analysis, providing a capability to analyze the actinide concentrations from complex solutions, such as low U:Pu ratios (e.g., U:Pu = 1:1) including additional minor actinide components such as Np and Am. However, this MEKED analysis is somewhat limited by reliance on a region of interest (ROI) analysis of the spectrum, the need for extensive calibration measurements and a simplistic interpretation of the KED transmission spectrum. Finally, the MEKED algorithm set associated with the CHKED software (V1.0) acquired by Oak Ridge National Laboratory (ORNL) from Canberra Industries does not seem to be “finished” (e.g., the MEKED analysis seems to only determine measurement results for two actinides with while results for the minor actinides appear to be highly dependent on declaration values).

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware

For a considerable time, large datasets containing problem instances have proven valuable for analyzing computer hardware, software, and algorithms. One notable example of the value of large datasets is ImageNet [1], a vast repository of images that has been instrumental in testing numerous deep learning packages. Similarly, in the domain of computational chemistry and materials science, the availability of extensive datasets such as the Protein Data Bank [2], the Materials Project [3], and QM9 [4] has greatly facilitated the evaluation of new algorithms and software approaches, while also promoting standardization within the field. These well-defined datasets and problem instances, in turn, serve as the foundation for creating benchmarking suites like MLPerf [5] and LINPACK [6], [7]. These suites enable fair and rigorous comparisons of different methodologies and solutions, fostering continuous advancements in various areas of computer science and beyond.

Sawaya, Nicolas PD↗

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

fast-matmul

This software provides implementations of fast matrix multiplication algorithms. These algorithms perform fewer floating point operations than the classical cubic algorithm. The software uses code generation to automatically implement the fast algorithms based on high-level descriptions. The code serves two general purposes. The first is to demonstrate that these fast algorithms can out-perform vendor matrix multiplication algorithms for modest problem sizes on a single machine. The second is to rapidly prototype many variations of fast matrix multiplication algorithms to encourage future research in this area. The implementations target sequential and shared memory parallel execution.

Ballard, Grey↗

fast-matmul

This software provides implementations of fast matrix multiplication algorithms. These algorithms perform fewer floating point operations than the classical cubic algorithm. The software uses code generation to automatically implement the fast algorithms based on high-level descriptions. The code serves two general purposes. The first is to demonstrate that these fast algorithms can out-perform vendor matrix multiplication algorithms for modest problem sizes on a single machine. The second is to rapidly prototype many variations of fast matrix multiplication algorithms to encourage future research in this area. The implementations target sequential and shared memory parallel execution.

Grey Ballard, Austin Benson↗

Comparison of sleep parameters from wrist-worn ActiGraph and Actiwatch devices

Abstract Sleep and physical activity, two important health behaviors, are often studied independently using different accelerometer types and body locations. Understanding whether accelerometers designed for monitoring each behavior can provide similar sleep parameter estimates may help determine whether one device can be used to measure both behaviors. Three hundred and thirty one adults (70.7 ± 13.7 years) from the Baltimore Longitudinal Study of Aging wore the ActiGraph GT9X Link and the Actiwatch 2 simultaneously on the non-dominant wrist for 7.0 ± 1.6 nights. Total sleep time (TST), wake after sleep onset (WASO), sleep efficiency, number of wake bouts, mean wake bout length, and sleep fragmentation index (SFI) were extracted from ActiGraph using the Cole–Kripke algorithm and from Actiwatch using the software default algorithm. These parameters were compared using paired t-tests, Bland–Altman plots, and Deming regression models. Stratified analyses were performed by age, sex, and body mass index (BMI). Compared to the Actiwatch, the ActiGraph estimated comparable TST and sleep efficiency, but fewer wake bouts, longer WASO, longer wake bout length, and higher SFI (all p < .001). Both devices estimated similar 1-min and 1% differences between participants for TST and SFI (β = 0.99, 95% CI: 0.95, 1.03, and 0.91, 1.13, respectively), but not for other parameters. These differences varied by age, sex, and/or BMI. The ActiGraph and the Actiwatch provide comparable absolute and relative estimates of TST, but not other parameters. The discrepancies could result from device differences in movement collection and/or sleep scoring algorithms. Further comparison and calibration is required before these devices can be used interchangeably.

Liu, Fangyu (ORCID:0000000315541478)↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Iterative multi-task learning and inference from seismic images

Seismic interpretation aims to extract quantitative and interpretable attributes from a seismic image produced using some migration method to inform characteristics of a subsurface reservoir or target of interest. Current paradigms for computing seismic attributes mostly rely on single-task algorithms. We develop an iterative, multi-task machine learning method to learn and infer multiple attributes from a seismic image. This method is composed of two stages: a multi-task inference stage and a multi-modal, multi-task refinement stage. The basic mechanism of this method is that we train a multi-task inference neural network (NN) to estimate a set of attributes, including a relative geological time (RGT), a denoised higher-resolution (DHR) seismic image, and multiple fault attributes (including probability, dip, and strike), from a low-resolution, noisy seismic image; then we input the inferred attributes to a multi-task refinement NN to enhance the raw inference results iteratively. The two multi-task NNs are trained separately based on synthetic seismic images and associated attributes generated by a geological modeling algorithm. The software we intend to release is a PyTorch implementation of this multi-task learning method for both 2D and 3D cases along with scripts to run the training/validation. The algorithm and software can be a useful tool for automatic seismic interpretation.

Gao, Kai↗

Software Requirement Document: Benchmarking Algorithms for RadioNuclide Identification (BARNI)

The Department of Energy (DOE) Office of Nuclear Smuggling Detection and Deterrence (NSDD) seeks to improve the performance of RadioIsotope Identification Devices (RIIDs). RIIDs enable users to identifying threat nuclides in applications such as secondary search, facility inspection, and emergency response. As part of this effort NSDD has developed Replicative Assessment of Spectroscopic Equipment (RASE), an open-source tool which generates synthetic spectra and analyzes them with vendor’s radionuclide identification software in order to evaluate performance.

61 RADIATION PROTECTION AND DOSIMETRY↗

A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits

The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗