Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “automatic adaptivity”

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 181 records · Page 10

CAMERA: A method for cost-aware, adaptive, multifidelity, efficient reliability analysis

Estimating probability of failure in aerospace systems is a critical requirement for flight certification and qualification. Failure probability estimation involves resolving tails of probability distributions, and Monte Carlo sampling methods are intractable when expensive high-fidelity simulations have to be queried. Here, we propose a method to use models of multiple fidelities that trade accuracy for computational efficiency. Specifically, we propose the use of multifidelity Gaussian process models to efficiently fuse models at multiple fidelity, thereby offering a cheap surrogate model that emulates the original model at all fidelities. Furthermore, we propose a novel sequential acquisition function based experiment design framework that can automatically select samples from appropriate fidelity models to make predictions about quantities of interest at the highest fidelity. We use our proposed approach in an importance sampling setting and demonstrate our method on the failure level set and probability estimation on synthetic test functions and two real-world applications, namely, the reliability analysis of a gas turbine engine blade using a finite element method and a transonic aerodynamic wing test case using Reynolds-averaged Navier-Stokes equations. We show that our method predicts the failure boundary and probability more accurately and at a fraction of the computational cost compared with using just a single expensive high-fidelity model. Finally, we show that our sequential approach is guaranteed to asymptotically converge to the true failure boundary with high probability.

97 MATHEMATICS AND COMPUTING↗

Automated Operational Forecasting of Monsoon Low Pressure Systems

Monsoon low pressure systems (LPSs) are the dominant rain-bearing weather system of South Asia, often producing extreme precipitation and hydrological disasters in a region inhabited by nearly two billion people. Despite the importance of these storms, no operational system has automatically identified and tracked LPS in real time in numerical weather prediction model output; many commonly used vortex-tracking algorithms are ill suited for monsoon LPS because of the weak winds and cold cores of these systems. Here, we describe a new system that uses optimized algorithms to identify monsoon LPS in short- to medium-range forecasts from the U.S. Global Ensemble Forecast System (GEFS) and a version of the deterministic Global Forecast System (GFS) adapted and used operationally by the Indian Institute of Tropical Meteorology (IITM). We also assess the historical performance of these models in forecasting South Asian monsoon LPS, comparing this with the performance of the Integrated Forecasting System of the ECMWF. We assess the accuracy of model predictions of LPS genesis, position, intensity, and precipitation rates for forecast lead times of 1–5 days, yielding quantitative information on model biases to guide operational forecasters and disaster managers. The system we introduce here could be extended to other low-latitude regions affected by dynamically weak, heavily precipitating atmospheric vortices that are often not included in tropical cyclone inventories.

54 ENVIRONMENTAL SCIENCES↗

Predictive Modeling and Diagnostic Monitoring of Extreme Science Workflows (Final Report)

This proposal addresses a critical issue of performance prediction identified in the report from the ASCR \Computational Modeling of Big Networks (COMBINE)" workshop: "end-to-end performance is not predictable due to a variety of factors. Even when some performance forecasts or predictions can be made, they often cannot explain the reasons why some predictions fail." We will develop new analytical models to predict the end-to-end performance of scientific workflows on DOE computing infrastructures, and use simulations and experimentation to validate and refine these models, as well as to pinpoint the sources of model inaccuracy. We will also use these models to help diagnose application and infrastructure problems, and to adapt the system based on this diagnosis. This section provides background in the areas relevant to the proposed work. RPI’s specific tasks within the Panorama project are as follows: (1) Develop Aspen-Simulation interface for Workflow Model Driven Simulation. (2) Validate manual performance models of two target workflow scenarios with empirical measurement and simulation. (3) Extend ROSS-Aspen API to simulate workflow descriptions when required. (4) Validate Aspen performance models of two target workflow scenarios with automatic performance model empirical measurement and simulation. (5) Design and implement final system to automatically generate Aspen performance models from workflow descriptions (including methods to compensate for limitations of Aspen analytical models). (6) Validate improved Aspen performance models with target workflow on production infrastructure. To date, all the project milestones assigned to us where reached within the best of our abilities over the course of the project performance period. Below describes the key outcome from our collaborative research in a system named, Durango .

97 MATHEMATICS AND COMPUTING↗

Manifold Learning-Based Polynomial Chaos Expansions for High-Dimensional Surrogate Models

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pretrained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.

