Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data clustering”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Parameter splitting in dark energy: is dark energy the same in the background and in the cosmic structures?

We perform an empirical consistency test of General Relativity/dark energy by disentangling expansion history and growth of structure constraints. We replace each late-universe parameter that describes the behavior of dark energy with two meta-parameters: one describing geometrical information in cosmological probes, and the other controlling the growth of structure. If the underlying model (a standard wCDM cosmology with General Relativity) is correct, that is under the null hypothesis, the two meta-parameters coincide. If they do not, it could indicate a failure of the model or systematics in the data. We present a global analysis using state-of-the-art cosmological data sets which points in the direction that cosmic structures prefer a weaker growth than that inferred by background probes. This result could signify inconsistencies of the model, the necessity of extensions to it or the presence of systematic errors in the data. We examine all these possibilities. The fact that the result is mostly driven by a specific sub-set of galaxy clusters abundance data, points to the need of a better understanding of this probe.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1981

Einstein imaging observations of clusters of galaxies

X-ray observations suggest a broad division between clusters having a centrally-located, X-ray dominant galaxy characterized by a centrally-peaked X-ray emission, and clusters with a broader X-ray profile. Within these categories, such evolutionary indicators as X-ray temperature, vorticity dispersion, spiral fraction and central galaxy density may indicate the relative stages of evolution. X-ray imaging observations are presented for (1) the Virgo cluster, (2) other dynamically unevolved clusters, (3) double clusters which may be in an intermediate evolutionary stage, and (4) dynamically evolved clusters. The data are analyzed under the assumption of an isothermal X-ray gas which is gravitationally bound by galaxies and clusters.

Forman, W.↗
DOE OSTI2025

Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning

Atom Probe Tomography (APT) is a powerful technique for visualizing the atomic-scale distribution of solutes in materials, but quantitative cluster analysis of APT datasets remains a challenge due to the need for subjective parameter selection in clustering algorithms. While distance-based and density-based methods such as HDBSCAN are widely used, their performance is highly sensitive to user-defined parameters, which undermines reproducibility and accuracy. This study proposes an image-based, deep learning-aided workflow for automating parameter selection and cluster detection in APT data analysis. By projecting 3D APT point clouds onto 2D planes, we leverage pretrained convolutional neural networks (ConvNeXt-Tiny and ResNet-50) through transfer learning to predict the number of clusters present in synthetic datasets. The output is used to guide K-means clustering and estimate HDBSCAN parameters, specifically minimum cluster size and minimum sample points. This approach reduces reliance on manual parameter tuning, improving consistency and scalability. The methodology demonstrates the feasibility of using image-based deep learning for interpreting complex spatial patterns in APT data, enabling faster and more objective analysis. The complete workflow and code are made publicly available to support reproducibility and future research.

Density-based clustering↗
NASA NTRS1980

The discovery of an O subdwarf in the globular cluster NGC 6712

Spectral data for C49 in the globular cluster NGC 6712 are examined with reference to evolutionary models for low-mass stars that are contracting into white dwarfs. The spectrum of this star is found to be almost identical to that of the first sdO star found in a globular cluster, star A in NGC 6397. Analysis of the spectral data using nonlocal thermodynamic equilibrium models gives surface parameters T not less than 50,000 K, log g = 5.5 plus or minus 0.5, and N(He)/N(H) approximately equal to 0.1. The results are consistent with the models considered.

Remillard, R. A.↗
DOE OSTI2024

Observational constraints on early dark energy

In this paper, we review and update constraints on the Early Dark Energy (EDE) model from cosmological data sets, in particular Planck PR3 and PR4 cosmic microwave background (CMB) data and large-scale structure (LSS) data sets including galaxy clustering and weak lensing data from the Dark Energy Survey, Subaru Hyper Suprime-Cam and KiDS+VIKING-450, as well as BOSS/eBOSS galaxy clustering and Lyman-[Formula: see text] forest data. We detail the fit to CMB data, and perform the first analyses of EDE using the CAMSPEC and Hillipop likelihoods for Planck CMB data, rather than Plik, both of which yield a tighter upper bound on the allowed EDE fraction than that found with Plik. We then supplement CMB data with LSS data in a series of new analyses. All these analyses are concordant in their Bayesian preference for [Formula: see text]CDM over EDE, as indicated by marginalized posterior distributions. We perform a series of tests of the impact of priors in these results, and compare with frequentist analyses based on the profile likelihood, finding qualitative agreement with the Bayesian results. All these tests suggest prior volume effects are not a determining factor in analyses of EDE. This work provides both a review of existing constraints and several new analyses.

