Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer science, Physics”

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 379 records · Page 21

A Look At Topics and Topic Clusters for DOE Laboratories, 1996 - 2021 [Slides]

Beginning in 2018, Elsevier through its Scopus database introduced topics to further refine its classification of publications: Previous classification schemes used concepts such as subject areas, e.g., physics and astronomy, chemistry, computer science, etc.; Topics, in contrast, are much more granular. There are over 96,000 and their titles/contents are very specific, e.g., “Multilayers; Interfaces (materials); Individual layer." Elsevier topic clusters or Clarivate citation topics represent good approaches to examining an institution’s scientific productivity areas. These approaches have the granularity that is not present in the previous categorization approaches used by these databases. The Elsevier topic clusters for the DOE Laboratories do not appear to vary that much over the 1996 – 2021 period. In some cases (ANL, LBNL, LANL, ORNL, and PNNL), there were over 1000 topic clusters at these Laboratories, but a consistent set formed the core of the publication activity. Diversity is viewed as a desirable property of a research portfolio. Examining the balance component of the DOE laboratories, the spread is uneven or not diverse. This may be due to the missions of these laboratories. The balance of a single university was unequal too.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Understanding Technical and Psychosocial Barriers to Realizing FAIR Data Process

The present study investigates barriers and facilitators to the implementation of Findable, Accessible, Interoperable, and Reusable (FAIR) data processes within the Physical Sciences Division of the Computational Sciences Directorate (PCSD). Employing a dual-method approach consisting of surveys and focus group discussions, the study aims to illuminate the complex interplay between technical and psychosocial factors that influence FAIR data adoption.

42 ENGINEERING↗

Analog Computing for Science

Conventional digital computing faces fundamental physical limits: large scale computing systems already con sume tens of Megawatts of power, Dennard scaling has ended, and data movement costs dominate application performance. Next generation experimental facilities generate data at rates that overwhelm conventional pro cessing and demand real-time analysis at the source. Analog computing, which exploits the continuous dynamics of physical systems to perform computation, promises a transformative path toward orders-of-magnitude gains in energy efficiency and time-to-solution for scientific workloads.

97 MATHEMATICS AND COMPUTING↗

An Overview of Electric Vehicle Load Modeling Strategies for Grid Integration Studies

The adoption of electric vehicles (EVs) has emerged as a solution to reduce greenhouse gas emissions in the transportation sector, which has motivated the implementation of public policies to promote their use in several countries. However, the high adoption of EVs poses challenges for the electricity sector, as it would imply an increase in energy demand and possible impacts on the power quality (PQ) of the power grid. Therefore, it is important to conduct EV integration studies in the power grid to determine the amount that can be incorporated without causing problems and identify the areas of the power sector that will require reinforcements. Accurate EV load patterns are required for this type of study that, through mathematical modeling, reflect both the dynamic behavior and the factors that influence the decision to recharge EVs. This article aims to present an overview of EVs, examine the different factors considered in the literature for modeling EV load patterns, and review modeling methods. EV load modeling methods are classified into deterministic, statistical, and machine learning. The article shows that each modeling method has its advantages, disadvantages, and data requirements, ranging from simple load modeling to more accurate models requiring large datasets.

Computer Science↗

Trust-Based Detection and Mitigation of Cyber Attacks in Distributed Cooperative Control of Islanded AC Microgrids

In this study, we address the challenge of detecting and mitigating cyber attacks in the distributed cooperative control of islanded AC microgrids, with a particular focus on detecting False Data Injection Attacks (FDIAs), a significant threat to the Smart Grid (SG). The SG integrates traditional power systems with communication networks, creating a complex system with numerous vulnerable links, making it a prime target for cyber attacks. These attacks can lead to the disclosure of private data, control network failures, and even blackouts. Unlike machine learning-based approaches that require extensive datasets and mathematical models dependent on accurate system modeling, our method is free from such dependencies. To enhance the microgrid’s resilience against these threats, we propose a resilient control algorithm by introducing a novel trustworthiness parameter into the traditional cooperative control algorithm. Our method evaluates the trustworthiness of distributed energy resources (DERs) based on their voltage measurements and exchanged information, using Kullback-Leibler (KL) divergence to dynamically adjust control actions. We validated our approach through simulations on both the IEEE-34 bus feeder system with eight DERs and a larger microgrid with twenty-two DERs. The results demonstrated a detection accuracy of around 100%, with millisecond range mitigation time, ensuring rapid system recovery. Additionally, our method improved system stability by up to almost 100% under attack scenarios, showcasing its effectiveness in promptly detecting attacks and maintaining system resilience. These findings highlight the potential of our approach to enhance the security and stability of microgrid systems in the face of cyber threats.

