Search NASA⌕ Search

SEARCH · Search NASA

Results for “large 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 181 records · Page 10

Lossy Data Compression Effects on Wall-bounded Turbulence: Bounds on Data Reduction

Postprocessing and storage of large data sets represent one of the main computational bottlenecks in computational fluid dynamics. We assume that the accuracy necessary for computation is higher than needed for postprocessing. Therefore, in the current work we assess thresholds for data reduction as required by the most common data analysis tools used in the study of fluid flow phenomena, specifically wall-bounded turbulence. These thresholds are imposed a priori by the user in L 2 -norm, and we assess a set of parameters to identify the minimum accuracy requirements. The method considered in the present work is the discrete Legendre transform (DLT), which we evaluate in the computation of turbulence statistics, spectral analysis and resilience for cases highly-sensitive to the initial conditions. Maximum acceptable compression ratios of the original data have been found to be around 97%, depending on the application purpose. Furthermore, the new method outperforms downsampling, as well as the previously explored data truncation method based on discrete Chebyshev transform (DCT).

97 MATHEMATICS AND COMPUTING↗

A Network Management System for Handling Scientific Data Flows

Large scientific data transfers often occur at high rates causing increased burstiness in Internet traffic. To limit the adverse effects of these high-rate large-sized flows, which are referred to as $\alpha $ flows, on delay-sensitive audio/video flows, a network management system called Alpha Flow Traffic Engineering System (AFTES) is proposed for intra-domain traffic engineering. An offline approach is used in which AFTES analyzes NetFlow records collected by routers, extracts source–destination address prefixes of $\alpha $ flows, and uses these prefixes to configure firewall filters at ingress routers of a provider’s network to redirect future $\alpha $ flows to traffic-engineered paths and isolated queues. The effectiveness of this scheme was evaluated through an analysis of 7 months of NetFlow data obtained from an ESnet router. For this data set, 91 % of bytes generated by $\alpha $ flows during high-rate intervals would have been directed had AFTES been deployed. The negative aspect of using address prefixes in firewall filters, i.e., the redirection of $\beta $ flows to $\alpha $-flow paths/queues, was also quantified.

97 MATHEMATICS AND COMPUTING↗

Development of the Model of Galactic Interstellar Emission for Standard Point-Source Analysis of Fermi Large Area Telescope Data

Most of the celestial γ rays detected by the Large Area Telescope (LAT) aboard the Fermi Gamma-ray Space Telescope originate from the interstellar medium when energetic cosmic rays interact with interstellar nucleons and photons. Conventional point and extended source studies rely on the modeling of this diffuse emission for accurate characterization. We describe here the development of the Galactic Interstellar Emission Model (GIEM) that is the standard adopted by the LAT Collaboration and is publicly available. The model is based on a linear combination of maps for interstellar gas column density in Galactocentric annuli and for the inverse Compton emission produced in the Galaxy. We also include in the GIEM large-scale structures like Loop I and the Fermi bubbles. The measured gas emissivity spectra con rm that the cosmic-ray proton density decreases with Galactocentric distance beyond 5 kpc from the Galactic Center. The measurements also suggest a softening of the proton spectrum with Galactocentric distance. We observe that the Fermi bubbles have boundaries with a shape similar to a catenary at latitudes below 20° and we observe an enhanced emission toward their base extending in the North and South Galactic direction and located within ~4° of the Galactic Center.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-E-T-235: Data Mining for Evaluating Treatment Performances Over a Large Quantity of Data to Monitor and Improve SBRT Workflow

