Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “pruning”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

Do You See What I See? Interactive Visualization of Mission Design and Navigation

Mission Design and Navigation (MDNav) is an intensive process requiring advanced computational resources, expert human intuition, and many successive human-in-the-loop iterations to converge on acceptable trajectory designs or navigation solutions. The current bottleneck in MDNav is not the underlying computational algorithms but the human cognitive capacity to prune through a multitude of simulated results to select high-value candidates. One approach to alleviate this burden is through the judicious application of visualizations that allow humans to interactively filter data in multiple dimensions to reveal salient patterns and highlight divergences. When designed efficiently, such interactive visualizations should aid human operators to get familiar with data faster, visually observe correlations, and communicate findings more effortlessly. In this work, we present three visualization case studies that have the potential to increase human operator efficiency in MDNav. While identifying the most critical “pain points” that operators face, and also working on potential solutions, we followed a human-centered design approach. We started with a series of interviews with potential users, and then rapidly created prototypes for alternative solutions, validated outcomes with feedback from users through out development of these proof of concept visualizations. With this survey of our current efforts, we demonstrate the transformative capability of interactive data visualizations for improving mission development and operations, enabling operators to grow intuition, and communicating key concepts across diverse mission teams.

Arora, Nitin↗
NASA NTRS2022

Vibrational and Rovibrational Spectroscopy Applied to Astrochemistry

The detection of molecules in astrophysical environments almost always requires remote sensing. While radioastronomical observation and associated rotational spectroscopy are powerful astronomical tools, infrared spectral analysis provides a unique means of examining the observable universe, especially for molecules where permanent dipole moments are small or even non-existent. The molecular vibrations of small molecules are now able to be modeled via quantum chemistry and electronic structure theory conjoined to vibrational analysis to within spectroscopic accuracy in many cases. This chapter will showcase this success and build upon it to show how such advances are now being leveraged to describe molecular vibrations for molecules containing dozens of atoms, electronically excited states, "hot bands," exoplanetary atmospheric opacity data, and even emission of polycyclic aromatic hydrocarbons. All of these are required to prune the interstellar spectral garden of its "weeds" in search of "flowers" that will provide the necessary fingerprints for astronomers to be able to probe the heavens for its past, present, and future secrets.

Ryan C. Fortenberry↗
NASA NTRS2022

Towards Finding Energy Efficient Paths for Hybrid Airships in the Atmosphere of Venus

This paper presents a solution to the motion planning problem for an autonomous airship under superrotation winds of the Venusian atmosphere. The airship uses both buoyancy and aerodynamic lift to control its altitude. In addition, solar panels distributed over the aircraft provide energy to the propellers and allow for battery recharging. Our approach uses a sampling-based planner that relies on Dubins’ Airplane paths deformed under the influence of the winds to create a tree of kinematically feasible trajectories. We use the battery state to prune energetically unfeasible trajectories and we propose a cost function that accounts for the energy expenditure of the propulsive system and that considers battery charging by using the Economics notion of opportunity cost. The method is illustrated through a series of simulations that show how the vehicle takes longer and high-altitude paths to minimize the use of energy and favor battery recharge. Our results also show that naive trajectories are not feasible in terms of energy, justifying the need for more efficient solutions.

Bernardo Martinez R. Jr↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗
NASA NTRS2023

Expanding the Deep Space Network to Support the Heliophysics System Observatory

Difficulties associated with receiving telemetry from satellites severely limit the volume of scientific data that can be downlinked to the ground. Current missions employ techniques such as compressing and pruning datasets to reduce the data volume they transmit. While existing mission designs are already restricted by limited telemetry budgets, future Heliophysics System Observatory missions will produce ever larger data volumes with higher resolution and cadence observations from constellations of satellites spread throughout the heliosphere1. In addition, heliophysics missions often produce data for the operational Space Weather community that requires a low latency between observation and downlink. In light of current limitations, the infrastructure to receive NASA satellite telemetry must be expanded and modernized to support the science needs of future data-rich heliophysics missions.

deep space network (DSN)↗
NASA NTRSDate not supplied

System-Theoretic Analysis of Unsafe Collaborative Control in Teaming Systems

