Search NASA⌕ Search

SEARCH · Search NASA

Results for “Symbolic computing”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Security Analysis of a Class of Spread Spectrum Systems Presentation

A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain estimates of relevant entropy values, which will then be used to quantify the rate of information recovery as more data is transmitted. It turns out that such information recovery requires the adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Catalyst: Fast and flexible modeling of reaction networks

We introduce Catalyst.jl, a flexible and feature-filled Julia library for modeling and high-performance simulation of chemical reaction networks (CRNs). Catalyst supports simulating stochastic chemical kinetics (jump process), chemical Langevin equation (stochastic differential equation), and reaction rate equation (ordinary differential equation) representations for CRNs. Through comprehensive benchmarks, we demonstrate that Catalyst simulation runtimes are often one to two orders of magnitude faster than other popular tools. More broadly, Catalyst acts as both a domain-specific language and an intermediate representation for symbolically encoding CRN models as Julia-native objects. This enables a pipeline of symbolically specifying, analyzing, and modifying CRNs; converting Catalyst models to symbolic representations of concrete mathematical models; and generating compiled code for numerical solvers. Leveraging ModelingToolkit.jl and Symbolics.jl, Catalyst models can be analyzed, simplified, and compiled into optimized representations for use in numerical solvers. Finally, we demonstrate Catalyst’s broad extensibility and composability by highlighting how it can compose with a variety of Julia libraries, and how existing open-source biological modeling projects have extended its intermediate representation.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Security Analysis of a Class of Secured Spread Spectrum Systems

Abstract—A method of adding physical layer security to a class of spread spectrum systems has been recently proposed. In this paper, we look into the rate at which an eavesdropper may gain information about the system to decipher the data symbols. The Shannon mutual information is used to measure the rate of information that may be gained by an eavesdropper. The k-nearest neighbors (k-NN) method is used to obtain the estimates of relevant entropy values which will be then used to quantify the rate of information recovery as more data are being transmitted. It turns out that such information recovery requires adoption of special methods that avoid any destructive bias in the estimates. Details of these methods are also presented.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Numerical similarity solution for a variable coefficient K(m, n) equation

A technique for finding numerical similarity solutions to an initial boundary value problem (IBVP) for generalized K(m, n) equations is described. The equation under consideration is nonlinear and has variable coefficients. The original problem is transformed with the aid of Lie symmetries to an initial value problem (IVP) for a nonlinear third-order ordinary differential equation. The existence and uniqueness of the solution are examined, and the problem is consequently solved with the aid of a finite-difference scheme for various values of the governing parameters. In lieu of an exact symbolic solution, the scheme is validated by comparing the numerical solutions with the approximate analytic solutions obtained with the aid of the method of successive approximations in their region of validity. The accuracy, efficiency, and consistency of the scheme are demonstrated. Numerical solutions to the original initial boundary value problem are constructed for selected parameter values with the aid of the transforms. The qualitative behavior of the solutions as a function of the governing parameters is analyzed, and it is found that the examined IBVPs for generalized K(m, n) equations with variable coefficients that are functions of time, do not admit solitary wave or compacton solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Structure-preserving numerical discretizations for domains with boundaries

This SAND report documents Exploratory Express LDRD Project 223790, "Structure-preserving numerical discretizations for domains with boundaries", which developed a method to incorporate consistent treatment of domain boundaries and arbitrary boundary conditions in discrete exterior calculus (DEC) for arbitrary polygonal (2D) and tensor-product structure prism (3D) grids. The new DEC required the development of novel discrete exterior derivatives, boundary operators, wedge products and Hodge stars. This was accomplished through the use of boundary extension and the blending of known 2D operators on the interior with 1D operators on the boundary. The Hodge star was based on the Voronoi Hodge star, and retained the limitation of a triangular circumcentric primal or dual grid along with low-order accuracy. In addition to the new DEC, two related software packages were written: one for the study of DEC operators on arbitrary polygonal and polyhedral grids using both symbolic and numerical approaches and one for a (thermal) shallow water testbed using TRiSK-type numerics. Immediately relevant (already funded, through CANGA) followup work is the development of a high-order, geometrically flexible Hodge star and structure-preserving, high-order, oscillation-limiting transport operators (using WENO) for n-forms on arbitrary 2D and 3D grids. This will provide all of the machinery required for a high-order version of TRiSK with boundaries on arbitrary 2D and tensor-product 3D grids, which is applicable to both the atmospheric (CRM in E3SM-MMF) and oceanic (MPAS-O) components of E3SM.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis

Local Fourier analysis is a useful tool for predicting and analyzing the performance of many efficient algorithms for the solution of discretized PDEs, such as multigrid and domain decomposition methods. The crucial aspect of local Fourier analysis is that it can be used to minimize an estimate of the spectral radius of a stationary iteration, or the condition number of a preconditioned system, in terms of a symbol representation of the algorithm. In practice, this is a “minimax” problem, minimizing with respect to solver parameters the appropriate measure of work, which involves maximizing over the Fourier frequency. Often, several algorithmic parameters may be determined by local Fourier analysis in order to obtain efficient algorithms. Analytical solutions to minimax problems are rarely possible beyond simple problems; the status quo in local Fourier analysis involves grid sampling, which is prohibitively expensive in high dimensions. In this paper, we propose and explore optimization algorithms to solve these problems efficiently. Finally, several examples, with known and unknown analytical solutions, are presented to show the effectiveness of these approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multi-threaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0x and 6.8x on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3x over the multi-thread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗
DOE OSTI2021

Revisiting Huffman Coding: Toward Extreme Performance on Modern GPU Architectures

Today's high-performance computing (HPC) applications are producing vast volumes of data, which are challenging to store and transfer efficiently during the execution, such that data compression is becoming a critical technique to mitigate the storage burden and data movement cost. Huffman coding is arguably the most efficient Entropy coding algorithm in information theory, such that it could be found as a fundamental step in many modern compression algorithms such as DEFLATE. On the other hand, today's HPC applications are more and more relying on the accelerators such as GPU on supercomputers, while Huffman encoding suffers from low throughput on GPUs, resulting in a significant bottleneck in the entire data processing. In this paper, we propose and implement an efficient Huffman encoding approach based on modern GPU architectures, which addresses two key challenges: (1) how to parallelize the entire Huffman encoding algorithm, including codebook construction, and (2) how to fully utilize the high memory-bandwidth feature of modern GPU architectures. The detailed contribution is fourfold. (1) We develop an efficient parallel codebook construction on GPUs that scales effectively with the number of input symbols. (2) We propose a novel reduction based encoding scheme that can efficiently merge the codewords on GPUs. (3) We optimize the overall GPU performance by leveraging the state-of-the-art CUDA APIs such as Cooperative Groups. (4) We evaluate our Huffman encoder thoroughly using six real-world application datasets on two advanced GPUs and compare with our implemented multithreaded Huffman encoder. Experiments show that our solution can improve the encoding throughput by up to 5.0× and 6.8× on NVIDIA RTX 5000 and V100, respectively, over the state-of-the-art GPU Huffman encoder, and by up to 3.3× over the multithread encoder on two 28-core Xeon Platinum 8280 CPUs.

Tian, Jiannan↗
DOE OSTI2018

GrammarViz 3.0: Interactive Discovery of Variable-Length Time Series Patterns

The problems of recurrent and anomalous pattern discovery in time series, e.g., motifs and discords, respectively, have received a lot of attention from researchers in the past decade. However, since the pattern search space is usually intractable, most existing detection algorithms require that the patterns have discriminative characteristics and have its length known in advance and provided as input, which is an unreasonable requirement for many real-world problems. In addition, patterns of similar structure, but of different lengths may co-exist in a time series. In order to address these issues, we have developed algorithms for variable-length time series pattern discovery that are based on symbolic discretization and grammar inference—two techniques whose combination enables the structured reduction of the search space and discovery of the candidate patterns in linear time. In this work, we present GrammarViz 3.0—a software package that provides implementations of proposed algorithms and graphical user interface for interactive variable-length time series pattern discovery. The current version of the software provides an alternative grammar inference algorithm that improves the time series motif discovery workflow, and introduces an experimental procedure for automated discretization parameter selection that builds upon the minimum cardinality maximum cover principle and aids the time series recurrent and anomalous pattern discovery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Machine learning of superconducting critical temperature from Eliashberg theory