Computer Science↗

Advancing Understanding and Design of Functional Materials Through Theoretical and Computational Chemical Physics

Theoretical and computational chemical physics and materials science offers great opportunity toward helping solve some of the grand challenges in science and engineering, because structure and properties of molecules, solids, and liquids are direct reflections of the underlying quantum motion of their electrons. With the advent of semilocal and especially nonlocal descriptions of exchange and correlation effects, density functional theory (DFT) can now describe bonding in molecules and solids with an accuracy which, for many classes of systems, is sufficient to compare quantitatively to experiments. It is therefore becoming possible to develop a semiquantitative description of a large number of systems and processes. In this chapter, we briefly review DFT and its various extensions to include nonlocal terms that are important for long-range dispersion interactions that dominate many self-assembly processes, molecular surface adsorption processes, solution processes, and biological and polymeric materials. Applications of DFT toward problems relevant to energy systems, including energy storage materials, functional nanoelectronics/optoelectronics, and energy conversion, are highlighted.

36 MATERIALS SCIENCE↗

Locust: C++ software for simulation of RF detection

The Locust simulation package is the new C++ software tool developed to simulate the measurement of time-varying electromagnetic fields using RF detection techniques. Modularity and flexibility allow for arbitrary input signals, while concurrently supporting tight integration with physics-based simulations as input. External signals driven by the Kassiopeia particle tracking package are discussed, demonstrating conditional feedback between Locust and Kassiopeia during software execution. An application of the simulation to the Project 8 experiment is described. Locust is publicly available at https://github.com/project8/locust_mc

97 MATHEMATICS AND COMPUTING↗

Benchmark of the KGMf with a coupled Boltzmann equation solver

The Kinetic Global Model framework (KGMf) is an open-source general-purpose global model (spatially averaged) simulation code developed to explore the reaction kinetics and pathways in plasma discharge systems. It contains species continuity and electron energy balance equations, with a time-dependent evaluated electron energy distribution function (EEDF) for electron impact reactions. The EEDF is utilized to determine the rate coefficients for electron impact reactions, which can have profound impact on the temporal evolutions of plasma parameters. Previously, the EEDF was commonly assumed as Maxwellian or an analytical function of the effective electron temperature. In this work, the KGMf is coupled with a Boltzmann equation (BE) solver to self-consistently compute the EEDF. The EEDF evolution frequency is determined based on relative changes of the reduced electric field. The KGMf is benchmarked with the ZDPlasKin code based on high-pressure low-temperature argon plasma discharge cases. Additionally, the temporal evolutions of reduced electric field, electron temperature, EEDF, reaction rates, and species densities, are obtained and compared under different discharge conditions, showing good agreement between the KGMf and the ZDPlasKin simulations. The application of the KGMf for predicting breakdown times in high power microwave discharges is also presented, which shows qualitative agreement with particle-in-cell simulations. The KGMf can be further applied for more complicated plasma discharge systems, where the reaction kinetics are more intricate (e.g., plasma-assisted combustion systems).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Request for Information: Access to Quantum Systems

Quantum science and technology is a focal point of research at Lawrence Livermore National Laboratory (LLNL). Quantum-coherent devices offer the potential for unprecedented precision in sensing and the ability to directly simulate complex quantum phenomena that have no known efficient classical algorithms. Thus, development and implementation of quantum technologies is expected to have a significant impact on our ability to address some of the most complex national security problems. LLNL maintains projects involving a broad spectrum of Quantum Information Science (QIS) research activities including investigating sources of decoherence, the 3DQ microscope, studies into quantum interconnects, 3-D printed ion traps, fusion energy and nuclear physics simulations, modeling for data-starved environments, and quantum sensing, including accelerometry and timing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of a High Fidelity System Analysis Code for Generation IV Reactors

