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,081 records · Page 60
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Theoretical studies of the global minima and polarizabilities of small lithium clusters

Lithium clusters Lin (n=1-20) have been investigated with density functional theory (DFT) and coupled—cluster (CC) methods. The global-minimum structures are located via an improved basin---hopping algorithm and the lowest energy Lin isomers are confirmed with DFT geometry optimizations, CCSD(T) energy calculations, and by comparing simulated and experimental polarizabilities. The tetrahedral Li4 structure is found to be the basic building block of lithium clusters Lin (n=6-20). Simulated polarizabilities, including thermal effects at room temperature, are in good agreement with measured isotropic polarizabilities.

clusters↗
DOE OSTI2015

WE-AB-204-04: Feature Selection and Clustering Optimization for Pseudo-CT Generation in MR-Based Attenuation Correction and Radiation Therapy Planning

Purpose: Accurate and robust photon attenuation derived from MR is essential for PET/MR and MR-based radiation treatment planning applications. Although the fuzzy C-means (FCM) algorithm has been applied for pseudo-CT generation, the input feature combination and the number of clusters have not been optimized. This study aims to optimize both for clinically practical pseudo-CT generation. Methods: Nine volunteers were recruited. A 190-second, single-acquisition UTE-mDixon with 25% (angular) sampling and 3D radial readout was performed to acquire three primitive MR features at TEs of 0.1, 1.5, and 2.8 ms: the free-induction-decay (FID), the first and the second echo images. Three derived images, Dixon-fat and Dixon-water generated by two-point Dixon water/fat separation, and R2* (1/T2*) map, were also created. To identify informative inputs for generating a pseudo-CT image volume, all 63 combinations, choosing one to six of the feature images, were used as inputs to FCM for pseudo-CT generation. Further, the number of clusters was varied from four to seven to find the optimal approach. Mean prediction deviation (MPD), mean absolute prediction deviation (MAPD), and correlation coefficient (R) of different combinations were compared for feature selection. Results: Among the 63 feature combinations, the four that resulted in the best MAPD and R were further compared along with the set containing all six features. The results suggested that R2* and Dixon-water are the most informative features. Further, including FID also improved the performance of pseudo-CT generation. Consequently, the set containing FID, Dixon-water, and R2* resulted in the most accurate, robust pseudo-CT when the number of cluster equals to five (5C). The clusters were interpreted as air, fat, bone, brain, and fluid. The six-cluster Result additionally included bone marrow. Conclusion: The results suggested that FID, Dixon-water, R2* are the most important features. The findings can be used to facilitate pseudo-CT generation for unsupervised clustering. Please note that the project was completed with partial funding from the Ohio Department of Development grant TECH 11-063 and a sponsored research agreement with Philips Healthcare that is managed by Case Western Reserve University. As noted in the affiliations, some of the authors are Philips employees.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

An Integrated High-performance Computing and Digital Real-time Simulation Testbed to Benchmark Closed-loop Load Shedding Algorithms in Power Systems

An integrated testbed using digital real-time simulator (DRTS) and a high-performance computing (HPC) cluster is presented here to compare speed and performance of computational schemes to mitigate time-critical issues in electric power systems. The first approach in this testbed validation is taken by running a set of closed-loop load shedding algorithms to compare and contrast two paradigms of arresting cascading failure propagation. Two algorithms involve solving DC and AC power flow model-based optimization problems to compute load shedding at different buses, while a model-based stochastic search using parallel computing provides a viable alternative. The algorithms are implemented in the DRTS-HPC testbed for the IEEE 14-bus benchmark transmission system. As a proof of the concept, simulation results are presented for implementation of closed-loop load-shedding algorithms for cascading failures in the DRTS-HPC testbed

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2013

Performance modeling of microsecond scale biological molecular dynamics simulations on heterogeneous architectures

