Search NASA⌕ Search

SEARCH · Search NASA

Results for “graphical”

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 343 records · Page 19

Using computer graphics to enhance astronaut and systems safety

Computer graphics is being employed at the NASA Johnson Space Center as a tool to perform rapid, efficient and economical analyses for man-machine integration, flight operations development and systems engineering. The Operator Station Design System (OSDS), a computer-based facility featuring a highly flexible and versatile interactive software package, PLAID, is described. This unique evaluation tool, with its expanding data base of Space Shuttle elements, various payloads, experiments, crew equipment and man models, supports a multitude of technical evaluations, including spacecraft and workstation layout, definition of astronaut visual access, flight techniques development, cargo integration and crew training. As OSDS is being applied to the Space Shuttle, Orbiter payloads (including the European Space Agency's Spacelab) and future space vehicles and stations, astronaut and systems safety are being enhanced. Typical OSDS examples are presented. By performing physical and operational evaluations during early conceptual phases. supporting systems verification for flight readiness, and applying its capabilities to real-time mission support, the OSDS provides the wherewithal to satisfy a growing need of the current and future space programs for efficient, economical analyses.

Computer Simulation↗

Graphic Three-Axes Presentation of Residual Gas Analyser Data

Residual gas analyzers (RGA) are commonly used to measure the composition of residual gases in thermal-vacuum test chambers. Measurements from RGAs are often used to identify and quantify outgassing contaminants from a test article during thermal-vacuum testing. RGA data is typically displayed as snapshots in time, showing instantaneous concentrations of ions from ionized residual gas molecules at different atomic masses. A method was devised by the authors to present RGA data in a three-axis format, plotting atomic mass unit (AMU), ion concentration as a function of AMU, and time, to provide a clear graphic visualization ot trends in gas concentration changes and to initiate a valuable analytical tool to interpret test article outgassing rates during thermal-vacuum testing.

data analysis↗

Graphics Processor Units (GPUs)

This presentation will include information about Graphics Processor Units (GPUs) technology, NASA Electronic Parts and Packaging (NEPP) tasks, The test setup, test parameter considerations, lessons learned, collaborations, a roadmap, NEPP partners, results to date, and future plans.

Single Event Effect (SEE) testing↗

Graphics Processing Unit (GPU) Devices

This presentation will include information about Graphics Processing Unit (GPU) technology, NASA Electronic Parts and Packaging (NEPP) tasks and their purpose, collaborations, a roadmap, NEPP partners, results to date, and future plans.

Single Event Effects (SEE)↗

Body of Knowledge for Graphics Processing Units (GPUs)

Graphics Processing Units (GPU) have emerged as a proven technology that enables high performance computing and parallel processing in a small form factor. GPUs enhance the traditional computer paradigm by permitting acceleration of complex mathematics and providing the capability to perform weighted calculations, such as those in artificial intelligence systems. Despite the performance enhancements provided by this type of microprocessor, there exist tradeoffs in regards to reliability and radiation susceptibility, which may impact mission success. This report provides an insight into GPU architecture and its potential applications in space and other similar markets. It also discusses reliability, qualification, and radiation considerations for testing GPUs.

NASA Electronic Parts and Packaging (NEPP) Program↗

The use of alternative forms of graphical analysis to balance bias and precision in PET images

Graphical analysis (GA) is an efficient method for estimating total tissue distribution volume (V{sub T}) from positron emission tomography (PET) uptake data. The original GA produces a negative bias in V{sub T} in the presence of noise. Estimates of V{sub T} using other GA forms have less bias but less precision. Here, we show how the bias terms are related between the GA methods and how using an instrumental variable (IV) can also reduce bias. Results are based on simulations of a two-compartment model with V{sub T}'s ranging from 10.5 to 64 mL/cm{sub 3} and from PET image data with the tracer [{sup 11}C]DASB ([{sup 11}C]-3-amino-4-(2-dimethylaminomethyl-phenylsulfanyl) benzonitrile). Four estimates of V{sub T} (or distribution volume ratio (DVR) using a reference tissue) can be easily computed from different formulations of GA including the IV. As noise affects the estimates from all four differently, they generally do not provide the same estimates. By taking the median value of the four estimates, we can decrease the bias and reduce the effect of large values contributing to noisy images. The variance of the four estimates can serve as a guide to the reliability of the median estimate. This may provide a general method for the generation of parametric images with little bias and good precision.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Developing extensible lattice-Boltzmann simulationsfor general-purpose graphics-programming units

Lattice-Boltzmann methods are versatile numerical modeling techniques capable of reproducing a wide variety of fluid-mechanical behavior. These methods are well suited to parallel implementation, particularly on the single-instruction multiple data (SIMD) parallel processing environments found in computer graphics processing units (GPUs). Although more recent programming tools dramatically improve the ease with which GPU programs can be written, the programming environment still lacks the flexibility available to more traditional CPU programs. In particular, it may be difficult to develop modular and extensible programs that require variable on-device functionality with current GPU architectures. This paper describes a process of automatic code generation that overcomes these difficulties for lattice-Boltzmann simulations. It details the development of GPU-based modules for an extensible lattice-Boltzmann simulation package - LBHydra. The performance of the automatically generated code is compared to equivalent purpose written codes for both single-phase, multiple-phase, and multiple-component flows. The flexibility of the new method is demonstrated by simulating a rising, dissolving droplet in a porous medium with user generated lattice-Boltzmann models and subroutines.

97 MATHEMATICS AND COMPUTING↗

Real-time geo-registration of imagery using COTS graphics processors

A method of performing real-time geo-registration of high-resolution digital imagery using existing graphics processing units (GPUs) already found in current personal computers, rather than the main central processing unit (CPU). Digital image data captured by a camera (along with inertial navigation system (INS) data associated with the image data) is transferred to and processed by the GPU to perform the calculations involved in transforming the captured image into a geo-rectified, nadir-looking image. By using the GPU, the order-of-magnitude increase in throughput over conventional software techniques makes real-time geo-registration possible without the significant cost of custom hardware solutions.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

eSHAFTS: Integrated and graphical drug design software based on 3D molecular similarity

With the development of computer technology, computer‐aided drug design (CADD) has become an important means for drug research and development, and its representative method is virtual screening. Various virtual screening platforms have emerged in an endless stream and play great roles in the field of drug discovery. With the increasing number of compound molecules, virtual screening platforms face two challenges: low fluency and low visibility of software operations. In this article, we present an integrated and graphical drug design software eSHAFTS based on three‐dimensional (3D) molecular similarity to overcome these shortcomings. Compared with other software, eSHAFTS has four main advantages, which are integrated molecular editing and drawing, interactive loading and analysis of proteins, multithread and multimode 3D molecular similarity calculation, and multidimensional information visualization. Experiments have verified its convenience, usability, and reliability. By using eSHAFTS, various tasks can be submitted and visualized in one desktop software without locally installing any dependent plug‐ins or software. The software installation package can be downloaded for free at http://lilab.ecust.edu.cn/home/resource.html . © 2019 Wiley Periodicals, Inc.

He, Gaoqi↗

Comparison of Oncentra® Brachy IPSA and graphical optimisation techniques: a case study of HDR brachytherapy head and neck and prostate plans

There are a number of different dwell positions and time optimisation options available in the Oncentra® Brachy (Elekta Brachytherapy Solutions, Veenendaal, The Netherlands) brachytherapy treatment planning system. The purpose of this case study was to compare graphical (GRO) and inverse planning by simulated annealing (IPSA) optimisation techniques for interstitial head and neck (HN) and prostate plans considering dosimetry, modelled radiobiology outcome and planning time. Four retrospective brachytherapy patients were chosen for this study, two recurrent HN and two prostatic boosts. Manual GRO and IPSA plans were generated for each patient. Plans were compared using dose–volume histograms (DVH) and dose coverage metrics including; conformity index (CI), homogeneity index (HI) and conformity number (CN). Logit and relative seriality models were used to calculate tumour control probability (TCP) and normal tissue complication probability (NTCP). Approximate planning time was also recorded. There was no significant difference between GRO and IPSA in terms of dose metrics with mean CI of 1.30 and 1.57 (P > 0.05) respectively. IPSA achieved an average HN TCP of 0.32 versus 0.12 for GRO while for prostate there was no significant difference. Mean GRO planning times were greater than 75 min while average IPSA planning times were less than 10 min. Planning times for IPSA were greatly reduced compared to GRO and plans were dosimetrically similar. For this reason, IPSA makes for a useful planning tool in HN and prostate brachytherapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The sequence of prime gaps is graphic

Let us call a simple graph on $n$ ≥ 2 vertices a prime gap graph if its vertex degrees are 1 and the first $n$ - 1 prime gaps. We show that such a graph exists for every large n, and in fact for every $n$ ≥ 2 if we assume the Riemann hypothesis. Moreover, an infinite sequence of prime gap graphs can be generated by the so-called degree preserving growth process. This is the first time a naturally occurring infinite sequence of positive integers is identified as graphic. That is, we show the existence of an interesting, and so far unique, infinite combinatorial object.

97 MATHEMATICS AND COMPUTING↗

Graphics processing unit accelerated phase field dislocation dynamics: Application to bi-metallic interfaces

We present the first high-performance computing implementation of the meso-scale phase field dislocation dynamics (PFDD) model on a graphics processing unit (GPU)-based platform. The implementation takes advantage of the portable OpenACC standard directive pragmas along with Nvidia's compute unified device architecture (CUDA) fast Fourier transform (FFT) library called CUFFT to execute the FFT computations within the PFDD formulation on the same GPU platform. The overall implementation is termed ACCPFDD-CUFFT. The package is entirely performance portable due to the use of OPENACC-CUDA inter-operability, in which calls to CUDA functions are replaced with the OPENACC data regions for a host central processing unit (CPU) and device (GPU). A comprehensive benchmark study has been conducted, which compares a number of FFT routines, the Numerical Recipes FFT (FOURN), Fastest Fourier Transform in the West (FFTW), and the CUFFT. The last one exploits the advantages of the GPU hardware for FFT calculations. The novel ACCPFDD-CUFFT implementation is verified using the analytical solutions for the stress field around an infinite edge dislocation and subsequently applied to simulate the interaction and motion of dislocations through a bi-phase copper-nickel (Cu–Ni) interface. It is demonstrated that the ACCPFDD-CUFFT implementation on a single TESLA K80 GPU offers a 27.6X speedup relative to the serial version and a 5X speedup relative to the 22-multicore Intel Xeon CPU E5-2699 v4 @ 2.20 GHz version of the code.

97 MATHEMATICS AND COMPUTING↗

Discrete element simulation of Pebble Bed Reactors on graphics processing units

Prediction of pebble positions in a Pebble Bed Reactor (PBR) is necessary for both reactor physics and thermal hydraulics simulations as the arrangement of pebbles has a significant impact on the resulting core power, coolant flow, and fuel temperature. Knowledge of pebble movement as the fuel is cycled through the core is also critical for predicting the fuel residence time and subsequently, the fuel burnup. Simulation with the Discrete Element Method (DEM) can provide knowledge of both the fuel packing and the fuel movement during cycling. Previous works that have performed 3D full-core DEM simulation of PBRs have used simplified models that neglect reflector wall features. This work employs a graphics processing unit (GPU)-enabled DEM code, Project Chrono, to analyze the differences in pebble packing and pebble velocities between a simplified smooth PBR reflector and a more realistic reflector that includes circular wall features. Additionally, a sensitivity study is performed on the depth of the wall features to ensure that crystallization is prevented. Project Chrono is also validated for PBR cycling applications using experimental data. It is found that wall features with a depth of at least 0.5 pebble diameters significantly reduce crystallization in the near-wall region, leading to discrepancies in both packing fraction and pebble velocity in this region compared to the simplified reflector models. These discrepancies are found to lead to roughly a 5–10% difference in the prediction of the near-wall porosity and a 10% difference in the prediction of the velocity of pebbles near the wall. As a result of these discrepancies, it is suggested that future DEM simulations of PBRs include wall features to reduce modeling errors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Physics-informed graphical neural network for power system state estimation

State estimation is highly critical for accurately observing the dynamic behavior of the power grids and minimizing risks from cyber threats. However, existing state estimation methods encounter challenges in accurately capturing power system dynamics, primarily because of limitations in encoding the grid topology and sparse measurements. Here, this paper proposes a physics-informed graphical learning state estimation method to address these limitations by leveraging both domain physical knowledge and a graph neural network (GNN). We employ a GNN architecture that can handle the graph-structured data of power systems more effectively than traditional data-driven methods. The physics-based knowledge is constructed from the branch current formulation, making the approach adaptable to both transmission and distribution systems. The validation results of three IEEE test systems show that the proposed method can achieve lower mean square error more than 20% than the conventional methods.

43 PARTICLE ACCELERATORS↗

Integration of graphical approaches into optimization-based design of multistage liquid extraction

We propose two optimization models for designing two liquid extraction systems: simple multistage liquid extractors and extractors with extract reflux. Both models are motivated by the concepts of the modified McCabe-Thiele graphical method for multistage extractor design. The operating and equilibrium curves in the McCabe-Thiele method are represented by material balances and piece-wise linearized thermodynamics properties. The use of piece-wise approximations improves computational tractability of both optimization models. In addition, we consider some extensions such as dilute systems, insoluble solvents, and non-ideal stages. In conclusion, the applicability of the proposed models is demonstrated with four illustrative examples.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HydroEcoLSTM: A Python package with graphical user interface for hydro-ecological modeling with long short-term memory neural network

Machine learning (ML) is emerging as a promising tool for modeling hydro-ecological processes due to the increasing availability of large environmental data. However, the use of ML requires sufficient programming knowledge due to a lack of a graphical user interface (GUI). In this study, we introduced a GUI package, named HydroEcoLSTM, with the long short-term memory network (LSTM) as the core model, that allows non-ML experts to utilize their domain knowledge to construct complex ML models. We demonstrated the functionalities of HydroEcoLSTM with two practical examples, including (1) predictions of streamflow in both gauged and ungauged catchments and (2) predictions of multiple outputs (i.e., streamflow and isotope transport from two catchments). The simulation results obtained in both case experiments are satisfactory. In the first example, the average Nash–Sutcliffe Efficiency (NSE) for streamflow simulation during the testing period is 0.79 while the application of the trained model in two assumed ungauged catchments also achieves the average NSE of 0.68. In the second example, the average NSE for streamflow and instream isotope simulation during the testing period is 0.71. Ultimately, applications of HydroEcoLSTM with real-world examples demonstrate its potential use for practical applications and research without requiring extensive coding skills.

54 ENVIRONMENTAL SCIENCES↗

On the effective implementation of a boundary element code on graphics processing units unsing an out-of-core LU algorithm

A collocation boundary element code for solving the three-dimensional Laplace equation, publicly available from \url{http://www.intetec.org}, has been adapted to run on an Nvidia Tesla general purpose graphics processing unit (GPU). Global matrix assembly and LU factorization of the resulting dense matrix were performed on the GPU. Out-of-core techniques were used to solve problems larger than available GPU memory. The code achieved over eight times speedup in matrix assembly and about 56~Gflops/sec in the LU factorization using only 512~Mbytes of GPU memory. Details of the GPU implementation and comparisons with the standard sequential algorithm are included to illustrate the performance of the GPU code.

99 GENERAL AND MISCELLANEOUS↗