Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Transfer”

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,711 records · Page 95

Recent on-Orbit Results and Arq Performance Analysis for the Tbird 200-Gbps Mission

The TeraByte Infrared Delivery (TBIRD) mission has successfully demonstrated 200-Gbps laser communication downlinks from a 6U CubeSat in low-Earth orbit (LEO) and has delivered up to 4.8 terabytes (TB) error-free in a 5-minute pass. In total 65 passes have been performed since launch in May 2022, with 25 of those passes conducted in April-May 2023. The TBIRD space and ground terminals leverage commercial fiber-coupled coherent transceivers along with a custom Automatic Repeat reQuest (ARQ) protocol to ensure error-free communication through the atmospheric fading channel. This paper presents data throughput results from the on-orbit passes and an analysis of the ARQ system operation that shows that near-optimal performance was achieved. We also present results from Doppler compensation experiments that led to an increase in the data volume transferred per pass.

Tbird↗

Biosentinel: The First Deep Space Biology CubeSat Mission- Mission Summary and Lessons Learned

Launched on Artemis-1, BioSentinel carries a biology experiment into deep space for the first time in 50 years. A 6U CubeSat form factor was utilized for the spacecraft which included technologies newly developed or adapted for operations beyond Earth orbit. The spacecraft carries onboard budding yeast, Saccharomyces cerevisiae, as an analog to human cells to test the biological response to deep space radiation. This was the maiden deep-space voyage for many of the subsystems, and the first time to evaluate their performance in flight operation. Flying a CubeSat beyond LEO comes with unique challenges with respect to trajectory uncertainty and mission operations planning. The nominal plan was a lunar fly-by, followed by an insertion into Heliocentric orbit. However, some possible scenarios included lunar eclipses that could have severely impacted the power budget during that phase of the mission, while others could have resulted in a “Retrograde” hyperbola at swing-by resulting in the spacecraft traveling inward toward Earth or even towards a collision with the lunar surface. The commissioning phase of the mission was successful and completed a week ahead of schedule. It did not come without its exciting moments and challenges. First contact with the spacecraft uncovered that the vehicle was unexpectedly tumbling after deployment, a situation that needed to be corrected urgently. The mission operations team executed a contingency plan to stabilize the spacecraft, with just moments to spare before the battery ran out of power. The BioSensor payload onboard the spacecraft is a complex instrument that includes microfluidics, fluid systems, sensor control electronics, as well at the living yeast cells. BioSentinel also included a TimePix radiation sensor implemented by JSC’s RadWorks group. Dose and Linear Energy Transfer (LET) data is compared directly to the rate of DSB-and repair events measured by the S. cerevisiae cells. BioSentinel mature nanosatellite technologies included: deep space communications and navigation, autonomous attitude control and momentum management, and micro-propulsion systems, to provide an adaptable nanosatellite platform for deep space uses. This paper discusses the performance of the BioSentinel spacecraft through the mission phase, and includes lessons learned from challenges and anomalies. BioSentinel had many successes and will be a pathfinder for future deep space CubeSats and biology missions.

BioSentinel↗

NASA Space Communications and Navigation Approach to Cloud Capability Implementation

The integration of cloud services and capabilities across government and commercial sectors has continued to increase over the last several years. Cloud architectures provide on-demand process, storage, and transfer of data as a service without the need to purchase expensive hardware, infrastructure, and their associated maintenance costs. Most cloud environments charge the user for only the resources they use, making cloud implementations highly scalable and easily adjustable to the user’s changing demands.

cloud computing↗

Deflate decompressor

A deflate decompressor includes at least one decompressor unit, a memory access controller, a feedback path, and an output buffer unit. The memory access controller is coupled to the decompressor unit via a data path and includes a data buffer to receive the data stream and temporarily buffer a first portion the data stream. The memory access controller transfers fixed length data units of the data stream from the data buffer to the decompressor unit with reference to a memory pointer pointing into the memory buffer. The feedback path couples the decompressor unit to the memory access controller to feed back decrement values to the memory access controller for updating the memory pointer. The decrement values each indicate a number of bits unused by the decompressor unit when decoding the fixed length data units. The output buffer unit buffers a second portion of the data stream after decompression.

