Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ITERATIVE NETWORK”

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 OSTI2022

Evaluating the Performance of Random Forest and Iterative Random Forest Based Methods when Applied to Gene Expression Data

Gene-to-gene networks, such as Gene Regulatory Networks (GRN) and Predictive Expression Networks (PEN) capture relationships between genes and are beneficial for use in downstream biological analyses. There exists multiple network inference tools to produce these gene-to-gene networks from matrices of gene expression data. Random Forest-Leave One Out Prediction (RF-LOOP) is a method that has been shown to be efficient at producing these gene-to-gene networks, frequently known as GEne Network Inference with Ensemble of trees (GENIE3). Here we validate that iterative Random Forest-Leave One Out Prediction (iRF-LOOP) produces higher quality networks than GENIE3. We use both synthetic and empirical networks from the Dialogue for Reverse Engineering Assessment and Methods (DREAM) Challenges by Sage Bionetworks, as well as two additional empirical networks created from Arabidopsis thaliana and Populus trichocarpa expression data.

iRF-Loop, expression network, Populus Trichocarpa↗
DOE OSTI2023

Graph Neural Networks and Applied Linear Algebra v.1.0

SAND2024-01365O The Graph Neural Networks and Applied Linear Algebra is companion software for the educational article with the same title. The software provides illustrative examples of graph neural networks in Matlab and Python. These stand-alone algorithms are for educational purposes. The software also includes graph neural network-based algorithms for a trainable Jacobi iteration as well as diffusion coefficient estimation. The software provides human-interpretable implementations of Graph Neural Networks in Matlab and Python. These implementations are not optimized for performance and instead emphasize readability. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗
DOE OSTI2025

A framework to evaluate machine learning crystal stability predictions

The rapid adoption of machine learning in various scientific domains calls for the development of best practices and community agreed-upon benchmarking tasks and metrics. We present Matbench Discovery as an example evaluation framework for machine learning energy models, here applied as pre-filters to first-principles computed data in a high-throughput search for stable inorganic crystals. We address the disconnect between (1) thermodynamic stability and formation energy and (2) retrospective and prospective benchmarking for materials discovery. Alongside this paper, we publish a Python package to aid with future model submissions and a growing online leaderboard with adaptive user-defined weighting of various performance metrics allowing researchers to prioritize the metrics they value most. To answer the question of which machine learning methodology performs best at materials discovery, our initial release includes random forests, graph neural networks, one-shot predictors, iterative Bayesian optimizers and universal interatomic potentials. We highlight a misalignment between commonly used regression metrics and more task-relevant classification metrics for materials discovery. Accurate regressors are susceptible to unexpectedly high false-positive rates if those accurate predictions lie close to the decision boundary at 0 eV per atom above the convex hull. The benchmark results demonstrate that universal interatomic potentials have advanced sufficiently to effectively and cheaply pre-screen thermodynamic stable hypothetical materials in future expansions of high-throughput materials databases.

Riebesell, Janosh↗
DOE OSTI2023

Few-shot leaf segmentation

In this work, we use few-shot learning to segment the body and vein architecture of Populus trichocarpa leaves from high-resolution scans obtained in the UC Davis common garden. Leaf and vein segmentation are formulated as separate tasks, in which convolutional neural networks (CNNs) are used to iteratively expand partial segmentations until reaching stopping criteria. Our leaf and vein segmentation approaches use just 50 and 8 manually traced images for training, respectively, and are applied to a set of 2,634 top and bottom leaf scans. We show that both methods achieve high segmentation accuracy, in some cases exceeding even human-level segmentation. The leaf and vein segmentations are subsequently used to extract 68 morphological traits using traditional open-source image processing tools, which are validated using real-world physical measurements. For a biological perspective, we perform a genome-wide association study using the "vein density" trait to discover novel genetic architectures associated with multiple physiological processes relating to leaf development and function. In addition to sharing all of the few-shot learning code, we are releasing all images, manual segmentations, model predictions, 68 extracted leaf phenotypes, and a new set of SNPs called against the v4 P. trichocarpa genome for 1,419 genotypes.

