Search NASA⌕ Search

SEARCH · Search NASA

Results for “tree 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Improve Data Mining and Knowledge Discovery Through the Use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(R) (MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykhian, Gholam Ali↗
NASA NTRS2011

Improve Data Mining and Knowledge Discovery through the use of MatLab

Data mining is widely used to mine business, engineering, and scientific data. Data mining uses pattern based queries, searches, or other analyses of one or more electronic databases/datasets in order to discover or locate a predictive pattern or anomaly indicative of system failure, criminal or terrorist activity, etc. There are various algorithms, techniques and methods used to mine data; including neural networks, genetic algorithms, decision trees, nearest neighbor method, rule induction association analysis, slice and dice, segmentation, and clustering. These algorithms, techniques and methods used to detect patterns in a dataset, have been used in the development of numerous open source and commercially available products and technology for data mining. Data mining is best realized when latent information in a large quantity of data stored is discovered. No one technique solves all data mining problems; challenges are to select algorithms or methods appropriate to strengthen data/text mining and trending within given datasets. In recent years, throughout industry, academia and government agencies, thousands of data systems have been designed and tailored to serve specific engineering and business needs. Many of these systems use databases with relational algebra and structured query language to categorize and retrieve data. In these systems, data analyses are limited and require prior explicit knowledge of metadata and database relations; lacking exploratory data mining and discoveries of latent information. This presentation introduces MatLab(TradeMark)(MATrix LABoratory), an engineering and scientific data analyses tool to perform data mining. MatLab was originally intended to perform purely numerical calculations (a glorified calculator). Now, in addition to having hundreds of mathematical functions, it is a programming language with hundreds built in standard functions and numerous available toolboxes. MatLab's ease of data processing, visualization and its enormous availability of built in functionalities and toolboxes make it suitable to perform numerical computations and simulations as well as a data mining tool. Engineers and scientists can take advantage of the readily available functions/toolboxes to gain wider insight in their perspective data mining experiments.

Shaykahian, Gholan Ali↗
NASA NTRS2020

The European Russia Drought Atlas (1400-2016 CE)

We present the European Russia Drought Atlas (ERDA) that covers the East European Plain to the Ural Mountains from 1400–2016 CE. Like the Old World Drought Atlas (OWDA) for the Euro-Mediterranean region, the ERDA is a one-half degree gridded reconstruction of summer Palmer Drought Severity Indices estimated from a network of annual tree-ring chronologies. Ensemble point-by-point regression is used to generate the ERDA with the identical protocols used for developing the OWDA. Split calibration/validation tests of the ERDA indicate that it has significant skill over most of its domain and is much more skillful than the OWDA where they overlap in the western part of ERDA domain. Comparisons to historical droughts over European Russia additionally support the ERDA’s overall validity. The ERDA has been spatially smoothed and infilled using a local regression method to yield a spatially complete drought atlas back to 1400 CE. EOF analysis indicates that there are three principal modes of hydroclimatic variability in the ERDA. After Varimax rotation, these modes correlate significantly with independent climate data sets extending back to the late nineteenth century in a physically interpretable way and relate to atmospheric circulation dynamics of droughts and heatwaves over European Russia based on more recent instrumental data.

Cook, Edward R.↗
DOE OSTI2021

Leading/lagging cable referencing platform for monitoring the health of underground cable networks

A system for detecting water trees in branching underground electrical cables includes a pulse generator configured to inject a pulse into a first underground cable that branches into a second underground cable and a third underground cable. The system includes a first sensor associated with the first cable, a second sensor associated with the second cable, and a third sensor associated with the third cable. The system includes a control device configured to obtain a first, second, and third signal associated with the first, second and third sensors, respectively. The control device determines a lead-lag relationship between the second and third signals and determines presence of a water tree within at least one of the second and third cable based on the lead-lag relationship. When presence of a water tree is determined, the control device generates a control action associated with repairing or replacing the second and/or third cable.

Burkes, Klaehn W.↗
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). Random Forest can be replaced in this process by iterative Random Forest (iRF), which performs variable selection and boosting. Here we validate that iterative Random Forest-Leave One Out Prediction (iRF-LOOP) produces higher quality networks than GENIE3 (RF-LOOP). 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.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Distributed deep learning training using silicon photonic switched architectures