Purpose: To quality assure a large quantity of retrospective treatment cases for treatment performances by randomly sampling is inefficient. Here we provide a method to efficiently monitor and investigate the QA of SBRT workflow over Mosaiq. Methods: The code developed with Microsoft SQL Server Management Studio 2008R2 and VBA was used for retrieving and sorting data from Mosaiq (version 2.3–2.6 during 2012–2015). SBRT patients were filtered by fractional dose over 350cGy and total fraction number less than 6, which SBRT prescriptions were defined. The quality assurance on the SBRT workflow was focused on the treatment deliveries such as patient positioning setup, CBCT indicated offsets and couch shifted corrections. The treatment delivery were done by Varian Truebeam systems and the record/verify by Mosaiq. Results: Total 82 SBRT patients corresponding to 103 courses and 854 CBCT images were found by the retrieval query. Most centers record daily pre-treatment (Pre-Tx: before treatment shift) image-guided shifts along treatment course for inter-fraction motion record, and it is useful to also verify it with post-treatment imaging (Post-Tx: after treatment CBCT verification) to verify intra-fraction motion. Analyzing the details of daily recorded shifts can reveals the information of patient-setup and staff’s record/verify behaviors. 3 examples were provided as solid evidences and on-going rectification for preventing future mistakes. Conclusions: The report gave feasible examples for inspector to verify a large amount of data during site investigation. This program can also be extended to a scheduled data mining with software to periodical analyze the timely records in Mosaiq, for example, a various control charts for different QA purposes. As the current trend of automation in radiation therapy field, the data mining would be a necessary tool in the future, just as the automatic plan quality evaluation has been under development in Eclipse.

60 APPLIED LIFE SCIENCES↗

PARAFAC_T1

This is a method of performing trilinear analysis on large data sets using a modification of the PARAFAC-ALS algorithm. It iteratively decomposes the data matrix into a core matrix and three loading matrices based on the Tucker1 model. The algorithm is particularly useful for data sets that are too large to upload into a computer?s main memory. While the performance advantage in utilizing our algorithm is dependent on the number of data elements and dimensions of the data array, we have seen a significant performance improvement over operating PARAFAC-ALS on the full data set. SAND2020-12649 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Van Benthem, Mark↗

Exploring Milkyway Halo Substructures with Large-Area Sky Surveys

Over the last two decades, our understanding of the Milky Way has been improved thanks to large data sets arising from large-area digital sky surveys. The stellar halo is now known to be inhabited by a variety of spatial and kinematic stellar substructures, including stellar streams and stellar clouds, all of which are predicted by hierarchical Lambda Cold Dark Matter models of galaxy formation. In this dissertation, we first present the analysis of spectroscopic observations of individual stars from the two candidate structures discovered using an M-giant catalog from the Two Micron All-Sky Survey. The follow-up observations show that one of the candidates is a genuine structure which might be associated with the Galactic Anticenter Stellar Structure, while the other one is a false detection due to the systematic photometric errors in the survey or dust extinction in low Galactic latitudes. We then presented the discovery of an excess of main sequence turn-off stars in the direction of the constellations of Eridanus and Phoenix from the first-year data of the Dark Energy Survey (DES) – a five-year, 5,000 deg2 optical imaging survey in the Southern Hemisphere. The Eridanus-Phoenix (EriPhe) overdensity is centered around l ~ 285° and b ~ -60° and the Poisson significance of the detection is at least 9σ. The EriPhe overdensity has a cloud-like morphology and the extent is at least ~ 4 kpc by ~ 3 kpc in projection, with a heliocentric distance of about d ~ 16 kpc. The EriPhe overdensity is morphologically similar to the previously-discovered Virgo overdensity and Hercules-Aquila cloud. These three overdensities lie along a polar plane separated by ~ 120° and may share a common origin. In addition to the scientific discoveries, we also present the work to improve the photometric calibration in DES using auxiliary calibration systems, since the photometric errors can cause false detection in first the halo substructure. We present a detailed description of the two auxiliary calibration systems built at Texas A&M University. We then discuss how the auxiliary systems in DES can be used to improve the photometric calibration of the systematic chromatic errors – source color-dependent systematic errors that are caused by variations in the wavelength dependence of the atmospheric transmission and the instrumental throughput.

79 ASTRONOMY AND ASTROPHYSICS↗

GPU-based relative fuzzy connectedness image segmentation

