Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Graphics”

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 721 records · Page 40

Graphical methods for evaluating covering arrays

Covering arrays relax the condition of orthogonal arrays by only requiring that all combination of levels be covered but not requiring that the appearance of all combination of levels be balanced. This allows for a much larger number of factors to be simultaneously considered but at the cost of poorer estimation of the factor effects. To better understand patterns between sets of columns and evaluate the degree of coverage to compare and select between alternative arrays, we suggest several new graphical methods that show some of the patterns of coverage for different designs. As a result, these graphical methods for evaluating covering arrays are illustrated with a few examples.

97 MATHEMATICS AND COMPUTING↗

Materials for learning use of GSAS-II

The General Structure Analysis System (GSAS-II) package provides materials and crystallographic analysis for all types of diffraction data. It was initially made available with very limited capabilities, but over much of the last decade the features have been expanded, so that GSAS-II is now a comprehensive tool for nearly all types of structural and materials characterization studies. The need to provide materials to teach use of GSAS-II, while the software has been undergoing constant revision and expansion, has required new approaches for documentation. This has included providing tutorials, as each major new capability has been added, and context-sensitive help for each section of the program. Comments in the code are also expanded into a software reference guide. Finally, most recently, video versions of more than half of the tutorials were created and others were provided with animated graphics. All GSAS-II documentation is web-based.

97 MATHEMATICS AND COMPUTING↗

The difference between “equivalent” and “not different”

Often, experimenters wish to establish that populations of units can be considered equivalent to each other, in order to leverage improved knowledge about one population for characterizing the new population, or to establish the comparability of items. Equivalence tests have existed for many years, but their use in industry seems to have been largely restricted to biomedical applications, such as for assessing the equivalence of two drugs or protocols. We present the fundamentals of equivalence tests, compare them to traditional two-sample and ANOVA tests that are better suited to establishing differences in populations, and propose the use of a graphical summary to compare p-values across different thresholds of practically important differences.

97 MATHEMATICS AND COMPUTING↗

Modifiable Array Data Structures for Mesh Topology

Topological data structures are useful in many areas, including the various mesh data structures used in finite element and finite volume applications. Here, we present a mesh data structure which is both flexible enough to support general mesh adaptivity and is compactly stored in a few large arrays. This structure can efficiently store full topological information for meshes with mixed element types. It allows both constant-time adjacency queries and constant-time addition and removal of mesh entities. We compare this structure to similar structures for finite elements and graphics and present its performance for adjacency queries. We also present its use in adaptive simulation applications.

97 MATHEMATICS AND COMPUTING↗

Automated Mapping of a Plane Curvilinear Contour by a Smooth Set of Arcs in Rotary and Deep Extrusion

The use of smooth continuous approximating curves consisting of arcs of circles to solve production problems is considered. A relatively simple and efficient recurrent algorithm is developed for use with Kompas-3D, MS Excel, and other software. The algorithm is based on the property of the bisector of a triangle. An analytical form of the approximating curve is determined. A real-time graphic interactive interface in Kompas-3D software is derived. Some irregular mapping situations are described. Practical results are outlined.

42 ENGINEERING↗

Tools and Apps to Enhance Situational Awareness for Global Disease Surveillance</strong

Situational awareness is important for both early warning and early detection of a disease outbreak. We will describe a suite of tools developed at Los Alamos National Laboratory that provide actionable information and knowledge for enhanced situational awareness during an unfolding event. The BRD is a searchable database, a one stop shop for disease surveillance resources and can be used for validating information received about disease outbreaks. Furthermore, the BaRD is a searchable database that catalogs and classifies epidemiological model-specific information to allow facile selection. The SWAP is an app to provide a context for a rapidly unfolding event through graphical visualization.

59 BASIC BIOLOGICAL SCIENCES↗

Representations of Shavitt Graphs Within the Graphical Unitary Group Approach