The interactions that occur in human-teaming are inspiring novel aerospace designs aimed at improving how humans and machines, or multiple machines, work together. Unfortunately, current Systems Engineering processes are ill-equipped to handle these complex relationships and are unable to design and assure the safety for these systems. To close part of this gap, this paper introduces a novel system-theoretic analytical process to identify unsafe collaborative control actions. It is part of a broader set of techniques that extend the state-of-the-art in hazard analysis, System Theoretic Process Analysis (STPA), to systematically address collaboration. The method rigorously expresses the different ways multiple commands may be unsafe together. Using Systems Theory, it employs abstraction to manage the combinatorial complexity in enumerating control contributions from multiple collaborating components. An algorithm integrates these concepts into an end-to-end process and is supported by automation to enumerate, refine, prune, and prioritize unsafe combinations of control actions. The output of the method feeds the specification of system requirements to implement safety-guided design starting early in concept development. The process is demonstrated on a manned-unmanned aircraft teaming case study and finds new causal factors that were not previously found in a past hazard analysis of the same system.

System Safety↗
NASA NTRS2024

Decision Space Modeling: Trade Space Ontology

As the National Aeronautics and Space Administration (NASA) works to develop a crewed Moon to Mars Architecture, it is dealing with a large decision space consisting of the overlay of human exploration architectures for both the Moon and for Mars. Efforts are underway to enable reasoning, analysis, and deliberation on this decision space. A critical first step is to develop a model of the decision space, which will then allow for various methods and techniques to be applied in support of the larger architecture decision-making process. The Trade Space Ontology consists of a set of terminologies and relations (an ontology) and a MagicDraw resource that enables documentation of decisions and alternatives. It also provides a means by which decisions and alternatives can be traced to other Systems Engineering artifacts. For documenting alternatives, the Trade Space Ontology adapts the Morphological Matrix methodology to The Systems Modeling Language (SysML) through a profile; custom diagrams are also implemented to simplify the profile's use. With the profile and custom diagrams, system architects can specify options for architecture attributes, as well as compatibility between them, in a compact visual format. While the approach shares similarities to a trade tree, the emphasis at this stage is less on enumerating specific combinations of options and instead on specifying the options and their compatibility. Enumeration of alternatives is performed by an external analysis that operates on an output file from a model constructed using the Trade Space Ontology. For decisions, the Trade Space Ontology provides a way to model generic precedence relationships as well as documenting inputs and outputs. These may include what alternatives, criteria, and rationale are understood to be relevant for each decision. Importantly, the decision-making side of the Trade Space Ontology is defined at a more general level, such that it can be adapted to the specific terms in use by projects and programs at NASA. However, this adaptability also means that less capability is provided ``out-of-the-box'' from installation. Currently the resource includes plugin functionality to enumerate paths through generic precedence relationships between decisions and to export these paths to a spreadsheet. Custom dependency stereotypes are included in the profile to indicate the cross-cutting relationships between the trade space and the architecture decisions, providing a means to map which parts of the trade space enumerate alternatives for a decision, and to identify how the output of a decision may modify the trade space through pruning or down-selection. While the motivating use case for this resource is in human exploration architectures, the broad applicability of the Morphological Matrix methodology indicates that the Trade Space Ontology should also be useful for other activities and tasks at the agency.

Trade Tree↗
DOE OSTI2020

Generic, Sparse Tensor Core for Neural Networks

Sparse neural network attracts more attention for model compression, fast execution, and power reduction. The state-of-the-art designed sparse tensor core for structured and static sparsity, which did not support well for generic or dynamic sparsity. We design a sparse tensor core to support generic sparsity pruning with a novel hybrid and blocked sparse matrix storage format, HB-ELL, which saves computation and storage while keeping the most significant elements, as well as supporting dynamic sparsity for data flow in neural networks. We achieve better performance with preliminary results than the state-of- the-art on an NVIDIA GPU simulator.

Wu, Xiaolong↗
DOE OSTI2021

Grand unified file indexing

Systems and methods are disclosed for a unified file index for a file system. In one example, a Grand Unified File Index (GUFI) includes a tree replicating the directory hierarchy of one or more primary filesystems, and individual metadata stores for each directory. The GUFI tree permits fast traversal, efficient user space access controls, and simple tree directed operations such as renames, moves, or permission changes. In some examples, the individual metadata stores can be implemented as embedded databases on flash storage for speed. In some examples, use of summary tables at the directory or subtree level can eliminate wasteful executions, prune tree traversal, and further improve performance. In various examples, efficient operation can be achieved from laptop to supercomputer scale, across a wide mix of file distributions and filesystems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

hls4ml: An Open-Source Codesign Workflow to Empower Scientific Low-Power Machine Learning Devices

