Search NASA⌕ Search

SEARCH · Search NASA

Results for “rank aggregation”

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 19 records

Harnessing Condorcet Methods to Improve Decision-making Based on Ranked Data

Decision-makers must often choose between multiple alternatives based on their relative merits across a variety of criteria. These multiple-criteria decision-making (MCDM) problems must be approached in an objective, measurable, and transparent fashion to obtain well-supported outcomes. The challenge of using sets of ranked data to identify the optimal choice is not unlike the challenge of using ranked ballots to identify the winner of an election in a preference voting system. As such, the methods of rank aggregation used in elections can be applied to help resolve MCDM problems. Previous research into the design of elections and ballots has yielded many algorithms with well-understood properties. A subset of these, called Condorcet methods, reliably identify the “Condorcet winner,” if it exists, giving the result that would defeat any other in a pairwise comparison. That, in addition to several other desirable qualities, makes Condorcet methods like the Schulze method, Ranked Pairs, and Copeland’s method, effective and scalable means for tackling MCDM problems. These rank aggregation methods have been implemented in JavaScript functions for incorporation into a web-based MCDM decision tool. These algorithms can be applied in a wide variety of contexts (for example, determining the “best” environmental remediation method or selecting a subcontractor) to facilitate effective decision-making. The performance of the JavaScript Condorcet prototype tool was compared across the implemented algorithms and with both a non-Condorcet rank aggregation method as well as an implementation of the Simple Multi-Attribute Rating Technique (SMART) algorithm.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Combining active learning suggestions

We study the problem of combining active learning suggestions to identify informative training examples by empirically comparing methods on benchmark datasets. Many active learning heuristics for classification problems have been proposed to help us pick which instance to annotate next. But what is the optimal heuristic for a particular source of data? Motivated by the success of methods that combine predictors, we combine active learners with bandit algorithms and rank aggregation methods. We demonstrate that a combination of active learners outperforms passive learning in large benchmark datasets and removes the need to pick a particular active learner a priori. We discuss challenges to finding good rewards for bandit approaches and show that rank aggregation performs well.

97 MATHEMATICS AND COMPUTING↗

Creating Near Real-time Hourly VIIRS Radiance Mosaic over Polar Regions from SatCORPS Global Cloud Composite (GCC)

While polar orbiting satellites are essential in providing the needed observations over polar regions for data assimilation, weather diagnoses/forecasting, and flight guidance and situation awareness in airborne field campaigns, there is limited temporal coverage. Often, polar mosaics are created by overlaying multiple satellite imagers on top of each other which can lead to transition lines and discontinuities in the data products. To help ease some of these shortcomings, we utilize the NASA Langley Satellite ClOud and Radiation Property retrieval System (SatCORPS) Mosaic algorithm for optimally fusing and merging selected imager radiances from the Visible Infrared Imaging Radiometer Suite (VIIRS) instrument onboard the Suomi National polar-orbiting Partnership (SNPP), Joint Polar Satellite System (JPSS-1), and JPSS-2 satellites, and the MODerate resolution Imaging Spectroradiometer (MODIS) instruments onboard AQUA and TERRA satellites. Since multiple satellites overpasses and instruments are used in creating hourly 3-km composites over the polar regions, selection of the best satellite data for each 3-km composite pixel is based on aggregated ranking of satellite resolution, time, viewing zenith angle, and distance from terminator. This ranking system provides a smoother transition and improves data discontinuity in the merged output resulting in a more seamless polar region dataset. We will discuss the use of this near real-time dataset to support polar airborne field campaigns and SatCORPS satellite-derived Global Cloud Composite (GCC) generation.

Satellite composites↗

Installation Assignment Durations and Patterns of Army Personnel

