Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
Explore the source record for details and available documents.
Computer science↗
SEARCH · Search NASA
Results for “minimum spanning tree”
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.
ArborX 2.0
ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.
Prokopenko, Andrey [Oak Ridge National Laboratory ↗
Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach
Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.
connectivity maintenance↗
Efficient sparse state preparation via quantum walks
Continuous-time quantum walks (CTQWs) on dynamic graphs, referred to as dynamic CTQWs, are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. In this work, we develop an algorithm that converts single-edge and self-loop dynamic CTQWs to the gate model of computation. We use this mapping to introduce an efficient sparse quantum state preparation framework based on dynamic CTQWs. Our approach utilizes combinatorics techniques such as minimal hitting sets, minimum spanning trees, and shortest Hamiltonian paths to reduce the number of controlled gates required to prepare sparse states. We show that our framework encompasses the current state of the art ancilla-free sparse state preparation method by reformulating this method as a CTQW. This CTQW-based framework offers an alternative to the uniformly controlled rotation method used by Qiskit by requiring fewer CX gates when the target state has a polynomial number of non-zero amplitudes.
dynamic continuous time quantum walks↗
Clustering at Massive Scale
ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.
Stanley, ThomasA [Lawrence Livermore National Labo↗
An accumulation method for early fault warning and its application to wind turbine systems
Unexpected failures in engineering systems lead to expensive maintenance actions and should be avoided if at all possible. This is particularly true for wind turbine systems for which unexpected failures not only demand costly repairs but also cause long downtime. Motivated by this need, we present an accumulation method for fault early warning and failure anticipation. Here, our research shows that one critical element allowing the ability of early warning is to accumulate the small-magnitude symptoms resulting from gradual changes in an engineering system like wind turbines. Our idea is inspired by the classical cumulative sum method, or CUSUM, but we have to redesign the accumulation mechanism for tackling unique challenges in wind turbine data. The new accumulation method is applied to two real wind turbine datasets, one with gearbox failures and the other with generator failures, and demonstrates superior performance as compared with CUSUM.
17 WIND ENERGY↗
Minimization of Measurement Uncertainty in Optical Frequency Domain Reflectometry
Optical frequency domain reflectometry (OFDR) is a technique for interrogating optical fiber sensors to generate relative, quasi-distributed measurements. Although Optical frequency domain reflectometry (OFDR) is increasingly being adopted for aerospace, energy production, and structural monitoring applications, the quantification of uncertainty for OFDR measurements has not been developed beyond sparse empirical relationships. To address this knowledge gap, an uncertainty metric for OFDR measurements was developed. This uncertainty metric was applied to weight the edges between OFDR measurements on directed correlation graphs and analyzed to minimize the cumulative uncertainty. In conclusion, this work is the first to propose an uncertainty metric for OFDR and provides a generalized mathematical framework for optimizing OFDR hardware selection, optical fiber sensor selection, and postprocessing strategy.
42 ENGINEERING↗
Forest residue harvest optimization: spanning the bridge between plant biology and biorefinery performance
Forestry residues have immense potential as alternative feedstocks to petroleum, yet their inherent complexity remains a major challenge to widespread use. Pairing the temporal rhythms of plant biology with biorefinery performance is critical to industrial-scale biorefinery development. Here, we provide the first report of a techno-economic analysis (TEA) and life cycle assessment (LCA) for a model integrated reductive catalytic fractionation (RCF)–molten salt hydrolysis process for forestry residues varying in tree part, species, and phenophase. All forestry residues resulted in net-negative greenhouse gas (GHG) emissions vs. comparable petroleum feedstocks, with GHG emissions potentially reduced >4.0× through composition-based feedstock selection (e.g., harvesting American beech bark in spring vs. summer). Moreover, American beech twigs/branchlets and bark in leafed and emergence phenophases, respectively, had 7.9× lower predicted phenolic minimum selling prices (MSPs) vs. other feedstocks and MSPs within the current global phenolic market range. Hemicellulose content and RCF yield emerged as key parameters impacting GHG emissions and biorefinery revenue, identifying hardwood twigs/branchlets in the leafed phenophase as optimal biofeedstocks. Biorefinery expenses were dominated by purchased equipment, raw materials, and utility costs, highlighting essential areas for future study. Notably, RCF reactor pressures drove 85–90% of equipment costs, but sensitivity analysis revealed that decreasing the pressure 20% could reduce the phenol MSP 4-fold. Structural carbohydrate dynamics were also investigated using a two-step acid hydrolysis method to resolve tissue- and species-level patterns in biomass composition throughout the year to enable harvest optimization based on TEA/LCA findings. Ultimately, elucidating the impact of biofeedstock dynamics on biorefinery performance enables harvest optimization, informed engineering design, and progress towards an expanded bioeconomy.
Shapiro, Alison J. [University of Delaware, Newark↗