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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS2022

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗
DOE OSTI2026

Ride Pingo to Transit

In this project, we developed an on-demand microtransit first- and last-mile service. To integrate the service with fixed-route transit, we developed a feature called Transit Connect that prioritized riders’ on-time arrival at the transit station over other service requirements. We first prototyped service and related algorithms in a simulated environment, and then piloted the service in the city of Kent, Washington. Our algorithm incorporates request-specific hard drop-off deadlines to ensure timely arrivals for transit transfers. In the pilot, these constraints were obtained from GTFS Realtime data to accurately determine the schedule of the transit and the location of the stations. This approach introduced the ability to accept or decline new requests based on the timing of transit connections for these new requests and connection status of onboarding customers. The pilot (called “Ride Pingo to Transit”) deployed a fleet of three 14-person vans, ran from September 2021 to March 2023, and served a total of 21,329 trips. Transit Connect was offered for drop-offs at both Kent Station and the Kent Valley hub. In total, 2,844 such trips were completed. This dataset was collected from our pilot, which includes the following: - Requests: List of all trip requests, including those that were actually served and those not materialized. - Fleet: Daily vehicle service logs. - Service details: Daily vehicle stop logs (boarding and alighting). - Trip types: First mile, last mile, or point-to-point. ![pingo to transit](pingo-to-transit.jpg)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1984

Generating soft shadows with a depth buffer algorithm

Computer-synthesized shadows used to appear with a sharp edge when cast onto a surface. At present the production of more realistic, soft shadows is considered. However, significant costs arise in connection with such a representation. The current investigation is concerned with a pragmatic approach, which combines an existing shadowing method with a popular visible surface rendering technique, called a 'depth buffer', to generate soft shadows resulting from light sources of finite extent. The considered method represents an extension of Crow's (1977) shadow volume algorithm.

Brotman, L. S.↗
NASA NTRS1989

Learning in stochastic neural networks for constraint satisfaction problems

Researchers describe a newly-developed artificial neural network algorithm for solving constraint satisfaction problems (CSPs) which includes a learning component that can significantly improve the performance of the network from run to run. The network, referred to as the Guarded Discrete Stochastic (GDS) network, is based on the discrete Hopfield network but differs from it primarily in that auxiliary networks (guards) are asymmetrically coupled to the main network to enforce certain types of constraints. Although the presence of asymmetric connections implies that the network may not converge, it was found that, for certain classes of problems, the network often quickly converges to find satisfactory solutions when they exist. The network can run efficiently on serial machines and can find solutions to very large problems (e.g., N-queens for N as large as 1024). One advantage of the network architecture is that network connection strengths need not be instantiated when the network is established: they are needed only when a participating neural element transitions from off to on. They have exploited this feature to devise a learning algorithm, based on consistency techniques for discrete CSPs, that updates the network biases and connection strengths and thus improves the network performance.

Johnston, Mark D.↗
DOE OSTI2026

Intelligent Experiments through Real-Time AI: Fast Data Processing and Autonomous Detector Control for High-Energy Nuclear Experiments

The aim of this project is to develop software and hardware for fast real-time data processing and autonomous detector control and calibration for the sPHENIX and the future EIC experiments. Below summarizes Georgia Tech team efforts in the past year: 1. We developed a real-time clustering algorithm and FPGA-based pipeline architecture for processing fired pixel data from ALPIDE sensors in sPHENIX experiments. Our Columnar Clustering Co-Design introduces a hardware-aware, stream-friendly approach that segments pixel data by column pairs using a Column Pair Clustering (CPC) strategy, followed by Cluster Stitching to merge adjacent subclusters. Implemented in Vitis HLS, the pipeline comprises five stages—read-in, subclustering, stitching, analysis, and write-out—connected by tagged HLS streams with custom end-of-event signaling for robust synchronization. We designed a pipelined dataflow model optimized for throughput, low latency, and minimal buffering, enabling scalable clustering across events of arbitrary size. Our system maintains spatial precision via center-of-mass and shape key extraction and efficiently handles edge cases such as fragmented or nested clusters. Compared against DBSCAN in both software and hardware, our approach demonstrates competitive performance under FPGA constraints. 2. We also conducted a comprehensive algorithm-to-hardware co-design of connected component analysis tailored for sPHENIX experiments, focusing on real-time, low-latency processing using FPGAs and High-Level Synthesis (HLS). Starting from a Python-based particle tracking pipeline, the team translated the core logic—graph traversal via DFS and Union-Find—into an HLS-compatible C++ model, replacing dynamic memory and recursion with static arrays and pipelined control flow. The final design includes a fully streamed and dataflow-compatible Union-Find kernel optimized across five iterations, incorporating loop pipelining, array partitioning, AXI/FIFO interface tuning, and function flattening. Experimental results show up to 14.8× speedup over the CPU baseline, reducing per-graph latency to 1.58 μs and demonstrating strong resource efficiency with only ~7k LUTs and zero BRAM usage. The design maintains functional correctness against the Python reference using a Python-based C-simulation framework and Mean Squared Error metrics. This work validates the potential of HLS-driven FPGA designs for edge-level HEP data acquisition, laying a scalable foundation for future integration with real-time detector pipelines and multi-graph processing systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Electrical Fault and Power Quality Detection Algorithms and Customer-Owned DERs Monitoring with a Cyber Grid Guard System and DLT