Lagergren, John [Oak Ridge National Lab. (ORNL), O↗
DOE OSTI2023

Supporting information for Few-Shot Learning Enables Population-Scale Analysis of Leaf Traits in Populus trichocarpa

In this work, we use few-shot learning to segment the body and vein architecture of P. trichocarpa leaves from high-resolution scans obtained in the UC Davis common garden. Leaf and vein segmentation are formulated as separate tasks, in which convolutional neural networks (CNNs) are used to iteratively expand partial segmentations until reaching stopping criteria. Our leaf and vein segmentation approaches use just 50 and 8 manually traced images for training, respectively, and are applied to a set of 2,634 top and bottom leaf scans. We show that both methods achieve high segmentation accuracy, in some cases exceeding even human-level segmentation. The leaf and vein segmentations are subsequently used to extract 68 morphological traits using traditional open-source image processing tools, which are validated using real-world physical measurements. For a biological perspective, we perform a genome-wide association study using the vein density trait to discover novel genetic architectures associated with multiple physiological processes relating to leaf development and function. In addition to sharing all of the few-shot learning code (see https://github.com/jlager/few-shot-leaf-segmentation), we are releasing all images, manual segmentations, model predictions, 68 extracted leaf phenotypes, and a new set of SNPs called against the v4 P. trichocarpa genome for 1,419 genotypes. The data folder includes all images, ground truth segmentations, predicted segmentations, and extracted leaf traits. All images encode the sample ID in the file name by indicating the treatment, block, row, position, and leaf side, respectively. For example, the file, C_1_1_2_bot.jpeg, indicates the control treatment, block 1, row 1, position 2, and the bottom side of the leaf. Tabulated results include position IDs as well as the corresponding genotype IDs. The images folder includes the 2,906 high-resolution leaf scans taken in the field. The leaf_masks folder includes 50 ground truth segmentations used for training the leaf tracing algorithm. The leaf_preds folder includes the 2,906 predicted segmentations from the leaf tracing algorithm. The vein_masks folder includes 8 ground truth segmentations used for training the vein growing algorithm. The vein_preds folder includes the 1,453 predicted segmentations from the vein growing algorithm. The vein_probs folder includes the 1,453 predicted probability maps from the vein growing algorithm before thresholding. The genomes folder includes the set of SNPs called against the v4 P. trichocarpa genome for 1,419 genotypes with a README file detailing the steps taken. The results folder includes: (i) raw values of the 68 predicted leaf traits in digital_traits.tsv, (ii) manually measured values of petiole length and width in manual_traits.tsv, (iii) thin plate spline (TPS) adjusted values of the vein density trait in vein_density_tps_adj.tsv, (iv) best linear unbiased prediction (BLUP) adjusted values of the vein density trait in vein_density_blups.tsv, and (v) GWAS results for the vein density trait, including chromosome positions and corresponding P values, in gwas_results.csv.

09 BIOMASS FUELS↗
DOE OSTI2017

Integrated Nondestructive Assay Systems to Estimate Plutonium in Spent Fuel Assemblies

An integrated nondestructive assay (NDA) system combining active (neutron generator) and passive neutron detection and passive gamma (PG) detection is being analyzed in order to estimate the amount of plutonium, verify initial enrichment, burnup, and cooling time, and detect partial defects in a spent fuel assembly (SFA). Active signals are measured using the differential die-away (DDA), delayed neutron (DN), and delayed gamma (DG) techniques. Passive signals are measured using total neutron (TN) counts and both gross and spectral resolved gamma counts. To quantify how a system of several NDA techniques is expected to perform, all of the relevant NDA techniques listed above were simulated as a function of various reactor conditions such as initial enrichment, burnup, cooling time, assembly shuffling pattern, reactor operating conditions (including temperature, pressure, and the presence of burnable poisons) by simulating the NDA response for five sets of light water reactor assemblies. In this study, we compare the performance of several exploratory model-fitting options (including neural networks, adaptive regression with splines, iterative bias reduction smoothing, projection pursuit regression, and regression with quadratic terms and interaction terms) to relate data simulated with measurement and model error effects from various subsets of the NDA techniques to the total Pu mass. Isotope masses for SFAs and expected detector responses (DRs) for several NDA techniques are simulated using MCNP, and the DRs become inputs to the fitting process. Such responses include eight signals from DDA, one from DN, one from TN, and up to seven from PG; the DG signal will be examined separately. Results are summarized using the root-mean-squared estimation error for plutonium mass in held-out subsets of the data for a range of model and measurement error variances. Different simulation assumptions lead to different spent fuel libraries relating DRs to Pu mass. Some results for training with one library and testing with another library are also given.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2019

Scalable flexibility control of distributed loads in a power grid

The technology described herein is generally directed towards a distributed optimization technology for the control of aggregation of distributed flexibility resource nodes that operates iteratively until a commanded power profile is produced by aggregated loads. The technology uses a distributed iterative solution in which each node solves a local optimization problem with local constraints and states, while using a global Lagrange multiplier that is based upon information from each other node. The global Lagrange multiplier is determined at an aggregation level using load-specific information that is obtained in a condensed form (e.g., a scalar) from each node at each iteration. The global Lagrange multiplier is broadcasted to the nodes for each new iteration. The technology provides an iterative, distributed solution to the network optimization problem of power tracking of aggregated loads.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Mimicking of corruption in images

Methods and systems are provided to generate an uncorrupted version of an image given an observed image that is a corrupted version of the image. In some embodiments, a corruption mimicking (“CM”) system iteratively trains a corruption mimicking network (“CMN”) to generate corrupted images given modeled images, updates latent vectors based on differences between the corrupted images and observed images, and applies a generator to the latent vectors to generate modeled images. The training, updating, and applying are performed until modeled images that are input to the CMN result in corrupted images that approximate the observed images. Because the CMN is trained to mimic the corruption of the observed images, the final modeled images represented the uncorrupted version of the observed images.

Anirudh, Rushil↗
DOE OSTI2024

Delineation of endorheic drainage basins in the MERIT-Plus dataset for 5 and 15 minute upscaled river networks

Abstract The MERIT-Hydro networks re-gridded by the Iterative Hydrography Upscaling (IHU) algorithm do not retain exo- or endorheic basin attributes from the original data. Here we developed methods to assign such attributes to those and any other digital river networks. The motivation is that endorheic inland drainage basins are essential for hydrologic modelling of global and regional water balances, land surface water storage, gravity anomalies, sea level rise, etc. First, we create basin attributes that explicitly label endorheic and exorheic catchments by the criteria of direct or hidden connectivity to the ocean without changing their flow direction grid. In the second step we alter the delineation of endorheic basins by the merging algorithm that eliminates small inland watersheds to the adjacent host basins. The resulting datasets have a significantly reduced number of endorheic basins while preserving the total land portion and topology of the inland basins. The data was validated using the Water Balance Model by comparing volume of endorheic inland depressions with modelled water accumulation in their inland lakes.

58 GEOSCIENCES↗
NASA NTRS1996

Cloud Classification in Polar and Desert Regions and Smoke Classification from Biomass Burning Using a Hierarchical Neural Network

This research focuses on a new neural network scene classification technique. The task is to identify scene elements in Advanced Very High Resolution Radiometry (AVHRR) data from three scene types: polar, desert and smoke from biomass burning in South America (smoke). The ultimate goal of this research is to design and implement a computer system which will identify the clouds present on a whole-Earth satellite view as a means of tracking global climate changes. Previous research has reported results for rule-based systems (Tovinkere et at 1992, 1993) for standard back propagation (Watters et at. 1993) and for a hierarchical approach (Corwin et al 1994) for polar data. This research uses a hierarchical neural network with don't care conditions and applies this technique to complex scenes. A hierarchical neural network consists of a switching network and a collection of leaf networks. The idea of the hierarchical neural network is that it is a simpler task to classify a certain pattern from a subset of patterns than it is to classify a pattern from the entire set. Therefore, the first task is to cluster the classes into groups. The switching, or decision network, performs an initial classification by selecting a leaf network. The leaf networks contain a reduced set of similar classes, and it is in the various leaf networks that the actual classification takes place. The grouping of classes in the various leaf networks is determined by applying an iterative clustering algorithm. Several clustering algorithms were investigated, but due to the size of the data sets, the exhaustive search algorithms were eliminated. A heuristic approach using a confusion matrix from a lightly trained neural network provided the basis for the clustering algorithm. Once the clusters have been identified, the hierarchical network can be trained. The approach of using don't care nodes results from the difficulty in generating extremely complex surfaces in order to separate one class from all of the others. This approach finds pairwise separating surfaces and forms the more complex separating surface from combinations of simpler surfaces. This technique both reduces training time and improves accuracy over the previously reported results. Accuracies of 97.47%, 95.70%, and 99.05% were achieved for the polar, desert and smoke data sets.

Alexander, June↗
DOE OSTI2023

Attentional Ptycho-Tomography (APT) for three-dimensional nanoscale X-ray imaging with minimal data acquisition and computation time

Abstract Noninvasive X-ray imaging of nanoscale three-dimensional objects, such as integrated circuits (ICs), generally requires two types of scanning: ptychographic, which is translational and returns estimates of the complex electromagnetic field through the IC; combined with a tomographic scan, which collects these complex field projections from multiple angles. Here, we present Attentional Ptycho-Tomography (APT), an approach to drastically reduce the amount of angular scanning, and thus the total acquisition time. APT is machine learning-based, utilizing axial self-Attention for Ptycho-Tomographic reconstruction. APT is trained to obtain accurate reconstructions of the ICs, despite the incompleteness of the measurements. The training process includes regularizing priors in the form of typical patterns found in IC interiors, and the physics of X-ray propagation through the IC. We show that APT with ×12 reduced angles achieves fidelity comparable to the gold standard Simultaneous Algebraic Reconstruction Technique (SART) with the original set of angles. When using the same set of reduced angles, then APT also outperforms Filtered Back Projection (FBP), Simultaneous Iterative Reconstruction Technique (SIRT) and SART. The time needed to compute the reconstruction is also reduced, because the trained neural network is a forward operation, unlike the iterative nature of these alternatives. Our experiments show that, without loss in quality, for a 4.48 × 93.2 × 3.92 µm 3 IC (≃6 × 10 8 voxels), APT reduces the total data acquisition and computation time from 67.96 h to 38 min. We expect our physics-assisted and attention-utilizing machine learning framework to be applicable to other branches of nanoscale imaging, including materials science and biological imaging.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Data-driven predictive probability density function control of fiber length stochastic distribution shaping in refining process

Pulp is the most important raw material in paper in paper industries, whose Fiber Length Stochastic Distribution (FLSD) shaping directly determines the energy consumption and paper quality of the subsequent papermaking processes. However, the mean and variance are insufficient to describe the output FLSD shaping, which display non-Gaussian distribution properties. Therefore, the traditional control, method based on the mean and variance of fiber length is difficult to control the FLSD shaping effectively. In this paper, a novel data-driven predictive probability density function (PDF) control method is proposed for output FLSD shaping in refining process. Primarily, in order to improve the approximation accuracy of the PDF employing RBF neural network, the parameters (center value and width) of each RBF basis functions are tuned via utilizing iterative learning control (ILC) law, and the corresponding estimations of weights law can be obtained. Secondly, considering that the conventional linear model of weights vector has drawbacks of low accuracy and weak generalization ability, random vector functional link networks (RVFLNs) based data driven nonlinear modelling method is employed to characterize the prediction model between the input variables and weights vector. Finally, in order to reduce the randomness of the output FLSD, a minimum entropy control method under mean constraint is employed to design the predictive PDF controller for the output FLSD shaping with the help of the established nonlinear stochastic distribution model. Both simulations and experiments are given to illustrate the effectiveness and practicability of the proposed method.

Probability debsity function, Fiber length distrib↗
DOE OSTI2019

PtychoNet: Fast and High Quality Phase Retrieval for Ptychography

Ptychography is a coherent diffractive imaging method that captures multiple diffraction patterns of a sample with a set of shifted localized illuminations (“probes”). The reconstruction problem, known as “phase retrieval”, is typically solved by iterative algorithms. In this paper, we propose PtychoNet, a deep learning based method to perform phase retrieval for ptychography in a non-iterative manner. We devise a generative network to encode a full ptychography scan, reverse the diffractions at each scanning point and compute the amplitude and phase of the object. We demonstrate successful reconstructions using PtychoNet as well as recovering fine features in the case of extreme sparse scanning where conventional iterative methods fail to give recognizable features.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A progressive deep transfer learning approach to cycle-skipping mitigation in FWI, In SEG Technical Program Expanded Abstracts 2019, pp. 2348-2352. Society of Exploration Geophysicists, 2019.

To effectively mitigate the cycle-skipping phenomenon in full waveform inversion (FWI), we developed an inception-based deep learning neural network to reconstruct the absent low frequency data by exploiting the subsurface low wavenumber information buried in the acquired high frequency data. Two unique features of our deep learning network for the low frequency data reconstruction are 1) Dual Data Feed; 2) Progressive Transfer Learning. With the Dual Data Feed feature, not only the high frequency data, but also the corresponding Beat Tone data are fed into the neural network, significantly reducing the network complexity and the network training cost. The Progressive Transfer Learning technique enables us to initiate the deep learning network with only one training dataset. Unlike other deep learning approaches in this category, our training dataset is not fixed. Instead, the training dataset and the network accuracy are progressively enhanced in an iterative manner within the Progressive Transfer Learning workflow. The numerical experiments validated that the low frequency data reconstructed by this progressive transfer learning network are sufficiently accurate for a successful FWI inversion without suffering from the cycle-skipping without any priori geological information.

