Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 991 records · Page 55

AUTOMATIC MESH ADAPTIVITY FOR CADIS AND FW-CADIS NEUTRONICS MODELING OF DIFFICULT SHIELDING PROBLEMS

The hybrid Monte Carlo/deterministic techniques CADIS and FW-CADIS dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been restricted by the availability of computing resources for their preliminary deterministic calculations and the large computer memory requirements of their final Monte Carlo calculations. Three automatic mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding some maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh from the mesh of the deterministic calculations to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to calculate the prompt dose rate throughout the entire ITER experimental facility. Compared to a FW-CADIS calculation with the same weight window map memory requirement, using the three algorithms resulted in a 23.3% increase in the regions where the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled the accurate performance of this difficult global Monte Carlo calculation, which traditionally needed high performance computing, using a FW-CADIS simulation on a regular computer cluster.

CADIS and FW-CADIS↗

Graphical User Interface Software for Gross Defect Detection at the Atucha-I Plant

At the Atucha-I pressurized heavy water reactor in Argentina, fuel assemblies in the spent fuel pools are stored by suspending them in two vertically stacked layers. This introduces the unique problem of verifying the presence of fuel in either layer without physically moving the fuel assemblies. Movement of fuel, especially from the lower layer, would involve a major effort on the part of the operator. Given that the facility uses both natural uranium and slightly enriched uranium at 0.85 w% {sup 235}U, and has been in operation since 1974, a wide range of burnups and cooling times can exist in any given pool. Additionally, while fuel assemblies are grouped together in a uniform fashion, the packing density from group to group can vary within a single pool. A tool called the Spent Fuel Neutron Counter (SFNC) was developed and successfully tested at the site to verify, in an in-situ condition, the presence of fuel up to burnups of 8,000 MWd/t. Since the neutron source term becomes a nonlinear function of burnup beyond this burnup, a new algorithm was developed to predict expected response from the SFNC at measurement locations covering the entire range of burnups, cooling times, and initial enrichments. With the aid of a static database of parameters including intrinsic sources and energy group-wise detector response functions, as well as explicit spent fuel information including burnups, cooling times, enrichment types, and spacing between fuel assemblies, an expected response for any given location can be calculated by summing the contributions from the relevant neighboring fuel assemblies. Thus, the new algorithm maps the expected responses across the various pools providing inspectors with a visual aid in verifying the presence of the spent fuel assemblies. This algorithm has been fully integrated into a standalone application built in LabVIEW. The GUI uses a step-by-step approach to allow the end-user to first calibrate the predicted database against a set of measurements with SFNC at selected locations where spent fuel is present. Once the database is calibrated it can be used to detect gross defects by comparing the measured signal to the one predicted by the database with differences beyond a set tolerance indicating missing fuel.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Biclique: an R package for maximal biclique enumeration in bipartite graphs

Bipartite graphs are widely used to model relationships between pairs of heterogeneous data types. Maximal bicliques are foundational structures in such graphs, and their enumeration is an important task in systems biology, epidemiology and many other problem domains. Thus, there is a need for an efficient, general purpose, publicly available tool to enumerate maximal bicliques in bipartite graphs. The statistical programming language R is a logical choice for such a tool, but until now no R package has existed for this purpose. Our objective is to provide such a package, so that the research community can more easily perform this computationally demanding task. Biclique is an R package that takes as input a bipartite graph and produces a listing of all maximal bicliques in this graph. Input and output formats are straightforward, with examples provided both in this paper and in the package documentation. Biclique employs a state-of-the-art algorithm previously developed for basic research in functional genomics.

97 MATHEMATICS AND COMPUTING↗

Automated Chemical Analysis of Internally Mixed Aerosol Particles Using X-ray Spectromicroscopy at the Carbon K-Edge

We have developed an automated data analysis method for atmospheric particles using scanning transmission X-ray microscopy coupled with near edge X-ray fine structure spectroscopy (STXM/NEXAFS). This method is applied to complex internally mixed submicron particles containing organic and inorganic material. Several algorithms were developed to exploit NEXAFS spectral features in the energy range from 278-320 eV for quantitative mapping of the spatial distribution of elemental carbon, organic carbon, potassium, and non-carbonaceous elements in particles of mixed composition. This energy range encompasses the carbon K-edge and potassium L2 and L3 edges. STXM/NEXAFS maps of different chemical components were complemented with a subsequent analysis using elemental maps obtained by scanning electron microscopy coupled with energy dispersive X-ray analysis (SEM/EDX). We demonstrate application of the automated mapping algorithms for data analysis and the statistical classification of particles.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Chemical Analysis of Internally Mixed Aerosol Particles Using X-ray Spectromicroscopy at the Carbon K-Edge

