Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical algorithm”

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 217 records · Page 12

ISAVS: Interactive Scalable Analysis and Visualization System

Modern science is inundated with ever increasing data sizes as computational capabilities and image acquisition techniques continue to improve. For example, simulations are tackling ever larger domains with higher fidelity, and high-throughput microscopy techniques generate larger data that are fundamental to gather biologically and medically relevant insights. As the image sizes exceed memory, and even sometimes local disk space, each step in a scientific workflow is impacted. Current software solutions enable data exploration with limited interactivity for visualization and analytic tasks. Furthermore analysis on HPC systems often require complex hand-written parallel implementations of algorithms that suffer from poor portability and maintainability. We present a software infrastructure that simplifies end-to-end visualization and analysis of massive data. First, a hierarchical streaming data access layer enables interactive exploration of remote data, with fast data fetching to test analytics on subsets of the data. Second, a library simplifies the process of developing new analytics algorithms, allowing users to rapidly prototype new approaches and deploy them in an HPC setting. Third, a scalable runtime system automates mapping analysis algorithms to whatever computational hardware is available, reducing the complexity of developing scaling algorithms. Here, we demonstrate the usability and performance of our system using a use case from neuroscience: filtering, registration, and visualization of tera-scale microscopy data. We evaluate the performance of our system using a leadership-class supercomputer, Shaheen II.

97 MATHEMATICS AND COMPUTING↗

Transactive Coordination of Flexible Loads with Energy Storage through Day-ahead Scheduling

We are motivated by the problem faced by the aggregator (market coordinator) to optimally schedule the day-ahead operation of flexible loads and energy storages through transactive coordination. The aggregator, which may be the ISO/DSO/LSE/Utility company/Microgrid controller depending on the system considered, aims to maximize social welfare of interconnected distributed energy resources (DERs) by determining the optimal hourly prices for the next operating day. Arbitrage and private objectives are incorporated to ensure participation of third-party energy storages. We show that the coordination problem can be mathematically formulated as a multi-period optimal control problem with global power flow constraints and local DER-level constraints, and propose an iterative hierarchical decentralized solution method which respects the privacy of DERs. Under proper convexity assumptions, the algorithm will converge to the optimal day-ahead market clearing prices. We illustrate the algorithm using a four-bus power system with DC power flow constraints. Results show that incorporating degradation cost decreases the energy storage's ability of peak shaving and that social welfare of the system increases when discharging and charging efficiencies increase.

Ma, Ke↗

THE ROCKSTAR PHASE-SPACE TEMPORAL HALO FINDER AND THE VELOCITY OFFSETS OF CLUSTER CORES

We present a new algorithm for identifying dark matter halos, substructure, and tidal features. The approach is based on adaptive hierarchical refinement of friends-of-friends groups in six phase-space dimensions and one time dimension, which allows for robust (grid-independent, shape-independent, and noise-resilient) tracking of substructure; as such, it is named ROCKSTAR (Robust Overdensity Calculation using K-Space Topologically Adaptive Refinement). Our method is massively parallel (up to 10{sup 5} CPUs) and runs on the largest current simulations (>10{sup 10} particles) with high efficiency (10 CPU hours and 60 gigabytes of memory required per billion particles analyzed). A previous paper has shown ROCKSTAR to have excellent recovery of halo properties; we expand on these comparisons with more tests and higher-resolution simulations. We show a significant improvement in substructure recovery compared to several other halo finders and discuss the theoretical and practical limits of simulations in this regard. Finally, we present results that demonstrate conclusively that dark matter halo cores are not at rest relative to the halo bulk or substructure average velocities and have coherent velocity offsets across a wide range of halo masses and redshifts. For massive clusters, these offsets can be up to 350 km s{sup -1} at z = 0 and even higher at high redshifts. Our implementation is publicly available at http://code.google.com/p/rockstar.

79 ASTRONOMY AND ASTROPHYSICS↗

Distribution Feeder-Scale Fast Frequency Response via Optimal Coordination of Net-load Resources Part II: Large-Scale Demonstration

