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 361 records · Page 20

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

Iterative reconstruction techniques for industrial CT: application and performance

BWXT Y-12, Oak Ridge National Laboratory, and the University of Tennessee have been working toward improved high-resolution X-ray computed tomography for non-destructive testing of manufactured objects. The emphasis of this work has been on iterative reconstruction, calibration, and performance testing. Algebraic reconstruction algorithms for CT have been developed that are more robust in handling incomplete and noisy data and permit high-resolution volumetric imaging on metallic part assemblies. A key source of artifacts in reconstructed CT images for industrial components is poor image statistics due to areas of high attenuation. This loss of information in the captured projections not only affects reconstruction of those areas, but also the surrounding regions. To overcome numerical instabilities arising from the ill-posed nature of inverse problems, standard regularization techniques can be applied as can Bayesian reconstruction techniques using prior data such as CAD information to improve image quality. To accelerate the reconstruction of certain regions of interest and reduce memory requirements, subvolume reconstruction has been implemented and tested. A computational framework has been implemented that facilitates the use of sophisticated iterative algorithms for reconstruction of three-dimensional images from high-resolution X-ray cone-beam projection data. The code supports parallel computing at two levels: message passing is used to farm the computation out across a network of computers while threads allow all processors available on any one computer to be used.

99 GENERAL AND MISCELLANEOUS↗

Quantum cluster equilibrium model of N-methylformamide–water binary mixtures

The established quantum cluster equilibrium (QCE) approach is refined and applied to N-methylformamide (NMF) and its aqueous solution. The QCE method is split into two iterative cycles: one which converges to the liquid phase solution of the QCE equations and another which yields the gas phase. By comparing Gibbs energies, the thermodynamically stable phase at a given temperature and pressure is then chosen. The new methodology avoids metastable solutions and allows a different treatment of the mean-field interactions within the gas and liquid phases. These changes are of crucial importance for the treatment of binary mixtures. For the first time in a QCE study, the cis-trans-isomerism of a species (NMF) is explicitly considered. Cluster geometries and frequencies are calculated using density functional theory (DFT) and complementary coupled cluster single point energies are used to benchmark the DFT results. Independent of the selected quantum-chemical method, a large set of clusters is required for an accurate thermodynamic description of the binary mixture. The liquid phase of neat NMF is found to be dominated by the cyclic trans-NMF pentamer, which can be interpreted as a linear trimer that is stabilized by explicit solvation of two further NMF molecules. This cluster reflects the known hydrogen bond network preferences of neat NMF.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Scalable, Distribution Network-Aware, Customer Privacy-Preserving Framework for Operation of Virtual Power Plants

This poster presents a hierarchical control framework for a virtual power plant that leverages behind-the-meter resources for grid services while maintaining customer privacy during setpoint disaggregation. Unlike many existing approaches, the virtual power plant model uses a hierarchical control strategy and an iterative approach to determine the optimal set point dis-aggregation without direct load control while maintaining system-level power flow and voltage constraints. The proposed approach is numerically validated on a synthetic distribution feeder in San Francisco, demonstrating the ability of the framework to provide privacy-preserving virtual power plant services.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization of Water-Alternating-CO2 Injection Field Operations Using a Machine-Learning-Assisted Workflow

Summary This paper will present a robust workflow to address multiobjective optimization (MOO) of carbon dioxide (CO2)-enhanced oil recovery (EOR)-sequestration projects with a large number of operational control parameters. Farnsworth unit (FWU) field, a mature oil reservoir undergoing CO2 alternating water injection (CO2-WAG) EOR, will be used as a field case to validate the proposed optimization protocol. The expected outcome of this work would be a repository of Pareto-optimal solutions of multiple objective functions, including oil recovery, carbon storage volume, and project economics. FWU’s numerical model is used to demonstrate the proposed optimization workflow. Because using MOO requires computationally intensive procedures, machine-learning-based proxies are introduced to substitute for the high-fidelity model, thus reducing the total computation overhead. The vector machine regression combined with the Gaussian kernel (Gaussian-SVR) is used to construct proxies. An iterative self-adjusting process prepares the training knowledge base to develop robust proxies and minimizes computational time. The proxies’ hyperparameters will be optimally designed using Bayesian optimization to achieve better generalization performance. Trained proxies will be coupled with multiobjective particle swarm Optimization (MOPSO) protocol to construct the Pareto-front solution repository. The outcomes of this workflow will be a repository containing Pareto-optimal solutions of multiple objectives considered in the CO2-WAG project. The proposed optimization workflow will be compared with another established methodology using a multilayer neural network (MLNN) to validate its feasibility in handling MOO with a large number of parameters to control. Optimization parameters used include operational variables that might be used to control the CO2-WAG process, such as the duration of the water/gas injection period, producer bottomhole pressure (BHP) control, and water injection rate of each well included in the numerical model. It is proved that the workflow coupling Gaussian-SVR proxies and the iterative self-adjusting protocol is more computationally efficient. The MOO process is made more rapid by squeezing the size of the required training knowledge base while maintaining the high accuracy of the optimized results. The outcomes of the optimization study show promising results in successfully establishing the solution repository considering multiple objective functions. Results are also verified by validating the Pareto fronts with simulation results using obtained optimized control parameters. The outcome from this work could provide field operators an opportunity to design a CO2-WAG project using as many inputs as possible from the reservoir models. The proposed work introduces a novel concept that couples Gaussian-SVR proxies with a self-adjusting protocol to increase the computational efficiency of the proposed workflow and to guarantee the high accuracy of the obtained optimized results. More importantly, the workflow can optimize a large number of control parameters used in a complex CO2-WAG process, which greatly extends its utility in solving large-scale MOO problems in various projects with similar desired outcomes.