Astronomy & Astrophysics↗
NASA NTRS1976

A soft X-ray map of the Perseus cluster of galaxies

A 0.5-3-keV X-ray map of the Perseus cluster of galaxies is presented. The map shows a region of strong emission centered near NGC 1275 plus a highly elongated emission region which lies along the line of bright galaxies that dominates the core of the cluster. The data are compared with various models that include point and diffuse sources. One model which adequately represents the data is the superposition of a point source at NGC 1275 and an isothermal ellipsoid resulting from the bremsstrahlung emission of cluster gas. The ellipsoid has a major core radius of 20.5 arcmin and a minor core radius of 5.5 arcmin, consistent with the values obtained from galaxy counts. All acceptable models provide evidence for a compact source (less than 3 arcmin FWHM) at NGC 1275 containing about 25% of the total emission. Since the diffuse X-ray and radio components have radically different morphologies, it is unlikely that the emissions arise from a common source, as proposed in inverse-Compton models.

Cash, W.↗
DOE OSTI2023

Spatio-Temporal Surrogates for Interaction of a Jet with High Explosives: Part II - Clustering Extremely High-Dimensional Grid-Based Data

Building an accurate surrogate model for the spatio-temporal outputs of a computer simulation is a challenging task. A simple approach to improve the accuracy of the surrogate is to cluster the outputs based on similarity and build a separate surrogate model for each cluster. This clustering is relatively straightforward when the output at each time step is of moderate size. However, when the spatial domain is represented by a large number of grid points, numbering in the millions, the clustering of the data becomes more challenging. In this report, we consider output data from simulations of a jet interacting with high explosives. These data are available on spatial domains of different sizes, at grid points that vary in their spatial coordinates, and in a format that distributes the output across multiple files at each time step of the simulation. We first describe how we bring these data into a consistent format prior to clustering. Borrowing the idea of random projections from data mining, we reduce the dimension of our data by a factor of thousand, making it possible to use the iterative k-means method for clustering. We show how we can use the randomness of both the random projections, and the choice of initial centroids in k-means clustering, to determine the number of clusters in our data set. Our approach makes clustering of extremely high dimensional data tractable, generating meaningful cluster assignments for our problem, despite the approximation introduced in the random projections.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Generative Model for Realistic Galaxy Cluster X-Ray Morphologies

Abstract The X-ray morphologies of clusters of galaxies display significant variations, reflecting their dynamical histories and the nonlinear dependence of X-ray emissivity on the density of the intracluster gas. Qualitative and quantitative assessments of X-ray morphology have long been considered a proxy for determining whether clusters are dynamically active or “relaxed.” Conversely, the use of circularly or elliptically symmetric models for cluster emission can be complicated by the variety of complex features realized in nature, spanning scales from megaparsecs down to the resolution limit of current X-ray observatories. In this work, we use mock X-ray images from simulated clusters from The Three Hundred project to define a basis set of cluster image features. We take advantage of the clusters’ approximate self-similarity to minimize the differences between images before encoding the remaining diversity through a distribution of high-order polynomial coefficients. Principal component analysis then provides an orthogonal basis for this distribution, corresponding to natural perturbations from an average model. This representation allows novel, realistically complex X-ray cluster images to be easily generated, and we provide code to do so. The approach provides a simple way to generate training data for cluster image analysis algorithms and could be straightforwardly adapted to generate clusters displaying specific types of features or selected by physical characteristics available in the original simulations.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1992

Clustering of tethered satellite system simulation data by an adaptive neuro-fuzzy algorithm

