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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 775 records · Page 43

All sources NASA NTRS DOE OSTI

NASA NTRS1987

Strake-generated vortex interactions for a fighter-like configuration

A combination of the Euler, and thin-layer Navier-Stokes equations were solved for the flowfield around a wing-strake-fuselage configuration similar to the F-16A aircraft. The flowfield was divided into multiple blocks using a zoning program, and the TNSWF solution program, based on an implicit solution algorithm, updates each subregion of the flowfield sequentially. The total grid contained approximately 300,000 grid points, and clustering was effected normal to all aircraft surfaces. The computed solutions agreed well quantitatively with wind-tunnel pressure distribution data, and they agreed well qualitatively with flow visualization from wind- and water-tunnel tests.

Reznick, Steven G.↗

NASA NTRS1989

Land Analysis System (LAS)

Version 4.1 of LAS provides flexible framework for algorithm development and processing and analysis of image data. Over 500,000 lines of code enable image repair, clustering, classification, film processing, geometric registration, radiometric correction, and manipulation of image statistics.

Pease, P. B.↗

NASA NTRS2004

Precise and Efficient Static Array Bound Checking for Large Embedded C Programs

In this paper we describe the design and implementation of a static array-bound checker for a family of embedded programs: the flight control software of recent Mars missions. These codes are large (up to 250 KLOC), pointer intensive, heavily multithreaded and written in an object-oriented style, which makes their analysis very challenging. We designed a tool called C Global Surveyor (CGS) that can analyze the largest code in a couple of hours with a precision of 80%. The scalability and precision of the analyzer are achieved by using an incremental framework in which a pointer analysis and a numerical analysis of array indices mutually refine each other. CGS has been designed so that it can distribute the analysis over several processors in a cluster of machines. To the best of our knowledge this is the first distributed implementation of static analysis algorithms. Throughout the paper we will discuss the scalability setbacks that we encountered during the construction of the tool and their impact on the initial design decisions.

Venet, Arnaud↗

NASA NTRS1994

Multigrid techniques for nonlinear eigenvalue probems: Solutions of a nonlinear Schroedinger eigenvalue problem in 2D and 3D

This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.

Costiner, Sorin↗

DOE OSTI2024

Baryon acoustic oscillation theory and modelling systematics for the DESI 2024 results

This paper provides a comprehensive overview of how fitting of baryon acoustic oscillations (BAO) is carried out within the upcoming Dark Energy Spectroscopic Instrument’s (DESI) 2024 results using its DR1 data set, and the associated systematic error budget from theory and modelling of the BAO. We derive new results showing how non-linearities in the clustering of galaxies can cause potential biases in measurements of the isotropic (⁠α iso ⁠) and anisotropic (⁠α ap ) BAO distance scales, and how these can be effectively removed with an appropriate choice of reconstruction algorithm. We then demonstrate how theory leads to a clear choice for how to model the BAO and develop, implement, and validate a new model for the remaining smooth-broad-band (i.e. without BAO) component of the galaxy clustering. Finally, we explore the impact of all remaining modelling choices on the BAO constraints from DESI using a suite of high-precision simulations, arriving at a set of best practices for DESI BAO fits, and an associated theory and modelling systematic error. Overall, our results demonstrate the remarkable robustness of the BAO to all our modelling choices and motivate a combined theory and modelling systematic error contribution to the post-reconstruction DESI BAO measurements of no more than 0.1 per cent (0.2 per cent) for its isotropic (anisotropic) distance measurements. We expect the theory and best practices laid out to here to be applicable to other BAO experiments in the era of DESI and beyond.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Hypercane

Automatically summarizing a collection of documents requires analyzing their features using various operations. Hypercane is a framework for building algorithms for sampling files from a collection. Sampling is a vital part of automatic summarization. Hypercane ties together many existing third-party libraries. These libraries include those for processing web resources, natural language processing for analyzing text and filtering documents, and machine learning for clustering summarization candidates. A user can run up to more than 70 operations on a corpus in the order of their choosing. Through these operations, they can create custom automatic summarization algorithms to help them process the corpus of their choice. Details of the algorithms possible with Hypercane are available in Jones 2021. Details of running Hypercane are available in Jones et al.; 2021.

Jones, Shawn↗

DOE OSTI2020

Reliable photometric membership (RPM) of galaxies in clusters – I. A machine learning method and its performance in the local universe

