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,099 records · Page 61

Inactivation-mimicking block of the epithelial calcium channel TRPV6

Epithelial calcium channel TRPV6 plays vital roles in calcium homeostasis, and its dysregulation is implicated in multifactorial diseases, including cancers. Here, we study the molecular mechanism of selective nanomolar-affinity TRPV6 inhibition by (4-phenylcyclohexyl)piperazine derivatives (PCHPDs). We use x-ray crystallography and cryo–electron microscopy to solve the inhibitor-bound structures of TRPV6 and identify two types of inhibitor binding sites in the transmembrane region: (i) modulatory sites between the S1-S4 and pore domains normally occupied by lipids and (ii) the main site in the ion channel pore. Our structural data combined with mutagenesis, functional and computational approaches suggest that PCHPDs plug the open pore of TRPV6 and convert the channel into a nonconducting state, mimicking the action of calmodulin, which causes inactivation of TRPV6 channels under physiological conditions. This mechanism of inhibition explains the high selectivity and potency of PCHPDs and opens up unexplored avenues for the design of future-generation biomimetic drugs.

59 BASIC BIOLOGICAL SCIENCES↗

Discovering polyelemental nanostructures with redistributed plasmonic modes through combinatorial synthesis

Coupling plasmonic and functional materials provides a promising way to generate multifunctional structures. However, finding plasmonic nanomaterials and elucidating the roles of various geometric and dielectric configurations are tedious. This work describes a combinatorial approach to rapidly exploring and identifying plasmonic heteronanomaterials. Symmetry-broken noble/non-noble metal particle heterojunctions (~100 nanometers) were synthesized on multiwindow silicon chips with silicon nitride membranes. The metal types and the interface locations were controlled to establish a nanoparticle library, where the particle morphology and scattering color can be rapidly screened. By correlating structural data with near- and far-field single-particle spectroscopy data, we found that certain low-energy plasmonic modes could be supported across the heterointerface, while others are localized. Furthermore, we found a series of triangular heteronanoplates stabilized by epitaxial Moiré superlattices, which show strong plasmonic responses despite largely comprising a lossy metal (~70 atomic %). These architectures can become the basis for multifunctional and cost-effective plasmonic devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effect of Passive Administration of Monoclonal Antibodies Recognizing Simian Immunodeficiency Virus (SIV) V2 in CH59-Like Coil/Helical or β -Sheet Conformations on Time of SIV mac251 Acquisition

The monoclonal antibodies (MAbs) NCI05 and NCI09, isolated from a vacci nated macaque that was protected from multiple simian immunodeficiency virus (SIV) chal lenges, both target an overlapping, conformationally dynamic epitope in SIV envelope vari able region 2 (V2). Here, we show that NCI05 recognizes a CH59-like coil/helical epitope, whereas NCI09 recognizes a b-hairpin linear epitope. In vitro, NCI05 and, to a lesser extent, NCI09 mediate the killing of SIV-infected cells in a CD4-dependent manner. Compared to NCI05, NCI09 mediates higher titers of antibody-dependent cellular cytotoxicity (ADCC) to gp120-coated cells, as well as higher levels of trogocytosis, a monocyte function that contributes to immune evasion. We also found that passive administration of NCI05 or NCI09 to macaques did not affect the risk of SIV mac251 acquisition compared to controls, demonstrating that these anti-V2 antibodies alone are not protective. However, NCI05 but not NCI09 mucosal levels strongly correlated with delayed SIV mac251 acquisition, and functional and structural data suggest that NCI05 targets a transient state of the viral spike apex that is partially opened, compared to its prefusion-closed conformation.

60 APPLIED LIFE SCIENCES↗

Distortion of V{sup z+}O{sub n} coordination polyhedra and parameters of the bond valence model for V-O bonds in inorganic crystals

