Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed generators”

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Prediction of Distributed River Sediment Respiration Rates Using Community-Generated Data and Machine Learning

River sediment microbial respiration is a key indicator of ecosystem functioning and the biogeochemical fluxes across this critical zone link surface and subsurface waters. As such, there is tremendous interest in measuring and mapping these respiration rates. Respiration observations are expensive and labor intensive; there is limited data available to the community. An open science, collaborative initiative is collecting samples for respiration rate analysis and multi-scale metadata; this evolving data set is being used for making machine learning (ML) predictions at unsampled sites to help inform continued community engagement. However, it is a challenge to find an optimum configuration for ML models to work with this feature-rich (i.e., 100+ possible input variables) data set. Here, we present results from a two-tiered approach to managing the analysis of this complex data set: (a) a stacked ensemble of models that automatically optimizes hyperparameters and manages the training of many models and (b) feature permutation importance to detect the most important features in the models. The major elements of this workflow are modular, portable, open, and cloud-based thus making this implementation a potential template for other applications. The models developed here predict that sediment organic matter chemistry is one of the most important features for predicting sediment respiration rate. Other larger-scale, important features fall into the categories of climatic, ecological, geological, and fluvial settings. Leveraging these larger-scale features to generate data-driven estimates of river sediment respiration rates reveals spatially consistent but heterogeneous patterns across the river network of the Columbia River Basin.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Distribution function of nuclei from $\mathcal{e}^±$ scattering in the presence of a strong primordial magnetic field

The amplitude of the primordial magnetic field (PMF) is constrained from observational limits on primordial nuclear abundances. Within this constraint, it is possible that nuclear motion is regulated by Coulomb scattering with electrons and positrons (e ± s), while e ± s are affected by a PMF rather than collisions. For example, at a temperature of 10 9 K, thermal nuclei typically experience ~ 10 21 scatterings per second that are dominated by very small angle scattering leading to minuscule changes in the nuclear kinetic energy of order $\mathcal{O}$(1) eV. In this paper the upper limit on the effects of a possible discretization of the e ± momenta by the PMF on the nuclear momentum distribution is estimated under the extreme assumptions that the momentum of the e ± is relaxed before and after Coulomb scattering to Landau levels, and that during Coulomb scattering the PMF is neglected. This assumption explicitly breaks the time reversal invariance of Coulomb scattering, and the Maxwell-Boltzmann distribution is not a trivial steady state solution of the Boltzmann equation under these assumptions. Here we numerically evaluate the collision terms in the Boltzmann equation, and show that the introduction of a special direction in the e ± distribution by the PMF generates no directional dependence of the collisional destruction term of nuclei. Large anisotropies in the nuclear distribution function are then constrained from big bang nucleosynthesis. Ultimately, we conclude that a PMF does not significantly affect the isotropy or big bang nucleosynthesis.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Pricing and Energy Trading in Peer-to-Peer Zero Marginal-Cost Microgrids

Efforts to utilize 100% renewable energy in community microgrids require new approaches to energy markets and transactions to efficiently address periods of scarce energy supply. In this paper we contribute to the promising approach of peer-to-peer (P2P) energy trading in two main ways: analysis of a centralized, welfare-maximizing economic dispatch that characterizes optimal price and allocations, and a novel P2P system for negotiating energy trades that yields physically feasible and at least weakly Pareto-optimal outcomes. Our main results are 1) that optimal pricing is insufficient to induce agents with batteries to take optimal actions, 2) a novel P2P algorithm to addresses this while keeping private information, 3) a formal proof that this algorithm converges to the centralized solution in the case of two agents negotiating for a single period, and 4) numerical simulations of the P2P algorithm performance with up to 10 agents and 24 periods that show it converges on average to total welfare within 0.1% of the social optimum in on the order of 10s to 100s of iterations, increasing with the number of agents, time periods, and total storage capacity.

batteries↗
NASA NTRS1986

