Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Programming”

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 1,441 records · Page 80
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Modern quantum chemistry with [Open]Molcas

MOLCAS/OpenMolcas is an ab initio electronic structure program providing a large set of computational methods from Hartree–Fock and density functional theory to various implementations of multiconfigurational theory. This article provides a comprehensive overview of the main features of the code, specifically reviewing the use of the code in previously reported chemical applications as well as more recent applications including the calculation of magnetic properties from optimized density matrix renormalization group wave functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors

We introduce a Xilinx RF System-on-Chip (RFSoC)-based qubit controller (called the Quantum Instrumentation Control Kit, or QICK for short), which supports the direct synthesis of control pulses with carrier frequencies of up to 6 GHz. The QICK can control multiple qubits or other quantum devices. The QICK consists of a digital board hosting an RFSoC field-programmable gate array, custom firmware, and software and an optional companion custom-designed analog front-end board. We characterize the analog performance of the system as well as its digital latency, important for quantum error correction and feedback protocols. We benchmark the controller by performing standard characterizations of a transmon qubit. We achieve an average gate fidelity of ℱ avg =99.93%. All of the schematics, firmware, and software are open-source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Integration of scanning probe microscope with high-performance computing: Fixed-policy and reward-driven workflows implementation

The rapid development of computation power and machine learning algorithms has paved the way for automating scientific discovery with a scanning probe microscope (SPM). The key elements toward operationalization of the automated SPM are the interface to enable SPM control from Python codes, availability of high computing power, and development of workflows for scientific discovery. Here, we build a Python interface library that enables controlling an SPM from either a local computer or a remote high-performance computer, which satisfies the high computation power need of machine learning algorithms in autonomous workflows. We further introduce a general platform to abstract the operations of SPM in scientific discovery into fixed-policy or reward-driven workflows. Furthermore, our work provides a full infrastructure to build automated SPM workflows for both routine operations and autonomous scientific discovery with machine learning.

47 OTHER INSTRUMENTATION↗
DOE OSTI2014

Cosmic reionization on computers. I. Design and calibration of simulations

Cosmic Reionization On Computers is a long-term program of numerical simulations of cosmic reionization. Its goal is to model fully self-consistently (albeit not necessarily from the first principles) all relevant physics, from radiative transfer to gas dynamics and star formation, in simulation volumes of up to 100 comoving Mpc, and with spatial resolution approaching 100 pc in physical units. In this method paper, we describe our numerical method, the design of simulations, and the calibration of numerical parameters. Using several sets (ensembles) of simulations in 20 h {sup –1} Mpc and 40 h {sup –1} Mpc boxes with spatial resolution reaching 125 pc at z = 6, we are able to match the observed galaxy UV luminosity functions at all redshifts between 6 and 10, as well as obtain reasonable agreement with the observational measurements of the Gunn-Peterson optical depth at z < 6.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Tractable minor-free generalization of planar zero-field Ising models

In this work, we present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive 'gluing' of planar and O(1)-sized components and subsets of at most three vertices into a tree. The polynomial time algorithm of the dynamic programming type for solving exact inference (computing partition function) and exact sampling (generating i.i.d. samples) consists of sequential application of an efficient (for planar) or brute-force (for O(1)-sized) inference and sampling to the components as a black box. To illustrate the utility of the new family of tractable graphical models, we first build a polynomial algorithm for inference and sampling of zero-field Ising models over K 33 -minor-free topologies and over K 5 -minor-free topologies—both of which are extensions of the planar zero-field Ising models—which are neither genus- nor treewidth-bounded. Second, we empirically demonstrate an improvement in the approximation quality of the NP-hard problem of inference over the square-grid Ising model in a node-dependent nonzero 'magnetic' field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints

Abstract Background Genome-scale metabolic network models and constraint-based modeling techniques have become important tools for analyzing cellular metabolism. Thermodynamically infeasible cycles (TICs) causing unbounded metabolic flux ranges are often encountered. TICs satisfy the mass balance and directionality constraints but violate the second law of thermodynamics. Current practices involve implementing additional constraints to ensure not only optimal but also loopless flux distributions. However, the mixed integer linear programming problems required to solve become computationally intractable for genome-scale metabolic models. Results We aimed to identify the fewest needed constraints sufficient for optimality under the loopless requirement. We found that loopless constraints are required only for the reactions that share elementary flux modes representing TICs with reactions that are part of the objective function. We put forth the concept of localized loopless constraints (LLCs) to enforce this minimal required set of loopless constraints. By combining with a novel procedure for minimal null-space calculation, the computational time for loopless flux variability analysis (ll-FVA) is reduced by a factor of 10–150 compared to the original loopless constraints and by 4–20 times compared to the current fastest method Fast-SNP with the percent improvement increasing with model size. Importantly, LLCs offer a scalable strategy for loopless flux calculations for multi-compartment/multi-organism models of large sizes, for example, shortening the CPU time for ll-FVA from 35 h to less than 2 h for a model with more than104 reactions. Availability and implementation Matlab functions are available in the Supplementary Material or at https://github.com/maranasgroup/lll-FVA Supplementary information Supplementary data are available at Bioinformatics online.

Chan, Siu H. J. (ORCID:000000027707656X)↗
DOE OSTI2015

An Approach to Selecting Thread + Process Mixes for Hybrid MPI + OpenMP Applications, In: 2015 IEEE International Conference on Cluster Computing

Hybrid MPI + OpenMP is a popular means of programming modern machines that feature substantial parallelism both off-node and on-node. Determining the right mix of the two programming models to use, however, is not as straightforward as simply using exclusively OpenMP on-node and limiting MPI to only inter-node communication. We present a step-by-step methodology to help make the decision of which mix of the two programming models to use. It starts with an estimate of the performance of a generic hybrid application on a given machine and incorporates additional available information about the specific application and the machine to provide guidance for selecting effective mixes of MPI processes and OpenMP threads to use when running that application on the machine in question. We validate our approach on four different applications on an IBM Blue Gene/Q, a Cray XK7, and a Cray XC30.

Computer Science↗
DOE OSTI2018

Autotuning in High-Performance Computing Applications

Autotuning refers to the automatic generation of a search space of possible implementations of a computation that are evaluated through models and/or empirical measurement to identify the most desirable implementation. Autotuning has the potential to dramatically improve the performance portability of petascale and exascale applications. To date, autotuning has been used primarily in high-performance applications through tunable libraries or previously tuned application code that is integrated directly into the application. This paper draws on the authors' extensive experience applying autotuning to high-performance applications, describing both successes and future challenges. If autotuning is to be widely used in the HPC community, researchers must address the software engineering challenges, manage configuration overheads, and continue to demonstrate significant performance gains and portability across architectures. In particular, tools that configure the application must be integrated into the application build process so that tuning can be reapplied as the application and target architectures evolve.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Delivering Science on Day One

While benchmarking software is useful for testing the performance limits and stability of Argonne National Laboratory’s new Theta supercomputer, there is no substitute for running real applications to explore the system’s potential. The Argonne Leadership Computing Facility’s Theta Early Science Program, modeled after its highly successful code migration program for the Mira supercomputer, has one primary aim: to deliver science on day one. Here is a closer look at the type of science problems that will be getting early access to Theta, a next-generation machine being rolled out this year.

Williams, Timothy J.↗
DOE OSTI2024

Providing a Flexible and Comprehensive Software Stack Via Spack, an Extreme-Scale Scientific Software Stack, and Software Development Kits

To manage the complex demands of modern high-performance computing (HPC), software applications increasingly depend on software developed by other teams, often at other institutions. An HPC software ecosystem approach is required to support dependencies on third-party scientific software. An ecosystem approach provides layers of activity above the individual software product level that promote interoperability, quality improvement, porting, testing, and deployment. The U.S. Exascale Computing Project (ECP) developed its HPC software ecosystem using a three-pronged approach. First, the ECP adopted and invested in Spack, a package manager designed to handle complex HPC package dependencies. Second, the ECP created the Extreme Scale Scientific Software Stack, an effort that supports developing, deploying, and running scientific applications on HPC platforms. Third, the ECP supported software product communities, or software development kits, to develop and promote best practices, improve software interoperability, and other collaborative efforts. This article describes ECP contributions to HPC software ecosystem challenges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗
DOE OSTI2024

