Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distribution adaptation”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

A comprehensive study of non-adaptive and residual-based adaptive sampling for physics-informed neural networks

Physics-informed neural networks (PINNs) have shown to be effective tools for solving both forward and inverse problems of partial differential equations (PDEs). PINNs embed the PDEs into the loss of the neural network using automatic differentiation, and this PDE loss is evaluated at a set of scattered spatio-temporal points (called residual points). The location and distribution of these residual points are highly important to the performance of PINNs. However, in the existing studies on PINNs, only a few simple residual point sampling methods have mainly been used. Here, we present a comprehensive study of two categories of sampling for PINNs: non-adaptive uniform sampling and adaptive nonuniform sampling. We consider six uniform sampling methods, including (1) equispaced uniform grid, (2) uniformly random sampling, (3) Latin hypercube sampling, (4) Halton sequence, (5) Hammersley sequence, and (6) Sobol sequence. We also consider a resampling strategy for uniform sampling. To improve the sampling efficiency and the accuracy of PINNs, we propose two new residual-based adaptive sampling methods: residual-based adaptive distribution (RAD) and residual-based adaptive refinement with distribution (RAR-D), which dynamically improve the distribution of residual points based on the PDE residuals during training. Hence, we have considered a total of 10 different sampling methods, including six non-adaptive uniform sampling, uniform sampling with resampling, two proposed adaptive sampling, and an existing adaptive sampling. We extensively tested the performance of these sampling methods for four forward problems and two inverse problems in many setups. Our numerical results presented in this study are summarized from more than 6000 simulations of PINNs. Here, we show that the proposed adaptive sampling methods of RAD and RAR-D significantly improve the accuracy of PINNs with fewer residual points for both forward and inverse problems. Furthermore, the results obtained in this study can also be used as a practical guideline in choosing sampling methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Interconnection of Distributed Energy Resources in the Indian Context: IEEE 1547-2018 Adaptation for Locally-Appropriate Grid Code Development

The rapid growth of distributed energy resources (DERs) in India and ambitious renewable energy goals set forth by the Indian government have created the need for appropriate distribution interconnection standards to ensure continued system stability, reliability, and resilience. Existing DER interconnection codes in India, at the time of publishing this report, lack many of the critical grid support functionalities for DERs which may protect bulk system stability, such as event ride-through provisions, frequency droop control, or appropriate trip thresholds given the increasing importance of distributed generation. The formal adoption of IEEE 1547-2018 by the Bureau of Indian Standards (BIS) marks a significant step towards achieving appropriate interconnection of DERs, though the implementation of such a standard must be accompanied with careful consideration of the current codes, regulations, and operation of the Indian power system. Studies on the performance of the functionalities within 1547-2018, which properly incorporate local operating conditions, can inform decisions related to the adoption and adaptation of the clauses present in the standard. This report outlines several of these key considerations for stakeholders and provides analyses illustrating the performance of grid support functionalities on typical Indian distribution feeders.

1547↗
NASA NTRS1999

Large-Scale Distributed Computational Fluid Dynamics on the Information Power Grid Using Globus

This paper describes an experiment in which a large-scale scientific application development for tightly-coupled parallel machines is adapted to the distributed execution environment of the Information Power Grid (IPG). A brief overview of the IPG and a description of the computational fluid dynamics (CFD) algorithm are given. The Globus metacomputing toolkit is used as the enabling device for the geographically-distributed computation. Modifications related to latency hiding and Load balancing were required for an efficient implementation of the CFD application in the IPG environment. Performance results on a pair of SGI Origin 2000 machines indicate that real scientific applications can be effectively implemented on the IPG; however, a significant amount of continued effort is required to make such an environment useful and accessible to scientists and engineers.

Barnard, Stephen↗
DOE OSTI2025

A two-and-a-half dimensional symplectic space-charge solver

The nonlinear space-charge effect plays a significant role in high-intensity accelerators and has been extensively studied using multi-particle tracking methods. In this paper, we present a novel 2.5- dimensional symplectic space-charge solver specifically designed for long beam bunches. We begin by detailing its application to a transverse Gaussian density distribution under open boundary conditions in a straight system, where a semi-analytical expression is derived. We then demonstrate the solver’s adaptation to arbitrary distributions in open space, as well as within rectangular and round conducting pipes. Finally, we discuss the extension of this solver to circular accelerator systems. This study shows that the fast 2.5-dimensional solver can be a good approximation to the fully three-dimensional solver for long bunches in large circular accelerators.

