Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer algorithms”

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

Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM SciDAC) (Technical Final Report)

Runaway electrons can severely damage the plasma facing components on ITER during a major disruption and pose a major risk for tokamak fusion. It has been recognized that an adequate disruption mitigation system (DMS) is essential for the safe operation of ITER. The United States is responsible for the design and implementation of the disruption mitigation system on ITER, and in July 2016 the Simulation Center for Runaway Electron Avoidance and Mitigation (SCREAM) was launched by DOE, in a joint Fusion Energy Sciences (FES) and Advanced Scientific Computing Research (ASCR) collaboration. SCREAM was a comprehensive theory and simulation SciDAC center that provided physics guidance in the avoidance and mitigation of runaway electrons, and in tandem with domestic and international experiments, helped establish the qualitative and quantitative bases for safe operational scenarios and viable mitigation techniques. The SCREAM center assembled a national team of experts in runaway electron physics, tokamak disruptions, magnetohydrodynamic (MHD) simulation, and advanced algorithms and computing. The team combined advanced simulation and analysis capability facilitated by direct participation of ASCR SciDAC institutes with theoretical models and code development by FES scientists to focus on the runaway risk for ITER and tokamaks in general. The research scope was focussed on integrated simulations of kinetic runaway electrons, including MHD and fluid models of impurity transport, within a research plan guided by theory. The specific research tasks were (1) establish the fundamental physics of runaway generation, saturation, and dynamical evolution in a tokamak; (2) examine the critical path toward runaway avoidance; and (3) investigate the viability and effectiveness of the leading candidate schemes for runaway mitigation. In all three areas, members of the team carried out scoping studies that established the readiness for rapid and critical advances, especially in the deployment and further development of large-to extreme-scale simulation tools. Our multi-pronged computational approach included (1) relativistic Fokker-Planck solvers with discretization in phase space, (2) self-consistent particle-in-cell techniques, (3) particle-based Monte-Carlo, and (4) MHD-particle hybrid simulations. Cross-check between these different methods provided an additional means for verification and further bolstered the fidelity of our physics prediction. Validation against experimental results brings confidence to the predictive capability for ITER and frequently leads to new ideas for understanding and mitigating the thermal quench driven runaway electron phenomenon.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Robustness Computation of Dynamic Controllability in Probabilistic Temporal Networks with Ordinary Distributions

Most existing works in Probabilistic Simple Temporal Networks (PSTNs) base their frameworks on well-defined probability distributions. This paper addresses on PSTN Dynamic Controllability (DC) robustness measure, i.e. the execution success probability of a network under dynamic control.We consider PSTNs where the probability distributions of the contingent edges are ordinary distributed (e.g. non-parametric, non-symmetric). We introduce the concepts of dispatching protocol (DP) as well as DP-robustness, the probability of success under a predefined dynamic policy.We propose a fixed-parameter pseudo-polynomial time algorithm to compute the exact DP-robustness of any PSTN under \textit{NextFirst} protocol, and apply to various PSTN datasets, including the real case of planetary exploration in the context of the Mars 2020 rover, and propose an original structural analysis.

Saint-Guillain, Michael↗

A comprehensive comparison between satellite-measured skin and multichannel sea surface temperature

Three algorithms for computing sea-surface temperature (SST) from AVHRR channel-4 and -5 brightness temperatures were compared using 1-week blocks of global-area-coverage (GAC) data archived at NCAR. These are the multichannel SST (MCSST), the cross-product SST (CPSST), and the AVHRR-only satellite-measured ocean-surface skin temperature (SMSST). Maps of each SST product were produced and were compared for various time periods. The difference between the algorithms range from +1.6 to -1.2 K, resulting from the different forms of both the algorithms and the ground truth from which the algorithms were derived. It is concluded that, for the study of relative SST patterns, any of the algorithms can be used. However, for applications requiring accurate absolute temperature measurements, the differences are significant and the derivation of the algorithm must be considered when an algorithm is selected.

Wick, Gary A.↗

Safeguards-Informed Hybrid Imagery Dataset [Poster]

