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

Application of stochastic weighted algorithms to a multidimensional silica particle model

Highlights: •Stochastic weighted algorithms (SWAs) are developed for a detailed silica model. •An implementation of SWAs with the transition kernel is presented. •The SWAs’ solutions converge to the direct simulation algorithm’s (DSA) solution. •The efficiency of SWAs is evaluated for this multidimensional particle model. •It is shown that SWAs can be used for coagulation problems in industrial systems. -- Abstract: This paper presents a detailed study of the numerical behaviour of stochastic weighted algorithms (SWAs) using the transition regime coagulation kernel and a multidimensional silica particle model. The implementation in the SWAs of the transition regime coagulation kernel and associated majorant rates is described. The silica particle model of Shekar et al. [S. Shekar, A.J. Smith, W.J. Menz, M. Sander, M. Kraft, A multidimensional population balance model to describe the aerosol synthesis of silica nanoparticles, Journal of Aerosol Science 44 (2012) 83–98] was used in conjunction with this coagulation kernel to study the convergence properties of SWAs with a multidimensional particle model. High precision solutions were calculated with two SWAs and also with the established direct simulation algorithm. These solutions, which were generated using large number of computational particles, showed close agreement. It was thus demonstrated that SWAs can be successfully used with complex coagulation kernels and high dimensional particle models to simulate real-world systems.

97 MATHEMATICS AND COMPUTING↗

Fourier-spectral element approximation of the ion–electron Braginskii system with application to tokamak edge plasma in divertor configuration

Due to the extreme conditions required to produce energy by nuclear fusion in tokamaks, simulating the plasma behavior is an important but challenging task. We focus on the edge part of the plasma, where fluid approaches are probably the best suited, and our approach relies on the Braginskii ion–electron model. Assuming that the electric field is electrostatic, this yields a set of 10 strongly coupled and non-linear conservation equations that exhibit multiscale and anisotropy features. The computational domain is a torus of complex geometrical section, that corresponds to the divertor configuration, i.e. with an “X-point” in the magnetic surfaces. To capture the complex physics that is involved, high order methods are used: The time-discretization is based on a Strang splitting, that combines implicit and explicit high order Runge–Kutta schemes, and the space discretization makes use of the spectral element method in the poloidal plane together with Fourier expansions in the toroidal direction. The paper thoroughly describes the algorithms that have been developed, provides some numerical validations of the key algorithms and exhibits the results of preliminary numerical experiments. In particular, we point out that the highest frequency of the system is intermediate between the ion and electron cyclotron frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

We propose an unsupervised machine-learning checkpoint-restart (CR) algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM). The algorithm compresses the particle population per spatial cell by constructing a velocity distribution function using GM. Particles are reconstructed at restart time by local resampling of the Gaussians. To guarantee fidelity of the CR process, we ensure the exact preservation of invariants such as charge, momentum, and energy for both compression and reconstruction stages, everywhere on the mesh. We also ensure the preservation of Gauss' law after particle reconstruction by exactly matching the density profile at restart time. As a result, the GM CR algorithm is shown to provide a clean, conservative restart capability while potentially affording orders of magnitude savings in input/output requirements. Here, we demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm using both electrostatic and electromagnetic tests. The tests demonstrate not only a high-fidelity CR capability, but also its potential for enhancing the fidelity of the PIC solution for a given particle resolution.

97 MATHEMATICS AND COMPUTING↗

A BAYESIAN APPROACH TO LOCATING THE RED GIANT BRANCH TIP MAGNITUDE. I

