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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

A Deep-Learning System for Fully-Automated Peripherally Inserted Central Catheter (PICC) Tip Detection

A peripherally inserted central catheter (PICC) is a thin catheter that is inserted via arm veins and threaded near the heart, providing intravenous access. The final catheter tip position is always confirmed on a chest radiograph (CXR) immediately after insertion since malpositioned PICCs can cause potentially life-threatening complications. Although radiologists interpret PICC tip location with high accuracy, delays in interpretation can be significant. In this study, we proposed a fully-automated, deep-learning system with a cascading segmentation AI system containing two fully convolutional neural networks for detecting a PICC line and its tip location. A preprocessing module performed image quality and dimension normalization, and a post-processing module found the PICC tip accurately by pruning false positives. Our best model, trained on 400 training cases and selectively tuned on 50 validation cases, obtained absolute distances from ground truth with a mean of 3.10 mm, a standard deviation of 2.03 mm, and a root mean squares error (RMSE) of 3.71 mm on 150 held-out test cases. This system could help speed confirmation of PICC position and further be generalized to include other types of vascular access and therapeutic support devices.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2022

Using advanced data structures to enable responsive security monitoring

Write-optimized data structures (WODS), offer the potential to keep up with cyberstream event rates and give sub-second query response for key items like IP addresses. These data structures organize logs as the events are observed. To work in a real-world environment and not fill up the disk, WODS must efficiently expire older events. As the basis for our research into organizing security monitoring data, we implemented a tool, called Diventi, to index IP addresses in connection logs using RocksDB (a write-optimized LSM tree). In this work, we extended Diventi to automatically expire data as part of the data structures’ normal operations. We guarantee that Diventi always tracks the N most recent events and tracks no more than N + k events for a parameter k < N, while ensuring the index is opportunistically pruned. To test Diventi at scale in a controlled environment, we used anonymized traces of IP communications collected at SuperComputing 2019. We synthetically extended the 2.4 billion connection events to 100 billion events. We tested Diventi vs. Elasticsearch, a common log indexing tool. In our test environment, Elasticsearch saw an ingestion rate of at best 37,000 events/s while Diventi sustained ingestion rates greater than 171,000 events/s. Our query response times were as much as 100 times faster, typically answering queries in under 80 ms. Furthermore, we saw no noticeable degradation in Diventi from expiration. We have deployed Diventi for many months where it has performed well and supported new security analysis capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A novel machine learning based identification of potential adopter of rooftop solar photovoltaics

With the proliferation of rooftop solar photovoltaic installations, there is a need to proactively predict consumer potential for solar photovoltaic adoption, for improved electric utility planning and operation. Traditional analytical modeling approaches are limited to a few survey features and a larger part of the survey would remain untouched by the decision model. This article presents a novel, data-driven modeling approach that strategically prunes a large set of consumer profile features using a machine learning framework to train a model for predicting potential solar adoption. The approach utilizes the Gradient Boosting Decision Tree model through a Light Gradient Boosting framework that improves significantly over the poor prediction accuracy of the existing approaches. Model training using focal-loss based supervision is used to overcome the difficulty in identifying the potential adopters that is inherent in conventional data-driven models. In addition, to overcome possible data sparsity in a limited survey sample, a Generative Adversarial Network is presented to create synthetic user samples and its effectiveness on model performance is assessed. A Bayesian optimization approach is used to systematically arrive at the hyperparameters of the proposed model. Validation of the presented approach on a survey data collected by the National Rural Electric Cooperative Association in Virginia in 2018 demonstrates the excellent predictive capability of the machine learning based approach to modeling solar adoption reliably.

14 SOLAR ENERGY↗
DOE OSTI2021

Biomass supply chain equipment for renewable fuels production: A review

