Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high dimension”

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

Deep Eutectic Solvent Assisted Facile Synthesis of Lignin-Based Cryogel

In this study, we reported a method to prepare a lignin based cryogel by cross-linking deep eutectic solvent (DES) extracted lignin and formaldehyde as an alternative to replace resorcinol-formaldehyde (RF) based aerogel. The resulting lignin-formaldehyde cryogel has a highly porous structure (172.8 m2/g surface area) with a high dimension stability. We found that the hydroxyl group and carbonyl group of DES lignin provide reactive sites to cross-link with formaldehyde through electrophilic addition and aldol condensation reaction. We also found that using choline chloridelactic acid (ChCl-Lac) DES as a solvent during the lignin-formaldehyde cryogel formation is critical to prevent the shrinkage of the final cyrogel. The ensuing lignin-formaldehyde cryogel has promising properties such as high thermostability, low thermal conductivity, and good fire retardancy.

Lin, Kuan-Ting↗
DOE OSTI2023

Concordance

Dimension reduction techniques have long been an important topic in statistics, and active subspaces (AS) have received much attention this past decade in the computer experiments literature. The most common approach towards estimating the AS is to use Monte Carlo with numerical gradient evaluation. This software takes a new approach towards estimating the active subspace, in which Multivariate Adaptive Regression Splines (MARS) is used as a surrogate model, and relevant calculation are obtained analytically. Using a MARS surrogate has many advantages including improved scaling, better estimation of active subspaces in high dimensions and the ability to handle a large number of prior distributions in closed form. This software is also capable of conducting a so-called "concordance analysis", using a generalization of ASs which we refer to as "Co-Active" subspaces.

Rumsey, Kelin↗
DOE OSTI2020

We Know Where We Don't Know: 3D Bayesian CNNs for Credible Geometric Uncertainty

Deep learning has been successfully applied to the segmentation of 3D Computed Tomography (CT) scans. Establishing the credibility of these segmentations requires uncertainty quantification (UQ) to identify untrustworthy predictions. Recent UQ architectures include Monte Carlo dropout networks (MCDNs), which approximate deep Gaussian processes, and Bayesian neural networks (BNNs), which learn the distribution of the weight space. BNNs are advantageous over MCDNs for UQ but are thought to be computationally infeasible in high dimension, and neither architecture has produced interpretable geometric uncertainty maps. We propose a novel 3D Bayesian convolutional neural network (BCNN), the first deep learning method which generates statistically credible geometric uncertainty maps and scales for application to 3D data. We present experimental results on CT scans of graphite electrodes and laser-welded metals and show that our BCNN outperforms an MCDN in recent uncertainty metrics. The geometric uncertainty maps generated by our BCNN capture distributions of sigmoid values that are interpretable as confidence intervals, critical for applications that rely on deep learning for high-consequence decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Kronecker-structured covariance models for multiway data

Many applications produce multiway data of exceedingly high dimension. Modeling such multi-way data is important in multichannel signal and video processing where sensors produce multi-indexed data, e.g. over spatial, frequency, and temporal dimensions. We will address the challenges of covariance representation of multiway data and review some of the progress in statistical modeling of multiway covariance over the past two decades, focusing on tensor-valued covariance models and their inference. We will illustrate through a space weather application: predicting the evolution of solar active regions over time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Management of Risk and Uncertainty Through Optimized Co-Operation of Transmission Systems and Microgrids With Responsive Loads (Final Report)

The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Though individual consumers are interconnected at the low-voltage distribution system, these resources are typically modeled as variables at the transmission network level. Demand-side participation cannot be leveraged effectively without explicitly including the distribution system dynamics in the optimization-based wholesale market operations. This project grew from a vision for co-optimized interaction of distribution systems, or microgrids, with the high-voltage transmission system. In this framework, microgrids encompass consumers, distributed renewables and storage. The energy management system of the lower voltage system (distribution or microgrid) can also sell (buy) excess (necessary) energy from the transmission system. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. An ideal microgrid is defined as an electric entity capable of operating in both interconnected (with the high-voltage grid) and islanded mode. As such, the microgrid should incorporate generating units (traditional units and intermittent) and if needed, exchange power with the high-voltage grid. The interplay between the microgrid and high-voltage grid motivated the development of the co-optimization approach to ensure efficient performance of the interconnected network. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Collision-free poisson motion planning in ultra high-dimensional molecular conformation spaces

