Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “High dimensional data,”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

High-dimensional methods for quantum homodyne tomography

We provide optimized recursion relations for homodyne tomography. We improve previous methods by mitigating the divergences intrinsic in the calculation of the pattern functions used previously, and detail how to implement the data analysis through Monte Carlo simulations. Our refinements are necessary for the reconstruction of excited quantum states which populate a high-dimensional subspace of the electromagnetic field Hilbert space. •Stabilization of numerics for quantum homodyne tomography reconstructions.•High dimensional quantum homodyne tomography reconstruction.•Monte Carlo simulations of quantum homodyne tomography.•Quantum Homodyne tomography simulations.

Mosco, Nicola↗
DOE OSTI2022

Trajectory design via unsupervised probabilistic learning on optimal manifolds

Abstract This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.

42 ENGINEERING↗
DOE OSTI2021

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A novel transfer learning framework for sorghum biomass prediction using UAV-based remote sensing data and genetic markers

Yield for biofuel crops is measured in terms of biomass, so measurements throughout the growing season are crucial in breeding programs, yet traditionally time- and labor-consuming since they involve destructive sampling. Modern remote sensing platforms, such as unmanned aerial vehicles (UAVs), can carry multiple sensors and collect numerous phenotypic traits with efficient, non-invasive field surveys. However, modeling the complex relationships between the observed phenotypic traits and biomass remains a challenging task, as the ground reference data are very limited for each genotype in the breeding experiment. In this study, a Long Short-Term Memory (LSTM) based Recurrent Neural Network (RNN) model is proposed for sorghum biomass prediction. The architecture is designed to exploit the time series remote sensing and weather data, as well as static genotypic information. As a large number of features have been derived from the remote sensing data, feature importance analysis is conducted to identify and remove redundant features. A strategy to extract representative information from high-dimensional genetic markers is proposed. To enhance generalization and minimize the need for ground reference data, transfer learning strategies are proposed for selecting the most informative training samples from the target domain. Consequently, a pre-trained model can be refined with limited training samples. Field experiments were conducted over a sorghum breeding trial planted in multiple years with more than 600 testcross hybrids. The results show that the proposed LSTM-based RNN model can achieve high accuracies for single year prediction. Further, with the proposed transfer learning strategies, a pre-trained model can be refined with limited training samples from the target domain and predict biomass with an accuracy comparable to that from a trained-from-scratch model for both multiple experiments within a given year and across multiple years.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Landscaper v1

Understanding the inner workings of machine learning models through their loss landscapes offers crucial insights into model properties, optimization dynamics, and generalizability. However, accessing these insights has traditionally required specialized mathematical expertise, limiting broader adoption. Landscaper is an open-source Python package designed to bridge this gap. Landscaper seamlessly integrates a suite of multi-dimensional loss landscape analyses with cutting-edge topological data analysis (TDA) methods. This powerful combination makes both fundamental loss landscape analysis and advanced TDA techniques accessible to the broader scientific ML community, without requiring deep pre-existing mathematical knowledge. Landscaper offers three key functionalities: * Construction: Builds detailed loss landscape representations through versatile low and high-dimensional sampling techniques. * Quantification: Applies advanced metrics, including a novel topological data analysis (TDA) based smoothness metric, enabling new perspectives on model behavior. * Visualization: Offers intuitive tools to visualize and interpret loss landscapes, providing actionable insights beyond traditional performance metrics.

Weber, Gunther [Lawrence Berkeley National Laborat↗
DOE OSTI2025

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗
DOE OSTI2015

Foundational Principles for Large-Scale Inference: Illustrations Through Correlation Mining

When can reliable inference be drawn in the ‘‘Big Data’’ context? This article presents a framework for answering this fundamental question in the context of correlation mining, with implications for general large-scale inference. In large-scale data applications like genomics, connectomics, and eco-informatics, the data set is often variable rich but sample starved: a regime where the number n of acquired samples (statistical replicates) is far fewer than the number p of observed variables (genes, neurons, voxels, or chemical constituents). Much of recent work has focused on understanding the computational complexity of proposed methods for ‘‘Big Data.’’ Sample complexity, however, has received relatively less attention, especially in the setting when the sample size n is fixed, and the dimension p grows without bound. To address this gap, we develop a unified statistical framework that explicitly quantifies the sample complexity of various inferential tasks. Sampling regimes can be divided into several categories: 1) the classical asymptotic regime where the variable dimension is fixed and the sample size goes to infinity; 2) the mixed asymptotic regime where both variable dimension and sample size go to infinity at comparable rates; and 3) the purely high-dimensional asymptotic regime where the variable dimension goes to infinity and the sample size is fixed. Each regime has its niche but only the latter regime applies to exa-scale data dimension. We illustrate this high-dimensional framework for the problem of correlation mining, where it is the matrix of pairwise and partial correlations among the variables that are of interest. Correlation mining arises in numerous applications and subsumes the regression context as a special case. We demonstrate various regimes of correlation mining based on the unifying perspective of high-dimensional learning rates and sample complexity for different structured covariance models and different inference tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Optimal dimensionality selection for independent component analysis of transcriptomic data

