Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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,477 records · Page 82

Scaling Semantic Graph Databases in Size and Performance

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

Aggregation↗

Fast Search for Dynamic Multi-Relational Graphs

Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that typically arise in monitoring applications have been studied extensively for relational databases. This work is dedicated to answer the question that emerges naturally: how can we efficiently execute a continuous query on a dynamic graph? This paper presents an exact subgraph search algorithm that exploits the temporal characteristics of representative queries for online news or social media monitoring. The algorithm is based on a novel data structure called the that leverages the structural and semantic characteristics of the underlying multi-relational graph. The paper concludes with extensive experimentation on several real-world datasets that demonstrates the validity of this approach.

Choudhury, Sutanay↗

Software Defined Architectures for Data Analytics

Data analytics applications increasingly are complex workflows composed of phases with very different program behaviors (e.g., graph algorithms and machine learning, algorithms operating on sparse an dense data structures, etc). To reach the levels of efficiency required to process these workflows in real time, upcoming architectures will need to leverage even more workload specialization. If, at one end, we may find even more heterogenous processors composed by a myriad of specialized processing elements, at the other end we may see novel reconfigurable architectures, composed of sets of functional units and memories interconnected with (re)configurable on-chip networks, able to adapt dynamically to adapt the workload characteristics. Field Programmable Gate Arrays are more and more used for accelerating various workloads and, in particular, inferencing in machine learning, providing higher efficiency than other solutions. However, their fine grained nature still leads to issues for the design software and still makes dynamic reconfiguration impractical. Future, more coarse-grained architectures could offer the features to execute diverse workloads at high efficiency while providing better reconfiguration mechanisms for dynamic adaptability. Nevertheless, we argue that the challenges for reconfigurable computing remain in the software. In this position paper, we describe a possible toolchain for reconfigurable architectures targeted at data analytics.

FPGA, Dataflow, Reconfigurable Architectures, Soft↗

DEPRECATED LaDa™ [SWR-12-10]

DEPRECATED This repository was archived by the owner on Apr 24, 2023. It is now read-only.High-Throughput software platform to create/launch/analyze physics-related calculations. The front-end is a python API which allows the user to create any conceivable first-principles physics calculation. Is is coupled to an ipython interface to launch and retrieve large number of calculations. It was successfully used in high-throughput calculations of point defect formation enthalpies, compound formation enthalpies, and a genetic algorithm search of direct-gap silicon/germanium structures.

d'Avezac, Mayeul↗

Matlab Code for Multiscale Topology Optimization

This Matlab script implements a simple topology optimization algorithm that minimizes the compliance of a structure within a 3D prismatic design domain. It uses a simple linear elastic finite element solver to solve the equilibrium equations, and the optimality criterion (00) method to update the design iteratively. This functionality is identical to, or the simplest possible extension from 2D to 3D of, a 99-line Matlab code released in 2001 in a journal article by Sigmund. What is new in this code is our implementation of simple surrogate models for several truss micro-architectures, which converts this code to a multiscale design tool, whereas the original code is single-scale. The development of these surrogate models and their implementation is described in a journal article we intend to submit. We plan to include the full source code in an Appendix in this paper. The code’s primary function is as a pedagogical tool rather than as a finished software product. Sigmund’s 2001 paper describes the implementation line-by-line. We are including this updated version of the code to allow the reader to understand exactly what changes must be made to a “standard” topology optimization code to implement the surrogate models and thus multiscale design optimization.

Watts, Seth↗

PyOECP: A flexible open-source software for the measurement and modeling of the dielectric spectrum from the reflection coefficient

