Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering algorithms”

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,009 records · Page 56

Mass Variance from Archival X-ray Properties of Dark Energy Survey Year-1 Galaxy Clusters

Using archival X-ray observations and a log-normal population model, we estimate constraints on the intrinsic scatter in halo mass at fixed optical richness for a galaxy cluster sample identified in Dark Energy Survey Year-One (DES-Y1) data with the redMaPPer algorithm. We examine the scaling behavior of X-ray temperatures, $T_X$, with optical richness, $\lambda_{RM}$, for clusters in the redshift range $0.2 50\%$ complete for clusters with $\lambda_{RM} > 130$. Regression analysis on the two samples produces consistent posterior scaling parameters, from which we derive a combined constraint on the residual scatter, $\sigma_{\ln Tx | \lambda} = 0.275 \pm 0.019$. Joined with constraints for $T_X$ scaling with halo mass from the Weighing the Giants program and richness--temperature covariance estimates from the LoCuSS sample, we derive the richness-conditioned scatter in mass, $\sigma_{\ln M | \lambda} = 0.30 \pm 0.04\, _{({\rm stat})} \pm 0.09\, _{({\rm sys})}$, at an optical richness of approximately 70. Uncertainties in external parameters, particularly the slope and variance of the $T_X$--mass relation and the covariance of $T_X$ and $\lambda_{RM}$ at fixed mass, dominate the systematic error. The $95\%$ confidence region from joint sample analysis is relatively broad, $\sigma_{\ln M | \lambda} \in [0.14, \, 0.55]$, or a factor ten in variance.

79 ASTRONOMY AND ASTROPHYSICS↗

Big Data Analytics for Scanning Transmission Electron Microscopy Ptychography

Electron microscopy is undergoing a transition; from the model of producing only a few micrographs, through the current state where many images and spectra can be digitally recorded, to a new mode where very large volumes of data (movies, ptychographic and multi-dimensional series) can be rapidly obtained. In this paper, we discuss the application of so-called “big-data” methods to high dimensional microscopy data, using unsupervised multivariate statistical techniques, in order to explore salient image features in a specific example of BiFeO 3 domains. Remarkably, k-means clustering reveals domain differentiation despite the fact that the algorithm is purely statistical in nature and does not require any prior information regarding the material, any coexisting phases, or any differentiating structures. While this is a somewhat trivial case, this example signifies the extraction of useful physical and structural information without any prior bias regarding the sample or the instrumental modality. Further interpretation of these types of results may still require human intervention. Finally, however, the open nature of this algorithm and its wide availability, enable broad collaborations and exploratory work necessary to enable efficient data analysis in electron microscopy.

36 MATERIALS SCIENCE↗

Emulating ab initio computations of infinite nucleonic matter

We construct efficient emulators for the computation of the infinite nuclear matter equation of state. These emulators are based on the subspace-projected coupled-cluster method for which we here develop a new algorithm called small-batch voting to eliminate spurious states that might appear when emulating quantum many-body methods based on a non-Hermitian Hamiltonian. The efficiency and accuracy of these emulators facilitate a rigorous statistical analysis within which we explore nuclear matter predictions for > 10 6 different parametrizations of a chiral interaction model with explicit Δ -isobars at next-to-next-to leading order. Constrained by nucleon-nucleon scattering phase shifts and bound-state observables of light nuclei up to He 4 , we use history matching to identify nonimplausible domains for the low-energy coupling constants of the chiral interaction. Within these domains we perform a Bayesian analysis using sampling and importance resampling with different likelihood calibrations and study correlations between interaction parameters, calibration observables in light nuclei, and nuclear matter saturation properties. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Performance Issues of SYRK Implementations in Shared Memory Environments for Edge Cases

