Search NASA⌕ Search

SEARCH · Search NASA

Results for “streaming data”

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,279 records · Page 71

DELVE-ing into the Jet: A Thin Stellar Stream on a Retrograde Orbit at 30 kpc

We perform a detailed photometric and astrometric analysis of stars in the Jet stream using data from the first data release of the DECam Local Volume Exploration Survey DR1 and Gaia EDR3. We discover that the stream extends over ∼ 29° on the sky (increasing the known length by 18°), which is comparable to the kinematically cold Phoenix, ATLAS, and GD-1 streams. Using blue horizontal branch stars, we resolve a distance gradient along the Jet stream of 0.2 kpc deg$^{−1}$, with distances ranging from D $_{⊙}$ ∼ 27–34 kpc. We use natural splines to simultaneously fit the stream track, width, and intensity to quantitatively characterize density variations in the Jet stream, including a large gap, and identify substructure off the main track of the stream. Furthermore, we report the first measurement of the proper motion of the Jet stream and find that it is well aligned with the stream track, suggesting the stream has likely not been significantly perturbed perpendicular to the line of sight. Finally, we fit the stream with a dynamical model and find that it is on a retrograde orbit, and is well fit by a gravitational potential including the Milky Way and Large Magellanic Cloud. These results indicate the Jet stream is an excellent candidate for future studies with deeper photometry, astrometry, and spectroscopy to study the potential of the Milky Way and probe perturbations from baryonic and dark matter substructure.

79 ASTRONOMY AND ASTROPHYSICS↗

Revamping Spacecraft Operational Intelligence with Splunk

So what is Splunk? Instead of giving the technical details, which you can find online, I'll tell you what it did for me. Splunk slapped everything into one place, with one uniform format, and gave me the ability to forget about all these annoying details of where it is, how to parse it, and all that. Instead, I only need to interact with Splunk to find the data I need. This sounds simple and obvious, but it's surprising what you can do once you all of your data is indexed in one place. By having your data organized, querying becomes much easier. Let's say that I want to search telemetry for a sensor_name gtemp_1 h and to return all data that is at most five minutes old. And because Splunk can hook into a real ]time stream, this data will always be up-to-date. Extending the previous example, I can now aggregate all types of data into one view based in time. In this picture, I've got transaction logs, telemetry, and downlinked files all in one page, organized by time. Even though the raw data looks completely than this, I've defined interfaces that transform it into this uniform format. This gives me a more complete picture for the question what was the spacecraft doing at this particular time? And because querying data is simple, I can start with a big block of data and whiddle it down to what I need, rather than hunting around for the individual pieces of data that I need. When we have all the data we need, we can begin widdling down the data with Splunk's Unix-like search syntax. These three examples highlights my trial-and-error attempts to find large temperature changes. I begin by showing the first 5 temperatures, only to find that they're sorted chronologically, rather than from highest temperatures to lowest temperatures. The next line shows sorting temperatures by their values, but I find that that fs not really what I want either. I want to know the delta temperatures between readings. Looking through Splunk's user manual, I find the delta function, which lets me dynamically generate new information to use in my query. With that extra piece of information, I can now return only the telemetry readings where the temperature changed by at least 10. One other useful feature I'll mention is that all of these queries can be run through Splunk's API. So any scripting language you can think of can plug right in and make these queries. This gives us the ability to build a lot of new tools.

operational intelligence↗

Some Practical Universal Noiseless Coding Techniques

Report discusses noiseless data-compression-coding algorithms, performance characteristics and practical consideration in implementation of algorithms in coding modules composed of very-large-scale integrated circuits. Report also has value as tutorial document on data-compression-coding concepts. Coding techniques and concepts in question "universal" in sense that, in principle, applicable to streams of data from variety of sources. However, discussion oriented toward compression of high-rate data generated by spaceborne sensors for lower-rate transmission back to earth.

Rice, Robert F.↗

An approximate Kalman filter for ocean data assimilation: An example with an idealized Gulf Stream model

