Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computers”

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,117 records · Page 62

COMPILE: a GWAS computational pipeline for gene discovery in complex genomes

Abstract Background Genome-Wide Association Studies (GWAS) are used to identify genes and alleles that contribute to quantitative traits in large and genetically diverse populations. However, traits with complex genetic architectures create an enormous computational load for discovery of candidate genes with acceptable statistical certainty. We developed a streamlined computational pipeline for GWAS (COMPILE) to accelerate identification and annotation of candidate maize genes associated with a quantitative trait, and then matches maize genes to their closest rice and Arabidopsis homologs by sequence similarity. Results COMPILE executed GWAS using a Mixed Linear Model that incorporated, without compression, recent advancements in population structure control, then linked significant Quantitative Trait Loci (QTL) to candidate genes and RNA regulatory elements contained in any genome. COMPILE was validated using published data to identify QTL associated with the traits of α-tocopherol biosynthesis and flowering time, and identified published candidate genes as well as additional genes and non-coding RNAs. We then applied COMPILE to 274 genotypes of the maize Goodman Association Panel to identify candidate loci contributing to resistance of maize stems to penetration by larvae of the European Corn Borer ( Ostrinia nubilalis ). Candidate genes included those that encode a gene of unknown function, WRKY and MYB-like transcriptional factors, receptor-kinase signaling, riboflavin synthesis, nucleotide-sugar interconversion, and prolyl hydroxylation. Expression of the gene of unknown function has been associated with pathogen stress in maize and in rice homologs closest in sequence identity. Conclusions The relative speed of data analysis using COMPILE allowed comparison of population size and compression. Limitations in population size and diversity are major constraints for a trait and are not overcome by increasing marker density. COMPILE is customizable and is readily adaptable for application to species with robust genomic and proteome databases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Constant-depth circuits for dynamic simulations of materials on quantum computers

Abstract Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible simulations to short-time dynamics. Here, we present a method for generating circuits that are constant in depth with increasing simulation time for a specific subset of one-dimensional (1D) materials Hamiltonians, thereby enabling simulations out to arbitrarily long times. Furthermore, by removing the effective limit on the number of feasibly simulatable time-steps, the constant-depth circuits enable Trotter error to be made negligibly small by allowing simulations to be broken into arbitrarily many time-steps. For an N -spin system, the constant-depth circuit contains only $\mathcal {O}(N^{2})$ O ( N 2 ) CNOT gates. Such compact circuits enable us to successfully execute long-time dynamic simulation of ubiquitous models, such as the transverse field Ising and XY models, on current quantum hardware for systems of up to 5 qubits without the need for complex error mitigation techniques. Aside from enabling long-time dynamic simulations with minimal Trotter error for a specific subset of 1D Hamiltonians, our constant-depth circuits can advance materials simulations on quantum computers more broadly in a number of indirect ways.

Materials simulation↗

Numerical simulations of noisy quantum circuits for computational chemistry

The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of sodium hydride using the variational quantum eigensolver algorithm. We show how relative error in the energy and the fidelity scale with the levels of gate-based noise, the internuclear configuration, the ansatz circuit depth, and the parameter optimization methods.

36 MATERIALS SCIENCE↗

Graph link prediction in computer networks using Poisson matrix factorisation

Graph link prediction is an important task in cybersecurity: relationships between entities within a computer network, such as users interacting with computers or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article PMF is extended to include scenarios that are commonly encountered in cybersecurity applications. Specifically, an extension is proposed to explicitly handle binary adjacency matrices and include known categorical covariates associated with the graph nodes. A seasonal PMF model is also presented to handle seasonal networks. To allow the methods to scale to large graphs, variational methods are discussed for performing fast inference. The results show an improved performance over the standard PMF model and other statistical network models.

97 MATHEMATICS AND COMPUTING↗

Scientific Computational Imaging Code (SCICO)

Scientific Computational Imaging Code (SCICO) is a Python package for solving the inverse problems that arise in scientific imaging applications. Its primary focus is providing methods for solving ill-posed inverse problems by using an appropriate prior model of the reconstruction space. SCICO includes a growing suite of operators, cost functionals, regularizers, and optimization routines that may be combined to solve a wide range of problems, and is designed so that it is easy to add new building blocks. SCICO is built on top of JAX rather than NumPy, enabling GPU/TPU acceleration, just-in-time compilation, and automatic gradient functionality, which is used to automatically compute the adjoints of linear operators. An example of how to solve a multi-channel tomography problem with SCICO is shown in Figure 1. The SCICO source code is available from GitHub, and pre-built packages are available from PyPI. It has extensive online documentation, including API documentation and usage examples, which can be run online at Google Colab and binder.