42 ENGINEERING↗

Optimizing inference of segmentation on high-resolution images in MLExchange

MLExchange is a machine learning (ML) operations platform providing web user-interfaces (UIs) for data visualization and analysis pipelines at synchrotron facilities. Among these UIs is the segmentation app which helps synchrotron users utilize ML algorithms to automatically segment high-resolution scientific images with minimal manual annotation effort. In this work, we share code optimizations that significantly speed up the segmentation inference workflow of large data in short time. By optimizing the sequence of CPU-GPU data transfers and introducing CPU parallelization to key operations, we improve the per-device, per-image frame computational efficiency and observe close to 3×$$\times$$ speedup over the original segmentation inference workflow run time when utilizing a single GPU. Further adaptations enabling multi-GPU inference yield more than 40×$$\times$$ speedup with 100 GPUs compared to the optimized single GPU inference workflow. This acceleration of the segmentation inference workflow will provide MLExchange users with easy access to segmentation results with little wait time.

Lu, Shizhao↗

MARBLES (Multi-scale Adaptively Refined Boltzmann LatticE Solver) [SWR-23-37]

MARBLES (Multi-scale Adaptively Refined Boltzmann LatticE Solver) is an open-source computational fluid dynamics package powered by the lattice Boltzmann equations and built on AMReX. In the lattice Boltzmann method, local collisions between meso-scale fictitious particles drive the governing equations which enables MARBLES to easily simulate flow around complex and/or moving geometry without the generation of a body-conforming mesh. Using AMReX data structures and operations ensures a high level of computational performance and parallel scaling on heterogenous architectures while also naturally supporting locally enhanced grid resolution and fidelity through automatic mesh refinement. New domains and problem definitions are easily specified through an input file with examples and guidance on all options and variables provided in the MARBLES documentation.

Henry de Frahan, Marc↗

Using Robotic Manipulators for Radioactive Waste Inspection - 20090

The global nuclear industry has a growing volume of nuclear waste which needs to be scanned, sorted according to its activity and material type, then processed into the correct waste packages for long term storage and disposal. It is vital that there is a detailed understanding of the waste inventory stored in long term waste containers, as knowledge of their contents could predict or prevent any adverse effects in storage. The numerous 'scan and sort' tables which are currently used at many different facilities around the world to sort waste into their correct containers are human operated and require very slow gamma scanning procedures combined with educated guesswork to manually sort the waste. This often leads to excessive conservatisms, with placement of lower activity wastes in higher activity containers, which in turn costs significantly more to store. In the United Kingdom it costs UK Pounds 46 k per cubic meter to store intermediate level waste compared to just UK Pound 2.9 k per cubic meter to store low level waste according to a 2008 Department of Energy and Climate Change report in the UK. A proposed solution to this problem, is the use of a robotic manipulator to automatically inspect the 'scan and sort table' in order to produce an accurate 3D model of the table's waste contents and attach an overlaid radiation map. The radiation map contains spectrometry data and can in consequence be used to distinguish and locate specific radioisotopes. The 3D model should be as accurate as possible in order to allow for a second robot arm with an attached gripper to grasp the objects and place them into their designated long-term storage container. Various scanning procedures are explored in this study including basic raster scanning, adaptive raster scanning and point sampling. The optimal solution will in practice be defined by the required application and activity level of the wastes being inspected. The results presented in this study indicate that it is possible to produce a centimeter accurate 3D model of a mixed assortment of components on a nuclear waste 'scan and sort' table. In addition, it was shown that the waste objects emitting radiation could be accurately identified and located, with an overlaid radiation map. This study is applicable across the nuclear waste management sector. Many of the ideas and concepts developed in this study are applicable in other decommissioning settings for example, dismantling of legacy gloveboxes or routine inspection of nuclear waste packages in storage. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

GEDet: Detecting Erroneous Nodes with A Few Examples

