Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and data structure”

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 1,117 records · Page 62

Machine Learning for Improving Surface-Layer-Flux Estimates

Abstract Flows in the atmospheric boundary layer are turbulent, characterized by a large Reynolds number, the existence of a roughness sublayer and the absence of a well-defined viscous layer. Exchanges with the surface are therefore dominated by turbulent fluxes. In numerical models for atmospheric flows, turbulent fluxes must be specified at the surface; however, surface fluxes are not known a priori and therefore must be parametrized. Atmospheric flow models, including global circulation, limited area models, and large-eddy simulation, employ Monin–Obukhov similarity theory (MOST) to parametrize surface fluxes. The MOST approach is a semi-empirical formulation that accounts for atmospheric stability effects through universal stability functions. The stability functions are determined based on limited observations using simple regression as a function of the non-dimensional stability parameter representing a ratio of distance from the surface and the Obukhov length scale (Obukhov in Trudy Inst Theor Geofiz AN SSSR 1:95–115, 1946), $$z/L$$ z / L . However, simple regression cannot capture the relationship between governing parameters and surface-layer structure under the wide range of conditions to which MOST is commonly applied. We therefore develop, train, and test two machine-learning models, an artificial neural network (ANN) and random forest (RF), to estimate surface fluxes of momentum, sensible heat, and moisture based on surface and near-surface observations. To train and test these machine-learning algorithms, we use several years of observations from the Cabauw mast in the Netherlands and from the National Oceanic and Atmospheric Administration’s Field Research Division tower in Idaho. The RF and ANN models outperform MOST. Even when we train the RF and ANN on one set of data and apply them to the second set, they provide more accurate estimates of all of the fluxes compared to MOST. Estimates of sensible heat and moisture fluxes are significantly improved, and model interpretability techniques highlight the logical physical relationships we expect in surface-layer processes.

Meteorology & Atmospheric Sciences↗

Hydrogeophysical Approach for Identification of Layered Structures of the Vadose Zone from Electrical Resistivity Data

Electric resistivity surveys and borehole collection of resistivity data are one of the oldest geophysical tools for characterization of the vadose zone. The current trend is to conduct such surveys in a tomographic manner, which requires significant computational resources. We present a simple semi-analytical approach to delineate multiple layers in partially saturated soils from resistivity measurements taken in a borehole at several depths. The proposed inversion algorithm is computationally efficient and can serve either as a stand-alone tool for layers delineation or as an autonomous module in a more comprehensive geophysical survey. It is most robust when each layer is sampled at least once. When one or more layers have not been sampled, the algorithm’s robustness (convergence) is dependent on the accuracy of an initial guess (e.g., expert knowledge or other hard and/or soft data). We provide a detailed analysis of the algorithm’s convergence and identify potential pitfalls.

54 ENVIRONMENTAL SCIENCES↗

Preliminary results of teleseismic double-difference relocation of earthquakes around Indonesian archipelago region

Indonesian archipelago region is located in active tectonic setting and high seismicity zone. During the last decade, Indonesian was experienced with destructive major earthquakes causing damage and victims. The information of precise earthquake location parameters are very important in partular for earthquake early warning to the society and for advance seismic studies. In this study, we attempted to improve hypocenter location compiled by BMKG for time periods of April, 2009 up to June, 2014 for about 22,000 earthquake events around Indonesian region. For the firts time, we applied teleseismic double-difference relocation algorithm (teletomoDD) to improve hypocenter region in Indonesia region combining regional and teleseismic stations. Hypocenter relocation was performed utilizing local, regional, and teleseismic P-wave arrival time data. Our relocation result show that travel-time RMS errors were greatly reduced compared to the BMKG catalog. Seismicity at shallower depth (less than 50 km) shows significantly improvement especially in depth, and refined shallow geological structures, e.g. trench and major strike slip faults. Clustered seismicity is also detected beneath volcanic region, and probably related volcano activities and also major faults nearby. In the Sunda arc region, seismicity at shallower depth centered at two major distributions parallel to the trench strike direction, i.e. around fore-arc and in mainland that related to major fault, e.g. the Sumatran fault, and volcanic fronts. Below Central Java region, relocated hypocenter result showed double seismic zone pattern. A seismic gap is detected around the Sunda-Banda transition zone where transition between oceanic subduction to continental crust collision of Australian plate occurs. In Eastern Indonesia region, shallow earthquakes are observed related to major strike slip faults, e.g. Sorong and Palu-Koro fault, volcanism, and shallow part of subduction and collision zones. We also compare our result in the Sunda Arc region with slab1.0 model and our relocated seismicity shows good agreement with the previous slab geometry. Horizontal position shift of relocated events are mostly perpendicular to the trench directions.

58 GEOSCIENCES↗

