Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph optimization”

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 685 records · Page 38

Analyzing inference workloads for spatiotemporal modeling

Ensuring power grid resiliency, forecasting climate conditions, and optimization of transportation infrastructure are some of the many application areas where data is collected in both space and time. Spatiotemporal modeling is about modeling those patterns for forecasting future trends and carrying out critical decision-making by leveraging machine learning/deep learning. Once trained offline, field deployment of trained models for near real-time inference could be challenging because performance can vary significantly depending on the environment, available compute resources and tolerance to ambiguity in results. Users deploying spatiotemporal models for solving complex problems can benefit from analytical studies considering a plethora of system adaptations to understand the associated performance-quality trade-offs. To facilitate the co-design of next-generation hardware architectures for field deployment of trained models, it is critical to characterize the workloads of these deep learning (DL) applications during inference and assess their computational patterns at different levels of the execution stack. In this paper, we develop several variants of deep learning applications that use spatiotemporal data from dynamical systems. We study the associated computational patterns for inference workloads at different levels, considering relevant models (Long short-term Memory, Convolutional Neural Network and Spatio-Temporal Graph Convolution Network), DL frameworks (Tensorflow and PyTorch), precision (FP16, FP32, AMP, INT16 and INT8), inference runtime (ONNX and AI Template), post-training quantization (TensorRT) and platforms (Nvidia DGX A100 and Sambanova SN10 RDU). Overall, our findings indicate that although there is potential in mixed-precision models and post-training quantization for spatiotemporal modeling, extracting efficiency from contemporary GPU systems might be challenging. Instead, co-designing custom accelerators by leveraging optimized High Level Synthesis frameworks (such as SODA High-Level Synthesizer for customized FPGA/ASIC targets) can make workload-specific adjustments to enhance the efficiency.

97 MATHEMATICS AND COMPUTING↗

Crystal structure of ponazuril, C 18 H 14 F 3 N 3 O 6 S

