Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “codes”

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,765 records · Page 98

Aeroelastic code comparison using the IEA 22MW reference turbine

Reference wind turbine designs and the associated aeroelastic models are widely used in both research and industry. Reference models representing future concepts are of particular interest. Current state of the art aeroelastic tools are relied upon to design the next generation of large wind turbines. However, modelling assumptions may be invalidated by upcoming very large turbines, and different aeroelastic tools may give inconsistent results. A 22MW turbine model has been defined as part of International Energy Agency (IEA) Wind Task 55 on Reference Wind Turbines and Farms to represent future turbines to be deployed in the 2030s. In this study, an aeroelastic model of this turbine has been created in four tools; Bladed, HAWC2, OpenFAST, and QBlade. Code comparisons are presented for steady state operation, linear stability analysis, and time domain power production simulations in steady and turbulent wind. Generally, the codes show a good agreement, but with some differences present in the linear stability analysis, periodic azimuthal variation, and time domain simulations. The models are a good basis for further study with the IEA 22MW turbine, and further code comparison exercises.

17 WIND ENERGY↗

Large Eddy Simulation of Wind Turbine Wakes. Detailed Comparisons of Two Codes Focusing on Effects of Numerics and Subgrid Modeling

In this work we report on results from a detailed comparative numerical study from two Large Eddy Simulation (LES) codes using the Actuator Line Model (ALM). The study focuses on prediction of wind turbine wakes and their breakdown when subject to uniform inflow. Previous studies have shown relative insensitivity to subgrid modeling in the context of a finite-volume code. The present study uses the low dissipation pseudo-spectral LES code from Johns Hopkins University (LESGO) and the second-order, finite-volume OpenFOAMcode (SOWFA) from the National Renewable Energy Laboratory. When subject to uniform inflow, the loads on the blades are found to be unaffected by subgrid models or numerics, as expected. The turbulence in the wake and the location of transition to a turbulent state are affected by the subgrid-scale model and the numerics.

17 WIND ENERGY↗

Sensitive and error-tolerant annotation of protein-coding DNA with BATH

We present BATH, a tool for highly sensitive annotation of protein-coding DNA based on direct alignment of that DNA to a database of protein sequences or profile hidden Markov models (pHMMs). BATH is built on top of the HMMER3 code base, and simplifies the annotation workflow for pHMM-based translated sequence annotation by providing a straightforward input interface and easy-to-interpret output. BATH also introduces novel frameshift-aware algorithms to detect frameshift-inducing nucleotide insertions and deletions (indels). BATH matches the accuracy of HMMER3 for annotation of sequences containing no errors, and produces superior accuracy to all tested tools for annotation of sequences containing nucleotide indels. These results suggest that BATH should be used when high annotation sensitivity is required, particularly when frameshift errors are expected to interrupt protein-coding regions, as is true with long-read sequencing data and in the context of pseudogenes.

59 BASIC BIOLOGICAL SCIENCES↗

A new moment-based general-relativistic neutrino-radiation transport code: Methods and first applications to neutron star mergers

ABSTRACT We present a new moment-based energy-integrated neutrino transport code for neutron star merger simulations in general relativity. In the merger context, ours is the first code to include Doppler effects at all orders in υ/c, retaining all non-linear neutrino–matter coupling terms. The code is validated with a stringent series of tests. We show that the inclusion of full neutrino–matter coupling terms is necessary to correctly capture the trapping of neutrinos in relativistically moving media, such as in differentially rotating merger remnants. We perform preliminary simulations proving the robustness of the scheme in simulating ab-initio mergers to black hole collapse and long-term neutron star remnants up to ${\sim }70\,$ ms. The latter is the longest dynamical space-time, 3D, general relativistic simulations with full neutrino transport to date. We compare results obtained at different resolutions and using two different closures for the moment scheme. We do not find evidences of significant out-of-thermodynamic equilibrium effects, such as bulk viscosity, on the post-merger dynamics or gravitational wave emission. Neutrino luminosities and average energies are in good agreement with theory expectations and previous simulations by other groups using similar schemes. We compare dynamical and early wind ejecta properties obtained with M1 and with our older neutrino treatment. We find that the M1 results have systematically larger proton fractions. However, the differences in the nucleosynthesis yields are modest. This work sets the basis for future detailed studies spanning a wider set of neutrino reactions, binaries, and equations of state.