The Shavitt graph is a visual representation of a distinct row table (DRT) within the graphical unitary group approach. The DRT is a compact representation of the entire configuration state function expansion space within a molecular electronic structure calculation. Each node of the graph is associated with an integer triple (a k , b k , c k ). These integers may be mapped to other quantum numbers, including the number of orbitals, number of electrons, and spin quantum number, and used to display Shavitt graphs in various ways that emphasize different aspects of the expansion space or that reveal different aspects of computed wave functions. In conclusion, the features of several graph density plots are discussed, including electron-hole symmetries and the bonding-antibonding wave function character.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SU-F-J-72: A Clinical Usable Integrated Contouring Quality Evaluation Software for Radiotherapy

Purpose: To introduce the Auto Contour Evaluation (ACE) software, which is the clinical usable, user friendly, efficient and all-in-one toolbox for automatically identify common contouring errors in radiotherapy treatment planning using supervised machine learning techniques. Methods: ACE is developed with C# using Microsoft .Net framework and Windows Presentation Foundation (WPF) for elegant GUI design and smooth GUI transition animations through the integration of graphics engines and high dots per inch (DPI) settings on modern high resolution monitors. The industrial standard software design pattern, Model-View-ViewModel (MVVM) pattern, is chosen to be the major architecture of ACE for neat coding structure, deep modularization, easy maintainability and seamless communication with other clinical software. ACE consists of 1) a patient data importing module integrated with clinical patient database server, 2) a 2D DICOM image and RT structure simultaneously displaying module, 3) a 3D RT structure visualization module using Visualization Toolkit or VTK library and 4) a contour evaluation module using supervised pattern recognition algorithms to detect contouring errors and display detection results. ACE relies on supervised learning algorithms to handle all image processing and data processing jobs. Implementations of related algorithms are powered by Accord.Net scientific computing library for better efficiency and effectiveness. Results: ACE can take patient’s CT images and RT structures from commercial treatment planning software via direct user input or from patients’ database. All functionalities including 2D and 3D image visualization and RT contours error detection have been demonstrated with real clinical patient cases. Conclusion: ACE implements supervised learning algorithms and combines image processing and graphical visualization modules for RT contours verification. ACE has great potential for automated radiotherapy contouring quality verification. Structured with MVVM pattern, it is highly maintainable and extensible, and support smooth connections with other clinical software tools.

60 APPLIED LIFE SCIENCES↗

Efficient Simulation of Nested Hollow Sphere Intersections: for Dynamically Nested Compartmental Models in Cell Biology

In the particle-based simulation of cell-biological systems in continuous space, a key performance bottleneck is the computation of all possible intersections between particles. These typically rely for collision detection on solid sphere approaches. The behavior of cell biological systems is influenced by dynamic hierarchical nesting, such as the forming of, the transport within, and the merging of vesicles. Existing collision detection algorithms are found not to be designed for these types of spatial cell-biological models, because nearly all existing high performance parallel algorithms are focusing on solid sphere interactions. The known algorithms for solid sphere intersections return more intersections than actually occur with nested hollow spheres. Here we define a new problem of computing the intersections among arbitrarily nested hollow spheres of possibly different sizes, thicknesses, positions, and nesting levels. We describe a new algorithm designed to solve this nested hollow sphere intersection problem and implement it for parallel execution on graphical processing units (GPUs). We present first results about the runtime performance and scaling to hundreds of thousands of spheres, and compare the performance with that from a leading solid object intersection package also running on GPUs.

Koester, Till↗

Acceleration of the Parameterization of Unified Microphysics Across Scales (PUMAS) on the Graphics Processing Unit (GPU) With Directive-Based Methods

Cloud microphysics is one of the most time-consuming components in a climate model. In this study, we port the cloud microphysics parameterization in the Community Atmosphere Model (CAM), known as Parameterization of Unified Microphysics Across Scales (PUMAS), from CPU to GPU to seek a computational speedup. The directive-based methods (OpenACC and OpenMP target offload) are determined as the best fit specifically for our development practices, which enable a single version of source code to run either on the CPU or GPU, and yield a better portability and maintainability. Their performance is first examined in a PUMAS stand-alone kernel and the directive-based methods can outperform a CPU node as long as there is enough computational burden on the GPU. A consistent behavior is observed when we run PUMAS on the GPU in a practical CAM simulation. A 3.6× speedup of the PUMAS execution time, including data movement between CPU and GPU, is achieved at a coarse horizontal resolution (8 NVIDIA V100 GPUs against 36 Intel Skylake CPU cores). This speedup further increases up to 5.4× at a high resolution (24 NVIDIA V100 GPUs against 108 Intel Skylake CPU cores), which highlights the fact that GPU favors larger problem size. This study demonstrates that using GPU in a CAM simulation can save noticeable computational costs even with a small portion of code being GPU-enabled. Therefore, we are encouraged to port more parameterizations to GPU to take advantage of its computational benefit.