Recent developments in neuro-fuzzy systems indicate that the concepts of adaptive pattern recognition, when used to identify appropriate control actions corresponding to clusters of patterns representing system states in dynamic nonlinear control systems, may result in innovative designs. A modular, unsupervised neural network architecture, in which fuzzy learning rules have been embedded is used for on-line identification of similar states. The architecture and control rules involved in Adaptive Fuzzy Leader Clustering (AFLC) allow this system to be incorporated in control systems for identification of system states corresponding to specific control actions. We have used this algorithm to cluster the simulation data of Tethered Satellite System (TSS) to estimate the range of delta voltages necessary to maintain the desired length rate of the tether. The AFLC algorithm is capable of on-line estimation of the appropriate control voltages from the corresponding length error and length rate error without a priori knowledge of their membership functions and familarity with the behavior of the Tethered Satellite System.

Mitra, Sunanda↗
NASA NTRS1975

Joint pattern recognition/data compression concept for ERTS multispectral imaging

This paper describes a new technique which jointly applies clustering and source encoding concepts to obtain data compression. The cluster compression technique basically uses clustering to extract features from the measurement data set which are used to describe characteristics of the entire data set. In addition, the features may be used to approximate each individual measurement vector by forming a sequence of scalar numbers which define each measurement vector in terms of the cluster features. This sequence, called the feature map, is then efficiently represented by using source encoding concepts. A description of a practical cluster compression algorithm is given and experimental results are presented to show trade-offs and characteristics of various implementations. Examples are provided which demonstrate the application of cluster compression to multispectral image data of the Earth Resources Technology Satellite.

Hilbert, E. E.↗
NASA NTRS1973

A study to explore the use of orbital remote sensing to determine native arid plant distribution

The author has identified the following significant results. Ground truth spectral signature data for various types of scenes, including ground with and without annuals, and various shrubs, were collected. When these signature data are plotted with infrared (MSS band 6 or 7) reflectivity on one axis and red (MSS band 5) reflectivity on the other axis, clusters of data from the various types of scenes are distinct. This method of expressing spectral signature data appears to be more useful for distinguishing types of scenes than a simple infrared to red reflectivity ration. Large areas of varnished desert pavement are visible and mappable on ERTS-1 and high altitude aircraft imagery. A large scale vegetation pattern was found to be correlated with the presence of the desert pavement. The large scale correlation was used in mapping the vegetation of the area. It was found that a distinctive soil type was associated with the presence of the varnished desert pavement. The high salinity and exchangeable sodium percentage of this soil type provide a basis for the explanation of both the large scale and small scale vegetation pattern.

Mcginnies, W. G.↗
DOE OSTI2023

BiG-SLiCE 2 v1.0.0

BiG-SLiCE was originally an open source Python-based command line bioinformatics software that offers a highly scalable clustering analysis on biosynthetic gene clusters (BGC) data. It allows a simultaneous analysis of millions of BGCs, exceeding the capability of other existing tools (around one hundred thousands). As a tradeoff, the clustering accuracy is relatively lower and sometimes fall short in corner cases and specific BGC classes such as the RiPPs (Ribosomally-translated, Post-translationally modified Peptides). In BiG-SLiCE V2 (developed in LBNL), the clustering algorithm has been significantly improved to deliver a much accurate result even for RiPPs and other previous corner case classes. Moreover, the speed of the overall pipeline has been improved by 50-100%. Finally, additional features were implemented to support downstream analyses of BiG-SLiCE results, such as customized tabular (TSV/CSV) and columnar (Parquet) outputs.

Kautsar, Satria↗
NASA NTRS1997

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗
DOE OSTI2021

