Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ITERATIVE NETWORK”

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 613 records · Page 34

Artificial neural network for the determination of Hubble Space Telescope aberration from stellar images

An artificial-neural-network method, first developed for the measurement and control of atmospheric phase distortion, using stellar images, was used to estimate the optical aberration of the Hubble Space Telescope. A total of 26 estimates of distortion was obtained from 23 stellar images acquired at several secondary-mirror axial positions. The results were expressed as coefficients of eight orthogonal Zernike polynomials: focus through third-order spherical. For all modes other than spherical the measured aberration was small. The average spherical aberration of the estimates was -0.299 micron rms, which is in good agreement with predictions obtained when iterative phase-retrieval algorithms were used.

Barrett, Todd K.↗

GANISP: A GAN-Assisted Importance Splitting Probability Estimator: Preprint

To reduce the variance of rare event probability estimator, genealogical importance splitting marches towards a rare event by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is made difficult when applied to deterministic systems as the initial conditions of the offspring realizations need to be modified. Typically, a random perturbation is applied to the offspring to differentiate their trajectory from the parent realization. It is shown that a random perturbation strategy may be effective for some systems but may also fail for others, thereby preventing variance reduction in the probability estimate. To address this limitation, it is proposed to use a generative model such as a Generative Adversarial Network (GAN) to generate perturbations that are consistent with the attractor of the dynamical system. The GAN-assisted Importance SPlitting method (GANISP) improves the variance reduction for the system targeted. An implementation of the method is available in a companion repository (https://github.com/NREL/GANISP).

generative adversarial network↗

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗

The Arctic-Boreal vulnerability experiment model benchmarking system

Abstract NASA’s Arctic-Boreal Vulnerability Experiment (ABoVE) integrates field and airborne data into modeling and synthesis activities for understanding Arctic and Boreal ecosystem dynamics. The ABoVE Benchmarking System (ABS) is an operational software package to evaluate terrestrial biosphere models against key indicators of Arctic and Boreal ecosystem dynamics, i.e.: carbon biogeochemistry, vegetation, permafrost, hydrology, and disturbance. The ABS utilizes satellite remote sensing data, airborne data, and field data from ABoVE as well as collaborating research networks in the region, e.g.: the Permafrost Carbon Network, the International Soil Carbon Network, the Northern Circumpolar Soil Carbon Database, AmeriFlux sites, the Moderate Resolution Imaging Spectroradiometer, the Orbiting Carbon Observatory 2, and the Soil Moisture Active Passive mission. The ABS is designed to be interactive for researchers interested in having their models accurately represent observations of key Arctic indicators: a user submits model results to the system, the system evaluates the model results against a set of Arctic-Boreal benchmarks outlined in the ABoVE Concise Experiment Plan, and the user then receives a quantitative scoring of model strengths and deficiencies through a web interface. This interactivity allows model developers to iteratively improve their model for the Arctic-Boreal Region by evaluating results from successive model versions. We show here, for illustration, the improvement of the Lund–Potsdam–Jena-Wald Schnee und Landschaft (LPJwsl) version model through the ABoVE ABS as a new permafrost module is coupled to the existing model framework. The ABS will continue to incorporate new benchmarks that address indicators of Arctic-Boreal ecosystem dynamics as they become available.

Stofferahn, Eric (ORCID:0000000169604193)↗

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

Real-Time Distribution System State Estimation with Asynchronous Measurements

We report state estimation is a fundamental task in power systems. Although distribution systems are increasingly equipped with sensing devices and smart meters, measurements are typically reported at different rates and asynchronously; these aspects pose severe strains on workhorse state estimation algorithms, which are designed to process batches of data collected in a synchronous manner from all the measurement units. In this paper, we develop a novel state estimation algorithm to continuously update the estimate of the state based on measurements received in an asynchronous manner from measurement units. The synthesis of the algorithm hinges on a proximal-point type method, implemented in an online fashion, and capable of processing measurements received sequentially from sensors. A performance analysis is presented by providing bounds on the estimation error in terms of the mean and variance that hold at each iteration and asymptotically. The scheme is also compared with a more traditional Weighted Least Squares estimator that compensates for the lack of measurement data by using, as pseudo measurements, the measurement retrieved during a certain time window. Numerical simulations on the IEEE 37-bus feeder corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Arctic-Boreal vulnerability experiment model benchmarking system

NASA's Arctic-Boreal Vulnerability Experiment (ABoVE) integrates field and airborne data into modeling and synthesis activities for understanding Arctic and Boreal ecosystem dynamics. The ABoVE Benchmarking System (ABS) is an operational software package to evaluate terrestrial biosphere models against key indicators of Arctic and Boreal ecosystem dynamics, i.e.: carbon biogeochemistry, vegetation, permafrost, hydrology, and disturbance. The ABS utilizes satellite remote sensing data, airborne data, and field data from ABoVE as well as collaborating research networks in the region, e.g.: the Permafrost Carbon Network, the International Soil Carbon Network, the Northern Circumpolar Soil Carbon Database, AmeriFlux sites, the Moderate Resolution Imaging Spectroradiometer, the Orbiting Carbon Observatory 2, and the Soil Moisture Active Passive mission. The ABS is designed to be interactive for researchers interested in having their models accurately represent observations of key Arctic indicators: a user submits model results to the system, the system evaluates the model results against a set of Arctic-Boreal benchmarks outlined in the ABoVE Concise Experiment Plan, and the user then receives a quantitative scoring of model strengths and deficiencies through a web interface. This interactivity allows model developers to iteratively improve their model for the Arctic-Boreal Region by evaluating results from successive model versions. We show here, for illustration, the improvement of the Lund–Potsdam–Jena-Wald Schnee und Landschaft (LPJwsl) version model through the ABoVE ABS as a new permafrost module is coupled to the existing model framework. The ABS will continue to incorporate new benchmarks that address indicators of Arctic-Boreal ecosystem dynamics as they become available.

ABoVE↗

Systems and methods for optimal power flow on a radial network

Node controllers and power distribution networks in accordance with embodiments of the invention enable distributed power control. One embodiment includes a node controller including a distributed power control application; a plurality of node operating parameters describing the operating parameter of a node and a set of at least one node selected from the group consisting of an ancestor node and at least one child node; wherein send node operating parameters to nodes in the set of at least one node; receive operating parameters from the nodes in the set of at least one node; calculate a plurality of updated node operating parameters using an iterative process to determine the updated node operating parameters using the node operating parameters that describe the operating parameters of the node and the set of at least one node, where the iterative process involves evaluation of a closed form solution; and adjust node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Quantum Learning with co-Management in a Multi-tenant Quantum System

The rapid advancement of quantum computing has pushed classical designs into the quantum domain, breaking physical boundaries for computing-intensive and data-hungry applications with the hope that some systems may provide a quantum speedup. For example, variational quantum algorithms have been proposed for quantum neural networks to train deep learning models on qubits, achieving promising results. Existing quantum learning architectures and systems rely on single, monolithic quantum machines with abundant and stable resources, such as qubits. However, fabricating a large, monolithic quantum device is considerably more challenging than producing an array of smaller devices. In this paper, we investigate a distributed quantum system that combines multiple quantum machines into a unified system. We propose DQuLearn, which divides a quantum learning task into multiple subtasks. Each subtask can be executed distributively on individual quantum machines, with the results looping back to classical machines for subsequent training iterations. Additionally, our system supports multiple concurrent clients and dynamically manages their circuits according to the runtime status of quantum workers. Through extensive experiments, we demonstrate that DQuLearn achieves similar accuracies with significant runtime reduction, by up to 68.7% and an increase per-second circuit processing speed, by up to 3.99 times, in a 4-worker multi-tenant setting.

quantum computing↗

Systems biology approaches towards predictive microbial ecology

Through complex interspecies interactions, microbial processes drive nutrient cycling and biogeochemistry. However, we still struggle to predict specifically which organisms, communities and biotic and abiotic processes are determining ecosystem function and how environmental changes will alter their roles and stability. While the tools to create such a predictive microbial ecology capability exist, cross-disciplinary integration of high-resolution field measurements, detailed laboratory studies and computation is essential. In this perspective, we emphasize the importance of pursuing a multiscale, systems approach to iteratively link ecological processes measured in the field to testable hypotheses that drive high-throughput laboratory experimentation. Mechanistic understanding of microbial processes gained in controlled lab systems will lead to the development of theory that can be tested back in the field. Using N 2 O production as an example, we review the current status of field and laboratory research and layout a plausible path to the kind of integration that is needed to enable prediction of how N-cycling microbial communities will respond to environmental changes. We advocate for the development of realistic and predictive gene regulatory network models for environmental responses that extend from single-cell resolution to ecosystems, which is essential to understand how microbial communities involved in N 2 O production and consumption will respond to future environmental conditions.

59 BASIC BIOLOGICAL SCIENCES↗

Summary report of the 4th IAEA Technical Meeting on Fusion Data Processing, Validation and Analysis (FDPVA)

The objective of the Fourth Technical Meeting on Fusion Data Processing, Validation and Analysis was to provide a platform during which a set of topics relevant to fusion data processing, validation and analysis are discussed with the view of extrapolating needs to next step fusion devices such as ITER. The validation and analysis of experimental data obtained from diagnostics used to characterize fusion plasmas are crucial for a knowledge-based understanding of the physical processes governing the dynamics of these plasmas. This paper presents the recent progress and achievements in the domain of plasma diagnostics and synthetic diagnostics data analysis (including image processing, regression analysis, inverse problems, deep learning, machine learning, big data and physics-based models for control) reported at the meeting. The progress in these areas highlight trends observed in current major fusion confinement devices. A special focus is dedicated on data analysis requirements for ITER and DEMO with a particular attention paid to artificial intelligence for automatization and improving reliability of control processes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-ofthe-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Hesham ElAbd↗

Simplifications for hydronic system models in modelica

Building systems and their heating, ventilation and air conditioning flow networks, are becoming increasingly complex. Some building energy simulation tools simulate these flow networks using pressure drop equations. These flow network models typically generate coupled algebraic nonlinear systems of equations, which become increasingly more difficult to solve as their sizes increase. This leads to longer computation times and can cause the solver to fail. These problems also arise when using the equation-based modelling language Modelica and Annex 60-based libraries. This may limit the applicability of the library to relatively small problems unless problems are restructured. This paper discusses two algebraic loop types and presents an approach that decouples algebraic loops into smaller parts, or removes them completely. The approach is applied to a case study model where an algebraic loop of 86 iteration variables is decoupled into smaller parts with a maximum of five iteration variables.

42 ENGINEERING↗

Multilevel Algorithm for Atmospheric Data Assimilation

A multiscale algorithm for the problem of optimal statistical interpolation of observed data has been developed. This problem includes the calculation of the vector of the 'analyzed' (best estimated) atmosphere flow field w(sup a) by the formula: w(sup a) = w(sup f) + P(sup f) H(sup T) y, where the quantity y is defined by the equation (H P(sup f) H(sup T) + R)y = w(sup o) - H w(sup f), using the given model forecast first guess w(sup f) and the vector of observations w(sup o); H is an interpolation operator from the regular grid to the observation network, P(sup f) is the forecast error covariance matrix, and R is the observation error covariance matrix. At this initial stage the case of univariate analysis of single level radiosonde height data is considered. The matrix R is assumed to be diagonal, and the matrix P(sup f) is assumed to be given by the formula P(sub ij)(sup f) = sigma(sub i)(sup f) mu(sub ij) sigma(sub j)(sub f), where mu(sub ij) is a smooth, decreasing function of the distance between the i-th and the j-th points. In this paper we describe a multiscale iterative process based on a multiresolution, simultaneous displacement technique and a localized variational calculation of iteration parameters.

Brandt, Achi↗

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-of-the-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Deep-learning↗

Machine Learning for Real-time Fusion Plasma Behavior Prediction and Manipulation (Final Report)

The goal of this project is to implement real-time analysis of 2D Beam Emission Spectroscopy (BES) data to predict and control transient and high-bandwidth events at DIII-D. In essence, we wish to bring high-bandwidth fluctuation diagnostics into the realm of real-time measurements and control. The BES ML models will necessarily be deep neural networks (DNN) with a “data flow” architecture for compatibility with high-throughput, low-latency evaluation on a field-programmable gate array (FPGA) or other emerging processor technologies. The real-time output will be fed to the plasma control system (PCS) for real-time control tasks, specifically for ELM control and avoidance and for QH-mode access and sustainment. We anticipate that the real-time analysis of fluctuation diagnostics will create new enabling technologies to predict and control transient events such as confinement mode transitions, edge-localized modes, Alfven eigenmode events, and disruptions. The proposed research is aligned with ITER research needs and DIII-D programmatic goals. For instance, the prediction and avoidance of ELM events is critical for ITER machine safety. Also, H-mode access with RMP ELM suppression in ITER is an active research area due to high separatrix density, narrow SOL width, and elevated LH transition power threshold.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Algorithm for Aligning an Array of Receiving Radio Antennas

A digital-signal-processing algorithm (somewhat arbitrarily) called SUMPLE has been devised as a means of aligning the outputs of multiple receiving radio antennas in a large array for the purpose of receiving a weak signal transmitted by a single distant source. As used here, aligning signifies adjusting the delays and phases of the outputs from the various antennas so that their relatively weak replicas of the desired signal can be added coherently to increase the signal-to-noise ratio (SNR) for improved reception, as though one had a single larger antenna. The method was devised to enhance spacecraft-tracking and telemetry operations in NASA's Deep Space Network (DSN); the method could also be useful in such other applications as both satellite and terrestrial radio communications and radio astronomy. Heretofore, most commonly, alignment has been effected by a process that involves correlation of signals in pairs. This approach necessitates the use of a large amount of hardware most notably, the N(N - 1)/2 correlators needed to process signals from all possible pairs of N antennas. Moreover, because the incoming signals typically have low SNRs, the delay and phase adjustments are poorly determined from the pairwise correlations. SUMPLE also involves correlations, but the correlations are not performed in pairs. Instead, in a partly iterative process, each signal is appropriately weighted and then correlated with a composite signal equal to the sum of the other signals (see Figure 1). One benefit of this approach is that only N correlators are needed; in an array of N much greater than 1 antennas, this results in a significant reduction of the amount of hardware. Another benefit is that once the array achieves coherence, the correlation SNR is N - 1 times that of a pair of antennas.

Rogstad, David↗