Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 397 records · Page 22

Noise analysis of genome-scale protein synthesis using a discrete computational model of translation

Noise in genetic networks has been the subject of extensive experimental and computational studies. However, very few of these studies have considered noise properties using mechanistic models that account for the discrete movement of ribosomes and RNA polymerases along their corresponding templates (messenger RNA (mRNA) and DNA). The large size of these systems, which scales with the number of genes, mRNA copies, codons per mRNA, and ribosomes, is responsible for some of the challenges. Additionally, one should be able to describe the dynamics of ribosome exchange between the free ribosome pool and those bound to mRNAs, as well as how mRNA species compete for ribosomes. We developed an efficient algorithm for stochastic simulations that addresses these issues and used it to study the contribution and trade-offs of noise to translation properties (rates, time delays, and rate-limiting steps). The algorithm scales linearly with the number of mRNA copies, which allowed us to study the importance of genome-scale competition between mRNAs for the same ribosomes. We determined that noise is minimized under conditions maximizing the specific synthesis rate. Moreover, sensitivity analysis of the stochastic system revealed the importance of the elongation rate in the resultant noise, whereas the translation initiation rate constant was more closely related to the average protein synthesis rate. We observed significant differences between our results and the noise properties of the most commonly used translation models. Overall, our studies demonstrate that the use of full mechanistic models is essential for the study of noise in translation and transcription.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient generation of sum-of-products representations of high-dimensional potential energy surfaces based on multimode expansions

The transformation of multi-dimensional potential energy surfaces (PESs) from a grid-based multimode representation to an analytical one is a standard procedure in quantum chemical programs. Within the framework of linear least squares fitting, a simple and highly efficient algorithm is presented, which relies on a direct product representation of the PES and a repeated use of Kronecker products. It shows the same scalings in computational cost and memory requirements as the POTFIT approach. In comparison to customary linear least squares fitting algorithms, this corresponds to a speed-up and memory saving by several orders of magnitude. Different fitting bases are tested, namely, polynomials, B-splines, and distributed Gaussians. Benchmark calculations are provided for the PESs of a set of small molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exchange correlation potentials from full configuration interaction in a Slater orbital basis

Ryabinkin–Kohut–Staroverov (RKS) theory builds a bridge between wave function theory and density functional theory by using quantities from the former to produce accurate exchange-correlation potentials needed by the latter. In this work, the RKS method is developed and tested alongside Slater atomic orbital basis functions for the first time. To evaluate this approach, full configuration interaction computations in the Slater orbital basis are employed to give quality input to RKS, allowing full correlation to be present along with correct nuclei cusps and asymptotic decay of the wavefunction. SlaterRKS is shown to be an efficient algorithm to arrive at exchange-correlation potentials without unphysical artifacts in moderately-sized basis sets. Furthermore, enforcement of the nuclear cusp conditions will be shown to be vital for the success of the Slater-basis RKS method. As a result, examples of weakly and strongly correlated molecular systems will demonstrate the main features of SlaterRKS.

74 ATOMIC AND MOLECULAR PHYSICS↗

Fast methods for multisite charge transfer. Processes II. Analytic nuclear gradients and nonadiabatic dynamics for cCASSCF(1,n) and cCASSCF(2n-1,n) wavefunctions

In this work we derive and implement analytic nuclear gradients and derivative couplings for a constrained complete active space self-consistent field with a small active space designed to model electron or hole transfer. Using a Lagrangian formalism, we are able to differentiate both the CASSCF energy and the constraint (which is required for smooth surfaces over a wide range of parameter space), and the resulting efficient algorithm can be immediately applied to nonadiabatic dynamics simulations of charge transfer processes. Here, we run initial surface-hopping simulations of a proton coupled electron transfer event for a phenoxyl–phenol system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

THE FIRST GALAXIES: CHEMICAL ENRICHMENT, MIXING, AND STAR FORMATION

