Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network embeddings”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Characterization of mechanical discontinuities based on data-driven classification of compressional-wave travel times

Wave propagation and diffusive transport phenomena are influenced by the mechanical discontinuities in material. Here this study shows that certain bulk properties of the network of low-velocity mechanical discontinuities (e.g. air-filled cracks) in a material can be characterized by processing compressional-wave travel times using traditional data-driven classification techniques. To that end, we perform three tasks in chronological order: (1) use the discrete fracture network (DFN) method to create two-dimensional (2D) numerical models of crack-bearing material embedded with various types of low-velocity mechanical discontinuities, (2) use the fast marching method (FMM) to simulate the propagation of the wave/diffusion front from a single source through the 2D crack-bearing material to multiple receivers placed on the boundary of the material, and (3) train 9 data-driven classifiers to characterize the crack-bearing materials (i.e. bulk properties of the network of mechanical discontinuities in the crack-bearing material) by learning from the simulations of travel times detected by multiple receivers placed around the crack-bearing material. The classifiers identified the orientation, spatial distribution, and dispersion of the low-velocity mechanical discontinuities. Voting classifier performs the best among the 9 classifiers. For the characterization of bulk dispersion and distribution of discontinuities, the sensors located on the adjacent boundaries are more important; whereas for the characterization of bulk orientation of discontinuities, the sensors located on the opposite side are more important.

42 ENGINEERING↗
DOE OSTI2020

Detection of Synchrophasor False Data Injection Attack using Feature Interactive Network

The synchrophasor data recorded by Phasor Measurement Units (PMUs) plays an increasingly critical role in the regulation and situational awareness of power systems. However, the widely installed PMUs are vulnerable to multiple malicious attacks from cyber hackers during data transmission and storage. To address this problem, a Modified Ensemble Empirical Mode Decomposition (MEEMD) is proposed first to extract the intrinsic mode functions of each Synchrophasor Data Attacks (SDA). The frequency-based adaptive screening criterion embedded in MEEMD is used to eliminate the false intrinsic mode functions. Next, a Multivariate Convolutional Neural Network (MCNN) is proposed to identify multiple SDA by utilizing the extracted intrinsic mode functions and original SDA as input vectors. A fusion block as the main structure of MCNN is also leveraged to increase the diversity of features and compress the model parameters. Integrating MEEMD and MCNN, a framework with automatic feature extraction and multi-source information fusion capability, referred to as Feature Interactive Network (FIN), is proposed to detect multiple SDA. Based on the proposed FIN framework, six types of SDA are explored for the first time using actual synchrophasor data in FNET/Grideye that was collected from different locations in the U.S. Eastern Interconnection. Finally, a large quantity of experiments with different attack strengths are used to evaluate the adaptability and classification performance of the proposed FIN.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Atomic arrangements in an amorphous CoFeB ribbon extracted via an analysis of radial distribution functions

Here we discuss the atomic structure of amorphous ferromagnetic FeCoB alloys, which are used widely in spintronics applications. Specifically, we obtain the pair-distribution functions for various atomic pairs based on high-energy x-ray diffraction data taken from an amorphous Co 20 Fe 61 B 19 specimen. We start our reverse Monte Carlo cycles to determine the disordered structure with a two-phase model in which a small amount of cobalt is mixed with Fe 23 B 6 as a second phase. The structure of the alloy is found to be heterogeneous, where the boron atoms drive disorder through the random occupation of the atomic network. Our analysis also indicates the presence of small cobalt clusters that are embedded in the iron matrix and percolating the latter throughout the structure. This morphology can explain the enhanced spin polarization observed in amorphous magnetic materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Unstructured clinical notes within the 24 hours since admission predict short, mid & long-term mortality in adult ICU patients

Mortality prediction for intensive care unit (ICU) patients is crucial for improving outcomes and efficient utilization of resources. Accessibility of electronic health records (EHR) has enabled data-driven predictive modeling using machine learning. However, very few studies rely solely on unstructured clinical notes from the EHR for mortality prediction. In this work, we propose a framework to predict short, mid, and long-term mortality in adult ICU patients using unstructured clinical notes from the MIMIC III database, natural language processing (NLP), and machine learning (ML) models. Depending on the statistical description of the patients’ length of stay, we define the short-term as 48-hour and 4-day period, the mid-term as 7-day and 10-day period, and the long-term as 15-day and 30-day period after admission. We found that by only using clinical notes within the 24 hours of admission, our framework can achieve a high area under the receiver operating characteristics (AU-ROC) score for short, mid and long-term mortality prediction tasks. The test AU-ROC scores are 0.87, 0.83, 0.83, 0.82, 0.82, and 0.82 for 48-hour, 4-day, 7-day, 10-day, 15-day, and 30-day period mortality prediction, respectively. We also provide a comparative study among three types of feature extraction techniques from NLP: frequency-based technique, fixed embedding-based technique, and dynamic embedding-based technique. Lastly, we provide an interpretation of the NLP-based predictive models using feature-importance scores.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Data and Code for Understanding Generative AI Content with Embedding Models

