Search NASA⌕ Search

SEARCH · Search NASA

Results for “network reduction”

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 325 records · Page 18

Review of the classical methods for the determination of geodetic datums

The paper examines some of the theoretical and practical aspects of (1) the relationship between the natural (astronomic) and the geometric sets of geodetic coordinates, expressed through the parameters of the geodetic datum, and (2) the reduction of the geometric and natural observations to their appropriate reference surfaces, that is, a rotational ellipsoid and the geoid, respectively. The distinction between absolute and astrogeodetic (relative) geodetic datums is made and the chief considerations for the reduction of observations are examined. Datum transformation and network distortions are discussed on the example of North American Datum 1927.

Mueller, I. I.↗

ORRC/SAIL interface control document for SAIL OFT data tapes, revision A

The formats for all orbital flight tests magnetic tape recordings produced in the Johnson Space Center Shuttle Avionics Laboratories which are required to be processed in the orbiter data reduction complex or by the mission control center network interference processor are described.

Source record↗

Dissolving variables in connectionist combinatory logic

A connectionist system which can represent and execute combinator expressions to elegantly solve the variable binding problem in connectionist networks is presented. This system is a graph reduction machine utilizing graph representations and traversal mechanisms similar to ones described in the BoltzCONS system of Touretzky (1986). It is shown that, as combinators eliminate variables by introducing special functions, these functions can be connectionistically implemented without reintroducing variable binding. This approach 'dissolves' an important part of the variable binding problem, in that a connectionist system still has to manipulate complex data structures, but those structures and their manipulations are rendered more uniform.

Barnden, John↗

Exploring Controls on the Fluvial Breaching of Degraded Impact Craters

Many lakes on early Mars were hosted in degraded impact craters. Past work has suggested that landscape erosion and crater degradation were very active prior to the valley network (VN)-forming era on Mars. Rim relief reduction during degradation may have primed craters for subsequent inlet incision during the VN-forming era. However, not all old, rimless craters on Mars are breached, so extensive rim degradation could not have been the only control on VN inlet formation. In this study, we ask: Why were some, but not all, degraded craters breached during the VN-forming era? Here, we focus on testing whether there are any measurable distinctions between VN-breached and non-breached degraded Noachian craters.

E R Bamber↗

Quantum geometry from phase space reduction

In this work, we give an explicit isomorphism between the usual spin network basis and the direct quantization of the reduced phase space of tetrahedra. The main outcome is a formula that describes the space of SU(2) invariant states by an integral over coherent states satisfying the closure constraint exactly or, equivalently, as an integral over the space of classical tetrahedra. This provides an explicit realization of theorems by Guillemin-Sternberg and Hall that describe the commutation of quantization and reduction. In the final part of the paper, we use our result to express the Freidel-Krasnov spin foam model as an integral over classical tetrahedra, and the asymptotics of the vertex amplitude is determined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Comparing Delay-, Distance-, and Cordon-Based Congestion Pricing Strategies Via Large-Scale Simulation

This study compares the impacts of delay-, distance-, and cordon-based congestion pricing strategies for Austin, Texas, using the POLARIS agent-based activity-based travel demand simulation model. This approach enables agent-level heterogeneity and realistic choice options (including destination, mode, and activity scheduling) for dynamic traffic assignment and congestion feedbacks across a major metro region, which are features lacking in past work. To ensure comparability, distance-based tolls were set to generate the same revenue as delay-based tolling of $3.5 M/day, averaging $1.17/resident/day or $0.42/vehicle-trip. Delay-based pricing delivers 44% lower network delay and 13% lower VHT compared to the no-toll baseline, levels unmatched by other pricing strategies. At the height of the AM peak, drivers pay up to $0.13/mile on average, though most links in the network remain untolled. Distance-based pricing is the most effective at reducing VMT (by 4%), but VHT reductions (of 6%) primarily stem from drivers selecting closer destinations, achieving only one-fourth the delay reduction of delay-based pricing. Across various implementations of delay- and distance-based pricing, the results suggest that spatial variations of tolls are far more important than temporal variations. Cordon tolls produce minimal impacts at the network-wide level, but offer substantial delay reductions inside the cordon. Other major findings include: 1) delay-based pricing increases trip-making during the PM peak period due to backward shifts in discretionary-activity start times by higher-income residents; and 2) tolls’ spatial impacts, including changes in network flows and tolls paid by residents, vary substantially between delay- and distance-based pricing strategies.

