Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random networks”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Ion beam deposition of amorphous carbon films with diamond like properties

Carbon films were deposited on silicon, quartz, and potassium bromide substrates from an ion beam. Growth rates were approximately 0.3 micron/hour. The films were featureless and amorphous and contained only carbon and hydrogen in significant amounts. The density and carbon/hydrogen ratio indicate the film is a hydrogen deficient polymer. One possible structure, consistent with the data, is a random network of methylene linkages and tetrahedrally coordinated carbon atoms.

Angus, John C.↗
NASA NTRS1991

Remote sensing of earth terrain

Abstracts from 46 refereed journal and conference papers are presented for research on remote sensing of earth terrain. The topics covered related to remote sensing include the following: mathematical models, vegetation cover, sea ice, finite difference theory, electromagnetic waves, polarimetry, neural networks, random media, synthetic aperture radar, electromagnetic bias, and others.

Kong, Jin AU↗
NASA NTRS1990

Distributed memory approaches for robotic neural controllers

The suitability is explored of two varieties of distributed memory neutral networks as trainable controllers for a simulated robotics task. The task requires that two cameras observe an arbitrary target point in space. Coordinates of the target on the camera image planes are passed to a neural controller which must learn to solve the inverse kinematics of a manipulator with one revolute and two prismatic joints. Two new network designs are evaluated. The first, radial basis sparse distributed memory (RBSDM), approximates functional mappings as sums of multivariate gaussians centered around previously learned patterns. The second network types involved variations of Adaptive Vector Quantizers or Self Organizing Maps. In these networks, random N dimensional points are given local connectivities. They are then exposed to training patterns and readjust their locations based on a nearest neighbor rule. Both approaches are tested based on their ability to interpolate manipulator joint coordinates for simulated arm movement while simultaneously performing stereo fusion of the camera data. Comparisons are made with classical k-nearest neighbor pattern recognition techniques.

Jorgensen, Charles C.↗
NASA NTRS2001

Multifunctional Carbon Foams for Aerospace Applications

Carbon foams produced by the controlled thermal decomposition of inexpensive coal extracts exhibit a combination of structural and thermal properties that make them attractive for aerospace applications. Their thermal conductivity can be tailored between 0.5 and 100 W/mK through precursor selection/modification and heat treatment conditions; thus, they can serve in either thermal protection or heat transfer systems such as heat exchangers. Because their structure is essentially a 3D random network of graphite-like members, they also can be considered low-cost, easily fabricated replacements for multi-directional structural carbon fiber preforms. Strengths of over 4000 psi in compression are common. Their density can be designed between 0.1 and 0.8 g/cc, and they can be impregnated with a variety of matrices or used, unfilled, in sandwich structures. These foams also exhibit intriguing electrochemical properties that offer potential in high-efficiency fuel cell and battery applications, mandrels and tooling for composite manufacture, ablative performance, and fire resistance. This paper presents the results of research conducted under NASA SBIR Topic 99.04.01, General Aviation Technology, supported from Langley Research Center. The potential of foam design through precursor selection, cell size and density control, density grading, and heat treatment is demonstrated.

Rogers, D. K.↗
NASA NTRS1993

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↗
DOE OSTI2021

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices H=\langle H\rangle +\delta H H = ⟨ H ⟩ + δ H , with \langle H\rangle ⟨ H ⟩ rank- 1 1 and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Advancements on Multi-Fidelity Random Fourier Neural Networks: Application to Hurricane Modeling for Wind Energy

Multi-fidelity approaches are emerging as effective strategies in computational science to handle otherwise intractable tasks like Uncertainty Quantification (UQ), training of Machine Learning (ML) models, and optimization, for expensive high-fidelity applications in which the amount of available simulations or data is limited. The main idea is simple: large datasets generated for low-fidelity approximations of the problem at hand are fused with a much sparser dataset for the target (high-fidelity) system. In this paper, we build on our recent success in designing random Fourier Neural Networks (rFNNs) [1] to target problems arising in wind energy applications and in particular problems of interest for hurricane modeling. In this context, data for the high-fidelity models are limited and lower fidelity alternatives are needed. In this work, we introduce a novel multi-fidelity training approach for our rFNNs and demonstrate its use on a simple verification problem and on a hurricane modeling problem in which high-fidelity data are generated via Large-Eddy Simulations (LES), while low-fidelity data are given by a mesoscale model. Initial results demonstrate how the multi-fidelity training approach can improve the quality of the resulting surrogate.

Fourier Neural Networks↗
DOE OSTI2022

Differentially Private Synthesis and Sharing of Network Data Via Bayesian Exponential Random Graph Models

Abstract Network data often contain sensitive relational information. One approach to protecting sensitive information while offering flexibility for network analysis is to share synthesized networks based on the information in originally observed networks. We employ differential privacy (DP) and exponential random graph models (ERGMs) and propose the DP-ERGM method to synthesize network data. We apply DP-ERGM to two real-world networks. We then compare the utility of synthesized networks generated by DP-ERGM, the DyadWise Randomized Response (DWRR) approach, and the Synthesis through Conditional distribution of Edge given nodal Attribute (SCEA) approach. In general, the results suggest that DP-ERGM preserves the original information significantly better than two other approaches in network structural statistics and inference for ERGMs and latent space models. Furthermore, DP-ERGM satisfies node DP through modeling the global network structure with ERGM, a stronger notion of privacy than the edge DP under which DWRR and SCEA operate.

