Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 145 records · Page 8

Discovery of correlated electron molecular orbital materials using graph representations

Correlated electron molecular orbital (CEMO) materials host emergent electronic states built from molecular orbitals localized over clusters of transition metal ions yet have historically been discovered sporadically and generally been treated as isolated case studies. Here we establish CEMO materials as a systematically discoverable class and introduce a graph-based framework to identify, classify, and organize transition-metal cluster motifs in inorganic solids. Starting from crystal structures in the Materials Project, we construct transition metal connectivity graphs, extract cluster motifs using a bond-cutting algorithm, and determine cluster point groups, effective cluster sublattice dimensionality, and translational symmetry. Applying this approach in a high-throughput screen of 34,548 compounds yields 5,306 cluster-containing materials, including 2,627 stable or metastable compounds with isolated clusters and 984 materials featuring mixed-metal clusters. The resulting dataset reveals symmetry and element dependent trends in cluster formation. By integrating cluster classification with flat band lattice topology and battery-relevant information, we provide further relevant information to multiple scientific communities. The accompanying open dataset, Cluster Finder software, and interactive web platform enable systematic exploration of cluster driven electronic phenomena and establish a general pathway for discovering correlated quantum materials and functional materials with cluster-based or extended metal-metal bonding in inorganic solids.

Akhond, Md. Rajbanul [Department of Chemistry, 800↗

Gearbox bearing crack growth prognostics and uncertainty quantification with physics-informed machine learning

This paper introduces the extreme theory of functional connections (X-TFC), a physics-informed machine learning algorithm, and tailors it to estimate the remaining useful life (RUL) of wind turbine gearbox bearings experiencing fatigue crack growth. Unlike purely data-driven methods, X-TFC embeds a physics model, based on Head's theory in this work, into its training objective. The core of X-TFC is a random-projection single-layer neural network trained via an extreme learning machine, which requires only limited damage progression data and solves for output weights with a least-squares optimization algorithm. A composite loss function balances the network's fit to observed degradation data against the residuals of the governing crack growth differential equation, ensuring the learned damage trajectory remains physically plausible. When applied to a vibration-based health-index (HI) dataset measured during the growth of a crack on the inner ring of a high-speed bearing in a wind turbine gearbox (Bechhoefer and Dubé, 2020), X-TFC achieves near-zero prediction bias. Even when trained on only the first 10 %–20 % of the damage progression data, with sufficient physics weighting its predictions remain monotonic and smooth, delivering high prognosability and trendability. To quantify the epistemic uncertainty, we employ a Monte Carlo ensemble of independently initialized X-TFC models trained on noise-perturbed data, which yields confidence intervals around each RUL estimate and captures both model-parameter and epistemic uncertainty. In addition to a vibration-based HI, we demonstrate that the proposed framework can be directly applied to a supervisory control and data acquisition (SCADA) data-based HI (Eftekhari Milani et al., 2026) measured during similar wind turbine gearbox bearing crack faults, preserving its accuracy and interpretability. This extension shows the versatility of our approach, which is applicable to bearings of multiple gearbox manufacturers, models, and ratings using only SCADA data. By integrating domain knowledge with machine learning, X-TFC offers a rapid, reliable tool for crack prognostics. Its adaptability to other bearing failure modes, such as pitch bearing ring cracks, positions X-TFC as a powerful enabler of data-driven, physics-informed asset management in the wind energy sector and beyond.

17 WIND ENERGY↗

A Mobile Edge Computing Framework for Traffic Optimization At Urban Intersections Through Cyber-Physical Integration

The stop-and-go traffic pattern on urban roads often results in excessive energy consumption because of unnecessary vehicle braking, idling, and accelerations. With the widespread and increased use of automobiles, this traffic pattern creates many negative impacts (e.g., delayed travel time, air pollution, and additional carbon emission) on the sustainability of our cities. Taking advantage of the recent emerging Internet of Things (IoT) and edge computing paradigms, we propose a mobile edge computing framework that integrates the capability of real-time vehicle-to-infrastructure communication and intelligent speed optimization algorithms into a mobile app to optimize individual vehicles' driving speed at signalized intersections. The optimization aims to mitigate the stop-and-go traffic pattern and its undesirable consequences in urban transportation systems. The framework consists of (1) a cyberinfrastructure-enabled dynamic messaging system for retrieving and delivering real-time traffic and signal phase and timing information from IoT-connected signal controllers and sensors, (2) a real-time speed optimization algorithm for generating intelligent speed advisory using vehicle's information (e.g., GPS and driving directions from mobile sensing) and corresponding signal and traffic information, and (3) an ad-hoc mobile computing environment that converts drivers' smartphones into edge devices to host the speed optimization algorithms for enabling intelligent advisory on the vehicle's driving speed within signalized corridors. The paper presents the design and implementation of the proposed framework. Finally, we demonstrate the feasibility, usefulness, and energy-saving benefits of our proposed framework and its prototyping mobile app on urban transportation systems through traffic simulation, real-vehicle laboratory experiments, an evaluative survey, and field communication tests. The simulation-based energy evaluation results show that the 100% usage of the mobile app can achieve 24% energy savings in the transportation system.

33 ADVANCED PROPULSION SYSTEMS↗

Evaluating Connected and Automated Vehicles in Co-Simulation Environment of Traffic Microsimulation and Vehicle Dynamics

Connected and automated vehicles (CAVs) have the potential to improve many aspects of the current transportation systems such as safety, mobility, and energy efficiency. In order to evaluate the benefits and impacts of a CAV, the CAV control algorithm is typically implemented on vehicles simulated in a traffic microsimulation environment. However, traffic microsimulation usually lacks detailed vehicle and powertrain dynamics, making it challenging to fully understand how a CAV control algorithm will perform and respond on an actual vehicle. Whether the same benefits measured in the simulation will also be observed in real-world remains an open question. One potential approach to fill in this gap is to conduct a co-simulation of traffic microsimulation with detailed vehicle and powertrain dynamics models, often developed in MATLAB Simulink. However, current microsimulation tools such as VISSIM and SUMO do not have a ready-to-use interface for co-simulation with vehicle dynamics and Simulink. Also, even if such an interface exists, it will be tool-specific, making it challenging to shift from one tool to another or test CAV controls in different tools. There are needs for tool-agnostic co-simulation as different microsimulation tools have their pros and cons, and researchers often need to use different tools based on the purposes of the simulation, project needs, and applications. In this work, Flexible Interface for X-in-the-loop Simulation (FIXS) is developed that can support the co-simulation of microsimulation, CAV control algorithm, and vehicle dynamics model in Simulink. Enabled by the FIXS, the benefit and performance of a CAV control algorithm can be better understood with the consideration of vehicle responses and dynamics. The connection to VISSIM and SUMO is handled internally by the interface, and users can easily switch tools by changing a configuration file. The co-simulation capability is demonstrated for a VISSIM eco-approach and departure CAV scenario and a SUMO cooperative merging scenario for both a passenger CAV and a class 8 heavy-duty connected and automated trucks.

Shao, Yunli↗

Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm

The HHL algorithm is a prominent quantum algorithm that offers exponential speedup over its classical counterparts for solving a system of linear equations. However, synthesizing and executing HHL circuits demand significant computational resources from both classical and quantum systems. In this paper, we benchmark the HHL algorithm using the optimized Quantum Phase Estimation (QPE) generation algorithm, LuGo \cite{lu2025lugo}, to enhance its scalability and efficiency. We leverage the National Energy Research Scientific Computing Center's (NERSC) Perlmutter supercomputer to evaluate the scalability of generating HHL circuits and to measure the time to simulate the generated circuits. Additionally, we provide a comprehensive analysis of the algorithm's performance on various state-of-the-art superconducting and trapped-ion quantum devices, including studies on qubit connectivity, fidelity comparisons, and hardware compatibility and robustness. Our results offer preliminary insights into potential practical applications of the HHL algorithm enabled by LuGo and the performance of various types of quantum hardware.

Lu, Chao [ORNL] (ORCID:0000000179346933)↗

Modular Quantum Processor with an All-to-All Reconfigurable Router

Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more flexible connectivity, which is particularly appealing in light of recent developments in error-correcting codes, however, usually involves complex multilayer packaging and external cabling, which is resource intensive and can impose fidelity limitations. Here, we propose and realize a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We implement the design in a four-node quantum processor, built with a modular design comprising a wiring substrate coupled to two separate qubit-bearing substrates, each including two single-qubit nodes. We use this device to demonstrate reconfigurable controlled-𝑍 gates across all qubit pairs, with a benchmarked average fidelity of 96.00% ± 0.08% and best fidelity of 97.14% ± 0.07%, limited mainly by dephasing in the qubits. We also generate multiqubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of 88.15% ± 0.24% and 75.18% ± 0.11%, respectively. This approach promises efficient scaling to larger-scale quantum circuits and offers a pathway for implementing quantum algorithms and error-correction schemes that benefit from enhanced qubit connectivity.

Quantum circuits↗

Investigating the Chinese postman problem on a quantum annealer

The recent availability of quantum annealers has fueled a new area of information technology where such devices are applied to address practically motivated and computationally difficult problems with hardware that exploits quantum mechanical phenomena. D-Wave annealers are promising platforms to solve these problems in the form of quadratic unconstrained binary optimization. Here we provide a formulation of the Chinese postman problem that can be used as a tool for probing the local connectivity of graphs and networks. We treat the problem classically with a tabu algorithm and simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. We systematically analyze computational parameters associated with the specific hardware. Our results clarify how the interplay between the embedding due to limited connectivity of the Chimera graph, the definition of logical qubits, and the role of spin-reversal controls the probability of reaching the expected solution

36 MATERIALS SCIENCE↗

Architecture for Quantum-in-the Loop Real-Time Simulations for Designing Resilient Smart Grids

With the power grid growing more complex every day with the inclusion of new sensors and regulatory approvals that enable end-users and small local developers to participate in the grid, it is becoming challenging for conventional smart grid simulation, emulation, and testing technologies to keep up. In this work, we propose that quantum-encoded real-time simulations can be helpful under the new paradigm and operational circumstances to solve optimization problems for power grids. By leveraging the principles of quantum mechanics, the proposed quantum-in-loop (QIL) framework will enable better and faster optimization solutions based on real-world, real-time data streams, facilitating the real-time planning and operations of electrical grids that rely on millions of distributed sensors and controllers. Furthermore, QIL will allow researchers and engineers to assist utilities in designing, developing, and de-risking algorithms to optimize power grid operation and resilience by considering inputs from millions of grid-connected devices. QIL framework is being developed to have a self-limiting triage mechanism, which will help engineers and practitioners identify fundamental physical limits on quantum processors, revealing what quantum algorithms can and cannot do in utility-specific use cases and must continue to count on classical high-performance computing infrastructure.

digital real-time simulation↗

High-bandwidth image-based predictive laser stabilization via optimized Fourier filters

Controlling the delivery of kHz-class pulsed lasers is of interest in a variety of industrial and scientific applications, from next-generation laser-plasma acceleration to laser-based x-ray emission and high-precision manufacturing. The transverse position of the laser pulse train on the application target is often subject to fluctuations by external drivers (e.g., room cooling and heating systems, motorized optics stages and mounts, vacuum systems, chillers, and/or ground vibrations). For typical situations where the disturbance spectrum exhibits discrete peaks on top of a broad-bandwidth lower-frequency background, traditional PID (proportional-integral-derivative) controllers may struggle, since as a general rule PID controllers can be used to suppress vibrations up to only about 5%–10% of the sampling frequency. Here, a predictive feed-forward algorithm is presented that significantly enhances the stabilization bandwidth in such laser systems (up to the Nyquist limit at half the sampling frequency) by online identification and filtering of one or a few discrete frequencies using optimized Fourier filters. Furthermore, the system architecture demonstrated here uses off-the-shelf CMOS cameras and piezo-electric actuated mirrors connected to a standard PC to process the alignment images and implement the algorithm. To avoid high-end, high-cost components, a machine-learning-based model of the piezo mirror’s dynamics was integrated into the system, which enables high-precision positioning by compensating for hysteresis and other hardware-induced effects. A successful demonstration of the method was performed on a 1 kHz laser pulse train, where externally-induced vibrations of up to 400 Hz were attenuated by a factor of five, far exceeding what could be done with a standard PID scheme.

Natal, Joseph↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

Homomorphic Encryption for Machine Learning and Artificial Intelligence Applications

Third-party and expert analysis is a cost-effective solution for solving specialized problems or processing large datasets related to reactor structural health monitoring and nondestructive evaluation. However, when handling proprietary information, third-party and expert analysts pose a privacy risk. To address this challenge, Homomorphic Encryption (HE) permits arithmetic operations on encrypted data without exposing the underlying data. Implementations of Machine Learning (ML) and Artificial Intelligence (AI) algorithms using HE greatly enhances the capabilities of third-party analysts while maintaining a low security risk. This paper details current success in applying Principal Component Analysis (PCA) and Fully Connected Neural Networks (NN) using the Microsoft SEAL implementation of the popular CKKS Fully Homomorphic Encryption (FHE) algorithm. The MNIST Handwritten Dataset is analyzed as a proof-of-concept demonstration of the implementations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a nearly autonomous management and control system for advanced reactors

This presentation discusses the development of a Nearly Autonomous Management and Control (NAMAC) system for advanced reactors. This presentation first introduces the NAMAC-enabled plant control. Next, this presentation introduces major technologies of implementing NAMAC, including operational workflow, digital twin, and advanced machine learning algorithms. To demonstrate the capability of the NAMAC system, NAMAC is connected with a simulator of the Experimental Breeder Reactor II, where NAMAC is activated to provide recommendations during a single loss of flow accident.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Finding diverse ways to improve algebraic connectivity through multi-start optimization

The algebraic connectivity, also known as the Fiedler value, is a spectral measure of network connectivity that can be increased through edge addition. We present an algorithm for producing many diverse ways to add a fixed number of edges to a network to achieve a near optimal Fiedler value. Previous Fielder value optimization algorithms (i.e. the greedy algorithm) output only one solution. Obtaining a single solution is rarely good enough for real-world network redesign problems, as practical constraints (political, physical or financial) may prevent implementation. Our algorithm takes a multi-start optimization approach, adding a random initial edge and then applies a greedy heuristic to improve the Fiedler value. The random choice moves us to a new region of the search space, enabling discovery of diverse solutions. Additionally, we present a Determinantal Point Process framework for quantifying diversity. We then apply a Markov chain Monte Carlo technique to sift through the large number of output solutions and locate a smaller, more manageable collection of highly diverse solutions that can be presented to network redesign engineers. We demonstrate the effectiveness of our algorithm on real-world graphs with varied structures.

97 MATHEMATICS AND COMPUTING↗

A Framework for Compressing Unstructured Scientific Data via Serialization

We present a general framework for compressing unstructured scientific data with known local connectivity. A common application is simulation data defined on arbitrary finite element meshes. The framework employs a greedy topology preserving reordering of original nodes which allows for seamless integration into existing data processing pipelines. This reordering process depends solely on mesh connectivity and can be performed offline for optimal efficiency. However, the algorithm’s greedy nature also supports on-the-fly implementation. The proposed method is compatible with any compression algorithm that leverages spatial correlations within the data. The effectiveness of this approach is demonstrated on a large-scale real dataset using several compression methods, including MGARD, SZ, and ZFP.

Reshniak, Viktor [ORNL] (ORCID:0000000315454462)↗

Enabling Seamless Integration of EV Charging Infrastructure with Weak Electric Grids

Widespread adoption of Electric Vehicles (EVs) for light, medium, and heavy-duty applications has gained significant interest. Based on ownership and user preferences, light duty and local delivery medium-duty EVs are typically connected to grid distribution networks whereas larger medium duty and heavy-duty EVs are typically connected to distribution or even sub-transmission networks. Challenges with at-scale EVs and charging infrastructure supporting them include interoperability, distribution network upgrades, surge in demand charges, power quality issues, voltage stability, etc. Based on real-world data, steady-state and dynamic assessments of light-duty EV charging with a focus on DC Fast Charging (DCFC) for weak distribution grids is presented. Three main areas of contributions in this paper include - steady state and dynamic power quality measurements and assessments using real world data, transient assessments of light duty EV integration with weak distribution networks (IEEE 13 node feeder system) under grid-connected and microgrid modes, and formulation of an intelligent charging decision algorithm to enable an impact-minimal charging.

actionable intelligence↗

Comparison of the spatial statistics of random and defined-sequence photoresist films

The resolution-line edge roughness-sensitivity tradeoff has motivated the exploration of potential improvements using defined sequence polymers and polymer-bound photoacid generators and quenchers. We characterize the internal structures of positive tone photoresist polymer films formed from defined sequence polymers and compare them with random copolymers of the same composition. We model their imaging to connect initially to developable film structures. We use a polymer packing algorithm to simulate films of diverse compositions and locations of photoacid generators and quenchers, using the composition of an ESCAP photoresist. We use a simple extreme ultraviolet exposure-deprotection algorithm to model developable image formation within them. In all cases, the spatial distribution of chemical moieties in the film for defined sequence polymers is nearly indistinguishable from random copolymers. We evaluate several exposure-deprotection scenarios and find that a defined sequence copolymer has a distinctive developable image under certain circumstances. The use of defined sequence polymers within a photoresist layer does not automatically result in improved imaging; however, they do have some characteristics different from random polymers of the same composition. Further study of these characteristics may provide a route to improved control over the nanoscale imaging process.

36 MATERIALS SCIENCE↗

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗

Continuous thermostat setpoint monitoring and correction (Thermostat setpoint correction) v1.0

The Continuous Thermostat Setpoint Monitoring and Correction software is a set of fault detection and correction algorithms that can be implemented in thermostats with two-way OpenAPIs. It is written in the Python language. The algorithms aim to detect the most common and impactful efficiency problems associated with thermostat setpoints - overly aggressive heating or cooling setpoints, incorrect schedules/setbacks, and overly narrow deadbands. These algorithms can automatically detect faults, and implement associated corrective actions to bring the system back to a state of efficient operation. The algorithms can run remotely in the cloud, and directly implemented by connected thermostat manufacturers, or by third party service providers. The software enables a lightweight cost-effective energy management strategy for HVAC systems. The solution is specially viable for small and medium sized commercial buildings, where a full scale building automation system and fault detection and diagnostic tools are often unavailable.

Granderson, Jessica↗