Agent-based modeling↗

INTEGRATE - Inverse Network Transformations for Efficient Generation of Robust Airfoil and Turbine Enhancements

The INTEGRATE (Inverse Network Transformations for Efficient Generation of Robust Airfoil and Turbine Enhancements) project is developing a new inverse-design capability for the aerodynamic design of wind turbine rotors using invertible neural networks. This AI-based design technology can capture complex non-linear aerodynamic effects while being 100 times faster than design approaches based on computational fluid dynamics. This project enables innovation in wind turbine design by accelerating time to market through higher-accuracy early design iterations to reduce the levelized cost of energy. INVERTIBLE NEURAL NETWORKS Researchers are leveraging a specialized invertible neural network (INN) architecture along with the novel dimension-reduction methods and airfoil/blade shape representations developed by collaborators at the National Institute of Standards and Technology (NIST) learns complex relationships between airfoil or blade shapes and their associated aerodynamic and structural properties. This INN architecture will accelerate designs by providing a cost-effective alternative to current industrial aerodynamic design processes, including: - Blade element momentum (BEM) theory models: limited effectiveness for design of offshore rotors with large, flexible blades where nonlinear aerodynamic effects dominate - Direct design using computational fluid dynamics (CFD): cost-prohibitive - Inverse-design models based on deep neural networks (DNNs): attractive alternative to CFD for 2D design problems, but quickly overwhelmed by the increased number of design variables in 3D problems AUTOMATED COMPUTATIONAL FLUID DYNAMICS FOR TRAINING DATA GENERATION - MERCURY FRAMEWORK The INN is trained on data obtained using the University of Marylands (UMD) Mercury Framework, which has with robust automated mesh generation capabilities and advanced turbulence and transition models validated for wind energy applications. Mercury is a multi-mesh paradigm, heterogeneous CPU-GPU framework. The framework incorporates three flow solvers at UMD, 1) OverTURNS, a structured solver on CPUs, 2) HAMSTR, a line based unstructured solver on CPUs, and 3) GARFIELD, a structured solver on GPUs. The framework is based on Python, that is often used to wrap C or Fortran codes for interoperability with other solvers. Communication between multiple solvers is accomplished with a Topology Independent Overset Grid Assembler (TIOGA). NOVEL AIRFOIL SHAPE REPRESENTATIONS USING GRASSMAN SPACES We developed a novel representation of shapes which decouples affine-style deformations from a rich set of data-driven deformations over a submanifold of the Grassmannian. The Grassmannian representation as an analytic generative model, informed by a database of physically relevant airfoils, offers (i) a rich set of novel 2D airfoil deformations not previously captured in the data , (ii) improved low-dimensional parameter domain for inferential statistics informing design/manufacturing, and (iii) consistent 3D blade representation and perturbation over a sequence of nominal shapes. TECHNOLOGY TRANSFER DEMONSTRATION - COUPLING WITH NREL WISDEM Researchers have integrated the inverse-design tool for 2D airfoils (INN-Airfoil) into WISDEM (Wind Plant Integrated Systems Design and Engineering Model), a multidisciplinary design and optimization framework for assessing the cost of energy, as part of tech-transfer demonstration. The integration of INN-Airfoil into WISDEM allows for the design of airfoils along with the blades that meet the dynamic design constraints on cost of energy, annual energy production, and the capital costs. Through preliminary studies, researchers have shown that the coupled INN-Airfoil + WISDEM approach reduces the cost of energy by around 1% compared to the conventional design approach. This page will serve as a place to easily access all the publications from this work and the repositories for the software developed and released through this pr...

aerodynamics↗

TPSAS-NF1676L-12321-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas W Lee↗

TPSAS-NF1676L-12264-DND