54 ENVIRONMENTAL SCIENCES↗

Coupling SCALE with DAKOTA for Axial Burnup Profiles Assessment in Burnup Credit

This paper presents a computational study that demonstrates the application of the SCALE code system in conjunction with the Design Analysis Kit for Optimization and Terascale Applications (DAKOTA) for the analysis of key factors influencing the evaluation of burnup credit (BUC) in pressurized water reactors (PWRs). The primary objective of this analysis is to characterize the model by utilizing parameterization, uncertainty quantification, and optimization studies. Using this approach, we can comprehensively assess the system and conduct informed predictive studies. This study highlights the effectiveness of the SCALE code system integrated within the DAKOTA framework in terms of efficiency and capability. With the coupling of the burnup code ORIGAMI with the CSAS or TSUNAMI-3D sequence embedded in a DAKOTA analysis, we can characterize the factors that influence the k eff of PWR 17x17 spent nuclear fuel (SNF) in the GBC-32 computational benchmark cask for the assessment of BUC in criticality safety analysis. The coupling methodology used in this study is not exclusive to BUC analysis. However, the choice to apply this methodology to the BUC problem is particularly significant because of the diverse range of aspects it encompasses in nuclear criticality safety analyses. This problem presents a unique opportunity to explore and address multiple facets of such analyses related to BUC and illustrates the capability of the SCALE code system with DAKOTA. This analysis makes use of historical reference data for the axial burnup profile, where the entire space within the bounds is considered. Both SCALE and DAKOTA are currently integrated in the Nuclear Energy Advanced Modeling Simulation (NEAMS) Workbench code system, which has a user-friendly graphical interface that simplifies the setup of simulations and configuration of input parameters as well as the visualization of simulation results.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Selecting the Best Wild Card Entries in a Covering Array

For some covering arrays, there are some wild card positions in the array where there is flexibility about what factor levels can be chosen with no impact on the basic properties of covering array, because all of the required pairs have been covered. The choice of how to fill these wild card positions can influence other properties, such as the degrees of orthogonality or three-way coverage of the array. Here in this article, some criteria are proposed for identifying the best choices for the wild card positions to create covering arrays with highly desirable properties. Accompanying graphical summaries are also described to highlight differing performance for several examples.

97 MATHEMATICS AND COMPUTING↗

Importance of ice nucleation and precipitation on climate with the Parameterization of Unified Microphysics Across Scales version 1 (PUMASv1)

Cloud microphysics is critical for weather and climate prediction. In this work, we document updates and corrections to the cloud microphysical scheme used in the Community Earth System Model (CESM) and other models. These updates include a new nomenclature for the scheme, now called Parameterization of Unified Microphysics Across Scales (PUMAS), and the ability to run the scheme on graphics processing units (GPUs). The main science changes include refactoring an ice number limiter and associated changes to ice nucleation, adding vapor deposition onto snow, and introducing an implicit numerical treatment for sedimentation. We also detail the improvements in computational performance that can be achieved with GPU acceleration. We then show the impact of these scheme changes on the (a) mean state climate, (b) cloud feedback response to warming, and (c) aerosol forcing. We find that corrections are needed to the immersion freezing parameterization and that ice nucleation has important impacts on climate. We also find that the revised scheme produces less cloud liquid and ice but that this can be adjusted by changing the loss process for cloud liquid (autoconversion). Furthermore, there are few discernible effects of the PUMAS changes on cloud feedbacks but some reductions in the magnitude of aerosol–cloud interactions (ACIs). Small cloud feedback changes appear to be related to the implicit sedimentation scheme, with a number of factors affecting ACIs.

54 ENVIRONMENTAL SCIENCES↗

Detecting Data-Races in High-Performance Computing

