Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “analytics”

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,639 records · Page 91
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Interplay between parity-time symmetry, supersymmetry, and nonlinearity: An analytically tractable case example

In the present work, we combine the notion of parity-time (PT) symmetry with that of supersymmetry (SUSY) for a prototypical case example with a complex potential that is related by SUSY to the so-called Pöschl-Teller potential which is real. Not only are we able to identify and numerically confirm the eigenvalues of the relevant problem, but we also show that the corresponding nonlinear problem, in the presence of an arbitrary power-law nonlinearity, has an exact bright soliton solution that can be analytically identified and has intriguing stability properties, such as an oscillatory instability, which is absent for the corresponding solution of the regular nonlinear Schrödinger equation with arbitrary power-law nonlinearity. The spectral properties and dynamical implications of this instability are examined. Furthermore, we believe that these findings may pave the way toward initiating a fruitful interplay between the notions of PT symmetry, supersymmetric partner potentials, and nonlinear interactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Analytic expressions for electron-ion temperature equilibration rates from the Lenard-Balescu equation

In this paper, we elucidate the mathematical structure of the integral that arises when computing the electron-ion temperature equilibration time for a homogeneous weakly coupled plasma from the Lenard-Balescu equation. With some minor approximations, we derive an analytic formula, requiring no input Coulomb logarithm, for the equilibration rate that is valid for moderate electron-ion temperature ratios and arbitrary electron degeneracy. Lastly, for large temperature ratios, we derive the necessary correction to account for the coupled-mode effect, which can be evaluated very efficiently using ordinary Gaussian quadrature.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

Analytic Solution of the Boltzmann Equation in an Expanding System

For a massless gas with a constant cross section in a homogeneous, isotropically expanding spacetime we reformulate the relativistic Boltzmann equation as a set of nonlinear coupled moment equations. For a particular initial condition this set can be solved exactly, yielding the first analytical solution of the Boltzmann equation for an expanding system. Finally, the nonequilibrium behavior of this relativistic gas can be mapped onto that of a homogeneous, static nonrelativistic gas of Maxwell molecules.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

Spacecraft Observations and Analytic Theory of Crescent-Shaped Electron Distributions in Asymmetric Magnetic Reconnection

Supported by a kinetic simulation, we derive in this paper an exclusion energy parameter ${\mathcal{E}}_{X}$ providing a lower kinetic energy bound for an electron to cross from one inflow region to the other during magnetic reconnection. As by a Maxwell demon, only high-energy electrons are permitted to cross the inner reconnection region, setting the electron distribution function observed along the low-density side separatrix during asymmetric reconnection. Finally, the analytic model accounts for the two distinct flavors of crescent-shaped electron distributions observed by spacecraft in a thin boundary layer along the low-density separatrix.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Analytical and numerical studies of dark current in radiofrequency structures for short-pulse high-gradient acceleration

High-gradient acceleration is a key research area that could enable compact linear accelerators for future colliders, light sources, and other applications. In the pursuit of high-gradient operation, rf breakdown limits the attainable accelerating gradient in normal-conducting rf structures. Recent experiments at the Argonne Wakefield Accelerator suggest a promising approach: using short rf pulses with durations of a few nanoseconds. Experimental studies show that these 𝒪⁡(1⁢ ⁢ns) rf pulses can mitigate breakdown limitations, resulting in higher gradients. For example, an electric field of nearly 400 MV/m was achieved in an 𝑋-band photoemission gun driven by 6-ns-long rf pulses, with rapid rf conditioning and low dark current observed. Despite these promising results, the short-pulse regime remains an underexplored parameter space, and rf breakdown physics under nanosecond-long pulses requires further investigation. In this paper, we present analytical and numerical simulations of dark current dynamics in accelerating cavities operating in the short-pulse regime. We study breakdown-associated processes spanning different time scales, including field emission, multipacting, and plasma formation, using simulations of the 𝑋-band photogun cavities. The results reveal the advantages of using short rf pulses to reduce dark current and mitigate rf breakdown, offering a path toward a new class of compact accelerators with enhanced performance and reduced susceptibility to breakdown.

Linear accelerators↗
DOE OSTI2026

Analytical desmearing of Bonse–Hart ultra-small-angle neutron scattering data via truncated Abel inversion