The symmetric rank-k update (SYRK) is a level-3 BLAS routine commonly used by many Data Mining/Machine Learning(DM/ML) algorithms such as regression, dimensionality reduction algorithms like PCA, matrix factorization and k-mean clustering. This paper presents a comprehensive analysis of the SYRK routine under popular dense linear algebra libraries such as OpenBLAS, Intel MKL, and BLIS particularly focusing on edge cases of dense matrices (thin or fat shapes) that are common in DM/ML applications. Our work identifies some performance issues of the SYRK routine in multi-threaded shared memory environments for edge cases and discuss matrix dependent modifications for performance improvement.

Hossain, Md Mosharaf↗

Using Map Matching for DeIdentification of Connected Vehicle Locations

In this paper we introduce a location deidentification procedure that uses road network structure to protect against certain types of inference-based attacks. Our target is large databases containing vehicle locations. Previous anonymization approaches are inappropriate because location generalization and perturbation of geopositions could negatively affect development of safety-critical applications that require precise position information. Furthermore, k-anonymity-based clustering approaches would lead to significant data suppression. Our algorithm attempts to balance privacy protection and data utility, while protecting against re-identification attacks. Our data is from the first connected vehicle model deployment in the United States.

97 MATHEMATICS AND COMPUTING↗

Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization

We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.

Eswar, Srinivas↗

Jet energy measurement and its systematic uncertainty in proton–proton collisions at √s = 7 TeV with the ATLAS detector

The jet energy scale (JES) and its systematic uncertainty are determined for jets measured with the ATLAS detector using proton–proton collision data with a centre-of-mass energy of \(\sqrt{s}=7\) TeV corresponding to an integrated luminosity of \(4.7\) \(\,\,\text{ fb }^{-1}\). Jets are reconstructed from energy deposits forming topological clusters of calorimeter cells using the anti-\(k_{t}\) algorithm with distance parameters \(R=0.4\) or \(R=0.6\), and are calibrated using MC simulations. A residual JES correction is applied to account for differences between data and MC simulations. This correction and its systematic uncertainty are estimated using a combination of in situ techniques exploiting the transverse momentum balance between a jet and a reference object such as a photon or a \(Z\) boson, for \({20} \le p_{\mathrm {T}}^\mathrm {jet}<{1000}\, ~\mathrm{GeV }\) and pseudorapidities \(|\eta |<{4.5}\). The effect of multiple proton–proton interactions is corrected for, and an uncertainty is evaluated using in situ techniques. The smallest JES uncertainty of less than 1 % is found in the central calorimeter region (\(|\eta |<{1.2}\)) for jets with \({55} \le p_{\mathrm {T}}^\mathrm {jet}<{500}\, ~\mathrm{GeV }\). For central jets at lower \(p_{\mathrm {T}}\), the uncertainty is about 3 %. A consistent JES estimate is found using measurements of the calorimeter response of single hadrons in proton–proton collisions and test-beam data, which also provide the estimate for \(p_{\mathrm {T}}^\mathrm {jet}> 1\) TeV. The calibration of forward jets is derived from dijet \(p_{\mathrm {T}}\) balance measurements. The resulting uncertainty reaches its largest value of 6 % for low-\(p_{\mathrm {T}}\) jets at \(|\eta |=4.5\). In addition, JES uncertainties due to specific event topologies, such as close-by jets or selections of event samples with an enhanced content of jets originating from light quarks or gluons, are also discussed. The magnitude of these uncertainties depends on the event sample used in a given physics analysis, but typically amounts to 0.5–3 %.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Proceedings of RIKEN BNL Research Center Workshop: The Definition of Jets in a Large Background

Jets, the collimated spray of particles produced by a high momentum quark or gluon, have been a key observable in high-energy particle and heavy ion physics. While in general, observables should be clearly defined with the same definition used in both theory and experiment, this has always been challenging for measurements of jets. Since the fragmentation of partons into final state hadrons is not calculable perturbatively and final state particles cannot be assigned unambiguously to particular partons, jet definitions rely on algorithms to reconstruct jets and select which particles are clustered into which jet. Defining a jet is particularly challenging when the jets are surrounded by particles from a high multiplicity underlying event such as those in heavy ion collisions, high luminosity proton-proton or electron-ion collisions. The community currently faces similar issues regarding jet definitions to those faced in particle physics in the preceding decades.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Towards Precision Cluster Cosmology with LSST (Final Report)

