SEARCH · Search NASA

Results for “programming tools”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2012

Sandia National Laboratories, California Chemical Management Program Annual Report

The annual program report provides detailed information about all aspects of the Sandia National Laboratories, California (SNL/CA) Chemical Management Program. It functions as supporting documentation to the SNL/CA Environmental Management System Program Manual. This program annual report describes the activities undertaken during the calender past year, and activities planned in future years to implement the Chemical Management Program, one of six programs that supports environmental management at SNL/CA. SNL/CA is responsible for tracking chemicals (chemical and biological materials), providing Material Safety Data Sheets (MSDS) and for regulatory compliance reporting according to a variety of chemical regulations. The principal regulations for chemical tracking are the Emergency Planning Community Right-to-Know Act (EPCRA) and the California Right-to-Know regulations. The regulations, the Hazard Communication/Lab Standard of the Occupational Safety and Health Administration (OSHA) are also key to the CM Program. The CM Program is also responsible for supporting chemical safety and information requirements for a variety of Integrated Enabling Services (IMS) programs primarily the Industrial Hygiene, Waste Management, Fire Protection, Air Quality, Emergency Management, Environmental Monitoring and Pollution Prevention programs. The principal program tool is the Chemical Information System (CIS). The system contains two key elements: the MSDS library and the chemical container-tracking database that is readily accessible to all Members of the Sandia Workforce. The primary goal of the CM Program is to ensure safe and effective chemical management at Sandia/CA. This is done by efficiently collecting and managing chemical information for our customers who include Line, regulators, DOE and ES and H programs to ensure compliance with regulations and to streamline customer business processes that require chemical information.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Developing a Supply Chain Security Program

Amid growing concerns over foreign manufacturing for components and devices deployed in critical energy infrastructure, this research from the national labs will highlight best practices for developing and maintaining a supply chain security program. Tools for asset inventory, tips for developing and maintaining software- and hardware-bills-of-materials (SBOMs and HBOMs), recommended contractual language for vendor agreements, and identification of responsibilities will be shared. We discuss the one-time requirements to enable a successful supply chain security program and the best ways to operationalize this program for maximum impact, including development of robust practices for vulnerability tracking, patch management, and workarounds, with understanding of the reliability and uptime requirements for utilities. The recommendations shared are based on a cyber-informed engineering approach to identification of high-consequence impacts and the engineering controls related to supply chain management that can best mitigate these impacts. This approach allows for prioritization of resources. Additionally, we highlight relative up-front and ongoing costs associated with recommended controls. Viewers will leave with an understanding what a supply chain security program is, and what steps, prioritized for resource-constrained organizations, can build a robust program.

14 SOLAR ENERGY↗

DOE OSTI2017

ATDM LANL FleCSI: Topology and Execution Framework

FleCSI is a compile-time configurable C++ framework designed to support multi-physics application development. As such, FleCSI attempts to provide a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. This means that FleCSI is potentially useful to many different ECP projects. Current support includes multidimensional mesh topology, mesh geometry, and mesh adjacency information, n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures (to identify data dependencies between distributed-memory address spaces). FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent with state-of-the-art task-based runtimes such as Legion and Charm++. The model also provides support for fine-grained, data-parallel execution with backend support for runtimes such as OpenMP and C++17. The FleCSI abstraction layer provides the developer with insulation from the underlying runtimes, while allowing support for multiple runtime systems, including conventional models like asynchronous MPI. The intent is to give developers a concrete set of user-friendly programming tools that can be used now, while allowing flexibility in choosing runtime implementations and optimizations that can be applied to architectures and runtimes that arise in the future. This project is essential to the ECP Ristra Next-Generation Code project, part of ASC ATDM, because it provides a hierarchically parallel programming model that is consistent with the design of modern system architectures, but which allows for the straightforward expression of algorithmic parallelism in a portably performant manner.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

A method of building of decision trees based on data from wearable device during a rehabilitation of patients with tibia fractures