Endogenizing Probabilistic Resource Adequacy Risks in Deterministic Capacity Expansion Models

In this work, we demonstrate how power system capacity expansion models can understate the stochastic effects of thermal outages when considering resource availabilities on an hourly expected value basis, yielding system designs with multiple orders of magnitude more shortfall risk than stated adequacy targets. We develop a novel approximation approach to efficiently endogenize awareness of this risk in a deterministic, linear capacity expansion framework. We compare this approach to exogenous tuning of an energy reserve margin, the leading alternative method to compensate for unmodeled probabilistic shortfall risk. Empirical results from a test system show that the new endogenous method cost-effectively meets all regional reliability targets with a single optimization solve, and produces a near-identical system design as the incumbent method without the need for repeated re-optimizations to find an appropriate reserve level. The endogenous method may also use iterative re-optimizations to further improve solution quality, although these incremental benefits were modest in the system studied.

capacity expansion modeling↗
DOE OSTI2022

Real-Time Hardware-in-The-Loop Implementation of Protection and Self-Healing of Microgrids

The design of a reliable protection scheme for microgrids often requires communication between protective devices and microgrid controllers. The authors have developed such a communication assisted scalable protection scheme with a self healing feature to protect a microgrid with 100% Inverter Based Resources (IBRs). The communication assisted scheme must be validated in real time with cyber physical co-simulation for successful demonstration. In this regard, the paper presents a co-simulation platform between a simulated power system model using RTDS and physical protective devices. The primary protection of the scheme is programmed in SEL 421-7 relay and backup protection is programmed in MATLAB on a generic computer acting as a microgrid controller. The IEC 61850 models are used to communicate between SEL-421-7 relay and RTDS, whereas TCP/IP communication connects the microgrid controller to RTDS. The paper’s focus is to demonstrate the co- simulation platform with communication links established using both protocols and validate the proposed scheme in real-time on the IEEE 123 node distribution feeder. The paper explains the configuration of the IEC 61850 and TCP/IP communications as the interface requires proper hardware and software setup. Furthermore, the real time performance indicates the Hardware In the Loop (HIL) framework as a competent testing environment for the developed protection scheme for microgrids.

42 ENGINEERING↗
DOE OSTI2017

On Parallelizing Single Dynamic Simulation Using HPC Techniques and APIs of Commercial Software

Time-domain simulations are heavily used in today’s planning and operation practices to assess power system transient stability and post-transient voltage/frequency profiles following severe contingencies to comply with industry standards. Because of the increased modeling complexity, it is several times slower than real time for state-of-the-art commercial packages to complete a dynamic simulation for a large-scale model. With the growing stochastic behavior introduced by emerging technologies, power industry has seen a growing need for performing security assessment in real time. This paper presents a parallel implementation framework to speed up a single dynamic simulation by leveraging the existing stability model library in commercial tools through their application programming interfaces (APIs). Several high performance computing (HPC) techniques are explored such as parallelizing the calculation of generator current injection, identifying fast linear solvers for network solution, and parallelizing data outputs when interacting with APIs in the commercial package, TSAT. The proposed method has been tested on a WECC planning base case with detailed synchronous generator models and exhibits outstanding scalable performance with sufficient accuracy.

Diao, Ruisheng↗
DOE OSTI2012

Clinical evaluations of an amplitude-based binning algorithm for 4DCT reconstruction in radiation therapy

