Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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,243 records · Page 69

Solving a Large Scale Thermal Radiation Problem Using an Interoperable Executive Library Framework on Petascale Supercomputers

We present a novel methodology to compute the transient thermal condi- tion of a set of objects in an open space environment. The governing energy equa- tion and the convective energy transfer are solved by the sparse iterative solvers. The average radiating energy on a set of surfaces is represented by a linear system of the radiosity equations, which is factorized by an out-of-core parallel Cholesky decomposition solver. The coupling and interplay of the direct radiosity solver us- ing GPUs and the CPU-based sparse solver are handled by a light weight software integrator called Interoperable Executive Library (IEL). IEL manages the distribu- tion of data and memory, coordinates communication among parallel processes, and also directs execution of the set of loosely coupled physics tasks as warranted by the thermal condition of the simulated object and its surrounding environment.

Wong, Kwai↗

Graph theory inspired anomaly detection at the LHC

Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an unsupervised, model-agnostic tool for anomaly detection, using the LHC Olympics dataset as a benchmark. By representing jet constituents as a graph, we introduce a method to systematically control the information available to the model through sparse graph constructions that serve as physically motivated inductive biases. Specifically, (1) we construct graph autoencoders based on locally rigid Laman graphs and globally rigid unique graphs, and (2) we explore the clustering of jet constituents into subjets to interpolate between high- and low-level input representations. We obtain the best performance, measured in terms of the Significance Improvement Characteristic curve for an intermediate level of subjet clustering and certain sparse unique graph constructions. We further investigate the role of graph connectivity in jet classification tasks. Our results demonstrate the potential of leveraging graph-theoretic insights to refine and increase the interpretability of machine learning tools for collider experiments.

Automation↗

A conformal collider for holographic CFTs

We develop a formalism to study the implications of causality on OPE coefficients in conformal field theories with large central charge and a sparse spectrum of higher spin operators. The formalism has the interpretation of a new conformal collider-type experiment for these class of CFTs and hence it has the advantage of requiring knowledge only about CFT three-point functions. This is accomplished by considering the holographic null energy operator which was introduced in [ 1 ] as a generalization of the averaged null energy operator. Analyticity properties of correlators in the Regge limit imply that the holographic null energy operator is a positive operator in a subspace of the total CFT Hilbert space. Utilizing this positivity condition, we derive bounds on three-point functions $\langle$ TO 1 O 2 $\rangle$of the stress tensor with various operators for CFTs with large central charge and a sparse spectrum. After imposing these constraints, we also find that the operator product expansions of all primary operators in the Regge limit have certain universal properties. All of these results are consistent with the expectation that CFTs in this class, irrespective of their microscopic details, admit universal gravity-like holographic dual descriptions. Furthermore, this connection enables us to constrain various inflationary observables such as the amplitude of chiral gravity waves, non-gaussanity of gravity waves and tensor-to-scalar ratio.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Metabolic skinflint or spendthrift? Insights into ground sloth integument and thermophysiology revealed by biophysical modeling and clumped isotope paleothermometry

Abstract Remains of megatheres have been known since the 18th -century and were among the first megafaunal vertebrates to be studied. While several examples of preserved integument show a thick coverage of fur for smaller ground sloths living in cold climates such as Mylodon and Nothrotheriops , comparatively very little is known about megathere skin. Assuming a typical placental mammal metabolism, it was previously hypothesized that megatheres would have had little-to-no fur as they achieved giant body sizes. Here the “hairless model of integument” is tested using geochemical analyses to estimate body temperature to generate novel models of ground sloth metabolism, fur coverage, and paleoclimate with Niche Mapper software. The simulations assuming metabolic activity akin to those of modern xenarthrans suggest that sparse fur coverage would have resulted in cold stress across most latitudinal ranges inhabited by extinct ground sloths. Specifically, Eremotherium predominantly required dense 10 mm fur with implications for seasonal changes of coat depth in northernmost latitudes and sparse fur in the tropics; Megatherium required dense 30 mm fur year-round in its exclusive range of cooler, drier climates; Mylodon and Nothrotheriops required dense 10–50 mm fur to avoid thermal stress, matching the integument remains of both genera, and further implying the use of behavioral thermoregulation. Moreover, clumped isotope paleothermometry data from the preserved teeth of four genera of ground sloth yielded reconstructed body temperatures lower than those previously reported for large terrestrial mammals (29 ± 2°–32 ± 3° C). This combination of low metabolisms and thick fur allowed ground sloths to inhabit various environments.

Deak, Michael D.↗

Entropy Stable Conservative Flux Form Neural Networks

