Search NASA⌕ Search

SEARCH · Search NASA

Results for “connected components”

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 127 records · Page 7

Cylinders’ percolation: Decoupling and applications

In this paper we establish a strong decoupling inequality for the cylinder’s percolation process introduced by Tykesson and Windisch (Probab. Theory Related Fields 154 (2012) 165–191). This model features a very strong dependency structure, making it difficult to study, and this is why such decoupling inequalities are desirable. It is important to notice that the type of dependencies featured by cylinder’s percolation is particularly intricate, given that the cylinders have infinite range (unlike some models like Boolean percolation) while at the same time being rigid bodies (unlike processes such as random interlacements). Here our work introduces a new notion of fast decoupling, proves that it holds for the model in question and finishes with an application. More precisely, we prove that for a small enough density of cylinders, a random walk on a connected component of the vacant set is transient for all dimensions d≥3.

97 MATHEMATICS AND COMPUTING↗

Characterizing the field of Atomic Layer Deposition: Authors, topics, and collaborations

This paper describes how Atomic Layer Deposition (ALD) has evolved over time using a combination of bibliometric, social network, and text analysis. We examined the rate of knowledge production as well as changes in authors, journals, and collaborators, showing a steady growth of ALD research. The study of the collaboration network of ALD scientists over time points out that the ALD research community is becoming larger and more interconnected, with a largest connected component that spans 90% of the authors in 2015. In addition, the evolution of network centrality measures (degree and betweenness centrality) and author productivity revealed the central figures in ALD over time, including new “stars” appearing in the last decade. Finally, the study of the title words in our dataset is consistent with a shift in focus on research topics towards energy applications and nanotechnology.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

General Critical Properties of the Dynamics of Scientific Discovery

Scientific fields are difficult to define and compare, yet there is a general sense that they undergo similar stages of development. From this point of view it becomes important to determine if these superficial similarities can be translated into a general framework that would quantify the general advent and subsequent dynamics of scientific ideas. Such a framework would have important practical applications of allowing us to compare fields that superficially may appear different, in terms of their subject matter, research techniques, typical collaboration size, etc. Particularh' important in a field's history is the moment at which conceptual and technical unification allows widespread exchange of ideas and collaboration, at which point networks of collaboration show the analog of a percolation phenomenon, developing a giant connected component containing most authors. Here we investigate the generality of this topological transition in the collaboration structure of scientific fields as they grow and become denser. We develop a general theoretical framework in which each scientific field is an instantiation of the same large-scale topological critical phenomenon. We consider whether the evidence from a variety of specific fields is consistent with this picture, and estimate critical exponents associated with the transition. We then discuss the generality of the phenomenon and to what extent we may expect other scientific fields — including very large ones — to follow the same dynamics.

99 GENERAL AND MISCELLANEOUS↗

Multiplicative Attribute Graph Model of Real-World Networks

Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

97 MATHEMATICS AND COMPUTING↗

DOE Hybrid and Electric Vehicle Test Platform

Based on the contract NT-42790 to the Department of Energy, “Plug-in Hybrid Ethanol Research Platform”, Advanced Vehicle Research Center (AVRC) Virginia has successfully developed the phase I electric drive train research platform which has been named as Laboratory Rapid Application Testbed (LabRAT). In phase II, LabRAT is to be upgraded into plug-in hybrid research platform, which will be capable of testing power systems for electric vehicles, and plug-in hybrid electric vehicles running on conventional as well as alternative fuels. LabRAT is configured as a rolling testbed with plentiful space for installing various component configurations. Component connections are modularized for flexibility and are easily replaced for testing various mechanisms. LabRAT is designed and built as a full functional vehicle chassis with a steering system, brake system and four wheel suspension. The rear drive axle offers maximum flexibility with a quickly changeable gear ratio final drive to accommodate different motor speed requirements. The electric drive system includes an electric motor which is mechanically connected to the rear axle through an integrated speed/torque sensor. Initially, a 100 kW UQM motor and corresponding UQM motor controller is used which can be easily replaced with another motor/controller combination. A lithium iron phosphate (LiFePO4) battery pack is installed, which consists of 108 cells of 100 AH capacity, giving the total energy capacity of 32.5 kWh. Correspondingly, a fully functional battery management system (BMS) is installed to perform battery cell operation monitoring, cell voltage balancing, and reporting battery real time operating parameters to vehicle controller. An advanced vehicle controller ECU is installed for controlling the drive train. The vehicle controller ECU receives traction or braking torque command from driver through accelerator and brake pedal position sensors and battery operating signals from the BMS through CAN BUS, and then generates motor torque command (traction or braking) to the motor controller based on the control algorithm software embedded in the vehicle controller ECU. The vehicle controller ECU is a re-programmable electronic control unit. Any control algorithm software developed can be easily downloaded to vehicle controller ECU to test any newly developed control strategy. The flexibility of the control system significantly enhances the practical applicability of the LabRAT. A new test methodology has been developed for the LabRAT simulating any vehicles running on road with different weights from compact passenger car to light duty truck on an AC or eddy current dynamometers without much effort for modification of the system. LabRAT is equipped with a fully functional data acquisition system supplied by CyberMetrix. The measurement points along the drive train are DC electric power between battery pack and motor controller input, AC electric power between motor controller and electric motor, mechanical power between motor and rear axle. The data acquisition system is designed with more capability than current requirements in order to meet the requirements for phase II.