We present a new approach for identifying the tip of the red giant branch (TRGB) which, as we show, works robustly even on sparsely populated targets. Moreover, the approach is highly adaptable to the available data for the stellar population under study, with prior information readily incorporable into the algorithm. The uncertainty in the derived distances is also made tangible and easily calculable from posterior probability distributions. We provide an outline of the development of the algorithm and present the results of tests designed to characterize its capabilities and limitations. We then apply the new algorithm to three M31 satellites: Andromeda I, Andromeda II, and the fainter Andromeda XXIII, using data from the Pan-Andromeda Archaeological Survey (PAndAS), and derive their distances as 731{sup (+5)+18}{sub (-4)-17} kpc, 634{sup (+2)+15}{sub (-2)-14} kpc, and 733{sup (+13)+23}{sub (-11)-22} kpc, respectively, where the errors appearing in parentheses are the components intrinsic to the method, while the larger values give the errors after accounting for additional sources of error. These results agree well with the best distance determinations in the literature and provide the smallest uncertainties to date. This paper is an introduction to the workings and capabilities of our new approach in its basic form, while a follow-up paper shall make full use of the method's ability to incorporate priors and use the resulting algorithm to systematically obtain distances to all of M31's satellites identifiable in the PAndAS survey area.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-D-17A-02: Four-Dimensional CBCT Using Conventional CBCT Dataset and Iterative Subtraction Algorithm of a Lung Patient

Purpose: The Iterative Subtraction Algorithm (ISA) method generates retrospectively a pre-selected motion phase cone-beam CT image from the full motion cone-beam CT acquired at standard rotation speed. This work evaluates ISA method with real lung patient data. Methods: The goal of the ISA algorithm is to extract motion and no- motion components form the full reconstruction CBCT. The workflow consists of subtracting from the full CBCT all of the undesired motion phases and obtain a motion de-blurred single-phase CBCT image, followed by iteration of this subtraction process. ISA is realized as follows: 1) The projections are sorted to various phases, and from all phases, a full reconstruction is performed to generate an image CTM. 2) Generate forward projections of CTM at the desired phase projection angles, the subtraction of projection and the forward projection will reconstruct a CTSub1, which diminishes the desired phase component. 3) By adding back the CTSub1 to CTm, no motion CBCT, CTS1, can be computed. 4) CTS1 still contains residual motion component. 5) This residual motion component can be further reduced by iteration.The ISA 4DCBCT technique was implemented using Varian Trilogy accelerator OBI system. To evaluate the method, a lung patient CBCT dataset was used. The reconstruction algorithm is FDK. Results: The single phase CBCT reconstruction generated via ISA successfully isolates the desired motion phase from the full motion CBCT, effectively reducing motion blur. It also shows improved image quality, with reduced streak artifacts with respect to the reconstructions from unprocessed phase-sorted projections only. Conclusion: A CBCT motion de-blurring algorithm, ISA, has been developed and evaluated with lung patient data. The algorithm allows improved visualization of a single phase motion extracted from a standard CBCT dataset. This study has been supported by National Institute of Health through R01CA133539.

60 APPLIED LIFE SCIENCES↗

Analysis on linac quadrupole misalignment in FACET commissioning 2012

In this note, the analysis on linac quadrupole misalignment is presented for the FACET linac section LI05-09 plus LI11-19. The effectiveness of the beam-based alignment technique is preliminarily confirmed by the measurement. Beam-based alignment technique was adopted at SLAC linac since SLC time. Here the beam-based alignment algorithms are further developed and applied in the FACET commissioning during 2012 run.

43 PARTICLE ACCELERATORS↗

Identifying and Explaining Anomalous Activity in Surveillance Video with Compression Algorithms

The primary purpose of this document is to outline the progress made on the LDRD titled “Identifying and Explaining Anomalous Activity in Surveillance Video with Compression Algorithms” in FY22 and FY23. In this LDRD, we explored the usage of compression-based analytics to identify anomalous activity in video. We developed a novel algorithm, Spatio-Temporal N-Gram PPM (STNG PPM) that accounts for spatially and temporally aware anomalies in video. We extracted features using motions vectors from video as well as operating on the raw features. STNG PPM is comparable to many deep learning approaches but does not require specialized hardware (GPUs) to run efficiently. We also examine the evaluation metrics and propose novel measures addressing faults in the current evaluation measures.

97 MATHEMATICS AND COMPUTING↗