ABSTRACT We introduce a new method to determine galaxy cluster membership based solely on photometric properties. We adopt a machine learning approach to recover a cluster membership probability from galaxy photometric parameters and finally derive a membership classification. After testing several machine learning techniques (such as stochastic gradient boosting, model averaged neural network and k-nearest neighbours), we found the support vector machine algorithm to perform better when applied to our data. Our training and validation data are from the Sloan Digital Sky Survey main sample. Hence, to be complete to $M_r^* + 3$, we limit our work to 30 clusters with $z$phot-cl ≤ 0.045. Masses (M200) are larger than $\sim 0.6\times 10^{14} \, \mathrm{M}_{\odot }$ (most above $3\times 10^{14} \, \mathrm{M}_{\odot }$). Our results are derived taking in account all galaxies in the line of sight of each cluster, with no photometric redshift cuts or background corrections. Our method is non-parametric, making no assumptions on the number density or luminosity profiles of galaxies in clusters. Our approach delivers extremely accurate results (completeness, C $\sim 92{\rm{ per\ cent}}$ and purity, P $\sim 87{\rm{ per\ cent}}$) within R200, so that we named our code reliable photometric membership. We discuss possible dependencies on magnitude, colour, and cluster mass. Finally, we present some applications of our method, stressing its impact to galaxy evolution and cosmological studies based on future large-scale surveys, such as eROSITA, EUCLID, and LSST.

Lopes, Paulo A. A.↗

DOE OSTI2020

ReaxFF molecular dynamics simulations of electrolyte–water systems at supercritical temperature

We have performed ReaxFF molecular dynamics simulations of alkali metal–chlorine pairs in different water densities at supercritical temperature (700 K) to elucidate the structural and dynamical properties of the system. The radial distribution function and the angular distribution function explain the inter-ionic structural and orientational arrangements of atoms during the simulation. The coordination number of water molecules in the solvation shell of ions increases with an increase in the radius of ions. We find that the self-diffusion coefficient of metal ions increases with a decrease in density under supercritical conditions due to the formation of voids within the system. The hydrogen bond dynamics has been interpreted by the residence time distribution of various ions, which shows Li+ having the highest water retaining capability. The void distribution within the system has been analyzed by using the Voronoi polyhedra algorithm providing an estimation of void formation within the system at high temperatures. We observe the formation of salt clusters of Na+ and K+ at low densities due to the loss of dielectric constants of ions. The diffusion of ions gets altered dramatically due to the formation of voids and nucleation of ions in the system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

On the Robustness of Network Community Structure Under Addition of Edges

Communities represent important functional modules in networked systems. A key goal in preserving such communities is understanding their robustness under perturbations. Previous research has studied the impact of node removals and edge removals on the community structure. However, the impact of edge additions on the robustness of the community structure is relatively unknown. Edge additions or false positive edges may simulate measurement errors or external exceptional events that threaten the functionality of networked systems. Here, we study the impact of edge additions on the community structure using Lancichinetti-Fortunato-Radicchi (LFR) benchmark networks. We show that, for a fixed network size, the impact of edge additions is greater on networks with initially weak community structure than on networks with strongly clustered structures. In addition, we find that the perception of the impact is also dependent on the community detection algorithm used to uncover communities. In particular, we found that modularity-based methods such as Leiden and Louvain are less affected than information-theoretic and message passing-based methods such as Infomap and Label Propagation. Our results demonstrate that edge addition can (a) significantly impact the community structure of networks based on their initial conditions, and (b) the perception of the impact is dependent on the community detection algorithm used. We describe limitations, open challenges, and how this methodology can inform the design of resilient networked systems under edge additions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

The Circular Velocity Curve of the Milky Way from 5–25 kpc Using Luminous Red Giant Branch Stars

We present a sample of 254,882 luminous red giant branch (LRGB) stars selected from the APOGEE and LAMOST surveys. By combining photometric and astrometric information from the Two Micron All Sky Survey and Gaia survey, the precise distances of the sample stars are determined by a supervised machine-learning algorithm: the gradient-boosted decision trees. To test the accuracy of the derived distances, member stars of globular clusters (GCs) and open clusters are used. The tests by cluster member stars show a precision of about 10% with negligible zero-point offsets, for the derived distances of our sample stars. The final sample covers a large volume of the Galactic disk(s) and halo of 0 < R < 30 kpc and |Z| ≤ 15 kpc. The rotation curve (RC) of the Milky Way across the radius of 5 ≲ R ≲ 25 kpc has been accurately measured with ~54,000 stars of the thin disk population selected from the LRGB sample. The derived RC shows a weak decline along R with a gradient of -1.83 ± 0.02 (stat.) ± 0.07 (sys.) km s -1 kpc -1 , in excellent agreement with the results measured by previous studies. The circular velocity at the solar position, yielded by our RC is 234.04 ± 0.08 (stat.) ± 1.36 (sys.) km s -1 , again in great consistency with other independent determinations. From the newly constructed RC, as well as constraints from other data, we have constructed a mass model for our Galaxy, yielding a mass of the dark matter halo of M 200 = (8.05 ± 1.15) × 10 11 M ⊙ with a corresponding radius of R 200 = 192.37 ± 9.24 kpc and a local dark matter density of 0.39 ± 0.03 GeV cm -3 .

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1986