97 MATHEMATICS AND COMPUTING↗

A Vector Control and Data Acquisition System for the Multicavity LLRF System for Cryomodule1 at Fermilab

A LLRF control and data acquisition system for the 8-cavity Cryo-Module 1 at the ILCTA has been implemented using three , 33-channel MFC boards in a VXI mainframe. One card each is dedicated for the cavity probes for vector control , forward power and reverse power measurements. The system is scalable to 24 cavities or more with the commissioning of Cryo-Modules 2 and 3 without additional hardware. The signal processing and vector control of the cavities is implemented in a FPGA and a high speed data acquisition system with upto 100 channels stores data in external SDRAM memory. The system supports both pulsed and CW modes with a pulse rate of 5Hz. Acquired data is transferred between pulses to auxiliary systems such as the piezo controller through the slot0 controller. The design of the system is described and the performance of the vector control system is evaluated.

43 PARTICLE ACCELERATORS↗

Real-time geo-registration of imagery using COTS graphics processors

A method of performing real-time geo-registration of high-resolution digital imagery using existing graphics processing units (GPUs) already found in current personal computers, rather than the main central processing unit (CPU). Digital image data captured by a camera (along with inertial navigation system (INS) data associated with the image data) is transferred to and processed by the GPU to perform the calculations involved in transforming the captured image into a geo-rectified, nadir-looking image. By using the GPU, the order-of-magnitude increase in throughput over conventional software techniques makes real-time geo-registration possible without the significant cost of custom hardware solutions.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Fast digital lossy compression for X-ray ptychographic data

Increases in X-ray brightness from synchrotron light sources lead to a requirement for higher frame rates from hybrid pixel array detectors (HPADs), while also favoring charge integration over photon counting. However, transfer of the full uncompressed data will begin to constrain detector design, as well as limit the achievable continuous frame rate. Here a data compression scheme that is easy to implement in a HPAD's application-specific integrated circuit (ASIC) is described, and how different degrees of compression affect image quality in ptychography, a commonly employed coherent imaging method, is examined. Using adaptive encoding quantization, it is shown in simulations that one can digitize signals up to 16383 photons per pixel (corresponding to 14 bits of information) using only 8 or 9 bits for data transfer, with negligible effect on the reconstructed image.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

FCP: A Fast and Scalable Data Copy Tool for High Performance Parallel File Systems

The design of HPC file and storage systems has largely been driven by the requirements on capability, reliability, and capacity. However, the convergence of large-scale simulations with big data analytics have put the data, its usability, and management back on the front and center position. One of the most common and time consuming data management tasks is the transfer of very large datasets within and across file systems.In this paper, we are introducing the FCP tool, a file system agnostic copy tool designed at the OLCF for scalable and high-performance data transfers between two file system endpoints. It provides an array of interesting features such as adaptive chunking, checksumming on the fly, checkpoint and resume capabilities to handle failures, and preserving stripe information for Lustre file system among others. It is currently available on the Titan supercomputer at the OLCF. Initial tests have shown that FCP has much better and scalable performance than traditional data copy tools and it was capable of transferring petabyte-scale datasets between two Lustre file systems.

Wang, Feiyi↗

Bridging the gap between peak and average loads on science networks