79 ASTRONOMY AND ASTROPHYSICS↗

The cis-regulatory codes of response to combined heat and drought stress in Arabidopsis thaliana

Abstract Plants respond to their environment by dynamically modulating gene expression. A powerful approach for understanding how these responses are regulated is to integrate information about cis-regulatory elements (CREs) into models called cis-regulatory codes. Transcriptional response to combined stress is typically not the sum of the responses to the individual stresses. However, cis-regulatory codes underlying combined stress response have not been established. Here we modeled transcriptional response to single and combined heat and drought stress in Arabidopsis thaliana. We grouped genes by their pattern of response (independent, antagonistic and synergistic) and trained machine learning models to predict their response using putative CREs (pCREs) as features (median F-measure = 0.64). We then developed a deep learning approach to integrate additional omics information (sequence conservation, chromatin accessibility and histone modification) into our models, improving performance by 6.2%. While pCREs important for predicting independent and antagonistic responses tended to resemble binding motifs of transcription factors associated with heat and/or drought stress, important synergistic pCREs resembled binding motifs of transcription factors not known to be associated with stress. These findings demonstrate how in silico approaches can improve our understanding of the complex codes regulating response to combined stress and help us identify prime targets for future characterization.

Azodi, Christina B.↗

Why don't we share data and code? Perceived barriers and benefits to public archiving practices

The biological sciences community is increasingly recognizing the value of open, reproducible and transparent research practices for science and society at large. Despite this recognition, many researchers fail to share their data and code publicly. This pattern may arise from knowledge barriers about how to archive data and code, concerns about its reuse, and misaligned career incentives. Here, we define, categorize and discuss barriers to data and code sharing that are relevant to many research fields. We explore how real and perceived barriers might be overcome or reframed in the light of the benefits relative to costs. By elucidating these barriers and the contexts in which they arise, we can take steps to mitigate them and align our actions with the goals of open science, both as individual scientists and as a scientific community.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Multispin Clifford codes for angular momentum errors in spin systems

The physical symmetries of a system play a central role in quantum error correction. Here, in this work we encode a qubit in a collection of systems with angular momentum symmetry (spins), extending the tools developed by Gross for single large spins. By considering large spins present in atomic systems and focusing on their collective symmetric subspace, we develop codes with octahedral symmetry capable of correcting errors up to second order in angular momentum operators. These errors include the most physically relevant noise sources such as microwave control errors and optical pumping. We additionally explore qubit codes that exhibit distance scaling commensurate with the surface code while permitting transversal single-qubit Clifford operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Restricted Boltzmann machines and matrix product states of one-dimensional translationally invariant stabilizer codes

We discuss the relations between restricted Boltzmann machine (RBM) states and the matrix product states (MPS) for the ground states of 1D translational invariant stabilizer codes. A generic translational invariant and finitely connected RBM state can be expressed as an MPS, and the matrices of the resulting MPS are of rank 1. We dub such an MPS as an RBM-MPS. This provides a necessary condition for exactly realizing a quantum state as an RBM state, if the quantum state can be written as an MPS. For generic 1D stabilizer codes having a nondegenerate ground state with periodic boundary condition, we obtain an expression for the lower bound of their MPS bond dimension, and an upper bound for the rank of their MPS matrices. In terms of RBM, we provide an algorithm to derive the RBM for the cocycle Hamiltonians whose MPS matrices are proved to be of rank 1. Moreover, the RBM-MPS produced by our algorithm has the minimal bond dimension. A family of examples is provided to explain the algorithm. Furthermore, we finally conjecture that these features hold true for all the 1D stabilizer codes having a nondegenerate ground state with periodic boundary condition, as long as their MPS matrices are of rank 1.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Production of energetic light fragments in extensions of the CEM and LAQGSM event generators of the Monte Carlo transport code MCNP6 [Production of energetic light fragments in CEM, LAQGSM, and MCNP6]