The dependences of average V-O distances in inorganic compounds of vanadium of different valence on the degree of distortion of coordination polyhedra have been obtained by careful statistical treatment of modern structural data banks. Values of bond lengths in undistorted (regular) polyhedra are recommended. Theoretical analysis of the statistical data made it possible to calculate the most likely values of the parameters of the bond valence model: the interatomic distance for the single (two-electron) bond, corresponding to the single valence, and the bond softness parameter. Calculations of the sums of bond valences for some complicated cases (different coordination numbers, mixed vanadium valence) confirmed reliability of the recommended parameters.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accurate Crystal Structure Refinement of La{sub 3}Ta{sub 0.25}Zr{sub 0.50}Ga{sub 5.25}O{sub 14}

An accurate X-ray diffraction study of a La{sub 3}Ta{sub 0.25}Zr{sub 0.50}Ga{sub 5.25}O{sub 14} single crystal (a = 8.2574(4) A, c = 5.1465(4) A, sp. gr. P321, Z = 1, R/R{sub w} = 0.62/0.57% for 4144 unique reflections and 91 parameters) has been performed with a simultaneous neutron diffraction analysis. Tantalum, zirconium, and gallium atoms are found to occupy the mixed octahedral position (symmetry 32). Gallium atoms and a few zirconium atoms are in the position on axis 2 in the tetrahedron. The tetrahedral position on axis 3 is completely occupied by gallium atoms, while the large polyhedron on axis 2 is occupied by lanthanum atoms. The high resolution and averaging of the results obtained in two independent X-ray experiments with the same sample provided accu- rate structural data, in particular, on the anharmonicity of thermal atomic vibrations (atomic displacements). The X-ray and neutron diffraction data on the atomic displacements are compared.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Investigation of the structure and properties of K{sub 9}H{sub 7}(SO{sub 4}){sub 8} {center_dot} H{sub 2}O single crystals

The features of the conductivity of K{sub 9}H{sub 7}(SO{sub 4}){sub 8} {center_dot} H{sub 2}O single-crystal samples in the temperature range of superprotonic phase transition have been investigated. The K{sub 9}H{sub 7}(SO{sub 4}){sub 8} {center_dot} H{sub 2}O crystal structure is determined and refined taking into account hydrogen atoms by X-ray diffraction analysis at a temperature of 295 K: monoclinic symmetry, sp. gr. P2{sub 1}/c, Z = 4, a = 7.059(1), b = 19.773(1), c = 23.449(1) Angstrom-Sign , {beta} = 95.33(1) Degree-Sign , R{sub 1}/wR{sub 2} = 2.71/1.71. The structural data obtained suggest that the occurrence of high conductivity in K{sub 9}H{sub 7}(SO{sub 4}){sub 8} {center_dot} H{sub 2}O crystals with an increase in temperature is related to the diffusion of crystallization water and motion of K ions, as well as to the transformation of the system of hydrogen bonds and protonic motion. The stabilization of the high-temperature superprotonic phase and its supercooling to low temperatures are due to the presence of channels for the motion of K ions and slow backward diffusion of water in the crystal.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Nanostructured crystals of fluorite phases Sr{sub 1-x}R{sub x}F{sub 2+x} and their ordering: 7. A procedure for cluster modeling of Sr{sub 1-x}R{sub x}F{sub 2+x} Based on the Structure of an Ordered Phase (R = Lu)

Single crystals of the Sr{sub 1-x}Lu{sub x}F{sub 2+x} nonstoichiometric phase (x = 0.095 and 0.189), which crystallizes in the CaF{sub 2} structure type (space group Fm3-barm), are studied by X-ray diffraction. A procedure for the cluster modeling of Sr{sub 1-x}Lu{sub x}F{sub 2+x} based on the fine structural features of the Sr{sub 4}Lu{sub 3}F{sub 17} stoichiometric compound with a fluorite derivative structure (one of the ordered phases in the SrF{sub 2}-LuF{sub 3} system) is proposed. The description of the structure of the Sr{sub 1-x}Lu{sub x}F{sub 2+x} solid solutions is based on the octacubic configuration of the {l_brace}M{sub 14-n}R{sub n}F{sub 64+n}{r_brace} defect cluster. Structural data on the displacements of cations and anions in the ordered Sr{sub 4}Lu{sub 3}F{sub 17} phase (in relation to the undistorted fluorite phase) allow one to identify the distortions of the crystal lattice of the disordered (nonstoichiometric) Sr{sub 1-x}Lu{sub x}F{sub 2+x} phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Deciphering spin-parity assignments of nuclear levels