The production of renewable fuels is a critical component of global strategies to reduce greenhouse gas (GHG) emissions. Moreover, the collection of raw materials for its production can provide added benefits such as reduction of wildfire risk, additional income for farmers, and decreased disposal costs. Although there is substantial literature on design and modeling of supply chains, the authors were unable to find a single reference with the information needed for the selection and cost estimation of each type of equipment involved in the supply chain. Therefore, the goal of this research is to gather information necessary for the construction and utilization of models that might drive the identification of a feasible supply chain to produce renewable fuels at a commercial scale. The primary objectives are to 1) understand the supply chain of critical feedstocks for renewable fuels production; 2) identify the equipment commercially available for collection and adequation of feedstock; and 3) consolidate information regarding equipment cost, energy consumption, and efficiency, as well as feedstock storage and transportation systems. This paper provides a compilation for five feedstock types studied for sustainable aviation fuel production: 1) agricultural residues and grasses, 2) forest residues, 3) urban wood waste, 4) oilseeds, 5) fats, oils & greases. All the technologies involved from the field to the gate of the preprocessing or conversion unit were reviewed. The information on fats, oils & greases supply chains and equipment purposely designed for forest thinning and pruning was very limited.

: Feedstock, Collection and Adequation, Renewable ↗
DOE OSTI2014

Occupancy schedules learning process through a data mining framework

Building occupancy is a paramount factor in building energy simulations. Specifically, lighting, plug loads, HVAC equipment utilization, fresh air requirements and internal heat gain or loss greatly depends on the level of occupancy within a building. Developing the appropriate methodologies to describe and reproduce the intricate network responsible for human-building interactions are needed. Extrapolation of patterns from big data streams is a powerful analysis technique which will allow for a better understanding of energy usage in buildings. A three-step data mining framework is applied to discover occupancy patterns in office spaces. First, a data set of 16 offices with 10 minute interval occupancy data, over a two year period is mined through a decision tree model which predicts the occupancy presence. Then a rule induction algorithm is used to learn a pruned set of rules on the results from the decision tree model. Finally, a cluster analysis is employed in order to obtain consistent patterns of occupancy schedules. Furthermore, the identified occupancy rules and schedules are representative as four archetypal working profiles that can be used as input to current building energy modeling programs, such as EnergyPlus or IDA-ICE, to investigate impact of occupant presence on design, operation and energy use in office buildings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

Green spaces are not all the same for the provision of air purification and climate regulation services: The case of urban parks

Highlights: • Air purification and climate regulation were quantified in an urban green space. • Different vegetation types shown different capacities to provide these services. • Original woodland presented the higher ecosystem services provision. • Vegetation structure, composition and management matter to services provision. • Nature-based solutions in urban areas can optimize local climate and air quality. The growing human population concentrated in urban areas lead to the increase of road traffic and artificial areas, consequently enhancing air pollution and urban heat island effects, among others. These environmental changes affect citizen's health, causing a high number of premature deaths, with considerable social and economic costs. Nature-based solutions are essential to ameliorate those impacts in urban areas. While the mere presence of urban green spaces is pointed as an overarching solution, the relative importance of specific vegetation structure, composition and management to improve the ecosystem services of air purification and climate regulation are overlooked. This avoids the establishment of optimized planning and management procedures for urban green spaces with high spatial resolution and detail. Our aim was to understand the relative contribution of vegetation structure, composition and management for the provision of ecosystem services of air purification and climate regulation in urban green spaces, in particular the case of urban parks. This work was done in a large urban park with different types of vegetation surrounded by urban areas. As indicators of microclimatic effects and of air pollution levels we selected different metrics: lichen diversity and pollutants accumulation in lichens. Among lichen diversity, functional traits related to nutrient and water requirements were used as surrogates of the capacity of vegetation to filter air pollution and to regulate climate, and provide air purification and climate regulation ecosystem services, respectively. This was also obtained with very high spatial resolution which allows detailed spatial planning for optimization of ecosystem services. We found that vegetation type characterized by a more complex structure (trees, shrubs and herbaceous layers) and by the absence of management (pruning, irrigation and fertilization) had a higher capacity to provide the ecosystems services of air purification and climate regulation. By contrast, lawns, which have a less complex structure and are highly managed, were associated to a lower capacity to provide these services. Tree plantations showed an intermediate effect between the other two types of vegetation. Thus, vegetation structure, composition and management are important to optimize green spaces capacity to purify air and regulate climate. Taking this into account green spaces can be managed at high spatial resolutions to optimize these ecosystem services in urban areas and contribute to improve human well-being.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Learning interpretable surface elasticity properties from bulk properties via neural network equation learners