We present PyOECP, a Python-based flexible open-source software for estimating and modeling the complex permittivity obtained from the open-ended coaxial probe (OECP) technique. The transformation of the measured reflection coefficient to complex permittivity is performed based on two different models, including the capacitance model and the antenna model. The software library contains dielectric spectra of common reference liquids, which can be used to transform the reflection coefficient into the dielectric spectra. Several Python routines that are commonly employed (e.g., SciPy and NumPy) are only required so that the users can alter the software structure depending on their needs. The modeling algorithm exploits the Markov chain Monte Carlo method for the data regression. The discrete relaxation models can be built by a proper combination of well-known relaxation models. In addition to these models, the electrode polarization, which is a common measurement artifact for interpreting the dielectric spectra, can be incorporated in the modeling algorithm. A continuous relaxation model, which solves the Fredholm integral equation of the first kind (a mathematically ill-posed problem) is also included.

Yoon, Tae-Jun↗

Integrating 3D seismic curvature and curvature gradient attributes for fracture characterization: Methodologies and interpretational implications

In 3D seismic interpretation, curvature is a popular attribute that depicts the geometry of seismic reflectors and has been widely used to detect faults in the subsurface; however, it provides only part of the solutions to subsurface structure analysis. This study extends the curvature algorithm to a new curvature gradient algorithm, and integrates both algorithms for fracture detection using a 3D seismic test data set over Teapot Dome (Wyoming). In fractured reservoirs at Teapot Dome known to be formed by tectonic folding and faulting, curvature helps define the crestal portion of the reservoirs that is associated with strong seismic amplitude and high oil productivity. In contrast, curvature gradient helps better define the regional northwest-trending and the cross-regional northeast-trending lineaments that are associated with weak seismic amplitude and low oil productivity. In concert with previous reports from image logs, cores, and outcrops, the current study based on an integrated seismic curvature and curvature gradient analysis suggests that curvature might help define areas of enhanced potential to form tensile fractures, whereas curvature gradient might help define zones of enhanced potential to develop shear fractures. In certain fractured reservoirs such as at Teapot Dome where faulting and fault-related folding contribute dominantly to the formation and evolution of fractures, curvature and curvature gradient attributes can be potentially applied to differentiate fracture mode, to predict fracture intensity and orientation, to detect fracture volume and connectivity, and to model fracture networks.

3D, attributes, fractures, visualization↗

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

Here, the efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 10 5 processor cores.

97 MATHEMATICS AND COMPUTING↗

MULTISTEP AND CONTINUOUS PHYSICS-INFORMED NEURAL NETWORK METHODS FOR LEARNING GOVERNING EQUATIONS AND CONSTITUTIVE RELATIONS

In this work, we investigate the applicability and relative merit of discrete and continuous versions of physics-informed neural network (PINN) methods for learning unknown governing equations or constitutive relations in a nonlinear dynamical system. In the case of unknown dynamics, entire right-hand-side (RHS) equations of the ordinary differential equations are unknown. In the case of unknown constitutive relations, however, the RHS equations are known up to the specification of constitutive relations (that may depend on the state of the system). We use a deep neural network to model unknown governing equations or constitutive relations. The discrete PINN approach combines classical multistep discretization methods for dynamical systems with neural-network-based machine learning methods. On the other hand, the continuous versions utilize deep neural networks to minimize the residual function for the continuous governing equations. We use the case of a fedbatch bioreactor system to study the effectiveness of these approaches and discuss conditions for their applicability. Our results indicate that the accuracy of the trained neural network models is much higher for the cases where we only have to learn a constitutive relation instead of all dynamics. This finding corroborates the well-known fact from scientific computing that building as much structural information as is available into an algorithm can enhance its efficiency and/or accuracy.

97 MATHEMATICS AND COMPUTING↗

Center for Extended Magnetohydrodynamic Modeling (CEMM), Final Technical Report for UW-Madison Engineering Physics