We propose an entropy-stable conservative flux form neural network (CFN) to predict the dynamics of unknown governing conservation laws. The design of the network is based on the entropy-stable, second-order, and non-oscillatory Kurganov-Tadmor (KT) scheme. The proposed entropy-stable CFN, hereafter referred to as ESCFN, uses slope limiting as a denoising mechanism, ensuring accurate predictions in both noisy and sparse observation environments, as well as in both smooth and discontinuous regions. Importantly, our method is designed to predict long term dynamics of the unknown conservation law exclusively from a short temporal window of observed data, that is, without oracle knowledge of the PDE or later-time solution profiles. Numerical experiments demonstrate that the ESCFN achieves both stability and conservation while maintaining accuracy over extended time domains, and successfully predicts shock propagation speeds in long-term simulations. Furthermore, it is also robust to both noisy and sparse data environments.

Hyperbolic conservation laws↗

A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

The basic matrix library (BML) for quantum chemistry

The basic matrix library package (BML) provides a common application programming interface (API) for linear algebra and matrix functions in C and Fortran for quantum chemistry codes. The BML API is matrix format independent. Currently the dense, compressed sparse row, and ELLPACK-R sparse matrix data types are available, each with different implementations. We show how the second-order spectral projection (SP2) algorithm used to compute the electronic structure of a molecular system represented with a tight-binding Hamiltonian can be successfully implemented with the aid of this library.

97 MATHEMATICS AND COMPUTING↗

Multiscale Modeling Meets Machine Learning: What Can We Learn?

Machine learning is increasingly recognized as a promising technology in the biological, biomedical, and behavioral sciences. There can be no argument that this technique is incredibly successful in image recognition with immediate applications in diagnostics including electrophysiology, radiology, or pathology, where we have access to massive amounts of annotated data. However, machine learning often performs poorly in prognosis, especially when dealing with sparse data. This is a field where classical physics-based simulation seems to remain irreplaceable. In this review, we identify areas in the biomedical sciences where machine learning and multiscale modeling can mutually benefit from one another: Machine learning can integrate physics-based knowledge in the form of governing equations, boundary conditions, or constraints to manage ill-posted problems and robustly handle sparse and noisy data; multiscale modeling can integrate machine learn- ing to create surrogate models, identify system dynamics and parameters, analyze sensitivities, and quantify uncertainty to bridge the scales and understand the emergence of function. With a view towards applications in the life sciences, we discuss the state of the art of combining machine learning and multiscale modeling, identify applications and opportunities, raise open questions, and address potential challenges and limitations. We anticipate that it will stimulate discussion within the community of computational mechanics and reach out to other disciplines including mathematics, statistics, computer science, artificial intelligence, biomedicine, systems biology, and precision medicine to join forces towards creating robust and efficient models for biological systems.

machine learning, multiscale modeling, physics-bas↗

Subsurface Grain Morphology Reconstruction by Differential Aperture X-ray Microscopy

A multistep, non-destructive grain morphology reconstruction methodology that is applicable to near-surface volumes is developed and tested on synthetic grain structures. This approach probes the subsurface crystal orientation using differential aperture x-ray microscopy on a sparse grid across the microstructure volume of interest. Resulting orientation data are clustered according to proximity in physical and orientation space and used as seed points for an initial Voronoi tessellation to (crudely) approximate the grain morphology. Curvature-driven grain boundary relaxation, simulated by means of the Voronoi implicit interface method, progressively improves the reconstruction accuracy. The similarity between bulk and readily accessible surface reconstruction error provides an objective termination criterion for boundary relaxation.

36 MATERIALS SCIENCE↗

Predicting System Response at Unmeasured Locations

Traditional techniques to derive dynamic specification for components have a great deal of uncertainty. One of the major sources of uncertainty is that the number of response measurements in the operational system environment is insufficient to determine the component motion. This inadequacy is due to logistical limitations for data recording in field testing and space limitations for accelerometers, strain gages and associated wiring. Available measurements are often some distance from the component and therefore do not represent component motion. Typical straight-line envelopes of these unrepresentative measurements guarantee an increase in the uncertainty. In this paper multiple methods are attempted to expand a sparse set of field test measurements on a system to responses of interest that cannot be measured in the field due to the limitations. Proof of concept is demonstrated on the Modal Analysis Test Vehicle (MATV). The responses of interest, known as “truth responses”, are measured in a system vibration environment along with an optimized sparse set of 30 field responses. Methods to expand the field responses to the truth responses are demonstrated by comparing the acceleration spectral density of the expanded response to the measured response. Two methods utilize a validated finite element model of the MATV. One is developed from purely experiment based frequency response functions of a laboratory pre-test. Finally, these approaches are designed to drastically reduce the uncertainty of the component in-service motion as a basis for developing specifications that are guaranteed to be conservative with a known (instead of unknown) conservatism.