Surface elasticity is central to understanding the mechanics and stability of surfaces and interfaces. It is characterized by quantities such as surface tension, residual surface stress, and surface stiffness. However their analytical expressions are typically difficult to derive from atomistic data, and depend strongly on modeling choices. This work presents a neural network-based equation learner which combines customized activation functions and connection-based pruning to discover parsimonious, closed-form equations for surface elasticity from atomistic simulations. Applying the method to seven face-centered cubic (FCC) metals, our equation learner uncovers interpretable equations that describe both low-Miller index and high-Miller index surface properties, capturing long-tail property distributions accurately. The discovered expressions are decoupled into two components: a universal, geometry-driven orientation function, and material-specific baseline coefficients. We find that lower-order properties such as surface tension are fundamentally geometry dependent, while higher-order properties such as surface stress and elasticity show more complex geometry and material dependence. We also relate material dependent coefficients to bulk properties, forming a clear map from bulk material properties to surface elasticity. Overall, this approach demonstrates that interpretable neurosymbolic machine learning can bridge the gap between atomistic simulations and physical laws, enabling the discovery of generalizable structure–property relationships for materials science phenomena such as surface elasticity.

Equation learning↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Curating a comprehensive set of enzymatic reaction rules for efficient novel biosynthetic pathway design

Enzyme substrate promiscuity has significant implications for metabolic engineering. The ability to predict the space of possible enzymatic side reactions is crucial for elucidating underground metabolic networks in microorganisms, as well as harnessing novel biosynthetic capabilities of enzymes to produce desired chemicals. Reaction rule-based cheminformatics platforms have been implemented to computationally enumerate possible promiscuous reactions, relying on existing knowledge of enzymatic transformations to inform novel reactions. However, past versions of curated reaction rules have been limited by a lack of comprehensiveness in representing all possible transformations, as well as the need to prune rules to enhance computational efficiency in pathway expansion. To this end, we curated a set of 1224 most generalized reaction rules, automatically abstracted from atom-mapped MetaCyc reactions and verified to uniquely cover all common enzymatic transformations. Additionally, we developed a framework to systematically identify and correct redundancies and errors in the curation process, resulting in a minimal, yet comprehensive, rule set. These reaction rules were capable of reproducing more than 85% of all reactions in the KEGG and BRENDA databases, for which a large fraction of reactions is not present in MetaCyc. Our rules exceed all previously published rule sets for which reproduction was possible in this coverage analysis, which allows for the exploration of a larger space of known enzymatic transformations. By leveraging the entire knowledge of possible metabolic reactions through generalized enzymatic reaction rules, we are able to better utilize underground metabolic pathways and accelerate novel biosynthetic pathway design to enable bioproduction towards a wider range of new molecules.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Short-cut Methods versus Rigorous Methods for Performance-evaluation of Distillation Configurations

Here, this study demonstrates the efficacy of a short-cut method such as the Global Minimization Algorithm (GMA), that uses assumptions of ideal mixtures, constant molar overflow (CMO) and pinched columns, in pruning the search-space of distillation column configurations for zeotropic multicomponent separation, to provide a small subset of attractive configurations with low minimum heat duties. The short-cut method, due to its simplifying assumptions, is computationally efficient, yet reliable in identifying the small subset of useful configurations for further detailed process evaluation. This two-tier approach allows expedient search of the configuration space containing hundreds to thousands of candidate configurations for a given application.

42 ENGINEERING↗
DOE OSTI2025

Physics-Driven Construction of Compact Primitive Gaussian Density Fitting Basis Sets

