Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical methods”

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

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↗

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↗

TDCOSMO VIII. A key test of systematics in the hierarchical method of time-delay cosmography

The largest source of systematic errors in the time-delay cosmography method likely arises from the lens model mass distribution, where an inaccurate choice of model could in principle bias the value of $H$ 0 . A Bayesian hierarchical framework has been proposed which combines lens systems with kinematic data, constraining the mass profile shape at a population level. The framework has been previously validated using a small sample of lensing galaxies drawn from hydro-simulations. The goal of this work is to expand the validation to a more general set of lenses consistent with observed systems, as well as confirm the capacity of the method to combine two lens populations: one which has time delay information and one which lacks time delays and has systematically different image radii. For this purpose, we generated samples of analytic lens mass distributions made of baryons+dark matter and fit the subsequent mock images with standard power-law models. Corresponding kinematics data were also emulated. The hierarchical framework applied to an ensemble of time-delay lenses allowed us to correct the $H$ 0 bias associated with model choice to find $H$ 0 within 1.5σ of the fiducial value. We then combined this set with a sample of corresponding lens systems which have no time delays and have a source at lower $z$, resulting in a systematically smaller image radius relative to their effective radius. The hierarchical framework has successfully accounted for this effect, recovering a value of $H$ 0 which is both more precise (σ ~ 2%) and more accurate (0.7% median offset) than the time-delay set alone. This result confirms that non-time-delay lenses can nonetheless contribute valuable constraining power to the determination of $H$ 0 via their kinematic constraints, assuming they come from the same global population as the time-delay set.

79 ASTRONOMY AND ASTROPHYSICS↗

Tunable Synthesis of Hierarchical Superparamagnetic Fe{sub 3}O{sub 4} Nanospheres by a Surfactant-Free Solvothermal Method

Hierarchical Fe{sub 3}O{sub 4} nanospheres with superparamagnetism have been fabricated via a solvothermal method without any surfactants. The effect of reaction parameters like the types of the reagent, the reaction time, and the reagent concentration on the morphology and structure of the resultant samples are investigated. In this method, ferric chloride (FeCl{sub 3} ⋅ 6H{sub 2}O) is used as the iron source, and EG acts as both solvent and reducing agent. The presence of NaHCO{sub 3} or Na{sub 2}CO{sub 3} provides alkine condition and gaseous bubbles in the control over the size of Fe{sub 3}O{sub 4} nanospheres. The formation mechanism for Fe{sub 3}O{sub 4} nanospheres is illustrated by an Ostwald ripening process. The Fe{sub 3}O{sub 4} nanospheres were characterized by X-ray diffraction (XRD), X-ray photoelectron spectroscopy (XPS), transmission electron microscopy (TEM), scanning electron microscopy (SEM), and superconducting quantum interference device magnetometer (SQUID-VSM). The Fe{sub 3}O{sub 4} nanospheres exhibited a wider size distribution at the amount of 0.397 mol/L NaHCO{sub 3}, showing a high saturation magnetization close to 84.46 emu/g. The Fe{sub 3}O{sub 4} nanospheres soluble in deionized water is also investigated.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Revision of DASHMM: Dynamic Adaptive System for Hierarchical Multipole Methods

We present version 1.2.0 of DASHMM, a general library implementing hierarchical multipole methods using the asynchronous multi-tasking HPX-5 runtime system. Compared with the previous release [10], this new version: (1) enables execution in both shared and distributed memory architectures; (2) extends DASHMM’s infrastructure to support advanced multipole methods [18]; and (3) provides built-in implementations of both the Yukawa [15] potential and Helmholtz [16] potential in the low frequency regime. These additions have not impacted the user interface, which remains simple and extensible.

DeBuhr, J.↗

Systems and methods for hierarchical multi-objective optimization

A method for optimizing objective functions can include selecting an objective function based at least on a hierarchy, applying parameters to the objective function to generate an output, responsive to the output not satisfying a tolerance condition, assigning a penalty to the set of parameters and evaluating a convergence condition using the set of parameters and the penalty, responsive to the output satisfying the tolerance condition, evaluating an additional objective function using the parameters in an order corresponding to the hierarchy or evaluating the convergence condition responsive to the selected objective function being a final objective function, modifying the set of parameters using a genetic algorithm responsive to the set of parameters not satisfying the convergence condition, and outputting the set of parameters responsive to the set of parameters satisfying the convergence condition.

Chan, Henry↗

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation

This paper combines model-based and data-driven methods to develop a hierarchical, decentralized, robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level consists of robust, model-based, decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data-driven DSE after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level and hence significantly speed up the computational time. The proposed hybrid framework does not depend on the centralized infrastructure of the control centers; thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator locations. Also, the network model is not necessary; thus, a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on the 2,000-bus synthetic Texas system, and shown to be capable of reconstructing the dynamic states of the generators with high accuracy, and of forecasting in the advent of missing data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation: Preprint

This paper combines model-based and data-driven methods to develop a hierarchical decentralized robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level is comprised of robust model-based decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data- driven DSE, after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level, and hence to speed up the computational time significantly. The proposed hybrid framework does not depend upon the centralized infrastructure of the control centers, thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator (PDC) locations. Also, the network model is not necessary, thus a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on a 2000-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Hierarchical Optimization Method for Electric Vertical Takeoff and Landing Aircraft Network Design