graph synthesis↗
DOE OSTI2022

Holevo information and ensemble theory of gravity

Holevo information is an upper bound for the accessible classical information of an ensemble of quantum states. In this work, we use Holevo information to investigate the ensemble theory interpretation of quantum gravity. We study the Holevo information in random tensor network states, where the random parameters are the random tensors at each vertex. Based on the results in random tensor network models, we propose a conjecture on the holographic bulk formula of the Holevo information in the gravity case. As concrete examples of holographic systems, we compute the Holevo information in the ensemble of thermal states and thermo-field double states in the Sachdev-Ye-Kitaev model. The results are consistent with our conjecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1990

Random access to mobile networks with advanced error correction

A random access scheme for unreliable data channels is investigated in conjunction with an adaptive Hybrid-II Automatic Repeat Request (ARQ) scheme using Rate Compatible Punctured Codes (RCPC) Forward Error Correction (FEC). A simple scheme with fixed frame length and equal slot sizes is chosen and reservation is implicit by the first packet transmitted randomly in a free slot, similar to Reservation Aloha. This allows the further transmission of redundancy if the last decoding attempt failed. Results show that a high channel utilization and superior throughput can be achieved with this scheme that shows a quite low implementation complexity. For the example of an interleaved Rayleigh channel and soft decision utilization and mean delay are calculated. A utilization of 40 percent may be achieved for a frame with the number of slots being equal to half the station number under high traffic load. The effects of feedback channel errors and some countermeasures are discussed.

Dippold, Michael↗
DOE OSTI2023

Emulating aerosol optics with randomly generated neural networks

Abstract. Atmospheric aerosols have a substantial impact on climate and remain one of the largest sources of uncertainty in climate prediction. Accurate representation of their direct radiative effects is a crucial component of modern climate models. However, direct computation of the radiative properties of aerosol populations is far too computationally expensive to perform in a climate model, so optical properties are typically approximated using a parameterization. This work develops artificial neural networks (ANNs) capable of replacing the current aerosol optics parameterization used in the Energy Exascale Earth System Model (E3SM). A large training dataset is generated by using Mie code to directly compute the optical properties of a range of atmospheric aerosol populations given a large variety of particle sizes, wavelengths, and refractive indices. Optimal neural architectures for shortwave and longwave bands are identified by evaluating ANNs with randomly generated wirings. Randomly generated deep ANNs are able to outperform conventional multilayer-perceptron-style architectures with comparable parameter counts. Finally, the ANN-based parameterization produces significantly more accurate bulk aerosol optical properties than the current parameterization when compared with direct Mie calculations using mean absolute error. The success of this approach makes possible the future inclusion of much more sophisticated representations of aerosol optics in climate models that cannot be captured by extension of the existing parameterization scheme and also demonstrates the potential of random-wiring-based neural architecture search in future applications in the Earth sciences.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Constrained Deep Reinforcement Learning for Energy Sustainable Multi-UAV Based Random Access IoT Networks With NOMA

In this paper, we apply the Non-Orthogonal Multiple Access (NOMA) technique to improve the massive channel access of a wireless IoT network where solar-powered Unmanned Aerial Vehicles (UAVs) relay data from IoT devices to remote servers. Specifically, IoT devices contend for accessing the shared wireless channel using an adaptive p-persistent slotted Aloha protocol; and the solar-powered UAVs adopt Successive Interference Cancellation (SIC) to decode multiple received data from IoT devices to improve access efficiency. To enable an energy-sustainable capacity-optimal network, we study the joint problem of dynamic multi-UAV altitude control and multi-cell wireless channel access management of IoT devices as a stochastic control problem with multiple energy constraints. We first formulate this problem as a Constrained Markov Decision Process (CMDP), and propose an online model-free Constrained Deep Reinforcement Learning (CDRL) algorithm based on Lagrangian primal-dual policy optimization to solve the CMDP. Extensive simulations demonstrate that our proposed algorithm learns a cooperative policy in which the altitude of UAVs and channel access probability of IoT devices are dynamically controlled to attain the maximal long-term network capacity while ensuring energy sustainability of UAVs, outperforming baseline schemes. The proposed CDRL agent can be trained on a small network, yet the learned policy can efficiently manage networks with a massive number of IoT devices and varying initial states, which can amortize the cost of training the CDRL agent.

42 ENGINEERING↗
NASA NTRS1983

Performance of a random access packet network with time-capture capability

The Joint Tactical Information Distribution System (JTIDS) is applied to a digital network supporting the command, control and communication requirements of 105 highly mobile users. User data traffic is bursty and the slotted ALOHA channel access scheme is therefore employed. This paper focuses on the determination of JTIDS system performance in this particular application. Emphasis is directed at the specific time-capture capability of JTIDS. Significant system performance parameters are quantified with analysis and simulation.

Lin, Y. H.↗