In this study, the electrical fault and power quality detection algorithms and customer-owned DERs monitoring use cases were implemented, with a Cyber Grid Guard system and DLT. Electrical utilities continue to deploy more intelligent electronic devices (IEDs) inside and outside electrical substations, and are associated with customer-owned distributed energy resources (DERs). Data from these IEDs, such as power meters and protection relays, must be kept confidential and of high integrity. Blockchain technology has the potential to increase microgrid resilience by enhancing data sharing security. The growing use of IEDs and customer-owned renewable energy sources (DERs) may make it necessary to connect Distributed Ledger Technology (DLT) with power system applications. We implemented the electrical faulted phase detection and power quality monitoring algorithms with a Cyber Grid Guard (CGG) system using DLT. In addition, the DERs (wind turbine farms) use case and protective relay cyber-event tests were assessed, by using the CGG system with DLT. In the experimental model, the testbed was created by using a real-time simulator and CGG system with power meters/ protective relays in the loop. The data collected from the CGG system and IEDs were compared with the same time stamp source. These results showed the successful assessment of protection, control and monitoring applications using a CGG system with DLT. In the future, power system applications for the ESGT with DERs and the CGG system will be based on executing smart contracts between electrical utilities and customer-owned DERs.

Piesciorovsky, Emilio↗
DOE OSTI2024

Exploring the Landscape of Distributed Graph Clustering on Leadership Supercomputers

The rapid growth of large-scale datasets in fields like biology and social networks has driven the need for advanced graph analytics techniques. Community detection, a fundamental task in graph analytics, identifies closely connected groups of nodes within a network, providing valuable insights across various disciplines. This study focuses on two classic community detection methods, the Louvain algorithm and Markov Clustering (MCL), and evaluates the performance of two prominent distributed community detection algorithms: HiPDPL-GPU, our prior implementation, and HipMCL. We conduct experiments on GPU-accelerated heterogeneous HPC systems, Summit and Frontier, to assess their performance under varying conditions. Our objective is to identify the strengths and weaknesses of these algorithms in terms of scalability, and quality of solutions. We evaluate these algorithms on a diverse set of 70+ networks spanning 13 domains, with sizes ranging up to 4.2 billion edges. Our results demonstrate that HiPDPL-GPU consistently outperforms HipMCL, especially for large-scale networks. HiPDPL-GPU achieves significantly faster runtimes (47x to 1439x), higher modularity scores, and improved scalability. These findings highlight HiPDPL-GPU as a promising solution for efficient and effective large-scale graph analytics in diverse application domains, and provide insights into the feasibility of using MCL-based approaches for certain application domains.

Community detection, graph algorithms↗
NASA NTRS1985

AOTV bluff body flow - Relaxation algorithm

Preliminary investigations have led to the consideration of two classes of energy efficient aeroassisted orbital transfer vehicle (AOTV) concepts, with high and low L/D. The AOTV represent reentry space vehicles which are to fly hypersonically in the continuum upper reaches of the atmosphere. Problems arise in connection with convective and nonequilibrium radiative heating. As the possibilities for obtaining needed information by experimentation are limited, reliance must be placed on computational techniques to simulate testing of design concepts. A new relaxation algorithm for the compressible Navier-Stokes equations has been developed in the context of recent work with a conservative flux difference eigenvector split implicit upwind scheme CSCM (conservative supracharacteristics method). Attention is given to the CSCM implicit method, and early results for axisymmetric bluff body flow including complete forebody and base flow for a free flight range model drag brake AOTV.

Lombard, C. K.↗
NASA NTRS1991

New developments in astrodynamics algorithms for autonomous rendezvous

A the core of any autonomous rendezvous guidance system must be two algorithms for solving Lambert's and Kepler's problems, the two fundamental problems in classical astrodynamics. Lambert's problem is to determine the trajectory connecting specified initial and terminal position vectors in a specified transfer time. The solution is the initial and terminal velocity vectors. Kepler's problem is to determine the trajectory that stems from a given initial state (position and velocity). The solution is the state of an earlier or later specified time. To be suitable for flight software, astrodynamics algorithms must be totally reliable, compact, and fast. Although solving Lambert's and Kepler's problems has challenged some of the world's finest minds for over two centuries, only in the last year have algorithms appeared that satisfy all three requirements just stated. This paper presents an evaluation of the most highly regarded Lambert and Kepler algorithms.