Principles and scope of synthetic photometry

The synthetic photometry algorithm and various applications for the algorithm are described. The synthetic photometry algorithm provides magnitudes and colors computed from a spectral energy flux distribution and the response functions of a photometric system. The principles of synthetic photometry which include the observed and theoretical stellar energy distributions and passbands of the photometric systems are discussed. The equations utilized in the algorithm to compute the magnitudes and color indices are provided. There is a need for an evaluation of the passbands and a correlation between the observed photometric and spectrophotometric data of the stars. The algorithm is used as a universal translator providing the communication channels between different reseach areas; it is applicable to clusters, faint star counts, and deep multicolor surveys of galaxies.

Buser, R.↗

NASA NTRS1992

Sea surface velocities from visible and infrared multispectral atmospheric mapping sensor imagery

High resolution (100 m), sequential Multispectral Atmospheric Mapping Sensor (MAMS) images were used in a study to calculate advective surface velocities using the Maximum Cross Correlation (MCC) technique. Radiance and brightness temperature gradient magnitude images were formed from visible (0.48 microns) and infrared (11.12 microns) image pairs, respectively, of Chandeleur Sound, which is a shallow body of water northeast of the Mississippi delta, at 145546 GMT and 170701 GMT on 30 Mar. 1989. The gradient magnitude images enhanced the surface water feature boundaries, and a lower cutoff on the gradient magnitudes calculated allowed the undesirable sunglare and backscatter gradients in the visible images, and the water vapor absorption gradients in the infrared images, to be reduced in strength. Requiring high (greater than 0.4) maximum cross correlation coefficients and spatial coherence of the vector field aided in the selection of an optimal template size of 10 x 10 pixels (first image) and search limit of 20 pixels (second image) to use in the MCC technique. Use of these optimum input parameters to the MCC algorithm, and high correlation and spatial coherence filtering of the resulting velocity field from the MCC calculation yielded a clustered velocity distribution over the visible and infrared gradient images. The velocity field calculated from the visible gradient image pair agreed well with a subjective analysis of the motion, but the velocity field from the infrared gradient image pair did not. This was attributed to the changing shapes of the gradient features, their nonuniqueness, and large displacements relative to the mean distance between them. These problems implied a lower repeat time for the imagery was needed in order to improve the velocity field derived from gradient imagery. Suggestions are given for optimizing the repeat time of sequential imagery when using the MCC method for motion studies. Applying the MCC method to the infrared brightness temperature imagery yielded a velocity field which did agree with the subjective analysis of the motion and that derived from the visible gradient imagery. Differences between the visible and infrared derived velocities were 14.9 cm/s in speed and 56.7 degrees in direction. Both of these velocity fields also agreed well with the motion expected from considerations of the ocean bottom topography and wind and tidal forcing in the study area during the 2.175 hour time interval.

Pope, P. A.↗

NASA NTRS1999

Dependence of Cumulus Anvil Radiative Properties on Environmental Conditions in the Tropical West Pacific

Areally extensive, optically thick anvil clouds associated with mesoscale convective clusters dominate the shortwave cloud forcing in the tropics and provide longwave forcing comparable to that of thin cirrus. Changes in the cover and optical thickness of tropical anvils as climate warms can regulate the sign of cloud feedback. As a prelude to the study of MMCR data from the ARM TWP sites, we analyze ISCCP-derived radiative characteristics of anvils observed in the tropical west Pacific during the TOGA-COARE IOP. Anvils with radius greater than 100 km were identified and tracked from inception to decay using the Machado-Rossow algorithm. Corresponding environmental conditions just prior to the start of the convectove event were diagnosed using the Lin-Johnson objective analysis product. Small clusters (100-200 km radius) are observed to have a broad range of optical thicknesses (10-50), while intermediate optical thickness clusters are observed to range in size from 100 km to almost 1000 km. Large-size clusters appear to be favored by strong pre-storm large scale upward motion throughout the troposphere, moist low-to-midlevel relative humidities, environments with slightly higher CAPE than those for smaller clusters, and strong front-to-rear flow. Optically thick anvils are favored in situations of strong low-level moisture convergence and strong upper-level shear.