A non-iterative analytical framework based on the truncated Abel inversion is developed for desmearing Bonse–Hart ultra-small-angle neutron scattering (USANS) data. The method directly inverts the slit-averaged intensity without empirical extrapolation or iterative regularization, establishing a closed-form relationship between the measured and intrinsic scattering profiles. Numerical benchmarks on representative models, including a rigid-line form factor, a Lorentzian function and a fractal structural model, demonstrate quantitative recovery of the ground-truth intensity across the full Q range. Application to a deuterated polystyrene/poly(2-vinylpyridine) blend further confirms that the approach yields smooth continuous profiles consistent with companion small-angle neutron scattering data. The truncated Abel inversion thus provides a stable, model-independent and physically transparent route for accurate desmearing of Bonse–Hart USANS measurements.

Huang, Guan-Rong [National Tsing Hua University, T↗
DOE OSTI2022

Analytic descriptions of parabolic X-ray mirrors

On X-ray beamlines and telescopes, glancing-incidence mirrors with parabolic profiles are used to collimate, focus, and collect light. Here, analytic descriptions for paraboloidal, plane-parabolic, and parabolic cylindrical mirrors in several congruent geometries that are commonly used in fabrication, metrology, and modeling are provided. The exact expressions are derived directly from Fermat's principle, without coordinate transformations, in several mirror-centered coordinate systems, including one with the surface tangent to the central point of intersection. Coefficients for a sixth-order polynomial series approximation are calculated for that coordinate system.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

On-demand data analytics in HPC environments at leadership computing facilities: Challenges and experiences

Scaling-up scientific data analysis and machine learning algorithms for data-driven discovery is a grand challenge that we face today. Despite the growing need for analysis from science domains that are generating `Big Data' from instruments and simulations, building high-performance analytical workflows of data-intensive algorithms have been daunting because: (i) the `Big Data' hardware and software architecture landscape is constantly evolving, (ii) newer architectures impose new programming models, and (iii) data-parallel kernels of analysis algorithms and their performance facets on different architectures are poorly understood. To address these problems, we have: (i) identified scalable data-parallel kernels of popular data analysis algorithms, (ii) implemented `Mini-Apps' of those kernels using different programming models (e.g. Map Reduce, MPI, etc.), (iii) benchmarked and validated the performance of the kernels in diverse architectures. In this paper, we discuss two of those Mini-Apps and show the execution of principal component analysis built as a workflow of the Mini-Apps. We show that Mini-Apps enable scientists to (i) write domain-specific data analysis code that scales on most HPC hardware and (ii) and offers the ability (most times with over a 10x speed-up) to analyze data sizes 100 times the size of what off-the-shelf desktop/workstations of today can handle.

Harney, John↗
DOE OSTI2016

Distributed and cloud-based multi-model analytics experiments on large volumes of climate change data in the earth system grid federation eco-system

A case study on climate models intercomparison data analysis addressing several classes of multi-model experiments is being implemented in the context of the EU H2020 INDIGO-DataCloud project. Such experiments require the availability of large amount of data (multi-terabyte order) related to the output of several climate models simulations as well as the exploitation of scientific data management tools for large-scale data analytics. More specifically, the paper discusses in detail a use case on precipitation trend analysis in terms of requirements, architectural design solution, and infrastructural implementation. The experiment has been tested and validated on CMIP5 datasets, in the context of a large scale distributed testbed across EU and US involving three ESGF sites (LLNL, ORNL, and CMCC) and one central orchestrator site (PSNC).

Fiore, S.↗
DOE OSTI2017

Scaling Up Data-Parallel Analytics Platforms: Linear Algebraic Operation Cases

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are key to supporting large scale data analysis that require efficient processing over millions of data samples. To this end, we present, ARION, a hardware acceleration based approach for scaling-up individual tasks of Spark, a popular data-parallel analytics platform. We support both linear algebraic operations of between two dense matrices, and between sparse and dense matrices in distributed environments. ARION provides a flexible control of acceleration according to matrix density, along with efficient scheduling based on runtime resource utilization. We demonstrate the benefit of our approach for general matrix multiplication operations over large matrices with up to four billion elements by using Gramian matrix computation that is commonly used in machine learning. Experiments show that our approach achieves more than 2× and 1.5× end-to-end performance speedups for dense and sparse matrices, respectively, and up to 57.04× faster computation compared to MLlib, a state of the art Spark-based implementation. This work is sponsored in part by the NSF under the grants: CNS-1565314, CNS-1405697, and CNS-1615411. The manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-00OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan). This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725.