High-performance computing is susceptible to data-race bugs. Data races occur when sequences of computed events do not happen in the intended order, a significant barrier to the integrity of parallel programs using shared-memory architectures. Many approaches to data-race detection are based on traditional static-analysis techniques that typically execute on a program’s source code or control-flow graph (the graphical representation of all possible orders of events in the execution of a program). Similar to classical data-flow analyses, such tools can produce false alarms that report spurious race conditions on error free programs. We have developed a software verification technique that requires as input only a program’s source code and can automatically detect a data-race bug which definitely exists, determine that a program is definitely data-race free, or report that it cannot determine either of the two cases.

97 MATHEMATICS AND COMPUTING↗

SCALE Code System

The SCALE Code System is a widely used modeling and simulation suite for nuclear safety analysis and design that is developed, maintained, tested, and managed by the Reactor and Nuclear Systems Division (RNSD) of Oak Ridge National Laboratory (ORNL). SCALE provides a comprehensive, verified and validated, user-friendly tool set for criticality safety, reactor and lattice physics, radiation shielding, spent fuel and radioactive source term characterization, and sensitivity and uncertainty analysis. Since 1980, regulators, licensees, and research institutions around the world have used SCALE for safety analysis and design. SCALE provides an integrated framework with dozens of computational modules, including three deterministic and three Monte Carlo radiation transport solvers that are selected based on the desired solution strategy. SCALE includes current nuclear data libraries and problem-dependent processing tools for continuous-energy (CE) and multigroup (MG) neutronics and coupled neutron-gamma calculations, as well as activation, depletion, and decay calculations. SCALE includes unique capabilities for automated variance reduction for shielding calculations, as well as sensitivity and uncertainty analysis. SCALE’s graphical user interfaces assist with accurate system modeling, visualization of nuclear data, and convenient access to desired results.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Integrating solvation shell structure in experimentally driven molecular dynamics using x-ray solution scattering data

In the past few decades, prediction of macromolecular structures beyond the native conformation has been aided by the development of molecular dynamics (MD) protocols aimed at exploration of the energetic landscape of proteins. Yet, the computed structures do not always agree with experimental observables, calling for further development of the MD strategies to bring the computations and experiments closer together. Here, we report a scalable, efficient MD simulation approach that incorporates an x-ray solution scattering signal as a driving force for the conformational search of stable structural configurations outside of the native basin. We further demonstrate the importance of inclusion of the hydration layer effect for a precise description of the processes involving large changes in the solvent exposed area, such as unfolding. Utilization of the graphics processing unit allows for an efficient all-atom calculation of scattering patterns on-the-fly, even for large biomolecules, resulting in a speed-up of the calculation of the associated driving force. The utility of the methodology is demonstrated on two model protein systems, the structural transition of lysine-, arginine-, ornithine-binding protein and the folding of deca-alanine. We discuss how the present approach will aid in the interpretation of dynamical scattering experiments on protein folding and association.

Hsu, Darren J.↗

A volumetric framework for quantum computer benchmarks

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth d and width w are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which d and w are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes — ( w , d ) pairs — to test suites C ( w , d ) . A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C , a specific list of circuits { C 1 … C N } that must all be run, or a large set of possible circuits equipped with a distribution P r ( C ) . The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have ``passed'' a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the d vs w trade-off for the processor being benchmarked.

97 MATHEMATICS AND COMPUTING↗

πScope: Python based scientific workbench with MDSplus data visualization tool

In this work, a newly developed python based scientific data analysis and visualization tool, πScope (http://piscope.psfc.mit.edu), is reported. The primary motivation is 1) to provide an updated tool to browse the MDSplus data beyond existing dwscope/jScope and 2) to realize a universal foundation to construct interface tools to perform computer modeling from experimental data. To visualize MDSplus data, πScope has many features including overplotting different signals and discharges, generating various plot types (line, contour, image, etc.), performing in-panel data analysis using python scripts, and producing publication quality graphics. The logic to generate multi-panel plots is designed to be backward compatible with dwscope, enabling smooth migration for users. πScope uses multi-threading in data loading, and is easy to modify and expand due to its object-oriented design. Furthermore, A user can access the data structure both from a GUI and a script, enabling relatively complex data analysis workflow built quickly on πScope.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