Spin-parity assignments of nuclear levels are critical for understanding nuclear structure and reactions. However, inconsistent notation conventions and ambiguous reporting in research papers often lead to confusion and misinterpretations. Here, this paper examines the policies of the Evaluated Nuclear Structure Data File (ENSDF) and the evaluations by Endt and collaborators, highlighting key differences in their approaches to spin-parity notation. Sources of confusion are identified, including ambiguous use of strong and weak arguments and the conflation of new experimental results with prior constraints. Recommendations are provided to improve clarity and consistency in reporting spin-parity assignments, emphasizing the need for explicit notation conventions, clear differentiation of argument strengths, community education, and separate reporting of new findings. These steps aim to enhance the accuracy and utility of nuclear data for both researchers and evaluators.

Experimental Nuclear Physics↗

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↗

Distributed merge trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges. Copyright © 2013 ACM 978-1-4503-1922-5/13/ 02...$15.00.

Morozov, D↗

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗

What does fault tolerant Deep Learning need from MPI?

Deep Learning (DL) algorithms have become the {\em de facto} Machine Learning (ML) algorithm for large scale data analysis. DL algorithms are computationally expensive -- even distributed DL implementations which use MPI require days of training (model learning) time on commonly studied datasets. Long running DL applications become susceptible to faults -- requiring development of a fault tolerant system infrastructure, in addition to fault tolerant DL algorithms. This raises an important question: {\em What is needed from MPI for designing fault tolerant DL implementations?} In this paper, we address this problem for permanent faults. We motivate the need for a fault tolerant MPI specification by an in-depth consideration of recent innovations in DL algorithms and their properties, which drive the need for specific fault tolerance features. We present an in-depth discussion on the suitability of different parallelism types (model, data and hybrid); a need (or lack thereof) for check-pointing of any critical data structures; and most importantly, consideration for several fault tolerance proposals (user-level fault mitigation (ULFM), Reinit) in MPI and their applicability to fault tolerant DL implementations. We leverage a distributed memory implementation of Caffe, currently available under the Machine Learning Toolkit for Extreme Scale (MaTEx). We implement our approaches by extending MaTEx-Caffe for using ULFM-based implementation. Our evaluation using the ImageNet dataset and AlexNet neural network topology demonstrates the effectiveness of the proposed fault tolerant DL implementation using OpenMPI based ULFM.

Amatya, Vinay C.↗

Lightweight Detection of Cache Conflicts

In memory hierarchies, caches perform an important role in reducing average memory access latency. Minimizing cache misses can yield significant performance gains. As set-associative caches are widely used in modern architectures, capacity and conflict cache misses co-exist. These two types of cache misses require different optimization strategies. While cache misses are commonly studied using cache simulators, state-of-the-art simulators usually incur hundreds to thousands of times a program’s execution runtime. Moreover, a simulator has difficulty in simulating complex real hardware. To overcome these limitations, measurement methods are proposed to directly monitor program execution on real hardware via performance monitoring units. However, existing measurement-based tools either focus on capacity cache misses or do not distinguish capacity and conflict cache misses. In this paper, we design and implement CCProf, a lightweight measurement-based profiler that identifies conflict cache misses and associates them with program source code and data structures. CCProf incurs moderate runtime overhead that is at least an order of magnitude lower than simulators. With the evaluation on a number of representative programs, CCProf is able to guide optimizations on cache conflict misses and obtain nontrivial speedups.

Roy, Probir↗

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗

Tetrahedral Trees: A Family of Hierarchical Spatial Indexes for Tetrahedral Meshes

In this work, we address the problem of performing efficient spatial and topological queries on large tetrahedral meshes with arbitrary topology and complex boundaries. Such meshes arise in several application domains, such as 3D Geographic Information Systems (GISs), scientific visualization, and finite element analysis. To this aim, we propose Tetrahedral trees, a family of spatial indexes based on a nested space subdivision (an octree or a kD-tree) and defined by several different subdivision criteria. We provide efficient algorithms for spatial and topological queries on Tetrahedral trees and compare to state-of-the-art approaches. Our results indicate that Tetrahedral trees are an improvement over R*-trees for querying tetrahedral meshes; they are more compact, faster in many queries, and stable at variations of construction thresholds. They also support spatial queries on more general domains than topological data structures, which explicitly encode adjacency information for efficient navigation but have difficulties with domains with a non-trivial geometric or topological shape.

