Fast-SAXS-pro: A unified approach to computing SAXS profiles of DNA, RNA, protein, and their complexes
Abstract not provided
SEARCH · Engineering Papers
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.
Abstract not provided
The effects of the pi-coordination of an Fe atom on the mid- and far-infrared spectra of a mixture of cationic polycyclic aromatic hydrocarbons (PAHs), e.g., pyrene (C{sub 16}H{sub 10}), anthanthrene (C{sub 22}H{sub 12}), coronene (C{sub 24}H{sub 12}), ovalene (C{sub 32}H{sub 14}), circumpyrene (C{sub 42}H{sub 16}), and circumcoronene (C{sub 54}H{sub 18}), are studied by Density Functional Theory based calculations. In the mid-infrared range (3-20 {mu}m), by comparison with the bare PAH{sup +} spectrum, we found (1) an increase of the intensity ratio of the C-H stretching and C-H out-of-plane bending bands with respect to the intense CC stretching band and (2) a shift of the band positions and a characteristic profile with a steep blue rise and an extended red tail for the CC stretching and CH out-of-plane bending bands. None of these features appears inconsistent with the observed aromatic infrared band spectrum. In the far-infrared range (lambda > 20 {mu}m), the presence of a pi-coordinated Fe atom induces many new bands as (1) some vibrational modes of the PAH are activated due to symmetry reduction and (2) new modes involving the motion of the Fe atom occur. In particular, an accumulation point due to the activation of the Fe-PAH stretching mode is observed at around 40 {mu}m. This range is suggested to contain the spectral fingerprint for the presence of [M-PAH]{sup +} (M=Fe, Si, Mg) complexes in the interstellar medium. Additional features in the [60-300] {mu}m range are found for complexes with large PAHs. The obtained results are discussed in the light of past, present, and future astronomical missions, among which are the Herschel Space Observatory and the SPICA telescope for the far-infrared domain.
The recalcitrance of lignocellulosic biomass to hydrolysis is the bottleneck in cellulosic ethanol production. Efficient degradation of biomass by the anaerobic bacterium Clostridium thermocellum is carried out by the multicomponent cellulosome complex. The bacterial cell-surface attachment of the cellulosome is mediated by high-affinity protein-protein interactions between the Type II cohesin domain borne by the cell envelope protein and the Type II dockerin domain, together with neighboring X-module present at the C-terminus of the scaffolding protein (Type II coh-Xdoc). Here, the Type II coh-Xdoc interaction is probed using molecular dynamics simulations, free-energy calculations and essential dynamics analyses on both the wild type and various mutants of the C. thermocellum Type II coh-Xdoc in aqueous solution. The simulations identify the hot spots, i.e. the amino acid residues that may lead to a dramatic decrease in binding affinity upon mutation and also probe the effects of mutations on the mode of binding. The results suggest that bulky and hydrophobic residues at the protein interface, which make specific contacts with their counterparts, may play essential roles in retaining a rigid cohesin-dockerin interface. Moreover, dynamical cross-correlation analysis indicates that the X-module has a dramatic effect on the cohesin-dockerin interaction and is required for the dynamical integrity of the interface.
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
We present and discuss seven different open problems in applied combinatorics. Additionally, the application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut algorithms, and power systems.
Abstract not provided.
Over the last several years, particle technology in the CartaBlanca code has been matured and has been successfully applied to a wide variety of physical problems. It has been shown that the particle methods, especially Los Alamos's dual domain material point method, is capable of computing many problems involves complex physics, chemistries accompanied by large material deformations, where the traditional finite element or Eulerian method encounter significant difficulties. In FY17, the CartaBlanca code has been enhanced with physical models and numerical algorithms. We started out to compute penetration and HE safety problems. Most of the year we focused on the TEPLA model improvement testing against the sweeping wave experiment by Gray et al., because it was found that pore growth and material failure are essentially important for our tasks and needed to be understood for modeling the penetration and the can experiments efficiently. We extended the TEPLA mode from the point view of ensemble phase average to include the effects of nite deformation. It is shown that the assumed pore growth model in TEPLA is actually an exact result from the theory. Alone this line, we then generalized the model to include finite deformations to consider nonlinear dynamics of large deformation. The interaction between the HE product gas and the solid metal is based on the multi-velocity formation. Our preliminary numerical results suggest good agreement between the experiment and the numerical results, pending further verification. To improve the parallel processing capabilities of the CartaBlanca code, we are actively working with the Next Generation Code (NGC) project to rewrite selected packages using C++. This work is expected to continue in the following years. This effort also makes the particle technology developed with CartaBlanca project available to other part of the laboratory. Working with the NGC project and rewriting some parts of the code also given us an opportunity to improve our numerical implementations of the method and to take advantage of recently advances in the numerical methods, such as multiscale algorithms.
Electrostatic or magnetostatic problems involving complex heterogeneity are nontrivial for modeling and simulation. Most existing numerical methods focus on sharp interface models and the computational cost increases with increasing complexity of the geometry. Here we develop an iterative spectral method, the bound charge successive approximation algorithm, to solve electrostatic or magnetostatic heterogeneity problems in the context of diffuse-interface modeling. As tests and verifications, this algorithm is applied to calculation of the depolarization factor of an ellipsoid, and simulation of random dielectric mixtures and the dielectophoretic motion of multiple particles. The algorithm shows excellent efficiency and the computational cost mainly depends on the permittivity or permeability contrast in the whole system, regardless of the complexity of the geometry. Specifically, for evolving heterostructures the solution of bound charge in one time step can be used as input for the next, which could further significantly shorten the iteration (approximation) process, making it practical to simulate the long-range electrostatic or magnetostatic interaction in complex and evolving heterostructures.
Purpose: New advances in radiation therapy are most likely to come from the complex interface of physics, chemistry and biology. Computational simulations offer a powerful tool for quantitatively investigating radiation interactions with biological tissue and can thus help bridge the gap between physics and biology. The aim of TOPAS-nBio is to provide a comprehensive tool to generate advanced radiobiology simulations. Methods: TOPAS wraps and extends the Geant4 Monte Carlo (MC) simulation toolkit. TOPAS-nBio is an extension to TOPAS which utilizes the physics processes in Geant4-DNA to model biological damage from very low energy secondary electrons. Specialized cell, organelle and molecular geometries were designed for the toolkit. Results: TOPAS-nBio gives the user the capability of simulating biological geometries, ranging from the micron-scale (e.g. cells and organelles) to complex nano-scale geometries (e.g. DNA and proteins). The user interacts with TOPAS-nBio through easy-to-use input parameter files. For example, in a simple cell simulation the user can specify the cell type and size as well as the type, number and size of included organelles. For more detailed nuclear simulations, the user can specify chromosome territories containing chromatin fiber loops, the later comprised of nucleosomes on a double helix. The chromatin fibers can be arranged in simple rigid geometries or within factual globules, mimicking realistic chromosome territories. TOPAS-nBio also provides users with the capability of reading protein data bank 3D structural files to simulate radiation damage to proteins or nucleic acids e.g. histones or RNA. TOPAS-nBio has been validated by comparing results to other track structure simulation software and published experimental measurements. Conclusion: TOPAS-nBio provides users with a comprehensive MC simulation tool for radiobiological simulations, giving users without advanced programming skills the ability to design and run complex simulations.
Abstract The global decline of water quality in rivers and streams has resulted in a pressing need to design new watershed management strategies. Water quality can be affected by multiple stressors including population growth, land use change, global warming, and extreme events, with repercussions on human and ecosystem health. A scientific understanding of factors affecting riverine water quality and predictions at local to regional scales, and at sub‐daily to decadal timescales are needed for optimal management of watersheds and river basins. Here, we discuss how machine learning (ML) can enable development of more accurate, computationally tractable, and scalable models for analysis and predictions of river water quality. We review relevant state‐of‐the art applications of ML for water quality models and discuss opportunities to improve the use of ML with emerging computational and mathematical methods for model selection, hyperparameter optimization, incorporating process knowledge into ML models, improving explainablity, uncertainty quantification, and model‐data integration. We then present considerations for using ML to address water quality problems given their scale and complexity, available data and computational resources, and stakeholder needs. When combined with decades of process understanding, interdisciplinary advances in knowledge‐guided ML, information theory, data integration, and analytics can help address fundamental science questions and enable decision‐relevant predictions of riverine water quality.
Resonances are temporarily bound states which lie in the continuum part of the Hamiltonian. If the electronic coordinates of the Hamiltonian are scaled (“dilated”) by a complex parameter, η = αe{sup iθ} (α, θ real), then its complex eigenvalues represent the scattering states (resonant and non-resonant) while the eigenvalues corresponding to the bound states and the ionization and the excitation thresholds remain real and unmodified. These make the study of these transient species amenable to the bound state methods. We developed a quadratically convergent multiconfigurational self-consistent field method (MCSCF), a well-established bound-state technique, combined with a dilated Hamiltonian to investigate resonances. This is made possible by the adoption of a second quantization algebra suitable for a set of “complex conjugate biorthonormal” spin orbitals and a modified step-length constraining algorithm to control the walk on the complex energy hypersurface while searching for the stationary point using a multidimensional Newton-Raphson scheme. We present our computational results for the {sup 2}PBe{sup −} shape resonances using two different computationally efficient methods that utilize complex scaled MCSCF (i.e., CMCSCF). These two methods are to straightforwardly use CMCSCF energy differences and to obtain energy differences using an approximation to the complex multiconfigurational electron propagator. It is found that, differing from previous computational studies by others, there are actually two {sup 2}PBe{sup −} shape resonances very close in energy. In addition, N{sub 2} resonances are examined using one of these methods.
The advent of petascale computing applied to direct numerical simulation (DNS) of turbulent combustion has transformed our ability to interrogate fine-grained ‘turbulence-chemistry’ interactions in canonical and laboratory configurations. In particular, three-dimensional DNS, at moderate Reynolds numbers and with complex chemistry, is providing unprecedented levels of detail to isolate and reveal fundamental causal relationships between turbulence, mixing and reaction. This information is leading to new physical insight, providing benchmark data for assessing model assumptions, suggesting new closure hypotheses, and providing interpretation of statistics obtained from lower-dimensional measurements. In this paper the various roles of petascale DNS are illustrated through selected examples related to lifted flame stabilization, premixed and stratified flame propagation in intense turbulence, and extinction and reignition in turbulent non-premixed jet flames. Extending the DNS envelope to higher Reynolds numbers, higher pressures, and greater chemical complexity will require exascale computing in the next decade. The future outlook of DNS in terms of challenges and opportunities in this regard are addressed.
Abstract Background Enzymatic hydrolysis continues to have a significant projected production cost for the biological conversion of biomass to fuels and chemicals, motivating research into improved enzyme and reactor technologies in order to reduce enzyme usage and equipment costs. However, technology development is stymied by a lack of accurate and computationally accessible enzymatic-hydrolysis reaction models. Enzymatic deconstruction of cellulosic materials is an exceedingly complex physico-chemical process. Models which elucidate specific mechanisms of deconstruction are often too computationally intensive to be accessible in process or multi-physics simulations, and empirical models are often too inflexible to be effectively applied outside of their batch contexts. In this paper, we employ a phenomenological modeling approach to represent rate slowdown due to substrate structure (implemented as two substrate phases) and feedback inhibition, and apply the model to a continuous reactor system. Results A phenomenological model was developed in order to predict glucose and solids concentrations in batch and continuous enzymatic-hydrolysis reactors from which liquor is continuously removed by ultrafiltration. A series of batch experiments were performed, varying initial conditions (solids, enzyme, and sugar concentrations), and best-fit model parameters were determined using constrained nonlinear least-squares methods. The model achieved a good fit for overall sugar yield and insoluble solids concentration, as well as for the reduced rate of sugar production over time. Additionally, without refitting model coefficients, good quantitative agreement was observed between results from continuous enzymatic-hydrolysis experiments and model predictions. Finally, the sensitivity of the model to its parameters is explored and discussed. Conclusions Although the phenomena represented by the model correspond to behaviors that emerge from clusters of mechanisms, and hence a set of model coefficients are unique to the substrate and the enzyme system, the model is efficient to solve and may be applied to novel reactor schema and implemented in computational fluid dynamics (CFD) simulations. Hence, this modeling approach finds the right balance between model complexity and computational efficiency. These capabilities have broad application to reactor design, scale-up, and process optimization.
Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with m insertions and deletions can be computed $O(m^ω)$ in time, where $ω < 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^3 n)$ time algorithm for this problem, where $n ≤ m$ is the size of the largest complex in the filtration.
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.
Dark-field X-ray microscopy (DFXM) is a novel diffraction-based imaging technique that non-destructively maps the local deformation from crystalline defects in bulk materials. While studies have demonstrated that DFXM can spatially map 3D defect geometries, it is still challenging to interpret DFXM images of the high-dislocation-density systems relevant to macroscopic crystal plasticity. This work develops a scalable forward model to calculate virtual DFXM images for complex discrete dislocation structure(s) (DDS) obtained from atomistic simulations. Our new DDS-DFXM model integrates a non-singular formulation for calculating the local strain from the DDS and an efficient geometrical optics algorithm for computing the DFXM image from the strain field. We apply the model to complex DDS obtained from a large-scale molecular dynamics simulation of compressive loading on single-crystal silicon. Simulated DFXM images exhibit prominent contrast for dislocation features between the multiple slip systems, demonstrating the potential of DFXM to resolve features from dislocation multiplication. In conclusion, the integrated DDS-DFXM model provides a toolbox for DFXM experimental design and image interpretation in the context of bulk crystal plasticity for a range of measurements across shock plasticity and the broader materials science community.
The numerical solution of the Poisson Boltzmann (PB) equation is a useful but a computationally demanding tool for studying electrostatic solvation effects in chemical and biomolecular systems. Recently, we have described a boundary integral equation-based PB solver accelerated by a new version of the fast multipole method (FMM). The overall algorithm shows an order N complexity in both the computational cost and memory usage. Here, we present an updated version of the solver by using an adaptive FMM for accelerating the convolution type matrix-vector multiplications. The adaptive algorithm, when compared to our previous nonadaptive one, not only significantly improves the performance of the overall memory usage but also remarkably speeds the calculation because of an improved load balancing between the local- and far-field calculations. We have also implemented a node-patch discretization scheme that leads to a reduction of unknowns by a factor of 2 relative to the constant element method without sacrificing accuracy. As a result of these improvements, the new solver makes the PB calculation truly feasible for large-scale biomolecular systems such as a 30S ribosome molecule even on a typical 2008 desktop computer.
An infinite set {l_brace}{tau}{sup (l)}(y;r,z){r_brace}{sub r,lisanelementofN{sub 0}} of linear sums of continuous dual q{sup -2}-Hahn polynomials with prefactors depending on a complex parameter z is studied. The sums {tau}{sup (l)}(y;r,z) have an interpretation in context with tensor product representations of the quantum affine algebra U{sub q}{sup '}(sl(2)) involving both a positive and a negative discrete series representation. For each l>0, the sum {tau}{sup (l)}(y;r,z) can be expressed in terms of the sum {tau}{sup (0)}(y;r,z), continuous dual q{sup 2}-Hahn polynomials, and their associated polynomials. The sum {tau}{sup (0)}(y;r,z) is obtained as a combination of eight basic hypergeometric series. Moreover, an integral representation is provided for the sums {tau}{sup (l)}(y;r,z) with the complex parameter restricted by |zq|<1. This gives rise to a bilinear summation formula for the continuous dual q{sup -2}-Hahn polynomials.