Traditional nuclear reactor system analysis codes such as RELAP and TRAC employ an operator split methodology. In this approach, each of the physics (fluid flow, heat conduction and neutron diffusion) is solved separately and the coupling terms are done explicitly. This approach limits accuracy (first order in time at best) and makes the codes slow in running since the explicit coupling imposes stability restrictions on the time step size. These codes have been extensively tested and validated for the existing LWRs. However, for GEN IV nuclear reactor designs which tend to have long lasting transients resulting from passive safety systems, the performance is questionable and modern high fidelity simulation tools will be required. The requirement for accurate predictability is the motivation for a large scale overhaul of all of the models and assumptions in transient nuclear reactor safety simulation software. At INL we have launched an effort with the long term goal of developing a high fidelity system analysis code that employs modern physical models, numerical methods, and computer science for transient safety analysis of GEN IV nuclear reactors. Modern parallel solution algorithms will be employed through utilizing the nonlinear solution software package PETSc developed by Argonne National Laboratory. The physical models to be developed will have physically realistic length scales and time scales. The solution algorithm will be based on the physics-based preconditioned Jacobian-free Newton-Krylov solution methods. In this approach all of the physical models are solved implicitly and simultaneously in a single nonlinear system. This includes the coolant flow, nonlinear heat conduction, neutron kinetics, and thermal radiation, etc. Including modern physical models and accurate space and time discretizations will allow the simulation capability to be second order accurate in space and in time. This paper presents the current status of the development efforts as well as some results from analyzing a simplified primary system model of GNEP’s advanced burner test reactor (ABTR) designed by Argonne. Various transient analyses are performed with this simplified ABTR model to study two fundamental issues related to system analysis codes – accuracy of numeric algorithm and efficiency. The accuracy study is carried by comparing the second order method with the first order method. The results show that numerical errors in the first order method are large and it is very difficult to distinguish numerical errors from physical modeling errors. On the other hand, second order method yields small numerical errors and it is very easy to spot physical modeling errors. The efficiency study is carried out by comparing the time steps for the fully implicit solution algorithm versus CFL stability limit methods. The dynamic time steps used in a fully implicit method will adjust the time step to resolve the time scale during the various stages of a long lasting transient. This will make a computer code based on fully implicit methods run more efficiently versus a CFL stability limit method code like RELAP, in which a particle of fluid cannot cross a control volume in a single time step.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Deep learning of free boundary and Stefan problems

Free boundary problems appear naturally in numerous areas of mathematics, science and engineering. These problems present a great computational challenge because they necessitate numerical methods that can yield an accurate approximation of free boundaries and complex dynamic interfaces. In this work, we propose a multi-network model based on physics-informed neural networks to tackle a general class of forward and inverse free boundary problems called Stefan problems. Specifically, we approximate the unknown solution as well as any moving boundaries by two deep neural networks. Besides, we formulate a new type of inverse Stefan problems that aim to reconstruct the solution and free boundaries directly from sparse and noisy measurements. We demonstrate the effectiveness of our approach in a series of benchmarks spanning different types of Stefan problems, and illustrate how the proposed framework can accurately recover solutions of partial differential equations with moving boundaries and dynamic interfaces. All code and data accompanying this manuscript are publicly available at https://github.com/PredictiveIntelligenceLab/DeepStefan.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing properties of hadrons, nuclei and nuclear matter from quantum chromodynamics

The goal of the research of the William and Mary group (PI from Computer Science and Co-PI from Physics) is to develop algorithms that address the limitations in computational scalability of current methods in lattice QCD. Of particular interest is the problem of computing traces of certain functions of a matrix, which arises in nuclear physics calculations of disconnected diagrams and requires the solution of a large number of linear systems of equations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