Performance improvements in biomolecular simulations based on molecular dynamics (MD) codes are widely desired. Unfortunately, the factors, which allowed past performance improvements, particularly the microprocessor clock frequencies, are no longer increasing. Hence, novel software and hardware solutions are being explored for accelerating performance of widely used MD codes. In this paper, we describe our efforts on porting, optimizing and tuning of Large-scale Atomic/Molecular Massively Parallel Simulator, a popular MD framework, on heterogeneous architectures: multi-core processors with graphical processing unit (GPU) accelerators. Our implementation is based on accelerating the most computationally expensive non-bonded interaction terms on the GPUs and overlapping the computation on the CPU and GPUs. This functionality is built on top of message passing interface that allows multi-level parallelism to be extracted even at the workstation level with the multi-core CPUs and allows extension of the implementation on GPU-enabled clusters. We hypothesize that the optimal benefit of heterogeneous architectures for applications will come by utilizing all possible resources (for example, CPU-cores and GPU devices on GPU-enabled clusters). Benchmarks for a range of biomolecular system sizes are provided, and an analysis is performed on four generations of NVIDIA's GPU devices. On GPU-enabled Linux clusters, by overlapping and pipelining computation and communication, we observe up to 10-folds application acceleration in multi-core and multi-GPU environments illustrating significant performance improvements. Detailed analysis of the implementation is presented that allows identification of bottlenecks in algorithm, indicating that code optimization and improvements on GPUs could allow microsecond scale simulation throughput on workstations and inexpensive GPU clusters, putting widely desired biologically relevant simulation time-scales within reach of a large user community. In order to systematically optimize simulation throughput and to enable performance prediction, we have developed a parameterized performance model that will allow developers and users to explore the performance potential of future heterogeneous systems for biological simulations.

Agarwal, Pratul K.↗
DOE OSTI2022

High-energy γ -ray detection of supernova remnants in the Large Magellanic Cloud

ABSTRACT We present the results of a cluster search in the γ-ray sky images of the Large Magellanic Cloud (LMC) region by means of the Minimum Spanning Tree (MST) and DBSCAN algorithms, at energies higher than 6 and 10 GeV, using 12 yr of Fermi-LAT data. Several significant clusters were found, the majority of which associated with previously known γ-ray sources. We confirm our previous detection of the supernova remnants N 49B and N 63A and found new significant clusters associated with the SNRs N 49, N 186D, and N 44. These sources are among the brightest X-ray remnants in the LMC and corresponds to core-collapse supernovae interacting with dense H ii regions, indicating that a hadronic origin of high-energy photons is the most likely process.

Campana, R. (ORCID:0000000247945453)↗
DOE OSTI2018

Computing Resonant Inelastic X-Ray Scattering Spectra Using The Density Matrix Renormalization Group Method

We present a method for computing the resonant inelastic x-ray scattering (RIXS) spectra in one-dimensional systems using the density matrix renormalization group (DMRG) method. By using DMRG to address this problem, we shift the computational bottleneck from the memory requirements associated with exact diagonalization (ED) calculations to the computational time associated with the DMRG algorithm. This approach is then used to obtain RIXS spectra on cluster sizes well beyond state-of-the-art ED techniques. Using this new procedure, we compute the low-energy magnetic excitations observed in Cu L-edge RIXS for the challenging corner shared CuO4 chains, both for large multi-orbital clusters and downfolded t-J chains. We are able to directly compare results obtained from both models defined in clusters with identical momentum resolution. In the strong coupling limit, we find that the downfolded t-J model captures the main features of the magnetic excitations probed by RIXS only after a uniform scaling of the spectra is made.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Dynamic Mode Decomposition of Random Pressure Fields over Bluff Bodies

Fluctuating surface pressures on a bluff body exposed to a boundary layer flow generally are characterized as a spatiotemporally varying random field. In this paper, a dynamic mode decomposition (DMD) was applied to extract dominant features embedded in these random pressure fields. Utilizing an unsupervised machine learning algorithm, spatial modes and their temporal variations were grouped into different clusters at scales, e.g., macro, meso, and micro. A proper orthogonal decomposition (POD) of the experimental data was carried out to observe commonalities and distinctive perspectives each decomposition offers. Here, a comprehensive examination of the DMD/POD for their convergence criteria, data sufficiency, and modal components analysis was conducted. The physical interpretation of the spatiotemporal pressure field based on these decomposition schemes was discussed. At different scales, the DMD modes can capture the evolution of aerodynamic features, e.g., convection of vortices (or vortex tubes) and other structures. The distribution of energy among these three broad scales also reflects an energy cascade in pressure fluctuations akin to turbulence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Measurement of the angle between jet axes in Pb-Pb collisions at $\sqrt{s_{NN}}$ =5.02 TeV

