Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distribution network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,783 records · Page 99

Langley advanced real-time simulation (ARTS) system

A system of high-speed digital data networks was developed and installed to support real-time flight simulation at the NASA Langley Research Center. This system, unlike its predecessor, employs intelligence at each network node and uses distributed 10-V signal conversion equipment rather than centralized 100-V equipment. A network switch, which replaces an elaborate system of patch panels, allows the researcher to construct a customized network from the 25 available simulation sites by invoking a computer control statement. The intent of this paper is to provide a coherent functional description of the system. This development required many significant innovations to enhance performance and functionality such as the real-time clock, the network switch, and improvements to the CAMAC network to increase both distances to sites and data rates. The system has been successfully tested at a usable data rate of 24 M. The fiber optic lines allow distances of approximately 1.5 miles from switch to site. Unlike other local networks, CAMAC does not buffer data in blocks. Therefore, time delays in the network are kept below 10 microsec total. This system underwent months of testing and was put into full service in July 1987.

Crawford, Daniel J.↗

Quantum Networks: A New Platform for Aerospace

The ability to distribute entanglement between quantum nodes may unlock new capabilities in the future that include teleporting information across multinode networks, higher resolution detection via entangled sensor arrays, and measurements beyond the quantum limit enabled by networked atomic clocks. These new quantum networks also hold promise for the Aerospace community in areas such as deep space exploration, improved satellite communication, and synchronizing drone swarms. Although exciting, these applications are a long way off from providing a “real-world” benefit, as they have only been theoretically explored or demonstrated in small-scale experiments. An outstanding challenge is to identify near-term use cases for quantum networks; this may be an intriguing new area of interest for the aerospace community, as the quantum networking field would benefit from more multidisciplinary collaborations. This paper introduces quantum networking, discusses the difficulties in distributing entanglement within these networks, highlights recent progress toward this endeavor, and features two current case studies on mobile quantum nodes and an entangled clock network, both of which are relevant to the aerospace community.

Engineering↗

User Manual - HydraGNN v5.0: Distributed Implementation of Multi-Tasking Graph Neural Networks

This document serves as the user manual for HydraGNN v5.0, a scalable graph neural network (GNN) architecture for simultaneous prediction of multiple target properties using multi-task learning (MTL). This version of HydraGNN has been developed primarily to support the development, training, and deployment of predictive graph-based deep learning (DL) models for atomistic materials modeling. HydraGNN is templated over 13 message-passing policies, including invariant models (GIN, PNA, PNAPlus, GAT, MFC, CGCNN, SAGE, SchNet, DimeNet) and equivariant models (EGNN, PNAEq, PAINN, MACE), and supports distributed training via distributed data parallelism (DDP), DeepSpeed, and Fully Sharded Data Parallelism (FSDP) on leadership-class supercomputers. Although HydraGNN can be applied to problems beyond atomistic materials modeling, its current use is confined to homogeneous graphs. Additional capabilities include machine-learned interatomic potentials with energy-conserving forces, General, Powerful, and Scalable Graph Transformer (GraphGPS) global attention, periodic boundary conditions, hyperparameter optimization, mixed-precision training, and uncertainty quantification.

97 MATHEMATICS AND COMPUTING↗

FeederGAN: Synthetic Feeder Generation via Deep Graph Adversarial Nets

This paper presents a novel, automated, generative adversarial networks (GAN) based synthetic feeder generation mechanism, abbreviated as FeederGAN. FeederGAN digests real feeder models represented by directed graphs via a deep learning framework powered by GAN and graph convolutional networks (GCN). Information of a distribution feeder circuit is extracted from its model input files so that the device connectivity is mapped onto the adjacency matrix and the device characteristics, such as circuit types (i.e., 3-phase, 2-phase, and 1-phase) and component attributes (e.g., length and current ratings), are mapped onto the attribute matrix. Then, Wasserstein distance is used to optimize the GAN and GCN is used to discriminate the generated graphs from the actual ones. A greedy method based on graph theory is developed to reconstruct the feeder using the generated adjacency and attribute matrices. Furthermore, our results show that the GAN generated feeders resemble the actual feeder in both topology and attributes verified by visual inspection and by empirical statistics obtained from actual distribution feeders.

42 ENGINEERING↗

Rotational modulation of the chromospheric activity in Chi(1) Orionis (G0 V)

The age and rotation period of the solar type star Chi(1) Ori recommend it for a rotational modulation study of its strong UV emission lines. IUE observations have accordingly been made at four different phases during each of three separate rotation cycles, over a time span of 325 days. C IV, He II, and Mg II observations are consistent with a uniform spatial distribution and brightness for the Mg II emission network, and a more complex distribution of the regions producing the UV transmission region emission. Alternatively, if the area coverage of the chromospheric and transition region emission is nearly identical, the surface brightness contrast between stellar active regions and normal ones must increase by almost an order of magnitude in the higher temperature lines.

Simon, T.↗

So ware-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements

High-performance scientific work flows utilize supercomputers, scientific instruments, and large storage systems. Their executions require fast setup of a small number of dedicated network connections across the geographically distributed facility sites. We present Software-Defined Network (SDN) solutions consisting of site daemons that use dpctl, Floodlight, ONOS, or OpenDaylight controllers to set up these connections. The development of these SDN solutions could be quite disruptive to the infrastructure, while requiring a close coordination among multiple sites; in addition, the large number of possible controller and device combinations to investigate could make the infrastructure unavailable to regular users for extended periods of time. In response, we develop a Virtual Science Network Environment (VSNE) using virtual machines, Mininet, and custom scripts that support the development, testing, and evaluation of SDN solutions, without the constraints and expenses of multi-site physical infrastructures; furthermore, the chosen solutions can be directly transferred to production deployments. By complementing VSNE with a physical testbed, we conduct targeted performance tests of various SDN solutions to help choose the best candidates. In addition, we propose a switching response method to assess the setup times and throughput performances of different SDN solutions, and present experimental results that show their advantages and limitations.

Settlemyer, Bradley↗

Method and apparatus for distributed intrusion protection system for ultra high bandwidth networks

A method for providing security to a network having a data stream with a plurality of portions of data, each having differing levels of sensitivity. The data stream is interrogated to determine the presence of predetermined characteristics associated with at least one of the portions of data within the data stream. At least one of the portions of data is then characterized, based upon the portion of data exhibiting a predetermined combination of characteristics, wherein the predetermined combination of characteristics is related to the sensitivity of the portion of data. The portions of the data stream are then distributed into a plurality of different channels, each of the channels associated with different level of sensitivity.

97 MATHEMATICS AND COMPUTING↗

The velocity dispersion of the caustic network due to random motion of individual stars in the lensing galaxy

We present a method of computing the velocity distribution of the caustic network due to the random motion of stars in the lensing galaxy. This method is illustrated on the example of the two-point mass lens and then applied to a large sample of stars. We conclude that the proper motion of the stars increases significantly the frequency of the high magnification events in comparison with a static lens configuration with constant stream or constant bulk velocity. The stream velocity is the velocity of the star field relative to the global bulk velocity of the galaxy. We show that the global bulk and the stream velocity of the star field have to be considered separately for any microlensing situation. The higher the surface mass density of the stars in the lensing galaxy, the higher the influence of proper motion of stars on the statistics of high magnification events. The influence of a Gaussian velocity distribution of the stars in the lensing galaxy compared with a constant stream velocity of the stars increases the number of high magnification events by a factor 1.30 +/- 0.06 for a normalized surface density of the stars cr = 0.1 and by a factor 1.7 +/- 0.1 for sigma = 0.5. This means that for some microlensing situations the proper motion of the stars in a lensing galaxy has to be considered for exact microlensing predictions.

Kundik, Tomislav↗

A Fairness-based Distributed Energy Coordination for Voltage Regulation in Distribution Systems

The rapid adoption of photovoltaic (PV) systems combined with falling prices of energy storage is paving the way for a future in which customers could locally supply their energy needs and export surplus power to the grid. However, reverse power flow from multiple sites in a network can cause overvoltage that decreases system reliability and the utilization level of PV system. In this paper, we present a two-stage approach to solve the energy coordination problem in distribution networks. In the first stage, a household with PV and energy storage is optimized to allow customers to adopt different control strategies such as load following and tariff arbitrage. We show that such customer-led control strategies can cause reverse power flows during peak PV generation periods, thus resulting in overvoltage. In such cases, the second stage of the proposed approach is called upon to solve a fairness-based energy coordination problem that can maintain voltages within limits while maximizing the PV generation while fairly distributing the actions among all the PV systems. As a result, each of the resources in the network has equal opportunity to export power and shares the responsibility of voltage regulation. Simulation studies have been carried out on the IEEE 13-bus test feeder to verify the effectiveness of the proposed approach.

Distributed energy resources, fairness, overvoltag↗

Search for tt-bar-Resonances in the Lepton+Jets Final State

A search for a narrow-width heavy resonance decaying into top quark pairs (X{yields}tt-bar) in pp-bar collisions at {radical}(s) = 1.96 TeV has been performed using data collected with the DOe detector at the Fermilab Tevatron Collider. This analysis considers tt-bar candidate events in the lepton+jets channel using a neural network tagger to identify b-jets and the tt-bar invariant mass distribution to search for evidence of resonant production. The analyzed dataset corresponds to an integrated luminosity of approximately 2.1 fb{sup -1}. We find no evidence for a narrow resonance X decaying to tt-bar. Therefore, we set upper limits on {sigma}{sub X}{center_dot}B(X{yields}tt-bar) for different hypothesized resonance masses using a Bayesian approach. Within a topcolor-assisted technicolor model, the existence of a leptophobic Z' boson with mass M{sub Z'}<760 GeV and width {gamma}{sub Z'} = 0.012M{sub Z'} can be excluded at 95% C.L.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗

Stochastic Optimal Power Flow Based on Data-Driven Distributionally Robust Optimization

We propose a data-driven method to solve a stochastic optimal power flow (OPF) problem based on limited information about forecast error distributions. The objective is to determine power schedules for controllable devices in a power network to balance operational cost and conditional value-at-risk (CVaR) of device and network constraint violations. These decisions include scheduled power output adjustments and reserve policies, which specify planned reactions to forecast errors in order to accommodate fluctuating renewable energy sources. Instead of assuming the uncertainties across the networks follow prescribed probability distributions, we assume the distributions are only observable through a finite training dataset. By utilizing the Wasserstein metric to quantify differences between the empirical data-based distribution and the real data-generating distribution, we formulate a distributionally robust optimization OPF problem to search for power schedules and reserve policies that are robust to sampling errors inherent in the dataset. A multi-stage closed-loop control strategy based on model predictive control (MPC) is also discussed. A simpIe numerical example illustrates inherent tradeoffs between operational cost and risk of constraint violation, and we show how our proposed method offers a data-driven framework to balance these objectives.

24 POWER TRANSMISSION AND DISTRIBUTION↗

The PAU Survey: Photometric redshifts using transfer learning from simulations

In this paper, we introduce the DEEPZ deep learning photometric redshift (photo-z) code. As a test case, we apply the code to the PAU survey (PAUS) data in the COSMOS field. DEEPZ reduces the σ68 scatter statistic by 50 percent at iAB = 22.5 compared to existing algorithms. This improvement is achieved through various methods, including transfer learning from simulations where the training set consists of simulations as well as observations, which reduces the need for training data. The redshift probability distribution is estimated with a mixture density network (MDN), which produces accurate redshift distributions. Our code includes an autoencoder to reduce noise and extract features from the galaxy SEDs. It also benefits from combining multiple networks, which lowers the photo-z scatter by 10 percent. Furthermore, training with randomly constructed coadded fluxes adds information about individual exposures, reducing the impact of photometric outliers. In addition to opening up the route for higher redshift precision with narrow bands, these machine learning techniques can also be valuable for broad-band surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

New Angle on the Parton Distribution Functions: Self-Organizing Maps

Neural network (NN) algorithms have been recently applied to construct Parton Distribution Function (PDF) parametrizations, providing an alternative to standard global fitting procedures. Here we explore a novel technique using Self-Organizing Maps (SOMs). SOMs are a class of clustering algorithms based on competitive learning among spatially-ordered neurons. We train our SOMs with stochastically generated PDF samples. On every optimization iteration the PDFs are clustered on the SOM according to a user-defined feature and the most promising candidates are used as a seed for the subsequent iteration using the topology of the map to guide the PDF generating process. Our goal is a fitting procedure that, at variance with the standard neural network approaches, will allow for an increased control of the systematic bias by enabling user interaction in the various stages of the process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗

NASA's Next Generation Space Geodesy Program

Requirements for the ITRF have increased dramatically since the 1980s. The most stringent requirement comes from critical sea level monitoring programs: a global accuracy of 1.0 mm, and 0.1mm/yr stability, a factor of 10 to 20 beyond current capability. Other requirements for the ITRF coming from ice mass change, ground motion, and mass transport studies are similar. Current and future satellite missions will have ever-increasing measurement capability and will lead to increasingly sophisticated models of these and other changes in the Earth system. Ground space geodesy networks with enhanced measurement capability will be essential to meeting the ITRF requirements and properly interpreting the satellite data. These networks must be globally distributed and built for longevity, to provide the robust data necessary to generate improved models for proper interpretation of the observed geophysical signals. NASA has embarked on a Space Geodesy Program with a long-range goal to build, deploy and operate a next generation NASA Space Geodetic Network (SGN). The plan is to build integrated, multi-technique next-generation space geodetic observing systems as the core contribution to a global network designed to produce the higher quality data required to maintain the Terrestrial Reference Frame and provide information essential for fully realizing the measurement potential of the current and coming generation of Earth Observing spacecraft. Phase 1 of this project has been funded to (1) Establish and demonstrate a next-generation prototype integrated Space Geodetic Station at Goddard's Geophysical and Astronomical Observatory (GGAO), including next-generation SLR and VLBI systems along with modern GNSS and DORIS; (2) Complete ongoing Network Design Studies that describe the appropriate number and distribution of next-generation Space Geodetic Stations for an improved global network; (3) Upgrade analysis capability to handle the next-generation data; (4) Implement a modern survey system to measure inter-technique vectors for co-location; and (5) Develop an Implementation Plan to build, deploy and operate a next-generation integrated NASA SGN that will serve as NASA's contribution to the international global geodetic network. An envisioned Phase 2 (which is not currently funded) would include the replication of up to ten such stations to be deployed either as integrated units or as a complement to already in-place components provided by other organizations. This talk will give an update on the activities underway and the plans for completion.

Merkowitz, S. M.↗