Beam code development & simulation techniques↗
DOE OSTI2022

Gradient-enhanced physics-informed neural networks for forward and inverse PDE problems

Deep learning has been shown to be an effective tool in solving partial differential equations (PDEs) through physics-informed neural networks (PINNs). PINNs embed the PDE residual into the loss function of the neural network, and have been successfully employed to solve diverse forward and inverse PDE problems. However, one disadvantage of the first generation of PINNs is that they usually have limited accuracy even with many training points. Here, we propose a new method, gradient-enhanced physics-informed neural networks (gPINNs), for improving the accuracy of PINNs. gPINNs leverage gradient information of the PDE residual and embed the gradient into the loss function. We tested gPINNs extensively and demonstrated the effectiveness of gPINNs in both forward and inverse PDE problems. Our numerical results show that gPINN performs better than PINN with fewer training points. Additionally, we combined gPINN with the method of residual-based adaptive refinement (RAR), a method for improving the distribution of training points adaptively during training, to further improve the performance of gPINN, especially in PDEs with solutions that have steep gradients.

42 ENGINEERING↗
NASA NTRS1984

Wind tunnel wall interference in closed, ventilated and adaptive test sections

A wall interference correction method for closed rectangular test sections was developed which uses measured wall pressures. Measurements with circular discs for blockage and a rectangular wing as a lift generator in a square closed test section validate this method. These measurements are intended to be a basis of comparison for measurements in the same tunnel using ventilated (in these case, slotted) walls. Using the vortex lattice method and homogeneous boundary conditions, calculations were performed which show sufficiently high pressure levels at the walls for correction purposes in test sections with porous walls. In Gottingen, an adaptive test section (which is a deformable rubber tube of 800 mm diameter) was built and a computer program was developed which is able to find the necessary wall adaptation for interference-free measurements in a single step. To check the program prior to the first run, the vortex lattice method was used to calculate wall pressure distributions in the nonadapted test section as input data for the one-step method. Comparison of the pressure distribution in the adapted test section with free-flight data shows nearly perfect agreement. An extension of the computer program can be made to evaluate the remaining interference corrections.

Holst, H.↗
NASA NTRS2002

OAI and NASA's Scientific and Technical Information

The Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH) is an evolving protocol and philosophy regarding interoperability for digital libraries (DLs). Previously, "distributed searching" models were popular for DL interoperability. However, experience has shown distributed searching systems across large numbers of DLs to be difficult to maintain in an Internet environment. The OAI-PMH is a move away from distributed searching, focusing on the arguably simpler model of "metadata harvesting". We detail NASA s involvement in defining and testing the OAI-PMH and experience to date with adapting existing NASA distributed searching DLs (such as the NASA Technical Report Server) to use the OAI-PMH and metadata harvesting. We discuss some of the entirely new DL projects that the OAI-PMH has made possible, such as the Technical Report Interchange project. We explain the strategic importance of the OAI-PMH to the mission of NASA s Scientific and Technical Information Program.

Nelson, Michael L.↗
DOE OSTI2024

Distributed Wind Guidebook: Agricultural Producers and Rural Small Business Owners

Distributed wind energy technologies generate clean, carbon-free power close to the point of consumption (i.e., close to people and their energy needs). Distributed wind energy can help individuals, farms, businesses, and communities meet their unique goals, such as reducing impacts on climate change, decreasing electricity bills, boosting energy independence or autonomy from the electric grid, and enhancing grid reliability and resilience. This guidebook is designed to support you in (1) deciding if distributed wind energy is right for you, (2) installing a proven wind turbine technology by working with a reputable installer, and (3) setting up your project for success through its lifetime. The information in this guidebook is tailored to rural small businesses and agricultural producers who are interested in exploring distributed wind energy to meet their electricity, resilience, financial, and environmental goals. You will find gray boxes with key topics, definitions, and considerations throughout the guidebook. The report has been adapted from the Distributed Wind Guidebook, which offers a comprehensive view on core aspects of deploying distributed wind energy technologies. In comparison, this edition of the guidebook is designed to offer a more succinct and tailored guidebook for rural small businesses and agricultural producers. For additional detail on any topic presented within this edition, readers are advised to reference the original version of the Distributed Wind Guidebook.

17 WIND ENERGY↗
NASA NTRS1993

Adaptive median filtering for preprocessing of time series measurements

