Search NASA⌕ Search

SEARCH · Search NASA

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

Purposive discovery of operations

The Generate, Prune & Prove (GPP) methodology for discovering definitions of mathematical operators is introduced. GPP is a task within the IL exploration discovery system. We developed GPP for use in the discovery of mathematical operators with a wider class of representations than was possible with the previous methods by Lenat and by Shen. GPP utilizes the purpose for which an operator is created to prune the possible definitions. The relevant search spaces are immense and there exists insufficient information for a complete evaluation of the purpose constraint, so it is necessary to perform a partial evaluation of the purpose (i.e., pruning) constraint. The constraint is first transformed so that it is operational with respect to the partial information, and then it is applied to examples in order to test the generated candidates for an operator's definition. In the GPP process, once a candidate definition survives this empirical prune, it is passed on to a theorem prover for formal verification. We describe the application of this methodology to the (re)discovery of the definition of multiplication for Conway numbers, a discovery which is difficult for human mathematicians. We successfully model this discovery process utilizing information which was reasonably available at the time of Conway's original discovery. As part of this discovery process, we reduce the size of the search space from a computationally intractable size to 3468 elements.

Sims, Michael H.↗
DOE OSTI2026

Unsupervised atomic data mining via multi-kernel graph autoencoders for machine learning force fields

Constructing a chemically diverse dataset while avoiding sampling bias is critical to training efficient and generalizable force fields. However, in computational chemistry and materials science, many common dataset generation techniques are prone to oversampling regions of the potential energy surface. Furthermore, these regions can be difficult to identify and isolate from each other or may not align well with human intuition, making it challenging to systematically remove bias in the dataset. While traditional clustering and pruning (down-sampling) approaches can be useful for this, they can often lead to information loss or a failure to properly identify distinct regions of the potential energy surface due to difficulties associated with the high dimensionality of atomic descriptors. In this work, we introduce the Multi-kernel Edge Attention-based Graph Autoencoder (MEAGraph) model, an unsupervised approach for analyzing atomic datasets. MEAGraph combines multiple linear kernel transformations with attention-based message passing to capture geometric sensitivity and enable effective dataset pruning without relying on labels or extensive training. Demonstrated applications on niobium, tantalum, and iron datasets show that MEAGraph efficiently groups similar atomic environments, allowing for the use of basic pruning techniques for removing sampling bias. This approach provides an effective method for representation learning and clustering that can be used for data analysis, outlier detection, and dataset optimization.

Materials science↗
DOE OSTI2021

Binary Complex Neural Network Acceleration on FPGA

Being able to learn from complex data with phase information is imperative for many signal processing applications. Today’s real-valued deep neural networks (DNNs) have shown efficiency in latent information analysis but fall short when applied to the complex domain. Deep complex networks (DCN) , in contrast, can learn from complex data, but have high computational costs; therefore, they cannot satisfy the instant decision making requirements of many deployable systems dealing with short observations or short signal bursts. Recent, Binarized Complex Neural Network (BCNN), which integrates DCNs with binarized neural networks (BNN), shows great potential in classifying complex data in real-time. In this paper, we propose a structural pruning based accelerator of BCNN, which is able to provide more than 5000 frames/s inference throughput on edge devices. The high performance comes from both the algorithm and hardware sides. On the algorithm side, we conduct structural pruning to the original BCNN models and obtain 20 × pruning rates with negligible accuracy loss; on the hardware side, we propose a novel 2D convolution operation accelerator for the binary complex neural network. Experimental results show that the proposed design works with over 90% utilization and is able to achieve the inference throughput of 5882 frames/s and 4938 frames/s for complex NIN-Net and ResNet-18 using CIFAR-10 dataset and Alveo U280 Board.

Peng, Hongwu↗
DOE OSTI2025

Uncontrolled Learning: Codesign of Neuromorphic Hardware Topology for Neuromorphic Algorithms