Purpose:Recently, clinical radiological research and practice are becoming increasingly quantitative. Further, images continue to increase in size and volume. For quantitative radiology to become practical, it is crucial that image segmentation algorithms and their implementations are rapid and yield practical run time on very large data sets. The purpose of this paper is to present a parallel version of an algorithm that belongs to the family of fuzzy connectedness (FC) algorithms, to achieve an interactive speed for segmenting large medical image data sets. Methods: The most common FC segmentations, optimizing an Script-Small-L {sub {infinity}}-based energy, are known as relative fuzzy connectedness (RFC) and iterative relative fuzzy connectedness (IRFC). Both RFC and IRFC objects (of which IRFC contains RFC) can be found via linear time algorithms, linear with respect to the image size. The new algorithm, P-ORFC (for parallel optimal RFC), which is implemented by using NVIDIA's Compute Unified Device Architecture (CUDA) platform, considerably improves the computational speed of the above mentioned CPU based IRFC algorithm. Results: Experiments based on four data sets of small, medium, large, and super data size, achieved speedup factors of 32.8 Multiplication-Sign , 22.9 Multiplication-Sign , 20.9 Multiplication-Sign , and 17.5 Multiplication-Sign , correspondingly, on the NVIDIA Tesla C1060 platform. Although the output of P-ORFC need not precisely match that of IRFC output, it is very close to it and, as the authors prove, always lies between the RFC and IRFC objects. Conclusions: A parallel version of a top-of-the-line algorithm in the family of FC has been developed on the NVIDIA GPUs. An interactive speed of segmentation has been achieved, even for the largest medical image data set. Such GPU implementations may play a crucial role in automatic anatomy recognition in clinical radiology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nuclear data uncertainty propagation and modeling uncertainty impact evaluation in neutronics core simulation

Uncertainty analysis is a critical requirement in reactor simulation as it is used to quantify the reliability of best-estimate calculation. A comprehensive uncertainty analysis should characterize all sources of uncertainties in a computationally-feasible and scientifically-defendable manner. Here we employ a well-established reduced order modeling (ROM) based uncertainty quantification methodology to propagate uncertainties throughout neutronic calculations. ROM relies on recent advances in randomized data mining techniques applied to large data streams. In our proposed implementation, the nuclear data uncertainties are first propagated from multi-group level through lattice physics calculation to generate few-group parameter uncertainties, described using a vector of mean values and a covariance matrix. Employing an ROM-based compression of the covariance matrix, the few-group uncertainties are then propagated through downstream core simulation in a computationally efficient manner. This straightforward approach, albeit efficient as compared to brute force forward and/or adjoint-based methods, often employs a number of assumptions that have been unquestioned in the literature of neutronic uncertainty analysis. This manuscript argues that these assumptions could introduce another source of uncertainty referred to as modeling uncertainties, whose magnitude needs to be quantified in tandem with nuclear data uncertainties. Thus, our primary goal is to explore the interactions between these two uncertainty sources in order to assess whether modeling uncertainties have an impact on parameter uncertainties. To explore this endeavor, the impact of a number of modeling assumptions on core attributes uncertainties is quantified. The study employs a CANDU reactor model, with Serpent and NEWT as lattice physics solvers and NESTLE-C as core simulator. The modeling assumptions investigated include those related with the uncertainty propagation method employed, e.g., deterministic vs. stochastic, the few-group energy structure employed to represent the cross-sections, the resonance treatment in lattice physics calculation, the reference values for the cross-section, and the number of samples employed to render ROM compression. Results indicate that some of the modeling assumptions could have a non-negligible impact on the core responses propagated uncertainties, highlighting the need for a more comprehensive approach to combine parameter and modeling uncertainties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A data integration framework of additive manufacturing based on FAIR principles

Abstract Laser-powder bed fusion (L-PBF) is a popular additive manufacturing (AM) process with rich data sets coming from both in situ and ex situ sources. Data derived from multiple measurement modalities in an AM process capture unique features but often have different encoding methods; the challenge of data registration is not directly intuitive. In this work, we address the challenge of data registration between multiple modalities. Large data spaces must be organized in a machine-compatible method to maximize scientific output. FAIR (findable, accessible, interoperable, and reusable) principles are required to overcome challenges associated with data at various scales. FAIRified data enables a standardized format allowing for opportunities to generate automated extraction methods and scalability. We establish a framework that captures and integrates data from a L-PBF study such as radiography and high-speed camera video, linking these data sets cohesively allowing for future exploration. Graphical abstract

36 MATERIALS SCIENCE↗

SLIP (Surrogate Launching and Integration Platform)

