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 199 records · Page 11

Unifying radiative transfer models in computer graphics and remote sensing, Part I: A Survey

The constellation of Earth-observing satellites continuously collects measurements of scattered radiance, which must be transformed into geophysical parameters in order to answer fundamental scientific questions about the Earth. Retrieval of these parameters requires highly flexible, accurate, and fast forward and inverse radiative transfer models. Existing forward models used by the remote sensing community are typically accurate and fast, but sacrifice flexibility by assuming the atmosphere or ocean is composed of plane-parallel layers. Monte Carlo forward models can handle more complex scenarios such as 3D spatial heterogeneity, but are relatively slower. We propose looking to the computer graphics community for inspiration to improve the statistical efficiency of Monte Carlo forward models and explore new approaches to inverse models for remote sensing. In Part 1 of this work, we examine the evolution of radiative transfer models in computer graphics and highlight recent advancements that have the potential to push forward models in remote sensing beyond their current periphery of realism.

Radiative transfer↗

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↗

The evaluation of spin-density matrices within the graphically contracted function method.

An efficient algorithm is presented to compute spin-density matrices from wave functions expanded in a basis of graphically contracted functions (GCF). The GCFs are based on the graphical unitary group approach (GUGA), which is a 'spin-free' formulation of the electronic wave function. The spin-density matrix elements are computed from one-particle and two-particle charge-density matrix elements. The recursive algorithm allows the spin-density matrix to be computed with O(N{sub 2}{sup GCF}{omega}n{sup 2}) total effort where N{sub GCF} is the dimension of the GCF basis and n is the dimension of the orbital basis. The scale factor {omega} depends on the number of electrons N and ranges from O(N{sup 0}) to O(N{sup 2}) depending on the complexity of the underlying Shavitt graph. Because the 'spin-free' GCF formulation eliminates the need to expand the wave function in a spin-dependent Slater determinant basis, it is possible to treat wave functions with large numbers of electrons and orbitals. Timings are given for wave functions that correspond to determinantal expansions over 10{sup 200} in length. The implementation is applicable to arbitrary spin states and to both ground and excited electronic states.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Graphic statics and their potential for digital design and fabrication with concrete

The paper describes the influence of the lower bound theorem of theory of plasticity on the design of structures during the last 70 years. Starting with the fundamental theorems developed in the middle of the last century, the influence of rigid plastic (discontinuous) stress fields on the design of reinforced beam, wall, slab and shell structures is worked out. The potential of graphic statics for digital design and fabrication is illustrated by the results of several research projects on form finding and design of reinforced concrete structures carried out during the last decade. It is shown that the design methods allow for simultaneous considerations about structure and architecture. This leads to leaner structure and reduced material consumption. However, while a current limitation of manufacturing objects in these ''nonstandard'' shapes is presently cost limiting, digital fabrication may change this and open a much greater scope for the use and application of graphic statics in a near future.

36 MATERIALS SCIENCE↗

Early Graphical Appearance of Radiation Pneumonitis Correlates With the Severity of Radiation Pneumonitis After Stereotactic Body Radiotherapy (SBRT) in Patients With Lung Tumors

Purpose: To investigate factors associated with Grade {>=}3 radiation pneumonitis (RP) in patients with lung tumors treated with stereotactic body radiotherapy (SBRT). Methods and Materials: We retrospectively analyzed 128 patients with 133 lung tumors treated with SBRT. RP was graded according to the Common Terminology Criteria for Adverse Events version 3.0. Univariate analyses were used to identify predictive factors for RP. Results: The median follow-up period after SBRT was 12 months (range, 5-45 months). Incidences of Grades 0, 1, 2, and 3 RP were 27%, 52%, 16%, and 5%, respectively. No patients suffered Grade 4 or 5 RP. For all patients with Grade 2 or 3, symptoms occurred either simultaneously with or subsequent to graphical appearances. The latent period was the only significant factor associated with Grade {>=}3 RP (p < 0.01). A latent period of 1 or 2 months indicated a 40% (6/15) risk for Grade 3. However, the risk for Grade 3 was 1.2% (1/82) 3 months after SBRT. No pretreatment clinical or dosimetric factors were significantly associated with Grade {>=}3 RP. However, 4 of 7 patients with Grade 3 RP had severe pulmonary comorbidities. Conclusion: Only the latency period was a significant factor in the development of RP. No pretreatment clinical or dosimetric factors were significantly associated with Grade {>=}3 RP. Patients, especially those with severe pulmonary comorbidities, should be carefully observed for the graphical appearance of RP within a few months during the follow-up period after SBRT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