This repository contains code for the experiments in the paper "Understanding Generative AI Content with Embedding Models". Constructing high-quality features is critical to any quantitative data analysis. While feature engineering was historically addressed by carefully hand-crafting data representations based on domain expertise, deep neural networks (DNNs) now offer a radically different approach. DNNs implicitly engineer features by transforming their input data into hidden feature vectors called embeddings. For embedding vectors produced by foundation models -- which are trained to be useful across many contexts -- we demonstrate that simple and well-studied dimensionality-reduction techniques such as Principal Component Analysis uncover inherent heterogeneity in input data concordant with human-understandable explanations. Of the many applications for this framework, we find empirical evidence that there is intrinsic separability between real samples and those generated by artificial intelligence (AI).

Vargas, Max [Pacific Northwest National Laboratory↗
DOE OSTI2023

Improving nanoparticle superlattice stability with deformable polymer gels

The self-assembly of colloidal nanoparticles into ordered superlattices typically uses dynamic interactions to govern particle crystallization, as these non-permanent bonds prevent the formation of kinetically trapped, disordered aggregates. However, while the use of reversible bonding is critical in the formation of highly ordered particle arrangements, dynamic interactions also inherently make the structures more prone to disassembly or disruption when subjected to different environmental stimuli. Thus, there is typically a trade-off between the ability to initially form an ordered colloidal material and the ability of that material to retain its order under different conditions. Here, we present a method for embedding colloidal nanoparticle superlattices into a polymer gel matrix. This encapsulation strategy physically prevents the nanoparticles from dissociating upon heating, drying, or the introduction of chemicals that would normally disrupt the lattice. However, the use of a gel as the embedding medium still permits further modification of the colloidal nanoparticle lattice by introducing stimuli that deform the gel network (as this deformation in turn alters the nanoparticle lattice structure in a predictable manner). Moreover, encapsulation of the lattice within a gel permits further stabilization into fully solid materials by removing the solvent from the gel or by replacing the solvent with a liquid monomer that can be photopolymerized. This embedding method therefore makes it possible to incorporate ordered colloidal arrays into a polymer matrix as either dynamic or static structures, expanding their potential for use in responsive materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

CoolPINNs: A physics-informed neural network modeling of active cooling in vascular systems

Emerging technologies like hypersonic aircraft, space exploration vehicles, and batteries avail fluid circulation in embedded microvasculatures for efficient thermal regulation. Modeling is vital during the design and operational phases of these engineered systems. However, many challenges exist in developing a modeling framework. What is lacking is an accurate framework that (i) captures sharp jumps in the thermal flux across complex vasculature layouts, (ii) deals with oblique derivatives (involving tangential and normal components), (iii) handles nonlinearity because of radiative heat transfer, (iv) provides a high-speed forecast for real-time monitoring, and (v) facilitates robust inverse modeling. Here, this paper addresses these challenges by availing the power of physics-informed neural networks (PINNs). We develop a fast, reliable, and accurate Scientific Machine Learning (SciML) framework for vascular-based thermal regulation—called CoolPINNs: a PINNs-based modeling framework for active cooling. The proposed mesh-less framework elegantly overcomes all the mentioned challenges. The significance of the reported research is multi-fold. First, the framework is valuable for real-time monitoring of thermal regulatory systems because of rapid forecasting. Second, researchers can address complex thermoregulation designs since the approach is meshless. Finally, the framework facilitates systematic parameter identification and inverse modeling studies, perhaps the most significant utility of the current framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Physics constrained learning for data-driven inverse modeling from sparse observations

Deep neural networks (DNN) have been used to model nonlinear relations between physical quantities. Those DNNs are embedded in physical systems described by partial differential equations (PDE) and trained by minimizing a loss function that measures the discrepancy between predictions and observations in some chosen norm. This loss function often includes the PDE constraints as a penalty term when only sparse observations are available. As a result, the PDE is only satisfied approximately by the solution. However, the penalty term typically slows down the convergence of the optimizer for stiff problems. We present a new approach that trains the embedded DNNs while numerically satisfying the PDE constraints. We develop an algorithm that enables differentiating both explicit and implicit numerical solvers in reverse-mode automatic differentiation. This allows the gradients of the DNNs and the PDE solvers to be computed in a unified framework. We demonstrate that our approach enjoys faster convergence and better stability in relatively stiff problems compared to the penalty method. Furthermore, our approach allows for the potential to solve and accelerate a wide range of data-driven inverse modeling, where the physical constraints are described by PDEs and need to be satisfied accurately.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Deep anomaly detection for industrial systems: a case study

We explore the use of deep neural networks for anomaly detection of industrial systems where the data are multivariate time series measurements. We formulate the problem as a self-supervised learning where data under normal operation are used to train a deep neural network autoregressive model, i.e., use a window of time series data to predict future data values. The aim of such a model is to learn to represent the system dynamic behavior under normal conditions, while expect higher model vs. measurement discrepancies under faulty conditions. In real world applications, many control settings are discrete in nature. In this paper, vector embedding and joint losses are employed to deal with such situations. Both LSTM and CNN based deep neural network backbones are studied on the Secure Water Treatment (SWaT) testbed datasets. Also, Support Vector Data Description (SVDD) method is adapted to such anomaly detection settings with deep neural networks. Evaluation methods and results are discussed based on the SWaT dataset along with potential pitfalls.

anomaly detection, deep neural network↗
DOE OSTI2021

The influence of preexisting host rock damage on fault network localization

The transition from stable to unstable fracture propagation occurs when fractures begin to interact and link. Thus, fracture network coalescence controls how rocks and engineered structures fail. Here, to constrain the factors that influence localization in shear zones under brittle conditions, we build discrete element method models with a rough fault embedded in a shear zone. We add varying numbers of diffuse, randomly-placed weaknesses to examine the influence of diffuse damage on fracture network localization. The number of weaknesses controls the localization behavior of the fault network and the final fault geometry. We quantify localization using the Gini coefficient of the fracture volume, which measures the nonuniformity in a population. Each model generally increases in localization toward failure. However, models with more diffuse damage experience delocalization phases that are superimposed on the overall trend of increasing localization. The observed link between delocalization and host rock damage may help explain the varying localization of low magnitude seismicity in southern California. Models with more diffuse damage produce more complex fault geometries comprised of several parallel strands of wing cracks. The propagation of these wing cracks reduces the shear stress acting on the model boundaries, indicating that this fracture development increases the mechanical efficiency of the system.

58 GEOSCIENCES↗
DOE OSTI2022

Conjugated polyelectrolyte-based ternary exciton funnels via liposome scaffolds

There is great interest in developing inexpensive, molecular light-harvesting systems capable of efficiently converting photon energy to chemical potential energy. It is highly desirable to do so using self-assembly and in a manner that supports environmentally benign processing. A critical consideration in any such assembly is the ability to absorb a substantial fraction of the solar emission spectrum and to be able to efficiently move excited states through the space to a functional interface. We have previously shown that aqueous inter-conjugated polyelectrolyte (CPE) complexes can act as ultrafast and efficient energy-transfer antennae. Here we demonstrate formation of a hierarchically assembled, aqueous system based on an inter-CPE exciton donor/acceptor network and a lipid vesicle scaffold. Using a model small-molecule organic semiconductor embedded in the vesicle membrane, we form a ternary exciton funnel that is oriented towards the membrane interior. We show that, although energy transfer is efficient, the assembly morphology depends sensitively on preparation conditions and relative ionic stoichiometry. We propose several approaches towards stabilizing such aqueous assemblies. Furthermore, this work highlights a path to formation of an aqueous, panchromatic light-harvesting system, whose functional complexity can be systematically increased with modularity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗
DOE OSTI2025

Time-resolved tracking of cellulose biosynthesis and assembly during cell wall regeneration in live Arabidopsis protoplasts

Cellulose, the most abundant polysaccharide on earth composing plant cell walls, is synthesized by coordinated action of multiple enzymes in cellulose synthase complexes embedded within the plasma membrane. Multiple chains of cellulose fibrils form intertwined extracellular matrix networks. It remains largely unknown how newly synthesized cellulose is assembled into an intricate fibril network on cell surfaces. Here, we have established an in vivo time-resolved imaging platform to continuously visualize cellulose biosynthesis and fibril network assembly onArabidopsis thalianaprotoplast surfaces as the primary cell wall regenerates. Our observations provide the basis for a model of cellulose fibril network development in protoplasts driven by an interplay of multiscale dynamics that includes rapid diffusion and coalescence of nascent cellulose fibrils, processive elongation of single fibrils, and cellulose fibrillar network rearrangement during maturation. This study provides fresh insights into the dynamic and mechanistic aspects of cell wall synthesis at the single-cell level.

Science & Technology - Other Topics↗
DOE OSTI2022

Star–Galaxy Image Separation with Computationally Efficient Gaussian Process Classification

Abstract We introduce a novel method for discerning optical telescope images of stars from those of galaxies using Gaussian processes (GPs). Although applications of GPs often struggle in high-dimensional data modalities such as optical image classification, we show that a low-dimensional embedding of images into a metric space defined by the principal components of the data suffices to produce high-quality predictions from real large-scale survey data. We develop a novel method of GP classification hyperparameter training that scales approximately linearly in the number of image observations, which allows for application of GP models to large-size Hyper Suprime-Cam Subaru Strategic Program data. In our experiments, we evaluate the performance of a principal component analysis embedded GP predictive model against other machine-learning algorithms, including a convolutional neural network and an image photometric morphology discriminator. Our analysis shows that our methods compare favorably with current methods in optical image classification while producing posterior distributions from the GP regression that can be used to quantify object classification uncertainty. We further describe how classification uncertainty can be used to efficiently parse large-scale survey imaging data to produce high-confidence object catalogs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Let’s Unleash the Network Judgment: A Self-Supervised Approach for Cloud Image Analysis

Accurate cloud type identification and coverage analysis are crucial in understanding the Earth’s radiative budget. Traditional computer vision methods rely on low-level visual features of clouds for estimating cloud coverage or sky conditions. Several handcrafted approaches have been proposed; however, scope for improvement still exists. Newer deep neural networks (DNNs) have demonstrated superior performance for cloud segmentation and categorization. These methods, however, need expert engineering intervention in the preprocessing steps—in the traditional methods—or human assistance in assigning cloud or clear sky labels to a pixel for training DNNs. Such human mediation imposes considerable time and labor costs. We present the application of a new self-supervised learning approach to autonomously extract relevant features from sky images captured by ground-based cameras, for the classification and segmentation of clouds. We evaluate a joint embedding architecture that uses self-knowledge distillation plus regularization. We use two datasets to demonstrate the network’s ability to classify and segment sky images—one with ~85,000 images collected from our ground-based camera and another with 400 labeled images from the WSISEG database. We find that this approach can discriminate full-sky images based on cloud coverage, diurnal variation, and cloud base height. Additionally, it semantically segments the cloud areas without labels. The approach shows competitive performance in all tested tasks, suggesting a new alternative for cloud characterization.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Converting tabular data into images for deep learning with convolutional neural networks

Abstract Convolutional neural networks (CNNs) have been successfully used in many applications where important information about data is embedded in the order of features, such as speech and imaging. However, most tabular data do not assume a spatial relationship between features, and thus are unsuitable for modeling using CNNs. To meet this challenge, we develop a novel algorithm, image generator for tabular data (IGTD), to transform tabular data into images by assigning features to pixel positions so that similar features are close to each other in the image. The algorithm searches for an optimized assignment by minimizing the difference between the ranking of distances between features and the ranking of distances between their assigned pixels in the image. We apply IGTD to transform gene expression profiles of cancer cell lines (CCLs) and molecular descriptors of drugs into their respective image representations. Compared with existing transformation methods, IGTD generates compact image representations with better preservation of feature neighborhood structure. Evaluated on benchmark drug screening datasets, CNNs trained on IGTD image representations of CCLs and drugs exhibit a better performance of predicting anti-cancer drug response than both CNNs trained on alternative image representations and prediction models trained on the original tabular data.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Development of message passing-based graph convolutional networks for classifying cancer pathology reports

Abstract Background Applying graph convolutional networks (GCN) to the classification of free-form natural language texts leveraged by graph-of-words features (TextGCN) was studied and confirmed to be an effective means of describing complex natural language texts. However, the text classification models based on the TextGCN possess weaknesses in terms of memory consumption and model dissemination and distribution. In this paper, we present a fast message passing network (FastMPN), implementing a GCN with message passing architecture that provides versatility and flexibility by allowing trainable node embedding and edge weights, helping the GCN model find the better solution. We applied the FastMPN model to the task of clinical information extraction from cancer pathology reports, extracting the following six properties: main site, subsite, laterality, histology, behavior, and grade. Results We evaluated the clinical task performance of the FastMPN models in terms of micro- and macro-averaged F1 scores. A comparison was performed with the multi-task convolutional neural network (MT-CNN) model. Results show that the FastMPN model is equivalent to or better than the MT-CNN. Conclusions Our implementation revealed that our FastMPN model, which is based on the PyTorch platform, can train a large corpus (667,290 training samples) with 202,373 unique words in less than 3 minutes per epoch using one NVIDIA V100 hardware accelerator. Our experiments demonstrated that using this implementation, the clinical task performance scores of information extraction related to tumors from cancer pathology reports were highly competitive.

59 BASIC BIOLOGICAL SCIENCES↗