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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

FASTMap v. 2010.01

FASTMap is mapping application available for the web or on mobile devices (IOS and Android) that browses geospatial data and produces detailed reports of objects within any area of analysis. FASTMap can access any geospatial dataset. The software can provide immediate access to the selected data through a fully symbolized interactive mapping interface. FASTMap can load arbitrary contours that represent a region of interest and can dynamically identify and geospatially select objects that reside within the region. The software can produce a report listing the objects and aggregations for the region, as well as producing publication quality maps. FASTMap also has the ability to post and maintain authored maps, any GIS data included in the map, areas of interest, as well as any titles, and labels. These defining ingredients of a map are called map contexts. These mao contexts can be instantly broadcast via the internet through any of an infinite number of named channels to small or large numbers of users monitouring any of the channels being posted to, so a user can author a map and immediately share that map with others instantly, whether they are on traditional desktop computer, laptop, mobile tablet or smartphone. Further, users receiving broadcast maps can also alter the maps can also alter the maps, or create new ones and publish back to the channel in a collaborative manner. FASTMap can be configured to access virtually any geospatial data.

Bynum, Leo↗
DOE OSTI2021

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Native glycosylated HIV-1 Env in silico ensemble

The computationally modeled datasets generated in this study, namely the natively glycosylated SOSIP Env and the uniform mannose-9 glycosylated SOSIP Env ensembles will be submitted as Mendeley dataset server as required by the journal publishers, for public availability. These include two sets of Protein Data Bank (PDB)ensembles of 1000 structures each. The files are in the standardized PDB format. Each of the constituent ensemble structures are separated by the ‘END’ tag within the files. Snapshots from the beginning and end of each data set are given here. The column descriptions are as follows: Col1 –ATOM tag; Col 2 –atom number; COL 3 –atom name; COL4 –residue name; COL 5 –chain identifier; COL 6 –residue number; COL. 7,8,9 –X,Y,Z coordinates of atom in 3Dspace; COL 10 –Occupancy Factor; COL 11 -Temperature factor; COL 12 –segment identifier; COL 13 –element symbol.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1991

Large Angle Transient Dynamics (LATDYN) user's manual

A computer code for modeling the large angle transient dynamics (LATDYN) of structures was developed to investigate techniques for analyzing flexible deformation and control/structure interaction problems associated with large angular motions of spacecraft. This type of analysis is beyond the routine capability of conventional analytical tools without simplifying assumptions. In some instances, the motion may be sufficiently slow and the spacecraft (or component) sufficiently rigid to simplify analyses of dynamics and controls by making pseudo-static and/or rigid body assumptions. The LATDYN introduces a new approach to the problem by combining finite element structural analysis, multi-body dynamics, and control system analysis in a single tool. It includes a type of finite element that can deform and rotate through large angles at the same time, and which can be connected to other finite elements either rigidly or through mechanical joints. The LATDYN also provides symbolic capabilities for modeling control systems which are interfaced directly with the finite element structural model. Thus, the nonlinear equations representing the structural model are integrated along with the equations representing sensors, processing, and controls as a coupled system.

Abrahamson, A. Louis↗
NASA NTRS1988

Head-mounted spatial instruments: Synthetic reality or impossible dream

A spatial instrument is defined as a display device which has been either geometrically or symbolically enhanced to better enable a user to accomplish a particular task. Research conducted over the past several years on 3-D spatial instruments has shown that perspective displays, even when viewed from the correct viewpoint, are subject to systematic viewer biases. These biases interfere with correct spatial judgements of the presented pictorial information. It is also found that deliberate, appropriate geometric distortion of the perspective projection of an image can improve user performance. These two findings raise intriguing questions concerning the design of head-mounted spatial instruments. The design of such instruments may not only require the introduction of compensatory distortions to remove the neutrally occurring biases but also may significantly benefit from the introduction of artificial distortions which enhance performance. These image manipulations, however, can cause a loss of visual-vestibular coordination and induce motion sickness. Additionally, adaptation to these manipulations is apt to be impaired by computational delays in the image display. Consequently, the design of head-mounted spatial instruments will require an understanding of the tolerable limits of visual-vestibular discord.

Ellis, Stephen R.↗
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↗
NASA NTRS2009

NASA Tech Briefs, July 2009