Neuromorphic computing has the potential to revolutionize future technologies and our understanding of intelligence, yet it remains challenging to realize in practice. The learning-from-mistakes algorithm, inspired by the brain's simple learning rules of inhibition and pruning, is one of the few brain-like training methods. This algorithm is implemented in neuromorphic memristive hardware through a codesign process that evaluates essential hardware trade-offs. While the algorithm effectively trains small networks as binary classifiers and perceptrons, performance declines significantly with increasing network size unless the hardware is tailored to the algorithm. This work investigates the trade-offs between depth, controllability, and capacity—the number of learnable patterns—in neuromorphic hardware. This highlights the importance of topology and governing equations, providing theoretical tools to evaluate a device's computational capacity based on its measurements and circuit structure. The findings show that breaking neural network symmetry enhances both controllability and capacity. Additionally, by pruning the circuit, neuromorphic algorithms in all-memristive circuits can utilize stochastic resources to create local contrasts in network weights. Through combined experimental and simulation efforts, the parameters are identified that enable networks to exhibit emergent intelligence from simple rules, advancing the potential of neuromorphic computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Polishing the Gold Standard: The Role of Orbital Choice in CCSD(T) Vibrational Frequency Prediction

While CCSD(T) with spin-restricted Hartree-Fock (RHF) orbitals has long been lauded for its ability to accurately describe closed-shell interactions, the performance of CCSD(T) on open-shell species is much more erratic, especially when using a spin-unrestricted HF (UHF) reference. Previous studies have shown improved treatment of open-shell systems when a non-HF set of molecular orbitals, like Brueckner or Kohn-Sham density functional theory (DFT) orbitals, is used as a reference. Inspired by the success of regularized orbital-optimized second-order Møller-Plesset perturbation theory (κ-OOMP2) orbitals as reference orbitals for MP3, we investigate the use of κ-OOMP2 orbitals and various DFT orbitals as reference orbitals for CCSD(T) calculations of the corrected ground-state harmonic vibrational frequencies of a set of 36 closed-shell (29 neutrals, 6 cations, 1 anion) and 59 open-shell diatomic species (38 neutrals, 15 cations, 6 anions). The aug-cc-pwCVTZ basis set is used for all calculations. The use of κ-OOMP2 orbitals in this context alleviates difficult cases observed for both UHF orbitals and OOMP2 orbitals. Removing two multireference systems and 12 systems with ambiguous experimental data leaves a pruned data set. Overall performance on the pruned data set highlights CCSD(T) with a B97 orbital reference (CCSD(T):B97), CCSD(T) with a κ-OOMP2 orbital reference (CCSD(T):κ-OOMP2), and CCSD(T) with a B97M-rV orbital reference (CCSD(T):B97M-rV) with RMSDs of 8.48 cm -1 , and 8.50 cm -1 , and 8.75 cm -1 respectively, outperforming CCSD(T):UHF by nearly a factor of 5. Moreover, the performance on the closed- and open-shell subsets shows these methods are able to treat open-shell and closed-shell systems with comparable accuracy and robustness. CCSD(T) with RHF orbitals is seen to improve upon UHF for the closed-shell species, while spatial symmetry breaking in a number of restricted open-shell HF (ROHF) references leads CCSD(T) with ROHF reference orbitals to exhibit the poorest statistical performance of all methods surveyed for open-shell species. The use of κ-OOMP2 orbitals has also proven useful in diagnosing multireference character that can hinder the reliability of CCSD(T).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Isochronic development of cortical synapses in primates and mice