The scaling trends of deep learning models and distributed training workloads are challenging network capacities in today’s datacenters and high-performance computing (HPC) systems. We propose a system architecture that leverages silicon photonic (SiP) switch-enabled server regrouping using bandwidth steering to tackle the challenges and accelerate distributed deep learning training. In addition, our proposed system architecture utilizes a highly integrated operating system-based SiP switch control scheme to reduce implementation complexity. To demonstrate the feasibility of our proposal, we built an experimental testbed with a SiP switch-enabled reconfigurable fat tree topology and evaluated the network performance of distributed ring all-reduce and parameter server workloads. The experimental results show up to 3.6× improvements over the static non-reconfigurable fat tree. Our large-scale simulation results show that server regrouping can deliver up to 2.3× flow throughput improvement for a 2× tapered fat tree and a further 11% improvement when higher-layer bandwidth steering is employed. The collective results show the potential of integrating SiP switches into datacenters and HPC systems to accelerate distributed deep learning training.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Gap-filling eddy covariance methane fluxes: Comparison of machine learning model predictions and uncertainties at FLUXNET-CH4 wetlands

Time series of methane fluxes measured by eddy-covariance require gap-filling to estimate annual emissions. Gap-filling methane fluxes is challenging because of high variability and complex responses to multiple drivers. To date, there is no widely established gap-filling standard for methane, with regards both to the best model algorithms and predictors. In this study, we address the need for standardization by synthesizing results of gap-filling methods applied at 17 wetland sites spanning boreal to tropical regions including all major wetlands classes and two rice paddies. We introduce new procedures for: 1) creating realistic artificial gap scenarios, 2) training and evaluating gap-filling models without overstating performance, and 3) predicting half-hourly methane fluxes and annual emissions with robust uncertainty estimates. We tested a conventional method (marginal distribution sampling) and four machine learning algorithms - penalized linear regression, artificial neural networks, random forests, and boosted decision trees - and four predictor sets, including temporal, meteorological, ecosystem carbon and energy flux, and soil predictors. We find that the conventional method can achieve similar median performance to the machine learning models but is worse than the best machine learning models and relatively insensitive to predictor choices. Of the machine learning models, decision tree algorithms performed the best in cross-validation experiments, even with a baseline predictor set, and artificial neural networks showed comparable performance when using all predictors. Soil temperature was frequently the most important predictor whilst water table depth was important at sites with substantial water table fluctuations, highlighting the value of data on soil conditions. Raw gap-filling uncertainties from the machine learning models were underestimated and we propose a method to calibrate uncertainties to observations. Finally, we gap-fill and provide summary evaluation metrics for all 81 sites in the FLUXNET-CH4 community dataset and publicly release the python code for model development, evaluation, and uncertainty estimation.

42 ENGINEERING↗
DOE OSTI2026

Protocol for applying a network-enabled gene discovery pipeline to non-model plant species

Identifying upstream regulators of key genes is essential for understanding gene regulatory mechanisms and translating these insights into functional targets. Here, we present a protocol for applying the network-enabled gene discovery pipeline (NEEDLE) to non-model plant species. We describe steps for environment setup, data preparation, computational analysis, expected outputs, and parameter considerations. NEEDLE integrates RNA sequencing (RNA-seq) processing, weighted gene co-expression analysis (WGCNA), Gene Network Inference with Ensemble of trees (GENIE3), and promoter conservation analysis to prioritize candidate transcriptional regulators.

Plant Sciences↗
DOE OSTI2023

A species’ response to spatial climatic variation does not predict its response to climate change

The dominant paradigm for assessing ecological responses to climate change assumes that future states of individuals and populations can be predicted by current, species-wide performance variation across spatial climatic gradients. However, if the fates of ecological systems are better predicted by past responses to in situ climatic variation through time, this current analytical paradigm may be severely misleading. Empirically testing whether spatial or temporal climate responses better predict how species respond to climate change has been elusive, largely due to restrictive data requirements. Here, we leverage a newly collected network of ponderosa pine tree-ring time series to test whether statistically inferred responses to spatial versus temporal climatic variation better predict how trees have responded to recent climate change. When compared to observed tree growth responses to climate change since 1980, predictions derived from spatial climatic variation were wrong in both magnitude and direction. This was not the case for predictions derived from climatic variation through time, which were able to replicate observed responses well. Future climate scenarios through the end of the 21st century exacerbated these disparities. These results suggest that the currently dominant paradigm of forecasting the ecological impacts of climate change based on spatial climatic variation may be severely misleading over decadal to centennial timescales.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Investigating resource-efficient neutron/gamma classification ML models targeting eFPGAs