58 GEOSCIENCES↗
DOE OSTI2024

Integration of CeO 2 -Based Memristor with Vertically Aligned Nanocomposite Thin Film: Enabling Selective Conductive Filament Formation for High-Performance Electronic Synapses

The CeO 2 -based memristor has attracted significant attention due to its intrinsic resistive switching (RS) properties, large on/off ratio, and great plasticity, making it a promising candidate for artificial synapses. However, significant challenges such as high power consumption and poor device reliability hinder its broad application in neuromorphic microchips. To tackle these issues, in this work, we design a novel bilayer (BL) memristor by integrating a CeO 2 -based memristor with a Co-CeO 2 vertically aligned nanocomposite (VAN) layer and compare it with the single layer (SL) memristor. Preliminary electrical testing reveals that the BL memristor offers a reduced set/reset voltage (~67% lower), a higher on/off ratio (~5 × 10 2 ), enhanced device reliability, and improved device-to-device variation compared to the SL memristor. Insight from COMSOL simulation, coupled with microstructural analysis, provides a comprehensive elucidation on how the VAN layer facilitates the selective conductive filament (CF) formation. Subsequently, the plasticity of the BL memristor is evaluated through long-term potentiation/depression (LTP/LTD), paired-pulse facilitation (PPF), and spike-time-dependent plasticity (STDP). The spiking neural network (SNN) built upon the BL memristor achieves remarkable accuracy (~94%) after only 12 iterations, underscoring its potential for high-performance neural networks.

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

