SEARCH · Engineering Papers
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.
eFESTA: Ensemble Feature Exploration with Surface Density Estimates
We propose surface density estimate (SDE) to model the spatial distribution of surface features-isosurfaces, ridge surfaces, and streamsurfaces-in 3D ensemble simulation data. The inputs of SDE computation are surface features represented as polygon meshes, and no field datasets are required (e.g., scalar fields or vector fields). The SDE is defined as the kernel density estimate of the infinite set of points on the input surfaces and is approximated by accumulating the surface densities of triangular patches. We also propose an algorithm to guide the selection of a proper kernel bandwidth for SDE computation. An ensemble Feature Exploration method based on Surface densiTy EstimAtes (eFESTA) is then proposed to extract and visualize the major trends of ensemble surface features. For an ensemble of surface features, each surface is first transformed into a density field based on its contribution to the SDE, and the resulting density fields are organized into a hierarchical representation based on the pairwise distances between them. The hierarchical representation is then used to guide visual exploration of the density fields as well as the underlying surface features. We demonstrate the application of our method using isosurface in ensemble scalar fields, Lagrangian coherent structures in uncertain unsteady flows, and streamsurfaces in ensemble fluid flows.
CEGANN: CRYSTAL EDGE GRAPH ATTENTION NEURAL NETWORK
SF-22-156 Machine learning (ML) models and applications in materials design and discovery typically involve the use of feature representations or descriptors followed by a learning algorithm that maps them to user desired properties of interest. Most popular mathematical formulation-based descriptors are not unique across atomic environments and suffer from transferability issues across different application domains and/or material classes. The CEGANN code provides a unified interface to facilitate material characterization across materials across multiple scales (from atomic to mesoscale) and diverse classes of materials ranging from metals oxides, non-metals, and even hierarchical materials such as zeolites and semi ordered materials such as mesophases. CEGANN implements a Graph Attention Network (GAT) type convolution architecture. The details of network architecture can be found in the paper https://doi.org/10.48550/arXiv.2207.10168. The software comes with pretrained examples and dataset for the classification of the following representative systems: (1) Structure-level representation such as space group (2) Structural dimensionality (e.g., bulk, 2D, clusters etc.) (3) Grain boundary identification (4) Nucleation and growth of a zeolite polymorph (5) Characterization of binary mesophases and their phase transitions (6) Growth of ice. The code is written in python programming language.
Generation of Continental Scale Percent Tree Cover Product Using Deep-learning and Multi-scale Remote Sensing Data
Spatially explicit percent tree cover (TC) estimation is critical for mapping forest aboveground biomass and its dynamics. While various TC products have been developed, there has not been a generalized framework that can be applied to diverse terrestrial ecosystems due to underlain extreme complexities. Deep learning algorithms can learn a spatial pattern and radiometric characteristics of tree canopy as a robust approximation of physical or empirical models, and thus have emerged as promising and efficient tools for large-scale TC mapping. In this study, we synergistically use very high-resolution aerial imageries (National Agriculture Imagery Program, NAIP) and medium resolution Landsat data to map continental-scale TC (CONUS and Mexico) through a hierarchical deep learning approach (Convolutional Neural Network), i.e., NAIP TC generated from a NAIP model is utilized to train a Landsat model. The produced TC product (hereafter, NEX-TC) is able to capture the spatial pattern of TC distribution and its changes driven by natural disturbance and human land management. We further explore and analyze the reliability and potential uncertainty of the NEX-TC by comparing it to lidar- (lidar-TC), National Land Cover Database (NLCD-TC), and MODIS Vegetation Continuous Field (MODIS-TC). This evaluation practice reveals that TC products based on passive optical sensors tend to underestimate TC across all land cover types while Landsat-based TCs (i.e., NEX-TC & NLCD-TC) perform better than the coarser MODIS TC estimate. Our results show that the NEX-TC is generally comparable to NLCD-TC but it particularly outperforms NLCD-TC and MODIS-TC over the dense forests where lidar-TC indicates >80% TC. These results indicate that our hierarchical deep learning approach and TC product will be effective and useful for characterizing large-scale tree cover and possibly associated carbon dynamics.
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.
ADEOS Total Ozone Mapping Spectrometer (TOMS) Data Products User's Guide
Two data products from the Total Ozone Mapping Spectrometer (ADEOS/TOMS) have been archived at the Distributed Active Archive Center, in the form of Hierarchical Data Format files. The ADEOS/ TOMS began taking measurements on September 11, 1996, and ended on June 29, 1997. The instrument measured backscattered Earth radiance and incoming solar irradiance; their ratio was used in ozone retrievals. Changes in the reflectivity of the solar diffuser used for the irradiance measurement were monitored using a carousel of three diffusers, each exposed to the degrading effects of solar irradiation at different rates. The algorithm to retrieve total column ozone compares measured Earth radiances at sets of three wavelengths with radiances calculated for different total ozone values, solar zenith angles, and optical paths. The initial error in the absolute scale for TOMS total ozone is 3 percent, the one standard deviation random error is 2 percent, and the drift is less than 0.5 percent over the 9-month data record. The Level 2 product contains the measured radiances, the derived total ozone amount, and reflectivity information for each scan position. The Level 3 product contains daily total ozone and reflectivity in a 1-degree latitude by 1.25 degrees longitude grid. The Level 3 files containing estimates of UVB at the Earth surface and tropospheric aerosol information will also be available. Detailed descriptions of both HDF data files and the CDROM product are provided.
GPU-Accelerated Solution of the Bethe–Salpeter Equation for Large and Heterogeneous Systems
We present a massively parallel GPU-accelerated implementation of the Bethe–Salpeter equation (BSE) for the calculation of the vertical excitation energies (VEEs) and optical absorption spectra of condensed and molecular systems, starting from single-particle eigenvalues and eigenvectors obtained with density functional theory. The algorithms adopted here circumvent the slowly converging sums over empty and occupied states and the inversion of large dielectric matrices through a density matrix perturbation theory approach and a low-rank decomposition of the screened Coulomb interaction, respectively. Further computational savings are achieved by exploiting the nearsightedness of the density matrix of semiconductors and insulators to reduce the number of screened Coulomb integrals. We scale our calculations to thousands of GPUs with a hierarchical loop and data distribution strategy. The efficacy of our method is demonstrated by computing the VEEs of several spin defects in wide-band-gap materials, showing that supercells with up to 1000 atoms are necessary to obtain converged results. We discuss the validity of the common approximation that solves the BSE with truncated sums over empty and occupied states. In conclusion, we then apply our GW-BSE implementation to a diamond lattice with 1727 atoms to study the symmetry breaking of triplet states caused by the interaction of a point defect with an extended line defect.
Redox-enabled electronic interrogation and feedback control of hierarchical and networked biological systems
Abstract Microelectronic devices can directly communicate with biology, as electronic information can be transmitted via redox reactions within biological systems. By engineering biology’s native redox networks, we enable electronic interrogation and control of biological systems at several hierarchical levels: proteins, cells, and cell consortia. First, electro-biofabrication facilitates on-device biological component assembly. Then, electrode-actuated redox data transmission and redox-linked synthetic biology allows programming of enzyme activity and closed-loop electrogenetic control of cellular function. Specifically, horseradish peroxidase is assembled onto interdigitated electrodes where electrode-generated hydrogen peroxide controls its activity. E. coli ’s stress response regulon, oxyRS , is rewired to enable algorithm-based feedback control of gene expression, including an eCRISPR module that switches cell-cell quorum sensing communication from one autoinducer to another—creating an electronically controlled ‘bilingual’ cell. Then, these disparate redox-guided devices are wirelessly connected, enabling real-time communication and user-based control. We suggest these methodologies will help us to better understand and develop sophisticated control for biology.
Finding predictive models for singlet fission by machine learning
Singlet fission (SF), the conversion of one singlet exciton into two triplet excitons, could significantly enhance solar cell efficiency. Molecular crystals that undergo SF are scarce. Computational exploration may accelerate the discovery of SF materials. However, many-body perturbation theory (MBPT) calculations of the excitonic properties of molecular crystals are impractical for large-scale materials screening. We use the sure-independence-screening-and-sparsifying-operator (SISSO) machine-learning algorithm to generate computationally efficient models that can predict the MBPT thermodynamic driving force for SF for a dataset of 101 polycyclic aromatic hydrocarbons (PAH101). SISSO generates models by iteratively combining physical primary features. The best models are selected by linear regression with cross-validation. The SISSO models successfully predict the SF driving force with errors below 0.2 eV. Based on the cost, accuracy, and classification performance of SISSO models, we propose a hierarchical materials screening workflow. Three potential SF candidates are found in the PAH101 set.
A linguistic geometry for 3D strategic planning
This paper is a new step in the development and application of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing Linguistic Geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in this paper on the new pilot example of the solution of the extremely complex 3D optimization problem of strategic planning for the space combat of autonomous vehicles. This example demonstrates deep and highly selective search in comparison with conventional search algorithms.
Mitigating Algorithmic Bias in Cancer Site Classification Models
Purpose Integrating artificial intelligence in cancer diagnostics has improved tumor classification beyond rule-based systems. Despite these advancements, these models may still encode demographic biases. We conducted a large-scale, applied bias-probing study of a deep learning–based cancer site classifier to quantify race information encoded in document embeddings. We then evaluated how performance changes when race-correlated embedding dimensions are removed in a post-training sensitivity analysis. Methods The cancer site classifier was trained using 3.5 million electronic cancer pathology reports from six of the National Cancer Institute's SEER registries. We trained a hierarchical self-attention network to generate 400-dimensional document embeddings. These embeddings were used to train two downstream, gradient-boosted decision tree classifiers: one to classify the cancer sites and another to predict racial categories. We identified overlapping features by intersecting the top 50 feature-importance rankings from the site and race models and computed their cumulative feature importance in each model. As a post hoc sensitivity analysis, we progressively pruned these overlapping dimensions, retrained the site model, and compared overall macro-F1 and accuracy, race-stratified macro-F1, and group fairness metrics on the basis of demographic parity and equalized odds before and after pruning. Results The analysis revealed minimal feature overlap between the cancer site and race prediction models, and the cumulative importance scores indicated a negligible influence of racial information on clinical predictions. Post-training pruning of overlapping features did not compromise the models' diagnostic accuracy, with a 0.07% loss in accuracy. Conclusion Our findings demonstrate that HiSAN-generated embeddings from SEER data can be used effectively in cancer site classification without significant demographic bias influencing the outcomes. Post-training pruning therefore functions as a practical audit and sensitivity check.
Resilient Control of Networked Microgrids Using Vertical Federated Reinforcement Learning: Designs and Real-Time Test-Bed Validations
Improving system-level resiliency of networked microgrids against adversarial cyber-attacks is an important aspect in the current regime of increased inverter-based resources (IBRs). To achieve that, this paper contributes in designing a hierarchical control layer, in conjunction with the existing control layers, resilient to adversarial attack signals. Considering model complexities, unknown dynamical behaviors of IBRs, and privacy issues regarding data sharing in multi-party-owned microgrids, designing such a control layer is non-trivial. Here, to tackle these issues, a novel federated reinforcement learning (Fed-RL) method is proposed. To grasp the interconnected dynamics of networked microgrids, the paper develops Federated Soft Actor-Critic (FedSAC) algorithm following the vertical structure of implementing Fed-RL. Next, utilizing the OpenAI Gym interface, we built a custom set-up in GridLAB-D/HELICS co-simulation platform, named Resilient RL Co-simulation (ResRLCoSIM), to train the RL agents with IEEE 123-bus benchmark comprising 3 interconnected microgrids. Finally, the learned policies in the simulation are transferred to the real-time hardware-in-the-loop (HIL) test-bed developed using the high-fidelity Hypersim platform. Finally, experiments show that the simulator-trained RL controllers achieve desirable performance with the test-bed platform, validating the minimization of the sim-to-real gap.
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.
Hierarchical Model-Free Transactive Control of Building Loads to Support Grid Services
Residential buildings consume 4.4 quads of electricity annually, approximately 37% of the total electricity consumption in the United States. This represents a vast resource that can be used for demand management and other ancillary services. This project aims to develop a robust, scalable hierarchical transactional control mechanism incorporating elements of model-free control (MFC) and game theory to harness buildings to provide ancillary services to the grid. This approach is being taken to address the challenges of incorporating traditional transactional control schemes into existing buildings. The challenges include small individual building sizes requiring aggregation of many buildings, unpredictable energy usage that makes model identification difficult, and satisfying the sensitive occupant comfort constraints. In the proposed approach, by separating the control mechanism into two layers above and below the load aggregator, MFC can be used below the aggregator to modulate flexible building loads in response to pricing signals with guaranteed performance. This allows the burden of identifying an accurate model of the system to be shifted to the above-aggregator layer, where fluctuations in individual building usage have less impact on predicted building system behavior. Game theory concepts can then be used to determine pricing curves and control signals among regional aggregators. Managing this control in a game-theoretic approach will allow us to build in financial incentives that increase customer engagement. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable on small, embedded devices. In a broader sense, developing a strategy capable of effectively incorporating residential and small commercial buildings will allow greater throughput of existing and emerging grid services in addition to future transactive energy grid management methods. Using MFC within a hierarchical control architecture will allow the shifting of existing forecasting challenges to an aggregate level, where dynamics are slower and more predictable. This will enable a smooth interface between the grid services requests of utilities and the reliable control required by participating buildings. MFC, which supports distributed control architecture, permits a scalable solution that can be deployed to neighborhood-size systems as well as individual buildings. This project focuses on three objectives: (1) developing the mathematical framework, algorithm toolkit, and software toolset of the two-layer transactive control testbed; (2) developing a scalable solution for application over many residential and small-size commercial buildings with sparse distributed communication; and (3) field testing and implementation on hardware of the control strategies developed in the previous two objectives. The research and development activities are focused and designed to be impactful within the relevant 2025 targets timeframe. An open-source control framework for exploiting variability and dispatchability of building loads will be delivered as the outcome of the project. This capability enables greater participation of loads in electricity markets and ancillary services that are both useful for the utility and financially beneficial for building owners.
Integrate FARM with PID controllers: IES Simulation Ecosystem Control System Development
The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM was designed to support the HERON software module in the solution of the optimal dispatch problem for IES units. As the result of HERON-FARM dispatch simulation, the set-point trajectories are optimized to meet constraints on both the production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and the process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.) at a coarse time resolution (every 10 or 100 seconds) over long time horizons (several days or weeks). In case the operational constraints need to be met at finer time resolution, the computational burden of HERON-FARM would linearly increase with the sampling rate, and sub-optimal solutions might be obtained. System responses characterized by overshoots and damped oscillations temporarily violating the imposed constraints might occur during abrupt power transients. In this report, a hierarchical control system architecture for the operation of the Dynamic Energy Technology and Integration Laboratory (DETAIL) facility constructed at INL was proposed. First, the preliminary studies on the proposed control strategy for operating the facility and the designed PI controllers were reviewed. In particular, the current approach for generating the set-point trajectories was studied, and its limits were identified. To this aim, the inclusion of a Supervisory Control layer embedding a modified version of the FARM algorithm for preserving the system safe operation over both long and real-time horizons was proposed. In this way, FARM would be applied twice, i.e., the original version (“FARM Validator”) aiding the solution of the power dispatch problem, and the modified version (“FARM Supervisory” coordinating the PI controllers to address the real-time control tasks. Despite the kernel of the two modules is the same algorithm, their roles, tasks, and capabilities are quite different. A detailed description of the role of FARM at addressing low-level control tasks is provided, along with tentative operational procedures for training the models embedded into the algorithm by using the collected experimental data.
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Rendering is done in software, eliminating the need for special graphics hardware, as well as any artifacts associated with graphics hardware. Images of volumes with about one million cells can be produced in one to several minutes on a workstation with a 150 MHz processor. A significant advantage of this method for applications such as computational fluid dynamics is that it can process multiple intersecting grids. Such grids present problems for most current volume rendering techniques. Also, the wide range of cell sizes (by a factor of 10,000 or more), which is typical of such applications, does not present difficulties, as it does for many techniques. A spatial hierarchical organization makes it possible to access data from a restricted region efficiently. The tree has greater depth in regions of greater detail, determined by the number of cells in the region. It also makes it possible to render useful 'preview' images very quickly (about one second for one-million-cell grids) by displaying each region associated with a tree node as one cell. Previews show enough detail to navigate effectively in very large data sets. The algorithmic techniques include use of a kappa-d tree, with prefix-order partitioning of triangles, to reduce the number of primitives that must be processed for one rendering, coarse-grain parallelism for a shared-memory MIMD architecture, a new perspective transformation that achieves greater numerical accuracy, and a scanline algorithm with depth sorting and a new clipping technique.
Compression of echocardiographic scan line data using wavelet packet transform
An efficient compression strategy is indispensable for digital echocardiography. Previous work has suggested improved results utilizing wavelet transforms in the compression of 2D echocardiographic images. Set partitioning in hierarchical trees (SPIHT) was modified to compress echocardiographic scanline data based on the wavelet packet transform. A compression ratio of at least 94:1 resulted in preserved image quality.
Discrete crack growth analysis methodology for through cracks in pressurized fuselage structures
A methodology for simulating the growth of long through cracks in the skin of pressurized aircraft fuselage structures is described. Crack trajectories are allowed to be arbitrary and are computed as part of the simulation. The interaction between the mechanical loads acting on the superstructure and the local structural response near the crack tips is accounted for by employing a hierarchical modeling strategy. The structural response for each cracked configuration is obtained using a geometrically nonlinear shell finite element analysis procedure. Four stress intensity factors, two for membrane behavior and two for bending using Kirchhoff plate theory, are computed using an extension of the modified crack closure integral method. Crack trajectories are determined by applying the maximum tangential stress criterion. Crack growth results in localized mesh deletion, and the deletion regions are remeshed automatically using a newly developed all-quadrilateral meshing algorithm. The effectiveness of the methodology and its applicability to performing practical analyses of realistic structures is demonstrated by simulating curvilinear crack growth in a fuselage panel that is representative of a typical narrow-body aircraft. The predicted crack trajectory and fatigue life compare well with measurements of these same quantities from a full-scale pressurized panel test.