Search NASA⌕ Search

SEARCH · Search NASA

Results for “data 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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes

In this paper, we describe an array-based hierarchical mesh refinement capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used to project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Integrated multi-omic characterizations of the synapse reveal RNA processing factors and ubiquitin ligases associated with neurodevelopmental disorders

The molecular composition of the excitatory synapse is incompletely defined due to its dynamic nature across developmental stages and neuronal populations. To address this gap, we apply proteomic mass spectrometry to characterize the synapse in multiple biological models including the fetal human brain and hiPSC-derived neurons. To prioritize the identified proteins, we develop an orthogonal multi-omic screen of genomic, transcriptomic, interactomic, and structural data. This data-driven framework identifies proteins with key molecular features intrinsic to the synapse, including characteristic patterns of biophysical interactions and cross-tissue expression. The multi-omic analysis captures synaptic proteins across developmental stages and experimental systems, including 493 synaptic candidates supported by proteomics. We further investigate three such proteins that are associated with neurodevelopmental disorders – the CUL3 E3 ubiquitin ligase, the DDX3X and YBX1 nucleic-acid binding proteins – by mapping their networks of physically interacting synapse proteins or transcripts. Our study demonstrates the potential of an integrated multi-omic approach to systematically and more comprehensively resolve the synaptic architecture.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

A continuous analogue of the tensor-train decomposition

We develop new approximation algorithms and data structures for representing and computing with multivariate functions using the functional tensor-train (FT), a continuous extension of the tensor-train (TT) decomposition. The FT represents functions using a tensor-train ansatz by replacing the three-dimensional TT cores with univariate matrix-valued functions. The main contribution of this paper is a framework to compute the FT that employs adaptive approximations of univariate fibers, and that is not connected to any tensorized discretization. The algorithm can be coupled with any univariate linear or nonlinear approximation procedure. We demonstrate that this approach can generate multivariate function approximations that are several orders of magnitude more accurate, for the same cost, than those based on the conventional approach of compressing the coefficient tensor of a tensor-product basis. Our approach is in the spirit of other continuous computation packages such as Chebfun, and yields an algorithm which requires the computation of “continuous” matrix factorizations such as the LU and QR decompositions of vector-valued functions. To support these developments, we describe continuous versions of an approximate maximum-volume cross approximation algorithm and of a rounding algorithm that re-approximates an FT by one of lower ranks. We demonstrate that our technique improves accuracy and robustness, compared to TT and quantics-TT approaches with fixed parameterizations, of high-dimensional integration, differentiation, and approximation of functions with local features such as discontinuities and other nonlinearities.

42 ENGINEERING↗
DOE OSTI2024

Nonlinear elasticity with the Shifted Boundary Method

Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation

A novel form of the fast multipole method is realized by the combination of adaptive data structures with implementation of the multipole expansions and their translations in Cartesian basis, and enabled by algorithmic differentiation. It may be possible to generalize it to any kernel that allows its formulation as a function of small quantities with respect to which they can be expanded. There is no hard and fast rule recipe that works for all cases. However, it is shown how to do it for the softened Coulomb kernel, which is different from the Coulomb kernel. The characteristics and performance of the method are mapped and shown to provide an attractive option for a generic fast multipole algorithm in a wide region of the parameter space. The algorithm is illustrated with a beam dynamics application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Aspherical particle models for molecular dynamics simulation

In traditional molecular dynamics (MD) simulations, atoms and coarse-grained particles are modeled as point masses interacting via isotropic potentials. For studies where particle shape plays a vital role, more complex models are required. Here, we describe a spectrum of approaches for modeling aspherical particles, all of which are now available (some recently) as options within the LAMMPS MD package. Broadly these include two classes of models. In the first, individual particles are aspherical, either via a pairwise anisotropic potential which implicitly assigns a simple geometric shape to each particle, or in a more general way where particles store internal state which can explicitly define a complex geometric shape. In the second class of models, individual particles are simple points or spheres, but rigid body constraints are used to create composite aspherical particles in a variety of complex shapes. This work discusses parallel algorithms and associated data structures for both kinds of models, which enable dynamics simulations of aspherical particle systems across a wide range of length and time scales. We also highlight parallel performance and scalability and give a few illustrative examples of aspherical models in different contexts.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