This work is the second of a two-part series in which we develop and experimentally demonstrate a hierarchical control solution for optimally coordinating thousands of deferrable loads and distributed energy resources (DERs) to provide fast frequency response (FFR) from an entire distribution feeder. In Part I, we developed and proved practical algorithms for fast, cost-based optimal dispatch and for determining the optimal amount of headroom to operate solar inverters with to support FFR dispatch while minimizing opportunity cost. Simulation results in Part I demonstrated the advantages of the hierarchical dispatch approach in being able to maintain fast solution times needed for FFR even when the problem size increases. In Part II, we implement the algorithms developed in Part I in a novel, large-scale power hardware-in-the-loop experiment including embedded controllers and more than 100 powered appliance loads and DER connected to a simulated real-world distribution system with more than 10,000 controlled devices. Experimental results from multiple scenarios confirm that the optimal FFR dispatch approach scales well and can optimally coordinate more than 10,000 net-load resources across a distribution network while achieving hardware response times within 500 ms, which is not possible using state-of-the-art optimal coordination approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Tactile Sensation Integration from Prosthetic Fingertips Enables Multi-Texture Surface Recognition

Multifunctional flexible tactile sensors could be useful to improve the control of prosthetic hands. To that end, highly stretchable liquid metal tactile sensors (LMS) were designed, manufactured via photolithography, and incorporated into the fingertips of a prosthetic hand. Three novel contributions were made with the LMS. First, individual fingertips were used to distinguish between different speeds of sliding contact with different surfaces. Second, differences in surface textures were reliably detected during sliding contact. Third, the capacity for hierarchical tactile sensor integration was demonstrated by using four LMS signals simultaneously to distinguish between ten complex multi-textured surfaces. Four different machine learning algorithms were compared for their successful classification capabilities: K-nearest neighbor (KNN), support vector machine (SVM), random forest (RF), and neural network (NN). The time-frequency features of the LMSs were extracted to train and test the machine learning algorithms. The NN generally performed the best at the speed and texture detection with a single finger and had a 99.2 ± 0.8% accuracy to distinguish between ten different multi-textured surfaces using four LMSs from four fingers simultaneously. The capability for hierarchical multi-finger tactile sensation integration could be useful to provide a higher level of intelligence for artificial hands.

Abd, Moaed A. (ORCID:0000000284954244)↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfill their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

behind-the-meter↗

Anomaly Detection in Partially Observed Traffic Networks

This paper addresses the problem of detecting anomalous activity in traffic networks where the network is not directly observed. Given knowledge of what the node-tonode traffic in a network should be, any activity that differs significantly from this baseline would be considered anomalous. We propose a Bayesian hierarchical model for estimating the traffic rates and detecting anomalous changes in the network. The probabilistic nature of the model allows us to perform statistical goodness-of-fit tests to detect significant deviations from a baseline network. We show that due to the more defined structure of the hierarchical Bayesian model, such tests perform well even when the empirical models estimated by the EM algorithm are misspecified. Finally, we apply our model to both simulated and real datasets to demonstrate its superior performance over existing alternatives.

97 MATHEMATICS AND COMPUTING↗

pnnl/apt

The current scripts utilize a well-known cluster analysis algorithm, called ordering points to identify the clustering structures (OPTICS), and an automatic cluster extraction algorithm for clustering analysis of 3D spatial data, specifically for the Atom Probe Tomography data. A hierarchical clustering scheme, together with density-based clustering, were implemented.

Wang, Jing↗

The direct and indirect drivers shaping RNA viral communities in grassland soil

Recent studies have revealed diverse RNA viral communities in soils. Yet, how environmental factors influence soil RNA viruses remains largely unknown. Here, we recovered RNA viral communities from 24 metatranscriptomes sequenced from grassland soils managed under a range of environmental conditions including 1) water content: 100% and 25% water holding capacity, 2) plant presence: planted with tall wheatgrass (Thinopyrum ponticum) and bare soil, 3) cultivar type: Alkar and Jose, and 4) soil depth: 0-5 cm and 15-25 cm. The recovered RNA viral communities were novel with nearly one-third of the RNA viral contigs uniquely detected in the studied grassland. The classified RNA viral contigs are mostly known as eukaryotic RNA viruses (74.7%) belonging to Phyla Duplornaviricota, Kitrinoviricota, Lenarviricota, and Pisuviricota. Eukaryotic RNA viruses of Family Mitoviridae as well as their natural hosts, Fungi, are one of the most dominant taxa. Consistent with the results of nonmetric multidimensional scaling analysis, the four environmental conditions (water content, plant presence, cultivar, and soil depth) significantly influence the assemblages of soil RNA viral communities as suggested by the correlation analysis and the random forest algorithm. The modularity analysis of the factor network and the structural equation modeling further support the hierarchical associations among the four environmental factors and the community factors representing the co-existing eukaryotic, prokaryotic, and RNA viral communities. The soil water content, plant presence, and type of cultivar demonstrate a significant positive impact on eukaryotic RNA viral richness directly as well as indirectly on eukaryotic RNA viral abundance via influencing the co-existing eukaryotic members in this soil. Our data also provide statistical support for the negative influence of soil depth on soil eukaryotic richness and abundances resulting in its indirect impact on soil eukaryotic RNA viral communities. This study provides field-relevant information on how environmental and community factors collectively shape soil RNA communities and contribute to ecological understanding of RNA viral survival under various environmental conditions and virus-host interactions in soil.