The purpose of this document is to report on the development of personnel assignment duration statistical metrics and statistical descriptions for groups of Army personnel aggregated by rank, career management field, and other descriptors for 32 Continental United States (CONUS) Army installations. This information can be used for generating evidence-based measures of personnel exposure times associated with environmental health considerations at the installation and career management field levels. Assignment duration statistical descriptions were developed to provide temporal metrics for groups of personnel at Army installations as foundational data to support a variety of assessments. Statistical results of personnel assignment durations at the installation level are provided in several formats. The 50th percentile assignment duration represents the median number of days personnel in groups aggregated by rank and career management field spend at the 32 CONUS Army installations in this study. Likewise, other duration percentiles (90th) and quartiles of assignment durations for groups aggregated by rank and career management field spend at each installation were developed. Assignment path analysis provide statistical descriptions of assignment durations at Army installations throughout increments of time (e.g., 5 years, 10 years). Key groupings of assignment paths were achieved by analyzing the duration of assignments at installations in chronological order from entry throughout specified increments of military service to generate the most common assignment paths across the 32 CONUS Army installations in this study. The developed assignment duration analytics and duration statistical descriptions provide foundational temporal metrics for groups of personnel at 32 CONUS Army installations to support a variety of assessments including those by human resource planners and environmental health specialists.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Hybrid feature selection approach for power transformer fault diagnosis based on support vector machine and genetic algorithm

To further improve fault diagnosis accuracy, a new hybrid feature selection approach combined with a genetic algorithm (GA) and support vector machine (SVM) is presented in this study. Adaptive synthetic technique and arctangent transformation method are adopted to improve the statistical property of the training set (IEC TC10 dataset). Five filter methods based on different evaluation metrics are employed to rank 48 input features derived from dissolved gas analysis (DGA). Then, feature combination methods are applied to aggregate feature ranks and form a lower-dimension candidate feature subset. The GA-SVM model is implemented to optimise parameters and select optimal feature subsets. 5-fold cross-validation accuracy of the GA-SVM is used to evaluate fault diagnosis capability of feature subsets and finally, a novel subset is determined as the optimal feature subset. Accuracy comparison manifests the superiority of the optimal feature subsets over that of conventional approaches. Besides, generalisation and robustness of the optimal subset are validated by testing DGA samples from the local power utility. Results indicate that the optimal feature subset obtained by the proposed method can significantly improve the accuracies of power transformer fault diagnosis.

Kari, Tusongjiang↗

Upstreamness and downstreamness in input–output analysis from local and aggregate information

Abstract Ranking sectors and countries within global value chains is of paramount importance to estimate risks and forecast growth in large economies. However, this task is often non-trivial due to the lack of complete and accurate information on the flows of money and goods between sectors and countries, which are encoded in input–output (I–O) tables. In this work, we show that an accurate estimation of the role played by sectors and countries in supply chain networks can be achieved without full knowledge of the I–O tables, but only relying on local and aggregate information, e.g., the total intermediate demand per sector. Our method, based on a rank-1 approximation to the I–O table, shows consistently good performance in reconstructing rankings (i.e., upstreamness and downstreamness measures for countries and sectors) when tested on empirical data from the world input–output database. Moreover, we connect the accuracy of our approximate framework with the spectral properties of the I–O tables, which ordinarily exhibit relatively large spectral gaps. Our approach provides a fast and analytically tractable framework to rank constituents of a complex economy without the need of matrix inversions and the knowledge of finer intersectorial details.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discovering the Multisectoral Impacts of Global Energy Sector Outcomes Through Multiple Ensemble Aggregation Measures

Understanding complex human-Earth system interactions often involves analyzing large scenario ensembles that encompass a wide range of plausible futures. These ensembles often require aggregation to summarize information based on specific criteria or conditions. However, previous research using global change scenario ensembles has largely overlooked how the choice of aggregation method influences the interpretation of results. To address this gap, we leverage a large ensemble data set designed to capture broad energy system dynamics generated using the Global Change Analysis Model. We first explore how energy-related uncertainties are propagated to both global and regional water-energy-food sectors. We then conduct a rank correlation analysis across seven ensemble aggregation measures and demonstrate the need to consider multiple measures in global change scenarios. Our results suggest that global water and food sector outcomes in the 21st century vary widely depending on different scenario assumptions. The global energy productivity is projected to improve by the end of the century across all scenarios. Moreover, regions facing water scarcity challenges in 2100 do not always overlap with those facing extreme energy and food sector outcomes. Although rank correlations across seven aggregation measures are relatively stable across sectors, we identify cases where relying on a single measure leads to losing critical information in the full ensemble. Reliance on a single aggregation measure can distort the interpretation of global change scenario outcomes. Instead, adopting multiple ensemble aggregation measures provides a more holistic understanding of global change scenario ensembles.