We extend the cascade-exciton model (CEM), and the Los Alamos version of the quark-gluon string model (LAQGSM), event generators of the Monte Carlo N-particle transport code version 6 (MCNP6), to describe production of energetic light fragments (LF) heavier than 4 He from various nuclear reactions induced by particles and nuclei at energies up to about 1 TeV/nucleon. In these models, energetic LF can be produced via Fermi breakup, preequilibrium emission, and coalescence of cascade particles. Initially, we study several variations of the Fermi breakup model and choose the best option for these models. Then, we extend the modified exciton model (MEM) used by these codes to account for a possibility of multiple emission of up to 66 types of particles and LF (up to 28 Mg) at the preequilibrium stage of reactions. Then, we expand the coalescence model to allow coalescence of LF from nucleons emitted at the intranuclear cascade stage of reactions and from lighter clusters, up to fragments with mass numbers A ≤ 7, in the case of CEM, and A ≤ 12, in the case of LAQGSM. Next, we modify MCNP6 to allow calculating and outputting spectra of LF and heavier products with arbitrary mass and charge numbers. The improved version of CEM is implemented into MCNP6. Lastly, we test the improved versions of CEM, LAQGSM, and MCNP6 on a variety of measured nuclear reactions. The modified codes give an improved description of energetic LF from particle- and nucleus-induced reactions; showing a good agreement with a variety of available experimental data. They have an improved predictive power compared to the previous versions and can be used as reliable tools in simulating applications involving such types of reactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Code package for calculating modified cosmic ionization and thermal histories with dark matter and other exotic energy injections

Here we present a new public Python package, DarkHistory, for computing the effects of dark matter annihilation and decay on the temperature and ionization history of the early universe. DarkHistory simultaneously solves for the evolution of the free electron fraction and gas temperature, and for the cooling of annihilation/decay products and the secondary particles produced in the process. Consequently, we can self-consistently include the effects of both astrophysical and exotic sources of heating and ionization, and automatically take into account backreaction, where modifications to the ionization/temperature history in turn modify the energy-loss processes for injected particles. We introduce a number of worked examples, demonstrating how to use the code in a range of different configurations, in particular for arbitrary dark matter masses and annihilation/decay final states. Possible applications of DarkHistory include mapping out the effects of dark matter annihilation/decay on the global 21 cm signal and the epoch of reionization, as well as the effects of exotic energy injections other than dark matter annihilation/decay. The code is available at https://github.com/hongwanliu/DarkHistory with documentation at https://darkhistory.readthedocs.io. Data files required to run the code can be downloaded at https://doi.org/10.7910/DVN/DUOUWA.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamics of genetic code evolution: The emergence of universality

We study the dynamics of genetic code evolution. The model of Vetsigian et al. [Proc. Natl. Acad. Sci. USA 103, 10696 (2006)] and Vetsigian [Collective evolution of biological and physical systems, Ph.D. thesis, 2005] uses the mechanism of horizontal gene transfer to demonstrate convergence of the genetic code to a near universal solution. We reproduce and analyze the algorithm as a dynamical system. All the parameters used in the model are varied to assess their impact on convergence and optimality score. We show that by allowing specific parameters to vary with time, the solution exhibits attractor dynamics. Finally, we study automorphisms of the genetic code arising due to this model. We use this to examine the scaling of the solutions to re-examine universality and find that there is a direct link to mutation rate.

59 BASIC BIOLOGICAL SCIENCES↗

Flag Gadgets Based on Classical Codes

Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024

Anker, Benjamin↗

Modeling betatron radiation using particle-in-cell codes for plasma wakefield accelerator diagnostics

The analysis of plasma wakefield acceleration experimental measurements, particularly in the characterization of photons emitted through the betatron radiation mechanism, requires the development of accurate numerical models. These computational models are crucial for supporting modern instrumentation designed to measure the single-shot, double-differential angular-energy radiation spectra resulting from interactions between beams and plasmas. Motivated by the needs of such applications, this paper presents detailed numerical models of betatron radiation generated in beam-plasma acceleration experiments. These models are based on the integration of the Liénard-Wiechert (LW) potentials, applied to computed particle trajectories. The particle trajectories are generated using three distinct methods: first, by tracking particles through idealized fields in the blowout regime of PWFA; second, by obtaining trajectories using the fast quasistatic particle-in-cell (PIC) code quickpic; and third, obtaining trajectories from the fully self-consistent PIC code osiris. To ensure the accuracy and reliability of these models, the paper includes various benchmark tests using analytical expressions, as well as employing the PIC code epoch, which takes an alternative approach by using a Monte Carlo quantum electrodynamics (QED)-based radiation model. Additionally, the paper presents simulations of the expected experimental betatron radiation spectra, taking into account parameters relevant to PWFA and plasma photocathode experiments at the SLAC FACET-II facility.