97 MATHEMATICS AND COMPUTING↗

Lightshow: a Python package for generating computational x-ray absorption spectroscopy input files

First-principles computational spectroscopy is a critical tool for interpreting experiment, per- forming structure refinement, and developing new physical understanding. Systematically setting up input files for different simulation codes and a diverse class of materials is a challeng- ing task with a very high barrier-to-entry, given the complexities and nuances of each individual simulation package. This task is non-trivial even for experts in the electronic structure field and nearly formidable for non-expert researchers. Lightshow solves this problem by providing a uniform abstraction for writing computational x-ray spectroscopy input files for multiple popular codes, including FEFF, VASP, OCEAN, exciting and XSpectra. Its extendable framework will also allow the community to easily add new functions and to incorporate new simulation codes.

36 MATERIALS SCIENCE↗

Advanced Methods for Immersed Domain Multi-physics Computations

This is the final report on the project, and describes the main accomplishments in the development of the Shifted Boundary Method (SBM), a new computational framework for embedded/immersed computational mechanics applications.

97 MATHEMATICS AND COMPUTING↗

A Computational-experimental Study to Simulate Mixing and Thermal Stratification in SFRs

This NEUP project 16-10579 entitled “A Computational-Experimental Study to Simulate Mixing and Thermal Stratification in SFRs”, has investigated important phenomena of thermal stratification and mixing in Sodium-cooled Faster reactors (SFRs). A liquid metal experimental set-up was built at Kansas State University to generate high fidelity experimental data and validate computational models. The scope of the work involved - scaled down design of experimental facility, construction and commissioning of the new facility, conducting thermal-hydraulics experiments relevant to the physics of thermal stratification and mixing in the plena, developing 3D CFD models of the experiments, developing SAS4A/SASSYS-1 system model of the liquid metal experimental facility , survey of previous data in literature on stratification experiments and recommendations for improved models.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Livermore Computing Integrates Advanced Cognitive Simulation Resource

With the integration of the first production Cerebras CS-1 system into Lassen, Livermore Computing (LC) is preparing the way for advanced cognitive simulation (CogSim) capabilities integrated into leadership HPC systems to support Artificial Intelligence (AI) driven computational needs of the Stockpile Stewardship Program.

97 MATHEMATICS AND COMPUTING↗

Analysis of FFT Run-Times on LANL Computers

This paper gives results of a timing study for computing fast Fourier transforms (FFTs) on LANL based computing platforms. The platforms considered will be a node on Snow and a standard LANL HP laptop. The run-time for 1D FFTs will be measured for different sizes of data and the results are reported in FFTs/s.

97 MATHEMATICS AND COMPUTING↗

Computation and illustration of the generalized order restricted criterion (GORIC) for shape constrained spline functions

The selection of a model among alternative models that include inequality constraints is a complex task. The generalized order restricted criterion (GORIC) is a suitable approach to do so. However, the GORIC proves challenging to compute in the general case. This report discusses a number of methods to compute the GORIC and illustrates its use with a didactic example.

97 MATHEMATICS AND COMPUTING↗

Computational Modeling To Adapt Neutralizing Antibody

Monoclonal antibodies (mAbs) is the leading therapy for viral infections because it provides immediate protection and can be administered at higher levels than in a natural immune response. Finding mAbs that neutralize a broad spectrum of viral targets has proven difficult because many species and strains exist and blanket targeting is a slow and laborious process to experimentally screen 108 variants. A new method is needed to rapidly redesign mAbs for homologous targets. This project speeds up redesign using structure-based computational design to reduce the mAbs search space to a manageable level and screen mutants at a much higher rate than in experiments. Computation will also provide critical knowledge about the fundamental interactions. The project will adapt S230, a human antibody that neutralizes SARS-CoV, to neutralize SARS-COV-2.

60 APPLIED LIFE SCIENCES↗

Final Reports of the 2020 Los Alamos National Laboratory Computational Physics Student Summer Workshop

