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

Mini All-purpose Satellite Control Center (MASCC)

A new generation of Mini All-purpose Satellite Control Centers (MASCC) has been developed by CNES (F). They turn out to be easily adaptable to different kinds of satellites, both Low Earth Orbital or Geostationary. The features of MASCC allow both standard satellite control activities, and checking of passengers experiments hosted on a space platform. In the different environments in which it may be used, MASCC provides standard broadcasting of telemetry parameters on animated synoptics (curves, bar graphs, alphanumeric displays, ...), which turns out to be a very useful and ergonomic medium for operational teams or satellite specialists. Special care has been taken during the MASCC development about two points: - automation of all routine tasks, allowing automated operation, and limiting human commitment to system supervision and decision making, - software adaptability. To reach these two main objectives, the MASCC design provides:(1) a simple, robust and flexible hardware architecture, based on powerful distributed workstations; and (2) a table-driven software architecture, easily adapted to various operational needs. Satellite characteristics are described in a central Data Base. Hence, the processing of telemetry and commands is largely independent from the satellite itself. In order to validate these capabilities, the MASCC has been customized to several types of satellites and orbital platforms: (1) SPOT4, the French new generation of remote sensing satellites; (2) TELECOM2, the French geostationary TV and telecommunication satellite; and (3) MIR, the Russian orbital platform. MASCC development has been completed by the third quarter of 1993. This paper will provide first a description of the MASCC basic functions, of its hardware and software design. It will then detail the increased automation capability, along with the easy adaptation of the MASCC to new satellites with minimal software modifications.

Zaouche, Gerard↗

On-line upgrade of program modules using AdaPT

One purpose of our research is the investigation of the effectiveness and expressiveness of AdaPT, a set of language extensions to Ada 83, for distributed systems. As a part of that effort, we are now investigating the subject of replacing, e.g. upgrading, software modules while the software system remains in operation. The AdaPT language extensions provide a good basis for this investigation for several reasons: they include the concept of specific, self-contained program modules which can be manipulated; support for program configuration is included in the language; and although the discussion will be in terms of the AdaPT language, the AdaPT to Ada 83 conversion methodology being developed as another part of this project will provide a basis for the application of our findings to Ada 83 and Ada 9X systems. The purpose of this investigation is to explore the basic mechanisms of the replacement process. With this purpose in mind, we will avoid including issues whose presence would obscure these basic mechanisms by introducing additional, unrelated concerns. Thus, while replacement in the presence of real-time deadlines, heterogeneous systems, and unreliable networks is certainly a topic of interest, we will first gain an understanding of the basic processes in the absence of such concerns. The extension of the replacement process to more complex situations can be made later. A previous report established an overview of the module replacement problem, a taxonomy of the various aspects of the replacement process, and a solution to one case in the replacement taxonomy. This report provides solutions to additional cases in the replacement process taxonomy: replacement of partitions with state and replacement of nodes. The solutions presented here establish the basic principles for module replacement. Extension of these solutions to other more complicated cases in the replacement taxonomy is direct, though requiring substantial work beyond the available funding.

Waldrop, Raymond S.↗

Wideband Impedance Passivation of MMCs for Suppressing Harmonic Oscillations

Harmonic instability and associated oscillation events have become one of the main concerns in MMC-based HVdc systems. These oscillations can appear in the range from a few hundred hertz to several kilohertz, and the root cause is identified as delay-induced negative damping of MMC impedance appearing at the system resonance frequency. Here, this paper introduces a wideband impedance reshaping method through MMC control to eliminate such negative damping for both grid-following (GFL) and grid-forming (GFM) MMCs, which makes the MMC impedance completely passive from the second harmonic frequency upward, thus preventing all harmonic oscillations. First, simplified impedance models of MMCs are derived for the harmonic stability analysis and the impedance reshaping control design. Next, a passivity-based impedance reshaping method is presented, as well as practical considerations for its implementation. In addition, to maintain the MMC's disturbance ride-through capability, an adaptive activation scheme is developed, which enables the wideband impedance reshaping control only in the presence of harmonic oscillation events. The effectiveness of the proposed method is validated by frequency domain analysis and by electromagnetic transient (EMT) simulations of two typical MMC-based power systems.