Structure- and Physics-Preserving Reductions of Power Grid Models

The large size of multiscale, distribution and transmission, power grids hinders fast systemwide estimation and real-time control and optimization of operations. This paper studies graph reduction methods of power grids that are favorable for fast simulations and follow-up applications. While the classical Kron reduction has been successful in reduced order modeling of power grids with traditional, hierarchical design, the selection of reference nodes for the reduced model in a multiscale, distribution and transmission, network becomes ambiguous. In this work we extend the use of the iterative Kron reduction by utilizing the electric grid's graph topology for the selection of reference nodes, consistent with the design features of multiscale networks. Additionally, we propose further reductions by aggregation of coherent subnetworks of triangular meshes, based on the graph topology and network characteristics, in order to preserve currents and build another power-flow equivalent network. Our reductions are achieved through the use of iterative aggregation of subgraphs that include general tree structures, lines, and triangles. Important features of our reduction algorithms include that (i) the reductions are either equivalent to the Kron reduction or otherwise produce a power-flow equivalent network; (ii) due to the mentioned power-flow equivalence, the reduced network can model the dynamic of the swing equations for a lossless, inductive, steady state network; (iii) the algorithms efficiently utilize hash tables to store the sequential reduction steps. The third feature allows for easy reintroduction of detailed models into the reduced, conceptual network and makes the final reduced order model backward compatible with a sequence of intermediate, partially reduced networks with varying resolution---the ordered sequence of iterative reductions corresponds to a sequence of reduced order models. The performance of our graph reduction algorithms and features of the reduced grids are discussed on a real-word transmission and distribution grid. We produce visualizations of the reduced models through open source libraries and release our reduction algorithms with example code and toy data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Evaluation of artificial neural network performance for classification of potato plants infected with potato virus Y using spectral data on multiple varieties and genotypes

