Search NASA⌕ Search

SEARCH · Search NASA

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

Finding gaps in the national electric vehicle charging station coverage of the United States

Abstract The United States federal government has invested $7.5 billion into charging infrastructure, including the National Electric Vehicle Infrastructure Program, to build fast charging stations along designated highways for long-distance car travel. We develop a consecutive coverage metric to compute the percent of United States roads (traffic-weighted) that are consecutively accessible within 500 miles of each county. We answer (1) what the state of consecutive coverage is in each county and (2) what the increase in coverage is when designated highways receive fast chargers. In 2023, 10% of counties had at least 75% minimum viable coverage. We find that if all designated highways receive fast-charging stations, 94% of United States counties will reach at least 75% fast charger coverage. However, the remaining counties are rural. This demonstrates that federal funding for fast chargers will help connect most—but not all—counties to the national network of continuously accessible charging stations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Numerical simulation projects in micromagnetics with Jupyter

We report a case study where an existing materials science course was modified to include numerical simulation projects on the micromagnetic behavior of materials. The Ubermag micromagnetic simulation software package is used in order to solve problems computationally. The simulation software is controlled through the Python code in Jupyter notebooks. Our experience is that the self-paced problem-solving nature of the project work can facilitate a better in-depth exploration of the course contents. We discuss which aspects of the Ubermag and the project Jupyter ecosystem have been beneficial for the students' learning experience and which could be transferred to similar teaching activities in other subject areas.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes our contributions to the Department of Energy’s Tough Errors are no Match (TEAM) project (DE-SC0020377) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work included a novel efficient quantum compiling algorithm which works without requiring the quantum computer to exactly invert its operations, answering a longstanding open problem in quantum compiling. Additional results include the implementation of zero-noise extrapolation error mitigation in collaboration with the Unitary Fund, as well as novel quantum algorithms for entanglement detection and pseudorandomness.

Bouland, Adam [Stanford Univ., CA (United States)]↗
DOE OSTI2024

Remark on Algorithm 1012: Computing Projections with Large Datasets

In ACM TOMS Algorithm 1012, the DELAUNAYSPARSE software is given for performing Delaunay interpolation in medium to high dimensions. When extrapolating outside the convex hull of the training set, DELAUNAYSPARSE calls the nonnegative least squares solver DWNNLS to compute projections onto the convex hull. However, DWNNLS and many other available sum-of-squares optimization solvers were not intended for usage with many variable problems, which result from the large training sets that are typical in machine learning applications. Thus, a new PROJECT subroutine is given, based on the highly customizable quadratic program solver BQPD. This solution is shown to be as robust as DELAUNAYSPARSE for projection onto both synthetic and real-world datasets, where other available solvers frequently fail. Although it is intended as an update for DELAUNAYSPARSE, due to the difficulty and prevalence of the problem, this solution is likely to be of external interest as well.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Integration of the NCRC Database and Other INL Databases

The Nuclear Computational Resource Center provides a portal by which industry professionals, educational staff, students, national laboratory employees, and others may request access to certain engineering software tools. As the tools provided through the Nuclear Computational Resource Center portal are not open-source and freely available, a set of approvals are necessary before access is granted. All code recipients must be associated with an institution that has a license with Idaho National Laboratory for the code requested. Information about these licenses is controlled by Idaho National Laboratory’s Technology Deployment organization and housed in a Technology Deployment database. Those requesting code access who are not citizens of the United States must also have a security plan, mandated by Idaho National Laboratory policy. Security plans are managed by the International Access Program and are stored in an International Access Program database known as IFacts. Granting access to software thus depends on information stored in the Technology Deployment database and IFacts. In the past, no connection between the Nuclear Computational Resource Center portal and these databases existed, making checking the status of license agreements and security plans time consuming and error prone. This report demonstrates that the Nuclear Computational Resource Center portal now connects to both the Technology Deployment database and IFacts, greatly improving the ease of use of the Nuclear Computational Resource Center system for administrators, which leads to a better overall experience for those requesting code access.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights

Maintaining resource fairness while achieving optimization for various performance metrics such as resource utilization, turnaround time and job latency is a well-known resource scheduling challenge in cloud computing. Despite the significant progress made with the introduction of dominant resource fairness by Ghodsi et al., which ensures major allocation properties such as sharing incentive, strategy-proofness, envy-freeness and Pareto efficiency to be achieved

Yan, Bo [Binghamton University]↗
DOE OSTI2026

Cybersecurity Standards, Certification, and Best Practices for DERs

Distributed energy resources (DERs) are becoming increasingly important to the electric grid, including solar energy systems. However, DERs also introduce new cybersecurity risks, including those posed by cloud computing. Standards harmonization is essential for ensuring that DERs are secure and can be safely integrated into the grid. This panel will discuss cyber standards harmonization for solar security. The panel will feature experts from the S2G Program, National Labs and Industry who will discuss the following topics: the cybersecurity risks and future benefits posed by ubiquitous solar energy systems, the development and implementation of cloud-based security solutions for DERs, including solar energy systems, the challenges and opportunities for harmonizing DER cybersecurity standards, and Cyber Informed Engineering and the solar security implementations The panel will also discuss the following specific initiatives: the S2G Program's DER Cybersecurity Framework, UL's DER Cybersecurity Certification Program, and IEEE 1547 Updates. The panel will conclude with a discussion of the future of standards harmonization for DER cybersecurity.

