Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network baseline”

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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Determination of Earth rotation by the combination of data from different space geodetic systems

Formerly, Earth Rotation Parameters (ERP), i.e., polar motion and UTI-UTC values, have been determined using data from only one observational system at a time, or by the combination of parameters previously obtained in such determinations. The question arises as to whether a simultaneous solution using data from several sources would provide an improved determination of such parameters. To pursue this reasoning, fifteen days of observations have been simulated using realistic networks of Lunar Laser Ranging (LLR), Satellite Laser Ranging (SLR) to Lageos, and Very Long Baseline Interferometry (VLBI) stations. A comparison has been done of the accuracy and precision of the ERP obtained from: (1) the individual system solutions, (2) the weighted means of those values, (3) all of the data by means of the combination of the normal equations obtained in 1, and (4) a grand solution with all the data. These simulations show that solutions done by the normal equation combination and grand solution methods provide the best or nearly the best ERP for all the periods considered, but that weighted mean solutions provide nearly the same accuracy and precision. VLBI solutions also provide similar accuracies.

Archinal, Brent Allen↗
NASA NTRS1994

Time and position accuracy using codeless GPS

The Global Positioning System has allowed scientists and engineers to make measurements having accuracy far beyond the original 15 meter goal of the system. Using global networks of P-Code capable receivers and extensive post-processing, geodesists have achieved baseline precision of a few parts per billion, and clock offsets have been measured at the nanosecond level over intercontinental distances. A cloud hangs over this picture, however. The Department of Defense plans to encrypt the P-Code (called Anti-Spoofing, or AS) in the fall of 1993. After this event, geodetic and time measurements will have to be made using codeless GPS receivers. However, there appears to be a silver lining to the cloud. In response to the anticipated encryption of the P-Code, the geodetic and GPS receiver community has developed some remarkably effective means of coping with AS without classified information. We will discuss various codeless techniques currently available and the data noise resulting from each. We will review some geodetic results obtained using only codeless data, and discuss the implications for time measurements. Finally, we will present the status of GPS research at JPL in relation to codeless clock measurements.

Dunn, C. E.↗
NASA NTRS2005

Clocks and timing in the NASA Deep Space Network

A new timing system has been developed for the NASA Deep Space Network (DSN) and is currently in the final stages of integration, testing and implementation in all three DSN sites. The DSN is a distributed antenna network for deep space communication, whose facilities are continuously engaged in spacecraft tracking, Very Long Baseline Interferometry (VLBI) or Radio Astronomy activities. Its primary components consist of three Deep Space Communication Centers (DSCC) separated nearly equidistant around the Earth in California, USA; Spain; and Australia. Within each DSCC, synchronized, low jitter timing signals must be distributed to many users over distances of up to 30 kilometers. The design criteria for the timing system required state of the art stability and jitter performance, but also extremely high operability and reliability. This paper describes some of the key features and recent system performance data as measured both in the laboratory and the operational DSN.

clocks↗
NASA NTRS2006

Digital Front End for Wide-Band VLBI Science Receiver

An upgrade to the very-long-baseline-interferometry (VLBI) science receiver (VSR) a radio receiver used in NASA's Deep Space Network (DSN) is currently being implemented. The current VSR samples standard DSN intermediate- frequency (IF) signals at 256 MHz and after digital down-conversion records data from up to four 16-MHz baseband channels. Currently, IF signals are limited to the 265-to-375-MHz range, and recording rates are limited to less than 80 Mbps. The new digital front end, denoted the Wideband VSR, provides improvements to enable the receiver to process wider bandwidth signals and accommodate more data channels for recording. The Wideband VSR utilizes state-of-the-art commercial analog-to-digital converter and field-programmable gate array (FPGA) integrated circuits, and fiber-optic connections in a custom architecture. It accepts IF signals from 100 to 600 MHz, sampling the signal at 1.28 GHz. The sample data are sent to a digital processing module, using a fiber-optic link for isolation. The digital processing module includes boards designed around an Advanced Telecom Computing Architecture (ATCA) industry-standard backplane. Digital signal processing implemented in FPGAs down-convert the data signals in up to 16 baseband channels with programmable bandwidths from 1 kHz to 16 MHz. Baseband samples are transmitted to a computer via multiple Ethernet connections allowing recording to disk at rates of up to 1 Gbps.

Jongeling, Andre↗
DOE OSTI2025

Dynamic Low-Rank Training with Spectral Regularization: Achieving Robustness in Compressed Representations

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94\% compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2025

Dynamical Low-Rank Compression of Neural Networks with Robustness under Adversarial Attacks

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94 compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
NASA NTRS1980

Geodetic measurements with a mobile VLBI system