The function of protein, RNA, and DNA is modulated by fast, dynamic exchanges between three-dimensional conformations. Conformational sampling of biomolecules with exact and nullspace inverse kinematics, using rotatable bonds as revolute joints and noncovalent interactions as holonomic constraints, can accurately characterize these native ensembles. However, sampling biomolecules remains challenging owing to their ultra-high dimensional configuration spaces, and the requirement to avoid (self-) collisions, which results in low acceptance rates. In this paper, we present two novel mechanisms to overcome these limitations. First, we introduce temporary constraints between near-colliding links. The resulting constraint varieties instantaneously redirect the search for collision-free conformations, and couple motions between distant parts of the linkage. Second, we adapt a randomized Poisson-disk motion planner, which prevents local oversampling and widens the search, to ultra-high dimensions. Tests on several model systems show that the sampling acceptance rate can increase from 16% to 70%, and that the conformational coverage in loop modeling measured as average closeness to existing loop conformations doubled. Finally, correlated protein motions identified with our algorithm agree with those from MD simulations.

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

High-dimensional discrete Fourier transform gates with a quantum frequency processor

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as frequency bins. In this article, we show that d -point frequency-bin DFTs can be realized with a fixed three-component quantum frequency processor (QFP), simply by adding to the electro-optic modulation signals one radio-frequency harmonic per each incremental increase in d . We verify gate fidelity F W > 0.9997 and success probability P W > 0.965 up to d = 10 in numerical simulations, and experimentally implement the solution for d = 3, utilizing measurements with parallel DFTs to quantify entanglement and perform tomography of multiple two-photon frequency-bin states. Our results furnish new opportunities for high-dimensional frequency-bin protocols in quantum communications and networking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The Stellar decomposition: A compact representation for simplicial complexes and beyond

Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

MONTI: A Multi-Omics Non-negative Tensor Decomposition Framework for Gene-Level Integrative Analysis

Multi-omics data is frequently measured to enrich the comprehension of biological mechanisms underlying certain phenotypes. However, due to the complex relations and high dimension of multi-omics data, it is difficult to associate omics features to certain biological traits of interest. For example, the clinically valuable breast cancer subtypes are well-defined at the molecular level, but are poorly classified using gene expression data. Here, we propose a multi-omics analysis method called MONTI (Multi-Omics Non-negative Tensor decomposition for Integrative analysis), which goal is to select multi-omics features that are able to represent trait specific characteristics. Here, we demonstrate the strength of multi-omics integrated analysis in terms of cancer subtyping. The multi-omics data are first integrated in a biologically meaningful manner to form a three dimensional tensor, which is then decomposed using a non-negative tensor decomposition method. From the result, MONTI selects highly informative subtype specific multi-omics features. MONTI was applied to three case studies of 597 breast cancer, 314 colon cancer, and 305 stomach cancer cohorts. For all the case studies, we found that the subtype classification accuracy significantly improved when utilizing all available multi-omics data. MONTI was able to detect subtype specific gene sets that showed to be strongly regulated by certain omics, from which correlation between omics types could be inferred. Furthermore, various clinical attributes of nine cancer types were analyzed using MONTI, which showed that some clinical attributes could be well explained using multi-omics data. We demonstrated that integrating multi-omics data in a gene centric manner improves detecting cancer subtype specific features and other clinical features, which may be used to further understand the molecular characteristics of interest. The software and data used in this study are available at: https://github.com/inukj/MONTI.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

HDBind: encoding of molecular structure with hyperdimensional binary representations

Traditional methods for identifying “hit” molecules from a large collection of potential drug-like candidates rely on biophysical theory to compute approximations to the Gibbs free energy of the binding interaction between the drug and its protein target. These approaches have a significant limitation in that they require exceptional computing capabilities for even relatively small collections of molecules. Increasingly large and complex state-of-the-art deep learning approaches have gained popularity with the promise to improve the productivity of drug design, notorious for its numerous failures. However, as deep learning models increase in their size and complexity, their acceleration at the hardware level becomes more challenging. Hyperdimensional Computing (HDC) has recently gained attention in the computer hardware community due to its algorithmic simplicity relative to deep learning approaches. The HDC learning paradigm, which represents data with high-dimension binary vectors, allows the use of low-precision binary vector arithmetic to create models of the data that can be learned without the need for the gradient-based optimization required in many conventional machine learning and deep learning methods. This algorithmic simplicity allows for acceleration in hardware that has been previously demonstrated in a range of application areas (computer vision, bioinformatics, mass spectrometery, remote sensing, edge devices, etc.). To the best of our knowledge, our work is the first to consider HDC for the task of fast and efficient screening of modern drug-like compound libraries. We also propose the first HDC graph-based encoding methods for molecular data, demonstrating consistent and substantial improvement over previous work. We compare our approaches to alternative approaches on the well-studied MoleculeNet dataset and the recently proposed LIT-PCBA dataset derived from high quality PubChem assays. We demonstrate our methods on multiple target hardware platforms, including Graphics Processing Units (GPUs) and Field Programmable Gate Arrays (FPGAs), showing at least an order of magnitude improvement in energy efficiency versus even our smallest neural network baseline model with a single hidden layer. Our work thus motivates further investigation into molecular representation learning to develop ultra-efficient pre-screening tools. We make our code publicly available at https://github.com/LLNL/hdbind.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