Accessible machine learning algorithms, software, and diagnostic tools for energy-efficient devices and systems are extremely valuable across a broad range of application domains. In scientific domains, real-time near-sensor processing can drastically improve experimental design and accelerate scientific discoveries. To support domain scientists, we have developed hls4ml, an open-source software-hardware codesign workflow to interpret and translate machine learning algorithms for implementation with both FPGA and ASIC technologies. We expand on previous hls4ml work by extending capabilities and techniques towards low-power implementations and increased usability: new Python APIs, quantization-aware pruning, end-to-end FPGA workflows, long pipeline kernels for low power, and new device backends include an ASIC workflow. Taken together, these and continued efforts in hls4ml will arm a new generation of domain scientists with accessible, efficient, and powerful tools for machine-learning-accelerated discovery.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Automated Shift Detection in Sensor-Based PV Power and Irradiance Time Series

PV power and irradiance sensor-based measurements are prone to error, resulting in issues such as abrupt time series data shifts. These shifts, which are usually unintentional, may be caused by software or hardware configuration changes on a PV system, and do not reflect an actual change in overall system performance. Locating these shifts and segmenting the associated time series aids in more accurate future PV analysis. In this research, an offline changepoint detection (CPD) algorithm that automatically detects these abrupt data shifts in sensor-based time series is introduced. Data shift periods in 101 daily PV power and irradiance time series were labeled manually by two solar experts. These data streams represent sensor-based measurements, and display a variety of data shift behaviors. A changepoint detection algorithm was tuned using the 101 labeled data streams, with each model configuration's ability to detect labeled changepoints benchmarked using metrics such as F1-score, recall, and Rand Index. Best performing models on seasonality-corrected data streams include the Pruned Exact Linear (PELT) method, the Binary Segmentation method, and the Bottom-Up method, all scoring an average F1-score of 0.76 or greater at detecting labeled changepoints within a 30-day window for the labeled data sets. To promote further research in this space, we are releasing the labeled data shift sets on U.S. Department of Energy's (DOE) DuraMAT Data Hub, and the associated algorithm in the Python PVAnalytics package.

changepoint detection↗
DOE OSTI2022

Automated Shift Detection in Sensor-Based PV Power and Irradiance Time Series

PV power and irradiance sensor-based measurements are prone to error, resulting in issues such as time series data shifts. In this research, a changepoint detection (CPD) algorithm that automatically detects data shifts in sensor-based time series is introduced. Data shift periods in 101 daily PV power and irradiance time series were labeled manually by two solar experts. These data streams represent sensor-based measurements, and display a variety of data shift behaviors. A changepoint detection algorithm was tuned using the 101 labeled data streams, with each model configuration's ability to detect labeled changepoints benchmarked using metrics such as F1-score, recall, and Rand Index. Best performing models on seasonality-corrected data streams include the Pruned Exact Linear (PELT) method, the Binary Segmentation method, and the Bottom-Up method, all scoring an average F1-score of 0.76 or greater at detecting labeled changepoints within a 30-day window across the labeled data sets. Pending approval, we plan to release the labeled data sets for this research on NREL's DuraMAT Data Hub, and the associated algorithm in the Python PVAnalytics package. By supplying the training sets and algorithm, we hope to encourage further development in this research space.

data shift↗
DOE OSTI2021

Union: A Unified HW-SW Co-Design Ecosystem in MLIR for Evaluating Tensor Operationson Spatial Accelerators

To meet the extreme compute demands for deep learning across commercial and scientific applications, dataflow accelerators are becoming increasingly popular. While these“domain-specific” accelerators are not fully programmable like CPUs and GPUs, they retain varying levels of flexibility with respect to data orchestration, i.e., dataflow and tiling optimizations to enhance efficiency. There are several challenges when designing new algorithms and mapping approaches to execute the algorithms for a target problem on new hardware. Previous works have addressed these challenges individually. To address this challenge as a whole, in this work, we present an HW-SW co-design ecosystem for spatial accelerators called Union within the popular MLIR compiler infrastructure. Our framework allows exploring different algorithms and their mappings on several accelerator cost models. Union also includes a plug-and-play library of accelerator cost models and mappers which can easily be extended. The algorithms and accelerator cost models are connected via a novel mapping abstraction that captures the map space of spatial accelerators which can be systematically pruned based on constraints from the hardware, workload, and mapper. We demonstrate the value of Union for the community with several case studies which examine offloading different tensor operations (CONV/GEMM/Tensor Contraction) on diverse accelerator architectures using different mapping schemes.

Jeong, Geonhwa↗
DOE OSTI2023