17 WIND ENERGY↗

Solution-adaptive program SADAP3D

A generic solution-adaptive grid program based on an error equi-distribution concept has been developed for use in complex multidimensional flows. The capability of a generic, user-friendly, multidimensional algorithm is demonstrated using several complex 3D flows in high-speed regimes. A simple scheme enforces the continuity of grid spacing along each currently adapted grid line as the computation proceeds. Calculation of normal vectors at each point of a grid plane is enhanced. The grid movement is automatically controlled by reinstating grid-spacing continuity locally in the mainstream of the unidirectional computation. It is concluded that the scheme can be readily coupled with many flow solvers to enhance accuracy and efficiency of solutions.

Djomehri, M. J.↗

Decentralised Reinforcement Learning for Dynamic Cyberattack Response in Microgrid Networks

Microgrids rely on communication networks for reliable operation, which makes them inherently vulnerable to cyberattacks. Such attacks can destabilise system dynamics and drive states away from their nominal operating trajectories. Although several physics-informed and machine learning-based strategies have been developed to counter these threats, the rapidly evolving cyber landscape enables adversaries to bypass static defences or rules-based mitigation approaches. This paper proposes a dynamic, online-trained and fully decentralised reinforcement learning (RL)-based cyberattack response framework to protect microgrids from evolving cyberattacks. The proposed framework deploys multiple deep Q-networks (DQNs), each associated with a distributed energy resource (DER), to enable localised and adaptive attack mitigation. In this framework, each DQN processes local voltage and frequency measurements—combined with intrusion detection system (IDS) alerts—as observations and rewards to guide decision-making. Extensive simulation studies demonstrate the robustness of the proposed framework under diverse attack scenarios and varying IDS-induced detection delays. Comparative analysis highlights its superiority over existing static or preexisting rules-based mitigation approaches. Finally, we present an analysis that shows the framework's scalability to real-life microgrids with more interacting agents.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Adaptive Load-Balancing Algorithms using Symmetric Broadcast Networks

In a distributed computing environment, it is important to ensure that the processor workloads are adequately balanced, Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three efficient SBN-based dynamic load-balancing algorithms, and implement them on an SGI Origin2000. A thorough experimental study with Poisson distributed synthetic loads demonstrates that our algorithms are effective in balancing system load. By optimizing completion time and idle time, the proposed algorithms are shown to compare favorably with several existing approaches.

Das, Sajal K.↗

The Impact of Dimensionality Reduction of Ion Counts Distributions on Preserving Moments, With Applications to Data Compression

The field of space physics has a long history of utilizing dimensionality reduction methods to distill data, including but not limited to spherical harmonics, the Fourier Transform, and the wavelet transform. Here, we present a technique for performing dimensionality reduction on ion counts distributions from the Multiscale Mission/Fast Plasma Investigation (MMS/FPI) instrument using a data-adaptive method powered by neural networks. This has applications to both feeding low-dimensional parameterizations of the counts distributions into other machine learning algorithms, and the problem of data compression to reduce transmission volume for space missions. The algorithm presented here is lossy, and in this work, we present the technique of validating the reconstruction performance with calculated plasma moments under the argument that preserving the moments also preserves fluid-level physics, and in turn a degree of scientific validity. The method presented here is an improvement over other lossy compressions in loss-tolerant scenarios like the Multiscale Mission/Fast Plasma Investigation Fast Survey or in non-research space weather applications.

D. da Silva↗

Production, Outflow Velocity, and Radial Distribution of H2O and OH in the Coma of Comet C/1995 O1 [Hale-Bopp] from Wide Field Imaging of OH