Potato virus Y (Potyviridae, PVY) is a plant virus that poses a significant threat to potato producers on a global basis. The pathogen has disrupted seed potato supplies and negatively impacted yield and quality of commercial potato crops. The potato industry currently manages PVY infection levels via insecticide applications, regional seed certification programs that rely on field scouting to visually assess individual plants for infection status, and destructive and costly tissue sampling coupled with laboratory assays. Despite these efforts, PVY continues to confound potato industry stakeholders resulting in economic harm. Remote sensing and machine learning provide for the development of new tools to more accurately detect and spatially quantify PVY-infected plants versus the current state of the art. However, there is a need to understand how the occurrence of many different potato varieties impact the dynamics of developing models to detect potato plants impacted with PVY and their potential effectiveness. This study evaluates classification modelling outcomes using spectral datasets collected in different temporal and spatial environments (greenhouse and a production field) on multiple potato varieties consisting of labelled instances of plants infected with PVY and those not infected with the virus. A modelling framework was developed to support iterative modelling runs using artificial neural network (ANN) architectures configured as binary classifiers to develop sample populations to support statistical analysis on model performance using specific spectral subsets. When using spectral data to detect PVY-infected plants, ANN models achieved the highest mean accuracy of 0.894 on a single variety. Conversely, the same ANN model architecture only achieved a mean accuracy of 0.575 on a spectral data set representing 29 potato breeding lines. Additionally, statistical analysis indicates spectral regions including the red edge, near infrared and shortwave infrared contain more important spectral features for the ANN classifier introduced in this research.

60 APPLIED LIFE SCIENCES↗