This paper presents the first measurement of the angle between different jet axes (denoted as Δ⁢𝑅 axis ) in Pb-Pb collisions. The measurement is carried out in the 0–10 % most-central events at $\sqrt{s_{NN}}$ = 5.02 TeV. Jets are assembled by clustering charged particles at midrapidity using the anti-𝑘 T algorithm with resolution parameters 𝑅 = 0.2 and 0.4 and transverse momenta in the intervals 40 < 𝑝$^{ch jet}_{T}$ < 140 GeV/𝑐 and 80 < 𝑝$^{ch jet}_{T}$ < 140 GeV/𝑐, respectively. Measurements at these low transverse momenta enhance the sensitivity to quark-gluon plasma (QGP) effects. A comparison to models implementing various mechanisms of jet energy loss in the QGP suggests that the observed narrowing of the Pb-Pb distribution relative to 𝑝𝑝 can be explained if quark-initiated jets are more likely to emerge from the medium than gluon-initiated jets. These new measurements disfavor intrajet 𝑝 T broadening as implemented in a simple model calculation with the Baier-Dokshitzer-Mueller-Peigne-Schiff formalism for energy loss in the QGP. The comparison of Pb-Pb and 𝑝𝑝 collisions shows sensitivity to the angular scale at which the QGP can resolve two independent splittings, favoring mechanisms that incorporate incoherent energy loss.

Acharya, S. [LPC] (ORCID:0000000292135329)↗
DOE OSTI2019

Asymmetrical Magnet Shape Optimization Based on S-C Mapping for Torque Profile Mitigation in Unidirectional Application of SPMS Machine

Surface-mounted Permanent Magnet Synchronous (SPMS) machines are widely used in applications that require low torque ripple, reduced vibration and acoustic noise. For those applications of SPMSM in which only unidirectional operation is needed, asymmetric design optimization show to have significant advantages over symmetric designs. In this paper, an analytical method based on Schwarz -Christoffel mapping is presented for asymmetrical magnet shape optimization in SPMS machine. In this method, permanent magnet is divided into finite cells so that each cell can be assigned with either air (OFF) or magnet (ON). The Optimization problem is solved using Genetic Algorithms (GAs). In order to remove non-manufacturable shapes, the cluster of materials and cleaning method is used and applied into magnet cells. The analytical method can significantly reduce the computation time used by optimization process as compared with methods based on Finite Element Analysis (FEA). This method is applied to a 12-pole SPMS machine. Validation of the S-C mapping method and final results are carried out using 2D and 3D finite element analysis. Here, the results obtained demonstrate that asymmetrical magnet shape improves cogging torque and torque ripple performance of SPMS machine by a significant margin.

42 ENGINEERING↗
NASA NTRS1985

A cluster analysis method for identification of subpopulations of cells in flow cytometric list-mode arrays

A specialized program was developed for flow cytometric list-mode data using an heirarchical tree method for identifying and enumerating individual subpopulations, the method of principal components for a two-dimensional display of 6-parameter data array, and a standard sorting algorithm for characterizing subpopulations. The program was tested against a published data set subjected to cluster analysis and experimental data sets from controlled flow cytometry experiments using a Coulter Electronics EPICS V Cell Sorter. A version of the program in compiled BASIC is usable on a 16-bit microcomputer with the MS-DOS operating system. It is specialized for 6 parameters and up to 20,000 cells. Its two-dimensional display of Euclidean distances reveals clusters clearly, as does its 1-dimensional display. The identified subpopulations can, in suitable experiments, be related to functional subpopulations of cells.

Li, Z. K.↗
NASA NTRS2001

Monte Carlo predictions of DNA fragment-size distributions for large sizes after HZE particle irradiation