Observations of OH are a useful proxy of the water production rate (Q(sub H2O)) and outflow velocity (V(sub out)) in comets. From wide field images taken on 03/28/1997 and 04/08/1997 that capture the entire scale length of the OH coma of comet C/1995 O1 (Hale-Bopp), we obtain Q(sub H2O) from the model-independent method of aperture summation. With an adaptive ring summation algorithm, we extract the radial brightness distribution of OH 0-0 band emission out to cometocentric distances of up to 10(exp 6) km, both as azimuthal averages and in quadrants covering different position angles relative to the comet-Sun line. These profiles are fit using both fixed and variable velocity 2-component spherical expansion models to estimate V(sub OH) with increasing distance from the nucleus. The OH coma of Hale-Bopp was more spatially extended than previous comets, and this extension is best matched by a variable acceleration of H2O and OH that acted across the entire coma, but was strongest within 1-2 x 10(exp 4) km from the nucleus. Our models indicate that V(sub OH) at the edge of our detectable field of view (10(exp 6) km) was approx. 2-3 times greater in Hale-Bopp than for a 1P/Halley-class comet at 1 AU, which is consistent with the results of more sophisticated gas-kinetic models, extrapolation from previous observations of OH in comets with Q(sub H2O) greater than 10(exp 29)/s , and direct radio measurements of the outer coma Hale-Bopp OH velocity. The most probable source of this acceleration is thermalization of the excess energy of dissociation of H2O and OH over an extended collisional coma. When the coma is broken down by quadrants in position angle, we find an azimuthal asymmetry in the radial distribution that is characterized by an increase in the spatial extent of OH in the region between the orbit-trailing and anti-sunward directions. Model fits specific to this area and comparison with radio OH measurements suggest greater acceleration here, with V(sub OH) approx. 1.5 times greater at a 10(exp 6) km cometocentric distance than elsewhere in the coma. We discuss several mechanisms that may have acted within the coma to produce the observed effect.

Harris, Walter M.↗

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Guest Editorial: Planning and operation of resilient distribution system for integrated multi-energy

Resilience is the ability of power systems to prepare for and adapt to low-probability, high-impact incidents and withstand and recover rapidly from disruptions. With the ageing of electricity distribution infrastructure and increasing threats of weather-related incidents and natural disasters, the need to effectively enhance the resilience of the electricity distribution system has become urgent and has attracted worldwide attention. Although there are an increasing number of publications related to enhancing resilience strategies, resilience is an emerging concept in power systems. Existing practices are mostly focused on deploying distributed energy resources (DERs) and microgrids, hardening the existing infrastructures and building redundant capacities. However, from a broader perspective, resilience enhancement of power distribution system is a systematic engineering, involving long-term system planning and upgrading (e.g., deployment of smart grid technologies and intelligent switches), short-term proactive scheduling, real-time robust and resilient control of DERs, and post-event restoration and recovery strategies. Based on this point, this Special Issue in IET Energy System Integration focuses on soliciting the most recent and original technologies, scheduling and control strategies for improving the resilience of power distribution system. Eight papers are presented in this Special Issue, covering various aspects related to resilience enhancement of power distribution system, including fault-tolerant frequency measurement, robust scheduling of integrated electricity and district heating systems, robust control of DERs, efficient methods for safety verification as well as novel graph theory-based approach to restore the distribution systems after multiple simultaneous faults. A brief introduction of these 8 papers is provided below.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Extending XBAER Algorithm to Aerosol and Cloud Condition

The retrieval of cloud optical properties for aerosol contaminated water cloud is challenging because of the complexity of physical processes in such situations. Conventionally, cloud optical data products are typically derived, ignoring the aerosol impacts on radiative transfer in the retrieval process. This is potentially a significant source of error. In this paper, the eXtensible Bremen Aerosol Retrieval (XBAER) algorithm has been optimized for the retrieval of aerosol/cloud properties for the aerosol contaminated cloud (ACC) scenarios. This version of XBAER delivers cloud optical thickness (COT) and cloud effective radius (CER) for ACCs and simultaneously retrieves aerosol optical thickness (AOT). The surface parameterization and aerosol types used in the standard XBAER algorithm have been adapted in this retrieval to account for the ACC conditions. Aerosol types in XBAER for the retrieval of ACC scenarios have been parameterized to comprise weak and strong absorptions. The comparisons of COT, CER, and AOT retrieved using this adapted XBAER algorithm and two new NASA algorithms show good agreements, especially for biomass burning aerosol. The correlation coefficients are >0.9 for AOT, ~0.8 for CER, and ~0.7 for COT. There is also a good agreement for dust plume contaminated cloud scene. The XBAER derived AOT values for dust aerosols are systematically smaller than the NASA retrieval, but both products have the same spatial distribution patterns. The comparison of COT retrieved using the adapted XBAER algorithm and that retrieved from ground-based microwave radiometer (MWR) measurements shows much better agreement for ACC conditions with high AOT.