Exploring small-angle emissions in charm quark jets in proton-proton collisions at $\sqrt{s}=5.02$ TeV

A measurement of the angular structure of inclusive jets and those containing a prompt D 0 meson in proton-proton collisions at the LHC at a center-of-mass energy of 5.02 TeV is presented. The data corresponding to an integrated luminosity of 301 pb −1 were collected by the CMS experiment in 2017. Two jet grooming algorithms, late-k T and soft drop, are used to study the intrajet radiation pattern using iterative Cambridge-Aachen declustering. The splitting-angle distributions of jets with transverse momentum (p T ) of around 100 GeV, obtained with these two algorithms, show that there is a shift of the distribution for jets containing a prompt D 0 meson with respect to inclusive jets. The suppression of emissions at small angles observed in the late-k T grooming approach is consistent with the dead-cone effect, whereas the similar suppression for splittings selected with the soft-drop algorithm appears to be induced by gluon splitting to charm quark-antiquark pairs at large angles. The measured distributions are corrected to the particle level and can be used to constrain model predictions for the substructure of high-p T charm quark jets.

Charm Physics↗

2DMatPedia, an open computational database of two-dimensional materials from top-down and bottom-up approaches

Two-dimensional (2D) materials have been a hot research topic in the last decade, due to novel fundamental physics in the reduced dimension and appealing applications. Systematic discovery of functional 2D materials has been the focus of many studies. Here, we present a large dataset of 2D materials, with more than 6,000 monolayer structures, obtained from both top-down and bottom-up discovery procedures. First, we screened all bulk materials in the database of Materials Project for layered structures by a topology-based algorithm and theoretically exfoliated them into monolayers. Then, we generated new 2D materials by chemical substitution of elements in known 2D materials by others from the same group in the periodic table. The structural, electronic and energetic properties of these 2D materials are consistently calculated, to provide a starting point for further material screening, data mining, data analysis and artificial intelligence applications. We present the details of computational methodology, data record and technical validation of our publicly available data (http://www.2dmatpedia.org/).

36 MATERIALS SCIENCE↗

Curiosity driven exploration to optimize structure–property learning in microscopy

Rapidly determining structure–property correlations in materials is an important challenge in better understanding fundamental mechanisms and greatly assists in materials design. In microscopy, imaging data provides a direct measurement of the local structure, while spectroscopic measurements provide relevant functional property information. Deep kernel active learning approaches have been utilized to rapidly map local structure to functional properties in microscopy experiments, but are computationally expensive for multi-dimensional and correlated output spaces. Here, we present an alternative lightweight curiosity algorithm which actively samples regions with unexplored structure–property relations, utilizing a deep-learning based surrogate model for error prediction. We show that the algorithm outperforms random sampling for predicting properties from structures, and provides a convenient tool for efficient mapping of structure–property relationships in materials science.

36 MATERIALS SCIENCE↗

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.

24 POWER TRANSMISSION AND DISTRIBUTION↗

pnnl/sven

This is a JavaScript library for a storyline layout algorithm. Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The library in this disclosure takes as input a list of objects containing an id, time, and state. The output is a data structure that can be used to conveniently render a storyline visualization. Most importantly, the library computes the y-coordinate of the entities over time that decreases layout artifacts including crossings, wiggles, and whitespace. This is accomplished through multi-objective, multi-stage optimization problem, where the output of one stage produces input and constraints for the next stage.

Arendt, Dustin↗

Cyber Graph Queries for Geographically Distributed Data Centers

We present new algorithms for a distributed model for graph computations motivated by limited information sharing we first discussed. Two or more independent entities have collected large social graphs. They wish to compute the result of running graph algorithms on the entire set of relationships. Because the information is sensitive or economically valuable, they do not wish to simply combine the information in a single location. We consider two models for computing the solution to graph algorithms in this setting: 1) limited-sharing: the two entities can share only a polylogarithmic size subgraph; 2) low-trust: the entities must not reveal any information beyond the query answer, assuming they are all honest but curious. We believe this model captures realistic constraints on cooperating autonomous data centers. We have algorithms in both setting for s - t connectivity in both models. We also give an algorithm in the low-communication model for finding a planted clique. This is an anomaly-detection problem, finding a subgraph that is larger and denser than expected. For both the low- communication algorithms, we exploit structural properties of social networks to prove performance bounds better than what is possible for general graphs. For s - t connectivity, we use known properties. For planted clique, we propose a new property: bounded number of triangles per node. This property is based upon evidence from the social science literature. We found that classic examples of social networks do not have the bounded-triangles property. This is because many social networks contain elements that are non-human, such as accounts for a business, or other automated accounts. We describe some initial attempts to distinguish human nodes from automated nodes in social networks based only on topological properties.

97 MATHEMATICS AND COMPUTING↗