Wu, Ruonan↗

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources: Preprint

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfill their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

behind-the-meter↗

A Peer-to-Peer Market-Based Control Strategy for a Smart Residential Community with Behind-the-Meter Distributed Energy Resources

This paper presents a distributed peer-to-peer market control strategy to manage and to enable resource sharing of behind-the-meter distributed energy resources in a residential community. In the proposed strategy, each consumer or prosumer determines the flexibility of their point of connection to the power network such that the obtained flexibility is network-feasible. Based on the feasible flexibility, the consumers and the prosumers trade power among each other at each time instance to fulfil their preferred load requirements while maximizing their payoffs and helping to regulate node voltages inside the community. Because the problem to be solved is non-convex, a distributed particle swarm optimization algorithm is used to coordinate the consumers/prosumers in a fully autonomous manner without any centralized or hierarchical coordination. Numerical simulations performed on a community of 48 homes demonstrate the efficacy of the proposed approach.

distributed energy resource↗

A novel CMB component separation method: hierarchical generalized morphological component analysis

ABSTRACT We present a novel technique for cosmic microwave background (CMB) foreground subtraction based on the framework of blind source separation. Inspired by previous work incorporating local variation to generalized morphological component analysis (GMCA), we introduce hierarchical GMCA (HGMCA), a Bayesian hierarchical graphical model for source separation. We test our method on Nside = 256 simulated sky maps that include dust, synchrotron, free–free, and anomalous microwave emission, and show that HGMCA reduces foreground contamination by $25{{\ \rm per\ cent}}$ over GMCA in both the regions included and excluded by the Planck UT78 mask, decreases the error in the measurement of the CMB temperature power spectrum to the 0.02–0.03 per cent level at ℓ > 200 (and $\lt 0.26{{\ \rm per\ cent}}$ for all ℓ), and reduces correlation to all the foregrounds. We find equivalent or improved performance when compared to state-of-the-art internal linear combination type algorithms on these simulations, suggesting that HGMCA may be a competitive alternative to foreground separation techniques previously applied to observed CMB data. Additionally, we show that our performance does not suffer when we perturb model parameters or alter the CMB realization, which suggests that our algorithm generalizes well beyond our simplified simulations. Our results open a new avenue for constructing CMB maps through Bayesian hierarchical analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

A Distributed Control Architecture for Cascaded H-Bridge Converter with Integrated Battery Energy Storage

Cascaded H-bridge topology has been used in grid-tied converters for battery energy storage system due to its modular structure. To fully utilize the converter’s modularity, this paper proposes a hierarchical distributed control architecture that consists of primary control, secondary control and battery state of charge (SOC) balancing control. Primary control ensures accurate current tracking while a distributed secondary control based on consensus algorithm is presented to regulate power sharing among modules and is proved to be stable theoretically. Here, a distributed SOC balancing control is further introduced to improve energy efficiency of battery energy storage system. Finally, the hierarchical distributed control strategy is implemented using hardware controllers and a software platform. Besides, a carrier phase shift control is also implemented to achieve multilevel output voltage and harmonic reduction. The experimental results demonstrate the performance of the proposed control scheme effectively.

25 ENERGY STORAGE↗

SU-F-R-22: Malignancy Classification for Small Pulmonary Nodules with Radiomics and Logistic Regression