The research projects carried out under this award aim to reduce the systematic uncertainties on cluster mass estimates, especially for weak-lensing masses, in preparation for cluster cosmology with LSST, and to apply the developed algorithms to LSST precursor data. Much of this work took place within the LSST Dark Energy Science Collaboration (DESC), with additional projects carried out within our research group and with close collaborators.

79 ASTRONOMY AND ASTROPHYSICS↗

A Guide to Conquer the Biological Network Era Using Graph Theory

Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities. In this article, we discuss the basic graph theory concepts and the various graph types, as well as the available data structures for storing and reading graphs. In addition, we describe several network properties and we highlight some of the widely used network topological features. We briefly mention the network patterns, motifs and models, and we further comment on the types of biological and biomedical networks along with their corresponding computer- and human-readable file formats. Finally, we discuss a variety of algorithms and metrics for network analyses regarding graph drawing, clustering, visualization, link prediction, perturbation, and network alignment as well as the current state-of-the-art tools. We expect this review to reach a very broad spectrum of readers varying from experts to beginners while encouraging them to enhance the field further.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic Cosmological Mass Mapping from Weak Lensing Shear

We infer gravitational lensing shear and convergence fields from galaxy ellipticity catalogs under a spatial process prior for the lensing potential. We demonstrate the performance of our algorithm with simulated Gaussian-distributed cosmological lensing shear maps and a reconstruction of the mass distribution of the merging galaxy cluster Abell 781 using galaxy ellipticities measured with the Deep Lens Survey. Given interim posterior samples of lensing shear or convergence fields on the sky, we describe an algorithm to infer cosmological parameters via lens field marginalization. In the most general formulation of our algorithm we make no assumptions about weak shear or Gaussian-distributed shape noise or shears. Because we require solutions and matrix determinants of a linear system of dimension that scales with the number of galaxies, we expect our algorithm to require parallel high-performance computing resources for application to ongoing wide field lensing surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Small-amplitude Compressible Magnetohydrodynamic Turbulence Modulated by Collisionless Damping in Earth’s Magnetosheath: Observation Matches Theory

Plasma turbulence is a ubiquitous dynamical process that transfers energy across many spatial and temporal scales and affects energetic particle transport. Recent advances in the understanding of compressible magnetohydrodynamic (MHD) turbulence demonstrate the important role of damping in shaping energy distributions on small scales, yet its observational evidence is still lacking. This study provides the first observational evidence of substantial collisionless damping (CD) modulation on the small-amplitude compressible MHD turbulence cascade in Earth’s magnetosheath using four Cluster spacecraft. Based on an improved compressible MHD decomposition algorithm, turbulence is decomposed into three eigenmodes: incompressible Alfvén modes and compressible slow and fast (magnetosonic) modes. Our observations demonstrate that CD enhances the anisotropy of compressible MHD modes because CD has a strong dependence on wave propagation angle. The wavenumber distributions of slow modes are mainly stretched perpendicular to the background magnetic field (B 0 ) and weakly modulated by CD. In contrast, fast modes are subjected to a more significant CD modulation. Fast modes exhibit a weak, scale-independent anisotropy above the CD truncation scale. Below the CD truncation scale, the anisotropy of fast modes enhances as wavenumbers increase. As a result, fast-mode fractions in the total energy of compressible modes decrease with the increase of perpendicular wavenumber (to B 0 ) or wave propagation angle. Our findings reveal how the turbulence cascade is shaped by CD and its consequences for anisotropies in the space environment.

97 MATHEMATICS AND COMPUTING↗

Digital processing of satellite imagery application to jungle areas of Peru

