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 649 records · Page 36

Byzantine Reliable Broadcast in Sparse Networks

Modern large-scale networks require the ability to withstand arbitrary failures (i.e., Byzantine failures). Byzantine reliable broadcast algorithms can be used to reliably disseminate information in the presence of Byzantine failures. We design a novel Byzantine reliable broadcast protocol for loosely connected and synchronous networks. While previous such protocols all assume correct senders, our protocol is the first to handle Byzantine senders. To achieve this goal, we have developed new techniques for fault detection and fault tolerance. Our protocol is efficient, and under normal circumstances, no expensive public-key cryptographic operations are used. We implement and evaluate our protocol, demonstrating that our protocol has high throughput and is superior to the existing protocols in uncivil executions.

Byzantine broadcast↗

Seismic classification through sparse filter dictionaries

We tackle a multi-label classi cation problem involving the relation between acoustic- pro le features and the measured seismogram. To isolate components of the seismo- grams unique to each class of acoustic pro le we build dictionaries of convolutional lters. The convolutional- lter dictionaries for the individual classes are then combined into a large dictionary for the entire seismogram set. A given seismogram is classi ed by computing its representation in the large dictionary and then comparing reconstruction accuracy with this representation using each of the sub-dictionaries. The sub-dictionary with the minimal reconstruction error identi es the seismogram class.

58 GEOSCIENCES↗

A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations

We present an efficient parallel algorithm and its implementation for computing the diagonal of $H^-1$ where $H$ is a 2D Kohn-Sham Hamiltonian discretized on a rectangular domain using a standard second order finite difference scheme. This type of calculation can be used to obtain an accurate approximation to the diagonal of a Fermi-Dirac function of $H$ through a recently developed pole-expansion technique \cite{LinLuYingE2009}. The diagonal elements are needed in electronic structure calculations for quantum mechanical systems \citeHohenbergKohn1964, KohnSham 1965,DreizlerGross1990. We show how elimination tree is used to organize the parallel computation and how synchronization overhead is reduced by passing data level by level along this tree using the technique of local buffers and relative indices. We analyze the performance of our implementation by examining its load balance and communication overhead. We show that our implementation exhibits an excellent weak scaling on a large-scale high performance distributed parallel machine. When compared with standard approach for evaluating the diagonal a Fermi-Dirac function of a Kohn-Sham Hamiltonian associated a 2D electron quantum dot, the new pole-expansion technique that uses our algorithm to compute the diagonal of $(H-z_i I)^-1$ for a small number of poles $z_i$ is much faster, especially when the quantum dot contains many electrons.

74 ATOMIC AND MOLECULAR PHYSICS↗

Leveraging Optimal Sparse Sensor Placement to Aggregate a Network of Digital Twins for Nuclear Subsystems

Nuclear power plants (NPPs) require continuous monitoring of various systems, structures, and components to ensure safe and efficient operations. The critical safety testing of new fuel compositions and the analysis of the effects of power transients on core temperatures can be achieved through modeling and simulations. They capture the dynamics of the physical phenomenon associated with failure modes and facilitate the creation of digital twins (DTs). Accurate reconstruction of fields of interest (e.g., temperature, pressure, velocity) from sensor measurements is crucial to establish a two-way communication between physical experiments and models. Sensor placement is highly constrained in most nuclear subsystems due to challenging operating conditions and inherent spatial limitations. This study develops optimized data-driven sensor placements for full-field reconstruction within reactor and steam generator subsystems of NPPs. Optimized constrained sensors reconstruct field of interest within a tri-structural isotropic (TRISO) fuel irradiation experiment, a lumped parameter model of a nuclear fuel test rod and a steam generator. The optimization procedure leverages reduced-order models of flow physics to provide a highly accurate full-field reconstruction of responses of interest, noise-induced uncertainty quantification and physically feasible sensor locations. Accurate sensor-based reconstructions establish a foundation for the digital twinning of subsystems, culminating in a comprehensive DT aggregate of an NPP.

42 ENGINEERING↗

Aseismic Motions Drive a Sparse Seismicity During Fluid Injections Into a Fractured Zone in a Carbonate Reservoir

