Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer Programming and software”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Data-Conforming Data-Driven Control: Avoiding Premature Generalizations Beyond Data

Data-driven and adaptive control approaches face the problem of introducing sudden distributional shifts beyond the distribution of data encountered during learning. Therefore, they are prone to invalidating the very assumptions used in their own construction. This is due to the linearity of the underlying system, inherently assumed and formulated in most data-driven control approaches, which may falsely generalize the behavior of the system beyond the behavior experienced in the data. This article seeks to mitigate these problems by enforcing consistency of the newly designed closed-loop systems with data and slowing down any distributional shifts in the joint state-input space. This is achieved through incorporating affine regularization terms and linear matrix inequality constraints to data-driven approaches, resulting in convex semi-definite programs that can be efficiently solved by standard software packages. We discuss the optimality conditions of these programs and then conclude this article with a numerical example that further highlights the problem of premature generalization beyond data and shows the effectiveness of our proposed approaches in enhancing the safety of data-driven control methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

AEDAM: Whole Program Adaptive Error Detection and Mitigation—Year 3 Report

In Year 3, MIT was primarily responsible for the effort on Software Characterization, with the following milestones: 1. Completed design of domain-specific language for fault models 2. Completed design of program logic for verification 3. Completed evaluation of relational verification system for jacobi, steepest descent, and conjugate gradient 4. Completed development of relational verification system 5. Completed evaluation of relational verification system

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Introducing Human Mandible Identification [(hu)MANid]: A Free, Web‐Based GUI to Classify Human Mandibles

Abstract Statistical programs have revolutionized the way in which forensic anthropologists conduct casework by allowing practitioners to use computationally complex analytics at the click of a button. Importantly, the products of these statistical programs are reproducible and contain measures of error or uncertainty, thereby strengthening conclusions. This paper is an introduction to (hu) MAN id, a free, web‐based application that uses linear and mixture discriminant function analyses to classify human mandibles into one of many worldwide and/or periodic reference groups. The mechanics, development, and use of the application will be discussed. Further, the program was tested against other software to compare model performances and classifications. Total correct classifications among the test cases and programs were identical. Ten mandibles were tested using both statistical procedures. Mixture discriminant analysis improved classification by an average of 9.3% and correctly identified three more mandibles than LDA . Therefore, we believe (hu) MAN id will be an asset to the anthropological community.

Berg, Gregory E.↗
DOE OSTI2016

RAVEN User Manual

RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncertainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. for an important process such as peak pressure in a pipe) is exceeded under certain conditions. The initial development of RAVEN has been focused on providing dynamic risk assessment capability to RELAP-7, currently under development at the INL and, likely, future replacement of the RELAP5-3D code. Most the capabilities that have been implemented having RELAP-7 as principal focus are easily deployable for other system codes. For this reason, several side activates are currently ongoing for coupling RAVEN with software such as RELAP5-3D, etc. The aim of this document is the explanation of the input requirements, focusing on the input structure.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

NMSBA: Continuous Application Benchmarking & Analysis – CABA

The CABA project is a test of a new tool, Survey,developed by Trenza to be used not only for benchmarking or profiling programs but also to allow incorporation of the information provided by Survey to be utilized in a CI, continuous integration,tool such as GitLab CI.Survey is foremost a means of assessing code performance in terms of time and operations which for computer programmers is known as benchmarking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Stellar mass–halo mass relation for the brightest central galaxies of X-ray clusters since z ~ 0.65

We present the brightest cluster galaxies (BCGs) catalog for SPectroscoic IDentification of eROSITA Sources (SPIDERS) DR14 cluster program value-added catalog. We list the 416 BCGs identified as part of this process, along with their stellar mass, star formation rates (SFRs), and morphological properties. We identified the BCGs based on the available spectroscopic data from SPIDERS and photometric data from SDSS. We computed stellar masses and SFRs of the BCGs on the basis of SDSS, WISE, and GALEX photometry using spectral energy distribution fitting. Morphological properties for all BCGs were derived by Sersic profile fitting using the software package SIGMA in different optical bands ($g,r,i$). We combined this catalog with the BCGs of galaxy groups and clusters extracted from the deeper AEGIS, CDFS, COSMOS, XMM-CFHTLS, and XMM-XXL surveys to study the stellar mass–halo mass relation using the largest sample of X-ray groups and clusters known to date. This result suggests that the mass growth of the central galaxy is controlled by the hierarchical mass growth of the host halo. We find a strong correlation between the stellar mass of BCGs and the mass of their host halos. This relation shows no evolution since $z$ ~ 0.65. We measure a mean scatter of 0.21 and 0.25 for the stellar mass of BCGs in a given halo mass at low (0.1 < $z$ < 0.3) and high (0.3 < $z$ < 0.65) redshifts, respectively. We further demonstrate that the BCG mass is covariant with the richness of the host halos in the very X-ray luminous systems. We also find evidence that part of the scatter between X-ray luminosity and richness can be reduced by considering stellar mass as an additional variable.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗
DOE OSTI2020