We present a model-assisted density fitting (MADF) basis set generator, an algorithm for generating primitive atomic Gaussian density fitting (DF) basis sets (DFBSs) from a contracted Gaussian orbital basis set (OBS). The MADF algorithm produces DFBSs suitable for accurate robust DF approximation of 2-particle interactions in mean-field and correlated electronic structures. The algorithm is designed to (a) saturate the OBS product space by a large regularized set of primitive solid-harmonic Gaussian shells with nonuniform distribution of exponents, followed by (b) pruning of the shells according to their contributions to the 2- body energy of a correlated atomic ensemble. Building the DFBS generator model almost exclusively on mathematical and physical principles allows one to limit the number of parameters that control the density fitting error to three, with a single set of parameters sufficient for computations with all basis cardinal numbers, with and without correlation of core electrons, with and without scalar and spin-dependent relativistic effects, spanning almost all of the Periodic Table. Performance assessment included basis sets up to quadruple-ζ quality from several major basis set families, using molecules composed of main-group, d-block, and f-block elements. The resulting DF errors in Hartree−Fock and second-order MP2 energies (with relativistic all-electron treatments, when appropriate) were on the order of 20 and 10 μE h per electron, respectively.

Approximation↗
DOE OSTI2019

Parameterization Strategies for Intermolecular Potentials for Predicting Trajectory-Based Collision Parameters

The accuracy of separable strategies for constructing full-dimensional potential energy surfaces for collisional energy transfer and collision rate calculations is studied systematically for three alcohols (A = methanol, ethanol, and butanol) and three bath gases (M = Ar, N 2 , and H 2 O). The fitting efficiency (defined as the number of ab initio data required to achieve parametrizations of a desired accuracy) is quantified for both pairwise (Buckingham or "exp6") and nonpairwise (permutationally invariant polynomials, PIPs, of Morse variables) functional forms, for four sampling strategies, and as a function of the complexity and anisotropy of the interaction potential. We find that convergence with respect to the number of sampled ab initio data is largely independent of the choice of functional form but instead varies nearly linearly with the number of adjustable parameters and depends strongly on the sampling strategy. Specifically, the use of biased Sobol quasirandom sampling is similar to 7X more efficient than using unbiased pseudorandom sampling, on average, requiring just similar to 3 computed ab initio energies per adjustable fitting parameter. The pairwise exp6 functional form is shown to provide accurate and transferable parametrizations for M = Ar but is unable to accurately describe alcohol interactions with M = N 2 and H 2 O. The nonpairwise PIP functional form, which is systematically improvable, can produce separable parametrizations with arbitrarily small fitting errors. However, these can suffer from overfitting, which is demonstrated using dynamics calculations of collision parameters for a large number of exp6 and PIP parametrizations. The tests described here validate a robust strategy for automatically generating A + M potential energy surfaces with minimal human intervention, including a quantifiable out of sample metric for judging the accuracy of the fitted surface. We further analyze this set of automatically generated potential energy surfaces to identify areas where more sophisticated fitting strategies may be desired, including pruning of the PIP expansions for large systems and improved sampling strategies more closely coupled with the description of the functional form.

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

Bayesian Model Averaging for Ensemble-Based Estimates of Solvation Free Energies

This paper applies the Bayesian Model Averaging (BMA) statistical ensemble technique to estimate small molecule solvation free energies. There is a wide range methods for predicting solvation free energies, ranging from empirical statistical models to {\it ab initio} quantum mechanical approaches. Each of these methods are based on a set of conceptual assumptions that can affect a method's predictive accuracy and transferability. Using an iterative statistical process, we have selected and combined solvation energy estimates using an ensemble of 17 diverse methods from the SAMPL4 blind prediction study to form a single, aggregated solvation energy estimate. The ensemble design process evaluates the statistical information in each individual method as well as the performance of the aggregate estimate obtained from the ensemble as a whole. Methods that possess minimal or redundant information are pruned from the ensemble and the evaluation process repeats until aggregate predictive performance can no longer be improved. We show that this process results in a final aggregate estimate that outperforms all individual methods by reducing estimate errors by as much as 91% to 1.2 kcal/mol accuracy. We also compare our iterative refinement approach to other statistical ensemble approaches and demonstrate that this iterative process reduces estimate errors by as much as 61%. This work provides a new approach for accurate solvation free energy prediction and lays the foundation for future work on aggregate models that can balance computational cost with predictive accuracy.

solvation, Bayesian model averaging, Electrostatic↗
DOE OSTI2020

A Multiyear Gridded Data Ensemble of Surface Biogenic Carbon Fluxes for North America: Evaluation and Analysis of Results