High-performance dynamic quantum clustering on graphics processors

Clustering methods in machine learning may benefit from borrowing metaphors from physics. Dynamic quantum clustering associates a Gaussian wave packet with the multidimensional data points and regards them as eigenfunctions of the Schroedinger equation. The clustering structure emerges by letting the system evolve and the visual nature of the algorithm has been shown to be useful in a range of applications. Furthermore, the method only uses matrix operations, which readily lend themselves to parallelization. In this paper, we develop an implementation on graphics hardware and investigate how this approach can accelerate the computations. We achieve a speedup of up to two magnitudes over a multicore CPU implementation, which proves that quantum-like methods and acceleration by graphics processing units have a great relevance to machine learning.

97 MATHEMATICS AND COMPUTING↗

A probabilistic graphical model based stochastic input model construction

Model reduction techniques have been widely used in modeling of high-dimensional stochastic input in uncertainty quantification tasks. However, the probabilistic modeling of random variables projected into reduced-order spaces presents a number of computational challenges. Due to the curse of dimensionality, the underlying dependence relationships between these random variables are difficult to capture. In this work, a probabilistic graphical model based approach is employed to learn the dependence by running a number of conditional independence tests using observation data. Thus a probabilistic model of the joint PDF is obtained and the PDF is factorized into a set of conditional distributions based on the dependence structure of the variables. The estimation of the joint PDF from data is then transformed to estimating conditional distributions under reduced dimensions. To improve the computational efficiency, a polynomial chaos expansion is further applied to represent the random field in terms of a set of standard random variables. This technique is combined with both linear and nonlinear model reduction methods. Numerical examples are presented to demonstrate the accuracy and efficiency of the probabilistic graphical model based stochastic input models. - Highlights: • Data-driven stochastic input models without the assumption of independence of the reduced random variables. • The problem is transformed to a Bayesian network structure learning problem. • Examples are given in flows in random media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation of the Molecular Electrostatic Potential over Graphics Processing Units

The molecular electrostatic potential (MEP) generated by quantum chemistry methods and Gaussian functions is evaluated over graphics processing units (GPUs). This implementation is based on full-range Rys polynomials with nodes and weights obtained in each thread of a GPU. For high angular moments, the corresponding integral is solved using a one dimension vertical recurrence relation. Thus, we computed the MEP with minimal approximations. We show that this implementation is stable and very efficient since the time consumed over GPUs is quite small compared with similar implementations over CPUs. The implementation was done by using CUDA-C programming techniques within the Graphics Processing Units for Atoms and Molecules (GPUAM) project, which has been designed to analyze quantum chemistry fields over heterogeneous computational resources. With this new scalar field GPUAM is a useful application for the quantum chemistry community, in particular for people interested in chemical reactivity analysis.

Cruz-Monterrosas, Julio-Cesar↗

gRASPA

GPU Monte Carlo Simulation Code with a taste of RASPA We present enhancements in Monte Carlo simulation speed and functionality within an open-source code, gRASPA, which uses graphical processing units (GPUs) to achieve significant performance improvements compared to serial, CPU implementations of Monte Carlo. The code supports a wide range of Monte Carlo simulations, including canonical ensemble (NVT), grand canonical, NVT Gibbs, Widom test particle insertions, and continuous-fractional component Monte Carlo. Implementation of grand canonical transition matrix Monte Carlo (GC-TMMC) and a novel feature to allow different moves for the different components of metal-organic framework (MOF) structures exemplify the capabilities of gRASPA for precise free energy calculations and enhanced adsorption studies, respectively. The introduction of a High-Throughput Computing (HTC) mode permits many Monte Carlo simulations on a single GPU device for accelerated materials discovery. The code can incorporate machine learning (ML) potentials. The open-source nature of gRASPA promotes reproducibility and openness in science, and users may add features to the code and optimize it for their own purposes. The code is written in CUDA/C++ and SYCL/C++ to support different GPU vendors. The gRASPA code is publicly available at https://github.com/snurr-group/gRASPA.