SPACE: 3D parallel solvers for Vlasov-Maxwell and Vlasov-Poisson equations for relativistic plasmas with atomic transformations

A parallel, relativistic, three-dimensional particle-in-cell code SPACE has been developed for the simulation of electromagnetic fields, relativistic particle beams, and plasmas. In addition to the standard second-order Particle-in-Cell (PIC) algorithm, SPACE includes efficient novel algorithms to resolve atomic physics processes such as multi-level ionization of plasma atoms, recombination, and electron attachment to dopants in dense neutral gases. SPACE also contains a highly adaptive particle-based method, called Adaptive Particle-in-Cloud (AP-Cloud), for solving the Vlasov-Poisson problems. It eliminates the traditional Cartesian mesh of PIC and replaces it with an adaptive octree data structure. The code's algorithms, structure, capabilities, parallelization strategy, and performance have been discussed. Additionally, typical examples of SPACE applications to accelerator science and engineering problems are described.

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

Occupancy sensing in buildings: A review of data analytics approaches

A review of the literature pertaining to building occupancy detection, counting, and tracking - three areas under the umbrella of building occupancy estimation - is presented with a focus on mathematical approaches and corresponding metrics. The idea is to provide the reader with a background on the hardware and techniques used for occupancy inference, subsequent to data collection, with emphasis placed on the algorithmic characterization of occupancy estimation. The various approaches employed by researchers to tackle the problem are surveyed and summarized, including: data collection, cleaning processes, algorithm utilization and categorization, as well as data structuring and organization. The scope of prediction and performance metrics are used to establish a benchmarking system through a comprehensive summary of (indoor) occupancy estimation, presented in the context of the mathematical tools utilized.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

SoK: What does it Mean to Benchmark Database Forensics?

Relational Database Management Systems are the backbone of modern enterprises and public-sector services, and are thus frequent targets of security incidents, insider threats, and thorough regulatory audits. Consequently, databases have become key sources of digital evidence, requiring investigators to reconstruct past activity from audit logs, transaction logs, and backups. Although benchmarking frameworks such as those developed by the Transaction Processing Performance Council (TPC) are widely used to evaluate database performance, they do not capture forensic requirements such as evidentiary completeness, tamper-evidence, chain of custody, or regulatory compliance under GDPR and CCPA. This survey examines the emerging domain of forensic database benchmarking. We gathered prior research on database forensics, secure logging, and tamper-evident data structures; we analyze modern forensic-ready features in commercial and open-source systems (SQL Server Ledger, Oracle Blockchain Tables, PostgreSQL pgAudit, Db2 Audit, Aurora Database Activity Streams, Oracle Real Application Security and IBM Guardium) and assess why existing benchmarks are insufficient. We propose forensic workloads, metrics, and methodologies that incorporate adversarial stressors, deleted-record recovery, and backup analysis. We also identify open research problems and call for a community-driven forensic benchmark suite. The result is an idea for evaluating not only database performance but also forensic soundness, bridging the gap between system engineering, compliance, and digital investigations.

Lenard, Ben↗
DOE OSTI2018

Ultrasound-based formation of nano-Pickering emulsions investigated via in-situ SAXS

