Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

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,315 records · Page 73

Robust Computation of Morse-Smale Complexes of Bilinear Functions

The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, existing algorithms to compute the MS complex are restricted to either piecewise linear or discrete scalar fields. This paper presents a new combinatorial algorithm to compute MS complexes for two dimensional piecewise bilinear functions defined on quadrilateral meshes. We derive a new invariant of the gradient flow within a bilinear cell and use it to develop a provably correct computation which is unaffected by numerical instabilities. This includes a combinatorial algorithm to detect and classify critical points as well as a way to determine the asymptotes of cell-based saddles and their intersection with cell edges. Finally, we introduce a simple data structure to compute and store integral lines on quadrilateral meshes which by construction prevents intersections and enables us to enforce constraints on the gradient flow to preserve known invariants.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Extraction of Hydrological Proximity Measures from DEMs using Parallel Processing

Land surface topography is one of the most important terrain properties which impact hydrological, geomorphological, and ecological processes active on a landscape. In our previous efforts to develop a soil depth model based upon topographic and land cover variables, we extracted a set of hydrological proximity measures (HPMs) from a Digital Elevation Model (DEM) as potential explanatory variables for soil depth. These HPMs may also have other, more general modeling applicability in hydrology, geomorphology and ecology, and so are described here from a general perspective. The HPMs we derived are variations of the distance up to ridge points (cells with no incoming flow) and variations of the distance down to stream points (cells with a contributing area greater than a threshold), following the flow path. These HPMs were computed using the D-infinity flow model that apportions flow between adjacent neighbors based on the direction of steepest downward slope on the eight triangular facets constructed in a 3 x 3 grid cell window using the center cell and each pair of adjacent neighboring grid cells in turn. The D-infinity model typically results in multiple flow paths between 2 points on the topography, with the result that distances may be computed as the minimum, maximum or average of the individual flow paths. In addition, each of the HPMs, are calculated vertically, horizontally, and along the land surface. Previously, these HPMs were calculated using recursive serial algorithms which suffered from stack overflow problems when used to process large datasets, limiting the size of DEMs that could be analyzed using that method to approximately 7000 x 7000 cells. To overcome this limitation, we developed a message passing interface (MPI) parallel approach for calculating these HPMs. The parallel algorithms of the HPMs spatially partition the input grid into stripes which are each assigned to separate processes for computation. Each of those processes then uses a queue data structure to order the processing of cells so that each cell is visited only once and the cross-process communications that are a standard part of MPI are handled in an efficient manner. This parallel approach allows analysis of much larger DEMs as compared to the serial recursive algorithms. In this paper, we present the definitions of the HPMs, the serial and parallel algorithms used in their extraction and their potential applications in hydrology, geomorphology and ecology.

54 ENVIRONMENTAL SCIENCES↗

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↗

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↗

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↗

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↗

Crystallographic Snapshots of the Complete Catalytic Cycle of the Unregulated Aspartate Transcarbamoylase from Bacillus subtilis

Here, we report high-resolution X-ray structures of Bacillus subtilis aspartate transcarbamoylase (ATCase), an enzyme that catalyzes one of the first reactions in pyrimidine nucleotide biosynthesis. Structures of the enzyme have been determined in the absence of ligands, in the presence of the substrate carbamoyl phosphate, and in the presence of the bisubstrate/transition state analog N-phosphonacetyl-L-aspartate. Combining the structural data with in silico docking and electrostatic calculations, we have been able to visualize each step in the catalytic cycle of ATCase, from the ordered binding of the substrates, to the formation and decomposition of the tetrahedral intermediate, to the ordered release of the products from the active site. Analysis of the conformational changes associated with these steps provides a rationale for the lack of cooperativity in trimeric ATCases that do not possess regulatory subunits.

59 BASIC BIOLOGICAL SCIENCES↗

Optimization of a Lattice Boltzmann Computation on State-of-the-Art Multicore Platforms

We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of search-based performance optimizations, popular in linear algebra and FFT libraries, to application-specific computational kernels. Our work applies this strategy to a lattice Boltzmann application (LBMHD) that historically has made poor use of scalar microprocessors due to its complex data structures and memory access patterns. We explore one of the broadest sets of multicore architectures in the HPC literature, including the Intel Xeon E5345 (Clovertown), AMD Opteron 2214 (Santa Rosa), AMD Opteron 2356 (Barcelona), Sun T5140 T2+ (Victoria Falls), as well as a QS20 IBM Cell Blade. Rather than hand-tuning LBMHD for each system, we develop a code generator that allows us to identify a highly optimized version for each platform, while amortizing the human programming effort. Results show that our auto-tuned LBMHD application achieves up to a 15x improvement compared with the original code at a given concurrency. Additionally, we present detailed analysis of each optimization, which reveal surprising hardware bottlenecks and software challenges for future multicore systems and applications.

97 MATHEMATICS AND COMPUTING↗

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↗

Structure refinements of members in the brownmillerite solid solution series Ca{sub 2}Al{sub x}(Fe{sub 0.5}Mn{sub 0.5}){sub 2-x}O{sub 5+{delta}} with 1/2{<=}x{<=}4/3

Four different brownmillerite solid solutions Ca{sub 2}Al{sub x}(Fe{sub 0.5}Mn{sub 0.5}){sub 2-x}O{sub 5+{delta}} with 1/2{<=}x{<=}4/3 were synthesized by a solid oxide ceramic method. The phases crystallize either in a primitive centered orthorhombic cell with space group Pnma or in a body centered cell with space group I2mb dependent on the aluminum concentration present in the solid solution. Mn{sup 3+} ions occupy exclusively site 4a coordinated by six oxygen anions. Increasing Mn{sup 3+} concentrations cause a remarkable distortion of the octahedron and indirectly of the tetrahedron, resulting in twisted and tilted octahedral layers as well as buckled tetrahedral chains. The influences are discussed on the site 4a of trivalent manganese due to its Jahn-Teller activity, with regard to the occupation of octahedron and tetrahedron with different sized iron and aluminum ions. - Graphical Abstract: The coupled substitution Fe{sup 3+}>Mn{sup 3+}+Fe{sup 3+} <=>2 Al{sup 3+} in brownmillerite phases (Ca{sub 2}(Fe{sub 0.5}Mn{sub 0.5}){sub 2-x}Al{sub x}O{sub 5+{delta}}) changes predominantly their structural properties, which is essential for the hydration performance of the calcium aluminate cement, where brownmillerites occur as clinker phases. Highlights: Black-Right-Pointing-Pointer We present structural data of four Ca-Al-Fe-Mn-brownmillerites. Black-Right-Pointing-Pointer Mn{sup 3+}-ions occupy exclusively the octahedrally coordinated site 0,0,0. Black-Right-Pointing-Pointer Bonds and angles of the octahedrally coordinated site are distorted strongly. Black-Right-Pointing-Pointer Mn{sup 3+}-ions influence indirectly the shape of the tetrahedron. Black-Right-Pointing-Pointer Mn{sup 3+}-ions stabilize Pnma instead of I2mb in Ca-Al-Fe-Mn-brownmillerites.

36 MATERIALS SCIENCE↗