Ye, B.↗

NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

DOE OSTI2020

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2017

The NASA Analogy Software Cost Model: A Web-Based Cost Analysis Tool

This paper provides an overview of the many new features and algorithm updates in the release of the NASA Analogy Software Cost Tool (ASCoT). ASCoT is a web-based tool that provides a suite of estimation tools to support early lifecycle NASA Flight Software analysis. ASCoT employs advanced statistical methods such as Cluster Analysis to provide an analogy based estimate of software delivered lines of code and development effort, a regression based Cost Estimating Relationships (CER) model that estimates cost (dollars), and a COCOMO II based estimate. The ASCoT algorithms are designed to primarily work with system level inputs such as mission type (earth orbiter vs. planetary vs. rover), the number of instruments, and total mission cost. This allows the user to supply a minimal number of mission-level parameters which are better understood early in the life-cycle, rather than a large number of complex inputs.

Hihn, Jairus↗

DOE OSTI2021

A clustering-based approach to ocean model–data comparison around Antarctica

The Antarctic Continental Shelf seas (ACSS) are a critical, rapidly changing element of the Earth system. Analyses of global-scale general circulation model (GCM) simulations, including those available through the Coupled Model Intercomparison Project, Phase 6 (CMIP6), can help reveal the origins of observed changes and predict the future evolution of the ACSS. However, an evaluation of ACSS hydrography in GCMs is vital: previous CMIP ensembles exhibit substantial mean-state biases (reflecting, for example, misplaced water masses) with a wide inter-model spread. Because the ACSS are also a sparely sampled region, grid-point-based model assessments are of limited value. Our goal is to demonstrate the utility of clustering tools for identifying hydrographic regimes that are common to different source fields (model or data), while allowing for biases in other metrics (e.g., water mass core properties) and shifts in region boundaries. We apply K-means clustering to hydrographic metrics based on the stratification from one GCM (Community Earth System Model version 2; CESM2) and one observation-based product (World Ocean Atlas 2018; WOA), focusing on the Amundsen, Bellingshausen and Ross seas. When applied to WOA temperature and salinity profiles, clustering identifies “primary” and “mixed” regimes that have physically interpretable bases. For example, meltwater-freshened coastal currents in the Amundsen Sea and a region of high-salinity shelf water formation in the southwestern Ross Sea emerge naturally from the algorithm. Both regions also exhibit clearly differentiated inner- and outer-shelf regimes. The same analysis applied to CESM2 demonstrates that, although mean-state model biases in water mass T–S characteristics can be substantial, using a clustering approach highlights that the relative differences between regimes and the locations where each regime dominates are well represented in the model. CESM2 is generally fresher and warmer than WOA and has a limited fresh-water-enriched coastal regimes. Given the sparsity of observations of the ACSS, this technique is a promising tool for the evaluation of a larger model ensemble (e.g., CMIP6) on a circum-Antarctic basis.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2026

Bridging Control and Deployment: A Cross-Layer Analysis of Scalable Building Cluster Control

Building cluster control has emerged as a promising approach for enabling flexible and coordinated operation of distributed building systems, yet its transition from pilot demonstrations to routine grid-interactive operation remains limited. This paper argues that this gap cannot be explained by control algorithms alone. Instead, it arises from interacting barriers in communication infrastructure, data and semantic interoperability, uncertainty management, stakeholder participation, market design, and policy support. Accordingly, the paper reviews both technical and non-technical barriers to building cluster control. Technical challenges include heterogeneous devices and protocols, communication latency and reliability, distributed decision-making, and uncertainty propagation across aggregated loads. Non-technical barriers include user participation, stakeholder coordination, incentive allocation, and data governance. Existing solution approaches are synthesized, including semantic interoperability frameworks, edge and hierarchical communication architectures, distributed and transactive control strategies, uncertainty-aware optimization, policy mechanisms, and market reforms. Based on this analysis, two research directions are identified: testing infrastructures that can evaluate control performance under realistic multi-building conditions, and abstraction methods that allow building clusters to interact with other energy sectors through standardized flexibility representations. Overall, the paper provides a structured review of how building cluster control can move from isolated demonstrations toward reproducible, market-compatible, and grid-relevant implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