Independent component analysis is an unsupervised machine learning algorithm that separates a set of mixed signals into a set of statistically independent source signals. Applied to high-quality gene expression datasets, independent component analysis effectively reveals both the source signals of the transcriptome as co-regulated gene sets, and the activity levels of the underlying regulators across diverse experimental conditions. Two major variables that affect the final gene sets are the diversity of the expression profiles contained in the underlying data, and the user-defined number of independent components, or dimensionality, to compute. Availability of high-quality transcriptomic datasets has grown exponentially as high-throughput technologies have advanced; however, optimal dimensionality selection remains an open question. We computed independent components across a range of dimensionalities for four gene expression datasets with varying dimensions (both in terms of number of genes and number of samples). We computed the correlation between independent components across different dimensionalities to understand how the overall structure evolves as the number of user-defined components increases. We then measured how well the resulting gene clusters reflected known regulatory mechanisms, and developed a set of metrics to assess the accuracy of the decomposition at a given dimension. We found that over-decomposition results in many independent components dominated by a single gene, whereas under-decomposition results in independent components that poorly capture the known regulatory structure. From these results, we developed a new method, called OptICA, for finding the optimal dimensionality that controls for both over- and under-decomposition. Specifically, OptICA selects the highest dimension that produces a low number of components that are dominated by a single gene. We show that OptICA outperforms two previously proposed methods for selecting the number of independent components across four transcriptomic databases of varying sizes. OptICA avoids both over-decomposition and under-decomposition of transcriptomic datasets resulting in the best representation of the organism’s underlying transcriptional regulatory network.

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

Linear Discriminant Analysis-Based Machine Learning and All-Atom Molecular Dynamics Simulations for Probing Electro-Osmotic Transport in Cationic-Polyelectrolyte-Brush-Grafted Nanochannels