DSBs (double-strand breaks) produced by densely ionizing space radiation are not located randomly in the genome: recent data indicate DSB clustering along chromosomes. DSB clustering at large scales, from >100 Mbp down to approximately 2 kbp, is modeled using a Monte-Carlo algorithm. A random-walk model of chromatin is combined with a track model, that predicts the radial distribution of energy from an ion, and the RLC (randomly-located-clusters) formalism, in software called DNAbreak. This model generalizes the random-breakage model, whose broken-stick fragment-size distribution is applicable to low-LET radiation. DSB induction due to track interaction with the DNA volume depends on the radiation quality parameter Q. This dose-independent parameter depends only weakly on LET. Multi-track, high-dose effects depend on the cluster intensity parameter lambda, proportional to fluence as defined by the RLC formalism. After lambda is determined by a numerical experiment, the model reduces to one adjustable parameter Q. The best numerical fits to the experimental data, determining Q, are obtained. The knowledge of lambda and Q allows us to give biophysically based extrapolations of high-dose DNA fragment-size data to low doses or to high LETs.

NASA Center JSC↗
NASA NTRSDate not supplied

Leveraging ­ CPF Spectral Information for Effective Angular Corrections in Sensor Inter-calibration Studies

The Climate Absolute Radiance and Refractivity Observatory Pathfinder (CPF) mission will provide a high-accuracy (0.3% radiometric uncertainty at k=1) SI-traceable on-orbit calibration reference for sensor intercalibration in reflective solar spectral region. CPF inter-calibration algorithms have been developed to address various sampling differences between CPF and target sensors, particularly in spectral, angular, spatial and temporal domains. CPF provides unique hyper-spectral measurements that allow the utilization of rich spectral information for critical inter-calibration procedures including angular correction and spectral-gap filling. The angular correction scheme of CPF mission has been constructed based on the spectral correlation relationship between CPF observed spectra and the spectra to be measured at the viewing/sun geometry angles of target sensors. The angular correction relationship is both angular and scene dependent. The scene variability issue can impose undesired uncertainties that complicates the correction for those errors. We have demonstrated that hyper-spectral radiance information can be well utilized to identify different scene types associated with CPF observations. Using spectral radiances-based scene clustering analysis can greatly reduce the uncertainty associated with the angular correction algorithm. Additionally, a reliable quality control scheme has been established, utilizing spectral similarity and regression-prediction error analyses, to ensure the successful and efficient implementation of the angular correction method.

Wan Wu↗
NASA NTRS1998

Fuzzy Classification of Ocean Color Satellite Data for Bio-optical Algorithm Constituent Retrievals

The ocean has been traditionally viewed as a 2 class system. Morel and Prieur (1977) classified ocean water according to the dominant absorbent particle suspended in the water column. Case 1 is described as having a high concentration of phytoplankton (and detritus) relative to other particles. Conversely, case 2 is described as having inorganic particles such as suspended sediments in high concentrations. Little work has gone into the problem of mixing bio-optical models for these different water types. An approach is put forth here to blend bio-optical algorithms based on a fuzzy classification scheme. This scheme involves two procedures. First, a clustering procedure identifies classes and builds class statistics from in-situ optical measurements. Next, a classification procedure assigns satellite pixels partial memberships to these classes based on their ocean color reflectance signature. These membership assignments can be used as the basis for a weighting retrievals from class-specific bio-optical algorithms. This technique is demonstrated with in-situ optical measurements and an image from the SeaWiFS ocean color satellite.

Campbell, Janet W.↗
DOE OSTI2023

A group finder algorithm optimised for the study of local galaxy environments

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here, in this study, we present a new simple group finder algorithm, TD-ENCLOSER, that finds the group that encloses a target galaxy of interest. Methods. TD-ENCLOSER is based on the kernel density estimation method which treats each galaxy, represented by a zero-dimensional particle, as a two-dimensional circular Gaussian. The algorithm assigns galaxies to peaks in the density field in order of density in descending order (‘top down’) so that galaxy groups ‘grow’ around the density peaks. Outliers in under-dense regions are prevented from joining groups by a specified hard threshold, while outliers at the group edges are clipped below a soft (blurred) interior density level. Results. The group assignments are largely insensitive to all free parameter variations apart from the hard density threshold and the kernel standard deviation, although this is a known feature of density-based group finder algorithms and it operates with a computing speed that increases linearly with the size of the input sample. In preparation for a companion paper, we also present a simple algorithm to select unique representative groups when duplicates occur. Conclusions. TD-ENCLOSER is tested on a mock galaxy catalogue using a smoothing scale of 0.3 Mpc and is found to be able to recover the input group distribution with sufficient accuracy to be applied to observed galaxy distributions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