Yadav, M. [University of California, Los Angeles, ↗

HipGISAXS : a high-performance computing code for simulating grazing-incidence X-ray scattering data

This article describes the development of a flexible grazing-incidence small-angle X-ray scattering (GISAXS) simulation code in the framework of the distorted wave Born approximation that effectively utilizes the parallel processing power provided by graphics processors and multicore processors. The code, entitled High-Performance GISAXS , computes the GISAXS image for any given superposition of user-defined custom shapes or morphologies in a material and for various grazing-incidence angles and sample orientations. These capabilities permit treatment of a wide range of possible sample structures, including multilayered polymer films and nanoparticles on top of or embedded in a substrate or polymer film layers. In cases where the material displays regions of significant refractive index contrast, an algorithm has been implemented to perform a slicing of the sample and compute the averaged refractive index profile to be used as the reference geometry of the unperturbed system. A number of case studies are presented, which demonstrate good agreement with the experimental data for a variety of polymer and hybrid polymer/nanoparticle composite materials. The parallelized simulation code is well suited for addressing the analysis efforts required by the increasing amounts of GISAXS data being produced by high-speed detectors and ultrafast light sources.

Chemistry↗

The FEFF code

FEFF is a real-space multiple-scattering Green’s function code for simulating a variety of X-ray spectroscopies as well as ground-state and excited-state electronic structure. It is perhaps best known for its use in extended X-ray absorption fine-structure (EXAFS) calculations, particularly within various analysis codes such as DEMETER and LARCH. In addition to EXAFS, FEFF can also be used to calculate X-ray absorption near-edge structure (XANES), X-ray emission spectroscopy (XES), electron energy loss spectra (EELS) and many other spectroscopic quantities. Here, the basic approach used for the calculations is described, focusing on the most important approximations and aspects of the simulations. Here, the capabilities of the FEFF code, including those of the Java-based graphical user interface JFEFF, are also briefly described.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Real-time Implementation of Grid Code Compliant Grid Edge Energy Management System

Integrated distributed energy resources (DER) in a distribution system need to follow grid codes to avoid violations that result in DER/circuit segment disconnection. To comply with grid code requirements at the grid edge level, network constrained grid edge energy management system (EMS) can be deployed. The objective of grid edge EMS is to provide economic solution for active and reactive power DER setpoints at each dispatch interval and ensure voltage regulation to support secure interconnection of the grid edge segment to the distribution system with multiple inverter based DER units. In this work, real-time simulation of grid code compliant grid edge EMS is deployed in a realistic feeder circuit segment. For real-time simulation, communication between the grid edge EMS and DERs is done exploiting IEC 61850-7-420. It enables interoperability among different DERs and grid edge EMS. No prior art has deployed IEC 61850-7-420 GOOSE communication protocol for grid edge EMS. Conversion of IEC 61850 GOOSE messages to Modbus communication protocol is also performed to communicate with grid edge EMS in commodity-off the shelf embedded boards in this work. The real-time simulation in OPAL-RT real-time digital simulator shows the out-performance of grid edge EMS by reducing the voltage violation in the distribution circuit.

Energy management system↗

Visualization and Analysis Requirements for In Situ Processing for a Large-Scale Fusion Simulation Code

In situ techniques have become a very active research area since they have been shown to be an effective way to combat the issues associated with the ever growing gap between computation and I/O bandwidth. In order to take full advantage of in situ techniques with a large-scale simulation code, it is critical to understand the breadth and depth of its analysis requirements. In this paper, we present the results of a survey done with members of the XGC1 fusion simulation code team in order to gather their requirements for analysis and visualization. We look at these requirements from the perspective of in situ processing and present a list of XGC1 analysis tasks performed by its physicists, engineers, and visualization specialists. This analysis of the specific needs and use cases of a single code is important in understanding the nature of the needs that simulations have in terms of data movement and usage for visualization and analysis, now and in the future.

Kress, James M.↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