We report that sonication is one of the most commonly used methods to synthesize Pickering emulsions. Yet, the process of emulsion sonication is rarely characterized in detail and acoustic conditions are largely determined by experimenter's personal experience. In this study, the role of sonication in the formation of Pickering emulsions from amphiphilic gold nanoparticles was investigated using a new sample environment combining ultrasound delivery with ultra-small-angle X-ray scattering (USAXS) measurements. The detection of acoustic cavitation and the simultaneous analysis of structural data via USAXS demonstrated direct correlation between Pickering emulsion formation and cavitation events. There was no evidence of spontaneous adsorption of particles onto the oil-water interface without ultrasound, which suggests the presence of a stabilizing force. Acoustically detected cavitation events could originate in the bulk solvent and/or inside the emulsion droplets. Lastly, these events helped overcome energy barriers to induce particle adsorption.

36 MATERIALS SCIENCE↗
DOE OSTI2016

The Plasma Simulation Code: A modern particle-in-cell code with patch-based load-balancing

This work describes the Plasma Simulation Code (psc), an explicit, electromagnetic particle-in-cell code with support for different order particle shape functions. We review the basic components of the particle-in-cell method as well as the computational architecture of the psc code that allows support for modular algorithms and data structure in the code. We then describe and analyze in detail a distinguishing feature of psc: patch-based load balancing using space-filling curves which is shown to lead to major efficiency gains over unbalanced methods and a previously used simpler balancing method.

Computer Science↗
DOE OSTI2018

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems

We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D algorithm for sparse LU uses a three-dimensional MPI process grid, exploits elimination tree parallelism, and trades off increased memory for reduced per-process communication. We also analyze the asymptotic improvements for planar graphs (e.g., those arising from 2D grid or mesh discretizations) and certain non-planar graphs (specifically for 3D grids and meshes). For a planar graph with $n$ vertices, our algorithm reduces communication volume asymptotically in $n$ by a factor of $\mathscr{O}$ $\Big(\sqrt{log \ n}\Big)$ and latency by a factor of $\mathscr{O}$ $(log \ n)$. For nonplanar cases, our algorithm can reduce the per-process communication volume by 3× and latency by $\mathscr{O}$ $\Big(n^\frac13\Big)$ times. In all cases, the memory needed to achieve these gains is a constant factor. We implemented our algorithm by extending the 2D data structure used in SuperLU_DIST. Our new 3D code achieves empirical speedups up to 27× for planar graphs and up to 3.3× for non-planar graphs over the baseline 2D SuperLU_DIST when run on 24,000 cores of a Cray XC30. We extend the 3D algorithm for heterogeneous architectures by adding the Highly Asynchronous Lazy Offload (Halo) algorithm for co-processor offload. On 4096 nodes of a Cray XK7 with 32,768 CPU cores and 4096 Nvidia K20x GPUs, the 3D algorithm achieves empirical speedups up to 24× for planar graphs and 3.5× for non-planar graphs over the baseline 2D SuperLU_DIST with co-processor acceleration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

“Ni{sub 5}TiO{sub 7}” is Ni{sub 5}TiO{sub 4}(BO{sub 3}){sub 2}

It is shown that the compound known as Ni{sub 5}TiO{sub 7} and considered as a promising catalyst and oxidation product of alloys does not exist and its XRD pattern actually corresponds to Ni{sub 5}TiO{sub 4}(BO{sub 3}){sub 2} - Graphical abstract: XRD pattern of “Ni{sub 5}TiO{sub 7}” (top) is identical to that for Ni{sub 5}TiO{sub 4}(BO{sub 3}){sub 2} (bottom) based on single-crystal structural data. - Highlights: • Popular catalyst known as Ni{sub 5}TiO{sub 7} is actually Ni{sub 5}TiO{sub 4}(BO{sub 3}){sub 2}. • B{sub 2}O{sub 3} came from the flux used for crystal growth. • Some authors reporting this phase did not use any boron compounds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2019

Hydrothermal synthesis of lanthanide rhenium oxides: Structures and magnetism of Ln 2 Re 2 O 7 (OH) (Ln = Pr, Nd) and Ln 4 Re 2 O 11 (Ln = Eu, Tb)