Detecting nodes with erroneous values in real-world graphs re- mains challenging due to the lack of examples and various error scenarios. We demonstrate GEDet, an error detection engine that can detect erroneous nodes in graphs with a few examples. The GEDet framework tackles error detection as a few-shot node classification problem. We invite the attendees to experience the following unique features. (1) Few-shot detection. Users only need to provide a few examples of erroneous nodes to perform error detection with GEDet. GEDet achieves desirable accuracy with (a) a graph augmentation module, which automatically generates synthetic examples to learn the classifier, and (b) an adversarial detection module, which improves classifiers to better distinguish erroneous nodes from both cleaned nodes and synthetic examples. We show that GEDet significantly improves the state-of-the-art error detection methods. (2) Diverse error scenarios. GEDet profiles data errors with a built-in library of transformation functions from correct values to errors. Users can also easily “plug in” new error types or examples. (3) User-centric detection. GEDet supports (a) an active learning mode to engage users to verify detected results, and adapts the error detection process accordingly; and (b) visual interfaces to interpret and track detected errors.

Guan, Sheng↗

A database of thermally activated delayed fluorescent molecules auto-generated from scientific literature with ChemDataExtractor

A database of thermally activated delayed fluorescent (TADF) molecules was automatically generated from the scientific literature. It consists of 25,482 data records with an overall precision of 82%. Among these, 5,349 records have chemical names in the form of SMILES strings which are represented with 91% accuracy; these are grouped in a subsidiary database. Each data record contains one of the following four properties: maximum emission wavelength (λ EM ), photoluminescence quantum yield (PLQY), singlet-triplet energy splitting (ΔE ST ), and delayed lifetime (τ D ). The databases were created through text mining using ChemDataExtractor, a chemistry-aware natural-language-processing toolkit, which has been adapted for TADF research. The text-mined corpus consisted of 2,733 papers from the Royal Society of Chemistry and Elsevier. To the best of our knowledge, these databases are the first databases that have been auto-generated for TADF molecules from existing publications. The databases have been publicly released for experimental and computational applications in the TADF research field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Iterative Bragg peak removal on X-ray absorption spectra with automatic intensity correction

This study introduces a novel iterative Bragg peak removal with automatic intensity correction (IBR-AIC) methodology for X-ray absorption spectroscopy (XAS), specifically addressing the challenge of Bragg peak interference in the analysis of crystalline materials. The approach integrates experimental adjustments and sophisticated post-processing, including an iterative algorithm for robust calculation of the scaling factor of the absorption coefficients and efficient elimination of the Bragg peaks, a common obstacle in accurately interpreting XAS data, particularly in crystalline samples. The method was thoroughly evaluated on dilute catalysts and thin films, with fluorescence mode and large-angle rotation. The results underscore the technique's effectiveness, adaptability and substantial potential in improving the precision of XAS data analysis. While demonstrating significant promise, the method does have limitations related to signal-to-noise ratio sensitivity and the necessity for meticulous angle selection during experimentation. Overall, IBR-AIC represents a significant advancement in XAS, offering a pragmatic solution to Bragg peak contamination challenges, thereby expanding the applications of XAS in understanding complex materials under diverse experimental conditions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automatic Traffic Queue-End Identification using Location-Based Waze User Reports

Traffic queues, especially queues caused by non-recurrent events such as incidents, are unexpected to high-speed drivers approaching the end of queue (EOQ) and become safety concerns. Though the topic has been extensively studied, the identification of EOQ has been limited by the spatial-temporal resolution of traditional data sources. This study explores the potential of location-based crowdsourced data, specifically Waze user reports. It presents a dynamic clustering algorithm that can group the location-based reports in real time and identify the spatial-temporal extent of congestion as well as the EOQ. The algorithm is a spatial-temporal extension of the density-based spatial clustering of applications with noise (DBSCAN) algorithm for real-time streaming data with an adaptive threshold selection procedure. Here, the proposed method was tested with 34 traffic congestion cases in the Knoxville, Tennessee area of the United States. It is demonstrated that the algorithm can effectively detect spatial-temporal extent of congestion based on Waze report clusters and identify EOQ in real-time. The Waze report-based detection are compared to the detection based on roadside sensor data. The results are promising: The EOQ identification time of Waze is similar to the EOQ detection time of traffic sensor data, with only 1.1 min difference on average. In addition, Waze generates 1.9 EOQ detection points every mile, compared to 1.8 detection points generated by traffic sensor data, suggesting the two data sources are comparable in respect of reporting frequency. The results indicate that Waze is a valuable complementary source for EOQ detection where no traffic sensors are installed.

99 GENERAL AND MISCELLANEOUS↗

A graph embedding‐based approach for automatic cyber‐physical power system risk assessment to prevent and mitigate threats at scale