33 ADVANCED PROPULSION SYSTEMS↗

Rutgers University Subcontract B611610 Final Report

Given an incomplete (i.e., partially-observed) network, which nodes should we actively probe in order to achieve the highest accuracy for a given network feature? For example, consider a cyber-network administrator who observes only a portion of the network at time t and wants to accurately identify the most important (e.g., highest PageRank) nodes in the complete network. She has a limited budget for probing the network. Of all the nodes she has observed, which should she probe in order to most accurately identify the important nodes? We propose a novel and scalable algorithm, MaxOutProbe, and evaluate it w.r.t. four network features (largest connected component, PageRank, core-periphery, and community detection), five network sampling strategies, and seven network datasets from different domains. Across a range of conditions, MaxOutProbe demonstrates consistently high performance relative to several baseline strategies

97 MATHEMATICS AND COMPUTING↗

Highlights of X-Stack ExM Deliverable Swift/T

Swift/T is a key success from the ExM: System support for extreme-scale, many-task applications1 X-Stack project, which proposed to use concurrent dataflow as an innovative programming model to exploit extreme parallelism in exascale computers. The Swift/T component of the project reimplemented the Swift language from scratch to allow applications that compose scientific modules together to be build and run on available petascale computers (Blue Gene, Cray). Swift/T does this via a new compiler and runtime that generates and executes the application as an MPI program. We assume that mission-critical emerging exascale applications will be composed as scalable applications using existing software components, connected by data dependencies. Developers wrap native code fragments using a higherlevel language, then build composite applications to form a computational experiment. This exemplifies hierarchical concurrency: lower-level messaging libraries are used for fine-grained parallelism; highlevel control is used for inter-task coordination. These patterns are best expressed with dataflow, but static DAGs (i.e., other workflow languages) limit the applications that can be built; they do not provide the expressiveness of Swift, such as conditional execution, iteration, and recursive functions.

97 MATHEMATICS AND COMPUTING↗

Initial Assessment of X-Ray Computer Tomography image analysis for material defect microstructure

The original development work leading to this report was focused on the non destructive three-dimensional (3-D) characterization of nuclear graphite as a means to better understand the nature of the inherent pore structure. The pore structure of graphite and its evolution under various environmental factors such as irradiation, mechanical stress, and oxidation plays an important role in their observed properties and characteristics. If we are to transition from an empirical understanding of graphite behavior to a truly predictive mechanistic understanding the pore structure must be well characterized and understood. As the pore structure within nuclear graphite is highly interconnected and truly 3-D in nature, 3-D characterization techniques are critical. While 3-D characterization has been an excellent tool for graphite pore characterization, it is applicable to a broad number of materials systems over many length scales. Given the wide range of applications and the highly quantitative nature of the tool, it is quite surprising to discover how few materials researchers understand and how valuable of a tool 3-D image processing and analysis can be. Ultimately, this report is intended to encourage broader use of 3 D image processing and analysis in materials science and engineering applications, more specifically nuclear-related materials applications, by providing interested readers with enough familiarity to explore its vast potential in identifying microstructure changes. To encourage this broader use, the report is divided into two main sections. Section 2 provides an overview of some of the key principals and concepts needed to extract a wide variety of quantitative metrics from a 3-D representation of a material microstructure. The discussion includes a brief overview of segmentation methods, connective components, morphological operations, distance transforms, and skeletonization. Section 3 focuses on the application of concepts from Section 2 to relevant materials at Idaho National Laboratory. In this section, image analysis examples featuring nuclear graphite will be discussed in detail. Additionally, example analyses from Transient Reactor Test Facility low-enriched uranium conversion, Advanced Gas Reactor like compacts, and tristructural isotopic particles are shown to give a broader perspective of the applicability to relevant materials of interest.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

In Situ Indexing and Query Processing of AMR Data