Energy & Fuels↗

Applications of Wireless Sensor Networks for Area Coverage in Microgrids

Area coverage is a critical issue which will have a major impact on the sensing quality over targeted regions in wireless sensor networks. This paper studies the area coverage problem (ACP) with non-penetrable obstacles in microgrids, where a sensor cannot be deployed or sensing signals cannot pass through. The target coverage region is discretized in a deployment map representation of non-penetrable obstacles. A probability detection model is utilized to represent sensors with a variable distance coverage. The ACP is formulated as a mixed integer nonlinear programming problem and an iterative process is developed to solve the problem. The microgrid at Illinois Institute of Technology (IL Tech) is used as a practical example. Both the normal and the N-1 contingency deployments of sensors are simulated for optimizing the ACP at the IL Tech microgrid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Walking the ‘design–build–test–learn’ cycle: flux analysis and genetic engineering reveal the pliability of plant central metabolism

Oilseeds are of great economic importance for food and animal feed and their contribution to renewable energy production. Soybean seeds (Glycine max (L.) Merr.) contain c. 40% protein, 20% oil, and 30% carbohydrate (Song et al., 2023). Due to the massive scale of soybean production worldwide, even small improvements in seed protein and oil content make economic sense (Song et al., 2023). Successful manipulation of seed composition largely depends on a thorough understanding of the processes and pathways involved in the biosynthesis of fatty acids and amino acids, which are the building blocks of lipids and proteins. Rational engineering of the synthesis of storage reserves, that is, the rerouting of metabolic flux in central metabolism, is difficult to accomplish due to the complexity of the central metabolic network, the intricate regulation of its enzymes at multiple levels, and the often-unpredictable effects of genetic manipulation (Sweetlove et al., 2017). Therefore, the advancement of our understanding of central metabolism and its control of carbon partitioning requires following an iterative ‘design–build–test–learn’ (DBTL) cycle (Lin & Eudes, 2020) where metabolic flux analysis and hypothesis testing by transgenic approaches are important components. Previous metabolic studies on soybeans using isotopic tracers and metabolic flux analysis have provided insight into how lipid and protein biosynthesis occurs simultaneously during seed development (Allen et al., 2009; Allen & Young, 2013; Kambhampati et al., 2021). In an article published in this issue of New Phytologist, Morley et al. (2023; 1834–1851) put the insights they have gained into the delivery of metabolic precursors and energy cofactors to oil synthesis to the test and arrive at a successful metabolic engineering design. They show that an increase in seed oil content in soybeans can be achieved by overexpression of malic enzyme (ME) during seed development. Malic enzyme refers to a class of decarboxylating malate dehydrogenase enzymes that oxidize malate with NAD + or NADP + as redox cofactor while generating pyruvate and CO 2 . Like higher plants in general, soybean has distinct NADH- or NADPH-producing ME isoforms localized to the cytosol, plastid, or mitochondria (Gerrard Wheeler et al., 2016). As Morley et al. show, an increase in seed oil can be achieved in particular when a NADP+-dependent enzyme isoform (EC 1.1.1.40) is overexpressed in the plastid. Given the complex compartmentalization of pyruvate, malate, and redox metabolism (Fig. 1), increased oil production appears to depend on additional pyruvate and reducing equivalents being produced in the same compartment where de novo fatty acid biosynthesis occurs: the plastid.