42 ENGINEERING↗

Protein expression and isotopic enrichment based on induction of the Entner-Doudoroff pathway in Escherichia coli

Highlights: Black-Right-Pointing-Pointer The Entner-Doudoroff pathway is induced during protein expression in E. coli. Black-Right-Pointing-Pointer 1-{sup 13}C-gluconate and {sup 15}NH{sub 4}Cl provide a carbonyl-amide protein backbone labeling scheme. Black-Right-Pointing-Pointer The enrichment pattern is determined by nuclear magnetic resonance. -- Abstract: The Entner-Doudoroff pathway is known to exist in many organisms including bacteria, archea and eukarya. Although the common route for carbon catabolism in Escherichia coli is the Embden-Meyerhof-Parnas pathway, it was shown that gluconate catabolism in E. coli occurs via the Entner-Doudoroff pathway. We demonstrate here that by supplying BL21(DE3) competent E.coli cells with gluconate in a minimal growth medium, protein expression can be induced. Nuclear magnetic resonance data of over-expressed ubiquitin show that by using [1-{sup 13}C]-gluconate as the only carbon source, and {sup 15}N-enriched ammonium chloride, sparse isotopic enrichment in the form of a spin-pair carbonyl-amide backbone enrichment is obtained. The specific amino acid labeling pattern is analyzed and is shown to be compatible with Entner-Doudoroff metabolism. Isotopic enrichment serves as a key factor in the biophysical characterization of proteins by various methods including nuclear magnetic resonance, mass spectrometry, infrared spectroscopy and more. Therefore, the method presented here can be applied to study proteins by obtaining sparse enrichment schemes that are not based on the regular glycolytic pathway, or to study the Entner-Doudoroff metabolism during protein expression.

60 APPLIED LIFE SCIENCES↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Densely ionizing radiation affects DNA methylation of selective LINE-1 elements

Long Interspersed Nucleotide Element 1 (LINE-1) retrotransposons are heavily methylated and are the most abundant transposable elements in mammalian genomes. Here, we investigated the differential DNA methylation within the LINE-1 under normal conditions and in response to environmentally relevant doses of sparsely and densely ionizing radiation. We demonstrate that DNA methylation of LINE-1 elements in the lungs of C57BL6 mice is dependent on their evolutionary age, where the elder age of the element is associated with the lower extent of DNA methylation. Exposure to 5-aza-2′-deoxycytidine and methionine-deficient diet affected DNA methylation of selective LINE-1 elements in an age- and promoter type-dependent manner. Exposure to densely IR, but not sparsely IR, resulted in DNA hypermethylation of older LINE-1 elements, while the DNA methylation of evolutionary younger elements remained mostly unchanged. We also demonstrate that exposure to densely IR increased mRNA and protein levels of LINE-1 via the loss of the histone H3K9 dimethylation and an increase in the H3K4 trimethylation at the LINE-1 5′-untranslated region, independently of DNA methylation. Our findings suggest that DNA methylation is important for regulation of LINE-1 expression under normal conditions, but histone modifications may dictate the transcriptional activity of LINE-1 in response to exposure to densely IR. - Highlights: • DNA methylation of LINE-1 elements is dependent on their evolutionary age. • Densely ionizing radiation affects DNA methylation of selective LINE-1 elements. • Radiation-induced reactivation of LINE-1 is DNA methylation-independent. • Histone modifications dictate the transcriptional activity of LINE-1.

60 APPLIED LIFE SCIENCES↗

A high-performance workflow system for subsurface simulation

Subsurface modeling applications typically neglect uncertainty in the conceptual models, past or future scenarios, and attribute most or all uncertainty to errors in model parameters. In this contribution, uncertainty in technetium-99 transport in a heterogeneous, deep vadose zone is explored with respect to the conceptual model using a next generation user environment called Akuna. Akuna provides a range of tools to manage environmental modeling projects, from managing simulation data to visualizing results from high-performance computational simulators. Core toolsets accessible through the user interface include model setup, grid generation, parameter estimation, and uncertainty quantification. The BC Cribs site at Hanford in southeastern Washington State is used to demonstrate Akuna capabilities. At the BC Cribs site, conceptualization of the system is highly uncertain because only sparse information is available for the geologic conceptual model, the physical and chemical properties of the sediments, and the history of waste disposal operations. Using the Akuna toolset to perform an analysis of conservative solute transport, significant prediction uncertainty in simulated concentrations is demonstrated by conceptual model variation. This demonstrates that conceptual model uncertainty is an important consideration in sparse data environments such as BC Cribs. It is also demonstrated that Akuna and the underlying toolset provides an integrated modeling environment that streamlines model setup, parameter optimization, and uncertainty analyses for high-performance computing applications.