The Center for Extended Magnetohydrodynamic Modeling (CEMM) focused on the further development, verification, validation, and application of two scientific computation programs, the NIMROD and M3D-C1 codes, for modeling macroscopic dynamics in magnetized plasma. Both NIMROD and M3D-C1 solve the mathematical equations that model two-fluid 3D magnetohydrodynamic (MHD). They are designed and optimized to be efficient and accurate for toroidal confinement physics calculations. The effort improved the fidelity of the physics models, the realism of the treatment of the surrounding vessel, coils, and other structures, the accuracy and efficiency of the algorithms, and the ability to scale calculations to thousands of processors in order to take advantage of leading-edge computers. The primary application areas of Resonant Magnetic Perturbations (RMP), Edge Harmonic Oscillations (EHO), Edge Localized Modes (ELMs), Disruption Studies, Sawteeth and Stationary States, and Kinetic MHD and Neoclassical Tearing Modes (NTM) are of concern for the international ITER experiment, which is under construction in France. The effort by the UW-Madison Engineering Physics component of CEMM improved the numerical methods in the NIMROD code with respect to modeling MHD interchange and two-fluid effects. It also improved the algorithm for solving large algebraic systems to enhance NIMROD's computational performance when running the code in parallel on increasing numbers of processor cores. The modeling efforts included a study of the nonlinear evolution of ballooning, and the findings were supported by analytical theory and computation. Numerical MHD modeling also examined the influences of two-fluid effects on ELMs and RMPs, where "two-fluid" refers to separation of electron dynamics from ion dynamics. Another related aspect considered the effects of a localized layer of electrical current density near the edge of the plasma confinement region. Two-fluid effects on resonant reconnecting instabilities were verified and applied to computations of sawtooth and drift-tearing dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Center for Extended Magnetohydrodynamic Modeling (CEMM, UW-Madison Physics)

The Center for Extended Magnetohydrodynamic Modeling (CEMM) focused on the further development, verification, validation, and application of two scientific computation programs, the NIMROD and M3D-C1 codes, for modeling macroscopic dynamics in magnetized plasma. Both NIMROD and M3D-C1 solve the mathematical equations that model two-fluid 3D magnetohydrodynamic (MHD). They are designed and optimized to be efficient and accurate for toroidal confinement physics calculations. The effort improved the fidelity of the physics models, the realism of the treatment of the surrounding vessel, coils, and other structures, the accuracy and efficiency of the algorithms, and the ability to scale calculations to thousands of processors in order to take advantage of leading-edge computers. The primary application areas of Resonant Magnetic Perturbations (RMP), Edge Harmonic Oscillations (EHO), Edge Localized Modes (ELMs), Disruption Studies, Sawteeth and Stationary States, and Kinetic MHD and Neoclassical Tearing Modes (NTM) are of concern for the international ITER experiment, which is under construction in France. The component of CEMM that is described in this report applied recently developed aspects of NIMROD to sawtooth and EHO dynamics, which occur in tokamak plasma confinement systems. In particular, the effort researched energetic-particle, two-fluid, and plasma-flow effects. The work included an effort to validate energetic-particle modeling using laboratory measurements and previous analysis of giant sawtooth oscillations, where energetic particles temporarily stabilize the system. A side effort that grew out of this work was benchmarking of the slab-geometry ion temperature gradient (ITG) instability computed by NIMROD's two-fluid modeling against analytical results. These fluid-model results were also compared with results from kinetic modeling to help quantify the range of validity for the two-fluid model. The EHO simulations show that sheared plasma flow plays a crucial role in saturating the underlying MHD instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Influence Metrics for Value and Utility Functions

Methods are proposed to measure the sensitivity of utility or value function to the variations of attribute values for Multi-Criteria Decision Analyses that are based on functions that cannot be expressed as a weighted sum of the attribute values. These measures, called factor Influence Metrics, can be used to examine the characteristics of the option scoring algorithm and help verify the algorithm is consistent with decision makers value structure and processes.

97 MATHEMATICS AND COMPUTING↗

Detailed Modeling of Physical Processes in Electron Sources for Accelerator Applications