VERIFICATION & VALIDATION OF A SEMANTIC IMAGE TAGGING FRAMEWORK VIA GENERATION OF GEOSPATIAL IMAGERY GROUND TRUTH

As a result of increasing geospatial image libraries, many algorithms are being developed to automatically extract and classify regions of interest from these images. However, limited work has been done to compare, validate and verify these algorithms due to the lack of datasets with high accuracy ground truth annotations. In this paper, we present an approach to generate a large number of synthetic images accompanied by perfect ground truth annotation via learning scene statistics from few training images through Maximum Entropy (ME) modeling. The ME model [1,2] embeds a Stochastic Context Free Grammar (SCFG) to model object attribute variations with Markov Random Fields (MRF) with the final goal of modeling contextual relations between objects. Using this model, 3D scenes are generated by configuring a 3D object model to obey the learned scene statistics. Finally, these plausible 3D scenes are captured by ray tracing software to produce synthetic images with the corresponding ground truth annotations that are useful for evaluating the performance of a variety of image analysis algorithms.

Markov Random Field (MRF)↗

On the Design, Development, and Analysis of Optimized Matrix-Vector Multiplication Routines for Coprocessors

The manycore paradigm shift, and the resulting change in modern computer architectures, has made the development of optimal numerical routines extremely challenging. In this work, we target the development of numerical algorithms and implementations for Xeon Phi coprocessor architecture designs. In particular, we examine and optimize the general and symmetric matrix-vector multiplication routines (gemv/symv), which are some of the most heavily used linear algebra kernels in many important engineering and physics applications. We describe a successful approach on how to address the challenges for this problem, starting with our algorithm design, performance analysis and programing model and moving to kernel optimization. Our goal, by targeting low-level and easy to understand fundamental kernels, is to develop new optimization strategies that can be effective elsewhere for use on manycore coprocessors, and to show significant performance improvements compared to existing state-of-the-art implementations. Therefore, in addition to the new optimization strategies, analysis, and optimal performance results, we finally present the significance of using these routines/strategies to accelerate higher-level numerical algorithms for the eigenvalue problem (EVP) and the singular value decomposition (SVD) that by themselves are foundational for many important applications.

Kabir, Khairul↗

Terascale Optimal PDE Simulations

The Terascale Optimal PDE Solvers (TOPS) Integrated Software Infrastructure Center (ISIC) was created to develop and implement algorithms and support scientific investigations performed by DOE-sponsored researchers. These simulations often involve the solution of partial differential equations (PDEs) on terascale computers. The TOPS Center researched, developed and deployed an integrated toolkit of open-source, optimal complexity solvers for the nonlinear partial differential equations that arise in many DOE application areas, including fusion, accelerator design, global climate change and reactive chemistry. The algorithms created as part of this project were also designed to reduce current computational bottlenecks by orders of magnitude on terascale computers, enabling scientific simulation on a scale heretofore impossible.

97 MATHEMATICS AND COMPUTING↗

Bayesian computational approaches for gene regulation studies of bioethanol and biohydrogen production

It has recently become clear that regulatory RNAs play a major role in regulation of gene expression in bacteria. RNA secondary structures play a major role in the function of many regulatory RNAs, and structural features are often key to their interaction with other cellular components. Thus, there has been considerable interest in the prediction of the secondary structures for RNA families. A paper describing our new algorithm, RNAG, to predict consensus secondary structures for unaligned sequences using the blocked Gibbs sampler has been published[1]. This sampling algorithm iteratively samples from the conditional probability distributions: P(Structure | Alignment) and P(Alignment | Structure). Subsequent to publication of the RNAG paper we have employed the technology from RNAG in the development of an RNA motif finding algorithm. To develop and RNA motif finding algorithm, RGibbs, we capitalized on our long experience in DNA motif finding and RNA secondary structure prediction. We applied RGibbs to three data sets from the literature and compared it to existing methods: one for training and two others for tests sets. In both test sets we found RGibbs out performed existing procedures.

