Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematics of 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 1,081 records · Page 60

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↗

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↗

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↗

ISAP-MATLAB Package for Sensitivity Analysis of High-Dimensional Stochastic Chemical Networks

Stochastic simulation and modeling play an important role to elucidate the fundamental mechanisms in complex biochemical networks. The parametric sensitivity analysis of reaction networks becomes a powerful mathematical and computational tool, yielding information regarding the robustness and the identifiability of model parameters. However, due to overwhelming computational cost, parametric sensitivity analysis is a extremely challenging problem for stochastic models with a high-dimensional parameter space and for which existing approaches are very slow. Here we present an information-theoretic sensitivity analysis in path-space (ISAP) MATLAB package that simulates stochastic processes with various algorithms and most importantly implements a gradient-free approach to quantify the parameter sensitivities of stochastic chemical reaction network dynamics using the pathwise Fisher information matrix (PFIM; Pantazis, Katsoulakis, and Vlachos 2013). The sparse, block-diagonal structure of the PFIM makes its computational complexity scale linearly with the number of model parameters. As a result of the gradientfree and the sparse nature of the PFIM, it is highly suitable for the sensitivity analysis of stochastic reaction networks with a very large number of model parameters, which are typical in the modeling and simulation of complex biochemical phenomena. Finally, the PFIM provides a fast sensitivity screening method (Arampatzis, Katsoulakis, and Pantazis 2015) which allows it to be combined with any existing sensitivity analysis software.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Effect of Measurement Error on Surveillance Metrics

The purpose of this manuscript is to describe different simulation studies that CCS-6 has performed for the purpose of understanding the effects of measurement error on the surveillance metrics. We assume that the measured items come from a larger population of items. We denote the random variable associate with an item's value of an attribute of interest as X and that $X \text{~} N(\mu, \sigma^2$). This distribution represents the variability in the population of interest and we wish to make inference on the parameters $\mu$ and $\sigma$ or on some function of these parameters. When an item X is selected from the larger population, a measurement is made on some attribute of it. This measurement is made with error and the true value of X is not observed. The rest of this section presents simulation results for different measurement cases encountered.

42 ENGINEERING↗

The Graph Laplacian and the Dynamics of Complex Networks [Slides]

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

97 MATHEMATICS AND COMPUTING↗

Validation of Two Hydrocodes with a Bi-Metallic Shaped Charge Experiment

Staggered grid (SGH) and cell-centered (CCH) Lagrangian Hydrodynamics are two approaches to modeling high explosives experiments. These experiments often involve complex flows with multiple materials with and without constitutive relationships. One example of complex flow phenomena is the discontinuous velocities along the tangential direction of a contact surface. Lagrangian methods combined with a contact surface algorithm are well-suited for these types of flows. In this work, the SGH and CCH schemes coupled with a contact surface algorithm are used to model a bi-metallic shaped charge experiment. The shaped charge experiment will be used to validate the contact surface methods, and is scheduled to be performed in the coming year at LANL. The experiment consists of a high explosive wrapped around a hemispherical shell of aluminum and an inner hemispherical shell of copper. The interface between the aluminum and copper shells is modeled both as a frictionless and “bonded” surface. The simulations are performed in a two-dimensional r-z coordinate system using the production code FLAG. A modified Gurney solution for an imploding sphere and Richardson extrapolation is used to evaluate the reasonableness of the results.

Engineering(42)↗

Summary of Results for Converging Shock Wave Problems

The purpose of this note is to provide a brief overview of an attempt to simulate a Guderley-like imploding shock problem in xRAGE. Prior to this study, the following have been completed with respect to the Guderley problem itself: A canonical definition for use with ASC codes has been proposed (LA-UR-11-02765); 1D simulations with spherical symmetry on uniform grids have been performed, with associated spatial convergence analysis. The xRAGE code showed near 1st order convergence for this problem in the initial studies (LA-UR-10-06435); A version of the Guderley problem as been added to the xRAGE regression test suite. More recently, a large number of simulations have been performed for the Guderley problem (and a similar problem) using xRAGE’s (v. 1009.02) AMR capability.

Mathematics & Computing(97)↗

Optimal Inequalities to Bound a Performance Probability

A challenging problem encountered in engineering applications is the estimation of a probability-of-failure based on incomplete knowledge of the sources of uncertainty and/or limited sampling. Theories formulated to derive upper probability bounds offer an attractive alternative because first, they avoid postulating the probability laws that are often unknown and second, they substitute numerical optimization for statistical sampling. A critical assessment of one such technique is presented. It derives upper probability bounds from the McDiarmid concentration-of-measure theory, which postulates that fluctuations of a function are more-or-less concentrated about its mean value. Three applications of this theory are presented. The first two applications analyze “toy” polynomial functions defined in two and seventeen dimensions. The upper bounds of probability are calculated and compared to sampling-based estimates of the true-but-unknown probabilities. For these functions, the upper bounds obtained are too broad to be useful. These results are confirmed by conducting a similar analysis on a real engineering system, where upper bounds of probability associated with resonant frequencies of a structural system are estimated. These frequencies are predicted by a high-fidelity finite element model that was previously validated using vibration measurements. In this third application, the uncertainty is introduced by way of material properties and the effective preload of a beam-to-column connection, modeled explicitly. These applications suggest that the theory not only leads to upper bounds that are inefficient but that can also be sub-optimal if their numerical estimation is based on too few model runs. It is concluded that this particular theory, while mathematically attractive, may not be well suited for engineering applications.

Engineering(42)↗

A Statistical Methodology for Quantifying Improvement in Predictive Capability: Key Features and Benefits

In References [1, 2, 3], we proposed a statistical methodology for quanti fying improvement in predictive capability. In this note, we summarize the key features and benefits of our approach. We begin with a brief summary of our methodology. Broadly speaking, our approach models the predictive process statistically at a high level. Ac cordingly, we assume the existence of a body of experiments, the results of which have been (or will be) predicted. We can then treat the discrepancy between a prediction and the corresponding experimental result as a datum and the collection of such data informs us about the statistics of the prediction process.

Engineering(42)↗