The operation of some networks, such as air transportation networks, can be complicated by congestion through a small subset of nodes. The congestion may be influenced by the connectivity of the network, or by the presence of constraints restricting the flow through particular nodes. This work investigates the effects of both connectivity and node flow constraints on the operation of a network. We develop the Minimax Node Load Problem (MNLP), a multicommodity flow model which minimizes the worst-case flow through any node in a given input network. The optimal solution to this problem provides us with the minimax node load, which we propose as a measure of network congestion. Keeping the number of nodes fixed, we first increase connectivity in a series of networks, and observe that topologies with more distributed connections result in a reduction in the minimax node load. However, when connectivity is increased further, the reductions diminish and are accompanied by solutions with undesirable qualities such as longer commodity paths. We then perform a second set of experiments over the same network, constraining flow through different subsets of nodes at different magnitudes of flow restriction, finding that (1) more constrained nodes lead to the largest increases in minimax node load and (2) constraints on the most connected nodes have the greatest effect on both congestion and commodity path length.

Douglas Lee↗

Deep Neural Network Based Unsteady Flamelet Progress Variable Approach in a Supersonic Combustor

Higher dimensional flamelet manifolds are essential in capturing the coupled effects of pressure gradients and unsteady chemical kinetics observed in supersonic combustion applications. Previous studies have validated the feasibility of using deep neural networks as an alternative to computation-ally intensive multidimensional flamelet table storage and lookup. This approach has demonstrated a significant reduction in memory footprint and enabled the use of larger dimensional tabulated manifolds for supersonic combustion in canonical problems. In this study, the Unsteady Flamelet Progress Variable (UFPV)-ANN model implemented in the VULCAN-CFD code is validated by the Burrows-Kurkov supersonic mixing/combustion configuration. The well characterized experimental problem consists of hydrogen injection into a supersonic vitiated crossflow that results in a lifted flame structure. The initial model consists of a 4-dimensional table where the independent variables Z, C, Xst, P are tabulated using an unsteady flamelet code with boundary conditions corresponding to the vitiated air conditions. The results show the development of a lifted flame structure and over-all acceptable agreement with finite-rate chemistry (FRC) simulation and the experimental data. Moreover, direct mapping between the independent variables and the flamelet table is replaced by a deep neural network for significant memory reduction. The results indicate that the UFPV-ANN approach can retrieve the same solution as the memory intensive lookup table approach.

Flamelet↗

Adaptive Optimization of Aircraft Engine Performance Using Neural Networks

Preliminary results are presented on the development of an adaptive neural network based control algorithm to enhance aircraft engine performance. This work builds upon a previous National Aeronautics and Space Administration (NASA) effort known as Performance Seeking Control (PSC). PSC is an adaptive control algorithm which contains a model of the aircraft's propulsion system which is updated on-line to match the operation of the aircraft's actual propulsion system. Information from the on-line model is used to adapt the control system during flight to allow optimal operation of the aircraft's propulsion system (inlet, engine, and nozzle) to improve aircraft engine performance without compromising reliability or operability. Performance Seeking Control has been shown to yield reductions in fuel flow, increases in thrust, and reductions in engine fan turbine inlet temperature. The neural network based adaptive control, like PSC, will contain a model of the propulsion system which will be used to calculate optimal control commands on-line. Hopes are that it will be able to provide some additional benefits above and beyond those of PSC. The PSC algorithm is computationally intensive, it is valid only at near steady-state flight conditions, and it has no way to adapt or learn on-line. These issues are being addressed in the development of the optimal neural controller. Specialized neural network processing hardware is being developed to run the software, the algorithm will be valid at steady-state and transient conditions, and will take advantage of the on-line learning capability of neural networks. Future plans include testing the neural network software and hardware prototype against an aircraft engine simulation. In this paper, the proposed neural network software and hardware is described and preliminary neural network training results are presented.

Simon, Donald L.↗

From electricity to fuels: Descriptors for C 1 selectivity in electrochemical CO 2 reduction

Electrochemical reduction of carbon dioxide (CO 2 RR) over transition metals follows a complex reaction network. Here, we combine observations from experimental literature with a theoretical analysis of energetics to rationalize that not all intermediates in the reduction of CO 2 are formed through direct protonation steps. We derive a selectivity map for two-electron products (carbon monoxide (CO) and formate) on pure metal surfaces using only the CO and OH binding energies as descriptors. For the pure metals that are selective towards CO formation, the variation of the CO binding energy is sufficient to further subdivide the map into domains that predominantly form H 2 , CO, and more reduced products. Our analysis rationalizes experimentally observed product distributions in CO 2 RR across pure metal systems. Overall, we highlight the need for additional material screening descriptors for CO 2 R and the importance of considering competition from the elementary steps of the hydrogen evolution reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Compensation of Anisotropy in Spin Hall Devices for Neuromorphic Applications