satellite↗

On-line replacement of program modules using AdaPT

One purpose of our research is the investigation of the effectiveness and expressiveness of AdaPT(1), a set of language extensions to Ada 83, for distributed systems. As a part of that effort, we are now investigating the subject of replacing, e.g., upgrading, software modules while the software system remains in operation. The AdaPT language extension provide a good basis for this investigation for several reasons: (1) they include the concept of specific, self-contained program modules which can be manipulated; (2) support for program configuration is included in the language; and (3) although the discussion will be in terms of the AdaPT language, the AdaPT to Ada 83 conversion methodology being developed as another part of this project will provide a basis for the application of our findings to Ada 83 systems. The purpose of this investigation is to explore the basic mechanisms to the replacement process. Thus, while replacement in the presence of real-time deadlines, heterogeneous systems, and unreliable networks is certainly a topic of interest, we will first gain an understanding of the basic processes in the absence of such concerns. The extension of the replacement process to more complex situations can be made later. This report will establish an overview of the on-line upgrade problem, and present a taxonomy of the various aspects of the replacement process.

Waldrop, Raymond S.↗

Adaptive QoS in 802.11e Wireless Networks for Lunar Communications

This slide presentation reviews the issues around Adaptive Quality of Service (QoS) in wireless networks for lunar communications, and how a dynamic 802.11e standard meets the requirements for all aspects of communications for lunar surface missions. This paper focuses on the use of Enhanced Distributed Channel Access (EDCA). It includes a description of an adaptive QoS Algorithm, a review of the set up of the simulation of the 802.11e standard, and the results of the simulation are included.

quality of service,↗

Adaptive language model training for molecular design

Abstract The vast size of chemical space necessitates computational approaches to automate and accelerate the design of molecular sequences to guide experimental efforts for drug discovery. Genetic algorithms provide a useful framework to incrementally generate molecules by applying mutations to known chemical structures. Recently, masked language models have been applied to automate the mutation process by leveraging large compound libraries to learn commonly occurring chemical sequences (i.e., using tokenization) and predict rearrangements (i.e., using mask prediction). Here, we consider how language models can be adapted to improve molecule generation for different optimization tasks. We use two different generation strategies for comparison, fixed and adaptive. The fixed strategy uses a pre-trained model to generate mutations; the adaptive strategy trains the language model on each new generation of molecules selected for target properties during optimization. Our results show that the adaptive strategy allows the language model to more closely fit the distribution of molecules in the population. Therefore, for enhanced fitness optimization, we suggest the use of the fixed strategy during an initial phase followed by the use of the adaptive strategy. We demonstrate the impact of adaptive training by searching for molecules that optimize both heuristic metrics, drug-likeness and synthesizability, as well as predicted protein binding affinity from a surrogate model. Our results show that the adaptive strategy provides a significant improvement in fitness optimization compared to the fixed pre-trained model, empowering the application of language models to molecular design tasks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗

Federated Deep Reinforcement Learning for Decentralized VVO of BTM DERs

The future of grid control requires a hybrid approach combining centralized and decentralized methods to fully utilize the potential of smart edge devices with artificial intelligence (AI) capabilities. This paper aims to develop and evaluate a federated deep reinforcement learning (FDRL) framework for decentralized adaptive volt-var optimization (VVO) of behind-the-meter (BTM) distributed energy resources (DERs). First, this paper models a single deep reinforcement learning (DRL) agent using the Markov Decision Process (MDP) framework for decentralized adaptive VVO of BTM DERs. Two DRL algorithms, soft actor-critic (SAC) and twin-delayed deep deterministic policy gradient (TD3), are compared for their effectiveness in optimizing VVO. Results show that TD3 outperforms SAC, achieving a 71.3% improvement in mean reward. Finally, the DRL agent is deployed within the FDRL framework, using the Flower platform, to enhance learning, provide adaptive control, and ensure data privacy for BTM DERs.

Ravi, Abhijith↗

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