Deep Learning computer vision models require many thousands of properly labelled images for training, which is especially challenging for safeguards and nonproliferation, given that safeguards-relevant images are typically rare due to the sensitivity and limited availability of the technologies. Creating relevant images through real-world staging is costly and limiting in scope. Expert-labeling is expensive, time consuming, and error prone. We aim to develop a data set of both realworld and synthetic images that are relevant to the nuclear safeguards domain that can be used to support multiple data science research questions. In the process of developing this data, we aim to develop a novel workflow to validate synthetic images using machine learning explainability methods, testing among multiple computer vision algorithms, and iterative synthetic data rendering. We will deliver one million images – both real-world and synthetically rendered – of two types uranium storage and transportation containers with labelled ground truth and associated adversarial examples.

97 MATHEMATICS AND COMPUTING↗

Density models for the upper atmosphere

Three contemporary atmospheric density models which are candidates for meeting the current orbit computation requirements are compared. The models considered are the analytic Jacchia-Roberts model, the modified Harris-Priester model, and the USSR Cosmos satellite derived density model. All of these models can be said to be quasi-dynamic representations of the atmospheric density. The time dependent variations in the model density profiles are determined by both the evaluation of explicit continuous functions of time and by the input of time varying parameters to algorithms. The computation characteristics of each of the models are compared and a modification to the modified Harris-Priester model is proposed which improves its ability to represent the diurnal variation in the atmospheric density.

Dowd, D. L.↗

A Modified Algorithm and Open-Source Computational Package for the Determination of Infrared Optical Constants Relevant to Astrophysics

Infrared (IR) telescopes, such as Spitzer and SOFIA, have revealed a rich variety of chemical species trapped in interstellar ices. The most fundamental parameters to be derived from observed IR spectra are the identity and abundance of each component. Several compounds have been conclusively or tentatively identified, but the band strengths and optical constants needed to derive accurate abundances for many of these are poorly constrained. We have developed a modified approach to the extraction of the real and imaginary parts of the refractive index (optical constants) of a thin film from a single transmission spectrum measured in the IR spectral range. Our algorithm is similar to those implemented by previous authors, with some major changes that yield results for strong absorptions where previous approaches fail: (1) an adaptive k-correction step size, (2) the use of a root-finding algorithm to obtain a more accurate k-correction at each iteration, and (3) a k-correction step that prevents non-physical results such as negative n-values that prevent convergence in the calculation algorithm. The algorithm is presented and described, with examples to show agreement with some existing results and improvements upon others. New optical-constants calculations for CH3OH, CO2, N2O, and CH4 are presented, and potential implications for the modeling of interstellar and planetary ice data from space telescopes are discussed. With the objective of being open-source and transparent, the full source code in the free Python programming language is made available along with the compiled version and the laboratory data used to produce the results shown.

Perry A. Gerakines↗

Recent advances in 3D SRF cavity-based quantum computing facility at the Fermilab SQMS Center

This talk will describe the most recent advances and progress in building an SRF cavity-based quantum computing facility at the Fermilab SQMS center. Several technical challenges had been successfully overcome to preserve the highest quality factors of SRF cavities in the presence of the sapphire chip holding the transmon qubit inside the cavity. The record values of the attained multicell cavity (2-cell, 9-cell)-qubit systems will be presented, as well as a variety of quantum operations realized with such systems, including the generation of large Fock states, coherent states, entangled mode-mode states etc. The quantum algorithms and computational problems being implemented on this 3D SQMS QPUs will be discussed as well.

Romanenko, Alexander [Fermilab]↗

Parallel computer methods for eigenvalue extraction

A new numerical algorithm for the solution of large-order eigenproblems typically encountered in linear elastic finite element systems is presented. The architecture of parallel processing is used in the algorithm to achieve increased speed and efficiency of calculations. The algorithm is based on the frontal technique for the solution of linear simultaneous equations and the modified subspace eigenanalysis method for the solution of the eigenproblem. The advantages of this new algorithm in parallel computer architecture are discussed.

Akl, Fred↗

A Novel Multiagent Resource Sharing Algorithm for Control of Advanced Energy Systems