Abstract Power systems are facing an increasing number of cyber incidents, potentially leading to damaging consequences to both physical and cyber aspects. However, the development of analytical methods for the study of large‐scale power infrastructures as cyber‐physical systems is still in its early stages. Drawing inspiration from machine‐learning techniques, the authors introduce a method inspired by the principles of graph embedding that is tailored for quantitative risk assessment and the exploration of possible mitigation strategies of large‐scale cyber‐physical power systems. The primary advantage of the graph embedding approach lies in its ability to generate numerous random walks on a graph, simulating potential access paths. Meanwhile, it enables capturing high‐dimensional structures in low‐dimensional spaces, facilitating advanced machine‐learning applications, and ensuring scalability and adaptability for comprehensive network analysis. By employing this graph embedding‐based approach, the authors present a structured and methodical framework for risk assessment in cyber‐physical systems. The proposed graph embedding‐based risk analysis framework aims to provide a more insightful perspective on cyber‐physical risk assessment and situation awareness for power systems. To validate and demonstrate its applicability, the method has been tested on two cyber‐physical power system models: the Western System Coordinating Council (WSCC) 9‐Bus System and the Illinois 200‐Bus System , thereby showing its advantages in enhancing the accuracy of risk analysis and comprehensiveness of situational awareness.

Sun, Shining↗

Indicator-directed Dynamic Power Management for Iterative Workloads on GPU-Accelerated Systems

Modern high-performance and warehouse computing centers show strong interest in minimizing system power consumption while satisfying customers’ quality of service (QoS). Dynamic voltage and frequency scaling (DVFS) is effective for achieving this goal. Nevertheless, automating the process online and making it transparent to users must address three major challenges: (1) Complexity — today’s hardware components (e.g., CPUs, GPUs, memory, network, etc.) can be configured in several or dozens of frequency/voltage states for satisfying divergent system demands. Given their combination and the emergence of heterogeneity, searching the optimal configuration in the design space online can be timing consuming. (2) QoS guarantee — user-defined objectives such as power constraint and performance target must be monitored, predicted and ensured at the best effort. (3) Adaptability — various known and unknown workloads run on systems. Workloads characteristics should be quickly determined and configurations dynamically adjusted in accord with workloads and QoS. In this work, we focus on applications exhibiting an interesting feature – iterative or periodic, which is common among conventional HPC and emerging machine learning workloads. We propose an online dynamic power-performance (ODPP) management framework to dynamically adjust GPU DVFS configurations to meet performance and power objectives and constraints, without any code annotation or intrusion. Particularly, ODPP extracts the performance and power indicators for applications from their resources utilization profiles in a short episode. It further automatically constructs an accurate model that infers from the indicators how the application's performance and power vary with GPU core and memory frequencies. Aided with the model, for both seen and unseen applications, ODPP can quickly determine the most appropriate DVFS configuration for their execution. We evaluate ODPP on an NVIDIA GPU using multiple exascale computing (ECP) and deep learning applications.

Zou, Pengfei↗

Adaptive Fault Current-Limiting Control of MMC for Protection of Multiterminal HVDC Systems

A crucial requirement of the protection system for multi-terminal high-voltage DC (MTDC) transmission is that it is capable of selectively isolating the faulty area from the healthy part of the network using DC circuit breakers (DCCBs), while ensuring continuous operation of converter stations in the healthy part of the network. But in the half-bridge modular multilevel converters (HB-MMCs) based MTDC system, since HB-MMCs do not have fault current absorption capability, when a DC fault occurs, the rising fault currents can quickly reach the blocking threshold within a few milliseconds and disrupt the operation of the MMCs in the healthy part. To facilitate fault-ride-through capability of MTDC system, large DC reactors are often considered in series with DCCBs to reduce the rate of rise of the fault current and prevent blocking the MMCs in the healthy part of the DC networks; however, large DC reactors prohibitively increase the cost of the system, introduce stability issues and can create post-fault oscillations. This paper presents an adaptive fault current-limiting control method for MMCs to avoid their blocking and enable the continuous operation of the healthy part of MTDC systems. The method contains two parts: The first part is based on circulating current feedforward control, which emulates virtual reactors in each arm of an MMC, and is immediately activated when the fault current starts to increase to reduce the rate of rise of the fault current. The second part temporarily bypasses all the submodules when the fault current exceeds a preset threshold, complementing the fault current-limiting effect of the first part. Neither part requires fault detection signals, and they are automatically activated during faults. Simulation case studies of a four-terminal bipolar MMC-based high-voltage DC system are presented to demonstrate the effectiveness of the proposed control methods.