We have developed an automated data analysis method for atmospheric particles using scanning transmission X-ray microscopy coupled with near edge X-ray fine structure spectroscopy (STXM/NEXAFS). This method is applied to complex internally mixed submicrometer particles containing organic and inorganic material. Several algorithms were developed to exploit NEXAFS spectral features in the energy range from 278 to 320 eV for quantitative mapping of the spatial distribution of elemental carbon, organic carbon, potassium, and noncarbonaceous elements in particles of mixed composition. This energy range encompasses the carbon K-edge and potassium L2 and L3 edges. STXM/NEXAFS maps of different chemical components were complemented with a subsequent analysis using elemental maps obtained by scanning electron microscopy coupled with energy dispersive X-ray analysis (SEM/EDX). We demonstrate the application of the automated mapping algorithms for data analysis and the statistical classification of particles.

54 ENVIRONMENTAL SCIENCES↗

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller frame-work is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

IEEE Std 2800↗

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources

This study addresses the compliance of Inverter-based Resources (IBRs) with IEEE Standard 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a controller development framework for abnormal grid conditions. This framework caters to maintaining ride-through operation in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller framework is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

grid↗

Extending a Tandem Mass Spectral Library to Include MS{sup 2} Spectra of Fragment Ions Produced In-Source and MS{sup n} Spectra

Tandem mass spectral library searching is finding increased use as an effective means of determining chemical identity in mass spectrometry-based omics studies. We previously reported on constructing a tandem mass spectral library that includes spectra for multiple precursor ions for each analyte. Here we report our method for expanding this library to include MS{sup 2} spectra of fragment ions generated during the ionization process (in-source fragment ions) as well as MS{sup 3} and MS{sup 4} spectra. These can assist the chemical identification process. A simple density-based clustering algorithm was used to cluster all significant precursor ions from MS{sup 1} scans for an analyte acquired during an infusion experiment. The MS{sup 2} spectra associated with these precursor ions were grouped into the same precursor clusters. Subsequently, a new top-down hierarchical divisive clustering algorithm was developed for clustering the spectra from fragmentation of ions in each precursor cluster, including the MS{sup 2} spectra of the original precursors and of the in-source fragments as well as the MS{sup n} spectra. This algorithm starts with all the spectra of one precursor in one cluster and then separates them into sub-clusters of similar spectra based on the fragment patterns. Herein, we describe the algorithms and spectral evaluation methods for extending the library. The new library features were demonstrated by searching the high resolution spectra of E. coli extracts against the extended library, allowing identification of compounds and their in-source fragment ions in a manner that was not possible before. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Automatic mesh adaptivity for CADIS and FW-CADIS neutronics modeling of difficult shielding problems

The CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been limited by the large number of processors and memory requirements for their preliminary deterministic calculations and final Monte Carlo calculation. Three mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macro-material approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm de-couples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility. Using these algorithms resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled this difficult calculation to be accurately solved using an FW-CADIS simulation on a regular computer cluster, obviating the need for a world-class super computer. (authors)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

RSVP - Flu Like Illness and Respiratory Syndromes COVID-19 Syndromic Reporting Tool Prototype

Individuals infected with SARS-CoV-2, the virus that causes COVID-19, may be infectious between 1-3 days prior to symptom onset. People may delay seeking medical care after symptom development due to multiple determinants of health seeking behavior like availability of testing, accessibility of providers, and ability to pay. Therefore, understanding symptoms in the general public is important to better predict and inform resource management plans and engage in reopening. As the influenza season looms, the ability to differentiate between clinical presentation of COVID-19 and seasonal influenza will also be important to health providers and public health response efforts. This project has developed an algorithm that when used with captured syndromic trends can help provide both differentiation to various influenza-like illnesses (ILI) as well as provide public health decision makers a better understanding regarding spatial and temporal trends. This effort has also developed a web-based tool to allow for the capturing of generalized syndromic trends and provide both spatial and temporal outputs on these trends. This page left blank

59 BASIC BIOLOGICAL SCIENCES↗

DNS and LES of turbulent flow in a closed channel featuring a pattern of hemispherical roughness elements

Three mesh adaptivity algorithms were developed to facilitate and expedite the use of the CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques in accurate full-scale neutronics simulations of fusion energy systems with immense sizes and complicated geometries. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility and resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation. Additionally, because of the significant increase in the efficiency of FW-CADIS simulations, the three algorithms enabled this difficult calculation to be accurately solved on a regular computer cluster, eliminating the need for a world-class super computer.

Nuclear Science & Technology↗

A Flexible Reservation Algorithm for Advance Network Provisioning

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

Developing IEEE Std 2800-Compliant Algorithms for Transmission-Connected Inverter-Based Resources: Preprint

This study addresses the compliance of Inverter-based Resources (IBRs) with the IEEE Std 2800, a leading standard that defines interconnection and interoperability requirements for IBRs integrated into transmission systems. Focusing on abnormal grid scenarios, the research evaluates the specific demands on IBRs, proposing a comprehensive controller development framework. This framework caters to maintaining ride-trhough operation or implementing strategic disconnections in line with IEEE Std 2800, alongside managing currents during voltage ride-through scenarios. The effectiveness of this proposed controller framework is rigorously validated through case studies, employing a MATLAB/Simulink model of an IBR to test its performance under diverse grid fault conditions, ensuring the IBRs' alignment with standard requirements and their robust performance in enhancing grid reliability.