SLIP (Surrogate Launching and Integration Platform) is a software ecosystem for downloading and running ML/AI benchmarks. SLIP automatically downloads and sets up the code and data running a benchmark. The large data sets and model code are cached locally with a specific ID within a designated cache directory.

Brown, Cade↗

Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match quality scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.

97 MATHEMATICS AND COMPUTING↗

Search for Cosmic-Ray Electron and Positron Anisotropies with Seven Years of Fermi Large Area Telescope Data

We present the Large Area Telescope on board the Fermi Gamma-ray Space Telescope that has collected the largest ever sample of high-energy cosmic-ray electron and positron events since the beginning of its operation. Potential anisotropies in the arrival directions of cosmic-ray electrons or positrons could be a signature of the presence of nearby sources. We use almost seven years of data with energies above 42 GeV processed with the Pass 8 reconstruction. The present data sample can probe dipole anisotropies down to a level of 10 -3 . We take into account systematic effects that could mimic true anisotropies at this level. We present a detailed study of the event selection optimization of the cosmic-ray electrons and positrons to be used for anisotropy searches. Since no significant anisotropies have been detected on any angular scale, we present upper limits on the dipole anisotropy. Lastly, the present constraints are among the strongest to date probing the presence of nearby young and middle-aged sources.

79 ASTRONOMY AND ASTROPHYSICS↗

Design Principles for Effective Knowledge Discovery from Big Data

Big data phenomenon refers to the practice of collection and processing of very large data sets and associated systems and algorithms used to analyze these massive datasets. Architectures for big data usually range across multiple machines and clusters, and they commonly consist of multiple special purpose sub-systems. Coupled with the knowledge discovery process, big data movement offers many unique opportunities for organizations to benefit (with respect to new insights, business optimizations, etc.). However, due to the difficulty of analyzing such large datasets, big data presents unique systems engineering and architectural challenges. In this paper, we present three sys- tem design principles that can inform organizations on effective analytic and data collection processes, system organization, and data dissemination practices. The principles presented derive from our own research and development experiences with big data problems from various federal agencies, and we illustrate each principle with our own experiences and recommendations.

Architecture↗

Nanoscale Cluster Detection in Massive Atom Probe Tomography Data

Recent technological advances in atom probe tomography (APT) have led to unprecedented data acquisition capabilities that routinely generate data sets containing hundreds of millions of atoms. Detecting nanoscale clusters of different atom types present in these enormous amounts of data and analyzing their spatial correlations with one another are fundamental to understanding the structural properties of the material from which the data is derived. Extant algorithms for nanoscale cluster detection do not scale to large data sets. Here, a scalable, CUDA-based implementation of an autocorrelation algorithm is presented. It isolates spatial correlations amongst atomic clusters present in massive APT data sets in linear time using a linear amount of storage. Correctness of the algorithm is demonstrated using large synthetically generated data with known spatial distributions. Benefits and limitations of using GPU-acceleration for autocorrelation-based APT data analyses are presented with supporting performance results on data sets with up to billions of atoms. To our knowledge, this is the first nanoscale cluster detection algorithm that scales to massive APT data sets and executes on commodity hardware.

Seal, Sudip K↗

Advance Network Reservation and Provisioning for Science