8. Open-Loop Toolpath Generation

Open-loop paths, as opposed to closed-loop paths, have start and end points that are at different locations. Open-loop paths, commonly called “skeletons,” can be generated through multiple approaches. Most approaches utilize a shape's medial axis transform and build appropriate pathing around this representation. In this chapter, a specific implementation consisting of three major steps will be discussed. These steps are Voronoi diagram generation, skeleton pruning, and path consolidation. With the major components of the implementation covered, two additional optimizations will also be described. These two optimizations, chamfering and smoothing, will be highlighted as ways to improve overall pathing quality.

Borish, Michael↗
DOE OSTI2023

Neural Image Compression: Generalization, Robustness, and Spectral Biases

Recent advances in neural image compression (NIC) have resulted in models which are starting to outperform traditional codecs. While this has led to growing excitement about using these methods in real-world applications, the successful adoption of any machine learning system (including NIC) in the wild requires it to generalize (and be robust) to unseen distribution shifts at deployment time. Unfortunately, current research lacks comprehensive datasets and informative tools to evaluate and understand compression performance in real-world settings. To bridge this crucial gap, first, this paper presents a comprehensive benchmark suite to evaluate the out-of-distribution (OOD) performance of image compression methods. Specifically, we design CLIC-C and Kodak-C by introducing 15 common corruptions to popular CLIC and Kodak benchmarks. Next, we propose spectrally inspired introspection tools to gain a deeper understanding of errors introduced by image compression methods as well as their OOD performance. To this end, we carry out a detailed performance comparison of the classical codec with various variants of NIC (e.g., original, variable rate, pruned), revealing intriguing findings that challenge our current understanding of the strengths and limitations of NIC. Finally, we corroborate our empirical findings with theoretical analysis, providing an in-depth view of the OOD performance of NIC. Our benchmarks, spectral introspection tools, and findings provide a crucial bridge to the real-world adoption of NIC. We hope that our work will propel future efforts in designing more robust and generalizable NIC methods.

neural networks, Variational Autoencoder, robustne↗
DOE OSTI2024

autoGEMM: Pushing the Limits of Irregular Matrix Multiplication on Arm Architectures

This paper presents an open-source library that pushes the limits of performance portability for irregular General Matrix Multiplication (GEMM) on the widely-used Arm architectures. Our library, autoGEMM, is designed to support a wide range of Arm processors: from edge devices to HPC-grade CPUs. autoGEMM generates optimized kernels for various hardware configurations by auto-combining fragments of autogenerated micro-kernels that employ hand-written optimizations to maximize computational efficiency. We optimize the kernel pipeline by tuning the register reuse and the data load/store overlapping. In addition, we use a dynamic tiling scheme to generate balanced tile shapes. Finally, we position autoGEMM on top of the TVM framework where our dynamic tiling scheme prunes the search space for TVM to identify the optimal combination of parameters for code optimization. Evaluations on five different classes of Arm chips demonstrate the advantages of autoGEMM. For small matrices, autoGEMM achieves 98% of peak and up to 2.0x speedup over state-of-the-art libraries such as LIBXSMM and LibShalom. For irregular matrices (i.e. tall skinny and long rectangles), autoGEMM is 1.3-2.0x faster than widely-used libraries such as OpenBLAS and Eigen. autoGEMM is publicly available at: https://github.com/wudu98/autoGEMM.

Wu, Du↗
DOE OSTI2025

MoE-Inference-Bench: Performance Evaluation of Mixture of Expert Large Language and Vision Models

Mixture of Experts (MoE) models have enabled the scaling of Large Language Models (LLMs) and Vision Language Models (VLMs) by achieving massive parameter counts while maintaining computational efficiency. However, MoEs introduce several inference-time challenges, including load imbalance across experts and the additional routing computational overhead. To address these challenges and fully harness the benefits of MoE, a systematic evaluation of hardware acceleration techniques is essential. We present MoE-Inference-Bench, a comprehensive study to evaluate MoE performance across diverse scenarios. We analyze the impact of batch size, sequence length, and critical MoE hyperparameters such as FFN dimensions and number of experts on throughput. We evaluate several optimization techniques on Nvidia H100 GPUs, including pruning, Fused MoE operations, speculative decoding, quantization, and various parallelization strategies. Our evaluation includes MoEs from the Mixtral, DeepSeek, OLMoE and Qwen families. The results reveal performance differences across configurations and provide insights for the efficient deployment of MoEs.

Chitty-Venkata, Krishna Teja↗