Klumpp, Allan R.↗
DOE OSTI2020

Multilevel graph embedding

The goal of the present paper is the design of embeddings of a general sparse graph into a set of points in $\mathbb{R}^d$ for appropriate d ≥ 2. The embeddings that we are looking at here aim to keep vertices that are grouped in communities together and keep the rest apart. To achieve this property, we utilize coarsening that respects possible community structures of the given graph. We employ a hierarchical multilevel coarsening approach that identifies communities (strongly connected groups of vertices) at every level. The multilevel strategy allows any given (presumably expensive) graph embedding algorithm to be made into a more scalable (and faster) algorithm. We demonstrate the presented approach on a number of given embedding algorithms and large-scale graphs and achieve speed-up over the methods in a recent paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Field Enhancement Integration Design Featuring Misalignment Tolerance for Wireless EV Charging Using LCL Topology

This article proposes a magnetic integration design for EV wireless power transfer (WPT) systems, where the compensation and transmitting coils overlap one on top of the other to share the ferrite layer without any decoupling consideration. The magnetic field generated by both the compensation and transmitting coils are exploited to transfer power. To this end, a compensation method is proposed to enable magnetic field enhancement without any reactive power flow between the compensation and the transmitting coils, and to achieve input zero phase angle and constant current output. In addition, an efficient finite element analysis-based coil optimization algorithm is proposed to improve the coil misalignment tolerance on the horizontal plane, in which a reversely connected inner coil is used to stabilize the system output under misalignment conditions. Analytical and simulation results confirm transmission flux density enhancement and reduced leakage field characteristics of the proposed coil design. Finally, a scaled-down WPT prototype is built and tested to verify the performance and effectiveness of the design. The proposed design achieves 91.17% efficiency and misalignment tolerance up to 200 mm in any XY-direction while maintaining the power transfer and its efficiency. The results of this work provide insights into magnetic integration design of high-order compensation topologies featuring higher compactness, less ferrite usage, magnetic field enhancement, and misalignment tolerance for WPT systems.

42 ENGINEERING↗
DOE OSTI2023

A Deep Learning Filter for the Intraseasonal Variability of the Tropics

Abstract This paper presents a novel application of convolutional neural network (CNN) models for filtering the intraseasonal variability of the tropical atmosphere. In this deep learning filter, two convolutional layers are applied sequentially in a supervised machine learning framework to extract the intraseasonal signal from the total daily anomalies. The CNN-based filter can be tailored for each field similarly to fast Fourier transform filtering methods. When applied to two different fields (zonal wind stress and outgoing longwave radiation), the index of agreement between the filtered signal obtained using the CNN-based filter and a conventional weight-based filter is between 95% and 99%. The advantage of the CNN-based filter over the conventional filters is its applicability to time series with the length comparable to the period of the signal being extracted. Significance Statement This study proposes a new method for discovering hidden connections in data representative of tropical atmosphere variability. The method makes use of an artificial intelligence (AI) algorithm that combines a mathematical operation known as convolution with a mathematical model built to reflect the behavior of the human brain known as artificial neural network. Our results show that the filtered data produced by the AI-based method are consistent with the results obtained using conventional mathematical algorithms. The advantage of the AI-based method is that it can be applied to cases for which the conventional methods have limitations, such as forecast (hindcast) data or real-time monitoring of tropical variability in the 20–100-day range.

Stan, Cristiana↗
NASA NTRS1987

A system for routing arbitrary directed graphs on SIMD architectures

There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.

Tomboulian, Sherryl↗
NASA NTRS1994

Model reduction of nonsquare linear MIMO systems using multipoint matrix continued-fraction expansions

This paper deals with the multipoint Cauer matrix continued-fraction expansion (MCFE) for model reduction of linear multi-input multi-output (MIMO) systems with various numbers of inputs and outputs. A salient feature of the proposed MCFE approach to model reduction of MIMO systems with square transfer matrices is its equivalence to the matrix Pade approximation approach. The Cauer second form of the ordinary MCFE for a square transfer function matrix is generalized in this paper to a multipoint and nonsquare-matrix version. An interesting connection of the multipoint Cauer MCFE method to the multipoint matrix Pade approximation method is established. Also, algorithms for obtaining the reduced-degree matrix-fraction descriptions and reduced-dimensional state-space models from a transfer function matrix via the multipoint Cauer MCFE algorithm are presented. Practical advantages of using the multipoint Cauer MCFE are discussed and a numerical example is provided to illustrate the algorithms.

Guo, Tong-Yi↗
NASA NTRS2009

Multiscale Computer Simulation of Tensile and Compressive Strain in Polymer- Coated Silica Aerogels