An increase in fluid pressure in faults can trigger seismicity and large aseismic motions. Understanding how fluid and faults interact is an essential goal for seismic hazard and reservoir monitoring, but this key relation remains unclear. We developed an in situ experiment of fluid injections at a 10 meter scale. Water was injected at high pressure in different geological structures inside a fault damaged zone, in limestone at 280 m depth in the Low Noise Underground Laboratory (France). Induced seismicity, as well as strains, pressure, and flow rate, was continuously monitored during the injections. Although nonreversible deformations related to fracture reactivations were observed for all injections, only a few tests generated seismicity. Events are characterized by a 0.5-to-4 kHz content and a small magnitude (approximately -3.5). They are located within 1.5 m accuracy between 1 and 12 m from the injections. Comparing strain measurements and seismicity shows that more than 96% of the deformation is aseismic. The seismic moment is also small compared to the one expected from the injected volume. Moreover, a dual seismic behavior is observed as (1) the spatiotemporal distribution of some cluster of events is clearly independent from the fluid diffusion (2) while a diffusion-type pattern can be observed for some others clusters. Furthermore, the seismicity might therefore appear as an indirect effect to the fluid pressure, driven by aseismic motion and related stress perturbation transferred through failure.

58 GEOSCIENCES↗

Comparison of sparse domain approaches for 4D SPECT dynamic image reconstruction

Purpose: Dynamic imaging (DI) provides additional diagnostic information in emission tomography in comparison to conventional static imaging at the cost of being computationally more challenging. Dynamic single photon emission computed tomography (SPECT) reconstruction is particularly difficult because of the limitations in the sampling geometry present in most existing scanners. We have developed an algorithm Spline Initialized Factor Analysis of Dynamic Structures (SIFADS) that is a matrix factorization method for reconstructing the dynamics of tracers in tissues and blood directly from the projections in dynamic cardiac SPECT, without first resorting to any 3D reconstruction. Methods: SIFADS is different from "pure" factor analysis in dynamic structures (FADS) in that it employs a dedicated spline-based pre-initialization. In this paper, we analyze the convergence properties of SIFADS and FADS using multiple metrics. The performances of the two approaches are evaluated for numerically simulated data and for real dynamic SPECT data from canine and human subjects. Results: For SIFADS, metrics analyzed for reconstruction algorithm convergence show better features of the metric curves vs iterations. In addition, SIAFDS provides better tissue segmentations than that from pure FADS. Measured computational times are also typically better for SIFADS implementations than those with pure FADS. Conclusion: The analysis supports the utility of the pre-initialization of a factorization algorithm for better dynamic SPECT image reconstruction.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A case study on the influence of THM coupling on the near field safety of a spent fuel repository in sparsely fractured granite

In order to demonstrate the feasibility of geological disposal of spent CANDU fuel in Canada, a safety assessment was performed for a hypothetical repository in the Canadian Shield. The assessment shows that such repository would meet international criteria for dose rate; however, uncertainties in the assumed evolution of the repository were identified. Such uncertainties could be resolved by the consideration of coupled Thermal-Hydro-Mechanical-Chemical (THMC) processes. In Task A of the DECOVALEX-THMC project, THM models were developed within the framework of the theory of poroelasticity. Such model development was performed in an iterative manner, using experimental data from laboratory and field tests. The models were used to perform near-field simulations of the evolution of the repository in order to address the above uncertainties. This paper presents the definition and rationale of task A and the results of the simulations. From a repository safety point of view, the simulations predict that the maximum temperature would be well below the design target of 100 C, however the load on the container can marginally exceed the design value of 15 MPa. However, the most important finding from the simulations is that a rock damage zone could form around the emplacement borehole. Such damage zone can extend a few metres from the walls of the emplacement holes, with permeability values that are orders of magnitude higher than the initial values. The damage zone has the potential to increase the radionuclide transport flux from the geosphere; the effect of such an increase should be taken into account in the safety assessment and mitigated if necessary by the provision of sealing systems.

54 ENVIRONMENTAL SCIENCES↗

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies

We present that the minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to γ-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular “tree” connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters linked to the cluster properties, can be applied to reduce spurious detections. We find that the most efficient parameter for this secondary selection is the magnitudeM of a cluster, defined as the product of its number of events by its clustering degree. We test the sensitivity of the method by means of simulated and real Fermi-Large Area Telescope (LAT) fields. Our results show that √M is strongly correlated with other statistical significance parameters, derived from a wavelet based algorithm and maximum likelihood (ML) analysis, and that it can be used as a good estimator of statistical significance of MST detections. Finally, we apply the method to a 2-year LAT image at energies higher than 3 GeV, and we show the presence of new clusters, likely associated with BL Lac objects.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonconvex regularization for sparse neural networks

Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.

97 MATHEMATICS AND COMPUTING↗