Backbone networks are typically overprovisioned in order to support peak loads. Research and education networks (RENs), for example, are often designed to operate at 20–30% of capacity. Thus, Internet2 upgrades its backbone interconnects when the weekly 95th-percentile load is reliably above 30% of link capacity, and analysis of ESnet traffic between major laboratories shows a substantial gap between peak and average utilization. As science data volumes increase exponentially, it is unclear whether this overprovisioning trend can continue into the future. Even if overprovisioning is possible, it may not be the most cost-effective (and desirable) approach going forward. Under the current mode of free access to RENs, traffic at peak load may include both flows that need to be transferred in near-real time–for example, for computation and instrument monitoring and steering–and flows that are less time-critical, for example, archival and storage replication operations. Thus, peak load does not necessarily indicate the capacity that is absolutely required at that moment. We thus examine how data transfers are impacted when the average network load is increased while the network capacity is kept at the current levels. We also classify data transfers into on-demand (time-critical) and best-effort (less time-critical) and study the impact on both classes for different proportions of both the number of on-demand transfers and amount of bandwidth allocated for on-demand transfers. For our study, we use real transfer logs from production GridFTP servers to do simulation-based experiments as well as real experiments on a testbed. We find that when the transfer load is doubled and the network capacity is fixed at the current level, the gap between peak and average throughput decreases by an average of 18% in the simulation experiments and 16% in the testbed experiments, and the average slowdown experienced by the data transfers is under 1.5×. Moreover, when transfers are classified as on-demand or best-effort, on-demand transfers experience almost no slowdown and the mean slowdown experienced by best-effort transfers is under 2× in the simulation experiments and under 1.2× in the testbed experiments.

97 MATHEMATICS AND COMPUTING↗

Timely Result-Data Offloading for Improved HPC Center Scratch Provisioning and Serviceability

Modern High-Performance Computing (HPC) centers are facing a data deluge from emerging scientific applications. Supporting large data entails a significant commitment of the highthroughput center storage system, scratch space. However, the scratch space is typically managed using simple purge policies, without sophisticated end-user data services to balance resource consumption and user serviceability. End-user data services such as offloading are performed using point-to-point transfers that are unable to reconcile center s purge and users delivery deadlines, unable to adapt to changing dynamics in the end-toend data path and are not fault-tolerant. Such inefficiencies can be prohibitive to sustaining high performance. In this paper, we address the above issues by designing a framework for the timely, decentralized offload of application result data. Our framework uses an overlay of user-specified intermediate and landmark sites to orchestrate a decentralized fault-tolerant delivery. We have implemented our techniques within a production job scheduler (PBS) and data transfer tool (BitTorrent). Our evaluation using both a real implementation and supercomputer job log-driven simulations show that: the offloading times can be significantly reduced (90.4% for a 5 GB data transfer); the exposure window can be minimized while also meeting center-user Service Level Agreements.

99 GENERAL AND MISCELLANEOUS↗

A Methodology for Simulating Supercritical CO2 Heat Transfer Experiments Using Machine Learning Models

To support the growth of supercritical carbon dioxide (sCO2) power cycles in the energy industry, this study seeks to train a machine learning model to mirror experimental data to predict new heat transfer data. To do this experimental data was amassed, one preliminary set comprised of 16 test results, and an expanded version comprised of 38 test results. With the goal of predicting experimental apparatus temperatures and pressures, several iterations of models were tested investigating the impact of model hyper-parameters, data inclusion, and data pre-processing on model performance. A total of 15 variations cumulatively of Gaussian Process Regressors, Gradient Boosting Regressors, and Multi-Layer Perceptrons were trained and validated on the preliminary set, and the best algorithm of each class was re-trained on the expanded set. These were compared based on test/train R^2 , test/train mean absolute error (MAE), and validation MAE, to identify the successfulness of these models. It was shown temperatures could be predicted within just a few degrees, showing the potential of this approach. Future research has been identified with approaches to improve pressure and temperature predictions going forward.

Grabowski, Owen↗

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

Seidel, R. C.↗

Data Quality Monitoring for the Hadron Calorimeters Using Transfer Learning for Anomaly Detection

The proliferation of sensors brings an immense volume of spatio-temporal (ST) data in many domains, including monitoring, diagnostics, and prognostics applications. Data curation is a time-consuming process for a large volume of data, making it challenging and expensive to deploy data analytics platforms in new environments. Transfer learning (TL) mechanisms promise to mitigate data sparsity and model complexity by utilizing pre-trained models for a new task. Despite the triumph of TL in fields like computer vision and natural language processing, efforts on complex ST models for anomaly detection (AD) applications are limited. In this study, we present the potential of TL within the context of high-dimensional ST AD with a hybrid autoencoder architecture, incorporating convolutional, graph, and recurrent neural networks. Motivated by the need for improved model accuracy and robustness, particularly in scenarios with limited training data on systems with thousands of sensors, this research investigates the transferability of models trained on different sections of the Hadron Calorimeter of the Compact Muon Solenoid experiment at CERN. The key contributions of the study include exploring TL’s potential and limitations within the context of encoder and decoder networks, revealing insights into model initialization and training configurations that enhance performance while substantially reducing trainable parameters and mitigating data contamination effects.