A Decision Tree Based Machine Learning Algorithm for Rate Estimation

A subgraph isomorphic decision tree algorithm was developed for estimating chemical reaction rates. The algorithm essentially associates differences in rate estimation with differences in sub-structures on the reactant or reactants, and the tree splits reactions into groups with similar rates by identifying the substructural differences that affect rate estimation the most. The algorithm was trained on rates from the Reaction Mechanism Generator (RMG) database and compared with a much more traditional rate rule estimator based on the same data. Compared to the previous RMG rate rules, the prediction accuracy of the new algorithm, measured by median absolute error (MAE) factor, root mean squared error (RMSE) factor, and 2-sigma error factor, is consistently improved by a factor of two. Uncertainty estimation was also developed for the decision trees based on fitting a lognormal distribution to the leave-one-out errors at each node. Improvements in accuracy introduced by the algorithm should significantly reduce the amount of effort required to refine models and the need for additional quantum calculations and thus reduce the amount of time and cost required to create and refine biofuel models.

Johnson, Matthew S.↗

Insights into cosmological structure formation with machine learning.

Our modern understanding of cosmological structure formation posits that small matter density fluctuations present in the early Universe, as traced by the cosmic microwave background, grow via gravitational instability to form extended haloes of dark matter. A theoretical understanding of the structure, evolution and formation of dark matter haloes is an essential step towards unravelling the intricate connection between halo and galaxy formation, needed to test our cosmological model against data from upcoming galaxy surveys. Physical understanding of the process of dark matter halo formation is made difficult by the highly non-linear nature of the haloes' evolution. I describe a new approach to gain physical insight into cosmological structure formation based on machine learning. This approach combines the ability of machine learning algorithms to learn non-linear relationships, with techniques that enable us to physically interpret the learnt mapping. I describe applicatio ns of th e method, with the aim of investigating which aspects of the early universe density field impact the later formation of dark matter haloes. First I present a case where the process of halo formation is turned into a binary classification problem; the algorithm predicts whether or not dark matter `particles' in the initial conditions of a simulation will collapse into haloes of a given mass range. Second, I present its generalization to regression, where the algorithm infers the final mass of the halo to which each particle will later belong. I show that the initial tidal shear does not play a significant role compared to the initial density field in establishing final halo masses. Finally, I demonstrate that extending the framework to deep learning algorithms such as convolutional neural networks allows us to explore connections between the early universe and late time haloes beyond those studied by existing analytic approximations of halo collapse.

79 ASTRONOMY AND ASTROPHYSICS↗

Synthetic Data and Graph Generation for Modeling Adversarial Activity (Final Project Report)

The Data and Graph Generation for Modeling Adversary Activity (MAA) project developed a methodology along with scalable graph modeling and generation tools to produce realistic large-scale background activity graphs with embedded adversarial activity pathways. The technical report presents PNNL methodology, released datasets, lessons learned, and recommendations to develop graph analytic algorithms for structure-only and attributed knowledge graphs.

97 MATHEMATICS AND COMPUTING↗

Pure JavaScript Storyline Layout Algorithm

This is a JavaScript library for a storyline layout algorithm. Storylines are adept at communicating complex change by encoding time on the x-axis and using the proximity of lines in the y direction to represent interaction between entities. The library in this disclosure takes as input a list of objects containing an id, time, and state. The output is a data structure that can be used to conveniently render a storyline visualization. Most importantly, the library computes the y-coordinate of the entities over time that decreases layout artifacts including crossings, wiggles, and whitespace. This is accomplished through multi-objective, multi-stage optimization problem, where the output of one stage produces input and constraints for the next stage.

Source record↗

Machine Learning for DUNE Supernova Trigger

One of the major scientific goals of the Deep Underground Neutrino Experiment (DUNE) is to detect and measure the neutrino flux originating from galactic core-collapse supernovae. These neutrinos provide an opportunity to study the end of life evolution of massive stars, and reveal information about the structure of core-collapse that is not visible in observations of the electromagnetic spectrum. Because of the rarity of these events, it is crucial that DUNE is able to detect supernova neutrino interactions when they occur. However, this will require sifting through a large quantity of data, motivating the development of a trigger algorithm to identify significant events and discard irrelevant data. Machine learning provides a potential approach to building this trigger. This project generates ADC and ground truth images of simulated neutrino interactions in a LArTPC detector to be used for machine learning, and uses them to train a sparse Convolutional Neural Network (C NN). The performance of this model when applied to the task of pixel classification based on interaction type is examined. This project found that the sparse CNN approach has the potential to have high accuracy in pixel classification, meaning it may be highly relevant to the development of a supernova neutrino trigger for the DUNE far detector.

Damish, S.↗

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗

Multiscale X-ray phase contrast imaging of human cartilage for investigating osteoarthritis formation

The evolution of cartilage degeneration is still not fully understood, partly due to its thinness, low radio-opacity and therefore lack of adequately resolving imaging techniques. X-ray phase-contrast imaging (X-PCI) offers increased sensitivity with respect to standard radiography and CT allowing an enhanced visibility of adjoining, low density structures with an almost histological image resolution. This study examined the feasibility of X-PCI for high-resolution (sub-) micrometer analysis of different stages in tissue degeneration of human cartilage samples and compare it to histology and transmission electron microscopy. Ten 10%-formalin preserved healthy and moderately degenerated osteochondral samples, post-mortem extracted from human knee joints, were examined using four different X-PCI tomographic set-ups using synchrotron radiation the European Synchrotron Radiation Facility (France) and the Swiss Light Source (Switzerland). Volumetric datasets were acquired with voxel sizes between 0.7 × 0.7 × 0.7 and 0.1 × 0.1 × 0.1 µm 3 . Data were reconstructed by a filtered back-projection algorithm, post-processed by ImageJ, the WEKA machine learning pixel classification tool and VGStudio max. For correlation, osteochondral samples were processed for histology and transmission electron microscopy. X-PCI provides a three-dimensional visualization of healthy and moderately degenerated cartilage samples down to a (sub-)cellular level with good correlation to histologic and transmission electron microscopy images. X-PCI is able to resolve the three layers and the architectural organization of cartilage including changes in chondrocyte cell morphology, chondrocyte subgroup distribution and (re-)organization as well as its subtle matrix structures. X-PCI captures comprehensive cartilage tissue transformation in its environment and might serve as a tissue-preserving, staining-free and volumetric virtual histology tool for examining and chronicling cartilage behavior in basic research/laboratory experiments of cartilage disease evolution.

3D analysis↗

Validation and quantification of uncertainty in coupled climate models using network analysis

We developed a fast, robust and scalable methodology to examine, quantify, and visualize climate patterns and their relationships. It is based on a set of notions, algorithms and metrics used in the study of graphs, referred to as complex network analysis. This approach can be applied to explain known climate phenomena in terms of an underlying network structure and to uncover regional and global linkages in the climate system, while comparing general circulation models outputs with observations. The proposed method is based on a two-layer network representation, and is substantially new within the available network methodologies developed for climate studies. At the first layer, gridded climate data are used to identify ‘‘areas’’, i.e., geographical regions that are highly homogeneous in terms of the given climate variable. At the second layer, the identified areas are interconnected with links of varying strength, forming a global climate network. The robustness of the method (i.e. the ability to separate between topological distinct fields, while identifying correctly similarities) has been extensively tested. It has been proved that it provides a reliable, fast framework for comparing and ranking the ability of climate models of reproducing observed climate patterns and their connectivity. We further developed the methodology to account for lags in the connectivity between climate patterns and refined our area identification algorithm to account for autocorrelation in the data. The new methodology based on complex network analysis has been applied to state-of-the-art climate model simulations that participated to the last IPCC (International Panel for Climate Change) assessment to verify their performances, quantify uncertainties, and uncover changes in global linkages between past and future projections. Network properties of modeled sea surface temperature and rainfall over 1956–2005 have been constrained towards observations or reanalysis data sets, and their differences quantified using two metrics. Projected changes from 2051 to 2300 under the scenario with the highest representative and extended concentration pathways (RCP8.5 and ECP8.5) have then been determined. The network of models capable of reproducing well major climate modes in the recent past, changes little during this century. In contrast, among those models the uncertainties in the projections after 2100 remain substantial, and primarily associated with divergences in the representation of the modes of variability, particularly of the El Niño Southern Oscillation (ENSO), and their connectivity, and therefore with their intrinsic predictability, more so than with differences in the mean state evolution. Additionally, we evaluated the relation between the size and the ‘strength’ of the area identified by the network analysis as corresponding to ENSO noting that only a small subset of models can reproduce realistically the observations.

54 ENVIRONMENTAL SCIENCES↗

Neural embedding: learning the embedding of the manifold of physics data

In this paper, we present a method of embedding physics data manifolds with metric structure into lower dimensional spaces with simpler metrics, such as Euclidean and Hyperbolic spaces. We then demonstrate that it can be a powerful step in the data analysis pipeline for many applications. Using progressively more realistic simulated collisions at the Large Hadron Collider, we show that this embedding approach learns the underlying latent structure. With the notion of volume in Euclidean spaces, we provide for the first time a viable solution to quantifying the true search capability of model agnostic search algorithms in collider physics (i.e. anomaly detection). Finally, we discuss how the ideas presented in this paper can be employed to solve many practical challenges that require the extraction of physically meaningful representations from information in complex high dimensional datasets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