Xu, Luna↗
DOE OSTI2019

Visual Analytics for Deep Embeddings of Large Scale Molecular Dynamics Simulations

Molecular Dynamics (MD) simulation have been emerging as an excellent candidate for understanding complex atomic and molecular scale mechanism of bio-molecules that control essential bio-physical phenomenon in a living organism. But this MD technique produces large-size and long-timescale data that are inherently high-dimensional and occupies many terabytes of data. Processing this immense amount of data in a meaningful way is becoming increasingly difficult. Therefore, specific dimensionality reduction algorithm using deep learning technique has been employed here to embed the high-dimensional data in a lower-dimension latent space that still preserves the inherent molecular characteristics i.e. retains biologically meaningful information. Subsequently, the results of the embedding models are visualized for model evaluation and analysis of the extracted underlying features. However, most of the existing visualizations for embeddings have limitations in evaluating the embedding models and understanding the complex simulation data. We propose an interactive visual analytics system for embeddings of MD simulations to not only evaluate and explain an embedding model but also analyze various characteristics of the simulations. Our system enables exploration and discovery of meaningful and semantic embedding results and supports the understanding and evaluation of results by the quantitatively described features of the MD simulations (even without specific labels).

Chae, Junghoon↗
DOE OSTI2020

Clustering-Based Predictive Analytics to Improve Scientific Data Discovery

Given the sheer volume of scientific data archived within the data-intensive projects at the US Department of Energy's Oak Ridge National Laboratory, finding precisely what data we are looking for may not be a trivial task; conversely, we may also miss a more prominent data product. To address such issues, we propose improving the data discovery system and using data analytics methods to comprehend what specific users might be interested in based on their physiological state, search patterns, and past data usage history. This work's primary goal is to prune the complexity, increase the visibility of popular data products, and direct users toward the data that best meet their needs. The proposed algorithm constructs a user profile based on the user's explicit or implicit interactions with the system, such as items they are currently looking at on-site and the key metadata mappings related to the data set. The pattern is then used to build a training data set, which will help find relevant data to recommend to the user.

Devarakonda, Ranjeet↗
DOE OSTI2017

On Analytics of File Transfer Rates over Dedicated Wide-Area Connections

File transfers between the decentralized storage sites over dedicated wide-area connections are becoming increasingly important in high-performance computing and big data scenarios. Designing such scientific workflows for large file transfers is extremely challenging as they depend on the file, I/O, host, and local- and wide-area network subsystems, and their interactions. To gain insights into file-transfer rate profiles, we develop polynomial, bagging, and boosting regression models for Lustre and XFS file transfer measurements, which are collected using XDD over a suite of 10 Gbps connections with 0-366 ms round trip times (RTTs). In addition to overall trends and analytics, these regressions also provide file-transfer rate estimates for RTTs and number of parallel flows at which measurements might not have been collected. They show that bagging and boosting techniques provide closer data fits than the polynomial regression. We develop probabilistic bounds on the generalization error of these methods, which combined with the cross-validation error establish that former two are more accurate estimators than the polynomial regression. In addition, we present a method to efficiently determine the number of parallel flows to achieve a peak file-transfer rate using fewer than full sweep measurements; in our measurements, the peak is achieved in 96% of cases with 15-25% of measurements of a full sweep.

Sen, Satyabrata↗
DOE OSTI2017

Applying Graph Analytics to Understand Compute Core Usage and Publication Trends in a Petascale Supercomputing Facility

The Oak Ridge Leadership Computing Facility (OLCF) runs Titan, the No. 4 supercomputer in the world, to deliver over four billion compute core hours every year to several scientific domains, in their pursuit of leadership science. In this paper, we analyze four years worth of heterogeneous log data sources from the OLCF resource fabric, capturing metadata on entities such as users (2,546), scientific project allocations (674), jobs (1,352,402) and publications (1,146), to derive insights into the trends in core hour usage and publications, across 35 science domains. We have constructed a scalable graph to represent the OLCF entities and apply rich graph analytics for our analysis. Based on this, we have analyzed the metadata across five dimensions, namely (1) quantitative analysis of Titan system usage, (2) quantitative analysis of OLCF publications, (3) correlation analysis between system usage and publications, (4) text analysis to derive OLCF research trends, and (5) utilization of graph mining for association analysis. To the best of our knowledge, our work is the first of its kind to apply graph- based big data techniques to provide comprehensive insights on an HPC center's core hour usage and users' publication trends. Our results provide valuable details into an HPC center's core allocation program, measuring the productivity of scientific domains, the interplay between core usage and research output, accelerating collaboration, and in predicting new connections between resource entities.