Purpose: We conducted a retrospective study of Radiomics research for classifying malignancy of small pulmonary nodules. A machine learning algorithm of logistic regression and open research platform of Radiomics, IBEX (Imaging Biomarker Explorer), were used to evaluate the classification accuracy. Methods: The training set included 100 CT image series from cancer patients with small pulmonary nodules where the average diameter is 1.10 cm. These patients registered at Chang Gung Memorial Hospital and received a CT-guided operation of lung cancer lobectomy. The specimens were classified by experienced pathologists with a B (benign) or M (malignant). CT images with slice thickness of 0.625 mm were acquired from a GE BrightSpeed 16 scanner. The study was formally approved by our institutional internal review board. Nodules were delineated and 374 feature parameters were extracted from IBEX. We first used the t-test and p-value criteria to study which feature can differentiate between group B and M. Then we implemented a logistic regression algorithm to perform nodule malignancy classification. 10-fold cross-validation and the receiver operating characteristic curve (ROC) were used to evaluate the classification accuracy. Finally hierarchical clustering analysis, Spearman rank correlation coefficient, and clustering heat map were used to further study correlation characteristics among different features. Results: 238 features were found differentiable between group B and M based on whether their statistical p-values were less than 0.05. A forward search algorithm was used to select an optimal combination of features for the best classification and 9 features were identified. Our study found the best accuracy of classifying malignancy was 0.79±0.01 with the 10-fold cross-validation. The area under the ROC curve was 0.81±0.02. Conclusion: Benign nodules may be treated as a malignant tumor in low-dose CT and patients may undergo unnecessary surgeries or treatments. Our study may help radiologists to differentiate nodule malignancy for low-dose CT.

60 APPLIED LIFE SCIENCES↗

A Scalable Parallel Algorithm for Large-Scale Protein Sequence Homology Detection

Protein sequence homology detection is a fundamental problem in computational molecular biology, with a pervasive application in nearly all analyses that aim to structurally and functionally characterize protein molecules. While detecting homology between two protein sequences is computationally inexpensive, detecting pairwise homology at a large-scale becomes prohibitive, requiring millions of CPU hours. Yet, there is currently no efficient method available to parallelize this kernel. In this paper, we present the key characteristics that make this problem particularly hard to parallelize, and then propose a new parallel algorithm that is suited for large-scale protein sequence data. Our method, called pGraph, is designed using a hierarchical multiple-master multiple-worker model, where the processor space is partitioned into subgroups and the hierarchy helps in ensuring the workload is load balanced fashion despite the inherent irregularity that may originate in the input. Experimental evaluation demonstrates that our method scales linearly on all input sizes tested (up to 640K sequences) on a 1,024 node supercomputer. In addition to demonstrating strong scaling, we present an extensive study of the various components of the system and related parametric studies.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating the Benefits of Bayesian Hierarchical Methods for Analyzing Heterogeneous Environmental Datasets: A Case Study of Marine Organic Carbon Fluxes

Large compilations of heterogeneous environmental observations are increasingly available as public databases, allowing researchers to test hypotheses across datasets. Statistical complexities arise when analyzing compiled data due to unbalanced spatial sampling, variable environmental context, mixed measurement techniques, and other reasons. Hierarchical Bayesian modeling is increasingly used in environmental science to describe these complexities, however few studies explicitly compare the utility of hierarchical Bayesian models to simpler and more commonly applied methods. Here we demonstrate the utility of the hierarchical Bayesian approach with application to a large compiled environmental dataset consisting of 5,741 marine vertical organic carbon flux observations from 407 sampling locations spanning eight biomes across the global ocean. We fit a global scale Bayesian hierarchical model that describes the vertical profile of organic carbon flux with depth. Profile parameters within a particular biome are assumed to share a common deviation from the global mean profile. Individual station-level parameters are then modeled as deviations from the common biome-level profile. The hierarchical approach is shown to have several benefits over simpler and more common data aggregation methods. First, the hierarchical approach avoids statistical complexities introduced due to unbalanced sampling and allows for flexible incorporation of spatial heterogeneitites in model parameters. Second, the hierarchical approach uses the whole dataset simultaneously to fit the model parameters which shares information across datasets and reduces the uncertainty up to 95% in individual profiles. Third, the Bayesian approach incorporates prior scientific information about model parameters; for example, the non-negativity of chemical concentrations or mass-balance, which we apply here. We explicitly quantify each of these properties in turn. We emphasize the generality of the hierarchical Bayesian approach for diverse environmental applications and its increasing feasibility for large datasets due to recent developments in Markov Chain Monte Carlo algorithms and easy-to-use high-level software implementations.

54 ENVIRONMENTAL SCIENCES↗