An Atmospheric Aerosol Short Course for Early Career Scientists

The first Department of Energy (DOE) Environmental and Molecular Science Laboratory (EMSL)/Atmospheric Radiation Measurement (ARM) aerosol summer school was held July 15-19, 2019 at the EMSL user facility located at Pacific Northwest National Laboratory. The school set out to provide graduate students and early-career scientists an overview of atmospheric aerosol science and an introduction to the measurement techniques available through the EMSL and ARM user facilities to address current aerosol science issues. Instructors for the course were drawn from scientists from the EMSL (Laskin et al., 2016; China et al., 2018) and ARM facilities (McComiskey and Ferrare, 2016) as well as from the DOE Atmospheric System Research (ASR) program. Student support for the summer school was also jointly provided by EMSL, ARM, and ASR. The school spanned five days with each day covering a particular theme. 25 students from 21 institutions attended morning lectures on aerosol composition, properties, theory, measurements, and modeling. During afternoons, the students explored instruments that collect and analyze aerosol samples at EMSL and PNNL’s Atmospheric Measurements Laboratory. They also tested relevant computer modeling simulations and learned about NWChem, EMSL’s open-source computational chemistry software suite.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Linear sine wave profiling to machine instability targets

Specialized machining processes and programming have been developed to deliver thin tin and copper Richtmyer-Meshkov instability targets that have different amplitude perturbations across the face of one 4-in.-diameter target. Typical targets have anywhere from two to five different regions of sine waves that have different amplitudes varying from 4 to 200 μm across the face of the target. The puck is composed of multiple rings that are zero press fit together and diamond turned to create a flat platform with a tolerance of 2 μm for the shock experiment. A custom software program was written in Labview to write the point-to-point program for the diamond-turning profiler through the X-Y-Z movements to cut the pure planar straight sine wave geometry. As a result, the software is optimized to push the profile of the whole part into the face while eliminating any unneeded passes that do not cut any material.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Final Review Memo from ATDM L2 Milestone Review Panel to ATDM L2 Milestone Team and Associated Management

On Thursday, August 25, 2016, the ATDM L2 milestone review panel met with the milestone team to conduct a final assessment of the completeness and quality of the work performed. First and foremost, the panel would like to congratulate and commend the milestone team for a job well done. The team completed a significant body of high-quality work toward very ambitious goals. Additionally, their persistence in working through the technical challenges associated with evolving technology, the nontechnical challenges associated with integrating across multiple software development teams, and the many demands on their time speaks volumes about their commitment to delivering the best work possible to advance the ATDM program. The panel’s comments on the individual completion criteria appear in the last section of this memo.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Radioactive Decay Chain Truncation Rules for Emergency Response Radiological Assessments

A set of radionuclide - decay chain truncation rules have been developed for use in the Turbo FRMAC and Specialized Hazard Assessment Response Capability (SHARC) software programs used to support radiological emergency response activities . Following the proposed rules, the software will truncate a decay chain after it encounters a progeny radionuclide with a half - life greater than 5,000 years. An analysis of the projected dose from many parent and progeny radionuclides over a 50 - year time period yielded that a radionuclide half - life cutoff of 5,000 years will exclude a negligible dose. Implementing the truncation rules will reduce the time required for assessments and minimize computer hardware requ irements without having a significant detrimental effect on dose projections and emergency response decisions. It is noted that the truncation rules may not be suited for long - term ( greater than 50 year) environmental assessments.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2020

Multimodal Deep Learning for Flaw Detection in Software Programs

We explore the use of multiple deep learning models for detecting flaws in software programs. Current, standard approaches for flaw detection rely on a single representation of a software program (e.g., source code or a program binary). We illustrate that, by using techniques from multimodal deep learning, we can simultaneously leverage multiple representations of software programs to improve flaw detection over single representation analyses. Specifically, we adapt three deep learning models from the multimodal learning literature for use in flaw detection and demonstrate how these models outperform traditional deep learning models. We present results on detecting software flaws using the Juliet Test Suite and Linux Kernel.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Review of Candidates for a Validation Data Set for High-Assay Low-Enrichment Uranium Fuels