Purpose: Phase-binning algorithms are commonly utilized in 4DCT image reconstruction for characterization of tumor or organ shape and respiration motion, but breathing irregularities occurring during 4DCT acquisition can cause considerable image distortions. Recently, amplitude-binning algorithms have been evaluated as a potential improvement to phase-binning algorithms for 4DCT image reconstruction. The purpose of this study was to evaluate the performance of the first commercially available on-line retrospective amplitude-binning algorithm for comparison to the traditional phase-binning algorithm. Methods: Both phantom and clinical data were used for evaluation. A phantom of known geometry was mounted on a 4D motion platform programmed with seven respiratory waves (two computer generated and five patient trajectories) and scanned with a Philips Brilliance Big bore 16-slice CT simulator. 4DCT images were reconstructed using commercial amplitude- and phase-binning algorithms. Image quality of the amplitude- and phase-binned image sets was compared by evaluation of shape and volume distortions in reconstructed images. Clinical evaluations were performed on 64 4DCT patient image sets in a blinded review process. The amplitude- and phase-binned 4DCT maximum intensity projection (MIP) images were further evaluated for 28 stereotactic body radiation therapy (SBRT) cases of total 64 cases. A preliminary investigation of the effects of respiratory amplitude and pattern irregularities on motion artifact severity was conducted. Results: The phantom experiments illustrated that, as expected, maximum inhalation occurred at the 0% amplitude and maximum exhalation occurred at the 50% amplitude of the amplitude-binned 4DCT image sets. The phantom shape distortions were more severe in the images reconstructed from the phase-binning algorithm. In the clinical study, compared to the phase-binning algorithm, the amplitude-binning algorithm yielded fewer or less severe motion artifacts in 37.5% of the cases (24/64), comparable artifacts in 54.7% of the cases (35/64), and slightly greater artifacts in 7.8% of the cases (5/64). Evaluation of SBRT cases demonstrated that the reconstructed tumor sizes and locations were comparable in 96% (1/28) of the MIP image pairs generated from both amplitude- and phase-binning algorithms. In this case the amplitude-binned image set rendered a smaller tumor size, which was likely due to very shallow respiratory amplitudes occurring over several breathing cycles. Conclusions: Overall, the amplitude-binning algorithm for 4DCT reconstruction reduced the severity of tumor distortion and image artifacts compared to the phase-binning algorithm. However, the full range of motion may not be characterized using amplitude-binning algorithms. Despite superior performance, amplitude binning can still be susceptible to motion artifacts caused by large variations in amplitude of respiratory waves.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

Latent uncertainties of the precalculated track Monte Carlo method

Purpose: While significant progress has been made in speeding up Monte Carlo (MC) dose calculation methods, they remain too time-consuming for the purpose of inverse planning. To achieve clinically usable calculation speeds, a precalculated Monte Carlo (PMC) algorithm for proton and electron transport was developed to run on graphics processing units (GPUs). The algorithm utilizes pregenerated particle track data from conventional MC codes for different materials such as water, bone, and lung to produce dose distributions in voxelized phantoms. While PMC methods have been described in the past, an explicit quantification of the latent uncertainty arising from the limited number of unique tracks in the pregenerated track bank is missing from the paper. With a proper uncertainty analysis, an optimal number of tracks in the pregenerated track bank can be selected for a desired dose calculation uncertainty. Methods: Particle tracks were pregenerated for electrons and protons using EGSnrc and GEANT4 and saved in a database. The PMC algorithm for track selection, rotation, and transport was implemented on the Compute Unified Device Architecture (CUDA) 4.0 programming framework. PMC dose distributions were calculated in a variety of media and compared to benchmark dose distributions simulated from the corresponding general-purpose MC codes in the same conditions. A latent uncertainty metric was defined and analysis was performed by varying the pregenerated track bank size and the number of simulated primary particle histories and comparing dose values to a “ground truth” benchmark dose distribution calculated to 0.04% average uncertainty in voxels with dose greater than 20% of D{sub max}. Efficiency metrics were calculated against benchmark MC codes on a single CPU core with no variance reduction. Results: Dose distributions generated using PMC and benchmark MC codes were compared and found to be within 2% of each other in voxels with dose values greater than 20% of the maximum dose. In proton calculations, a small (≤1 mm) distance-to-agreement error was observed at the Bragg peak. Latent uncertainty was characterized for electrons and found to follow a Poisson distribution with the number of unique tracks per energy. A track bank of 12 energies and 60000 unique tracks per pregenerated energy in water had a size of 2.4 GB and achieved a latent uncertainty of approximately 1% at an optimal efficiency gain over DOSXYZnrc. Larger track banks produced a lower latent uncertainty at the cost of increased memory consumption. Using an NVIDIA GTX 590, efficiency analysis showed a 807 × efficiency increase over DOSXYZnrc for 16 MeV electrons in water and 508 × for 16 MeV electrons in bone. Conclusions: The PMC method can calculate dose distributions for electrons and protons to a statistical uncertainty of 1% with a large efficiency gain over conventional MC codes. Before performing clinical dose calculations, models to calculate dose contributions from uncharged particles must be implemented. Following the successful implementation of these models, the PMC method will be evaluated as a candidate for inverse planning of modulated electron radiation therapy and scanned proton beams.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2022