The Project ARIES 9 meter transportable antenna was used as one element of very long baseline interferometer (VLBI) to begin monitoring locations of six sites in California relative to large diameter fixed antennas at the NASA Deep Space Network, Goldstone, California, and at the Caltech Owens Valley Radio Observatory, Big Pine, California. An accuracy of about 6 cm in the horizontal components was demonstrated by comparison with measurements of the National Geodetic Survey. The root of mean square scatter of the lengths of the baselines between any pair of antennas was about 3 cm except for the Goldstone-JPL (Pasadena) baseline. In the period August 1974 to August 1977 the length of this baseline increased by 15 + or - 5 cm as JPL moved westward relative to Goldstone at the rate of 6 + or - 2 cm/year. The baseline lengths were unaffected by the uncertainties of UT1, polar motion, and tropospheric water vapor, which are the limitations to present three dimensional vector accuracies.

Niell, A. E.↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

UFNet: Joint U-Net and Fully Connected Neural Network to Bias Correct Precipitation Predictions from

Paper information. Shuang Yu, Indrasis Chakraborty, Gemma J. Anderson, Donald D. Lucas, Yannic Lops, and Daniel Galea. UFNet: Joint U-Net and fully connected neural network to bias correct precipitation predictions from climate models. Artificial Intelligence for the Earth Systems, 2024. Overview. This work develops the UFNet methodology to correct E3SM historical precipitation projection bias. The UFNet deep learning framework consists of a two-part architecture: a U-Net convolutional network to capture the spatiotemporal distribution of precipitation and a fully connected network to capture the distribution of higher-order statistics. The joint network, termed UFNet, can simultaneously improve the spatial structure of the modeled precipitation and capture the distribution of extreme precipitation values. Below we provide guidance for applying UFNet to correct the Energy Exascale Earth System Model (E3SM; Golaz et al. 2019) daily precipitation projection over the contiguous United States (CONUS). Getting started 1. Obtain the historical climate simulation and observation data. The E3SM historical simulation data are available through https://aims2.llnl.gov/search/cmip6/. The CPC unified gauge-based analysis of daily precipitation can be found through https://psl.noaa.gov/data/gridded/data.cpc.globalprecip.html. The ECMWF atmospheric reanalysis of the 20th century (ERA-20C) data are available through https://www.ecmwf.int/en/forecasts/datasets/reanalysis-datasets/era-20c. The spatial resolution of E3SM and observed datasets are both regridded to a common 1° resolution grid using conservative interpolation. The regridded E3SM, CPC and ERA-20C with 1° resolution can be found throught ./data/. 2. Train the fully connected network (DNN) Python train_dnn.py 3. Train the UFNet Python train_ufnet.py 4. Evaluation and compared with the baseline Python evaluation.py

Lucas, DonaldD↗
DOE OSTI2022

Internet of Things Data Characterization Process: Pattern of Life Behavioral Data Study

The HoneyBee™ TARDIS LDRD team completed a data scoping study that identified the initial processes and procedures to baseline the normal and expected behaviors during operability and interoperability of Internet of Things (IoT) device networks. This research is the initial step in developing a process (or methodology) to inform a much broader information framework incorporating machine learning to determine device pattern-of-life which enables the detection of abnormal IoT behaviors on an individual device, as well as in the context of a larger network.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2016

Cyber Security for the Spaceport Command and Control System: Vulnerability Management and Compliance Analysis

With the rapid development of the Internet, the number of malicious threats to organizations is continually increasing. In June of 2015, the United States Office of Personnel Management (OPM) had a data breach resulting in the compromise of millions of government employee records. The National Aeronautics and Space Administration (NASA) is not exempt from these attacks. Cyber security is becoming a critical facet to the discussion of moving forward with projects. The Spaceport Command and Control System (SCCS) project at the Kennedy Space Center (KSC) aims to develop the launch control system for the next generation launch vehicle in the coming decades. There are many ways to increase the security of the network it uses, from vulnerability management to ensuring operating system images are compliant with securely configured baselines recommended by the United States Government.

Cyber Security↗
NASA NTRS2017

Single-dish and VLBI Observations of Cygnus X-3 During the 2016 Giant Flare Episode

In 2016 September, the microquasar Cygnus X-3 underwent a giant radio flare, which was monitored for 6 d with the Medicina Radio Astronomical Station and the Sardinia Radio Telescope. Long observations were performed in order to follow the evolution of the flare on an hourly scale, covering six frequency ranges from 1.5 to 25.6 GHz. The radio emission reached a maximum of 13.2 +/- 0.7 Jy at 7.2 GHz and 10 +/- 1 Jy at 18.6 GHz. Rapid flux variations were observed at high radio frequencies at the peak of the flare, together with rapid evolution of the spectral index: α steepened from 0.3 to 0.6 (with Sν ∝ ν −α) within 5 h. This is the first time that such fast variations are observed, giving support to the evolution from optically thick to optically thin plasmons in expansion moving outward from the core. Based on the Italian network (Noto, Medicina and SRT) and extended to the European antennas (Torun, Yebes, Onsala), very long baseline interferometry (VLBI) observations were triggered at 22 GHz on five different occasions, four times prior to the giant flare, and once during its decay phase. Flux variations of 2 h duration were recorded during the first session. They correspond to a mini-flare that occurred close to the core 10 d before the onset of the giant flare. From the latest VLBI observation we infer that 4 d after the flare peak the jet emission was extended over 30 mas.