14 SOLAR ENERGY↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

TEAMER - Extreme Events Modeling for the MARMOK-OWC Wave Energy Converter

Through the TEAMER program, Sandia National Laboratories (SNL) collaborated with IDOM Incorporated to study their MARMOK-Oscillating Water Column (MARMOK-OWC) wave energy conversion device. The study yielded a quantitative understanding of hydrodynamic pressures on the oscillating water column (OWC) device surfaces, the mooring tensions, and the dynamic performance of the device under extreme ocean wave conditions. This project utilized a comprehensive multi-phase Navier-Stokes flow solver with an overset body-fit mesh to predict fluid velocities and hydrodynamic forces on the MARMOK-OWC device. Computational Fluid Dynamics (CFD) analysis were conducted using OpenFOAM. This data includes the OpenFOAM cases (setup and data) to run the extreme events developed during the project. This project is part of the TEAMER RFTS 4 (request for technical support) program.

16 TIDAL AND WAVE POWER↗
DOE OSTI2025

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A matheuristic for design and dispatch of a utility-connected distributed energy system

Modeling distributed power generation systems often requires complicated mathematical expressions that present challenges for commercial optimization solvers. Here, this paper presents a matheuristic to solve a mixed-integer optimization model that informs decisions regarding the design and dispatch of a utility-connected microgrid. We deploy a genetic algorithm to search the system design space and a linear program to solve the economic dispatch problem. The model is a component of a web tool that requires solutions within a few minutes. Our method yields objective function values within 5% of an exogenously produced optimal in fewer than 30 seconds for 90% of our test cases compared to only 10% of our test cases by a traditional optimization solver in the same amount of time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A Vehicle-to-Grid planning framework incorporating electric vehicle user equilibrium and distribution network flexibility enhancement

The rapid surge in electric vehicle (EV) adoption, coupled with advancements in charging technologies, emphasizes the critical necessity for expanding EV recharging infrastructure. Simultaneously, the Distribution Network (DN) encounters escalating challenges in meeting charging demand during peak traffic periods. Consequently, there is a mounting demand for the deployment of innovative Vehicle-to-Grid (V2G) technologies to augment the DN’s flexibility in power dispatch and alleviate travel costs for EV users. Hence, this paper proposes an EV-user-equilibrium-(UE)-constrained V2G planning framework that enhances flexibility in the DN. The framework aims to ascertain the optimal placement and capacity of EV charging stations (EVCSs) and V2G charging piles within the Transportation Network (TN). It takes into account the equilibrium condition stemming from competitive EV charging and routing behaviors alongside the optimal expansion of DN energy resources to accommodate the electricity supplied by the V2G piles. This study commences by analyzing EV drivers’ travel decisions, considering the influence of charging and V2G pile locations and sizes. Subsequently, we tackle the Traffic Assignment Problem with User Equilibrium (TAP-UE) model to characterize the steady-state traffic flow distribution of EVs. Following this, we formulate the optimization model for the Coordinated Power and Transportation Network (CPTN), which encompasses the optimal expansion of DN facilities and traffic flow regulation under UE conditions. To mitigate the computational complexity associated with the V2G planning model, we introduce a series of linearization methods to obtain a manageable Mixed-Integer Linear Programming (MILP) solution. Finally, to validate the efficacy of our proposed planning framework, we apply it to two test systems, including a real-world case study. Through these case studies, we explore the necessity and potential benefits of V2G technologies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

hhg v1.0

The program simulates the non-linear propagation of a laser pulse through a gas medium and calculates the emission of harmonic radiation. The computational model includes the optical Kerr-effect and multiphoton ionization of the gas resulting in plasma dynamics.

Schroeder, Christian [Lawrence Berkeley National L↗
DOE OSTI2024

Convergence QL: NSF/DOE Quantum Science Summer School: QS3 Final Report

Convergence QL: NSF/DOE Quantum Science Summer School (QS3) was a 2-week summer program held in 2017, 2018, 2019, and 2022. The program was aimed at graduate students and postdoctoral researchers working on a wide range of topics related to quantum science and quantum engineering. Expert leaders in this field served as lectures for the school. The school program included lectures, active learning, project activities, poster presentations, and industry panel discussions. The school covered four topics: Fundamentals and Applications of Quantum Computing (2017), Fundamentals and Applications of Quantum Materials (2018), Fundamentals and Applications of Quantum Devices (2019), and Modern Synthesis of Quantum Materials (2022). In terms of intellectual merit, the school brought together students from different areas of research related to quantum science to educate them on a broad range of related topics, providing a unique crucible for the development of educational content and learning opportunities in a cross-disciplinary fashion in the context of quantum science and quantum engineering. In terms of broader impacts, this may serve to create a workforce which would accelerate research in quantum science, quantum engineering, and the development of new quantum technologies beneficial to society. Additionally, this may add to the training of a cadre of scientists and engineers to serve as future leaders in this research field.

42 ENGINEERING↗