This paper implements a novel resource sharing control strategy on a fuel cell–gas turbine hybrid power system at the National Energy Technology Laboratory’s Hybrid Performance Facility (Hyper). In a fuel cell–gas turbine hybrid power system, the simultaneous interaction of the gas turbine and the fuel cell creates a tightly coupled environment characterized by conflicting dynamics. In this paper, a model-free control approach is applied to solve the tightly coupled control problem posed by this challenging environment. Specifically, this control problem is presented as a resource sharing problem that can be solved using a resource sharing algorithm that is defined based on the distribution construction concept. This algorithm creates computational agents and solves the problem through the distribution and redistribution of shared resources defined as blocks. Furthermore, two agents were created; the first agent (agent 1) controls the gas turbine speed by adjusting the electric load, and the second agent (agent 2) controls the cathode mass flow through the fuel cell using the cold-air bypass valve. A parametric study was performed over the course of 15 experimental tests for both agents 1 and 2 through an evaluation of the responses based on setpoint changes. The algorithm was shown to have behavior comparable to a previously implemented multi-input multioutput state-space controller, which was designed through a model-based control approach. The resource sharing algorithm was able to find stable performance during run-time operations without any prior system knowledge identification on the power plant and without creating models used in traditional control strategies.

25 ENERGY STORAGE↗

Contextual classification of multispectral image data

A general method is presented for exploiting both spatial and spectral information when classifying multispectral image data. This statistical classification algorithm utilizes the tendency of certain ground cover classes to be more likely to occur in some contexts than others. The theoretical model assumes the two-dimensional array of random observations and a 0-1 loss function, a distribution of the p-context array that is spatially invariant, and class-conditional independence for the observations. The problems that prevent the immediate use of this context classifier are the need for a generally applicable method for making adequate estimates of the context distribution and a reduction in the computational intensivity of the classifier. The former problem is being approached by a method that raises the relative frequency value for each class configuration to a power and uses the result as the context distribution estimate. The second is being approached by searching for a less computationally intensive algorithm.

Tilton, J. C.↗

FunM2C: A Filter for Uncertainty Visualization of Multivariate Data on Multi-Core Devices

Uncertainty visualization is an emerging research topic in data visualization because neglecting uncertainty in visualization can lead to inaccurate assessments. In this paper, we study the propagation of multivariate data uncertainty in visualization. Although there have been a few advancements in probabilistic uncertainty visualization of multivariate data, three critical challenges remain to be addressed. First, the state-of-the-art probabilistic uncertainty visualization framework is limited to bivariate data (two variables). Second, existing uncertainty visualization algorithms use computationally intensive techniques and lack support for cross-platform portability. Third, as a consequence of the computational expense, integration into production visualization tools is impractical. In this work, we address all three issues and make a threefold contribution. First, we take a step to generalize the state-of-the-art probabilistic framework for bivariate data to multivariate data with an arbitrary number of variables. Second, through utilization of VTK-m’s shared-memory parallelism and cross-platform compatibility features, we demonstrate acceleration of multivariate uncertainty visualization on different many-core architectures, including OpenMP and AMD GPUs. Third, we demonstrate the integration of our algorithms with the ParaView software. We demonstrate the utility of our algorithms through experiments on multivariate simulation data with three and four variables.

Hari, Gautam↗

Computing virtual dark-field X-ray microscopy images of complex discrete dislocation structures from large-scale molecular dynamics simulations

Dark-field X-ray microscopy (DFXM) is a novel diffraction-based imaging technique that non-destructively maps the local deformation from crystalline defects in bulk materials. While studies have demonstrated that DFXM can spatially map 3D defect geometries, it is still challenging to interpret DFXM images of the high-dislocation-density systems relevant to macroscopic crystal plasticity. This work develops a scalable forward model to calculate virtual DFXM images for complex discrete dislocation structure(s) (DDS) obtained from atomistic simulations. Our new DDS-DFXM model integrates a non-singular formulation for calculating the local strain from the DDS and an efficient geometrical optics algorithm for computing the DFXM image from the strain field. We apply the model to complex DDS obtained from a large-scale mol­ecular dynamics simulation of compressive loading on single-crystal silicon. Simulated DFXM images exhibit prominent contrast for dislocation features between the multiple slip systems, demonstrating the potential of DFXM to resolve features from dislocation multiplication. In conclusion, the integrated DDS-DFXM model provides a toolbox for DFXM experimental design and image interpretation in the context of bulk crystal plasticity for a range of measurements across shock plasticity and the broader materials science community.