Kim, Gijoo↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Predicting measures of soil health using the microbiome and supervised machine learning

Soil health encompasses a range of biological, chemical, and physical soil properties that sustain the commercial and ecological value of agroecosystems. Monitoring soil health requires a comprehensive set of diagnostics that can be cost-prohibitive for routine analyses. The soil microbiome provides a rich source of information about soil properties, which can be assayed in a high-throughput, cost-effective way. We evaluated the accuracy of random forest (RF) and support vector machine (SVM) regression and classification models in predicting 12 measures of soil health, tillage status, and soil texture from 16S rRNA gene amplicon data with an operationally relevant sample set. We validated the efficacy of the best performing models against independent datasets and also tested best practices for processing microbiome data for use in machine learning. Soil health metrics could be predicted from microbiome data with the best models achieving a Kappa value of ~0.65, for categorical assessments, and a R2 value of ~0.8, for numerical scores. Biological health ratings were better predicted than chemical or physical ratings. Validation with independent datasets revealed that models had general predictive value for soil properties, including yield. The ecological profiles of several taxa important for model accuracy matched the observed relationships with soil health, including Pyrinomonadaceae, Nitrososphaeraceae, and Candidatus Udeaobacter. Models trained at the highest taxonomic resolution proved most accurate, with losses in accuracy resulting from rarefying, sparsity filtering, and aggregating at higher taxonomic ranks. Furthermore, our study provides the groundwork for developing scalable technology to use microbiome-based diagnostics for the assessment of soil health.

16S rRNA gene↗

Proximity Portability and in Transit , M-to-N Data Partitioning and Movement in SENSEI [Book Chapter]

In high-performance parallel in situ processing, the term in transit processing refers to those configurations where data must move from a producer to a consumer that runs on separate resources. In the context of parallel and distributed computing on an HPC platform one of the central challenges is to determine a mapping of data from producer ranks to consumer ranks. This problem is complicated by the heterogeneity that arises in producer-consumer pairs, such as when producer and consumer codes have different levels of concurrency, different scaling characteristics, or different data models. The resulting mapping and movement of data from M producer to N consumer ranks can have a significant impact on aggregate application performance, particularly when the data consumer requires only a subset of the overall data for its task. This chapter focuses on the design considerations that underlie SENSEI’s implementation to this challenging problem. These design considerations extend the core SENSEI architecture and include ideas like the need to accommodate flexibility in the choice of different partitioning methods, the ability for a data consumer to request and receive only the subset of data needed for its particular operation, and the ability to leverage any of several different data transport tools. The idea of proximity portability, being able to use different data transport methods as part of an in transit workflow, is illustrated through the use of three different transport layers where switching from one transport tool to another is accomplished with only a configuration file change. Here, the chapter also includes a performance analysis summary showing the performance gains that are possible in terms of multiple metrics, such as memory footprint, time to solution, and amount of data moved, when using optimized partitioners in an in transit setting, gains that are made possible by the implementation shaped by specific design considerations.

Bethel, E. Wes↗

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N. One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an “intelligent” mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N: One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an ''intelligent'' mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗

What Technical Choices Matter to Characterize Heat Wave and Cold Snap Events in Support of Bulk Power Grid Reliability Studies?