Electric vertical takeoff and landing aircraft (eVTOLs) are expected to serve urban air mobility in a station-to-station configuration, which makes the optimal network design of eVTOL stations a critical question to explore. Existing approaches often face limitations, such as the inability to interact station locations with demand or difficulty in finding the optimal solution for large study regions. Here, this paper first proposes a mathematical model to generate optimal eVTOL station locations while considering associated potential eVTOL demand, and then proposes a heuristic algorithm, Hierarchical Optimization MEthod (HOME), to efficiently solve the model. With a case study of Southern California, HOME was compared to 1) directly solving the original integer linear programming-based network design problem, and 2) employing the widely used genetic algorithm. Results suggest that HOME can find optimal solutions with limited computational resources. The proposed framework powered by HOME provides a computationally efficient way to support urban air mobility planning.

97 MATHEMATICS AND COMPUTING↗

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗

A geostatistics-informed hierarchical sensitivity analysis method for complex groundwater flow and transport modeling

Sensitivity analysis is an important tool for development and improvement of mathematical models, especially for complex systems with a high dimension of spatially correlated parameters. Variance-based global sensitivity analysis has gained popularity because it can quantify the relative contribution of uncertainty from different sources. However, its computational cost increases dramatically with the complexity of the considered model and the dimension of model parameters. As such, in this study, we developed a new sensitivity analysis method that integrates the concept of variance-based method with a hierarchical uncertainty quantification framework. Different uncertain inputs are grouped and organized into a multilayer framework based on their characteristics and dependency relationships to reduce the dimensionality of the sensitivity analysis. A set of new sensitivity indices are defined for the grouped inputs using the variance decomposition method. Using this methodology, we identified the most important uncertainty source for a dynamic groundwater flow and solute transport model at the Department of Energy (DOE) Hanford site. The results indicate that boundary conditions and permeability field contribute the most uncertainty to the simulated head field and tracer plume, respectively. The relative contribution from each source varied spatially and temporally. By using a geostatistical approach to reduce the number of realizations needed for the sensitivity analysis, the computational cost of implementing the developed method was reduced to a practically manageable level. The developed sensitivity analysis method is generally applicable to a wide range of hydrologic and environmental problems that deal with high-dimensional spatially distributed input variables.

58 GEOSCIENCES↗

Computing and Applying Atomic Regulons to Understand Gene Expression and Regulation

Understanding gene function and regulation is essential for the interpretation, prediction, and ultimate design of cell responses to changes in the environment. A multitude of technologies, abstractions, and interpretive frameworks have emerged to answer the challenges presented by genome function and regulatory network inference. Here, we propose a new approach for producing biologically meaningful clusters of coexpressed genes, called Atomic Regulons (ARs), based on expression data, gene context, and functional relationships. We demonstrate this new approach by computing ARs for Escherichia coli , which we compare with the coexpressed gene clusters predicted by two prevalent existing methods: hierarchical clustering and k-means clustering. We test the consistency of ARs predicted by all methods against expected interactions predicted by the Context Likelihood of Relatedness (CLR) mutual information based method, finding that the ARs produced by our approach show better agreement with CLR interactions. We then apply our method to compute ARs for four other genomes: Shewanella oneidensis , Pseudomonas aeruginosa , Thermus thermophilus , and Staphylococcus aureus . We compare the AR clusters from all genomes to study the similarity of coexpression among a phylogenetically diverse set of species, identifying subsystems that show remarkable similarity over wide phylogenetic distances. We also study the sensitivity of our method for computing ARs to the expression data used in the computation, showing that our new approach requires less data than competing approaches to converge to a near final configuration of ARs. We go on to use our sensitivity analysis to identify the specific experiments that lead most rapidly to the final set of ARs for E. coli . As a result, this analysis produces insights into improving the design of gene expression experiments.

59 BASIC BIOLOGICAL SCIENCES↗

Carbon composition with hierarchical porosity, and methods of preparation

A method for fabricating a porous carbon material possessing a hierarchical porosity, the method comprising subjecting a precursor composition to a curing step followed by a carbonization step, the precursor composition comprising: (i) a templating component comprised of a block copolymer, (ii) a phenolic component, (iii) a dione component in which carbonyl groups are adjacent, and (iv) an acidic component, wherein said carbonization step comprises heating the precursor composition at a carbonizing temperature for sufficient time to convert the precursor composition to a carbon material possessing a hierarchical porosity comprised of mesopores and macropores. Also described are the resulting hierarchical porous carbon material, a capacitive deionization device in which the porous carbon material is incorporated, as well as methods for desalinating water by use of said capacitive deionization device.

Mayes, Richard T.↗

Carbon composition with hierarchical porosity, and methods of preparation

A method for fabricating a porous carbon material possessing a hierarchical porosity, the method comprising subjecting a precursor composition to a curing step followed by a carbonization step, the precursor composition comprising: (i) a templating component comprised of a block copolymer, (ii) a phenolic component, (iii) a dione component in which carbonyl groups are adjacent, and (iv) an acidic component, wherein said carbonization step comprises heating the precursor composition at a carbonizing temperature for sufficient time to convert the precursor composition to a carbon material possessing a hierarchical porosity comprised of mesopores and macropores. Also described are the resulting hierarchical porous carbon material, a capacitive deionization device in which the porous carbon material is incorporated, as well as methods for desalinating water by use of said capacitive deionization device.

36 MATERIALS SCIENCE↗

Hierarchical Convolutional Attention Networks for Text Classification

Recent work in machine translation has demonstrated that self-attention mecha- nisms can be used in place of recurrent neural networks to increase training speed without sacrificing model accuracy. We propose combining this approach with the benefits of convolutional filters and a hi- erarchical structure to create a document classification model that is both highly ac- curate and fast to train – we name our method Hierarchical Convolutional Atten- tion Networks. We demonstrate the effec- tiveness of this architecture by surpassing the accuracy of the current state-of-the-art on several classification tasks while being twice as fast to train.

Gao, Shang↗