A median (L1-norm) filtering program using polynomials was developed. This program was used in automatic recycling data screening. Additionally, a special adaptive program to work with asymmetric distributions was developed. Examples of adaptive median filtering of satellite laser range observations and TV satellite time measurements are given. The program proved to be versatile and time saving in data screening of time series measurements.

Paunonen, Matti↗
NASA NTRS1983

Evaluation of truncation error and adaptive grid generation for the transonic full potential flow calculations

The effects of truncation error on the numerical solution of transonic flows using the full potential equation are studied. The effects of adapting grid point distributions to various solution aspects including shock waves is also discussed. A conclusion is that a rapid change of grid spacing is damaging to the accuracy of the flow solution. Therefore, in a solution adaptive grid application an optimal grid is obtained as a tradeoff between the amount of grid refinement and the rate of grid stretching.

Nakamura, S.↗
DOE OSTI2022

Genotype–environment associations across spatial scales reveal the importance of putative adaptive genetic variation in divergence

Abstract Identifying areas of high evolutionary potential is a judicious strategy for developing conservation priorities in the face of environmental change. For wide‐ranging species occupying heterogeneous environments, the evolutionary forces that shape distinct populations can vary spatially. Here, we investigate patterns of genomic variation and genotype–environment associations in the hermit thrush ( Catharus guttatus ), a North American songbird, at broad (across the breeding range) and narrow spatial scales (at a hybrid zone). We begin by building a genoscape or map of genetic variation across the breeding range and find five distinct genetic clusters within the species, with the greatest variation occurring in the western portion of the range. Genotype–environment association analyses indicate higher allelic turnover in the west than in the east, with measures of temperature surfacing as key predictors of putative adaptive genomic variation rangewide. Since broad patterns detected across a species' range represent the aggregate of many locally adapted populations, we investigate whether our broadscale analysis is consistent with a finer scale analysis. We find that top rangewide temperature‐associated loci vary in their clinal patterns (e.g., steep clines vs. fixed allele frequencies) across a hybrid zone in British Columbia, suggesting that the environmental predictors and the associated candidate loci identified in the rangewide analysis are of variable importance in this particular region. However, two candidate loci exhibit strong concordance with the temperature gradient in British Columbia, suggesting a potential role for temperature‐related barriers to gene flow and/or temperature‐driven ecological selection in maintaining putative local adaptation. This study demonstrates how patterns identified at the broad (macrogeographic) scale can be validated by investigating genotype–environment correlations at the local (microgeographic) scale. Furthermore, our results highlight the importance of considering the spatial distribution of putative adaptive variation when assessing population‐level sensitivity to climate change and other stressors.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1980

Systems architecture for distributed applications

This paper describes the kernel of a distributed operating system called ADAPT. The system runs on top of existing single host operating systems that are networked together. It's purpose is to transform this network of individual systems into a single system that will be easier for application programmers to use. This single system need not be monolithic; ADAPT facilitates the construction of both integrated and modular distributed systems.

Peebles, R.↗
DOE OSTI2022

Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit

Abstract Summary Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. Availability and implementation PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Adaptive X-ray imaging with reinforcement learning

X-ray imaging is a powerful technique to scan samples in a variety of contexts including biological, environmental and materials science, but commonly requires a synchrotron light source to produce X-rays at sufficient intensity. As these facilities are expensive to operate, the available beam time is limited and always in high demand. Particularly if the illuminated samples are sparse, standard raster scanning methods can be time-consuming, with a majority of that time being spent on areas of the image that carry little information. To increase the efficiency and maximize the information gain for a given time budget, we split the scanning process into a series of steps where previous measurements are used to inform the decision making and adapt the exposure distribution at later stages of the sequence. We formulate this task as a reinforcement learning problem where the goal is to produce a sequence of exposure maps that maximize a predefined scalar metric. We demonstrate the potential of this approach in simulations where the adaptive illumination can accelerate the measurement process by up to an order of magnitude compared with standard raster scanning. Finally, we present the first results from deploying the trained agents on an X-ray fluorescence beamline at the Stanford Synchrotron Radiation Lightsource.

Reinforcement Learning↗
NASA NTRS2007

Reusable, Extensible High-Level Data-Distribution Concept