CLUSTERING-BASED FEATURE LEARNING ON VARIABLE STARS

The success of automatic classification of variable stars depends strongly on the lightcurve representation. Usually, lightcurves are represented as a vector of many descriptors designed by astronomers called features. These descriptors are expensive in terms of computing, require substantial research effort to develop, and do not guarantee a good classification. Today, lightcurve representation is not entirely automatic; algorithms must be designed and manually tuned up for every survey. The amounts of data that will be generated in the future mean astronomers must develop scalable and automated analysis pipelines. In this work we present a feature learning algorithm designed for variable objects. Our method works by extracting a large number of lightcurve subsequences from a given set, which are then clustered to find common local patterns in the time series. Representatives of these common patterns are then used to transform lightcurves of a labeled set into a new representation that can be used to train a classifier. The proposed algorithm learns the features from both labeled and unlabeled lightcurves, overcoming the bias using only labeled data. We test our method on data sets from the Massive Compact Halo Object survey and the Optical Gravitational Lensing Experiment; the results show that our classification performance is as good as and in some cases better than the performance achieved using traditional statistical features, while the computational cost is significantly lower. With these promising results, we believe that our method constitutes a significant step toward the automation of the lightcurve classification pipeline.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Aerodynamic optimization of supersonic compressor cascade using differential evolution on GPU

Differential Evolution (DE) is a powerful stochastic optimization method. Compared to gradient-based algorithms, DE is able to avoid local minima but requires at the same time more function evaluations. In turbomachinery applications, function evaluations are performed with time-consuming CFD simulation, which results in a long, non affordable, design cycle. Modern High Performance Computing systems, especially Graphic Processing Units (GPUs), are able to alleviate this inconvenience by accelerating the design evaluation itself. In this work we present a validated CFD Solver running on GPUs, able to accelerate the design evaluation and thus the entire design process. An achieved speedup of 20x to 30x enabled the DE algorithm to run on a high-end computer instead of a costly large cluster. The GPU-enhanced DE was used to optimize the aerodynamics of a supersonic compressor cascade, achieving an aerodynamic loss minimization of 20%.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A systematic analysis of phase stability in refractory high entropy alloys utilizing linear and non-linear cluster expansion models

We report that obtaining surrogate models for various types of materials has long been a goal of computational material scientists and physicists, as they allow the calculation of thermodynamic quantities and properties of interest far more efficiently than DFT. Many surrogate models, including interatomic potentials generated by machine learning algorthims and cluster expansions, rely on incorporating many-body interactions such as three-body or four-body interactions. When utilizing machine learning algorithms for interatomic potentials, it is common to start with two-body interactions and systematically include three- and four-body clusters to improve the fit, stopping when including the additional clusters does not measurably change the predictive power of the model. In cluster expansions for FCC and related lattices, it is often enough to include mostly two-body interactions and a handful of three-body interactions. However, it remains to be seen whether those will be enough in the case of lattices with a lower packing fraction, such as BCC.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Testing redMaPPer centring probabilities using galaxy clustering and galaxy–galaxy lensing

Here, galaxy cluster centring is a key issue for precision cosmology studies using galaxy surveys. Mis-identification of central galaxies causes systematics in various studies such as cluster lensing, satellite kinematics, and galaxy clustering. The red-sequence Matched-filter Probabilistic Percolation (redMaPPer) estimates the probability that each member galaxy is central from photometric information rather than specifying one central galaxy. The redMaPPer estimates can be used for calibrating the off-centring effect, however, the centring algorithm has not previously been well-tested. We test the centring probabilities of redMaPPer cluster catalogue using the projected cross-correlation between redMaPPer clusters with photometric red galaxies and galaxy–galaxy lensing. We focus on the subsample of redMaPPer clusters in which the redMaPPer central galaxies (RMCGs) are not the brightest member galaxies (BMEM) and both of them have spectroscopic redshift.

79 ASTRONOMY AND ASTROPHYSICS↗