Li, Zhao [Purdue/Northwestern/Notre Dame Universit↗

On the use of group theoretical and graphical techniques toward the solution of the general N-body problem

Group theoretic and graphical techniques are used to derive the N-body wave function for a system of identical bosons with general interactions through first-order in a perturbation approach. This method is based on the maximal symmetry present at lowest order in a perturbation series in inverse spatial dimensions. The symmetric structure at lowest order has a point group isomorphic with the S{sub N} group, the symmetric group of N particles, and the resulting perturbation expansion of the Hamiltonian is order-by-order invariant under the permutations of the S{sub N} group. This invariance under S{sub N} imposes severe symmetry requirements on the tensor blocks needed at each order in the perturbation series. We show here that these blocks can be decomposed into a basis of binary tensors invariant under S{sub N}. This basis is small (25 terms at first order in the wave function), independent of N, and is derived using graphical techniques. This checks the N{sup 6} scaling of these terms at first order by effectively separating the N scaling problem away from the rest of the physics. The transformation of each binary tensor to the final normal coordinate basis requires the derivation of Clebsch-Gordon coefficients of S{sub N} for arbitrary N. This has been accomplished using the group theory of the symmetric group. This achievement results in an analytic solution for the wave function, exact through first order, that scales as N{sup 0}, effectively circumventing intensive numerical work. This solution can be systematically improved with further analytic work by going to yet higher orders in the perturbation series.

97 MATHEMATICS AND COMPUTING↗

The multifacet graphically contracted function method. I. Formulation and implementation

The basic formulation for the multifacet generalization of the graphically contracted function (MFGCF) electronic structure method is presented. The analysis includes the discussion of linear dependency and redundancy of the arc factor parameters, the computation of reduced density matrices, Hamiltonian matrix construction, spin-density matrix construction, the computation of optimization gradients for single-state and state-averaged calculations, graphical wave function analysis, and the efficient computation of configuration state function and Slater determinant expansion coefficients. Timings are given for Hamiltonian matrix element and analytic optimization gradient computations for a range of model problems for full-CI Shavitt graphs, and it is observed that both the energy and the gradient computation scale as O(N{sup 2}n{sup 4}) for N electrons and n orbitals. The important arithmetic operations are within dense matrix-matrix product computational kernels, resulting in a computationally efficient procedure. An initial implementation of the method is used to present applications to several challenging chemical systems, including N{sub 2} dissociation, cubic H{sub 8} dissociation, the symmetric dissociation of H{sub 2}O, and the insertion of Be into H{sub 2}. The results are compared to the exact full-CI values and also to those of the previous single-facet GCF expansion form.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Graphical Approach to Diagnosing the Validity of the Conditional Independence Assumptions of a Bayesian Network Given Data

Bayesian networks have attained widespread use in data analysis and decision making. Well studied topics include: efficient inference, evidence propagation, parameter learning from data for complete and incomplete data scenarios, expert elicitation for calibrating Bayesian network probabilities, and structure learning. It is not uncommon for the researcher to assume the structure of the Bayesian network or to glean the structure from expert elicitation or domain knowledge. In this scenario, the model may be calibrated through learning the parameters from relevant data. There is a lack of work on model diagnostics for fitted Bayesian networks; this is the contribution of this paper. We key on the definition of (conditional) independence to develop a graphical diagnostic method which indicates if the conditional independence assumptions imposed when one assumes the structure of the Bayesian network are supported by the data. We develop the approach theoretically and describe a Monte Carlo method to generate uncertainty measures for the consistency of the data with conditional independence assumptions under the model structure. We describe how this theoretical information and the data are presented in a graphical diagnostic tool. We demonstrate the approach through data simulated from Bayesian networks under different conditional independence assumptions. We also apply the diagnostic to a real world data set. The results indicate that our approach is a reasonable way of visualizing and inspecting the conditional independence assumption of a Bayesian network given data.

Bayesian Networks · Structural Model Diagnostics ·↗

JLigand: a graphical tool for the CCP4 template-restraint library

The CCP4 template-restraint library defines restraints for biopolymers, their modifications and ligands that are used in macromolecular structure refinement. JLigand is a graphical editor for generating descriptions of new ligands and covalent linkages. Biological macromolecules are polymers and therefore the restraints for macromolecular refinement can be subdivided into two sets: restraints that are applied to atoms that all belong to the same monomer and restraints that are associated with the covalent bonds between monomers. The CCP4 template-restraint library contains three types of data entries defining template restraints: descriptions of monomers and their modifications, both used for intramonomer restraints, and descriptions of links for intermonomer restraints. The library provides generic descriptions of modifications and links for protein, DNA and RNA chains, and for some post-translational modifications including glycosylation. Structure-specific template restraints can be defined in a user’s additional restraint library. Here, JLigand, a new CCP4 graphical interface to LibCheck and REFMAC that has been developed to manage the user’s library and generate new monomer entries is described, as well as new entries for links and associated modifications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-E-P-59: A Graphical Interface for XCAT Phantom Configuration, Generation and Processing

Purpose: To design a comprehensive open-source, publicly available, graphical user interface (GUI) to facilitate the configuration, generation, processing and use of the 4D Extended Cardiac-Torso (XCAT) phantom. Methods: The XCAT phantom includes over 9000 anatomical objects as well as respiratory, cardiac and tumor motion. It is widely used for research studies in medical imaging and radiotherapy. The phantom generation process involves the configuration of a text script to parameterize the geometry, motion, and composition of the whole body and objects within it, and to generate simulated PET or CT images. To avoid the need for manual editing or script writing, our MATLAB-based GUI uses slider controls, drop-down lists, buttons and graphical text input to parameterize and process the phantom. Results: Our GUI can be used to: a) generate parameter files; b) generate the voxelized phantom; c) combine the phantom with a lesion; d) display the phantom; e) produce average and maximum intensity images from the phantom output files; f) incorporate irregular patient breathing patterns; and f) generate DICOM files containing phantom images. The GUI provides local help information using tool-tip strings on the currently selected phantom, minimizing the need for external documentation. The DICOM generation feature is intended to simplify the process of importing the phantom images into radiotherapy treatment planning systems or other clinical software. Conclusion: The GUI simplifies and automates the use of the XCAT phantom for imaging-based research projects in medical imaging or radiotherapy. This has the potential to accelerate research conducted with the XCAT phantom, or to ease the learning curve for new users. This tool does not include the XCAT phantom software itself. We would like to acknowledge funding from MRA, Varian Medical Systems Inc.