active fault current limiting↗

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗

Adaptive Fault Current-Limiting Control of MMC for Protection of Multiterminal HVDC Systems: Preprint

For the development of multi-terminal high voltage DC (MTDC) transmission, it is critical to design the protection system that can selectively isolate the faulty area from the healthy part of the dc grid using DC circuit breakers (DCCBs) while ensuring continuous operation of converter stations in the healthy part. However, because of the lack of fault current blocking capability in half-bridge (HB) modular multilevel converters (MMCs), when a dc fault occurs, the rising fault currents can quickly reach the blocking threshold within a few milliseconds and disrupt the operation of MMCs in the healthy part. Large DC reactors are often considered in series with DCCBs to reduce the rate of rise of fault currents and prevent blocking of MMCs in the healthy part of the grid. However, large DC reactors can prohibitively increase the cost of the system, particularly when they are considered in an offshore environment, for instance in offshore wind projects. Large dc reactors can also introduce stability issues and create post-fault oscillations. This paper presents an adaptive fault current limiting control method for MMCs to avoid their blocking and enable continuous operation of MTDC systems. It contains two parts: The first part is based on circulating current feedforward control that emulates virtual reactors in each arm of an MMC, which is immediately activated when the fault current starts to increase, to reduce the rate of rise of the fault current; the second part is triggered when the fault current exceeds a preset threshold by temporarily bypassing the SMs, serving as a complement to the fault current limiting effect of the first part. Both parts do not require fault detection signal and they are activated automatically during faults. Simulation case studies of a four-terminal bipolar MMC-HVDC system are presented to demonstrate the effectiveness of the proposed control methods.

active fault current limiting↗

An adaptive approach to machine learning for compact particle accelerators

Abstract Machine learning (ML) tools are able to learn relationships between the inputs and outputs of large complex systems directly from data. However, for time-varying systems, the predictive capabilities of ML tools degrade if the systems are no longer accurately represented by the data with which the ML models were trained. For complex systems, re-training is only possible if the changes are slow relative to the rate at which large numbers of new input-output training data can be non-invasively recorded. In this work, we present an approach to deep learning for time-varying systems that does not require re-training, but uses instead an adaptive feedback in the architecture of deep convolutional neural networks (CNN). The feedback is based only on available system output measurements and is applied in the encoded low-dimensional dense layers of the encoder-decoder CNNs. First, we develop an inverse model of a complex accelerator system to map output beam measurements to input beam distributions, while both the accelerator components and the unknown input beam distribution vary rapidly with time. We then demonstrate our method on experimental measurements of the input and output beam distributions of the HiRES ultra-fast electron diffraction (UED) beam line at Lawrence Berkeley National Laboratory, and showcase its ability for automatic tracking of the time varying photocathode quantum efficiency map. Our method can be successfully used to aid both physics and ML-based surrogate online models to provide non-invasive beam diagnostics.

97 MATHEMATICS AND COMPUTING↗

LC-MEMENTO: A Memory Model for Accelerated Architectures

With the advent of heterogeneous architectures, in particular, with the ubiquity of multi-GPU systems, it is becoming increasingly important to manage device memory efficiently in order to reap the benefits of the additional core count. To date, such responsibility mainly falls on the programmer where device-to-host data communication (and vice versa), if not done properly, may incur costly memory transfer operations and synchronization. The problem may be compounded by additional requirement to maintain system-wide memory consistency that may involve expensive synchronization overhead. In this paper, we present Location Consistency Memory Model for Enhanced Transfer Operations (LC-MEMENTO). This framework considers incorporating runtime techniques for multi-GPU memory management to support relaxed synchronization semantics and memory transfer operations automatically. Specifically, we implement a relaxed form of a memory consistency model based on the Location Consistency (LC) in an Asynchronous Many-Task Runtime (ARTS) and demonstrate that, this memory model enables additional optimization opportunities for the three representative applications encompassing different computational patterns (scientific computation, graphs, data streaming, etc.).

Memory Models, Accelerators, Adaptive Optimization↗