A geostatistics-informed hierarchical sensitivity analysis method for complex groundwater flow and transport modeling

Sensitivity analysis is an important tool for development and improvement of mathematical models, especially for complex systems with a high dimension of spatially correlated parameters. Variance-based global sensitivity analysis has gained popularity because it can quantify the relative contribution of uncertainty from different sources. However, its computational cost increases dramatically with the complexity of the considered model and the dimension of model parameters. As such, in this study, we developed a new sensitivity analysis method that integrates the concept of variance-based method with a hierarchical uncertainty quantification framework. Different uncertain inputs are grouped and organized into a multilayer framework based on their characteristics and dependency relationships to reduce the dimensionality of the sensitivity analysis. A set of new sensitivity indices are defined for the grouped inputs using the variance decomposition method. Using this methodology, we identified the most important uncertainty source for a dynamic groundwater flow and solute transport model at the Department of Energy (DOE) Hanford site. The results indicate that boundary conditions and permeability field contribute the most uncertainty to the simulated head field and tracer plume, respectively. The relative contribution from each source varied spatially and temporally. By using a geostatistical approach to reduce the number of realizations needed for the sensitivity analysis, the computational cost of implementing the developed method was reduced to a practically manageable level. The developed sensitivity analysis method is generally applicable to a wide range of hydrologic and environmental problems that deal with high-dimensional spatially distributed input variables.

58 GEOSCIENCES↗
DOE OSTI2023

Extending Parsimonious Bayesian Inference

Parsimonious Bayesian inference is a theoretical framework for efficient data assimilation that seeks to balance increased consistency between predictions and training data against corresponding increases in model complexity. Within this framework, over-training is understood as optimization that encodes excessive information within model parameters while only achieving small improvements between predictions and training data. This project aims to develop practical methods of limiting excess model information during optimization. One key observation is that practical heuristics for parsimonious learning in high-dimensions must balance expressivity, i.e. the ability of the model to capture diverse predictions with only a few non-zero parameters, against discoverability, i.e. the ability to train the model with gradient-based optimization and drive parameters to low information states. As such, we developed logical activation functions that are able to adaptively approximate arbitrary truth tables that define Boolean logic operations within a probabilistic framework. These functions have demonstrated the ability to learn exclusive disjunction (XOR) and conditioned disjunction (if [condition] then [result_if_true] else [result_if_false]) within a single layer of a neural network. To efficiently exploit these activation functions to drive parsimonious learning required several other advances within the domain of variational inference. The most efficient form of complexity suppression is structured sparsification, driving most model parameters to zero while achieving the structural coherence among nonzeros needed for bandwidth reduction. Such models are not only far more efficient at suppressing information-theoretic complexity, they also reduce the other forms of complexity (computations, communication, storage, and the number of dependencies needed to evaluate predictions). Aiming to support enhanced sparsification, this project examined new approaches to high-dimensional variational inference that allow us to calibrate and control parameter uncertainty during optimization. By identifying which parameters can sustain sparsifying perturbations with little impact on prediction quality, we can develop better pruning strategies by framing them as approximate Bayesian inference. These advances also open paths to mitigate concerns with deploying advanced learning methods in resource-constrained environments, such as running models on power-limited or communication-limited devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Exercises in high-dimensional sampling: maximal poisson-disk sampling and k -d darts