Using three-dimensional cosmological simulations, we study the assembly process of one of the first galaxies, with a total mass of {approx}10{sup 8} M {sub sun}, collapsing at z {approx_equal} 10. Our main goal is to trace the transport of the heavy chemical elements produced and dispersed by a pair-instability supernova exploding in one of the minihalo progenitors. To this extent, we incorporate an efficient algorithm into our smoothed particle hydrodynamics code that approximately models turbulent mixing as a diffusion process. We study this mixing with and without the radiative feedback from Population III (Pop III) stars that subsequently form in neighboring minihalos. Our simulations allow us to constrain the initial conditions for second-generation star formation, within the first galaxy itself, and inside of minihalos that virialize after the supernova explosion. We find that most minihalos remain unscathed by ionizing radiation or the supernova remnant, while some are substantially photoheated and enriched to supercritical levels, likely resulting in the formation of low-mass Pop III or even Population II (Pop II) stars. At the center of the newly formed galaxy, {approx}10{sup 5} M {sub sun} of cold, dense gas uniformly enriched to {approx}10{sup -3} Z {sub sun} is in a state of collapse, suggesting that a cluster of Pop II stars will form. The first galaxies, as may be detected by the James Webb Space Telescope, would therefore already contain stellar populations familiar from lower redshifts.

79 ASTRONOMY AND ASTROPHYSICS↗

OPTIMAL LINEAR IMAGE COMBINATION

A simple, yet general, formalism for the optimized linear combination of astrophysical images is constructed and demonstrated. The formalism allows the user to combine multiple undersampled images to provide oversampled output at high precision. The proposed method is general and may be used for any configuration of input pixels and point spread function; it also provides the noise covariance in the output image along with a powerful metric for describing undesired distortion to the image convolution kernel. The method explicitly provides knowledge and control of the inevitable compromise between noise and fidelity in the output image. We present a first prototype implementation of the method, outlining the steps taken to generate an efficient algorithm. This implementation is then put to practical use in reconstructing fully sampled output images using simulated, undersampled input exposures that are designed to mimic the proposed Wide-field InfraRed Survey Telescope (WFIRST). We examine results using randomly rotated and dithered input images, while also assessing better-known 'ideal' dither patterns: comparing results, we illustrate the use of the method as a survey design tool. Finally, we use the method to test the robustness of linear image combination when subjected to practical realities such as missing input pixels and focal plane plate scale variations.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient optimization method for finding minimum energy paths of magnetic transitions

Here, efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line search can, therefore, not be performed, the use of limited memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) and conjugate gradient algorithms in conjunction with orthogonal spin optimization (OSO) approach is shown to greatly outperform the previously used velocity projection and dissipative Landau–Lifschitz dynamics optimization methods. The implementation makes use of energy weighted springs for the distribution of the discretization points along the path and this is found to improve performance significantly. The various methods are applied to several test problems using a Heisenberg-type Hamiltonian, extended in some cases to include Dzyaloshinskii–Moriya and exchange interactions beyond nearest neighbours. Minimum energy paths are found for magnetization reversals in a nano-island, collapse of skyrmions in two-dimensional layers and annihilation of a chiral bobber near the surface of a three-dimensional magnet. The LBFGS-OSO method is found to outperform the dynamics based approaches by up to a factor of 8 in some cases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Calculation of permanent magnet arrangements for stellarators: a linear least-squares method

A problem arising in several engineering areas is to design magnets outside a volume that produce a desired magnetic field inside it. One instance of this problem is stellarator design, where it has recently been shown that permanent magnets can provide the required shaping of the magnetic field. Here we demonstrate a robust and efficient algorithm REGCOIL_PM to calculate the spatial distribution of these permanent magnets. The procedure involves a small number of fixed-point iterations, with a linear least-squares problem solved at each step. Furthermore, the method exploits the Biot–Savart Law's exact linearity in magnetization density and approximate linearity in magnet size, for magnets far from the target region. No constraint is placed on the direction of magnetization, so Halbach solutions are found naturally, and the magnitude of the magnetization can be made uniformly equal to a target value.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Implementation of Maxwell's equations in the reconstruction of the magnetic field in the g -2 storage ring

We present a method for implementing the constraints that are implied by Maxwell's equations in fits to measurements of the magnetic field in the muon storage ring of the $g - 2$ experiment. The method that we use makes use of toroidal-harmonic solutions of Laplace's equation. We point out that the fitting problem can be approximated well as a linear-algebra problem. We have devised an efficient algorithm for the linear-algebra problem that makes it possible to find a solution for 10 5 data points and 10 4 harmonics in less than an hour on a present-day desktop computer. We illustrate our method by applying it to some preliminary measurements of the magnetic field in the $g - 2$ storage ring.

43 PARTICLE ACCELERATORS↗

A variant selection framework for genome graphs

