Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics computing”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Detecting hidden layers from spreading dynamics on complex networks

When dealing with spreading processes on networks it can be of the utmost importance to test the reliability of data and identify potential unobserved spreading paths. In this paper we address these problems and propose methods for hidden layer identification and reconstruction. We also explore the interplay between difficulty of the task and the structure of the multilayer network describing the whole system where the spreading process occurs. Our methods stem from an exact expression for the likelihood of a cascade in the susceptible-infected model on an arbitrary graph. We then show that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Furthermore, we conduct our analyses on both synthetic and real-world networks providing evidence for the viability of the approach presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

HYPPO: A Surrogate-Based Multi-Level Parallelism Tool for Hyperparameter Optimization

We present a new software, HYPPO, that enables the automatic tuning of hyperparameters of various deep learning (DL) models. Unlike other hyperparameter optimization (HPO) methods, HYPPO uses adaptive surrogate models and directly accounts for uncertainty in model predictions to find accurate and reliable models that make robust predictions. Using asynchronous nested parallelism, we are able to significantly alleviate the computational burden of training complex architectures and quantifying the uncertainty. HYPPO is implemented in Python and can be used with both TensorFlow and PyTorch libraries. We demonstrate various software features on time-series prediction and image classification problems as well as a scientific application in computed tomography image reconstruction. Finally, we show that (1) we can reduce by an order of magnitude the number of evaluations necessary to find the most optimal region in the hyperparameter space and (2) we can reduce by two orders of magnitude the throughput for such HPO process to complete.

adaptation models↗
DOE OSTI2022

Numerical Solution of the Steady-State Network Flow Equations for a Non-Ideal Gas

Herein we formulate a steady-state network flow problem for non-ideal gas that relates injection rates and nodal pressures in the network to flows in pipes. For this problem, we present and prove a theorem on uniqueness of generalized solution for a broad class of non-ideal pressure-density relations that satisfy a monotonicity property. Further, we develop a Newton-Raphson algorithm for numerical solution of the steady-state problem, which is made possible by a systematic non-dimensionalization of the equations. The developed algorithm has been extensively tested on benchmark instances and shown to converge robustly to a generalized solution. Previous results [1]-[4], indicate that the steady-state network flow equations for an ideal gas are difficult to solve by the Newton-Raphson method because of its extreme sensitivity to the initial guess. In contrast, we find that non-dimensionalization of the steady-state problem is key to robust convergence of the Newton-Raphson method. We identify criteria based on the uniqueness of solutions under which the existence of a non-physical generalized solution found by a non-linear solver implies non-existence of a physical solution, i.e., infeasibility of the problem. Finally, we compare pressure and flow solutions based on ideal and non-ideal equations of state to demonstrate the need to apply the latter in practice. The solver developed in this article is open-source and is made available for both the academic and research communities as well as the industry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗
DOE OSTI2026

New Time Integrators and Capabilities in SUNDIALS Versions 6.2.0-7.4.0

SUNDIALS is a well-established numerical library that provides robust and efficient time integrators and nonlinear solvers. This article overviews several significant improvements and new features added over the last 3 years to support scientific simulations run on high-performance computing systems. Notably, three new classes of one-step methods have been implemented: low storage Runge–Kutta, symplectic partitioned Runge–Kutta, and operator splitting. In addition, we describe new timestep adaptivity support for multirate methods, adjoint sensitivity analysis capabilities for explicit Runge–Kutta methods, additional options for Anderson acceleration in nonlinear solvers, and improved error handling and logging.

Computer science↗
DOE OSTI2026

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗
DOE OSTI2023

Structure-informed clustering for population stratification in association studies