Extreme weather events, such as Heat Waves (HW) and Cold Snaps (CS), pose significant risks to the power grid. The United States (U.S.) Federal Energy Regulatory Commission Order No. 896 mandates regional coordination standards that account for extreme thermal events. However, the lack of a universal definition for extreme thermal events may lead to inconsistent compliance efforts among neighboring entities, undermining the reliability of the transmission system. This study directly addresses this challenge by systematically evaluating how varying technical choices in defining HW and CS fundamentally impact the characterization and ranking of extreme events for power grid reliability studies. We used 12 event definitions and multiple temperature spatial aggregation approaches to construct historical (1980–2024) regional extreme thermal event libraries across North American Electric Reliability Corporation (NERC) subregions in the conterminous U.S. We examined the sensitivity of event characteristics (e.g., duration, frequency, intensity, and spatial coverage) to different definitions. While some definitions produced similar libraries and top event rankings, definitions based on moving-window-averaged temperatures yielded markedly different characteristics. Spatial aggregation methods had minimal impact on heat wave or cold snap intensity, frequency and duration but significantly influenced spatial coverage. The top events identified across different aggregation methods were consistent, but their ranking order varied. These findings offer critical insights for characterizing and selecting extreme thermal events and for supporting local and cross-regional coordination as required by reliability standards.

Wan, Heng [Pacific Northwest National Laboratory (↗

Soar Survey Scoring

ORNL conducted an experiment to test COTS (commercial off the shelf) SOAR tools. Vendors interested in entering their tool into the experiment were asked to submit information videos about their tool for phase 1 to down-select which tools should make it through to the testing phase. SOC operators were assigned to watch a subset of the videos such that each video was assigned to the same number of operators. After watching all the videos, operators completed surveys which asked them to grade basic aspects about the tool as best as they could based on the provided video, and asked them to rank the order of their interest in the vendors they were assigned to watch videos on. The problem solved was how do we aggregate the results of the surveys and each of the operator's ranked lists into an overall ranking of all the tools. In addition, it was desirable to be able to work on this code before final results were collected from operators, so code to generate fake data was developed to output in the same output as the survey results.

Bridges, Robert↗

Parametric dynamic mode decomposition for reduced order modeling

Dynamic Mode Decomposition (DMD) is a model-order reduction approach, whereby spatial modes of fixed temporal frequencies are extracted from numerical or experimental data sets. The DMD low-rank or reduced operator is typically obtained by singular value decomposition of the temporal data sets. For parameter-dependent models, as found in many multi-query applications such as uncertainty quantification or design optimization, the only parametric DMD technique developed was a stacked approach, with data sets at multiple parameter values were aggregated together, increasing the computational work needed to devise low-rank dynamical reduced-order models. Here in this paper, we present two novel approach to carry out parametric DMD: one based on the interpolation of the reduced-order DMD eigen-pair and the other based on the interpolation of the reduced DMD (Koopman) operator. Numerical results are presented for diffusion-dominated nonlinear dynamical problems, including a multiphysics radiative transfer example. All three parametric DMD approaches are compared.

97 MATHEMATICS AND COMPUTING↗

Short-lead seasonal precipitation forecast in northeastern Brazil using an ensemble of artificial neural networks

This study assesses the deterministic and probabilistic forecasting skill of a 1-month-lead ensemble of Artificial Neural Networks (EANN) based on low-frequency climate oscillation indices. The predictand is the February-April (FMA) rainfall in the Brazilian state of Ceará, which is a prominent subject in climate forecasting studies due to its high seasonal predictability. Additionally, the study proposes combining the EANN with dynamical models into a hybrid multi-model ensemble (MME). The forecast verification is carried out through a leave-one-out cross-validation based on 40 years of data. The EANN forecasting skill is compared with traditional statistical models and the dynamical models that compose Ceará’s operational seasonal forecasting system. A spatial comparison showed that the EANN was among the models with the smallest Root Mean Squared Error (RMSE) and Ranked Probability Score (RPS) in most regions. Moreover, the analysis of the area-aggregated reliability showed that the EANN is better calibrated than the individual dynamical models and has better resolution than Multinomial Logistic Regression for above-normal (AN) and below-normal (BN) categories. It is also shown that combining the EANN and dynamical models into a hybrid MME reduces the overconfidence of the extreme categories observed in a dynamically-based MME, improving the reliability of the forecasting system.

54 ENVIRONMENTAL SCIENCES↗