Accurate and fine-scale estimates of biogenic carbon fluxes are critical for measuring and monitoring the biosphere's responses and feedback to the climate system. Currently available data products from flux towers and model-intercomparison projects struggle to adequately represent spatiotemporal dynamics of surface biogenic carbon fluxes, and to quantify their uncertainties, which also are crucial to atmospheric inversion systems. To address these gaps, we introduce a new perturbed-parameter model ensemble with the CASA model to estimate surface biogenic carbon fluxes at monthly and 3-hourly scales for North America at ~500-m and 5-km resolutions. We first use the Extended Fourier Amplitude Sensitivity Testing to choose the three most sensitive parameters to be perturbed, maximum light use efficiency (E max ), optimal temperature of photosynthesis (T opt ), and temperature response of respiration (Q 10 ). The initial range for each parameter is broadly sampled for the L1 ensemble, but then we pruned E max with site-level primary productivity to derive an L2 ensemble with narrower uncertainty ranges. Ensembles are strongly correlated with site-level results at both monthly and 3-hourly scales, and the spread across L1/L2 ensemble members encompasses the range of AmeriFlux observations. Monthly variability in the L2 ensemble mean is 85% of the observed variability. The L2 ensemble outperforms diverse data products with the highest Taylor skill scores at diurnal to annual scales. Finally, the ensemble's seasonality agrees well with other models for most biome types and in high and middle latitudes, but inconsistencies are found in subtropical and tropical ecoregions and for annual totals over North America.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Global River Topology (GRIT): A Bifurcating River Hydrography

Existing global river networks underpin a wide range of hydrological applications but do not represent channels with divergent river flows (bifurcations, multi‐threaded channels, canals), as these features defy the convergent flow assumption that elevation‐derived networks (e.g., HydroSHEDS, MERIT Hydro) are based on. Yet, bifurcations are important features of the global river drainage system, especially on large floodplains and river deltas, and are also often found in densely populated regions. Here we developed the first raster and vector‐based Global RIver Topology that not only represents the tributaries of the global drainage network but also the distributaries, including multi‐threaded rivers, canals and deltas. We achieve this by merging a 30 m Landsat‐based river mask with elevation‐generated streams to ensure a homogeneous drainage density outside of the river mask for rivers narrower than approximately 30 m. Crucially, we employ the new 30 m digital terrain model, FABDEM, based on TanDEM‐X, which shows greater accuracy over the traditionally used SRTM derivatives. After vectorization and pruning, directionality is assigned by a series of elevation, flow angle and continuity approaches. The new global network and its attributes are validated using gauging stations, comparison with existing networks, and randomized manual checks. The new network represents 19.6 million km of streams and rivers with drainage areas greater than 50 km 2 and includes 67,495 bifurcations. With the advent of hyper‐resolution modeling and artificial intelligence, GRIT is expected to greatly improve the accuracy of many river‐based applications such as flood forecasting, water availability and quality simulations, or riverine habitat mapping.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Towards provably efficient quantum algorithms for large-scale machine-learning models

Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as $\mathcal{O}$(T 2 x polylog($n$)), where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Comparing crystal structures with symmetry and geometry

Abstract Measuring the similarity between two arbitrary crystal structures is a common challenge in crystallography and materials science. Although there are an infinite number of ways to mathematically relate two crystal structures, only a few are physically meaningful. Here we introduce both a geometry-based and a symmetry-adapted similarity metric to compare crystal structures. Using crystal symmetry and combinatorial optimization we describe an algorithm to arrive at the structural relationship that minimizes these similarity metrics across all possible maps between any pair of crystal structures. The approach makes it possible to (i) identify pairs of crystal structures that are identical, (ii) quantitatively measure the similarity between crystal structures, and (iii) find and rank structural transformation pathways between any pair of crystal structures. We discuss the advantages of using the symmetry-adapted cost metric over the geometric cost. Finally, we show that all known structural transformation pathways between common crystal structures are recovered with the mapping algorithm. The methodology presented in this study will be of value to efforts that seek to catalogue crystal structures, identify structural transformation pathways or prune large first-principles datasets used to parameterize on-lattice Hamiltonians.

36 MATERIALS SCIENCE↗