Background: Identifying variants associated with complex traits is a challenging task in genetic association studies due to linkage disequilibrium (LD) between genetic variants and population stratification, unrelated to the disease risk. Existing methods of population structure correction use principal component analysis or linear mixed models with a random effect when modeling associations between a trait of interest and genetic markers. However, due to stringent significance thresholds and latent interactions between the markers, these methods often fail to detect genuinely associated variants. Results: To overcome this, we propose CluStrat, which corrects for complex arbitrarily structured populations while leveraging the linkage disequilibrium induced distances between genetic markers. It performs an agglomerative hierarchical clustering using the Mahalanobis distance covariance matrix of the markers. In simulation studies, we show that our method outperforms existing methods in detecting true causal variants. Applying CluStrat on WTCCC2 and UK Biobank cohorts, we found biologically relevant associations in Schizophrenia and Myocardial Infarction. CluStrat was also able to correct for population structure in polygenic adaptation of height in Europeans. Conclusions: CluStrat highlights the advantages of biologically relevant distance metrics, such as the Mahalanobis distance, which captures the cryptic interactions within populations in the presence of LD better than the Euclidean distance.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Flux balance analysis of the ammonia-oxidizing bacterium Nitrosomonas europaea ATCC19718 unravels specific metabolic activities while degrading toxic compounds

The ammonia-oxidizing bacterium Nitrosomonas europaea has been widely recognized as an important player in the nitrogen cycle as well as one of the most abundant members in microbial communities for the treatment of industrial or sewage wastewater. Its natural metabolic versatility and extraordinary ability to degrade environmental pollutants (e.g., aromatic hydrocarbons such as benzene and toluene) enable it to thrive under various harsh environmental conditions. Constraint-based metabolic models constructed from genome sequences enable quantitative insight into the central and specialized metabolism within a target organism. These genome-scale models have been utilized to understand, optimize, and design new strategies for improved bioprocesses. Reduced modeling approaches have been used to elucidate Nitrosomonas europaea metabolism at a pathway level. However, genome-scale knowledge about the simultaneous oxidation of ammonia and pollutant metabolism of N . europaea remains limited. Here, we describe the reconstruction, manual curation, and validation of the genome-scale metabolic model for N . europaea , i GC535. This reconstruction is the most accurate metabolic model for a nitrifying organism to date, reaching an average prediction accuracy of over 90% under several growth conditions. The manually curated model can predict phenotypes under chemolithotrophic and chemolithoorganotrophic conditions while oxidating methane and wastewater pollutants. Calculated flux distributions under different trophic conditions show that several key pathways are affected by the type of carbon source available, including central carbon metabolism and energy production.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Dose optimization of an adjuvanted peptide-based personalized neoantigen melanoma vaccine

The advancements in next-generation sequencing have made it possible to effectively detect somatic mutations, which has led to the development of personalized neoantigen cancer vaccines that are tailored to the unique variants found in a patient’s cancer. These vaccines can provide significant clinical benefit by leveraging the patient’s immune response to eliminate malignant cells. However, determining the optimal vaccine dose for each patient is a challenge due to the heterogeneity of tumors. To address this challenge, we formulate a mathematical dose optimization problem based on a previous mathematical model that encompasses the immune response cascade produced by the vaccine in a patient. We propose an optimization approach to identify the optimal personalized vaccine doses, considering a fixed vaccination schedule, while simultaneously minimizing the overall number of tumor and activated T cells. To validate our approach, we perform in silico experiments on six real-world clinical trial patients with advanced melanoma. We compare the results of applying an optimal vaccine dose to those of a suboptimal dose (the dose used in the clinical trial and its deviations). Our simulations reveal that an optimal vaccine regimen of higher initial doses and lower final doses may lead to a reduction in tumor size for certain patients. Our mathematical dose optimization offers a promising approach to determining an optimal vaccine dose for each patient and improving clinical outcomes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

The genome-scale metabolic model for the purple non-sulfur bacterium Rhodopseudomonas palustris Bis A53 accurately predicts phenotypes under chemoheterotrophic, chemoautotrophic, photoheterotrophic, and photoautotrophic growth conditions