There has been considerable interest and resulting progress in implementing machine learning (ML) models in hardware over the last several years from the particle and nuclear physics communities. A big driver has been the release of the Python package, hls4ml, which has enabled porting models specified and trained using Python ML libraries to register transfer level (RTL) code. So far, the primary end targets have been commercial field-programmable gate arrays (FPGAs) or synthesized custom blocks on application specific integrated circuits (ASICs). However, recent developments in open-source embedded FPGA (eFPGA) frameworks now provide an alternate, more flexible pathway for implementing ML models in hardware. These customized eFPGA fabrics can be integrated as part of an overall chip design. In general, the decision between a fully custom, eFPGA, or commercial FPGA ML implementation will depend on the details of the end-use application. In this work, we explored the parameter space for eFPGA implementations of fully-connected neural network (fcNN) and boosted decision tree (BDT) models using the task of neutron/gamma classification with a specific focus on resource efficiency. We used data collected using an AmBe sealed source incident on Stilbene, which was optically coupled to an OnSemi J-series silicon photomultiplier (SiPM) to generate training and test data for this study. We investigated relevant input features and the effects of bit-resolution and sampling rate as well as trade-offs in hyperparameters for both ML architectures while tracking total resource usage. The performance metric used to track model performance was the calculated neutron efficiency at a gamma leakage of 10 -3 . The results of the study will be used to aid the specification of an eFPGA fabric, which will be integrated as part of a test chip.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Progress Toward the First Search for Bound Neutron Oscillation into Antineutron in a Liquid Argon TPC

This note presents current progress for a neutron-antineutron oscillation ($n–\overline{n}$) search in MicroBooNE paving the way for the first search analysis of such process in a Liquid Argon Time Projection Chamber (LArTPC). Convolutional Neural Network (CNN) and Boosted Decision Tree (BDT) algorithms were used to select signal $n–\overline{n}$ events over cosmogenic backgrounds. The CNN-only, BDT-only, and the combined (CNN+BDT) methods were demonstrated on the Monte-Carlo signal and background events. Validation of the CNNonly and the BDT-only methods was carried out on a small dataset of MicroBooNE Run1 off-beam data, setting the starting point toward further improvement of the analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Overview of Algorithms for Using Particle Morphology in Pre-Detonation Nuclear Forensics

A major goal in pre-detonation nuclear forensics is to infer the processing conditions and/or facility type that produced radiological material. This review paper focuses on analyses of particle size, shape, texture (“morphology”) signatures that could provide information on the provenance of interdicted materials. For example, uranium ore concentrates (UOC or yellowcake) include ammonium diuranate (ADU), ammonium uranyl carbonate (AUC), sodium diuranate (SDU), magnesium diuranate (MDU), and others, each prepared using different salts to precipitate U from solution. Once precipitated, UOCs are often dried and calcined to remove adsorbed water. The products can be allowed to react further, forming uranium oxides UO3, U3O8, or UO2 powders, whose surface morphology can be indicative of precipitation and/or calcination conditions used in their production. This review paper describes statistical issues and approaches in using quantitative analyses of measurements such as particle size and shape to infer production conditions. Statistical topics include multivariate t tests (Hotelling’s T 2 ), design of experiments, and several machine learning (ML) options including decision trees, learning vector quantization neural networks, mixture discriminant analysis, and approximate Bayesian computation (ABC). ABC is emphasized as an attractive option to include the effects of model uncertainty in the selected and fitted forward model used for inferring processing conditions.

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

Classification of Intensity Distributions of Transmission Eigenchannels of Disordered Nanophotonic Structures Using Machine Learning

Light-matter interaction optimization in complex nanophotonic structures is a critical step towards the tailored performance of photonic devices. The increasing complexity of such systems requires new optimization strategies beyond intuitive methods. For example, in disordered photonic structures, the spatial distribution of energy densities has large random fluctuations due to the interference of multiply scattered electromagnetic waves, even though the statistically averaged spatial profiles of the transmission eigenchannels are universal. Classification of these eigenchannels for a single configuration based on visualization of intensity distributions is difficult. However, successful classification could provide vital information about disordered nanophotonic structures. Emerging methods in machine learning have enabled new investigations into optimized photonic structures. In this work, we combine intensity distributions of the transmission eigenchannels and the transmitted speckle-like intensity patterns to classify the eigenchannels of a single configuration of disordered photonic structures using machine learning techniques. Specifically, we leverage supervised learning methods, such as decision trees and fully connected neural networks, to achieve classification of these transmission eigenchannels based on their intensity distributions with an accuracy greater than 99%, even with a dataset including photonic devices of various disorder strengths. Simultaneous classification of the transmission eigenchannels and the relative disorder strength of the nanophotonic structure is also possible. Our results open new directions for machine learning assisted speckle-based metrology and demonstrate a novel approach to classifying nanophotonic structures based on their electromagnetic field distributions. These insights can be of paramount importance for optimizing light-matter interactions at the nanoscale.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Machine Learning-Based Regression Models for Ironmaking Blast Furnace Automation

Computational fluid dynamics (CFD)-based simulation has been the traditional way to model complex industrial systems and processes. One very large and complex industrial system that has benefited from CFD-based simulations is the steel blast furnace system. The problem with the CFD-based simulation approach is that it tends to be very slow for generating data. The CFD-only approach may not be fast enough for use in real-time decisionmaking. To address this issue, in this work, the authors propose the use of machine learning techniques to train and test models based on data generated via CFD simulation. Regression models based on neural networks are compared with tree-boosting models. In particular, several areas (tuyere, raceway, and shaft) of the blast furnace are modeled using these approaches. The results of the model training and testing are presented and discussed. The obtained R 2 metrics are, in general, very high. The results appear promising and may help to improve the efficiency of operator and process engineer decisionmaking when running a blast furnace.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Searching for Clues for a Matter Dominated Universe in Liquid Argon Time Projection Chambers