A practical method of data assimilation for use with large, nonlinear, ocean general circulation models is explored. A Kalman filter based on approximation of the state error covariance matrix is presented, employing a reduction of the effective model dimension, the error's asymptotic steady state limit, and a time-invariant linearization of the dynamic model for the error integration. The approximations lead to dramatic computational savings in applying estimation theory to large complex systems. We examine the utility of the approximate filter in assimilating different measurement types using a twin experiment of an idealized Gulf Stream. A nonlinear primitive equation model of an unstable east-west jet is studied with a state dimension exceeding 170,000 elements. Assimilation of various pseudomeasurements are examined, including velocity, density, and volume transport at localized arrays and realistic distributions of satellite altimetry and acoustic tomography observations. Results are compared in terms of their effects on the accuracies of the estimation. The approximate filter is shown to outperform an empirical nudging scheme used in a previous study. The examples demonstrate that useful approximate estimation errors can be computed in a practical manner for general circulation models.

Fukumori, Ichiro↗

An Approximate Kalman Filter for Ocean Data Assimilation; An Example with an Idealized Gulf Stream Model

A practical method of data assimilation for use with large, nonlinear, ocean general circulation models is explored. A Kalman filter based on approximations of the state error covariance matrix is presented, employing a reduction of the effective model dimension, the error's asymptotic steady-state limit, and a time-invariant linearization of the dynamic model for the error integration. The approximations lead to dramatic computational savings in applying estimation theory to large complex systems. We examine the utility of the approximate filter in assimilating different measurement types using a twin experiment of an idealized Gulf Stream. A nonlinear primitive equation model of an unstable east-west jet is studied with a state dimension exceeding 170,000 elements. Assimilation of various pseudo measurements is examined, including velocity, density, and volume transport at localized arrays, and realistic distributions of satellite altimetry and acoustic tomography observations. Results are compared in terms of their effects on the accuracies of the estimation. The approximate filter is shown to outperform a previous study that used an empirical nudging scheme. The examples demonstrate that useful approximate estimation errors can be computed in a practical manner for general circulation models.