Error propagation in a digital avionic processor: A simulation-based study

An experimental analysis to study error propagation from the gate to the chip level is described. The target system is the CPU in the Bendix BDX-930, an avionic miniprocessor. Error activity data for the study was collected via a gate-level simulation. A family of distributions to characterize the error propagation, both within the chip and at the pins, was then generated. Based on these distributions, measures of error propagation and severity were defined. The analysis quantifies the dependency of the measured error propagation on the location of the fault and the type of instruction/microinstruction executed.

Lomelino, D.↗
NASA NTRS2001

Nonstationary Dynamics Data Analysis with Wavelet-SVD Filtering

Nonstationary time-frequency analysis is used for identification and classification of aeroelastic and aeroservoelastic dynamics. Time-frequency multiscale wavelet processing generates discrete energy density distributions. The distributions are processed using the singular value decomposition (SVD). Discrete density functions derived from the SVD generate moments that detect the principal features in the data. The SVD standard basis vectors are applied and then compared with a transformed-SVD, or TSVD, which reduces the number of features into more compact energy density concentrations. Finally, from the feature extraction, wavelet-based modal parameter estimation is applied.

Brenner, Marty↗
NASA NTRS1998

High-Performance Monitoring Architecture for Large-Scale Distributed Systems Using Event Filtering

Monitoring is an essential process to observe and improve the reliability and the performance of large-scale distributed (LSD) systems. In an LSD environment, a large number of events is generated by the system components during its execution or interaction with external objects (e.g. users or processes). Monitoring such events is necessary for observing the run-time behavior of LSD systems and providing status information required for debugging, tuning and managing such applications. However, correlated events are generated concurrently and could be distributed in various locations in the applications environment which complicates the management decisions process and thereby makes monitoring LSD systems an intricate task. We propose a scalable high-performance monitoring architecture for LSD systems to detect and classify interesting local and global events and disseminate the monitoring information to the corresponding end- points management applications such as debugging and reactive control tools to improve the application performance and reliability. A large volume of events may be generated due to the extensive demands of the monitoring applications and the high interaction of LSD systems. The monitoring architecture employs a high-performance event filtering mechanism to efficiently process the large volume of event traffic generated by LSD systems and minimize the intrusiveness of the monitoring process by reducing the event traffic flow in the system and distributing the monitoring computation. Our architecture also supports dynamic and flexible reconfiguration of the monitoring mechanism via its Instrumentation and subscription components. As a case study, we show how our monitoring architecture can be utilized to improve the reliability and the performance of the Interactive Remote Instruction (IRI) system which is a large-scale distributed system for collaborative distance learning. The filtering mechanism represents an Intrinsic component integrated with the monitoring architecture to reduce the volume of event traffic flow in the system, and thereby reduce the intrusiveness of the monitoring process. We are developing an event filtering architecture to efficiently process the large volume of event traffic generated by LSD systems (such as distributed interactive applications). This filtering architecture is used to monitor collaborative distance learning application for obtaining debugging and feedback information. Our architecture supports the dynamic (re)configuration and optimization of event filters in large-scale distributed systems. Our work represents a major contribution by (1) survey and evaluating existing event filtering mechanisms In supporting monitoring LSD systems and (2) devising an integrated scalable high- performance architecture of event filtering that spans several kev application domains, presenting techniques to improve the functionality, performance and scalability. This paper describes the primary characteristics and challenges of developing high-performance event filtering for monitoring LSD systems. We survey existing event filtering mechanisms and explain key characteristics for each technique. In addition, we discuss limitations with existing event filtering mechanisms and outline how our architecture will improve key aspects of event filtering.

Maly, K.↗
DOE OSTI2022

DOE OE 2021 Strategy White Papers on Microgrids: Program Vision, Objectives, and R&D Targets in 5 and 10 years–Topic Area #1