The author has identified the following significant results. The use of clustering methods permits the development of relatively fast classification algorithms that could be implemented in an inexpensive computer system with limited amount of memory. Analysis of CCTs using these techniques can provide a great deal of detail permitting the use of the maximum resolution of LANDSAT imagery. Potential cases were detected in which the use of other techniques for classification using a Gaussian approximation for the distribution functions can be used with advantage. For jungle areas, channels 5 and 7 can provide enough information to delineate drainage patterns, swamp and wet areas, and make a reasonable broad classification of forest types.

Pomalaza, J. C.↗

Radiobrightness decision criteria for freeze/thaw boundaries

A freeze indicator (FI), based on a low 37-GHz radiobrightness and a low 10.7, 18, and 37-GHz radiobrightness spectral gradient, has been used to classify frozen surfaces in the northern Great Plains. By modeling the radiometer beampatterns as Gaussian, freeze/thaw boundaries can be located at the (fine) resolution of the 37-GHz channel. The performance of the freeze indicator, and subsequent boundary location estimate, depends on the accuracy of the boundary decision criteria. It is shown that decision criteria based on clustering and unsupervised classification yield good performance. A simple algorithm for registering coarse-resolution FI boundaries to equivalent boundaries in fine-resolution 37-GHz radiobrightness images is also presented.

Zuerndorfer, B.↗

An Algorithm for Converting Static Earth Sensor Measurements into Earth Observation Vectors

An algorithm has been developed that converts penetration angles reported by Static Earth Sensors (SESs) into Earth observation vectors. This algorithm allows compensation for variation in the horizon height including that caused by Earth oblateness. It also allows pitch and roll to be computed using any number (greater than 1) of simultaneous sensor penetration angles simplifying processing during periods of Sun and Moon interference. The algorithm computes body frame unit vectors through each SES cluster. It also computes GCI vectors from the spacecraft to the position on the Earth's limb where each cluster detects the Earth's limb. These body frame vectors are used as sensor observation vectors and the GCI vectors are used as reference vectors in an attitude solution. The attitude, with the unobservable yaw discarded, is iteratively refined to provide the Earth observation vector solution.

Harman, R.↗

Redeye: A Digital Library for Forensic Document Triage

Forensic document analysis has become an important aspect of investigation of many different kinds of crimes from money laundering to fraud and from cybercrime to smuggling. The current workflow for analysts includes powerful tools, such as Palantir and Analyst s Notebook, for moving from evidence to actionable intelligence and tools for finding documents among the millions of files on a hard disk, such as FTK. However, the analysts often leave the process of sorting through collections of seized documents to filter out the noise from the actual evidence to a highly labor-intensive manual effort. This paper presents the Redeye Analysis Workbench, a tool to help analysts move from manual sorting of a collection of documents to performing intelligent document triage over a digital library. We will discuss the tools and techniques we build upon in addition to an in-depth discussion of our tool and how it addresses two major use cases we observed analysts performing. Finally, we also include a new layout algorithm for radial graphs that is used to visualize clusters of documents in our system.

Bogen, Paul Logasa↗

molgw 1: Many-body perturbation theory software for atoms, molecules, and clusters

Here, we summarize the MOLGW code that implements density-functional theory and many-body perturbation theory in a Gaussian basis set. The code is dedicated to the calculation of the many-body self-energy within the GW approximation and the solution of the Bethe–Salpeter equation. These two types of calculations allow the user to evaluate physical quantities that can be compared to spectroscopic experiments. Quasiparticle energies, obtained through the calculation of the GW self-energy, can be compared to photoemission or transport experiments, and neutral excitation energies and oscillator strengths, obtained via solution of the Bethe–Salpeter equation, are measurable by optical absorption. The implementation choices outlined here have aimed at the accuracy and robustness of calculated quantities with respect to measurements. Furthermore, the algorithms implemented in MOLGW allow users to consider molecules or clusters containing up to 100 atoms with rather accurate basis sets, and to choose whether or not to apply the resolution-of-the-identity approximation. Finally, we demonstrate the parallelization efficacy of the MOLGW code over several hundreds of processors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