Abstract The Eliashberg theory of superconductivity accounts for the fundamental physics of conventional superconductors, including the retardation of the interaction and the Coulomb pseudopotential, to predict the critical temperature T c . McMillan, Allen, and Dynes derived approximate closed-form expressions for the critical temperature within this theory, which depends on the electron–phonon spectral function α 2 F ( ω ). Here we show that modern machine-learning techniques can substantially improve these formulae, accounting for more general shapes of the α 2 F function. Using symbolic regression and the SISSO framework, together with a database of artificially generated α 2 F functions and numerical solutions of the Eliashberg equations, we derive a formula for T c that performs as well as Allen–Dynes for low- T c superconductors and substantially better for higher- T c ones. This corrects the systematic underestimation of T c while reproducing the physical constraints originally outlined by Allen and Dynes. This equation should replace the Allen–Dynes formula for the prediction of higher-temperature superconductors.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regenerate the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Compositional Dataflow Via Abstract Transition Systems

Despite decades of research and development of dataflow analyses within dozens of different compiler infrastructures, analysis of real programs is intractable in practice. The reason is that although a single research group is equipped to model a single well-defined aspect of application behavior, application developers use a very wide range of abstractions and coding techniques within a single application. Since to analyze even a single application all of its complexities must be modeled, researchers must combine analyses from multiple groups into comprehensive analysis frameworks such as OpenAnalysis or LLVM. Analysis composition is expensive in practice, requiring development effort that is quadratic in the number of analyses as well as tight inter-group coordination to maintain consistent APIs to each other’s symbolic abstractions. This paper proposes an approach to building compiler analysis frameworks that simplifies the composition of independently-developed analyses. It formalizes the operation of dataflow analyses in a way that simplifies reasoning about various types of analysis composition. Further, it defines a portable abstraction that can represent the results of many real analyses, making it possible for different analyses to leverage each other’s results with no knowledge of their APIs or internal abstractions and without any coordination between the groups that developed them. We have developed the Fuse compositional analysis framework based on this abstraction, and integrated it in the ROSE [15] compilation system. Our experience is that this approach greatly simplifies composition of program analyses, making it easy to tailor different combinations of program analyses to different input programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Methods and apparatuses using filter banks for multi-carrier spread spectrum signals

A transmitter includes a synthesis filter bank to spread a data symbol to a plurality of frequencies by encoding the data symbol on each frequency, apply a common pulse-shaping filter, and apply gains to the frequencies such that a power level of each frequency is less than a noise level of other communication signals within the spectrum. Each frequency is modulated onto a different evenly spaced subcarrier. A demodulator in a receiver converts a radio frequency input to a spread-spectrum signal in a baseband. A matched filter filters the spread-spectrum signal with a common filter having characteristics matched to the synthesis filter bank in the transmitter by filtering each frequency to generate a sequence of narrow pulses. A carrier recovery unit generates control signals responsive to the sequence of narrow pulses suitable for generating a phase-locked loop between the demodulator, the matched filter, and the carrier recovery unit.

42 ENGINEERING↗
DOE OSTI2019

Final Report for Transmission of Information by Acoustic Communication along Metal Pathways in Nuclear Facilities