This white paper describes the program vision, objectives, and R&D targets in 5 to 10 years for the Department of Energy (DOE) Office of Electricity (OE) Microgrid R&D Program. The vision is to facilitate the nation’s transitions to (1) a more resilient and reliable, (2) more decarbonized electricity infrastructure, in which (3) microgrids have a reduced cost to implement. This strategy is developed in the context that the United States’ electricity delivery system is becoming more distributed in nature. The electricity generation capacity in 10 years may be 30-50% distributed energy assets.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1962

Combined Radiation and Forced Convection for Flow of a Transparent Gas in a Tube with Sinusoidal Axial Wall Heat Flux Distribution

An analysis is made of the influence that radiation exchanges between elements on the inside surface of a tube have on the wall and gas temperature distributions for forced-convection flow. The wall heat generation has a chopped sine distribution with length along the tube, which is a distribution often encountered in nuclear-reactor channels. The flowing gas is assumed transparent to thermal radiation and hence does not participate directly in the radiative exchange process. Axial heat conduction is neglected in the gas and tube wall, and the convective-heat-transfer coefficient and fluid properties are assumed constant. Several numerical examples are given to illustrate the effects of eight independent parameters such as wall emissivity, Stanton number, and length-diameter ratio. In some instances the radiation exchanges reduced the peak wall temperature or caused a reduction in the exit gas temperature because of radiation losses from the tube end openings.

TUBE↗
NASA NTRS2011

Estimated Accuracy of Three Common Trajectory Statistical Methods

Three well-known trajectory statistical methods (TSMs), namely concentration field (CF), concentration weighted trajectory (CWT), and potential source contribution function (PSCF) methods were tested using known sources and artificially generated data sets to determine the ability of TSMs to reproduce spatial distribution of the sources. In the works by other authors, the accuracy of the trajectory statistical methods was estimated for particular species and at specified receptor locations. We have obtained a more general statistical estimation of the accuracy of source reconstruction and have found optimum conditions to reconstruct source distributions of atmospheric trace substances. Only virtual pollutants of the primary type were considered. In real world experiments, TSMs are intended for application to a priori unknown sources. Therefore, the accuracy of TSMs has to be tested with all possible spatial distributions of sources. An ensemble of geographical distributions of virtual sources was generated. Spearman s rank order correlation coefficient between spatial distributions of the known virtual and the reconstructed sources was taken to be a quantitative measure of the accuracy. Statistical estimates of the mean correlation coefficient and a range of the most probable values of correlation coefficients were obtained. All the TSMs that were considered here showed similar close results. The maximum of the ratio of the mean correlation to the width of the correlation interval containing the most probable correlation values determines the optimum conditions for reconstruction. An optimal geographical domain roughly coincides with the area supplying most of the substance to the receptor. The optimal domain s size is dependent on the substance decay time. Under optimum reconstruction conditions, the mean correlation coefficients can reach 0.70 0.75. The boundaries of the interval with the most probable correlation values are 0.6 0.9 for the decay time of 240 h and 0.5 0.95 for the decay time of 12 h. The best results of source reconstruction can be expected for the trace substances with a decay time on the order of several days. Although the methods considered in this paper do not guarantee high accuracy they are computationally simple and fast. Using the TSMs in optimum conditions and taking into account the range of uncertainties, one can obtain a first hint on potential source areas.

Kabashnikov, Vitaliy P.↗
DOE OSTI2021

Deterministic multi-qubit entanglement in a quantum network