['Kalman↗

A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization

This work presents a novel modeling and analysis framework for graph sequences which addresses the challenge of detecting and contextualizing anomalies in labelled, streaming graph data. We introduce a generalization of the BTER model of Seshadhri et al. by adding flexibility to community structure, and use this model to perform multi-scale graph anomaly detection. Specifically, probability models describing coarse subgraphs are built by aggregating node probabilities, and these related hierarchical models simultaneously detect deviations from expectation. This technique provides insight into a graph's structure and internal context that may shed light on a detected event. Additionally, this multi-scale analysis facilitates intuitive visualizations by allowing users to narrow focus from an anomalous graph to particular subgraphs or nodes causing the anomaly. For evaluation, two hierarchical anomaly detectors are tested against a baseline Gaussian method on a series of sampled graphs. We demonstrate that our graph statistics-based approach outperforms both a distribution-based detector and the baseline in a labeled setting with community structure, and it accurately detects anomalies in synthetic and real-world datasets at the node, subgraph, and graph levels. Furthermore, to illustrate the accessibility of information made possible via this technique, the anomaly detector and an associated interactive visualization tool are tested on NCAA football data, where teams and conferences that moved within the league are identified with perfect recall, and precision greater than 0.786.

97 MATHEMATICS AND COMPUTING↗

Analysis of material recovery facilities for use in life-cycle assessment

Highlights: • Life-cycle assessment of solid waste management relies on accurate process models. • Material recovery facility (MRF) processes were modeled with new primary data. • Single stream, dual stream, pre-sorted, and mixed waste MRFs were considered. • MRF electricity consumption ranges from 4.7 to 7.8 kW h per Mg input. • Total cost ranges from $19.8 to $24.9 per Mg input. - Abstract: Insights derived from life-cycle assessment of solid waste management strategies depend critically on assumptions, data, and modeling at the unit process level. Based on new primary data, a process model was developed to estimate the cost and energy use associated with material recovery facilities (MRFs), which are responsible for sorting recyclables into saleable streams and as such represent a key piece of recycling infrastructure. The model includes four modules, each with a different process flow, for separation of single-stream, dual-stream, pre-sorted recyclables, and mixed-waste. Each MRF type has a distinct combination of equipment and default input waste composition. Model results for total amortized costs from each MRF type ranged from $19.8 to $24.9 per Mg (1 Mg = 1 metric ton) of waste input. Electricity use ranged from 4.7 to 7.8 kW h per Mg of waste input. In a single-stream MRF, equipment required for glass separation consumes 28% of total facility electricity consumption, while all other pieces of material recovery equipment consume less than 10% of total electricity. The dual-stream and mixed-waste MRFs have similar electricity consumption to a single-stream MRF. Glass separation contributes a much larger fraction of electricity consumption in a pre-sorted MRF, due to lower overall facility electricity consumption. Parametric analysis revealed that reducing separation efficiency for each piece of equipment by 25% altered total facility electricity consumption by less than 4% in each case. When model results were compared with actual data for an existing single-stream MRF, the model estimated the facility’s electricity consumption within 2%. The results from this study can be integrated into LCAs of solid waste management with system boundaries that extend from the curb through final disposal.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

Reed, D. A.↗

Effect Of Transition Density On Performance Of A DTTL

One estimates minimum transition density needed to limit symbol-error rate. Theoretical calculations and accompanying computer simulations provide numerical basis for specification of minimum data-transition density needed for adequate performance of radio receiver processing noisy signal containing non-return-to-zero (NRZ) stream of data symbols (bits). By use of digital-data-transition-tracking loop (DTTL), receiver strives to synchronize operation with data symbols. Performance of receiver in terms of ability to keep symbol-error rate (SER) in output of receiver below specified level depends on symbol signal-to-noise ratio (SSNR) of incoming signal and on degree of synchronization. Ability of DTTL to maintain synchronization depends partly on SSNR and partly on data-transition density.

Nguyen, Tien M.↗

Pre-commercial Demonstration of Direct Non-iterative State Estimator for Operational Use of Synchrophasor Management Systems

The objective of this project was to demonstrate functionality and performance of a Direct Non-iterative State Estimator (DNSE) integrated with NYPA’s Energy Management System (EMS) and with enhanced Real Time Dynamics Monitoring System (RTDMS) synchrophasor platform from Electric Power Group (EPG). DNSE is designed to overcome a major obstacle to operational use of Synchro-Phasor Management Systems (SPMS) by providing to synchrophasor management systems (SPMS) applications a consistent and a complete synchrophasor data foundation in the same way that a traditional EMS State Estimator (SE) provides to EMS applications. Specifically, DNSE is designed to use synchrophasor measurements collected by a central PDC, Supervisory Control and Data Acquisition (SCADA) measurements, and Energy Management System (EMS) network model, to obtain the complete state of the utility’s operating model at rates that are close to the synchrophasor data rates. In this way, the system is comprehensive in that it does not only cover the part of the network that is “visible” via synchrophasors, but also the part that is only “visible” through the SCADA measurements. Visualization needs associated with the use of DNSE results are fulfilled through suitably enhanced Real Time Dynamics Monitoring System (RTDMS), with the enhancements implemented by EPG. This project had the following goals in mind: To advance the deployment of commercial grade DNSE software application that relies on synchrophasor and SCADA data ; Apply DNSE at other utilities, to address a generic and fundamental need for “clean” operational data for synchrophasor applications; Provide means for “live” estimated data access by control system operators; Enhance potential for situational awareness through full system operational model coverage; Sub-second execution rate of the Direct Non-iterative State Estimator, eventually at a near-phasor data rate execution speed, i.e. < 0.1 sec. Anticipated benefits from this projects are: Enhanced reliability and improvements in the economic efficiency of bulk power system planning and operations; Providing “clean” data to other synchrophasor applications; Enhancement of situational awareness by providing the full operational model updated at near synchrophasor rate; A production-grade software tool that incorporate synchrophasor and SCADA data; Provides a basis for development of next generation monitoring and control applications, based on both SCADA and PMU data. Quanta Technology (QT) team worked in collaboration with Electric Power Group (EPG) whose team has enhanced its commercial Real Time Dynamics Monitoring System (RTDMS) to accommodate the requirements posed by DNSE application. EPG also provided its ePDC and Model-less Data Conditioning (PDVC) software for integration with DNSE+. QT developed the system requirements for DNSE; developed system architecture and defined interfaces between internal DNSE components. The core DNSE algorithm with all surrounding interfaces was named DNSE+. Since the DNSE development was done in a simulated system environment, QT used its PMU simulator that was enhanced during this project for development and factory acceptance testing (FAT). SCADA data in this stage was simulated by commercial PSS/e software. The output of DNSE are estimates of System states in C37.118-2 format, sent to RTDMS for further processing and display. As the number of these states is large, it was necessary to expand the C37.111-2 standard to accommodate large data sets. This enhancement was implemented in RTDMS. The demonstration of pre-production DNSE technology was done at NYPA using streaming field data from NYPA PMUs and from its RTUs through their SCADA system. NYPA provided ICCP interface as well as Common Information Model (CIM). The relevance of the DNSE+ application is that it provides state estimation of the power system based on hybrid set of data, consisting of both available PMU data and SCADA measurements. As this is a direct, non-iterative method of calculation of the system states, if does not suffer from convergence issues which is potential problem for conventional state estimators. Also, it can take any available PMU measurements, so it does not need to have a high percentage of PMU coverage needed in the case of Linear State Estimator. As the DNSE calculates synchrophasors of the system states (both phase and absolute value) as sub-second rate, this application can provide a basis for development of next generation of applications based both on SCADA and PMU data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching

DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.

Tumeo, Antonino↗

System for detecting objects in streaming 3D images formed from data acquired with a medium penetrating sensor

A detection system that detects subsurface objects within a medium and estimates various features of the objects is provided. The detection system receives a streaming sequence of image frames of the medium at various along-medium locations. An image frame contains voxel values (intensities) representing characteristics of the medium across the medium and in the depth (range) direction. The detection system depth-compensates the intensities for determining which voxels are part of an object using an unsupervised binary classifier. The detection system then connects object voxels into distinct objects and recursively estimates the features of those objects as the image frames stream based on the locations and intensities of the object voxels.

Paglieroni, David W.↗

VLBI Data Interchange Format (VDIF)

One important outcome of the 7th International e-VLBI Workshop in Shanghai in June 2008 was the creation of a task force to study and recommend a universal VLBI data format that is suitable for both on-the-wire e-VLBI data transfer, as well as direct disk storage. This task force, called the VLBI Data Interchange Format (VDIF) Task Force, is the first part of a two-part effort, the second of which will address standardization of e-VLBI data-transmission-protocols. The formation of the VDIF Task Force was prompted particularly by increased e-VLBI activity and the difficulties encountered when data arrive at a correlator in different formats from various instruments in various parts of the world. The task force created a streaming packetized data format that may be used for real-time and non-realtime e-VLBI, as well as direct disk storage. The data may contain multiple channels of time-sampled data with an arbitrary number of channels, arbitrary #bits/sample up to 32, and real or complex data; data rates in excess of 100 Gbps are supported. Each data packet is completely self-identifying via a short header, and data may be decoded without reference to any external information. The VDIF task force has completed its work, and the VDIF standard was ratified at the 2009 e-VLBI workshop in Madrid.

Whitney, Alan↗

Data Federation Challenges in Remote Near-Real-Time Fusion Experiment Data Processing

Fusion energy experiments and simulations provide critical information needed to plan future fusion reactors. As next-generation devices like ITER move toward long-pulse experiments, analyses, including AI and ML, should be performed in a wide range of time and computing constraints, from near-real-time constraints, between-shot analysis, and to campaign-wide long-term analysis. However, the data volume, velocity, and variety make it extremely challenging for analyses using only local computational resources. Researchers need the ability to compose and execute workflows spanning edge resources to large-scale high-performance computing facilities.We present Delta, a system to address data analysis challenges, including AI/ML, in fusion science, by leveraging the ADIOS I/O library and middleware, to support executing science workflows over the wide area network for near-real-time streaming. We discuss the data federation challenges in performing remote workflows, focusing on on-going research work in (1) managing, reducing, and streaming data to minimize I/O and data movement overheads, (2) decompressing and reorganizing data for analysis, and (3) executing workflows for automated data analysis. We introduce examples for deep-learning based data analysis for the fusion domain and demonstrate how we use Delta to construct end-to-end workflows for a fusion device in Korea, connecting a remote DOE facility in the USA. The capability demonstrated by this project is the basis for improving the state of the art for near-real-time data federation amongst remote facilities.

Choi, Jong Youl↗

Evaluating LSM-Based Water Budgets Over a West African Basin Assisted with a River Routing Scheme

Within the framework of the African Monsoon Multidisciplinary Analysis (AMMA) Land Surface Model Intercomparison Project phase 2 (ALMIP-2), this study evaluates the water balance simulated by the Interactions between Soil, Biosphere, and Atmosphere (ISBA) over the upper Oum River basin, in Benin, using a mesoscale river routing scheme (RRS). The RRS is based on the nonlinear Muskingum Cunge method coupled with two linear reservoirs that simulate the time delay of both surface runoff and base flow that are produced by land surface models. On the basis of the evidence of a deep water-table recharge in that region,a reservoir representing the deep-water infiltration (DWI) is introduced. The hydrological processes of the basin are simulated for the 2005-08 AMMA field campaign period during which rainfall and stream flow data were intensively collected over the study area. Optimal RRS parameter sets were determined for three optimization experiments that were performed using daily stream flow at five gauges within the basin. Results demonstrate that the RRS simulates stream flow at all gauges with relative errors varying from -22% to 3% and Nash-Sutcliffe coefficients varying from 0.62 to 0.90. DWI varies from 24% to 67% of the base flow as a function of the sub-basin. The relatively simple reservoir DWI approach is quite robust, and further improvements would likely necessitate more complex solutions (e.g., considering seasonality and soil type in ISBA); thus, such modifications are recommended for future studies. Although the evaluation shows that the simulated stream flows are generally satisfactory, further field investigations are necessary to confirm some of the model assumptions.

Multidisciplinary↗

An Incremental Tensor Train Decomposition Algorithm

We present a new algorithm for incrementally updating the tensor train decomposition of a stream of tensor data. This new algorithm, called the tensor train incremental core expansion (TT-ICE) improves upon the current state-of-the-art algorithms for compressing in tensor train format by developing a new adaptive approach that incurs significantly slower rank growth and guarantees compression accuracy. This capability is achieved by limiting the number of new vectors appended to the TT-cores of an existing accumulation tensor after each data increment. These vectors represent directions orthogonal to the span of existing cores and are limited to those needed to represent a newly arrived tensor to a target accuracy. We provide two versions of the algorithm: TT-ICE and TT-ICE accelerated with heuristics (TT-ICE*). Here, we provide a proof of correctness for TT-ICE and empirically demonstrate the performance of the algorithms in compressing large-scale video and scientific simulation datasets. Compared to existing approaches that also use rank adaptation, TT-ICE* achieves 57× higher compression and up to 95% reduction in computational time.

97 MATHEMATICS AND COMPUTING↗

Synchronization tracking in pulse position modulation receiver

A clock pulse generator for decoding pulse position modulation in an optical communication receiver is synchronized by a delay tracking loop which multiplies impulses of a data pulse by the square wave clock pulses from the generator to produce positive impulses when the clock pulse is of one level, and negative impulses when the clock pulse is of another level. A delay tracking loop integrates the impulses and produces an error signal that adjusts the delay so the clock pulses will be synchronized with data pulses. A dead-time tau sub d is provided between data pulses of an interval tau sub p in the data pulse period tau. When synchronized, the average number of positive impulses integrated will equal the average number of negative impulses over the continuous stream of data pulses.

Vilnrotter, Victor A.↗