Egron, E.↗
DOE OSTI2024

Ergodicity, lack thereof, and the performance of reservoir computing with memristive networks and nanowire

Networks composed of nanoscale memristive components, such as nanowire and nanoparticle networks, have recently received considerable attention because of their potential use as neuromorphic devices. In this study, we explore ergodicity in memristive networks, showing that the performance on machine leaning tasks improves when these networks are tuned to operate at the edge between two global stability points. We find this lack of ergodicity is associated with the emergence of memory in the system. We measure the level of ergodicity using the Thirumalai-Mountain metric, and we show that in the absence of ergodicity, two different memristive network systems show improved performance when utilized as reservoir computers (RC). We highlight that it is also important to let the system synchronize to the input signal in order for the performance of the RC to exhibit improvements over the baseline.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2021

Assessing Disaggregated SMAP Soil Moisture Products in the United States

A soil moisture (SM) disaggregation algorithm based on thermal inertia (TI) theory was implemented to downscale the Soil Moisture Active Passive (SMAP) Enhanced product(SPL2SMPE) from 9 km to 1 km over the continental United States. The algorithm applies land surface temperature and normalized difference vegetation index from Moderate Resolution Imaging Spectroradiometer (MODIS) at higher spatial resolution to estimate relative soil wetness within a coarse SMAP grid -this MODIS-derived relative wetness is then used to produce the downscaled SMAP SM. Results from the algorithm were evaluated in terms of their spatiotemporal coverage and accuracy using in situ measurements from SMAP Core Validation Sites (CVS), the US Department of Agriculture Soil Climate Analysis Network (USDA-SCAN), and the National Oceanic and Atmospheric Administration Climate Reference Network(NOAA-CRN). Results were also compared with the baselineSPL2SMPE and the SMAP/Sentinel-1 (SPL2SMAPS) 1kmproduct. Overall, the unbiased root mean square error (ubRMSE)of the disaggregated SM at the CVS using the TI approach is approximately 0.04 m3=m3, which is the SMAP mission requirement for the baseline products. The TI approach out performs the SMAP/Sentinel SL2SMAPS 1km product by approximately0.02 m3=m3. Over the agriculture/crop areas from SCAN and CRN sparse network stations, the TI approach exhibits better ubRMSE compared to SPL2SMPE andSPL2SMAPS byabout0.01 and 0.02 m3=m3, indicating its advantage in these areas. However, a drawback of this approach is that there are data gaps due to cloud cover as optical sensors cannot have a clear view of the land surface.

Soil moisture↗
NASA NTRS2004

Interplanetary navigation using a continental baseline large antenna arrays

Navigation is a key component of interplanetary missions and must continue to be precise with the changing landscape of antenna design. Improvements for the Deep Space Network (DSN) may include the use of antenna arrays to simulate the power of a larger single antenna at much lower operating and construction costs. Therefore, it is necessary to test the performance of arrayed antennas from a navigational point-of-view. This initial investigation focuses on the performance of arrayed antennas from a navigational point-of-view. This initial investigation focuses on the performance of delta one-way range measurements using a shorter baseline with more data collection then current systems use. With all other parameter equal, the longer the baseline, the better the accuracy for navigation making the number of data packets very important. This trade study compares baseline distances ranging from 1 to 1000km with an in use baseline, looking at a due east baseline, a due north baseline at 45 degrees East of North. The precision of the baseline systems can be found through a simulated created for this purpose using the Jet Propulsion Lab based Monte navigation and mission design tool. The simulation combines the delta one-way range measurements with two-range and two-way Doppler measurements and puts the measurements through a Kalman filter to determine an orbit solution. Noise is added along with initial errors to give the simulation realism. This study is an important step towards the assessment of the utility of arrays for navigational purposes. The preliminary results have showed a decrease in reliability as the baseline is shortened but the larger continental baselines show comparable results t that of the current Goldstone to Canberra.

very long baseline interferometry (VLBI)↗
NASA NTRS2020

Scheduling NASA's Deep Space Network: Priorities, Preferences, and Optimization

NASA's Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40\% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process --- oversubsubscription and how to "fairly'" reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗
NASA NTRS2021

User Preference Optimization for Oversubscribed Scheduling of NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