IEEE Std 2800↗

A method for rapid quantitative assessment of biofilms with biomolecular staining and image analysis

Here, the accumulation of bacteria in surface attached biofilms, or biofouling, can be detrimental to human health, dental hygiene, and many industrial processes. A critical need in identifying and preventing the deleterious effects of biofilms is the ability to observe and quantify their development. Analytical methods capable of assessing early stage fouling are cumbersome or lab-confined, subjective, and qualitative. Herein, a novel photographic method is described that uses biomolecular staining and image analysis to enhance contrast of early stage biofouling. A robust algorithm was developed to objectively and quantitatively measure surface accumulation of Pseudomonas putida from photographs and results were compared to independent measurements of cell density. Results from image analysis quantified biofilm growth intensity accurately and with approximately the same precision of the more laborious cell counting method. This simple method for early stage biofilm detection enables quantifiable measurement of surface fouling and is flexible enough to be applied from the laboratory to the field. Broad spectrum staining highlights fouling biomass, photography quickly captures a large area of interest, and image analysis rapidly quantifies fouling in the image.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum simulations of nuclear resonances with variational methods

Background: The many-body nature of nuclear physics problems poses significant computational challenges. These challenges become even more pronounced when studying the resonance states of nuclear systems, which are governed by the non-Hermitian Hamiltonian. Quantum computing, particularly for quantum many-body systems, offers a promising alternative, especially within the constraints of current noisy intermediate-scale quantum (NISQ) devices. Purpose: This work aims to simulate nuclear resonances using quantum algorithms by developing a variational framework compatible with non-Hermitian Hamiltonians and implementing it fully on a quantum simulator. Methods: We employ the complex scaling technique to extract resonance positions classically and adapt it for quantum simulations using a two-step algorithm. First, we transform the non-Hermitian Hamiltonian into a Hermitian form by using the energy variance as a cost function within a variational framework. Second, we perform 𝜃-trajectory calculations to determine optimal resonance positions in the complex energy plane. To address resource constraints on NISQ devices, we utilize Gray code (GC) encoding to reduce qubit requirements. Results: We first validate our approach using a schematic potential model that mimics a nuclear potential, successfully reproducing known resonance energies with high fidelity. We then extend the method to a more realistic 𝛼−𝛼 nuclear potential and compute the 𝐷- and 𝐺-wave resonance energies with a basis size of 𝑁=16, using only four qubits. The quantum simulation results closely match the classical values, demonstrating the feasibility of our approach. Conclusions: This study demonstrates, for the first time, that the complete 𝜃-trajectory method can be implemented on a quantum computer without relying on any classical input beyond the Hamiltonian. The results establish a scalable and efficient quantum framework for simulating resonance phenomena in nuclear systems. This work represents a significant step toward quantum simulations of open quantum systems and lays the foundation for future investigations into resonance structures in nuclear, atomic, and molecular physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers

The design and implementation of a new framework for adaptive mesh refinement calculations are described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both nonrelativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

Progress on Associate-Particle Imaging Algorithms, 2020

The present work describes progress on the development of imaging algorithms that use fast neutron signatures acquired using the associated-particle imaging (API) method. The present work complements ongoing work to develop neutron source and detector hardware to enable field inspection by investigating algorithms that are capable of discriminating between critical materials or extracting three-dimensional geometrical information from single-sided or transmission measurements. The present work is divided into three approaches:(1)Iterative reconstruction of inelastic gamma-ray emissions to perform three-dimensional time-of-flight imaging in a single view in either transmission or backscatter configurations. Iterative reconstruction enables image resolution better than the inherent TOF resolution.(2)Decomposition of registered neutron and x ray radiographs into an assumed material list for each pixel in the image.(3)Material identification using full spectral analysis that includes the emergent neutron and gamma ray energies, times, and angles.Progress for each approach is summarized for fiscal year 2020.

97 MATHEMATICS AND COMPUTING↗

A Novel Algorithm for Solving the Multidimensional Neutron Transport Equation on Massively Parallel Architectures

We employ the Integral Transport Matrix Method (ITMM) as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells' fluxes and between the cells' and boundary surfaces' fluxes. The main goals of this work are to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and parallel performance of the developed methods with increasing number of processes, P. The fastest observed parallel solution method, Parallel Gauss-Seidel (PGS), was used in a weak scaling comparison with the PARTISN transport code, which uses the source iteration (SI) scheme parallelized with the Koch-baker-Alcouffe (KBA) method. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method- even without acceleration/preconditioning-is completitive for optically thick problems as P is increased to the tens of thousands range. For the most optically thick cells tested, PGS reduced execution time by an approximate factor of three for problems with more than 130 million computational cells on P = 32,768. Moreover, the SI-DSA execution times's trend rises generally more steeply with increasing P than the PGS trend. Furthermore, the PGS method outperforms SI for the periodic heterogeneous layers (PHL) configuration problems. The PGS method outperforms SI and SI-DSA on as few as P = 16 for PHL problems and reduces execution time by a factor of ten or more for all problems considered with more than 2 million computational cells on P = 4.096.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