Abstract Motivation Variation graph representations are projected to either replace or supplement conventional single genome references due to their ability to capture population genetic diversity and reduce reference bias. Vast catalogues of genetic variants for many species now exist, and it is natural to ask which among these are crucial to circumvent reference bias during read mapping. Results In this work, we propose a novel mathematical framework for variant selection, by casting it in terms of minimizing variation graph size subject to preserving paths of length α with at most δ differences. This framework leads to a rich set of problems based on the types of variants [e.g. single nucleotide polymorphisms (SNPs), indels or structural variants (SVs)], and whether the goal is to minimize the number of positions at which variants are listed or to minimize the total number of variants listed. We classify the computational complexity of these problems and provide efficient algorithms along with their software implementation when feasible. We empirically evaluate the magnitude of graph reduction achieved in human chromosome variation graphs using multiple α and δ parameter values corresponding to short and long-read resequencing characteristics. When our algorithm is run with parameter settings amenable to long-read mapping (α = 10 kbp, δ = 1000), 99.99% SNPs and 73% SVs can be safely excluded from human chromosome 1 variation graph. The graph size reduction can benefit downstream pan-genome analysis. Availability and implementation https://github.com/AT-CG/VF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

FluxRETAP: a REaction TArget Prioritization genome-scale modeling technique for selecting genetic targets

MOTIVATION: Metabolic engineering is rapidly evolving as a result of new advances in synthetic biology tools and automation platforms that enable high throughput strain construction, as well as the development of machine learning tools (ML) for biology. However, selecting genetic engineering targets that effectively guide the metabolic engineering process is still challenging. ML can provide predictive power for synthetic biology, but current technical limitations prevent the independent use of ML approaches without previous biological knowledge. RESULTS: Here, we present FluxRETAP, a simple and computationally inexpensive method that leverages the prior mechanistic knowledge embedded in genome-scale models for suggesting targets for genetic overexpression, downregulation or deletion, with the final goal of increasing the production of a desired metabolite. This method can provide a list of desirable engineering targets that can be combined with current ML pipelines. FluxRETAP captured 100% of reaction targets experimentally verified to improve Escherichia coli isoprenol production, 50% of targets that experimentally improved taxadiene production in E. coli and ∼60% of genetic targets from a verified minimal constrained cut-set in Pseudomonas putida, while providing additional high priority targets that could be tested. Overall, FluxRETAP is an efficient algorithm for identifying a prioritized list of testable genetic and reaction targets. AVAILABILITY AND IMPLEMENTATION: FluxRETAP is implemented in python and released under the creative commons license. The implementation and code are freely available at: https://github.com/JBEI/FluxRETAP.

Czajka, Jeffrey J↗

Automatic detection of low surface brightness galaxies from Sloan Digital Sky Survey images

ABSTRACT Low surface brightness (LSB) galaxies are galaxies with central surface brightness fainter than the night sky. Due to the faint nature of LSB galaxies and the comparable sky background, it is difficult to search LSB galaxies automatically and efficiently from large sky survey. In this study, we established the low surface brightness galaxies autodetect (LSBG-AD) model, which is a data-driven model for end-to-end detection of LSB galaxies from Sloan Digital Sky Survey (SDSS) images. Object-detection techniques based on deep learning are applied to the SDSS field images to identify LSB galaxies and estimate their coordinates at the same time. Applying LSBG-AD to 1120 SDSS images, we detected 1197 LSB galaxy candidates, of which 1081 samples are already known and 116 samples are newly found candidates. The B-band central surface brightness of the candidates searched by the model ranges from 22 to 24 mag arcsec−2, quite consistent with the surface brightness distribution of the standard sample. A total of 96.46 per cent of LSB galaxy candidates have an axial ratio (b/a) greater than 0.3, and 92.04 per cent of them have $fracDev\_r$ < 0.4, which is also consistent with the standard sample. The results show that the LSBG-AD model learns the features of LSB galaxies of the training samples well, and can be used to search LSB galaxies without using photometric parameters. Next, this method will be used to develop efficient algorithms to detect LSB galaxies from massive images of the next-generation observatories.

79 ASTRONOMY AND ASTROPHYSICS↗

Using galaxy pairs to investigate the three-point correlation function in the squeezed limit