Detection of Anomalies in Gamma Background Radiation Data with K-Means and Self-Organizing Map Clustering Algorithms (Consortium on Nuclear Security Technologies (CONNECT) Q1 Report)

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. The measurement data is a 2D matrix, where one dimension is gamma ray energy, and the other dimension is the number of measurements or total time. In principle, gamma radiation sources can be detected and identified from the measured data by their unique spectral lines. Detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. The objective of this work is to explore unsupervised machine learning (ML) algorithms for detection and identification of weak nuisances and anomalies events in the presence of highly fluctuating background. The challenge is that spectral lines of isotopes are difficult to observe in one-second measurements. Averaging over the entire measurement campaign data set reveals spectral lines of most common background isotopes. Spectral lines of orphan sources, which might appear only in a few measurements during the campaign, will be washed out if averaging is performed over the entire measurement data set. The approach we have explored consists of extracting one-second measurements containing weak spectral features through data clustering. Averaging one-second spectra in a cluster should reveal the presence of anomaly sources. We created two ML models using K-means clustering and Neural Network Self-organizing Map (SOM). Performance of these ML models was benchmarked using search data. One data set contained 137 Cs source, and another dataset contained 131 I source.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2015

Methodology for Clustering High-Resolution Spatiotemporal Solar Resource Data

In this report, we introduce a methodology to achieve multiple levels of spatial resolution reduction of solar resource data, with minimal impact on data variability, for use in energy systems modeling. The selection of an appropriate clustering algorithm, parameter selection including cluster size, methods of temporal data segmentation, and methods of cluster evaluation are explored in the context of a repeatable process. In describing this process, we illustrate the steps in creating a reduced resolution, but still viable, dataset to support energy systems modeling, e.g. capacity expansion or production cost modeling. This process is demonstrated through the use of a solar resource dataset; however, the methods are applicable to other resource data represented through spatiotemporal grids, including wind data. In addition to energy modeling, the techniques demonstrated in this paper can be used in a novel top-down approach to assess renewable resources within many other contexts that leverage variability in resource data but require reduction in spatial resolution to accommodate modeling or computing constraints.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1979

Signature extension methods in crop area estimation

The Procedure B multispectral processing system is both multisegment and multistratum. It uses data from several LACIE-sized segments together and makes a proportion estimate for the entire group of segments as well as for the individual segments. In the clustering of data features, Procedure B produces multiple classes or strata rather than just two strata (as in Procedure 1), and performs stratified sampling on each of these mutliple strata in order to make a proportion estimate. Tests results for the components and for the overall performance of Procedure B are presented, and conclusions that can be drawn from these tests are discussed. The rationale for signature extension for crop area estimation is summarized.

Kauth, R. J.↗
NASA NTRS1986

Narrow-angle tail radio sources and evidence for radial orbits in Abell clusters

Published observational data on the tail orientations (TOs) of 60 narrow-angle-tail (NAT) radio sources in Abell clusters of galaxies are analyzed statistically using a maximum-likelihood approach. The results are presented in a table, and it is found that the observed TO distributions in the whole sample and in subsamples of morphologically regular NATs and NATs with pericentric distances d greater than 500 kpc are consistent with isotropic orbits, whereas the TOs for NATs with d less than 500 kpc are consistent with highly radial orbits. If radial orbits were observed near the centers of other types of cluster galaxies as well, it could be inferred that violent relaxation during cluster formation was incomplete, and that clusters form by spherical collapse and secondary infall, as proposed by Gunn (1977).

O'Dea, Christopher P.↗
DOE OSTI2023

Data-Driven Whole-Genome Clustering to Detect Geospatial, Temporal, and Functional Trends in SARS-CoV-2 Evolution

Current methods for defining SARS-CoV-2 lineages ignore the vast majority of the SARS-CoV-2 genome. We develop and apply an exhaustive vector comparison method that directly compares all known SARS-CoV-2 genome sequences to produce novel lineage classifications. We utilize data-driven models that (i) accurately capture the complex interactions across the set of all known SARS-CoV-2 genomes, (ii) scale to leadership-class computing systems, and (iii) enable tracking how such strains evolve geospatially over time. We show that during the height of the original Omicron surge, countries across Europe, Asia, and the Americas had a spatially asynchronous distribution of Omicron sub-strains. Moreover, neighboring countries were often dominated by either different clusters of the same variant or different variants altogether throughout the pandemic. Analyses of this kind may suggest a different pattern of epidemiological risk than was understood from conventional data, as well as produce actionable insights and transform our ability to prepare for and respond to current and future biological threats.

Jacobson, Daniel↗