Coupling Subsurface and Above-Surface Models for Optimizing the Design of Borefields and District Heating and Cooling Systems

Accurate dynamic energy simulation is important for the design and sizing of district heating and cooling systems with geothermal heat exchange for seasonal energy storage. Current modeling approaches in building and district energy simulation tools typically consider heat conduction through the ground between boreholes without flowing groundwater. While detailed simulation tools for subsurface heat and mass transfer exist, these fall short in simulating above-surface energy systems. To support the design and operation of such systems, the study developed a coupled model including a software package for building and district energy simulation, and software for detailed heat and mass transfer in the subsurface. For the first, it uses the open-source Modelica Buildings Library, which includes dynamic simulation models for building and district energy and control systems. For the heat and mass transfer in the soil, it uses the TOUGH simulator. The TOUGH family of codes can model heat and multi-phase, multi-component mass transport for a variety of fluid systems, as well as chemical reactions, in fractured porous media. The study validated the coupled modeling approach by comparing the simulation results with one from the g-function based ground response model. It then looked into effects when the water table and the regional groundwater flow are considered in the ground, from the perspective of heat exchange between borehole and ground, and the electrical consumption of the district heating and cooling systems. To access the simulation models, please find the links in the submission: -- For coupled approach validation: see model Buildings.Fluid.Geothermal.Borefields.Examples.BorefieldsWithTough and Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from the "Modelica Building Library" resource, branch issue1495_tough_interface, commit a2667c0. -- For the study of the effect of water table: see model Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from he "Modelica Building Library" resource, branch issue1495_tough_interface_moreIO, commit 760de49. -- For the study of the effect of regional groundwater flow: see Buildings.Examples.DistrictReservoirNetworks.Examples.Reservoir3Variable_TOUGH from he "Modelica Building Library" resource, branch issue1495_tough_interface_moreIO_3D, commit c2a2d2a. The coupling interface script "GrounResponse.py" can be found from the above links in the folder Buildings/Resources/Python-Sources. Also, the needed files for TOUGH simulation are in the folder Buildings/Resources/Python-Sources/ToughFiles that can be accessed through the above links. A brief description of these files is given below; detailed specifications for the first three files may be found in the TOUGH3 Users Guide (Jung et al., 2018) https://tough.lbl.gov/documentation/tough-manuals/. (1) INCON - initial conditions for each grid block (2) INFILE - main input file with material properties and control parameters (3) MESH - description of the computational grid (4) readsave - Modelica/TOUGH interface program: read the final output of TOUGH simulation after TOUGH time step and prepare for transfer to Modelica for next Modelica time step (5) readsave.inp - input parameters for program readsave (6) writeincon - Modelica/TOUGH interface program: write the output of Modelica after Modelica time step and prepare for transfer to TOUGH as initial conditions for the next TOUGH step (7) writeincon.inp - input parameters for program writeincon

15 GEOTHERMAL ENERGY↗
DOE OSTI2011

Final Report for "Extending BOUT++ for Solution of Edge Plasma Equations for Use in Whole Device Simulation of Tokamaks"

In this Phase I project we have extended the BOUT++ code to solve edge fluid equations. We added a simple neutral fluid model, created a mesh generator as well as collected a set of difficult test problems for benchmarking edge codes. The work in this project should be useful as a starting point to build a complete set of edge fluid equations in BOUT++ that would enhance its ability to not only perform edge turbulence calculations, but also allow the coupled transport-turbulence equations evolved in an efficient manner.

99 GENERAL AND MISCELLANEOUS↗