Spintronic nano-oscillators and diodes with reduced nonlinearity benefit from low phase noise and improved device properties. Moreover, they could offer key advantages for realizing neuromorphic applications, such as spike-based neurons and frequency multiplexing in neural networks. Here, in this work, we experimentally demonstrate the reduction in nonlinearity of a spin Hall nano-oscillator (SHNO) by compensation of its effective magnetic anisotropy. The study involves optimization of Co/Ni multilayer growth to achieve the compensation, followed by spin-diode measurements on patterned microstrips to quantify their anisotropy. The relationship between the second- (H k 2 = 0.47 mT) and first-order ($H^{eff}_{k_1}$ = -0.8 mT) anisotropy fields reveals the existence of an easy cone, thereby validating the presence of compensation. Furthermore, we demonstrate a compensated spin diode that has a fixed frequency when the input power is varied. We then study the current-induced auto-oscillation properties of SHNOs on compensated films by patterning nanoconstrictions of 200 and 100 nm wide. The invariance of the resonance frequency and linewidth of the compensated SHNO with applied dc current indicates the absence of nonlinearity. This independence is maintained irrespective of the applied external fields and their orientations. The compensated SHNO obtained has a linewidth of 1.1 MHz and a peak output power of up to 1 pW/MHz.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Effectiveness and predictability of in-network storage cache for Scientific Workflows

Large scientific collaborations often have multiple scientists accessing the same set of files while doing different analyses, which create repeated accesses to the large amounts of shared data located far away. These data accesses have long latency due to distance and occupy the limited bandwidth available over the wide-area network. To reduce the wide-area network traffic and the data access latency, regional data storage caches have been installed as a new networking service. To study the effectiveness of such a cache system in scientific applications, we examine the Southern California Petabyte Scale Cache for a high-energy physics experiment. By examining about 3TB of operational logs, we show that this cache removed 67.6% of file requests from the wide-area network and reduced the traffic volume on wide-area network by 12. 3TB (or 35.4%) an average day. The reduction in the traffic volume (35.4%) is less than the reduction in file counts (67.6%) because the larger files are less likely to be reused. Due to this difference in data access patterns, the cache system has implemented a policy to avoid evicting smaller files when processing larger files. We also build a machine learning model to study the predictability of the cache behavior. Tests show that this model is able to accurately predict the cache accesses, cache misses, and network throughput, making the model useful for future studies on resource provisioning and planning.

Sim, Caitlin↗

Accurate and Accelerated Neuromorphic Network Design Leveraging A Bayesian Hyperparameter Pareto Optimization Approach

Neuromorphic systems allow for extremely efficient hardware implementations for neural networks (NNs). In recent years, several algorithms have been presented to train spiking NNs (SNNs) for neuromorphic hardware. However, SNNs often provide lower accuracy than their artificial NNs (ANNs) counterparts or require computationally expensive and slow training/inference methods. To close this gap, designers typically rely on reconfiguring SNNs through adjustments in the neuron/synapse model or training algorithm itself. Nevertheless, these steps incur significant design time, while still lacking the desired improvement in terms of training/inference times (latency). Designing SNNs that can mimic the accuracy of ANNs with reasonable training times is an exigent challenge in neuromorphic computing. In this work, we present an alternative approach that looks at such designs as an optimization problem rather than algorithm or architecture redesign. We develop a versatile multiobjective hyperparameter optimization (HPO) for automatically tuning HPs of two state-of-the-art SNN training algorithms, SLAYER and HYBRID. We emphasize that, to the best of our knowledge, this is the first work trying to improve SNNs’ computational efficiency, accuracy, and training time using an efficient HPO. We demonstrate significant performance improvements for SNNs on several datasets without the need to redesign or invent new training algorithms/architectures. Our approach results in more accurate networks with lower latency and, in turn, higher energy efficiency than previous implementations. In particular, we demonstrate improvement in accuracy and more than 5× reduction in the training/inference time for the SLAYER algorithm on the DVS Gesture dataset. In the case of HYBRID, we demonstrate 30% reduction in timesteps while surpassing the accuracy of the state-of-the-art networks on CIFAR10. Further, our analysis suggests that even a seemingly minor change in HPs could change the accuracy by 5 - 6×.