X-ray imaging↗

Sensitivity of Spaceborne and Ground Radar Comparison Results to Data Analysis Methods and Constraints

With the availability of active weather radar observations from space from the Precipitation Radar (PR) on board the Tropical Rainfall Measuring Mission (TR.MM) satellite, numerous studies have been performed comparing PR reflectivity and derived rain rates to similar observations from ground-based weather radars (GR). These studies have used a variety of algorithms to compute matching PR and GR volumes for comparison. Most studies have used a fixed 3-dimensional Cartesian grid centered on the ground radar, onto which the PR and GR data are interpolated using a proprietary approach and/or commonly available GR analysis software (e.g., SPRINT, REORDER). Other studies have focused on the intersection of the PR and GR viewing geometries either explicitly or using a hybrid of the fixed grid and PR/GR common fields of view. For the Dual-Frequency Precipitation Radar (DPR) of the upcoming Global Precipitation Measurement (GPM) mission, a prototype DPR/GR comparison algorithm based on similar TRMM PR data has been developed that defines the common volumes in terms of the geometric intersection of PR and GR rays, where smoothing of the PR and GR data are minimized and no interpolation is performed. The PR and GR volume-averaged reflectivity values of each sample volume are accompanied by descriptive metadata, for attributes including the variability and maximum of the reflectivity within the sample volume, and the fraction of range gates in the sample average having reflectivity values above an adjustable detection threshold (typically taken to be 18 dBZ for the PR). Sample volumes are further characterized by rain type (Stratiform or Convective), proximity to the melting layer, underlying surface (land/water/mixed), and the time difference between the PR and GR observations. The mean reflectivity differences between the PR and GR can differ between data sets produced by the different analysis methods; and for the GPM prototype, by the type of constraints and categorization applied to the data. In this paper, we will show results comparing the 3-D gridded analysis "black box" approach to the GPM prototype volume-matching approach, using matching TRMM PR and WSR-88D ground radar data. The affects of applying data constraints and data categorizations on the volume-matched data to the results will be shown, and explanations of the differences in terms of data and analysis algorithm characteristics will be presented. Implications of the differences to the determination of PR/DPR calibration differences and use of ground radar data to evaluate the PR and DPR attenuation correction algorithms will be discussed.

Morris, Kenneth R.↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a Numerical Model for High-Temperature Shape Memory Alloys

A thermomechanical hysteresis model for a high-temperature shape memory alloy (HTSMA) actuator material is presented. The model is capable of predicting strain output of a tensile-loaded HTSMA when excited by arbitrary temperature-stress inputs for the purpose of actuator and controls design. Common quasi-static generalized Preisach hysteresis models available in the literature require large sets of experimental data for model identification at a particular operating point, and substantially more data for multiple operating points. The novel algorithm introduced here proposes an alternate approach to Preisach methods that is better suited for research-stage alloys, such as recently-developed HTSMAs, for which a complete database is not yet available. A detailed description of the minor loop hysteresis model is presented in this paper, as well as a methodology for determination of model parameters. The model is then qualitatively evaluated with respect to well-established Preisach properties and against a set of low-temperature cycled loading data using a modified form of the one-dimensional Brinson constitutive equation. The computationally efficient algorithm demonstrates adherence to Preisach properties and excellent agreement to the validation data set.

DeCastro, Jonathan A.↗

Radiative processes on a quantum computer

Radiative processes, where a photon/neutrino is emitted as a result of a collision or decay of a particle, play a central role in atomic, nuclear, and particle physics. Their rate is determined by certain off-diagonal matrix elements between different initial and final states. We propose a method to compute them using quantum computers. It relies on a single extra qubit that, in a certain sense, represents the photon/neutrino. The generic formula relating this matrix element to the amplitude and frequency of oscillations of the extra qubit is derived for the near-resonance case. Furthermore, we demonstrate the feasibility of the method by using it in actual quantum computations and simulations of simple systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