The purple non-sulfur bacterium Rhodopseudomonas palustris is recognized as a critical microorganism in the nitrogen and carbon cycle and one of the most common members in wastewater treatment communities. This bacterium is metabolically extremely versatile. It is capable of heterotrophic growth under aerobic and anaerobic conditions, but also able to grow photoautotrophically as well as mixotrophically. Therefore R . palustris can adapt to multiple environments and establish commensal relationships with other organisms, expressing various enzymes supporting degradation of amino acids, carbohydrates, nucleotides, and complex polymers. Moreover, R . palustris can degrade a wide range of pollutants under anaerobic conditions, e.g., aromatic compounds such as benzoate and caffeate, enabling it to thrive in chemically contaminated environments. However, many metabolic mechanisms employed by R . palustris to breakdown and assimilate different carbon and nitrogen sources under chemoheterotrophic or photoheterotrophic conditions remain unknown. Systems biology approaches, such as metabolic modeling, have been employed extensively to unravel complex mechanisms of metabolism. Previously, metabolic models have been reconstructed to study selected capabilities of R . palustris under limited experimental conditions. Here, we developed a comprehensive metabolic model (M-model) for R . palustris Bis A53 ( i DT1294) consisting of 2,721 reactions, 2,123 metabolites, and comprising 1,294 genes. We validated the model using high-throughput phenotypic, physiological, and kinetic data, testing over 350 growth conditions. i DT1294 achieved a prediction accuracy of 90% for growth with various carbon and nitrogen sources and close to 80% for assimilation of aromatic compounds. Moreover, the M-model accurately predicts dynamic changes of growth and substrate consumption rates over time under nine chemoheterotrophic conditions and demonstrated high precision in predicting metabolic changes between photoheterotrophic and photoautotrophic conditions. This comprehensive M-model will help to elucidate metabolic processes associated with the assimilation of multiple carbon and nitrogen sources, anoxygenic photosynthesis, aromatic compound degradation, as well as production of molecular hydrogen and polyhydroxybutyrate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Role of pore dilation in molecular transport through the nuclear pore complex: Insights from polymer scaling theory

The nuclear pore complex (NPC), a channel within the nuclear envelope filled with intrinsically disordered proteins, regulates the transport of macromolecules between the nucleus and the cytoplasm. Recent studies have highlighted the NPC’s ability to adjust its diameter in response to the membrane tension, underscoring the importance of exploring how variations in pore size influence molecular transport through the NPC. In this study, we investigated the relationship between pore size and transport rate and proposed a mathematical model describing this connection. We began by theoretically analyzing how the pore size scales with the characteristic dimensions of the mesh-like structure within the pore. By introducing key assumptions about how the meshwork structure influences molecular diffusion, we derived a mathematical expression for the transport rate based on the size of the pore and the transported molecules. To validate our model, we conducted Brownian dynamics simulations using a coarse-grained representation of the NPC. These simulations, performed across a range of pore sizes, demonstrated strong agreement with our model’s predictions, confirming its accuracy and applicability. Our model is specifically tailored for small-to-medium-sized molecules, approximately 5 nanometers in size, making it relevant to a wide range of transcription factors and signaling molecules. It also extends to molecules with weak and transient interactions with FG-Nups, such as importin-β. By presenting this model formula, our study offers a quantitative framework for analyzing the effects of pore dilation on nucleocytoplasmic transport.

Biochemistry & Molecular Biology↗
DOE OSTI2025

Leveraging structure-informed machine learning for fast steric zipper propensity prediction across whole proteomes

Predicting the amyloid fold and the propensity of peptide segments to adopt amyloid-like structures remain a challenge. However, recent progress has facilitated structure-based prediction of steric zipper propensity and the use of machine learning to accelerate the calculation of predictive models across many scientific areas. Leveraging these advances, we have developed a new approach for rapid proteome-wide assessment of zipper profiles that is informed by four million steric zipper predictions collected over ten years. This collection is used to build a machine learning model capable of rapidly predicting steric zipper propensity, and allowing for the assessment of zippers at both the protein and proteome level. Our predictions show enrichment for zipper forming segments in proteins involved in cell wall reorganization in yeast, highlighting a potential category of interest for experimental characterization. Overall, our predictive model allows for the exploration of amyloid formation across the tree of life and provides a tool for assessment of both novel and designed sequences for zipper density.

Biochemistry & Molecular Biology↗
DOE OSTI2021

Reverse annealing for nonnegative/binary matrix factorization

It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers, but performance rapidly plateaued. In this paper, we utilize reverse annealing instead of forward annealing in the quantum annealing subroutine for nonnegative/binary matrix factorization problems. After an initial global search with forward annealing, reverse annealing performs a series of local searches that refine existing solutions. The combination of forward and reverse annealing significantly improves performance compared to forward annealing alone for all but the shortest run times.

97 MATHEMATICS AND COMPUTING↗