Topics covered include: Dual Cryogenic Capacitive Density Sensor; Hail Monitor Sensor; Miniature Six-Axis Load Sensor for Robotic Fingertip; Improved Blackbody Temperature Sensors for a Vacuum Furnace; Wrap-Around Out-the-Window Sensor Fusion System; Wide-Range Temperature Sensors with High-Level Pulse Train Output; Terminal Descent Sensor Simulation; A Robust Mechanical Sensing System for Unmanned Sea Surface Vehicles; Additive for Low-Temperature Operation of Li-(CF)n Cells; Li/CFx Cells Optimized for Low-Temperature Operation; Number Codes Readable by Magnetic-Field-Response Recorders; Determining Locations by Use of Networks of Passive Beacons; Superconducting Hot-Electron Submillimeter-Wave Detector; Large-Aperture Membrane Active Phased-Array Antennas; Optical Injection Locking of a VCSEL in an OEO; Measuring Multiple Resistances Using Single-Point Excitation; Improved-Bandwidth Transimpedance Amplifier; Inter-Symbol Guard Time for Synchronizing Optical PPM; Novel Materials Containing Single-Wall Carbon Nanotubes Wrapped in Polymer Molecules; Light-Curing Adhesive Repair Tapes; Thin-Film Solid Oxide Fuel Cells; Zinc Alloys for the Fabrication of Semiconductor Devices; Small, Lightweight, Collapsible Glove Box; Radial Halbach Magnetic Bearings; Aerial Deployment and Inflation System for Mars Helium Balloons; Steel Primer Chamber Assemblies for Dual Initiated Pyrovalves; Voice Coil Percussive Mechanism Concept for Hammer Drill; Inherently Ducted Propfans and Bi-Props; Silicon Nanowire Growth at Chosen Positions and Orientations; Detecting Airborne Mercury by Use of Gold Nanowires; Detecting Airborne Mercury by Use of Palladium Chloride; Micro Electron MicroProbe and Sample Analyzer; Nanowire Electron Scattering Spectroscopy; Electron-Spin Filters Would Offer Spin Polarization Greater than 1; Subcritical-Water Extraction of Organics from Solid Matrices; A Model for Predicting Thermoelectric Properties of Bi2Te3; Integrated Miniature Arrays of Optical Biomolecule Detectors; A Software Rejuvenation Framework for Distributed Computing; Kurtosis Approach to Solution of a Nonlinear ICA Problem; Robust Software Architecture for Robots; R4SA for Controlling Robots; Bio-Inspired Neural Model for Learning Dynamic Models; Evolutionary Computing Methods for Spectral Retrieval; Monitoring Disasters by Use of Instrumented Robotic Aircraft; Complexity for Survival of Living Systems; Using Drained Spacecraft Propellant Tanks for Habitation; Connecting Node; and Electrolytes for Low-Temperature Operation of Li-CFx Cells.

Source record↗
NASA NTRS1992

Digital tracking loops for a programmable digital modem

In this paper, an analysis and hardware emulation of the tracking loops for a very flexible programmable digital modem (PDM) will be presented. The modem is capable of being programmed for 2, 4, 8, 16-PSK, 16-QAM, MSK, and Offset-QPSK modulation schemes over a range of data rates from 2.34 to 300 Mbps with programmable spectral occupancy from 1.2 to 1.8 times the symbol rate; these operational parameters are executable in burst or continuous mode. All of the critical processing in both the modulator and demodulator is done at baseband with very high-speed digital hardware and memory. Quadrature analog front-ends are used for translation between baseband and the IF center frequency. The modulator is based on a table lookup approach, where precomputed samples are stored in memory and clocked out according to the incoming data pattern. The sample values are predistorted to counteract the effects of the other filtering functions in the link as well as any transmission impairments. The demodulator architecture was adapted from a joint estimator-detector (JED) mathematical analysis. Its structure is applicable to most signalling formats that can be represented in a two-dimensional space. The JED realization uses interdependent, mutually aiding tracking loops with post-detection data feedback. To expedite and provide for more reliable synchronization, initial estimates for these loops are computed in a parallel acquisition processor. The cornerstone of the demodulator realization is the pre-averager received data filter which allows operation over a broad range of data rates without any hardware changes and greatly simplifies the implementation complexity. The emulation results confirmed tracking loop operation over the entire range of operational parameters listed above, as well as the capability of achieving and maintaining synchronization at BER's in excess of 10(exp -1). The emulation results also showed very close agreement with the tracking loop analysis, and validated the resolution apportionment of the various hardware elements in the tracking loops.