Parsa, Maryam↗

Thermal conductivity in Bi 0.5 Sb 1.5 Te 3+ x and the role of dense dislocation arrays at grain boundaries

Several prominent mechanisms for reduction in thermal conductivity have been shown in recent years to improve the figure of merit for thermoelectric materials. Such a mechanism is a hierarchical all-length-scale architecturing that recognizes the role of all microstructure elements, from atomic to nano to microscales, in reducing (lattice) thermal conductivity. In this context, there have been recent claims of remarkably low (lattice) thermal conductivity in Bi 0.5 Sb 1.5 Te 3 that are attributed to seemingly ordinary grain boundary dislocation networks. These high densities of dislocation networks in Bi 0.5 Sb 1.5 Te 3 were generated via unconventional materials processing with excess Te (which formed liquid phase, thereby facilitating sintering), followed by spark plasma sintering under pressure to squeeze out the liquid. We reproduced a practically identical microstructure, following practically identical processing strategies, but with noticeably different (higher) thermal conductivity than that claimed before. We show that the resultant microstructure is anisotropic, with notable difference of thermal and charge transport properties across and along two orthonormal directions, analogous to anisotropic crystals. Thus, we believe that grain boundary dislocation networks are not the primary cause of enhanced ZT through reduction in thermal conductivity. Instead, we can reproduce the purported high ZT through a favorable but impractical and incorrect combination of thermal conductivity measured along the pressing direction of anisotropy while charge transport measured in the direction perpendicular to the anisotropic direction. We believe that our work underscores the need for consistency in charge and thermal transport measurements for unified and verifiable measurements of thermoelectric (and related) properties and phenomena.

36 MATERIALS SCIENCE↗

Ethernet for Space Flight Applications

NASA's Goddard Space Flight Center (GSFC) is adapting current data networking technologies to fly on future spaceflight missions. The benefits of using commercially based networking standards and protocols have been widely discussed and are expected to include reduction in overall mission cost, shortened integration and test (I&T) schedules, increased operations flexibility, and hardware and software upgradeability/scalability with developments ongoing in the commercial world. The networking effort is a comprehensive one encompassing missions ranging from small University Explorer (UNEX) class spacecraft to large observatories such as the Next Generation Space Telescope (NGST). Mission aspects such as flight hardware and software, ground station hardware and software, operations, RF communications, and security (physical and electronic) are all being addressed to ensure a complete end-to-end system solution. One of the current networking development efforts at GSFC is the SpaceLAN (Spacecraft Local Area Network) project, development of a space-qualifiable Ethernet network. To this end we have purchased an IEEE 802.3-compatible 10/100/1000 Media Access Control (MAC) layer Intellectual Property (IP) core and are designing a network node interface (NNI) and associated network components such as a switch. These systems will ultimately allow the replacement of the typical MIL-STD-1553/1773 and custom interfaces that inhabit most spacecraft. In this paper we will describe our current Ethernet NNI development along with a novel new space qualified physical layer that will be used in place of the standard interfaces. We will outline our plans for development of space qualified network components that will allow future spacecraft to operate in significant radiation environments while using a single onboard network for reliable commanding and data transfer. There will be a brief discussion of some issues surrounding system implications of a flight Ethernet. Finally, we will show an onboard network architecture for a proposed new mission using Ethernet for science data transport.

Webb, Evan↗

Strut Shaping of 34m Beam Waveguide Antenna for Reductions in Near-Field RF and Noise Temperature

Strut shaping of NASA's Deep Space Network (DSN) 34m Beam Waveguide (BWG) antenna has been implemented to reduce near-field RF exposure while improving the antenna noise temperature. Strut shaping was achieved by introducing an RF shield that does not compromise the structural integrity of the existing antenna. Reduction in the RF near-field level will compensate for the planned transmit power increase of the antenna from 20 kW to 80 kW while satisfying safety requirements for RF exposure. Measured antenna noise temperature was also improved by as much as 1.5 K for the low elevation angles and 0.5 K in other areas.

near-field↗