High-fidelity deterministic quantum state transfer and multi-qubit entanglement are demonstrated in a quantum network comprising two superconducting quantum nodes one metre apart, with each node including three interconnected qubits. The generation of high-fidelity distributed multi-qubit entanglement is a challenging task for large-scale quantum communication and computational networks. The deterministic entanglement of two remote qubits has recently been demonstrated with both photons and phonons. However, the deterministic generation and transmission of multi-qubit entanglement has not been demonstrated, primarily owing to limited state-transfer fidelities. Here we report a quantum network comprising two superconducting quantum nodes connected by a one-metre-long superconducting coaxial cable, where each node includes three interconnected qubits. By directly connecting the cable to one qubit in each node, we transfer quantum states between the nodes with a process fidelity of 0.911 +/- 0.008. We also prepare a three-qubit Greenberger-Horne-Zeilinger (GHZ) state in one node and deterministically transfer this state to the other node, with a transferred-state fidelity of 0.656 +/- 0.014. We further use this system to deterministically generate a globally distributed two-node, six-qubit GHZ state with a state fidelity of 0.722 +/- 0.021. In this work, the GHZ state fidelities are clearly above the threshold of 1/2 for genuine multipartite entanglement, showing that this architecture can be used to coherently link together multiple superconducting quantum processors, providing a modular approach for building large-scale quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2000

A Tool for Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT, and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level, or on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if the compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator, then the loop which implements the operator can be declared as INDEPENDENT. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.

Frumkin, Michael↗
DOE OSTI2024

MENT-Flow: maximum-entropy phase space tomography using normalizing flows

Generative models can be trained to reproduce low-dimensional projections of high-dimensional phase space distributions. Normalizing flows are generative models that parameterize invertible transformations, allowing exact probability density evaluation and sampling. Consequently, flows are unbiased entropy estimators and could be used to solve the high-dimensional maximum-entropy tomography (MENT) problem. In this work, we evaluate a flow-based MENT solver (MENT-Flow) against exact maximum-entropy solutions and Minerbo's iterative MENT algorithm in two dimensions.

Hoover, Austin↗
DOE OSTI2025

Generative learning for slow manifolds and bifurcation diagrams