Lee, Sangkeun (Matt)↗
DOE OSTI2023

Energy-Centric Cooperative Onramp Merging Strategy: An Analytical Solution

Cooperative highway onramp merging plays an important role in mitigating highway traffic congestion. A crucial component of a cooperative merging system is the merging sequence strategy, which determines each merging participant's order to reach the merging point. Existing merging sequence strategies can be classified into rule-based and optimization-based approaches. The rule-based strategies can be effortlessly implemented with a light online computational burden. However, they may not achieve the optimal energy efficiency. In contrast, the optimization-based strategies can yield the optimal merging sequence to minimize fuel consumption, but typically involve computationally expensive numerical optimization. To leverage the advantages from both sides, we propose a novel merging sequence strategy that can minimize fuel consumption while avoiding online numerical optimization. The key idea is to analytically formulate the expected fuel consumption of each merging participant. Using a realistic highway onramp scenario based on the NGSIM dataset, we validate the performance and the computational efficiency of the proposed merging sequence strategy via SUMO/SIMULINK joint simulation.

Wang, Zejiang↗
DOE OSTI2015

High Level Synthesis of RDF Queries for Graph Analytics

In this paper we present a set of techniques that enable the synthesis of efficient custom accelerators for memory intensive, irregular applications. To address irregular applications challenges (large memory footprints, unpredictable fine- grained data accesses, and high synchronization intensity), and exploit their opportunities (thread level parallelism, memory level parallelism), we propose a novel accelerator design which take advantage of an adaptive and Distributed Controller (DC) architecture, and a Memory Interface (MI) that supports parallel memory subsystems. Among the multitude of algorithms that may benefit from our solution, we focus on the acceleration of graph analytics applications, and in particular, on the syn- thesis of SPARQL queries on Resource Description Framework (RDF) databases. We achieve this objective by incorporating the synthesis techniques into Bambu, an Open Source high- level synthesis tools, and interfacing the system with GEMS, the Graph database Engine for Multithreaded Systems. The front- end of GEMS generates optimized C implementations of the input queries, modeled as pattern matching routines, which are then automatically synthesized by Bambu. We validate our approach synthesizing several SPARQL queries from the Lehigh University Benchmark (LUBM).

HLS, FPGA, Convey, RDF, GEMS, Memory-intensive,↗
DOE OSTI2013

Integrating Online Compression to Accelerate Large-Scale Data Analytics Applications

Abstract—With growing dataset sizes, and as computing cycles are increasing faster than storage and wide-area bandwidths, compression appears like a promising approach for improving the performance of large-scale data analytics applications. In this context, this paper makes the following contributions. First, we develop a new compression methodology, which exploits the similarities between spatial and/or temporal neighbors in a simulation dataset, and enables high compression ratios and low decompression costs. Second, we have developed a framework that can be used to incorporate a variety of compression and decompression algorithms. This framework also supports a simple API to allow integration with an existing application or data processing middleware. Once a compression algorithm is implemented, this framework can allow multi-threaded retrieval, multi-threaded data decompression, and use of informed prefetching and caching. By integrating this framework with a data-intensive middleware, we have applied our compression methodology and framework to three applications over two datasets, including a GCRM climate model dataset. We obtained an average compression ratio of 51.68%, and up to 53.27% improvement in execution time of data analysis applications.

Big Data, I/O, HPC↗
DOE OSTI2016

X: A Comprehensive Analytic Model for Parallel Machines

To continuously comply with Moore’s Law, modern parallel machines become increasingly complex. Effectively tuning application performance for these machines therefore becomes a daunting task. Moreover, identifying performance bottlenecks at application and architecture level, as well as evaluating various optimization strategies, are becoming extremely difficult when the entanglement of numerous correlated factors is being presented. To tackle these challenges, we present a visual analytical model named “X”. It is intuitive and sufficiently flexible to track all the typical features of a parallel machine.

Modeling and Performance Analysis↗