Akuna↗

Locality-aware and load-balanced static task scheduling for MapReduce

Task scheduling for MapReduce jobs has been an active area of research with the objective of decreasing the amount of data transferred during the shuffle phase via exploiting data locality. In the literature, generally only the scheduling of reduce tasks is considered with the assumption that scheduling of map tasks is already determined by the input data placement. However, in cloud or HPC deployments of MapReduce, the input data is located in a remote storage and scheduling map tasks gains importance. Here, we propose models for simultaneous scheduling of map and reduce tasks in order to improve data locality and balance the processors’ loads in both map and reduce phases. Our approach is based on graph and hypergraph models which correctly encode the interactions between map and reduce tasks. Partitions produced by these models are decoded to schedule map and reduce tasks. A two-constraint formulation utilized in these models enables balancing processors’ loads in both map and reduce phases. The partitioning objective in the hypergraph models correctly encapsulates the minimization of data transfer when a local combine step is performed prior to shuffle, whereas the partitioning objective in the graph models achieve the same feat when a local combine is not performed. Here, we show the validity of our scheduling on the MapReduce parallelizations of two important kernel operations – sparse matrix–vector multiplication (SpMV) and generalized sparse matrix–matrix multiplication (SpGEMM) – that are widely encountered in big data analytics and scientific computations. Compared to random scheduling, our models lead to tremendous savings in data transfer by reducing data traffic from several hundreds of megabytes to just a few megabytes in the shuffle phase and consequently leading up to 2.6x and 4.2x speedup for SpMV and SpGEMM, respectively.

97 MATHEMATICS AND COMPUTING↗

ARCH: Large-scale knowledge graph via aggregated narrative codified health records analysis

Objective: Electronic health record (EHR) systems contain a wealth of clinical data stored as both codified data and free-text narrative notes (NLP). The complexity of EHR presents challenges in feature representation, information extraction, and uncertainty quantification. Here, to address these challenges, we proposed an efficient Aggregated naRrative Codified Health (ARCH) records analysis to generate a large-scale knowledge graph (KG) for a comprehensive set of EHR codified and narrative features. Methods: Using data from 12.5 million Veterans Affairs patients, ARCH first derives embedding vectors and generates similarities along with associated p-values to measure the strength of relatedness between clinical features with statistical certainty quantification. Next, ARCH performs a sparse embedding regression to remove indirect linkage between features to build a sparse KG. Finally, ARCH was validated on various clinical tasks, including detecting known relationships between entity pairs, predicting drug side effects, disease phenotyping, as well as sub-typing Alzheimer’s disease patients. Results: ARCH produces high-quality clinical embeddings and KG for over 60,000 codified and narrative EHR concepts. The KG and embeddings are visualized in the R-shiny powered web-API.3 ARCH achieved high accuracy in detecting EHR concept relationships, with AUCs of 0.926 (codified) and 0.861 (NLP) for similar EHR concepts, and 0.810 (codified) and 0.843 (NLP) for related pairs. It detected drug side effects with a 0.723 AUC, which improved to 0.826 after fine-tuning. Using both codified and NLP features, the detection power increased significantly. Compared to other methods, ARCH has superior accuracy and enhances weakly supervised phenotyping algorithms’ performance. Notably, it successfully categorized Alzheimer’s patients into two subgroups with varying mortality rates. Conclusion: The proposed ARCH algorithm generates large-scale high-quality semantic representations and knowledge graph for both codified and NLP EHR features, useful for a wide range of predictive modeling tasks.

Electronic health records↗

A hybrid method for the parallel computation of Green's functions

Quantum transport models for nanodevices using the non-equilibrium Green's function method require the repeated calculation of the block tridiagonal part of the Green's and lesser Green's function matrices. This problem is related to the calculation of the inverse of a sparse matrix. Because of the large number of times this calculation needs to be performed, this is computationally very expensive even on supercomputers. The classical approach is based on recurrence formulas which cannot be efficiently parallelized. This practically prevents the solution of large problems with hundreds of thousands of atoms. We propose new recurrences for a general class of sparse matrices to calculate Green's and lesser Green's function matrices which extend formulas derived by Takahashi and others. We show that these recurrences may lead to a dramatically reduced computational cost because they only require computing a small number of entries of the inverse matrix. Then, we propose a parallelization strategy for block tridiagonal matrices which involves a combination of Schur complement calculations and cyclic reduction. It achieves good scalability even on problems of modest size.

97 MATHEMATICS AND COMPUTING↗