In dynamical systems characterized by separation of time scales, the approximation of so called “slow manifolds”, on which the long term dynamics lie, is a useful step for model reduction. Initializing on such slow manifolds is a useful step in modeling, since it circumvents fast transients, and is crucial in multiscale algorithms (like the equation-free approach) alternating between fine scale (fast) and coarser scale (slow) simulations. In a similar spirit, when one studies the infinite time dynamics of systems depending on parameters, the system attractors (e.g., its steady states) lie on bifurcation diagrams (curves for one-parameter continuation, and more generally, on manifolds in state parameter space. Sampling these manifolds gives us representative attractors (here, steady states of ODEs or PDEs) at different parameter values. Algorithms for the systematic construction of these manifolds (slow manifolds, bifurcation diagrams) are required parts of the “traditional” numerical nonlinear dynamics toolkit. In more recent years, as the field of Machine Learning develops, conditional score-based generative models (cSGMs) have been demonstrated to exhibit remarkable capabilities in generating plausible data from target distributions that are conditioned on some given label. It is tempting to exploit such generative models to produce samples of data distributions (points on a slow manifold, steady states on a bifurcation surface) conditioned on (consistent with) some quantity of interest (QoI, observable). In this work, we present a framework for using cSGMs to quickly (a) initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system consistent with desired value(s) of a QoI (a “label”) on the manifold, and (b) approximate steady states in a bifurcation diagram consistent with a (new, out-of-sample) parameter value. This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately “fill in” missing segments of steady states in a bifurcation diagram. Finally, the quantity of interest, which determines how the sampling is conditioned, is either known a priori or identified using manifold learning-based dimensionality reduction techniques applied to the training data.

Dynamical systems↗
NASA NTRS1983

Effects of voltage control in utility interactive dispersed storage and generation systems

When a small generator is connected to the distribution system, the voltage at the point of interconnection is determined largely by the system and not the generator. The effect on the generator, on the load voltage and on the distribution system of a number of different voltage control strategies in the generator is examined. Synchronous generators with three kinds of exciter control are considered, as well as induction generators and dc/ac inverters, with and without capacitor compensation. The effect of varying input power during operation (which may be experienced by generators based on renewable resources) is explored, as well as the effect of connecting and disconnecting the generator at ten percent of its rated power. Operation with a constant slightly lagging factor is shown to have some advantages.

Kirkham, H.↗
DOE OSTI2023

Searching for optimal THz generation through calculations of the asymmetry of photoelectron momentum distributions by an improved strong-field-approximation method

From the solution of the time-dependent Schrödinger equation (TDSE), it has been shown that in a two-color laser pulse the relative phase that optimizes terahertz (THz) radiation also optimizes the asymmetry of the angular distribution of photoelectrons. Here, in this work, we show that a second-order strong-field approximation can accurately calculate the asymmetry of photoelectrons and thus can locate the phase delay that optimizes THz generation, doing so four orders of magnitude faster than TDSE calculations. We further trace that this is possible because THz emission originates from a free-free radiative transition between the rescattered electron and the target ion, similar to other electron-ion collisions in the laser field, e.g., high-harmonic generation and nonsequential double ionization. Our results pave the way to locate the optimal phase delay for any typical laser pulses for maximal THz generation in the laboratory.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1972

Multiple element airfoils optimized for maximum lift coefficient.

Optimum airfoils in the sense of maximum lift coefficient are obtained for incompressible fluid flow at large Reynolds number. The maximum lift coefficient is achieved by requiring that the turbulent skin friction be zero in the pressure rise region on the airfoil upper surface. Under this constraint, the pressure distribution is optimized. The optimum pressure distribution is a function of Reynolds number and the trailing edge velocity. Geometries of those airfoils which will generate these optimum pressure distributions are obtained using a direct-iterative method which is developed in this study. This method can be used to design airfoils consisting of any number of elements. Numerical examples of one- and two-element airfoils are given. The maximum lift coefficients obtained range from 2 to 2.5.

Ormsbee, A. I.↗
DOE OSTI2022

Distributed Real-time Plume Monitoring for Deep Sea Mineral Extraction​

In the emerging industry of deep-sea mining for minerals and deposits (e.g. polymetallic nodules for nickel, cobalt, copper, and manganese), more data is required to understand the effects of sediment plume generation and predict the distribution of disturbed sediment. There are two main sources of plume generation, the first being at the active mining site where the “collector” directly removes the top layer of the sea floor. The other is the “midwater plume” consisting of unwanted sediment that was collected during extraction that is pumped back into the aphotic zone. The vast majority of plume generation is caused by the collector, causing detrimental and long-lasting impacts on seafloor ecosystems due to the lack of wave activity or strong currents at the sea floor. Therefore, it is crucial to invest in the infrastructure to support the study and constant monitoring over a large area of the sea floor where plume generation is present. Due to the limited number of usable channels and power requirements, current subsea wireless communications technologies are not well suited to instrumenting the large areas of the sea floor needed to monitor plume migration. The scope of this effort is to transition experimental demonstrations of high-bandwidth, full-duplex scalable underwater laser communications to the seafloor in an open ocean environment. Specifically tackling challenges associated with the dynamic nature of the subsea world, including but not limited to, deployment logistics, sustainability, and range. The goal is to enable the internet of underwater things for deep sea industries by broadening the capabilities of subsea communications. By using high-precision laser transmitters, many of the challenges current subsea optical systems face can be circumvented, such as power consumption, interference, and bandwidth limitations. This approach lends itself to wireless interlinking multi-node networks, in series or parallel, facilitating the implementation of a wide array of sensor types. This interlinking allows all the data gathered from the network to be processed through a single hardline uplink to the surface, lowering the complexity required for near real-time data processing. Additionally, the laser control systems produce metadata that can be used to help characterize the water column between the nodes. Combining data from various sensors such as turbidity, temperature, current velocity with metadata such as beam attenuation and deflection can produce a high-resolution model of sea floor conditions around an active mining zone. The resulting near real-time model can be used to optimize location and flow rate of the mining operation to minimize and quantify the environmental impact.

Mons, Ishan↗