59 BASIC BIOLOGICAL SCIENCES↗

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Symmetry-conserving purification of quantum states within the density matrix renormalization group

The density matrix renormalization group (DMRG) algorithm was originally designed to efficiently compute the zero-temperature or ground-state properties of one-dimensional strongly correlated quantum systems. The development of the algorithm at finite temperature has been a topic of much interest, because of the usefulness of thermodynamics quantities in understanding the physics of condensed matter systems, and because of the increased complexity associated with efficiently computing temperature-dependent properties. The ancilla method is a DMRG technique that enables the computation of these thermodynamic quantities. In this paper, we review the ancilla method, and improve its performance by working on reduced Hilbert spaces and using canonical approaches. Furthermore we explore its applicability beyond spins systems to t-J and Hubbard models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SU-E-T-03: 3D GPU-Accelerated Secondary Checks of Radiation Therapy Treatment Plans

Purpose: Redundant treatment verifications in conformal and intensity-modulated radiation therapy techniques are traditionally performed with single point calculations. New solutions can replace these checks with 3D treatment plan verifications. This work describes a software tool (Mobius3D, Mobius Medical Systems) that uses a GPU-accelerated collapsed cone algorithm to perform 3D independent verifications of TPS calculations. Methods: Mobius3D comes with reference beam models for common linear accelerators. The system uses an independently developed collapsed cone algorithm updated with recent enhancements. 144 isotropically-spaced cones are used for each voxel for calculations. These complex calculations can be sped up by using GPUs. Mobius3D calculate dose using DICOM information coming from TPS (CT, RT Struct, RT Plan RT Dose). DVH-metrics and 3D gamma tests can be used to compare both TPS and secondary calculations. 170 patients treated with all common techniques as 3DCFRT (including wedged), static and dynamic IMRT and VMAT have been successfully verified with this solution. Results: Calculation times are between 3–5 minutes for 3DCFRT treatments and 15–20 for most complex dMLC and VMAT plans. For all PTVs mean dose and 90% coverage differences are (1.12±0.97)% and (0.68±1.19)%, respectively. Mean dose discrepancies for all OARs is (0.64±1.00)%. 3D gamma (global, 3%/3 mm) analysis shows a mean passing rate of (97.8 ± 3.0)% for PTVs and (99.0±3.0)% for OARs. 3D gamma pasing rate for all voxels in CT has a mean value of (98.5±1.6)%. Conclusion: Mobius3D is a powerful tool to verify all modalities of radiation therapy treatments. Dose discrepancies calculated by this system are in good agreement with TPS. The use of reference beam data results in time savings and can be used to avoid the propagation of errors in original beam data into our QA system. GPU calculations permit enhanced collapsed cone calculations with reasonable calculation times.

60 APPLIED LIFE SCIENCES↗

Lifetime Energy and Environmental Impacts of Insulation Materials in Commercial Building Applications – Assessment Methodology and Sample Calculations

Application of insulation materials to building envelopes is a relatively easy and effective way of reducing energy consumption for space conditioning and, consequently, limiting the negative environmental impacts from the buildings sector. While insulation materials have a positive impact on the environment by reducing energy consumption in buildings, they also have some negative environmental impacts associated with their ‘embodied energy’. The total lifetime environmental impacts of insulation materials are a summation of: (1) direct impacts due to their embodied energy, and (2) indirect or environmental impacts avoided due to the reduced building energy consumption. It is important to identify insulation materials for buildings that will result in minimum negative environmental impacts. The objective of this project was to perform an assessment of the lifetime energy and environmental impacts of building insulation materials based on a previously developed protocol. The developed protocol was used for calculating the lifetime environmental impacts of selected insulation materials. Two Excel-based tools were developed: 1) to calculate embodied energy and GWP (equivalent CO 2 emissions) of insulation materials, and 2) to estimate energy savings and avoided environmental impacts due to the use of insulation materials in buildings. The direct environmental impacts were estimated using data from existing literature and life cycle analysis software; the indirect impacts were based on simulations of prototype whole-building models. This report summarizes the simulation study based on the recommendations of a previously developed protocol (A protocol for lifetime energy and environmental impact assessment of building insulation materials) by Shrestha et al., 2014. It also discusses a simplified algorithm based technique developed to quantify energy savings potential without requiring whole-building energy simulations. The report describes a proposed protocol that is intended to provide a comprehensive list of factors to be considered in evaluating the direct and indirect environmental impacts of building insulation materials, as well as detailed descriptions of standardized calculation methodologies to determine those impacts. Estimating the energy savings impact of insulation materials for the buildings in United States was an important aspect of this recommendation and comparative analyses of selected insulation materials were performed.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Genomic Functionalization: The Next Revolution In Biology