We have developed the first, holistic, Adaptive Mesh Refinement (AMR) capable, in situ query framework to ensure the tractability of the current- and next-generation AMR simulation analysis on the path to extreme scale. We have addressed key issues pertaining to in situ analysis, memory hierarchy, generalized parallel indexing, index-compression, and real-time access pattern detection. We have published the following research papers in high profile peer reviewed computer science conferences: (a) Parallel In Situ Detection of Connected Components in Adaptive Mesh Refinement Data; (b) AMR-aware In Situ Indexing and Scalable Querying; (c) Pattern-driven dynamic data layout optimization; (d) In situ Storage Layout Optimization for AMR Spatio-temporal Read Accesses; (e) AMRZone: A Runtime AMR Data Sharing Framework for Scientific Applications; (f) Exploring Memory Hierarchy and Network Topology for Runtime AMR Data Sharing Across Scientific Applications.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

High Altitude Electromagnetic Pulse Testing of Photovoltaic Modules

This report details the test setup, process, and results for radiated susceptibility testing of multicrystalline silicon photovoltaic (PV) modules as part of the EMP-Resilient Electric Grid Grand Challenge Laboratory Directed Research and Development (LDRD) project at Sandia National Laboratories. Testing was conducted over October 10-17, 2019, where 8 photovoltaic modules were exposed to E1 transient pulses with peak field levels up to 100 kV/m. Modules were terminated in a resistive load representing connected components. State of health testing conducted via I-V curve tracing of the photovoltaic modules showed no observable loss of device function due to large electric field transients. Differential mode currents were measured on the order of 10's of amps for up to a microsecond following the radiated field pulse. Common mode currents took the form of a damped sinusoid with a maximum peak of 10's to 100's of amps with a resonance near 60 MHz.

14 SOLAR ENERGY↗

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗

Quantum Search Approaches to Sampling-Based Motion Planning

In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse environments, we formulate the Quantum Full Path Search Algorithm (q-FPS), which creates a superposition of full random path solutions, manipulates probability amplitudes with Quantum Amplitude Amplification (QAA), and quantum measures a single obstacle free full path solution. For dense unstructured environments, we formulate the Quantum Rapidly Exploring Random Tree algorithm, q-RRT, that creates quantum superpositions of possible parent-child connections, manipulates probability amplitudes with QAA, and quantum measures a single reachable state, which is added to a tree. As performance depends on the number of oracle calls and the probability of measuring good quantum states, we quantify how these errors factor into the probabilistic completeness properties of the algorithm. We then numerically estimate the expected number of database solutions to provide an approximation of the optimal number of oracle calls in the algorithm. We compare the q-RRT algorithm with a classical implementation and verify quadratic run-time speedup in the largest connected component of a 2D dense random lattice. We conclude by evaluating a proposed approach to limit the expected number of database solutions and thus limit the optimal number of oracle calls to a given number.

97 MATHEMATICS AND COMPUTING↗

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↗

rustpix

rustpix is a high-performance, open-source Rust library with first-class Python bindings (via PyO3) for processing pixel-detector data in neutron imaging. It targets time-stamping detectors such as Timepix3 (TPX3) at ORNL's Spallation Neutron Source (VENUS beamline), where each detected neutron deposits charge across a cluster of pixels within a very high-rate event stream (96M+ hits/sec). rustpix parses TPX3 event data in parallel using memory-mapped I/O, offers four interchangeable clustering algorithms (ABS adjacency-based search, DBSCAN, graph/union-find connected components, and a parallel grid method), and extracts weighted, super-resolved centroids to produce neutron-event lists. A streaming architecture lets it process files larger than available memory. rustpix is distributed as a pip-installable Python package (with NumPy integration), Rust crates, a command-line tool, and an interactive GUI; it writes HDF5, Apache Arrow, and CSV; and it is designed to extend to TPX4 and other detector types. Released as open-source under the MIT License.

Zhang, Chen [Oak Ridge National Laboratory (ORNL),↗

Serpentuator simulation using MARSYAS

The Serpentuator is a serpentine teleoperator device for intraand extravehicular activities in space. It is simulated using the digital simulation software MARSYAS. Direct Simulation (DS) and Component-Connection Simulation (CCS) models are set up. The simulation execution time for the CCS model is less than that of the DS model by a factor of the order of 100. A visual display of the Serpentuator positions is obtained using AMTRAN.

Singh, S. P.↗

The geometry of the partial realization problem

It is shown that the space of sequences of length n which have an extrapolation of McMillan degree k, and no extrapolations of lower McMillan degree can be given the structure of a differentiable manifold. This approach makes the proof of certain known results on the partial realization problem quite straightforward and makes it possible to establish some important new results as well. A key tool is the fact, proven here, that the set of n by a real Hankel matrices of rank r is a manifold with r+1 connected components.

Brockett, R. W.↗

Hybrid and Electric Advanced Vehicle Systems Simulation

Predefined components connected to represent wide variety of propulsion systems. Hybrid and Electric Advanced Vehicle System (HEAVY) computer program is flexible tool for evaluating performance and cost of electric and hybrid vehicle propulsion systems. Allows designer to quickly, conveniently, and economically predict performance of proposed drive train.

Beach, R. F.↗