The reactions of Ln 2 O 3 (Ln =LaLu) with ReO 2 were examined in high temperature hydrothermal water (650 °C). In all cases the rhenium oxide was added in a three-fold excess. No external mineralizer was needed and the rhenate itself acted as a sufficient mineralizer to form high quality single crystals of several crystalline products. These form in good yield with compositions varying as a function of the size of the rare earth ion. The largest sesquioxide, La 2 O 3 , forms the well-known La 4 Re 6 O 19 phase, but when Ln = Nd or Pr, a new product, Ln 2 Re 2 O 7 (OH), is isolated. Reactions with Ln = SmTb form Ln 4 Re 2 O 11 , and those with DyLu form Ln 2 ReO 5 . The new Ln 2 Re 2 O 7 (OH) series was characterized as a new structure type by single crystal X-ray diffraction. This structure features a tetrameric Re 4 O 16 cluster embedded in a lanthanide oxide framework. Additional detailed structural data is also provided for Tb 4 Re 2 O 11 and Eu 4 Re 2 O 11 , which were not previously reported for the Ln 4 Re 2 O 11 family. In Ln 2 Re 2 O 7 (OH), no direct ReRe bond (ReRe = 2.60 Å) is observed while Ln 4 Re 2 O 11 appears to possess a rhenium-rhenium double bond with a ReRe distance of 2.42 Å. Single crystal Raman data supports both of these characterizations. Magnetic data is reported for Ln 2 Re 2 O 7 (OH) and Tb 4 Re 2 O 11 , and their behavior appears to be dominated by the f-element magnetic moments. At low temperatures Tb 4 Re 2 O 11 displays possible canted antiferromagnetic coupling.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Automated phase segmentation and quantification of high-resolution TEM image for alloy design

In the alloy design and development process, a wealth of atomically resolved structural high-resolution transmission electron microscopy (HRTEM) images are produced. Identifying the different nano-precipitate phases and tracking their evolution under various compositions and during manufacturing or post-processing requires hundreds of HRTEM images and thousands of precipitates. The nanoscopic phase information labeling and analysis purely relies on humans are prohibitively costly and time-consuming, sometimes not reliable because of the lack of authoritative knowledge. Here, in this work, we develop a novel unsupervised machine learning approach coupled with adaptive computer vision techniques with features in the Fourier space to automatically determine the number of phases and segment/quantify the phases with nanoscale resolution, allowing for quantitative correlation between nanostructure formation, processing and functional properties. To automate the phase extraction/quantification and ascertain its applicability, we have applied the developed framework to the HRTEM images from several alloy systems, processing conditions, image magnifications, and phase types and morphologies (precipitates, nano-twins, stacking faults, crystalline matrix, and amorphous structures) for verification. This study paves the road for compression, visualization, and translation of raw image structural data into physically relevant information in real-time with minimal human supervision. It shows the promise of enabling high-throughput materials characterization for the acceleration of alloy manufacturing and design.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Nuclear Structure and Decay Data for A=31 Isobars

Here, experimental nuclear spectroscopic data are evaluated for 11 known nuclides of mass 31 (F, Ne, Na, Mg, Al, Si, P, S, Cl, Ar, K). Detailed evaluated information is presented for each reaction and decay experiment. Combining all the available data, recommended values are provided for energies, spins and parities, and half-lives of levels, with energies, branching ratios and multipolarities of γ radiations, and characteristics of β and α radiations in radioactive decays. 31 P is the most extensively studied one among all nuclides via various reactions and decays, followed by 31 S, 31 Si, 31 Mg and 31 Al. Information for excited states in 31 Ne, 31 Na, 31 Cl, 31 Ar and 31 K are limited; no excited states have yet been identified in 31 F, even its ground-state half-life is unknown. Significant new data have become available for the structure of 31 S, with its relevance to astrophysical applications. This work supersedes the earlier evaluation of A=31 by 2013Ou01, with literature cutoff date of Feb 15, 2013.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