Abstract The neotenous, or delayed, development of primate neurons, particularly human ones, is thought to underlie primate-specific abilities like cognition. We tested whether synaptic development follows suit—would synapses, in absolute time, develop slower in longer-lived, highly cognitive species like non-human primates than in shorter-lived species with less human-like cognitive abilities, e.g., the mouse? Instead, we find that excitatory and inhibitory synapses in the maleMus musculus(mouse) andRhesus macaque(primate) cortex form at similar rates, at similar times after birth. Primate excitatory and inhibitory synapses and mouse excitatory synapses also prune in such an isochronic fashion. Mouse inhibitory synapses are the lone exception, which are not pruned and instead continuously added throughout life. The monotony of synaptic development clocks across species with disparate lifespans, experiences, and cognitive abilities argues that such programs are likely orchestrated by genetic events rather than experience.

Science & Technology - Other Topics↗
DOE OSTI2022

Waveform processing using neural network algorithms on the front-end electronics

In a multi-channel radiation detector readout system, waveform sampling, digitization, and raw data transmission to the data acquisition system constitute a conventional processing chain. The deposited energy on the sensor is estimated by extracting peak amplitudes, area under pulse envelopes from the raw data, and starting times of signals or time of arrivals. However, such quantities can be estimated using machine learning algorithms on the front-end Application-Specific Integrated Circuits (ASICs), often termed as “edge computing”. Edge computation offers enormous benefits, especially when the analytical forms are not fully known or the registered waveform suffers from noise and imperfections of practical implementations. In this work, we aim to predict peak amplitude from a single waveform snippet whose rising and falling edges containing only 3 to 4 samples. We thoroughly studied two well-accepted neural network algorithms, Multi-Layer Perceptron (MLP) and Convolutional Neural Network (CNN) by varying their model sizes. Further, to better fit front-end electronics, neural network model reduction techniques, such as network pruning methods and variable-bit quantization approaches, were also studied. By combining pruning and quantization, our best performing model has the size of 1.5 KB, reduced from 16.6 KB of its full model counterpart. It can reach mean absolute error of 0.034 comparing to that of a naive baseline of 0.135. Such parameter-efficient and predictive neural network models established feasibility and practicality of their deployment on front-end ASICs.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Adapting In Situ Accelerators for Sparsity With Granular Matrix Reordering

Neural network (NN) inference is an essential part of modern systems and is found at the heart of numerous applications ranging from image recognition to natural language processing. In situ NN accelerators can efficiently perform NN inference using resistive crossbars, which makes them a promising solution to the data movement challenges faced by conventional architectures. Although such accelerators demonstrate significant potential for dense NNs, they often do not benefit from sparse NNs, which contain relatively few non-zero weights. Processing sparse NNs on in situ accelerators results in wasted energy to charge the entire crossbar where most elements are zeros. To address this limitation, this paper proposes Granular Matrix Reordering (GMR): a preprocessing technique that enables an energy-efficient computation of sparse NNs on in situ accelerators. GMR reorders the rows and columns of sparse weight matrices to maximize the crossbars' utilization and minimize the total number of crossbars needed to be charged. The reordering process does not rely on sparsity patterns and incurs no accuracy loss. Finally, GMR achieves an average of 28% and up to 34% reduction in energy consumption over seven pruned NNs across four different pruning methods and network architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

DESIVAST: Catalogs of Low-redshift Voids Using Data from the DESI Data Release 1 Bright Galaxy Survey

We present three separate void catalogs created using a volume-limited sample of the DESI Data Release 1 Bright Galaxy Survey. We use the algorithms VoidFinder and V 2 to construct void catalogs out to a redshift of z = 0.24. Excluding voids affected by the boundaries of the survey, we obtain 1489 voids with VoidFinder, 389 with V 2 using REVOLVER pruning, and 297 with V 2 using VIDE pruning. Comparing our catalogs with overlapping Sloan Digital Sky Survey void catalogs, we find generally consistent void properties but significant differences in the void volume overlap, which we attribute to differences in the galaxy selection and survey masks. These catalogs are suitable for studying the variation in galaxy properties with cosmic environment and for cosmological studies.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1979

Development of an Accelerated Test Design for Predicting the Service Life of the Solar Array at Mead, Nebraska