We investigate the three-point correlation function (3PCF) in the squeezed limit by considering galaxy pairs as discrete objects and cross-correlating them with the galaxy field. We develop an efficient algorithm using fast Fourier transforms to compute such cross-correlations and their associated pair-galaxy bias bp, g and the squeezed 3PCF coefficient Qeff. We implement our method using N-body cosmological simulations and a fiducial halo occupation distribution (HOD) and present the results in both the real space and redshift space. In real space, we observe a peak in b p, g and Q eff at pair separation of ~2 Mpc, attributed to the fact that galaxy pairs at 2 Mpc separation trace the most massive dark matter haloes. We also see strong anisotropy in the b p, g and Qeff signals that track the large-scale filamentary structure. In redshift space, both the 2 Mpc peak and the anisotropy are significantly smeared out along the line of sight due to finger-of-God effect. In both the real space and redshift space, the squeezed 3PCF shows a factor of 2 variation, contradicting the hierarchical ansatz, but offering rich information on the galaxy-halo connection. Thus, we explore the possibility of using the squeezed 3PCF to constrain the HOD. When we compare two simple HOD models that are closely matched in their projected two-point correlation function (2PCF), we do not yet see a strong variation in the 3PCF that is clearly disentangled from variations in the projected 2PCF. Nevertheless, we propose that more complicated HOD models, e.g. those incorporating assembly bias, can break degeneracies in the 2PCF and show a distinguishable squeezed 3PCF signal.

79 ASTRONOMY AND ASTROPHYSICS↗

Time evolution of projected entangled pair states in the single-layer picture

We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions using projected entangled pair states. This is done by approximating the environment, arising in the context of updating tensors in the process of time evolution, using a single-layered tensor network structure. This significantly reduces the computational costs and allows simulations in a larger submanifold of the Hilbert space as bounded by the bond dimension of the tensor network. We present numerical evidence for stability of the method on an antiferromagnetic isotropic Heisenberg model where good agreement is found with the available accurate results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactly solvable model for nonlinear light-matter interaction in an arbitrary time-dependent field

Exact analytic expressions are derived for the dipole moment and nonlinear current of a one-dimensional quantum particle subject to a short-range attractive potential and an arbitrary time-dependent electric field. An efficient algorithm for the current evaluation is described and a robust implementation suitable for numerical simulations is demonstrated.

74 ATOMIC AND MOLECULAR PHYSICS↗

Efficient numerical method for evaluating normal and anomalous time-domain equilibrium Green's functions in inhomogeneous systems

In this work we develop EPOCH (equilibrium propagator by orthogonal polynomial chain), a computationally efficient method to calculate the time-dependent equilibrium Green's functions, including the anomalous Green's functions of superconductors, to capture the time evolution in large inhomogeneous systems. The EPOCH method generalizes the Chebyshev wave-packet propagation method from quantum chemistry and efficiently incorporates the Fermi-Dirac statistics that is needed for equilibrium quantum condensed matter systems. The computational cost of EPOCH scales only linearly in the system degrees of freedom, generating an extremely efficient algorithm also for very large systems. We demonstrate the power of the EPOCH method by calculating the time evolution of an excitation near a superconductor–normal metal interface in two and three dimensions, capturing transmission as well as normal and Andreev reflections.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Precisely computing phonons via irreducible derivatives

Computing phonons from first principles is typically considered a solved problem, yet inadequacies in existing techniques continue to yield deficient results in systems with sensitive phonons. Here, in this study, we circumvent this issue using the lone irreducible derivative (LID) and bundled irreducible derivative (BID) approaches to computing phonons via finite displacements, where the former optimizes precision via energy derivatives and the latter provides the most efficient algorithm using force derivatives. A condition number optimized basis for BID is derived which guarantees the minimum amplification of error. Additionally, a hybrid LID-BID approach is formulated, in which select irreducible derivatives computed using LID replace BID results. We illustrate our approach on two prototypical systems with sensitive phonons: the shape memory alloy AuZn and metallic lithium. Comparing our resulting phonons in the aforementioned crystals to calculations in the literature reveals nontrivial inaccuracies. Our approaches can be fully automated, making them well suited for both niche systems of interest and high-throughput approaches.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Many-body localization as a large family of localized ground states

Many-body localization (MBL) addresses the absence of thermalization in interacting quantum systems, with nonergodic high-energy eigenstates behaving as ground states, only area-law entangled. However, computing highly excited many-body eigenstates using exact methods is very challenging. Instead, we show that one can address high-energy MBL physics using ground-state methods, which are much more amenable to many efficient algorithms. Here, we find that a localized many-body ground state of a given interacting disordered Hamiltonian H 0 is a very good approximation for a high-energy eigenstate of a parent Hamiltonian, close to H 0 but more disordered. Lastly, this construction relies on computing the covariance matrix, easily achieved using density-matrix renormalization group for disordered Heisenberg chains up to L=256 sites.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