A framework for high-level specification of data distributions in data-parallel application programs has been conceived. [As used here, distributions signifies means to express locality (more specifically, locations of specified pieces of data) in a computing system composed of many processor and memory components connected by a network.] Inasmuch as distributions exert a great effect on the performances of application programs, it is important that a distribution strategy be flexible, so that distributions can be adapted to the requirements of those programs. At the same time, for the sake of productivity in programming and execution, it is desirable that users be shielded from such error-prone, tedious details as those of communication and synchronization. As desired, the present framework enables a user to refine a distribution type and adjust it to optimize the performance of an application program and conceals, from the user, the low-level details of communication and synchronization. The framework provides for a reusable, extensible, data-distribution design, denoted the design pattern, that is independent of a concrete implementation. The design pattern abstracts over coding patterns that have been found to be commonly encountered in both manually and automatically generated distributed parallel programs. The following description of the present framework is necessarily oversimplified to fit within the space available for this article. Distributions are among the elements of a conceptual data-distribution machinery, some of the other elements being denoted domains, index sets, and data collections (see figure). Associated with each domain is one index set and one distribution. A distribution class interface (where "class" is used in the object-oriented-programming sense) includes operations that enable specification of the mapping of an index to a unit of locality. Thus, "Map(Index)" specifies a unit, while "LocalLayout(Index)" specifies the local address within that unit. The distribution class can be extended to enable specification of commonly used distributions or novel user-defined distributions. A data collection can be defined over a domain. The term "data collection" in this context signifies, more specifically, an abstraction of mappings from index sets to variables. Since the index set is distributed, the addresses of the variables are also distributed.

James, Mark↗
NASA NTRS1990

Adaptive pattern recognition by mini-max neural networks as a part of an intelligent processor

In this decade and progressing into 21st Century, NASA will have missions including Space Station and the Earth related Planet Sciences. To support these missions, a high degree of sophistication in machine automation and an increasing amount of data processing throughput rate are necessary. Meeting these challenges requires intelligent machines, designed to support the necessary automations in a remote space and hazardous environment. There are two approaches to designing these intelligent machines. One of these is the knowledge-based expert system approach, namely AI. The other is a non-rule approach based on parallel and distributed computing for adaptive fault-tolerances, namely Neural or Natural Intelligence (NI). The union of AI and NI is the solution to the problem stated above. The NI segment of this unit extracts features automatically by applying Cauchy simulated annealing to a mini-max cost energy function. The feature discovered by NI can then be passed to the AI system for future processing, and vice versa. This passing increases reliability, for AI can follow the NI formulated algorithm exactly, and can provide the context knowledge base as the constraints of neurocomputing. The mini-max cost function that solves the unknown feature can furthermore give us a top-down architectural design of neural networks by means of Taylor series expansion of the cost function. A typical mini-max cost function consists of the sample variance of each class in the numerator, and separation of the center of each class in the denominator. Thus, when the total cost energy is minimized, the conflicting goals of intraclass clustering and interclass segregation are achieved simultaneously.

Szu, Harold H.↗
DOE OSTI2024

Boundary-Aware Adversarial Learning Domain Adaption and Active Learning for Cross-Sensor Building Extraction

The use of convolutional neural networks (CNNs) for building extraction from remote sensing images has been widely studied and many public datasets have been made available for accelerating development of these CNN models. Yet adapting pretrained models at scale in real-world scenarios remains a challenging task. The main barrier is that certain new labels are still needed to compensate for domain shifting between the labeled data and new images that potentially cover new geographic locations or that are from a different sensor. In this article, we propose to add informatively labeled samples from a new image pool under the paradigm of active learning. To select the most useful samples based on model uncertainty, we first tackle the problem of uncalibrated uncertainty estimation due to distribution shifting by adapting feature extractors with boundary-based adversarial learning. Calibrated uncertainty is used as the query criterion in the active learning process, where the most uncertain samples are selected for annotation and included for model retraining. The proposed workflow was tested with three data pairs in which each workflow represents a scenario often encountered in real-world applications, including adapting pretrained models to new images collected with different sensors or to new geographic areas where appearances and types of buildings are very different. Compared to several baselines, including random sampling, temperature scaling (a well-known uncertainty calibration technique), different query strategies, and active domain adaptation methods, the proposed workflow shows that strategically querying a smaller set of samples for labeling achieves comparable or better building extraction performance. The proposed method reduces the number of labeled samples required to achieve sufficient model accuracy, thus significantly reducing hundreds of person-hours for labeled data creation. In addition, we include a few considerations when deploying this workflow in a GPU cluster that can be easily adapted to achieve operational building extraction model retraining.

97 MATHEMATICS AND COMPUTING↗