The crystal structure of ponazuril has been solved and refined using synchrotron X-ray powder diffraction data, and optimized using density functional theory techniques. Ponazuril crystallizes in space group P2 1 /c (#14) with a = 8.49511(6), b = 12.38696(6), c = 18.84239(17) Å, β = 96.7166(4)°, V = 1969.152(12) Å 3 , and Z = 4. N–H∙∙∙O hydrogen bonds link the molecules into chains along the a-axis, with a graph set C1,1(6). The powder pattern has been submitted to ICDD for inclusion in the Powder Diffraction File™ (PDF®).

36 MATERIALS SCIENCE↗

Long plasma duration operation analyses with an international multi-machine (tokamaks and stellarators) database

Combined high-fusion performance and long-pulse operation is one of the key integration challenges for fusion energy development in magnetic devices. Addressing these challenges requires an integrated vision of physics and engineering aspects with the purpose of simultaneously increasing time duration and fusion performance. Significant progress has been made in tokamaks and stellarators, including very recent achievement in duration and/or performance. This progress is reviewed by analyzing the experimental data (109 plasma pulses with a total of 3200 data points, i.e. on average 29 data per pulse) provided by ten tokamaks (in alphabetical order: Axially Symmetric Divertor Experiment Upgrade, DIII-D, Experimental Advanced Superconducting Tokamak, Joint European Torus, JT-60 Upgrade, Korea Superconducting Tokamak Advanced Research, tokamak à configuration variable, Tokamak Fusion Test Reactor, Tore Supra, W Environment in Steady-State Tokamak) and two stellarators (Large Helical Device and Wendelstein 7-X) expanding the pioneering work of Kikuchi (Kikuchi M. and Azumi M. 2015 Frontiers in Fusion Research II: Introduction to Modern Tokamak Physics (Springer)). Data have been gathered up to January 2022 and coordination has been provided by the recently created International Energy Agency-International Atomic Energy Agency international Coordination on International Challenges on Long duration OPeration group. By exploiting the multi-machine international database, recent progress in terms of injected energies (e.g. 1730 MJ in L-mode, 425 MJ in H-mode), durations (1056 s in L-mode, 101 s in H-mode), injected powers, and sustained performance will be reviewed. Progress has been made to sustain long-pulse operation in tokamaks and stellarators with superconducting coils, actively cooled components, and/or with metallic walls. The graph of the fusion triple products as a function of duration shows a dramatic reduction of, at least two orders of magnitude when increasing the plasma duration from less than 1 s to 100 s. Indeed, long-pulse operation is usually reached in dominant electron-heating modes at reduced density (current drive optimization) but with low ion temperatures ranging from 1 to 3 keV for discharges above 100 s. Difficulties in extending the duration may arise from coupling high heating powers over long durations and the evolving plasma-wall interaction towards an unstable operational domain. Possible causes limiting the duration and critical issues to be addressed prior to ITER operation and DEMO design are reported and analyzed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Surface Hold Advisor Using Critical Sections

The Surface Hold Advisor Using Critical Sections is a system and method for providing hold advisories to surface controllers to prevent gridlock and resolve crossing and merging conflicts among vehicles traversing a vertex-edge graph representing a surface traffic network on an airport surface. The Advisor performs pair-wise comparisons of current position and projected path of each vehicle with other surface vehicles to detect conflicts, determine critical sections, and provide hold advisories to traffic controllers recommending vehicles stop at entry points to protected zones around identified critical sections. A critical section defines a segment of the vertex-edge graph where vehicles are in crossing or merging or opposite direction gridlock contention. The Advisor detects critical sections without reference to scheduled, projected or required times along assigned vehicle paths, and generates hold advisories to prevent conflicts without requiring network path direction-of-movement rules and without requiring rerouting, rescheduling or other network optimization solutions.

Law, Caleb Hoi Kei↗

TORCHE - Toolbox for Reactor Cross-Flow Heat Exchangers

As interest within the scientific community for the development of small modular reactors (SMRs) grows, utilizing compact and cross-flow heat exchangers present many design advantages. Cross-flow configurations of tube bundles allow water, liquid metal, or a molten salt to be contained within the tube side or shell side in an efficient spatial arrangement. The goal of this project is to provide the user with an easy-to-use set of tools for cross-flow heat exchanger design. The tools are intended to require little to no geometric set-up like meshing in a CFD code in order to enable rapid preliminary design and optimization. With this set of simple Python scripts, the user can determine the necessary quantities and correctional factors in order to assess the heat exchanger characteristics. The two characteristics used in designing novel and efficient heat exchangers incorporated into this work currently are pressure drop and heat transfer coefficients. In support of these efforts, the literature has been scoured for sources of experimental data and proposed methods for calculating pressure drop and heat transfer in cross-flow tube banks. Several empirical correlations and methodologies for calculating pressure drop and heat transfer incorporated into the Toolbox for Reactor Cross-Flow Heat Exchangers (TORCHE). TORCHE is an expansion on the cross-flow pressure drop scripts reported by Haefner et al.. Presented in this summary is a synopsis of the empirical correlations and methodologies of pressure drops and heat transfer coefficient. A validation effort of these models is also presented to provide confidence in the implementation. For this validation of TORCHE, experimental data has been gathered and extracted from graphs in the literature. Error bars were not reported in the experimental data used in this summary and therefore is not included in the analysis.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Affect of Brush Seals on Wave Rotor Performance Assessed

The NASA Lewis Research Center's experimental and theoretical research shows that wave rotor topping can significantly enhance gas turbine engine performance levels. Engine-specific fuel consumption and specific power are potentially enhanced by 15 and 20 percent, respectively, in small (e.g., 400 to 700 hp) and intermediate (e.g., 3000 to 5000 hp) turboshaft engines. Furthermore, there is potential for a 3- to 6-percent specific fuel consumption enhancement in large (e.g., 80,000 to 100,000 lbf) turbofan engines. This wave-rotor-enhanced engine performance is accomplished within current material-limited temperature constraints. The completed first phase of experimental testing involved a three-port wave rotor cycle in which medium total pressure inlet air was divided into two outlet streams, one of higher total pressure and one of lower total pressure. The experiment successfully provided the data needed to characterize viscous, partial admission, and leakage loss mechanisms. Statistical analysis indicated that wave rotor product efficiency decreases linearly with the rotor to end-wall gap, the square of the friction factor, and the square of the passage of nondimensional opening time. Brush seals were installed to further minimize rotor passage-to-cavity leakage. The graph shows the effect of brush seals on wave rotor product efficiency. For the second-phase experiment, which involves a four-port wave rotor cycle in which heat is added to the Brayton cycle in an external burner, a one-dimensional design/analysis code is used in conjunction with a wave rotor performance optimization scheme and a two-dimensional Navier-Stokes code. The purpose of the four-port experiment is to demonstrate and validate the numerically predicted four-port pressure ratio versus temperature ratio at pressures and temperatures lower than those that would be encountered in a future wave rotor/demonstrator engine test. Lewis and the Allison Engine Company are collaborating to investigate wave rotor integration in an existing turboshaft engine. Recent theoretical efforts include simulating wave rotor dynamics (e.g., startup and load-change transient analysis), modifying the one-dimensional wave rotor code to simulate combustion internal to the wave rotor, and developing an analytical wave rotor design/analysis tool based on macroscopic balances for parametric wave rotor/engine analysis.

Source record↗

Antenna Near-Field Probe Station Scanner

A miniaturized antenna system is characterized non-destructively through the use of a scanner that measures its near-field radiated power performance. When taking measurements, the scanner can be moved linearly along the x, y and z axis, as well as rotationally relative to the antenna. The data obtained from the characterization are processed to determine the far-field properties of the system and to optimize the system. Each antenna is excited using a probe station system while a scanning probe scans the space above the antenna to measure the near field signals. Upon completion of the scan, the near-field patterns are transformed into far-field patterns. Along with taking data, this system also allows for extensive graphing and analysis of both the near-field and far-field data. The details of the probe station as well as the procedures for setting up a test, conducting a test, and analyzing the resulting data are also described.

Zaman, Afroz J.↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

The Development of a Generalized Riser Flow Regime Map Based Upon Higher Moment and Chaotic Statistics Using Electrical Capacitance Volume Tomography (ECVT)

Dynamic analyses have been applied to the temporal signals from an Electro Capacitance Volume Tomography instrument located near mid-height on the riser of an industrial-scale cold-flow circulating fluidized bed to characterize gas-solids flow behavior in the riser. Twelve capacitance electrodes surround the cylindrical riser over a height of 1.3 m. The instrument used a neural network deconvolution algorithm to determine the spatially resolved solids fraction recorded at 52 Hz. Experiments were carried out over a range of gas and solids flows in the transport regime using a Geldart Group B bed material, high density polyethylene with mean particle size of 880 μm. The radial solids distribution was found to vary from one-time step to the next between profiles typical of laminar and turbulent flow. The duration of time spent in each of these flow profiles depended upon the operating regime – dilute, core-annular, or fast fluidized bed. The chaotic structure of the temporal data was characterized using the three conventional approaches: the first 4 moments from the distribution of signal in time, system memory parameters from the autocorrelation function and the Hurst exponent, and analysis of the correlationentropy and correlation dimension of the attractor. These signal analysis techniques were used to clearly distinguish differences between different transport operating regimes. Specifically, it was experimentally observed that a riser transitions from core annular flow profile to dilute and dense regimes via increasing the frequency of short term transients to either dilute or dense flow profiles, respectively. A regime map was generated based upon these dynamics using solids flux and gas velocity axes. Fast fluidized, core annular, and dilute each exhibited different degree of dynamic characteristics typical of fluid dominated or particle compromising behavior. It should be noted that the magnitude for the different statistics was in the same range regardless of the regime, it was the radial profile for the statistic that changed and subsequently identified that there was a change in the regime. Finally, a reduced regime map was developed consisting of plotting the gas velocity normalized by the upper transport velocity versus the solids flux normalized by the saturation carrying capacity. The use of this reduced plot allowed the data from widely different conditions to be plotted and compared on the same<p>graph. Note that in many instances, some of the statistics identified the operating point as being in one regime while others indicated that it was in another indicating a transition region between dilute or core annular regimes and between the core annular and fast fluidization regimes. This now provides a tool that can be used to optimize process performance, identify changes in operating states, or replicate process dynamics during process scaling or changing operating parameters. </p>

Breault, Ronald↗

Database and deep-learning scalability of anharmonic phonon properties by automated brute-force first-principles calculations

Understanding the anharmonic phonon properties of crystal compounds—such as phonon lifetimes and thermal conductivities—is essential for investigating and optimizing their thermal transport behaviors. These properties also impact optical, electronic, and magnetic characteristics through interactions between phonons and other quasiparticles and fields. In this study, we develop an automated first-principles workflow to calculate anharmonic phonon properties and build a comprehensive database encompassing more than 6500 inorganic compounds. Utilizing this dataset, we train a graph neural network model to predict thermal conductivity values and spectra from structural parameters, demonstrating a scaling law in which prediction accuracy improves with increasing training data size. High-throughput screening with the model enables the identification of materials exhibiting extreme thermal conductivities—both high and low. The resulting database offers valuable insights into the anharmonic behavior of phonons, thereby accelerating the design and development of advanced functional materials.

Ohnishi, Masato [University of Tokyo (Japan); Inst↗

Retrieving Top-k Hyperedge Triplets: Models and Applications

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions can- not be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods that analyze hypergraphs directly, rather than via lossy graph reductions, remain limited. Hypergraph motifs hold promise in this regard, as motif patterns serve as building blocks for larger group interactions which are inexpressible by graphs. Recent work has focused on categorizing and counting hypergraph motifs based on the existence of nodes in hyperedge intersection regions. Here, we argue that the relative sizes of hyperedge inter- sections within motifs contain varied and valuable information. We propose a suite of efficient algorithms for finding top-k triplets of hyperedges based on optimizing the sizes of these intersection patterns. This formulation uncovers interesting local patterns of interaction, finding hyperedge triplets that either (1) are the least similar with each other, (2) have the highest pairwise but not groupwise correlation, or (3) are the most similar with each other. We formalize this as a combinatorial optimization problem and design efficient algorithms based on filtering hyperedges. Our comprehensive experimental evaluation shows that the resulting hyperedge triplets yield insightful information on real-world hypergraphs. Our approach is also orders of magnitude faster than a naive baseline implementation.

hypergraphs, motifs, Combinatorial Algorithms↗

eCC++ : A Compiler Construction Framework for Embedded Domain-Specific Languages

eCC++ is a new compiler construction framework for embedding domain-specific programming languages within C++. That is, the host language is C++, the guest language is the DSL to be embedded in C++, and eCC++ is the tool that enables the embedding. The eCC++ framework is composed of three main components: a front-end, an API for program verification based on a functional and declarative intermediate representation (IR), and a Multi-Level Intermediate Representation (MLIR) code generator. The eCC++ front-end consists of a library of C++ classes and operators that can be used to define the guest language. Guest sources are compiled with any standard C++ compiler, and when run, the resulting executable generates an eCC++ IR representation of the program, which can be verified within the eCC++ framework. Finally, eCC++ allows for high-level and domain-specific optimizations before generating MLIR. In summary, eCC++ aims to act as a generic front-end that enables embedding guest languages into C++, and provides necessary compiler technology for program verification, targeting the existing capabilities in the MLIR infrastructure. The paper evaluates the eCC++ expressiveness and usability describing the process of embedding GraphIt, a high-performance graph language in C++.

Gonzalez Tallada, Marc↗

The inhibiting bisection problem.

Given a graph where each vertex is assigned a generation or consumption volume, we try to bisect the graph so that each part has a significant generation/consumption mismatch, and the cutsize of the bisection is small. Our motivation comes from the vulnerability analysis of distribution systems such as the electric power system. We show that the constrained version of the problem, where we place either the cutsize or the mismatch significance as a constraint and optimize the other, is NP-complete, and provide an integer programming formulation. We also propose an alternative relaxed formulation, which can trade-off between the two objectives and show that the alternative formulation of the problem can be solved in polynomial time by a maximum flow solver. Our experiments with benchmark electric power systems validate the effectiveness of our methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗

Data traffic reduction schemes for sparse Cholesky factorizations

Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.

Naik, Vijay K.↗

Translating Non-Trivial Algorithms from the Circuit Model to the Measurement

We provide a set of prescriptions for implementing a circuit model algorithm as measurement based quantum computing via a large discrete cluster state constructed sequentially, from qubits implemented as single photons. We describe a large optical discrete graph state capable of searching logical 4 and 8 element lists as an example. To do so we have developed several prescriptions based on analytic evaluation of the evolution of discrete cluster states and graph state equations. We describe the cluster state as a sequence of repeated entanglement and measurement steps using a small number of single photons for each step. These prescriptions can be generalized to implement any logical circuit model operation with appropriate single photon measurements and feed forward error corrections. Such a cluster state is not guaranteed to be optimal (i.e. minimum number of photons, measurements, run time).

Smith, IV, Amos M↗

SU-D-201-05: On the Automatic Recognition of Patient Safety Hazards in a Radiotherapy Setup Using a Novel 3D Camera System and a Deep Learning Framework

Purpose: Patient safety hazards such as a wrong patient/site getting treated can lead to catastrophic results. The purpose of this project is to automatically detect potential patient safety hazards during the radiotherapy setup and alert the therapist before the treatment is initiated. Methods: We employed a set of co-located and co-registered 3D cameras placed inside the treatment room. Each camera provided a point-cloud of fraxels (fragment pixels with 3D depth information). Each of the cameras were calibrated using a custom-built calibration target to provide 3D information with less than 2 mm error in the 500 mm neighborhood around the isocenter. To identify potential patient safety hazards, the treatment room components and the patient’s body needed to be identified and tracked in real-time. For feature recognition purposes, we used a graph-cut based feature recognition with principal component analysis (PCA) based feature-to-object correlation to segment the objects in real-time. Changes in the object’s position were tracked using the CamShift algorithm. The 3D object information was then stored for each classified object (e.g. gantry, couch). A deep learning framework was then used to analyze all the classified objects in both 2D and 3D and was then used to fine-tune a convolutional network for object recognition. The number of network layers were optimized to identify the tracked objects with >95% accuracy. Results: Our systematic analyses showed that, the system was effectively able to recognize wrong patient setups and wrong patient accessories. The combined usage of 2D camera information (color + depth) enabled a topology-preserving approach to verify patient safety hazards in an automatic manner and even in scenarios where the depth information is partially available. Conclusion: By utilizing the 3D cameras inside the treatment room and a deep learning based image classification, potential patient safety hazards can be effectively avoided.

60 APPLIED LIFE SCIENCES↗

Towards physics-informed explainable machine learning and causal models for materials research

From emergent material descriptions to estimation of properties stemming from structures to optimization of process parameters for achieving best performance – all key facets of materials science and related fields have experienced tremendous growth with the introduction of data-driven models. This gradual progression goes at par with developments of machine learning workflows, from purely data-driven shallow models to those that are well-capable in encoding more complex graphs, symbolic representations, invariances, and positional embeddings. Furthermore, this perspective aims at summarizing strategic aspects of such transitions while providing insights into the requirements of bringing in explainable, interpretable predictive models, and causal learning to aid in materials design and discovery. Although the focus remains on a variety of functional materials by providing a handful of case studies, the applications of such integrated methodologies are universal to facilitate fundamental understandings of materials physics while enabling autonomous experiments.

36 MATERIALS SCIENCE↗