We are witnessing a new era that offers new opportunities to conduct scientific research with the help of recent advancements in computational and storage technologies. Computational intensive science spans multiple scientific domains, such as particle physics, climate modeling, and bio-informatics simulations. These large-scale applications necessitate collaborators to access very large data sets resulting from simulations performed in geographically distributed institutions. Furthermore, often scientific experimental facilities generate massive data sets that need to be transferred to validate the simulation data in remote collaborating sites. A major component needed to support these needs is the communication infrastructure which enables high performance visualization, large volume data analysis, and also provides access to computational resources. In order to provide high-speed on-demand data access between collaborating institutions, national governments support next generation research networks such as Internet 2 and ESnet (Energy Sciences Network). Delivering network-as-a-service that provides predictable performance, efficient resource utilization and better coordination between compute and storage resources is highly desirable. In this paper, we study network provisioning and advanced bandwidth reservation in ESnet for on-demand high performance data transfers. We present a novel approach for path finding in time-dependent transport networks with bandwidth guarantees. We plan to improve the current ESnet advance network reservation system, OSCARS [3], by presenting to the clients, the possible reservation options and alternatives for earliest completion time and shortest transfer duration. The Energy Sciences Network (ESnet) provides high bandwidth connections between research laboratories and academic institutions for data sharing and video/voice communication. The ESnet On-Demand Secure Circuits and Advance Reservation System (OSCARS) establishes guaranteed bandwidth of secure virtual circuits at a certain time, for a certain bandwidth and length of time. Though OSCARS operates within the ESnet, it also supplies end-to-end provisioning between multiple autonomous network domains. OSCARS gets reservation requests through a standard web service interface, and conducts a Quality-of-service (QoS) path for bandwidth guarantees. Multi-protocol Label Switching (MPLS) and the Resource Reservation Protocol (RSVP) enable to create a virtual circuit using Label Switched Paths (LSP's). It contains three main components: a reservation manager, a bandwidth scheduler, and a path setup subsystem. The bandwidth scheduler needs to have information about the current and future states of the network topology in order to accomplish end-to-end bandwidth guaranteed paths.

97 MATHEMATICS AND COMPUTING↗

Parallel variable selection for effective performance prediction

Large data analysis problems often involve a large number of variables, and the corresponding analysis algorithms may examine all variable combinations to find the optimal solution. For example, to model the time required to complete a scientific workflow, we need to consider the impact of dozens of parameters. To reduce the model building time and reduce the likelihood of overfitting, we look to variable selection methods to identify the critical variables for the performance model. In this work, we create a combination of variable selection and performance prediction methods that is as effective as the exhaustive search approach when the exhaustive search could be completed in a reasonable amount of time. To handle the cases where the exhaustive search is too time consuming, we develop the parallelized variable selection algorithm. Additionally, we develop a parallel grouping mechanism that further reduces the variable selection time by 70%.As a case study, we exercise the variable selection technique with the performance measurement data from the Palomar Transient Factory (PTF) workflow. The application scientists have determined that about 50 variables and parameters are important to the performance of the workflows. Our tests show that the Sequential Backward Selection algorithm is able to approximate the optimal subset relatively quickly. By reducing the number of variables used to build the model from 50 to 4, we are able to maintain the prediction quality while reducing the model building time by a factor of 6. Using the parallelization and grouping techniques we developed in this work, the variable selection process was reduced from over 18 hours to 15 minutes while ending up with the same variable subset.

Wang, J↗

Crack detection in fuel cell electrodes using a spatial filtering technique for overcoming noisy backgrounds

Image processing is a powerful tool that allows for rapid and automated data parsing in settings that occupy large variable spaces and require large data sets. Feature detection on difficultly discerned backgrounds is a subset of image processing that facilitates the extraction of quantitative metrics from otherwise subjective data. Crack detection and quantification is an important capability in polymer electrolyte membrane fuel cell quality control, failure analysis, and optimization. This work presents a technique to perform crack detection and quantification which overcomes challenges faced by commonly used image segmentation techniques. We demonstrate the use of a geometrically filtered noise‐level detection technique to select a binary threshold value from which we then quantify how cracked a sample is. Furthermore, we demonstrate the accuracy of our technique using programmatically generated test images of known crack amounts and their performance on real‐world fuel cell catalyst layer samples.

30 DIRECT ENERGY CONVERSION↗

Methods and Models for Analyzing Methane Sorption Capacity of Coal Based on Its Physicochemical Characteristics

The authors study the influence of physicochemical parameters on methane adsorption capacity of coal and offer the analytical method for the methane adsorption capacity for three-phased condition of methane. It is found that in the depth interval to 300 m below surface, methane adsorption capacity measured in lab can exceed natural gas content of coal obtained from geological exploration data by 30%, and the change in the thermodynamic condition of coal–methane system brings irreversible physicochemical consequences in terms of the altered ratios of physical states of the main components. There is no linear connection between natural gas content of a coal bed and its methane adsorption capacity with respect to occurrence depth. The application of Big Data in treatment and interpretation of large data flows is described. The theoretical data predicted using the proposed method and the experimental data on methane content of Kuzbass coal agree.

01 COAL, LIGNITE, AND PEAT↗