Nowadays technologies which are used in traumatology are a combination of mechanical, electronic, calculating and programming tools. Relevance of development of mobile applications for an expeditious data processing which are received from medical devices (in particular, wearable devices), and formulation of management decisions increases. Using of a mathematical method of building of decision trees for an assessment of a patient’s health condition using data from a wearable device considers in this article.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

MCNP ® Particle Transport Code: Its History and Future [Slides]

The history, development and application uses of Monte Carlo particle transport codes at LANL are extensive. Recent and ongoing investments in MCNP modernization are enabling new code developments using modern programming tools and languages. New and challenging applications continue to drive new research and developments beyond the rich set of established MCNP capabilities. The LANL MCNP radiation transport code has been the international gold standard for particle transport applications for over three decades.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2017

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Do Programmers Prefer Predictable Expressions in Code?

Source code is a form of human communication, albeit one where the information shared between the programmers reading and writing the code is constrained by the requirement that the code executes correctly. Programming languages are more syntactically constrained than natural languages, but they are also very expressive, allowing a great many different ways to express even very simple computations. Still, code written by developers is highly predictable, and many programming tools have taken advantage of this phenomenon, relying on language model surprisal as a guiding mechanism. Additionally, while surprisal has been validated as a measure of cognitive load in natural language, its relation to human cognitive processes in code is still poorly understood. In this paper, we explore the relationship between surprisal and programmer preference at a small granularity—do programmers prefer more predictable expressions in code? Using meaning-preserving transformations, we produce equivalent alternatives to developer-written code expressions and run a corpus study on Java and Python projects. In general, language models rate the code expressions developers choose to write as more predictable than these transformed alternatives. Then, we perform two human subject studies asking participants to choose between two equivalent snippets of Java code with different surprisal scores (one original and transformed). We find that programmers do prefer more predictable variants, and that stronger language models like the transformer align more often and more consistently with these preferences.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

SU-E-T-558: An Exploratory RF Pulse Sequence Technique Used to Induce Differential Heating in Tissues Containing Iron Oxide Nanoparticles for a Possible Hyperthermic Adjuvant Effect to Radiotherapy

Purpose: In pre-clinical trials of cancer thermotherapy, hyperthermia can be induced by exposing localized super-paramagnetic iron oxide nanoparticles (SPION) to external alternating magnetic fields generated by a solenoid electrical circuit (Zhao et al., Theranostics 2012). Alternatively, an RF pulse technique implemented in a regular MRI system is explored as a possible hyperthermia induction technique . Methods: A new thermal RF pulse sequence was developed using the Philips pulse programming tool for the 3T Ingenia MRI system to provide a sinusoidal magnetic field alternating at the frequency of 1.43 kHz (multiples of sine waves of 0.7 ms period) before each excitation RF pulse for imaging. The duration of each thermal RF pulse routine was approximately 3 min, and the thermal pulse was applied multiple times to a phantom that contains different concentrations (high, medium and low) of SPION samples. After applying the thermal pulse each time, the temperature change was estimated by measuring the phase changes in the T1-weighted inversion-prepared multi-shot turbo field echo (TFE) sequence (TR=5.5 ms, TE=2.7 ms, inversion time=200 ms). Results: The phase values and relative differences among them changed as the number of applied thermal RF pulses increased. After the 5th application of the thermal RF pulse, the relative phase differences increased significantly, suggesting the thermal activation of the SPION. The increase of the phase difference was approximately linear with the SPION concentration. Conclusion: A sinusoidal RF pulse from the MRI system may be utilized to selectively thermally activate tissues containing super-paramagnetic iron oxide nanoparticles.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2016

Flexible Computer Science Infrastructure (FleCSI)