For the past ten years, the workshop has been bringing a highly talented and diverse group of student every summer. Students work in teams of two, alongside typically two mentors, on research projects reflecting a broad range of topics within computational physics. In addition, students attend a series of lectures on topics within computational physics, facility tours, and networking events. The program lasts ten weeks, with this year’s workshop running from June 8 to August 14. At the end of the summer, students give a final presentation, along with a written report. Those reports are what make up the remaining sections of this document. Admission to the workshop is by a competitive process, with the mentors forming the selection committee. One of the important accomplishments of the workshop has been to create a student pipeline from diverse schools that sometimes are not normally tapped by LANL recruiting. Many workshop students maintain a continuing relationship with LANL, returning as students interns, post-doctoral researchers, and staff members. Additionally, workshop alumni act as ambassadors for LANL. The result is a wider awareness both of LANL as a potential employer, and of the technical work that happens at LANL. This year, the workshop format was changed in several ways, in order to accommodate the off-site, virtual format. Students worked on LANL virtual desktop systems remotely, also accessing LANL HPC resources. In order to facilitate communication, student were given accounts on both Webex, a video teleconferencing platform, and Mattermost, an online team collaboration and chat platform, similar to Slack. Daily communication between students and mentors was primarily on Mattermost, with Webex conferencing as needed. The lectures were all done on Webex. Given the difficulty of the virtual format, and a concern that students might have video teleconferencing burn-out after an academic semester largely moved to that format, all lectures were optional this year. In spite of this, the attendance was generally high. Lecturers were asked to try to move to a more high-level, ”What is it?,” format. Once again, the students did a tremendous job. Over the course of ten weeks, they did important research across a staggering array of disciplines. The following pages contain the final report for each team’s research efforts. We hope you will find reading them as exciting as it was for us to produce them.

36 MATERIALS SCIENCE↗

Computationally Tractable High-Fidelity Representation of Global Hydrology in ESMs via Machine Learning Approaches to Scale-Bridging

Focal Areas: This paper responds primarily to Focal Area 2, focusing on AI techniques to improve model fidelity. Science Challenge: “Hyperresolution” [1, 2] land surface models (LSMs) running at far higher resolution than typically employed in global Earth system models (ESMs) can help answer critical questions about the water cycle and associated ecosystem and biogeochemical feedbacks. Even with all foreseeable advances in computing power and efficient solver algorithms, however, employing hyperresolution LSMs inside ESMs for studies of long-term global climate is not computationally feasible. Instead, we argue for incorporating the fidelity of hyperresolution LSMs only where and when it is needed by using machine learning approaches to scale-bridging.

54 ENVIRONMENTAL SCIENCES↗

Particle-In-Cell Computer Simulations of Beam Spill in the Scorpius Injector

Computer simulations of beam transport in the Scorpius injector were performed using the particle-in-cell computer code LSP. The simulations were used to predict spot size growth due to electron stimulated emission of ions from beam spill on the anode stalk and the entrance transport region.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Comparing Emulation Methods for Computer Models with High Dimensional Output

This Master’s Capstone project will present a comparison of statistical models for computer simulation studies. The four models included in this comparison study were chosen for both their proven and diverse methodologies. We will present a case study on hurricane flood data in the Delaware bay which highlights the strengths and weaknesses of each model when applied to a very large spatial field. As computers have gotten faster, we have become interested in modeling increasingly large spatial fields in both size and resolution. Statistical algorithms that are able to efficiently handle these fields have never been more important. We therefore find this comparison to be extremely topical.

42 ENGINEERING↗

Domaine-Specific Runtime to Orchestrate Computation on Heterogeneous Platforms

Task-based runtime systems in the past have sought to exploit inherent asynchronicity in the application execution to reduce overall runtime. In the last decade focus shifted to supporting the heterogeneity that is increasingly prevalent in high-performance computing systems. However, existing task-based runtime systems, being general, come with a challenging set of issues such as the complexity of abstractions and overheads. And they still leave much of the burden of exposing the parallelism on the application developers who also have to fit their applications to the runtime systems’ interfaces. In this paper we take a different approach for applications to target heterogeneous systems through domain-specific run-times. Our design aspires to leverage the domain-specific knowledge of a focused class of scientific simulations to pragmatically orchestrate computations in the simulations.

97 MATHEMATICS AND COMPUTING↗