We have implemented a ligand-alignment algorithm into our developed computational pipeline for identifying specificity-determining features (SDFs) in protein-ligand complexes. Given a set of protein-ligand complex structures, the algorithm aligns the complexes by ligand rather than by the C -RMSD or standard approach, providing a single reference frame for extracting SDFs. We anticipate that this ligand-alignment capability will be highly useful for protein function prediction. We already have a database containing > 20 K ligand-protein complex crystal structures taken from the Protein Data Bank. By aligning these proteins to single reference frames using ligand alignment, we can submit the complexes to our pipeline for SDF extraction. The SDFs derived from this training procedure can be used as thumbprints that are hallmarks of individual enzyme classes. These SDF thumbprints may then serve as guides to the prediction of function of new unknown proteins.

59 BASIC BIOLOGICAL SCIENCES↗

Numerical Modeling & Optimization of the iProTech Pitching Inertial Pump (PIP) Wave Energy Converter (WEC) (CRADA Final Report)

This project represents a continuation of the collaboration between iProTech and NLR to simulate, optimize and design the iProTech Pitching Inertial Pump (PIP) device. The objectives of this TEAMER project are twofold: 1. Refining the physical characteristics of the existing iProTech PIP WEC-Sim model to enhance the model’s fidelity and include controllable components. Key model enhancements target the inclusion of Coulomb friction, the introduction of a controllable bypass valve, and the replacement of traditional check valves with advanced motorized ones. 2. Exploring traditional and advanced control algorithms. From traditional methods like latching control to cutting-edge reinforcement learning (RL) algorithms, the goal is to ensure the PIP device's adaptability and optimal performance across a range of ocean conditions. NLR is tasked with augmenting the WEC-Sim model and implementing the control algorithms, culminating in performance comparison analyses. iProTech will update their existing 3D models, advise on model improvements, and determine crucial system metrics. WEC-Sim, developed in MATLAB/SIMULINK with Simscape Multibody, is the main piece of software that will be used in this project. Coupled with the MATLAB RL Toolbox, it offers a robust platform for in-depth simulation and optimization of the iProTech PIP device. Building on previous work to explore the PIP design space and optimize its geometry, mass distribution, center of gravity and other key parameters, this project aims to refine iProTech’s existing numerical models and develop effective control algorithms that can seamlessly integrate into their future hardware testing campaigns.

16 TIDAL AND WAVE POWER↗

Development of a Low-Lift Chiller Controller and Simplified Precooling Control Algorithm. Final Report

KGS Buildings LLC (KGS) and Pacific Northwest National Laboratory (PNNL) have developed a simplified control algorithm and prototype low-lift chiller controller suitable for model-predictive control in a demonstration project of low-lift cooling. Low-lift cooling is a highly efficient cooling strategy conceived to enable low or net-zero energy buildings. A low-lift cooling system consists of a high efficiency low-lift chiller, radiant cooling, thermal storage, and model-predictive control to pre-cool thermal storage overnight on an optimal cooling rate trajectory. We call the properly integrated and controlled combination of these elements a low-lift cooling system (LLCS). This document is the final report for that project.

25 ENERGY STORAGE↗