Many advanced reactor concept designs rely on high-assay low-enriched uranium (HALEU) fuel, enriched up to approximately 19.75% 235 U by weight. Efforts are underway by the US government to increase HALEU production in the United States to meet anticipated needs. However, very few data exist for validation of computational models that include HALEU, beyond a few fresh fuel benchmark specifications in the International Reactor Physics Experiment Evaluation Project. Nevertheless, there are other data with potential value available for developing into quality benchmarks for use in data- and software-validation efforts. This paper reviews the available evaluated HALEU fuel benchmarks and some of the potentially relevant benchmarks for fresh highly enriched uranium. It then introduces experimental data for HALEU fuel irradiated at Idaho National Laboratory, from relatively recent irradiation programs at the Advanced Test Reactor. Such data should be evaluated and, if valuable, collected into detailed benchmark specifications to meet the needs of HALEU-based reactor designers.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Asynchronous Runtimes in Action: An Introspective Framework for a Next Gen Runtime

One of the most critical challenges that new high performance systems face is the lack of system software support for these large scale systems. Investment on system stack components is essential in the development, debugging and optimization of the new emerging programming models. These emerging models have the promise to better utilize the vast hardware resources available in current and future systems. To aid in the development of applications and new system stacks, runtimes, as instances of their respective execution models, need to produce facilities to introspect their inner workings and allow an indepth attribution of performance bottlenecks and computational patterns. In other words, the runtime systems need to reduce their opacity to observers so that users of a novel program execution model can adapt their designs to fit the intended model usage, regardless of the layer that they are working on. This design/development loop (akin to co-design) enables synergistic opportunities across the entire computational stack. This paper presents the design and implementation of a simple “gray” box performance attribution harness running inside a fine grain runtime system: the Open Community Runtime (OCR). We showcase what such a framework can indicate regarding the runtime behavior while running at scale. To this end, we have designed a set of synthetic scenarios aimed to test the runtime at their best and worst cases. We present an analysis of the most important runtime features, properties and idiosyncrasies that will affect the development of new runtime features, algorithmic selection, and application development.

high performance distributed runtimes↗
DOE OSTI2021

Towards performance portability in the Spark astrophysical magnetohydrodynamics solver in the Flash-X simulation framework

Simulations of core-collapse supernovae, and other astrophysical phenomena, are quintessential extreme-scale computing challenges. For core-collapse supernova simulations to be carried out by the ExaStar project under the Exascale Computing Project umbrella, a robust, efficient, and state-of-the-art magnetohydrodynamics solver is a critical requirement. In Flash-X, the primary software instrument for ExaStar, a new magnetohydrodynamics solver has been designed and implemented from the ground up to achieve accuracy and efficiency for simulations of complex astrophysical flows. This new solver, dubbed Spark, uses high-order spatial reconstruction, Runge-Kutta time integration, and an efficient cell-centered approach to satisfying the divergence-free condition for the magnetic fields. Spark was written to be optimized for data locality in cache hierarchy of CPUs. Since data locality optimizations for cache hierarchy are not directly compatible with those of accelerators, we have taken the approach of using program synthesis to avoid massive amounts of code replication that would be necessary if we were to maintain two different versions of the solver. Our program synthesis relies on a simple key-dictionary approach, implemented in python, that enables us to assemble the version of the solver suitable for the target hardware from code fragments identified by specific keys. In this work, we describe the data locality optimizations of the solver for CPUs and accelerators and the program synthesis tools that enable this portability. We also detail the parallel performance of Spark for both CPUs and accelerators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Exploring versioned distributed arrays for resilience in scientific applications: Global view resilience

Exascale studies project reliability challenges for future HPC systems. We present the Global View Resilience (GVR) system, a library for portable resilience. GVR begins with a subset of the Global Arrays interface, and adds new capabilities to create versions, name versions, and compute on version data. Applications can focus versioning where and when it is most productive, and customize for each application structure independently. This control is portable, and its embedding in application source makes it natural to express and easy to maintain. The ability to name multiple versions and “partially materialize” them efficiently makes ambitious forward-recovery based on “data slices” across versions or data structures both easy to express and efficient. Using several large applications (OpenMC, preconditioned conjugate gradient (PCG) solver, ddcMD, and Chombo), we evaluate the programming effort to add resilience. The required changes are small (< 2% lines of code (LOC)), localized and machine-independent, and perhaps most important, require no software architecture changes. We also measure the overhead of adding GVR versioning and show that overheads < 2% are generally achieved. This overhead suggests that GVR can be implemented in large-scale codes and support portable error recovery with modest investment and runtime impact. Our results are drawn from both IBM BG/Q and Cray XC30 experiments, demonstrating portability. We also present two case studies of flexible error recovery, illustrating how GVR can be used for multi-version rollback recovery, and several different forward-recovery schemes. GVR’s multi-version enables applications to survive latent errors (silent data corruption) with significant detection latency, and forward recovery can make that recovery extremely efficient. Lastly, our results suggest that GVR is scalable, portable, and efficient. GVR interfaces are flexible, supporting a variety of recovery schemes, and altogether GVR embodies a gentle-slope path to tolerate growing error rates in future extreme-scale systems.

97 MATHEMATICS AND COMPUTING↗