47 OTHER INSTRUMENTATION↗

General Solution for Theoretical Packet Data Loss Rate

Communications systems which transfer blocks ("frames") of data must use a marker ("frame synchronization pattern") for identifying where a block begins. A technique ("frame synchronization strategy") is used to locate the start of each frame and maintain synchronization as additional blocks are processed. A device which strips out the frame synchronization pattern [FSP] and provides an "end of frame" pulse is called a frame synchronizer. As clock and data errors are introduced into the system, the start-of-block marker becomes displaced and/or corrupted. The capability of the frame synchronizer to stay locked to the pattern under these conditions is a figure of merit for the frame synchronization strategy. It is important to select a strategy which will stay locked nearly all the time at bit error rates where the data is usable. ("Bit error rate" [BER] is the fraction of binary bits which are inverted by passage through a communication system.) The fraction of frames that are discarded because the frame synchronizer is not locked is called "Percent Data Loss" or "Packet Data Loss rate" [PDL]. A general approach for accurately predicting PDL given BER was developed in Theoretical Percent Data Loss Calculation and Measurement Accuracy, T. P. Kelly, LESC-30554, December 1992. Kelly gave a solution in terms of matrix equations, and only addressed "level" channel encoding. This paper goes on to give a closed-form polynomial solution for the most common class of frame synchronizer strategies, and will also address "mark" and "space" (differential) channel encoding, and burst error environments. The paper is divided into four sections and follows a logically ordered presentation, with results developed before they are evaluated. However, most readers will derive the greatest benefit from this paper by treating the results as reference material. The result developed for differential encoding can be extended to other applications (like block codes) where the probability is needed that a block contains only a certain number of errors.

Lansdowne, Chatwin↗

Proton radius from electron scattering data

Background: The proton charge radius extracted from recent muonic hydrogen Lamb shift measurements is significantly smaller than that extracted from atomic hydrogen and electron scattering measurements. The discrepancy has become known as the proton radius puzzle. Purpose: In an attempt to understand the discrepancy, we review high-precision electron scattering results from Mainz, Jefferson Lab, Saskatoon and Stanford. Methods: We make use of stepwise regression techniques using the F-test as well as the Akaike information criterion to systematically determine the predictive variables to use for a given set and range of electron scattering data as well as to provide multivariate error estimates. Results: Starting with the precision, low four-momentum transfer (Q 2 ) data from Mainz (1980) and Saskatoon (1974), we find that a stepwise regression of the Maclaurin series using the F-test as well as the Akaike information criterion justify using a linear extrapolation which yields a value for the proton radius that is consistent with the result obtained from muonic hydrogen measurements. Applying the same Maclaurin series and statistical criteria to the 2014 Rosenbluth results on GE from Mainz, we again find that the stepwise regression tends to favor a radius consistent with the muonic hydrogen radius but produces results that are extremely sensitive to the range of data included in the fit. Making use of the high-Q 2 data on G E to select functions which extrapolate to high Q 2 , we find that a Pad´e (N = M = 1) statistical model works remarkably well, as does a dipole function with a 0.84 fm radius, G E (Q 2 ) = (1 + Q 2 /0.66 GeV 2 ) -2 . Conclusions: Rigorous applications of stepwise regression techniques and multivariate error estimates result in the extraction of a proton charge radius that is consistent with the muonic hydrogen result of 0.84 fm; either from linear extrapolation of the extreme low-Q 2 data or by use of the Pad´e approximant for extrapolation using a larger range of data. Thus, based on a purely statistical analysis of electron scattering data, we conclude that the electron scattering result and the muonic hydrogen result are consistent. Lastly, it is the atomic hydrogen results that are the outliers.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