Deciphering the correct mechanisms governing certain phenomena in polyelectrolyte (PE) brush grafted systems, revealed through atomistic simulations, is an extremely challenging problem. In a recent study, our all-atom molecular dynamics (MD) simulations revealed a non-linearly large electroosmotic (EOS) flow (in the presence of an applied electric field) in nanochannels grafted with PMETAC [Poly(2-(methacryloyloxy)ethyl trimethylammonium chloride] brushes. Given the lack of any formal procedure that would have directed us to identify the correct factors responsible for such an occurrence, we needed to spend several months and devote significant analyses to unravel the involved mechanisms. In this paper, we propose a Linear Discriminant Analysis (LDA) based Machine Learning (ML) approach to address this gap. At first, we obtain data on certain basic features from the all-atom MD data. These basic features represent the number of atoms of certain species around one atom of another (or same) species. Here, we obtain such data on basic features for a reference case (case of an EOS flow in PMETAC-brush-grafted nanochannels with a smaller electric field) and a perturbed case (case of an EOS flow in PMETAC-brush-grafted nanochannels with a larger electric field) in bins in which the nanochannel half height has been divided into. These datasets are high-dimensional dataset, to which the LDA is applied. This leads to the projection of the data (between the reference and the perturbed states) in a highly separated form on a 1D line. From such LDA calculations, we are able to identify the relative importance of the different basic features in ensuring this separation of the data (between the reference and the perturbed states) on the 1D line. This relative importance of the different basic features is quantified as “importance scores” for the different features, which in turn tell us what to study and where to study. Such knowledge enables us to rapidly identify the key factors responsible for the non-linearly large EOS transport in PMETAC-brush-grafted nanochannels.

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

O’Hare Airport Short-Term Ground Transportation Modal Demand Forecast Using Gaussian Processes

Here, the principal objective of this study is to analyze the spatial and temporal variation of ground transportation airport demand and provide demand forecast to inform planning capability and explore alternatives for investments to accommodate airport growth. Because of its good adaptability and strong generalization ability for dealing with high-dimensional input, small-sample, and nonlinear spatial data, Gaussian process (GP) regression is used to provide forecast estimates using data from transportation network company (TNC) trips and urban rail passengers at Chicago's O'Hare International Airport. TNC airport trips differ significantly, with three times more distance, more than twice the travel time, and half of the share requests compared with nonairport trips. This highlights the need for separate demand models. Hourly analysis of the rail service indicates that this is likely heavily used by airport workers, whereas TNC services focus on travelers because of variations in the peak demand hours. Heteroscedastic GP regression is implemented because of differences in trip variance between night and day hours. Estimates are given for weekdays and weekend trips, and the 95% confidence intervals are calculated. The introduction of flight schedule information into the models shows marginal improvements in their performance. However, fitting a GP regression becomes computationally expensive with increased sample size and the introduction of spatial components. Transportation planners and policymakers can use the results and methods implemented in this study to optimize transportation assets and provide long-range simulations of the current and future conditions in the area.

42 ENGINEERING↗
DOE OSTI2025

An implementation of neural simulation-based inference for parameter estimation in ATLAS

Neural simulation-based inference (NSBI) is a powerful class of machine-learning-based methods for statistical inference that naturally handles high-dimensional parameter estimation without the need to bin data into low-dimensional summary histograms. Such methods are promising for a range of measurements, including at the Large Hadron Collider, where no single observable may be optimal to scan over the entire theoretical phase space under consideration, or where binning data into histograms could result in a loss of sensitivity. This work develops a NSBI framework for statistical inference, using neural networks to estimate probability density ratios, which enables the application to a full-scale analysis. It incorporates a large number of systematic uncertainties, quantifies the uncertainty due to the finite number of events in training samples, develops a method to construct confidence intervals, and demonstrates a series of intermediate diagnostic checks that can be performed to validate the robustness of the method. As an example, the power and feasibility of the method are assessed on simulated data for a simplified version of an off-shell Higgs boson couplings measurement in the four-lepton final states. This approach represents an extension to the standard statistical methodology used by the experiments at the Large Hadron Collider, and can benefit many physics analyses.

frequentist statistics↗
DOE OSTI2020

High-dimensional and high-resolution x-ray tomography for energy materials science

At the forefront of developments in synchrotron x-ray microscopy, we report nanoscale-resolution high-dimensional spectrotomography under controlled sample environments has been demonstrated. Such cutting-edge experimental capability has been broadly applied to scientific studies in the field of energy materials science, where the dynamically evolving structural and chemical defects play a vital role in the functionality. In this article, we review novel developments of this technique from both experimental and data/information mining perspectives. Using studies on lithium-ion battery electrode materials as examples, we highlight the rich information in the high-dimensional and high-resolution x-ray tomographic data, which can be used to interpret the complicated thermal-electro-chemo-mechanical interplay that occurs under the operating conditions and collectively determines battery performance. We also discuss the frontier challenges in this field and our perspectives of the future directions in the context of projected major developments in the landscape of largescale x-ray facilities across the globe.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Molten Salt Reactor Experiment Benchmark Evaluation

As one of the six advanced reactor concepts selected by the 2002 Generation IV roadmap as a technology meriting future research, Molten Salt Reactors (MSRs) attracted broad attention and multiple private and public entities are working towards its commercialization. Facing stringent regulatory requirements, validations of computational codes used to calculate and prove the safety characteristics of MSRs play a key role. This project developed the world-first, MSR-related reactor physics benchmark based on a series of zero-power experiments conducted at the Molten Salt Reactor Experiment (MSRE). The benchmark was successfully reviewed by the International Reactor Physics Experiment Evaluation Project (IRPhEP) committee and is available in the IRPhEP handbook starting form the 2019 edition. To benchmark experimental data from the MSRE, a three-dimensional high-fidelity model was developed using the Monte Carlo neutron transport code Serpent 2 and ad-hoc methods have been implemented to account for the unique feature of fuel salt motion. The calculated effective multiplication factor, k eff , for the first criticality experiment, when 235 U was progressively added to the fuel salt in order to achieve criticality with stationary salt and isothermal conditions, was 1.02132 (±3 pcm). The total uncertainty for experimental k eff was estimated to be 420 pcm. The calculated k eff is 2.154% larger than the experimental and benchmark model value, which is approximately five times the benchmark model uncertainty. It is to be noted that, for systems containing large volume of graphite (or other carbonaceous materials), Monte Carlo codes tend to overestimate the keff of the benchmark model by 1% to 2%. The bias is possibly due to uncertainties in the impurity content of the graphite blocks, uncertainty in the neutron capture cross section of carbon or uncertainty in the properties of nuclear-grade graphite. The calculated reactivity coefficient of 235 U concentration (0.2228 ± 0.0014, represented as the change of reactivity over the relative change of 235 U mass in loop) matches well with the experimental value (0.223 ± 0.006), strengthening the confidence on the accurate representation of the fuel salt composition in the MSRE benchmark. Additional reactivity effect calculations, including the control rod bank worth, reactivity effects of fuel circulation and isothermal and fuel temperature coefficients show good agreement with the experimental values (within 1σ) as well.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Sketching Algorithms in Distributed Systems

In this position paper, we discuss exciting recent advancements in sketching algorithms applied to distributed systems. That is, we look at randomized algorithms that simultaneously reduce the data dimensionality, offer potential privacy benefits, while maintaining verifiably high levels of algorithm accuracy and performance in multi-node computational setups. We look at next steps and discuss the applicability to real systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

A method for classification of multisource data using interval-valued probabilities and its application to HIRIS data

A method of classifying multisource data in remote sensing is presented. The proposed method considers each data source as an information source providing a body of evidence, represents statistical evidence by interval-valued probabilities, and uses Dempster's rule to integrate information based on multiple data source. The method is applied to the problems of ground-cover classification of multispectral data combined with digital terrain data such as elevation, slope, and aspect. Then this method is applied to simulated 201-band High Resolution Imaging Spectrometer (HIRIS) data by dividing the dimensionally huge data source into smaller and more manageable pieces based on the global statistical correlation information. It produces higher classification accuracy than the Maximum Likelihood (ML) classification method when the Hughes phenomenon is apparent.

Kim, H.↗
NASA NTRS1990

A method for classification of multisource data using interval-valued probabilities and its application to HIRIS data

A method of classifying multisource data in remote sensing is presented. The proposed method considers each data source as an information source providing a body of evidence, represents statistical evidence by interval-valued probabilities, and uses Dempster's rule to integrate information based on multiple data sources. The method is applied to the problems of ground-cover classification of multispectral data combined with digital terrain data such as elevation, slope, and aspect. Then this method is applied to simulated 201-band High Resolution Imaging Spectrometer (HIRIS) data by dividing the dimensionally huge data source into smaller and more manageable pieces based on the global statistical correlation information. It produces higher classification accuracy than the Maximum Likelihood (ML) classification method when the Hughes phenomenon is apparent.

Kim, H.↗
NASA NTRS1990

The ER-2 meteorological measurement system

The objectives of ER-2 Meteorological Measurement System (MMS) are: (1) to measure the meteorological parameters (pressure, temperature, and the three dimensional wind vector) accurately; (2) to provide high resolution data on atmospheric state variables and aircraft flight track to ER-2 investigators on a timely basis; and (3) to conduct collaborative research in atmospheric dynamics and chemistry. A summary of progress and results are presented.

Chan, K. Roland↗
NASA NTRS1992

Three-dimensional numerical simulation of the 20 June 1991, Orlando microburst

On 20 June 1991, NASA's Boeing 737, equipped with in-situ and look-ahead wind-shear detection systems, made direct low-level penetrations (300-350 m AGL) through a microburst during several stages of its evolution. This microburst was located roughly 20 km northeast of Orlando International Airport and was monitored by a Terminal Doppler Weather Radar (TDWR) located about 10 km south of the airport. The first NASA encounter with this microburst (Event 142), at approximately 2041 UTC, was during its intensification phase. At flight level, in-situ measurements indicated a peak 1-km (averaged) F-factor of approximately 0.1. The second NASA encounter (Event 143) occurred at approximately 2046 UTC, about the time of microburst peak intensity. It was during this penetration that a peak 1-km F-factor of approximately 17 was encountered, which was the largest in-situ measurement of the 1991 summer deployment. By the third encounter (Event 144), at approximately 2051 UTC, the microburst had expanded into a macroburst. During this phase of evolution, an in-situ 1-km F-factor of 0.08 was measured. The focus of this paper is to examine this microburst via numerical simulation from an unsteady, three-dimensional meteorological cloud model. The simulated high-resolution data fields of wind, temperature, radar reflectivity factor, and precipitation are closely examined so as to derive information not readily available from 'observations' and to enhance our understanding of the actual event. Characteristics of the simulated microburst evolution are compared with TDWR and in-situ measurements.

Proctor, Fred H.↗