While the low thermal conductivities of silica aerogels have made them of interest to the aerospace community as lightweight thermal insulation, the application of conformal polymer coatings to these gels increases their strength significantly, making them potentially useful as structural materials as well. In this work we perform multiscale computer simulations to investigate the tensile and compressive strain behavior of silica and polymer-coated silica aerogels. Aerogels are made up of clusters of interconnected particles of amorphous silica of less than bulk density. We simulate gel nanostructure using a Diffusion Limited Cluster Aggregation (DLCA) procedure, which produces aggregates that exhibit fractal dimensions similar to those observed in real aerogels. We have previously found that model gels obtained via DLCA exhibited stress-strain curves characteristic of the experimentally observed brittle failure. However, the strain energetics near the expected point of failure were not consistent with such failure. This shortcoming may be due to the fact that the DLCA process produces model gels that are lacking in closed-loop substructures, compared with real gels. Our model gels therefore contain an excess of dangling strands, which tend to unravel under tensile strain, producing non-brittle failure. To address this problem, we have incorporated a modification to the DLCA algorithm that specifically produces closed loops in the model gels. We obtain the strain energetics of interparticle connections via atomistic molecular statics, and abstract the collective energy of the atomic bonds into a Morse potential scaled to describe gel particle interactions. Polymer coatings are similarly described. We apply repeated small uniaxial strains to DLCA clusters, and allow relaxation of the center eighty percent of the cluster between strains. The simulations produce energetics and stress-strain curves for looped and nonlooped clusters, for a variety of densities and interaction parameters.

Good, Brian↗
NASA NTRSDate not supplied

Introducing Tropical Geometric Approaches to Delay Tolerant Networking Optimization

Delay Tolerant Networking (DTN) is the standard approach to the networking of space systems with the goal of supporting the Solar System Internet (SSI). Current space networks have a small scale and often depend on rigorously scheduled (pre-determined) contact opportunities; this manual approach inhibits scalability. The goal of this paper is to recast these scheduling problems in order to apply the optimization machinery of tropical geometry. Contact opportunities in space are dependent on such factors as orbital mechanics and asset availability, which induce time-varying connectivity; indeed, end-to-end connectivity might never occur. Routing optimization within this structure is classically difficult and typically utilizes Dijkstra's algorithm as applied to contact graphs. Alternatively, we follow the successes of tropical geometry in train schedule optimization, job assignments, and even traditional networking, by extending this approach to this more general (i.e. disconnected) problem space. These successes imply tropical geometry provides a useful framework in the context of DTNs, starting with applications to queuing theory and long-haul links. Recently, tropical geometry has been applied to parametric path optimization on graphs with variable edge weights. In this work, we extend these advances to account for the problem of routing in a space network, and find that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities. Our approach leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing. We discuss our tropical approach to DTN for two Python implementations, a Verilog Tropical ALU implementation, tropical frameworks for other parametric graph problems, and solution stability. Lastly, a program for future work is included to illuminate the path ahead.

Delay Tolerant Networking↗
NASA NTRS2023

Control and Scaling Approach for the Emulation of Dynamic Subscale Torque Loads

Research and development of electrified aircraft propulsion powertrains are relying on the use of electromechanical systems to emulate turbomachinery/rotor loads. Replacing a physical turbomachinery/rotor with a model driving a subscale electromechanical system capable of emulating subscale torque loads and responses is a lower risk, lower cost alternative to using the full-scale turbomachinery/rotor for initial control system verification. This paper outlines a novel control and scaling approach for emulating dynamic subscale torque loads using electric machine (EM) hardware for electrified aircraft propulsion research and development purposes. The approach, known as the Sliding Mode Impedance Controller with Scaling (SMICS), drives a mechanically coupled, two-EM system to behave like a subscale hardware representation of a hybrid-electric turbomachinery shaft. One EM reflects the inertial dynamics and torque load of the subscale turbomachinery under steady-state and transient operation while the second EM represents a motor/generator connected to the shaft, which is intended to hybridize the turbomachinery. This closed loop control and scaling algorithm applies impedance and sliding mode control schemes, along with parameter scaling, to match subscale, desired dynamics in real-time and to allow this system to be driven by a full-scale hybrid-electric turbomachinery model and control. The paper elaborates on the concept of the closed loop control and scaling approach and explains the significance of using impedance and sliding mode control. It shows a derivation of the closed loop control and scaling algorithm, its implementation, and presents a comparison of theoretical and actual simulation results acquired during hardware-in-the-loop testing of a partial turboelectric propulsion concept aircraft at the NASA Electric Aircraft Testbed (NEAT).The results show that the intended dynamic responses of the hardware and the aircraft model are achieved in both the time and frequency domain. Full scale propulsion control systems can be tested using this hardware and software approach.

Emulation↗