97 MATHEMATICS AND COMPUTING↗

Single-node Partitioned-Memory for Huge Graph Analytics: Cost and Performance Trade-offs

Nonvolatile memory NVDIMMs, available as Intel Optane, are less expensive than DRAM and bring large byte-addressable storage within reach to many applications. Evaluations on graph analytics have shown promising performance only when DRAM is used as a hardware cache (Memory mode). An open question is whether graph applications can exploit Optane and DRAM directly (AppDirect mode) and achieving better-than-DRAM average bandwidth and run times. We evaluate Optane as a volatile pool on two large-scale graph applications with very different computational patterns, Grappolo and Ripples. We show that AppDirect mode can deliver better-than-DRAM performance, by allocating data structures to Optane and DRAM according to their access characteristics, resulting in higher average memory bandwidth and lower average latency. Memory mode provides DRAM-competitive performance with capacity equal to persistent memory. We demonstrate occasional 4x improvement using the latest AppDirect option and frequently observe competitive performance between Optane AppDirect Memory modes and DRAM.

Ghosh, Sayan↗

Unified many-worlds browsing of arbitrary physics-based animations

Manually tuning physics-based animation parameters to explore a simulation outcome space or achieve desired motion outcomes can be notoriously tedious. This problem has motivated many sophisticated and specialized optimization-based methods for fine-grained (keyframe) control, each of which are typically limited to specific animation phenomena, usually complicated, and, unfortunately, not widely used. In this paper, we propose Unified Many-Worlds Browsing (UMWB), a practical method for sample-level control and exploration of physics-based animations. Our approach supports browsing of large simulation ensembles of arbitrary animation phenomena by using a unified volumetric WORLDPACK representation based on spatiotemporally compressed voxel data associated with geometric occupancy and other low-fidelity animation state. Beyond memory reduction, the WORLDPACK representation also enables unified query support for interactive browsing: it provides fast evaluation of approximate spatiotemporal queries, such as occupancy tests that find ensemble samples ("worlds") where material is either IN or NOT IN a user-specified spacetime region. WORLDPACKS also support real-time hardware-accelerated voxel rendering by exploiting the spatially hierarchical and temporal RLE raster data structure. Our UMWB implementation supports interactive browsing (and offline refinement) of ensembles containing thousands of simulation samples, and fast spatiotemporal queries and ranking. We show UMWB results using a wide variety of physics-based animation phenomena---not just JELL-O ® .

Computer Science↗

Towards Superior Software Portability with SHAD and HPX C++ Libraries

As hardware architectures and software stacks complexity grows, development productivity, performance and software portability, quickly evolve from desirable features to actual needs. SHAD, the Scalable High-performance Algorithms and Data-structures C++ library is designed to mitigate these issues: it provides general purpose building blocks as well as high-level custom utilities, and offers a shared-memory programming abstraction which facilitates the programming of complex systems, scaling up to High Performance Computing clusters. SHAD’s portability is achieved through an abstract runtime interface, which decouples the upper layers of the library and hides the low level details of the underlying architecture. This layer enables SHAD to interface with different runtime/threading systems, e.g. Intel TBB and Global Memory and Threading (GMT). However, current backends targeting distributed systems, rely on a centralized controller which may possibly limit scalability up to hundreds of nodes and creates a network hot spot due to all to one communication for synchronization, and possibly resulting in degraded performance at high process counts. In this research, we explore HPX, the C++ standard library for parallelism and concurrency, as an additional backend in support of the SHAD library, and present the methodologies in support of local and remote task executions in SHAD with respect to HPX. Finally, we evaluate the proposed system by comparing against existing backends of SHAD and analyzing their performance on C++ Standard Template Library algorithms.

Wu, Nanmiao↗