Liquid Argon Time Projection Chambers (LArTPCs) represent one of the most widely utilized neutrino detection techniques in neutrino experiments, for instance, in the Short Baseline Neutrino (SBN) program and the future large-scale LArTPC: Deep Underground Neutrino Experiment (DUNE). The high-end technique, facilitating excellent spatial and calorimetric reconstruction resolution, also enables testing exotic Beyond Standard Model (BSM) theories, such as baryon number violation (BNV) processes (e.g., proton-decay, neutron-antineutron oscillation). At the same time, Machine Learning (ML) techniques have demonstrated their ubiquitous use in recent decades; ML techniques have also become some of the most powerful tools in high-energy physics (HEP) analyses. Furthermore, the development of algorithms to cater to the needs of problems in HEP (i.e., triggering, reconstruction, improving sensitivity, etc.) has also become an active area of research. By developing a combined approach using Convolutional Neural Network (CNN) and Boosted Decision Tree (BDT) techniques, the sensitivity of neutron-antineutron oscillation in DUNE is evaluated for a projected exposure of 400kton·years. Additionally, to meet the triggering requirement to select such rare events in DUNE, such a search is only supported with highly efficient self-triggering algorithms. An ML-based self-triggering scheme for large-scale LArTPCs, such as DUNE, is also developed with the intention of implementation on field-programmable gate arrays (FPGAs). The ML-based approach for searching for neutron-antineutron oscillation can be demonstrated and validated on the current LArTPC MicroBooNE. The analysis in MicroBooNE represents the first-ever search for neutron-antineutron oscillation in a LArTPC. DUNE's projected 90% C.L. sensitivity to the neutron antineutron oscillation lifetime is 6.45×10³² years, assuming 1.327×10³⁵ neutron·years, equivalent to 10 years of DUNE far detector exposure (400kton·years). For MicroBooNE, assuming 372 seconds of exposure (equivalent to 3.13×10³⁶ neutron·years), the 90% C.L. lifetime sensitivity is found at 3.07×10²⁵ yrs, after accounting for Monte-Carlo statistical uncertainty and systematic uncertainty from detector effects.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS2014

Hindlimb Suspension as a Model to Study Ophthalmic Complications in Microgravity Status Report: Optimization of Rat Retina Flat Mounts Staining to Study Vascular Remodeling

Preliminary data from a prior tissue‐sharing experiment has suggested that early growth response protein‐1 (Egr1), a transcription factor involved in various stress responses in the vasculature, is induced in the rat retina after 14 days of hindlimb suspension (HS) and may be evidence that mechanical stress is occurring secondary to the cephalad fluid shift. This mechanical stress could cause changes in oxygenation of the retina, and the subsequent ischemia‐ or inflammation‐driven hypoxia may lead to microvascular remodeling. This microvascular remodeling process can be studied using image analysis of retinal vessels and can be then be quantified by the VESsel GENeration Analysis (VESGEN) software, a computational tool that quantifies remodeling patterns of branching vascular trees and capillary or vasculogenic networks. Our project investigates whether rodent HS is a valid model to study the effects of simulated‐weightlessness on ocular structures and their relationship with intracranial pressure (ICP). One of the hypotheses to be tested is that HS‐induced cephalad fluid shift is accompanied by vascular engorgement that produces changes in retinal oxygenation, leading to oxidative stress, hypoxia, microvascular remodeling, and cellular degeneration. We have optimized the procedure to obtain flat mounts of rat retina, staining of the endothelial lining in vasculature and acquisition of high quality images suitable for VESGEN analysis. Briefly, eyes were fixed in 4% paraformaldehyde for 24 hours and retinas were detached and then mounted flat on microscope slides. The microvascular staining was done with endothelial cell‐specific isolectin binding, coupled to Alexa‐488 fluorophore. Image acquisition at low magnification and high resolution was performed using a new Leica SP8 confocal microscope in a tile pattern across the X,Y plane and multiple sections along the Z‐axis. This new confocal microscope has the added capability of dye separation using the Linear Unmixing method and allows us to remove the autofluorescence originating from the photoreceptor layer. In summary, we have an improved method for studying the retinal microvasculature that will provide an increase in the quality of images captured and will be applied throughout the various animal cohorts of the recentlyinitiated study that will evaluate rodent HS as a model to study ophthalmic complications in microgravity.

Theriot, Corey A.↗
DOE OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