Potential long-term degradation modes for the two types of modules in the Mead array were determined and judgments were made as to those environmental stresses and combinations of stresses which accelerate the degradation of the power output. Hierarchical trees representing the severity of effects of stresses (test conditions) on eleven individual degradation modes were constructed and were pruned of tests judged to be nonessential. Composites of those trees were developed so that there is now one pruned tree covering eight degradation modes, another covering two degradation modes, and a third covering one degradation mode. These three composite trees form the basis for selection of test conditions in the final test plan which is now being prepared.

Gaines, G. B.↗
NASA NTRS2001

Greenhouse tomato limited cluster production systems: crop management practices affect yield

Limited-cluster production systems may be a useful strategy to increase crop production and profitability for the greenhouse tomato (Lycopersicon esculentum Mill). In this study, using an ebb-and-flood hydroponics system, we modified plant architecture and spacing and determined the effects on fruit yield and harvest index at two light levels. Single-cluster plants pruned to allow two leaves above the cluster had 25% higher fruit yields than did plants pruned directly above the cluster; this was due to an increase in fruit weight, not fruit number. Both fruit yield and harvest index were greater for all single-cluster plants at the higher light level because of increases in both fruit weight and fruit number. Fruit yield for two-cluster plants was 30% to 40% higher than for single-cluster plants, and there was little difference in the dates or length of the harvest period. Fruit yield for three-cluster plants was not significantly different from that of two-cluster plants; moreover, the harvest period was delayed by 5 days. Plant density (5.5, 7.4, 9.2 plants/m2) affected fruit yield/plant, but not fruit yield/unit area. Given the higher costs for materials and labor associated with higher plant densities, a two-cluster crop at 5.5 plants/m2 with two leaves above the cluster was the best of the production system strategies tested.

Non-NASA Center↗
NASA NTRS2005

New high performance algorithmic solution for diagnosis problem

In this paper we address the problem of generating the minimal diagnosis from the conflicts. This problem can be formulated as the well-known Hitting Set Problem. Our approach starts by mapping the Hitting Set problem into the Integer Programming Problem that enables us, for the first time, a priori determination of the lower and upper bounds on the size for the solution. Based on these bounds, we introduce a new concept of solution window for the problem. We also propose a new branch-and-bound technique that not only is faster than the current techniques in terms of number of operations (by exploiting the structure of the problem) but also, using the concept of window, allows a massive reduction (pruning) in the number of branches. Furthermore, as the branch-and-bound proceeds, the solution window is dynamically updated and narrowed to enable further pruning.

diagnosis problems↗
NASA NTRS2014

Statistical Symbolic Execution with Informed Sampling

Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.

Reliability↗
NASA NTRS2015

An Active Learning Framework for Hyperspectral Image Classification Using Hierarchical Segmentation

Augmenting spectral data with spatial information for image classification has recently gained significant attention, as classification accuracy can often be improved by extracting spatial information from neighboring pixels. In this paper, we propose a new framework in which active learning (AL) and hierarchical segmentation (HSeg) are combined for spectral-spatial classification of hyperspectral images. The spatial information is extracted from a best segmentation obtained by pruning the HSeg tree using a new supervised strategy. The best segmentation is updated at each iteration of the AL process, thus taking advantage of informative labeled samples provided by the user. The proposed strategy incorporates spatial information in two ways: 1) concatenating the extracted spatial features and the original spectral features into a stacked vector and 2) extending the training set using a self-learning-based semi-supervised learning (SSL) approach. Finally, the two strategies are combined within an AL framework. The proposed framework is validated with two benchmark hyperspectral datasets. Higher classification accuracies are obtained by the proposed framework with respect to five other state-of-the-art spectral-spatial classification approaches. Moreover, the effectiveness of the proposed pruning strategy is also demonstrated relative to the approaches based on a fixed segmentation.

classification↗
NASA NTRS2014