FleCSI is a compile-time configurable framework designed to support multi-physics application development. As such, FleCSI attempts to provide a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. Current support includes multi-dimensional mesh topology, mesh geometry, and mesh adjacency information, n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI also introduces a functional programming model with control, execution, and data abstractions that are consistent with both MPI and state-of-the-art task-based runtimes such as Legion and Charm++. The FleCSI abstraction layer provides the developer with insulation from the underlying runtime, while allowing support for multiple runtime systems, including conventional models like asynchronous MPI. The intent is to give developers a concrete set of user-friendly programming tools that can be used now, while allowing flexibility in choosing runtime implementations and optimizations that can be applied to architectures and runtimes that arise in the future. The control and execution models in FleCSI also provide formal nomenclature for describing poorly understood concepts like kernels and tasks.

Moss, Nicholas↗

DOE OSTI2026

Quantum Stochastic Programming [SWR-26-040]

The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"

Maack, Jonathan [National Laboratory of the Rockie↗

DOE OSTI2017

Unified, Cross-Platform, Open-Source Library Package for High-Performance Computing

Compute power is continually increasing, but this increased performance is largely found in sophisticated computing devices and supercomputer resources that are difficult to use, resulting in under-utilization. We developed a unified set of programming tools that will allow users to take full advantage of the new technology by allowing them to work at a level abstracted away from the platform specifics, encouraging the use of modern computing systems, including government-funded supercomputer facilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

Realizing High-Performance Parallel Computing Final Report CRADA No. TC-0319-92

The objectives of this project were to improve the programming environment for scientific applications on shared-memory (SMP) and massively-parallel (MMP) computer systems and to develop high-performance, parallel rational drug design applications. The collaborators, IBM Corp., BioNumerik Pharmaceuticals (BNP), and Lawrence Livermore National Laboratory (LLNL), each brought unique expertise to the project. IBM contributed state-of-the-art SMP and MMP computer systems; BNP provided proprietary quantum mechanical and statistical mechanical molecular dynamics codes and experimental data; and LLNL contributed its high-performance Sisal compilers, runtime systems, and programming tools.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Potential Ideas for an El Capitan Center of Excellence (COE) Around Intelligent Simulation

Proposing a Center of Excellence under the CORAL-2 NRE is a mandatory requirement. The current Sierra COE (CORAL-1) is largely focused on helping LLNL applications make the disruptive transition to a heterogeneous GPU-based system by 2018. We expect a continuation of COE activities around optimizing our broad and diverse application base (of so-called “traditional” simulation codes) optimized for the El Capitan architecture, as well as supporting the underlying software stack (compilers, tools, programming models, etc.) – but do not expect this to require as much effort in the El Capitan COE (assuming a heterogeneous node architecture). What follows are some thoughts on 3 potential topics of interest for an El Capitan COE at LLNL – largely focused around AI and machine learning and the concept of advancing our goal of intelligent simulation or cognitive computing in the timeframe of deployment and production use of El Capitan (2023-2038). We believe vendor engagement through a COE in this area will provide a natural point-of-interest between LLNL and our vendor partner for common advancement of machine learning capabilities focused on scientific data – potentially greatly broadening the ecosystem around HPC architectures and the supporting software stack for scientific simulation-based AI.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Decomposition of Nonlinear Dynamical Networks via Comparison Systems

In analysis and control of large-scale nonlinear dynamical systems, a distributed approach is often an attractive option due to its computational tractability and usually low communication requirements. Success of the distributed control design relies on the separability of the network into weakly interacting subsystems such that minimal information exchange between subsystems is sufficient to achieve satisfactory control performance. While distributed analysis and control design for dynamical network have been well studied, decomposition of nonlinear networks into weakly interacting subsystems has not received as much attention. In this article we propose a vector Lyapunov functions based approach to quantify the energy-flow in a dynamical network via a model of a comparison system. Introducing a notion of power and energy flow in a dynamical network, we use sum-of-squares programming tools to partition polynomial networks into weakly interacting subsystems. Examples are provided to illustrate the proposed method of decomposition.

Maruf, Abdullah Al↗

DOE OSTI2016

Flexible Computer Science Infrastructure (FleCSI)

Bergen, Ben↗

DOE OSTI2016

Nuclear Forensics for Irradiated Materials using Kernel Regression Models

The ultimate purpose of nuclear forensics is to locate the origin of nuclear and other radioactive materials out of regulatory control used in nuclear security events such as classical forensics. For this purpose, some specific characteristics of interdicted materials (referred to as 'signatures') should be defined to compare the known sample database. In some cases, involved with irradiated material, the signatures could be specific amount of fission product inventory depending on reactor operational histories such as reactor type, initial enrichment, burn up rate of nuclear fuel and cooling period after irradiation in the reactor. In order to make inference model for irradiated material for nuclear forensics, we suggested 3 ways as follows; (i) analyzing ORIGEN produced nuclear substances for the fission product inventory, (ii) classifying the range of reactor type, (iii) predicting the operational history from the fission product inventory. In terms of nuclear substance analysis, the construction of spent fuel database has been internationally carried out since ITWG (Nuclear Smuggling International Technical Working Group) was established in 1995. However, enough sample data cannot be obtained in Korea to determine reactor type and operational histories because analyzing nuclear substances have been limited due to the international regulation. Thus, this study does not mention how to obtain mass or ratios of nuclides for the spent fuel. We just have generated simulation sample data as a fission product inventory using ORIGEN to construct spent fuel database. When unidentified radioactive materials are discovered, it is assumed that mass or ratios of the nuclides are analyzed by certain methods which are available in Korea as well as other countries. Then, a reactor type is determined, and finally, regression model can locate the origin or source of the radioactive materials by inferring operational histories using the fission product inventory. There are some studies on the classification of reactor type using statistical methods. As a part of predicting the operational history, this paper focuses on the development of spent fuel inference algorithm for nuclear forensics to estimate reactor operational histories that reflect characteristics of a reactor from the fission product inventory. The spent fuel inference algorithm for nuclear forensics has been developed on the basis of Kernel Regression (KR) which can conditionally generate the estimated output data by giving weight depending on geometric distance between sample data and input data. Also the KR which comprises Auto-Associative KR and Inferential KR have some benefits that can estimate only using data without assumption for specific physical model and re-learning process. Auto-associative KR (AAKR) was used to sort out outliers of input data and Inferential KR (IKR) was carried out to predict the operational histories for spent fuel. All of regression algorithms were performed in R programming tool. From the validation of both AAKR and IKR, it is expected that kernel regression has enough accuracy to be applied to nuclear forensics for spent fuel. Once the nuclear substance is measured to fill the fission product inventory with a certain reactor type, this kernel regression algorithm would predict the operational histories of spent fuel with high accuracy. Finally, this information is expected to be useful to find the origin of irradiated materials. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2021

Porting the Nonlinear Optimization Library HiOp to Accelerator-Based Hardware Architectures

While interior point method has been the centerpiece of nonlinear programming tools used in science and engineering, its reliance on linear solvers that can tackle sparse symmetric indefinite and highly ill-conditioned problems made it difficult to implement it effectively on hardware accelerators. HiOp optimization package attempts to provide an implementation of the interior point method suitable for hardware accelerators by compressing the original sparse problem to produce an underlying linear problem that is dense and of manageable size. Implementations of dense linear solvers are more mature and utilize hardware accelerators better than their sparse counterparts. There is a number of important domain problems, such as optimal power flow analysis for power grids, where the sparse problem can be effectively compressed and deploying dense linear solver within the interior point method can improve performance. Here we describe a portable implementation of HiOp optimization engine, which uses a linear solver from Magma library and runs entirely on hardware accelerators. To compress the problem, HiOp uses customized mixed dense-sparse linear algebra. All HiOp kernels are implemented using Umpire and RAJA portability libraries. We describe details of the implementation and discuss trade-offs between performance, portability and development cost.

97 MATHEMATICS AND COMPUTING↗