In this paper, we review our recent progress on efficient algorithms for generating well-spaced samples of high dimensional data, and for exploring and characterizing these data, the underlying domain, and functions over the domain. To our knowledge, these techniques have not yet been applied to computational topology, but the possible connections are worth considering. In particular, computational topology problems often have difficulty in scaling efficiently, and these sampling techniques have the potential to drastically reduce the size of the data over which these computational topology algorithms must operate. Lastly, we summarize the definition of these sample distributions; algorithms for generating them in low, moderate, and high dimensions; and applications in mesh generation, rendering, motion planning and simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Two loop renormalization of scalar theories using a geometric approach

We derive a general formula for two-loop counterterms in Effective Field Theories (EFTs) using a geometric approach. This formula allows the two-loop results of our previous paper to be applied to a wide range of theories. The two-loop results hold for loop graphs in EFTs where the interaction vertices contain operators of arbitrarily high dimension, but at most two derivatives. We also extend our previous one-loop result to include operators with an arbitrary number of derivatives, as long as there is at most one derivative acting on each field. The final result for the two-loop counterterms is written in terms of geometric quantities such as the Riemann curvature tensor of the scalar manifold and its covariant derivatives. As applications of our results, we give the two-loop counterterms and renormalization group equations for the O(n) EFT to dimension six, the scalar sector of the Standard Model Effective Field Theory (SMEFT) to dimension six, and chiral perturbation theory to order p 6 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Towards exotic matter and discrete non-abelian symmetries in F-theory

We present a prescription in F-theory for realizing matter in “exotic” representations of product gauge groups. For 6D vacua, bifundamental hypermultiplets are engineered by starting at a singular point in moduli space which includes 6D superconformal field theories coupled to gravity. A deformation in Higgs branch moduli space takes us to a weakly coupled gauge theory description. In the corresponding elliptically fibered Calabi-Yau threefold, the minimal Weierstrass model parameters (ƒ, g, Δ) vanish at collisions of the discriminant at least to order (4, 6, 12), but with sufficiently high order of tangency to ensure the existence of T-brane deformations to a weakly coupled gauge theory with exotic bifundamentals. We present explicit examples including bifundamental hypermultiplets of e 7 × su 2 and e 6 × su 3 , each of which have dual heterotic orbifold descriptions. Geometrically, these matter fields are delocalized across multiple points of an F-theory geometry. Symmetry breaking with such representations can be used to produce high dimension representations of simple gauge groups such as the four-index symmetric representation of su 2 and the three-index symmetric representation of su 3 , and after further higgsing can yield discrete non-abelian symmetries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

A new hybrid algorithm combining a new chaos optimization approach with gradient descent for high dimensional optimization problems

Chaos optimization algorithm (COA) is a recently developed method for global optimization based on chaos theory. It has the features of easy implementation, short execution time and robust mechanisms of escaping from local optima compared with the existing stochastic searching algorithm. By integrating the gradient descent method with a new COA approach using new strategies including symmetrization and levelling, a novel hybrid method, called SCGD, is proposed in this paper. The main idea is to combine the good ability of exploitation of the gradient descent with the high ability of exploration of COA. The purpose is to avoid being trapped into local optima and to improve convergence in large space and high-dimension optimization problems. The simulation results based on a set of 50 benchmark functions with diverse properties and different dimensions show the efficiency and the abilities of the proposed method in finding the global optima compared with the existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Some aspects of the five-dimensional Lovelock black hole spacetime: Strong homotopy retract, perihelion precession and quasistationary levels

Highlights: • Some topological aspects are explored. • The perihelion precession is calculated. • The general Heun functions are applied to obtain analytical solutions. • The quasibound states and the radial wave eigenfunctions are obtained. In this work we explore some mathematical physics aspects of the spherically symmetric Lovelock black hole in high dimensions. Intended for this aim, we thoroughly consider the metric corresponding to the five-dimensional Lovelock black hole spacetime. We construct the strong retractions by the geodesic equations on the background under consideration. As a result, from the topological point of view, we construct the theory of strong homotopy retract, which will allow us, in principle, to better understand some of its suitable applications on astrophysics and cosmology, in particular, in the analysis of the spacetime singularities. We find the solutions of the equation of motion for both radial and angular coordinates, and then we describe the outer (“exterior”) and lower (“interior”) apparent horizons. Indeed, the outer apparent horizon is the last surface from which the light waves could still escape from the black hole. Thus, it is meaningful to analyze some physical phenomena related to quantum particles propagating outside the exterior apparent horizon, in particular, we discuss the quasistationary levels of scalar fields and their radial wave functions, which are given in terms of the general Heun functions. We also calculate the perihelion precession in this background.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