60 APPLIED LIFE SCIENCES↗

Graphic Processor Realization of the Formal Solution of the Problem of Radiation Transfer in the Neutron Star Atmosphere

The realization (on the CUDA platform) of the search for the formal solution to the problem of radiation transfer in the strongly magnetized plasma in the atmosphere of a neutron star on graphic processors with the CUDA architecture. The solution is obtained using the Galerkin method with finite elements. The realization of graphic processors makes it possible to substantially accelerate computations in constructing models for the atmospheres of neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗

GnuForPlot Graphics

Gnuforplot Graphics is a Fortran90 program designed to generate two and three dimensional plots of data on a personal computer. The program uses calls to the open source code Gnuplot to generate the plots. Two Fortran90 programs have been written to use the Gnuplot graphics capabilities. The first program, named Plotsetup.f90 reads data from output files created by either the Stadium or LeachXS/Orchestra modeling codes and saves the data in arrays for plotting. This program then calls Gnuforplot which takes the data array along with user specified parameters to set plot specifications and issues Gnuplot commands that generate the screen plots. The user can view the plots and optionally save copies in jpeg format.

Flach, GregoryP.↗

MuSim, a Graphical User Interface for Multiple Simulation Programs

MuSim is a new user-friendly program designed to interface to many different particle simulation codes, regardless of their data formats or geometry descriptions. It presents the user with a compelling graphical user interface that includes a flexible 3-D view of the simulated world plus powerful editing and drag-and-drop capabilities. All aspects of the design can be parametrized so that parameter scans and optimizations are easy. It is simple to create plots and display events in the 3-D viewer (with a slider to vary the transparency of solids), allowing for an effortless comparison of different simulation codes. Simulation codes: G4beamline, MAD-X, and MCNP; more coming. Many accelerator design tools and beam optics codes were written long ago, with primitive user interfaces by today's standards. MuSim is specifically designed to make it easy to interface to such codes, providing a common user experience for all, and permitting the construction and exploration of models with very little overhead. For today's technology-driven students, graphical interfaces meet their expectations far better than text-based tools, and education in accelerator physics is one of our primary goals.

43 PARTICLE ACCELERATORS↗