59 BASIC BIOLOGICAL SCIENCES↗

A high-performance parallel algorithm for nonnegative matrix factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A ≈ WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementations, our algorithm is also flexible: (1) it performs well for both dense and sparse matrices, and (2) it allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors W and H within the alternating iterations. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements.

Kannan, Ramakrishnan↗

HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\WW$ and $\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\WW$ and $\HH$ within the alternating iterations.

Kannan, Ramakrishnan↗

MSU Disentanglement Analysis Software

This software is used to disentangle the forced-versus-unforced components of tropospheric temperature change over the satellite era (after 1979) using maps of surface temperature change as a predictor. In general, the software assembles training datasets (from pre-computed surface temperature trend maps and domain averaged tropospheric warming rates), trains statistical/machine learning (ML) algorithms, applies the trained statistical/ML model to climate model data and observations, and then saves the results. A leave-one-out approach is used in which the statistical/ML models are iteratively trained on (N- 1) climate model and then applied to the remaining climate model (and observations). Each model includes a large ensemble (i.e., >10) of model simulations. The software relies on scikit-learn ridge regression, PLS regression, and neural network algorithms.

Po-Chedley, StephenD↗

AI-enabled high-resolution scanning coherent diffraction imaging

Ptychographic imaging is a powerful means of imaging beyond the resolution limits of typical x-ray optics. Capturing recovered images from raw ptychographic data, however, requires the solution of an inverse problem, namely, phase retrieval. Phase retrieval algorithms are computationally expensive, which precludes real-time imaging. In this work, we propose PtychoNN, an approach to solve the ptychography data inversion problem based on a deep convolutional neural network. We demonstrate how the proposed method can be used to predict real-space structure and phase at each scan point solely from the corresponding far-field diffraction data. Our results demonstrate the practical application of machine learning to recover high fidelity amplitude and phase contrast images of a real sample hundreds of times faster than current ptychography reconstruction packages. Furthermore, by overcoming the constraints of iterative model-based methods, we can significantly relax sampling constraints on data acquisition while still producing an excellent image of the sample. Besides drastically accelerating acquisition and analysis, this capability has profound implications for the imaging of dose sensitive, dynamic, and extremely voluminous samples.

47 OTHER INSTRUMENTATION↗

Plateau Phenomenon in Gradient Descent Training of RELU Networks: Explanation, Quantification, and Avoidance

The ability of neural networks to provide ‘best in class’ approximation across a wide range of applications is well-documented. Nevertheless, the powerful expressivity of neural networks comes to naught if one is unable to effectively train (choose) the parameters defining the network. In general, neural networks are trained by gradient descent type optimization methods,a stochastic variant thereof. In practice, such methods result in the loss function decreases rapidly at the beginning of training but then, after a relatively small number of steps, significantly slow down. The loss may even appear to stagnate over the period of a large number of epochs, only to then suddenly start to decrease fast again for no apparent reason. This so-called plateau phenomenon manifests itself in many learning tasks. The present work aims to identify and quantify the root causes of plateau phenomenon.analysis is carried out in the setting of univariate ReLU networks. No assumptions are made on the number of neurons relative to the number of training data, and our results hold for both the lazy and adaptive regimes. Here, the main findings are: plateaux correspond to periods during which activation patterns remain constant, where activation pattern refers to the number of data points that activate a given neuron; quantification of convergence of the gradient flow dynamics; and, characterization stationary points in terms solutions of local least squares regression lines over subsets of the training data. Based on these conclusions, we propose a new iterative training method, the Active Neuron Least Squares (ANLS), characterised by the explicit adjustment of the activation pattern at each step, which is designed to enable a quick exit from a plateau. Illustrative numerical examples are included throughout.

97 MATHEMATICS AND COMPUTING↗

Physics constrained unsupervised deep learning for rapid, high resolution scanning coherent diffraction reconstruction

By circumventing the resolution limitations of optics, coherent diffractive imaging (CDI) and ptychography are making their way into scientific fields ranging from X-ray imaging to astronomy. Yet, the need for time consuming iterative phase recovery hampers real-time imaging. While supervised deep learning strategies have increased reconstruction speed, they sacrifice image quality. Furthermore, these methods’ demand for extensive labeled training data is experimentally burdensome. Here, we propose an unsupervised physics-informed neural network reconstruction method, PtychoPINN, that retains the factor of 100-to-1000 speedup of deep learning-based reconstruction while improving reconstruction quality by combining the diffraction forward map with real-space constraints from overlapping measurements. In particular, PtychoPINN gains a factor of 4 in linear resolution and an 8 dB improvement in PSNR while also accruing improvements in generalizability and robustness. This blend of performance and computational efficiency offers exciting prospects for high-resolution real-time imaging in high-throughput environments such as X-ray free electron lasers (XFELs) and diffraction-limited light sources.