Transmission of information using elastic waves on existing metallic pipes provides an alternative communication option for a nuclear facility. The advantages of this approach consist of transmitting information through barriers, such as the containment building wall. A viable candidate for acoustic communication channel is a chemical volume control system (CVCS) stainless steel pipe, which penetrates through the containment building wall. A laboratory bench-scale system consisting of a nuclear grade CVCS-like pipe and ultrasonic transducers was assembled for a preliminary communication system analysis. Because of low bandwidth and spectral dispersion of ultrasonic transducers, on off keying (OOK) protocol was chosen for data communication. Operation of the acoustic communication during normal and post-accident conditions involves data transmission on the CVCS pipe, which according to literature guidelines, will be at 50°C and 150°C, respectively. Preliminary communication system development was performed using paintbrush PZT transducers capable of continuous operation at temperatures up to 80°C. Next, high-temperature LiNbO 3 acoustic transducers, originally developed for flow metering applications of EBRII reactor at Argonne, were utilized to develop a high-temperature acoustic communication system. A Gaussian pulse shape filter was introduced to suppress ringing and thus reduce inter-symbol interference. This resulted in enhancement of data transmission bitrate. Heating tapes, temperature controllers, and thermal insulation were installed on the laboratory pipe to study acoustic communication at elevated temperature. This included development of custom insertion heating elements for controlling temperature at pipe ends. Demonstrations of communication at high temperature included transmission of images and text files. Main achievements thus far include demonstration of transmission of 90KB image at the bitrate of 10Kbps with bit error rate smaller than 10 -3 across the pipe heated to 50°C and 150°C. Final phase of project development involved investigating strategies for deployment of the ultrasonic communication system in a representative environment. Mechanisms Engineering Test Loop (METL) facility at ANL was chosen as a viable candidate for communication system demonstration. Analysis of piping manifolds at METL has shown that in a typical scenario, ultrasonic signals have to be transmitted over straight and bent piping sections. This report describes preliminary studies on transmission of information with ultrasonic shear waves across bent piping sections. A test article consisting of a stainless steel pipe bent at 90° was developed for laboratory analysis of ultrasonic signal transmission. The bent piping test article developed by welding two straight pipes to an elbow. For consistency, the diameter and wall thickness of the bent pipe is the same as that of the straight pipe utilized in prior studies. COMSOL computer simulations were performed to study ultrasonic refracted shear wave coupling and transmission across bent piping. Preliminary evaluations of ultrasonic shear wave transmission were conducted with piezoelectric (PZT) and LiNbO 3 transducers, with the signals recorded with previously developed LabView interface. Preliminary results have shown significant dispersion of transmitted signals, most likely due to reflections and scattering by piping welds. Signal distortion compensation algorithm based on time reversal modulation (TRM) was initially investigated for transmission through solids, and demonstrated for signals transmitted over the bent pipe. Using TRM, it was shown that communication bitrates of 100Kbps were achievable, in principle.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

A Method of Estimating Sparse and Doubly-Dispersive Channels

The large delay and Doppler spreads of skywave high-frequency (HF) channels complicates channel acquisition, especially in low-SNR conditions. Using pilot-symbol assisted modulation, we develop a robust method to acquire channel information by first estimating the power-delay profile (PDP) of the channel, then applying that estimate to obtain the channel coefficients only where the PDP is nonzero. We find the presented approach to be robust at low-SNRs, making it suitable for spread-spectrum and underlay waveforms. We show that this two-stage channel acquisition procedure has three advantages: i),the channel is estimated with fewer terms, reducing complexity; ii), the MSE of the channel estimate is lower than assuming a fixed channel length; and iii), each propagation mode is reliably recovered in high-Doppler conditions. We conclude this paper by presenting results of the developed techniques as applied to a filter-bank multicarrier spread-spectrum (FBMC-SS) waveform.

42 ENGINEERING↗
DOE OSTI2025

Filterbank Multicarrier Communications for High Mobility Underwater Acoustic Links

This paper presents a new method of designing prototype filters that are robust against time and frequency dispersive (i.e., doubly dispersive) underwater acoustic (UWA) channels. The proposed design uses a modified form of Slepian sequences as a basis set to arrive at a design that is maximally compact along both time and frequency/Doppler dimensions. This keeps the inter-symbol interference confined to a small number of adjacent data symbols, both across time and frequency dimensions. It also minimizes the ramp-up (at the beginning) and ramp-down (at the end) of each synthesized data packet. Here, we test our design by making use of the BELLHOP/VirTex channel simulator and compare its performance with that of the widely used orthogonal frequency division multiplexing (OFDM) method. Our emphasis is on scenarios where the channel impulse response extends to a few hundreds of milli-seconds and the relative speed of communicating vehicles can be as large as 10 m/s. We find that while OFDM fails in majority of these scenarios, the proposed design continues to work well in all the scenarios that we simulate.

97 - MATHEMATICS AND COMPUTING↗