At present, electron sources are essential in a wide range of applications – from common technical use to exploring the nature of matter. Depending on the application requirements, different methods and materials are used to generate electrons. State of-the-art accelerator applications set a number of often-contradicting requirements for electron sources (e.g., high quantum efficiency vs. high spin-polarization, high current density vs. long lifetime, etc). Development of advanced electron sources includes modeling and design of cathodes, material growth, fabrication of cathodes, and cathode testing. The detailed simulation and modeling of physical processes are required in order to shed light on the exact mechanisms of electron emission and to develop new-generation electron sources with optimized efficiency. The purpose of the present work is to study physical processes in prominent electron sources and to develop scientific tools that could be used to predict electron emission from novel nano-structured materials. In particular, the Monte Carlo model has been implemented and used to study photoemission from Negative Electron Affinity (NEA) GaAs widely used to provide spin-polarized electron beams for many accelerator facilities, including Thomas Jefferson National Accelerator Facility. According to our best knowledge, this is the first to date scientific tool to simulate the complete from-excitation-to-emission-into-vacuum photoemission of spin-polarized electrons from NEA GaAs based on the details of material band structure. Moreover, an effective image-processing algorithm has been developed and used to study field emission properties of Nitrogen-incorporated UltraNanoCrystalline Diamond ((N)UNCD) films. The algorithm processes large sets of image micrographs representing field emission sites formed on the anode plate and therefore provides significant information about the field emission area and the current density. The field emission model from convenient semiconductors has been modified and used to study the influence of the space-charge region and the electric-field-dependent electron mobility on the field emission characteristics of (N)UNCD field emitters.

Chubenko, Oksana↗

Quantum Computing Algorithms and Applications for Coherent and Strongly Correlated Chemical Systems

This project advanced quantum algorithms, quantum information theory, strongly correlated electronic structure methods, molecular quantum materials, and exciton transport imaging in coherent condensed phase systems. Across the award period, the team developed new methods for open-quantum-system simulation, Hamiltonian learning, state tomography, reduced-density-matrix and contracted-quantum eigensolver approaches, and quantum diagnostics for device capability and openness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A computer package for the design and eigenproblem solution of damped linear multidegree of freedom systems

Systems described by the matrix differental equation are considered. An interactive design routine is presented for positive definite mass, damping, and stiffness matrices. Designing is accomplished by adjusting the mass, damping, and stiffness matrices to obtain a desired oscillation behavior. The algorithm also features interactively modifying the physical structure of the system, obtaining the matrix structure and a number of other system properties. In case of a general system, where the M, C, and K matrices lack any special properties, a routine for the eigenproblem solution of the system is developed. The latent roots are obtained by computing the characteristic polynomial of the system and solving for its roots. The above routines are prepared in FORTRAN IV and prove to be usable for the machines with low core memory.

Ahmadian, M.↗

Probabilistic Finite Element: Variational Theory

The goal of this research is to provide techniques which are cost-effective and enable the engineer to evaluate the effect of uncertainties in complex finite element models. Embedding the probabilistic aspects in a variational formulation is a natural approach. In addition, a variational approach to probabilistic finite elements enables it to be incorporated within standard finite element methodologies. Therefore, once the procedures are developed, they can easily be adapted to existing general purpose programs. Furthermore, the variational basis for these methods enables them to be adapted to a wide variety of structural elements and to provide a consistent basis for incorporating probabilistic features in many aspects of the structural problem. Tasks concluded include the theoretical development of probabilistic variational equations for structural dynamics, the development of efficient numerical algorithms for probabilistic sensitivity displacement and stress analysis, and integration of methodologies into a pilot computer code.

Belytschko, T.↗

A hierarchical structure for automatic meshing and adaptive FEM analysis

A new algorithm for generating automatically, from solid models of mechanical parts, finite element meshes that are organized as spatially addressable quaternary trees (for 2-D work) or octal trees (for 3-D work) is discussed. Because such meshes are inherently hierarchical as well as spatially addressable, they permit efficient substructuring techniques to be used for both global analysis and incremental remeshing and reanalysis. The global and incremental techniques are summarized and some results from an experimental closed loop 2-D system in which meshing, analysis, error evaluation, and remeshing and reanalysis are done automatically and adaptively are presented. The implementation of 3-D work is briefly discussed.

Kela, Ajay↗