Poklemba, John J.↗
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↗
NASA NTRS2010

PPM Receiver Implemented in Software

A computer program has been written as a tool for developing optical pulse-position- modulation (PPM) receivers in which photodetector outputs are fed to analog-to-digital converters (ADCs) and all subsequent signal processing is performed digitally. The program can be used, for example, to simulate an all-digital version of the PPM receiver described in Parallel Processing of Broad-Band PPM Signals (NPO-40711), which appears elsewhere in this issue of NASA Tech Briefs. The program can also be translated into a design for digital PPM receiver hardware. The most notable innovation embodied in the software and the underlying PPM-reception concept is a digital processing subsystem that performs synchronization of PPM time slots, even though the digital processing is, itself, asynchronous in the sense that no attempt is made to synchronize it with the incoming optical signal a priori and there is no feedback to analog signal processing subsystems or ADCs. Functions performed by the software receiver include time-slot synchronization, symbol synchronization, coding preprocessing, and diagnostic functions. The program is written in the MATLAB and Simulink software system. The software receiver is highly parameterized and, hence, programmable: for example, slot- and symbol-synchronization filters have programmable bandwidths.

Gray, Andrew↗
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↗
NASA NTRS1991

Measurement and modification of the EEG and related behavior

Electrophysiological changes in the sensorimotor pathways were found to accompany the effect of rhythmic EEG patterns in the sensorimotor cortex. Additionally, several striking behavioral changes were seen, including in particular an enhancement of sleep and an elevation of seizure threshold to epileptogenic agents. This raised the possibility that human seizure disorders might be influenced therapeutically by similar training. Our objective in human EEG feedback training became not only the facilitation of normal rhythmic patterns, but also the suppression of abnormal activity, thus requiring complex contingencies directed to the normalization of the sensorimotor EEG. To achieve this, a multicomponent frequency analysis was developed to extract and separate normal and abnormal elements of the EEG signal. Each of these elements was transduced to a specific component of a visual display system, and these were combined through logic circuits to present the subject with a symbolic display. Variable criteria provided for the gradual shaping of EEG elements towards the desired normal pattern. Some 50-70% of patients with poorly controlled seizure disorders experienced therapeutic benefits from this approach in our laboratory, and subsequently in many others. A more recent application of this approach to the modification of human brain function in our lab has been directed to the dichotomous problems of task overload and underload in the contemporary aviation environment. At least 70% of all aviation accidents have been attributed to the impact of these kinds of problems on crew performance. The use of EEG in this context has required many technical innovations and the application of the latest advances in EEG signal analysis. Our first goal has been the identification of relevant EEG characteristics. Additionally, we have developed a portable recording and analysis system for application in this context. Findings from laboratory and in-flight studies suggest that we will be able to detect appropriate changes in brain function, and feed this information to on-board computers for modification of mission requirements and/or crew status.

Sterman, M. B.↗
NASA NTRS1991

Large Angle Transient Dynamics (LATDYN) demonstration problem manual

LATDYN is a computer code for modeling the Large Angle Transient Dynamics of structures. The objective in developing the code was to investigate new techniques for analyzing flexible deformation and control/structure interaction problems associated with large angular motions of spacecraft. Such motions may consist of pointing the entire spacecraft or articulation of individual components, events which occur frequently during construction, operation, and maintenance of large spacecraft. This type of analysis is beyond the routine capability of conventional analytical tools without simplifying assumptions. In some instances, the motion may be sufficiently slow and the spacecraft (or component) sufficiently rigid to simplify the analysis of dynamics and controls by making pseudo-static and/or rigid body assumptions. LATDYN introduces a new approach to the problem by combining finite element structural analysis, multi-body dynamics, and control system analysis in a single tool. It includes a new type of finite element that can deform and rotate through large angles at the same time, and which can be connected to other finite elements either rigidly or through mechanical joints. LATDYN also provides symbolic capabilities for modeling control systems which are interfaced directly with the finite element structural model. Thus, the nonlinear equations representing the structural model are integrated along with the equations representing sensors, processing, and controls as a coupled system.

Wu, Shih-Chin↗
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↗