Improving Coverage of Test Cases Generated by Symbolic PathFinder for Programs with Loops

Symbolic execution is a program analysis technique that is used for many purposes, one of which is test-case generation. For loop-free programs, this generates a test-set that achieves path coverage. Program loops, however, imply exponential growth of the number of paths in the best case and non-termination in the worst case. In practice, the number of loop unwindings needs to be bounded for analysis. We consider symbolic execution in the context of the tool Symbolic Pathfinder. This tool extends the model-checker Java Pathfinder and relies on its bounded state-space exploration for termination. We present an implementation of k-bounded loop unwinding, which increases the amount of user-control over the symbolic execution of loops. Bounded unwinding can be viewed as a naive way to prune paths through loops. When using symbolic execution for test-case generation, naively pruning paths is likely at the cost of coverage. In order to improve coverage of branches within a loop body, we present a technique that semi-automatically concretizes variables used in a loop. The basic technique is limited and we therefore present annotations to manually steer symbolic execution towards certain branches, as well as ideas on how the technique can be extended to be more widely applicable.

Programs With Loops↗
NASA NTRS2017

Semi-analytic preliminary design of low-thrust missions

Using generalized logarithmic spirals to approximate low-thrust trajectories, a new strategy for the design of low-thrust gravity-assist transfers has been developed. Each transfer leg is defined by a semi-analytic model, and its solution is equivalent to a hybrid Lambert’s problem. The method is suitable for approximating both flyby and rendezvous transfer legs. A branch and prune algorithm is used to generate a collection of initial guesses for further optimization. The analytic nature of the low-thrust model simplifies the pruning step, since dynamical and operational constraints (like maximum thrust or total v) can be imposed easily. The solutions obtained with the global search algorithm can be post-processed, filtered, and ranked according to various criteria. This is where the versatility of the method resides, because changing the selection criteria does not require a new search. Selected candidates are then optimized further, in order to generate actual low-thrust orbits. Two mission design examples are presented: an asteroid deflection mission using a kinetic impactor, and a rendezvous mission to Jupiter. These examples are used to analyze the convergence of the optimization stage, in particular how far from the optimal solution the initial guesses are.

Park, Ryan S.↗
DOE OSTI2023

Impact of biochar amendments on soil water and plant uptake dynamics under different cropping systems

Abstract Application of biochar amendments in agricultural systems has received much attention in recent years. In this study, we assess the 5‐year impacts of biochar application on soil water and plant interactions for an irrigated fresh market tomato ( Solanum lycopersicum ) and a rainfed pasture ( Poaceae ) cropping system. In particular, we focus on three varieties of locally produced biochar from agricultural waste materials—almond shell, walnut shell, and almond pruning residues that are pyrolyzed using a mobile pyrolysis unit. We used the soil hydrological model HYDRUS‐1D to explicitly track seasonal and annual soil water fluxes through changes in water retention, drainage, evaporation, and plant water uptake under biochar application. Modeling results show that the application of biochar at 5% increased soil water availability within the top 20 cm for a rainfed system, irrespective of biochar amendment type. This is clearly indicative of higher plant water uptake and greater water use efficiency (WUE) under biochar application. In contrast, a similar biochar amendment for the irrigated system did not affect WUE, instead reducing seasonal soil evaporation loss and thereby reducing irrigation demand. In both cropping systems, year‐to‐year variability in precipitation significantly impacted the total amount of water saved under biochar application with certain amendments retaining more water than others. Given that biochar application increased water retention irrespective of cropping systems, we further used a simple approach to determine yield trade‐off, if any, between control and biochar treatments. Our economic balance clearly demonstrates that the water saved by amending soil with biochar does not offset the yield disparity if compensated with carbon credits and therefore, application of biochar should be actively considered for both its direct and indirect benefits to potential greenhouse gas mitigation (e.g., diverting orchard waste from open burning), water savings, and soil health.

54 ENVIRONMENTAL SCIENCES↗