97 MATHEMATICS AND COMPUTING↗

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗

A Multithreaded Algorithm for Network Alignment Via Approximate Matching

Network alignment is an optimization problem to find the best one-to-one map between the vertices of a pair of graphs that overlaps in as many edges as possible. It is a relaxation of the graph isomorphism problem and is closely related to the subgraph isomorphism problem. The best current approaches are entirely heuristic, and are iterative in nature. They generate real-valued heuristic approximations that must be rounded to find integer solutions. This rounding requires solving a bipartite maximum weight matching problem at each step in order to avoid missing high quality solutions. We investigate substituting a parallel, half-approximation for maximum weight matching instead of an exact computation. Our experiments show that the resulting difference in solution quality is negligible. We demonstrate almost a 20-fold speedup using 40 threads on an 8 processor Intel Xeon E7-8870 system (from 10 minutes to 36 seconds).

network alignment, matching, multicore↗

CHEMISTRY IN DISKS. III. PHOTOCHEMISTRY AND X-RAY DRIVEN CHEMISTRY PROBED BY THE ETHYNYL RADICAL (CCH) IN DM Tau, LkCa 15, AND MWC 480

We studied several representative circumstellar disks surrounding the Herbig Ae star MWC 480 and the T Tauri stars LkCa 15 and DM Tau at (sub-)millimeter wavelengths in lines of CCH. Our aim is to characterize photochemistry in the heavily UV-irradiated MWC 480 disk and compare the results to the disks around cooler T Tauri stars. We detected and mapped CCH in these disks with the IRAM Plateau de Bure Interferometer in the C and D configurations in the (1-0) and (2-1) transitions. Using an iterative minimization technique, the CCH column densities and excitation conditions are constrained. Very low excitation temperatures are derived for the T Tauri stars. These values are compared with the results of advanced chemical modeling, which is based on a steady-state flared disk structure with a vertical temperature gradient, and a gas-grain chemical network with surface reactions. Both model and observations suggest that CCH is a sensitive tracer of the X-ray and UV irradiation. The predicted radial dependency and source-to-source variations of CCH column densities qualitatively agree with the observed values, but the predicted column densities are too low by a factor of several. The chemical model fails to reproduce high concentrations of CCH in very cold disk midplane as derived from the observed low excitation condition for both the (1-0) and (2-1) transitions.

79 ASTRONOMY AND ASTROPHYSICS↗

A persistent adjoint method with dynamic time-scaling and an application to mass action kinetics

In this article, we consider an optimization problem where the objective function is evaluated at the fixed-point of a contraction mapping parameterized by a control variable, and optimization takes place over this control variable. Since the derivative of the fixed-point with respect to the parameter can usually not be evaluated exactly, an adjoint dynamical system can be used to estimate gradients. Using this estimation procedure, the optimization algorithm alternates between derivative estimation and an approximate gradient descent step. We analyze a variant of this approach involving dynamic time-scaling, where after each parameter update the adjoint system is iterated until a convergence threshold is passed. Here, we prove that, under certain conditions, the algorithm can find approximate stationary points of the objective function. We demonstrate the approach in the settings of an inverse problem in chemical kinetics, and learning in attractor networks.

97 MATHEMATICS AND COMPUTING↗

A Performant, Scalable Processing Pipeline for High‐Quality and FAIR Environmental Sensor Data

High-resolution environmental monitoring is necessary to record, understand, and predict biogeochemical and ecological changes particularly in coastal systems but brings significant challenges in processing and making rapidly available the resulting data. The COMPASS-FME project established a network of coastal observational sites across the Chesapeake Bay and western Lake Erie regions extensively instrumented with soil, vegetation, and weather sensors logging data every 15 min. Our data processing framework, written in R and completely open source, prioritizes rapid model-experiment iteration and makes biogeochemical data rapidly available for quality assurance/quality control, analysis, and model ingestion. This pipeline is distinguished by a standardized and modular approach to data curation, extensive metadata and documentation, and its high performance. These attributes combine to make biogeochemical data rapidly accessible across COMPASS-FME and the broader community. Flexible, powerful, and reproducible approaches to handling high-volume environmental data are crucial for accelerating biogeosciences research.

Pennington, Stephanie C. [Pacific Northwest Nation↗