Search NASA⌕ Search

SEARCH · Search NASA

Results for “process algebras”

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 37 records · Page 2

Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis

We have extended the computational singular perturbation (CSP) method to differential algebraic equation (DAE) systems and demonstrated its application in a heterogeneous-catalysis problem. The extended method obtains the CSP basis vectors for DAEs from a reduced Jacobian matrix that takes the algebraic constraints into account. Here we use a canonical problem in heterogeneous catalysis, the transient continuous stirred tank reactor (T-CSTR), for illustration. The T-CSTR problem is modelled fundamentally as an ordinary differential equation (ODE) system, but it can be transformed to a DAE system if one approximates typically fast surface processes using algebraic constraints for the surface species. We demonstrate the application of CSP analysis for both ODE and DAE constructions of a T-CSTR problem, illustrating the dynamical response of the system in each case. We also highlight the utility of the analysis in commenting on the quality of any particular DAE approximation built using the quasi-steady state approximation (QSSA), relative to the ODE reference case.

97 MATHEMATICS AND COMPUTING↗

Cell-Edge Detection via Selective Cooperation and Generalized Canonical Correlation

Improving the uplink quality of service for users located around the boundaries between cells is a key challenge in cellular systems. Existing approaches relying on power control throttle the rates of cell-center users, while multi-user detection requires accurate channel estimates for the cell-edge users, which is another challenge due to their low received signal-to-noise ratio (SNR). Utilizing the fact that cell-edge user signals are weak but common (received at roughly equal power) at different base stations (BSs), this paper establishes a connection between cell-edge user detection and generalized canonical correlation analysis (GCCA). It puts forth a GCCA-based method that leverages selective BS cooperation to recover the cell-edge user signal subspace even at low SNR. The cell-edge user signals can then be extracted from the resulting mixture via algebraic signal processing techniques. The paper includes theoretical analysis showing why GCCA recovers the correct subspace containing the cell-edge user signals under mild conditions. The proposed method can also identify the number of cell-edge users in the system, i.e., the common subspace dimension. Simulations reveal significant performance improvement relative to various multiuser detection techniques. Cell-edge detection performance is further studied as a function of how many / which BSs are selected, and it is shown that using the closest three BS is always the best choice.

base station cooperation↗

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗

An Algorithm for Interactive Modeling of Space-Transportation Engine Simulations: A Constraint Satisfaction Approach

In this research we have developed an algorithm for the purpose of constraint processing by utilizing relational algebraic operators. Van Beek and others have investigated in the past this type of constraint processing from within a relational algebraic framework, producing some unique results. Apart from providing new theoretical angles, this approach also gives the opportunity to use the existing efficient implementations of relational database management systems as the underlying data structures for any relevant algorithm. Our algorithm here enhances that framework. The algorithm is quite general in its current form. Weak heuristics (like forward checking) developed within the Constraint-satisfaction problem (CSP) area could be also plugged easily within this algorithm for further enhancements of efficiency. The algorithm as developed here is targeted toward a component-oriented modeling problem that we are currently working on, namely, the problem of interactive modeling for batch-simulation of engineering systems (IMBSES). However, it could be adopted for many other CSP problems as well. The research addresses the algorithm and many aspects of the problem IMBSES that we are currently handling.

Mitra, Debasis↗

Elliptic Volume Grid Generation for Viscous CFD Parametric Design Studies

This paper presents a robust method for the generation of zonal volume grids of design parametrics for aerodynamic configurations. The process utilizes simple algebraic techniques with parametric splines coupled with elliptic volume grid generation to generate isolated zonal grids for changes in body configuration needed to perform parametric design studies. Speed of the algorithm is maximized through the algebraic methods and reduced number of grid points to be regenerated for each design parametric without sacrificing grid quality and continuity within the volume domain. The method is directly applicable to grid reusability, because it modifies existing ow adapted volume grids and enables the user to restart the CFD solution process with an established flow field. Use of this zonal approach reduces computer usage time to create new volume grids for design parametric studies by an order of magnitude, as compared to current methods which require the regeneration of an entire volume grid. A sample configuration of a proposed Single Stage-to-Orbit Vehicle is used to illustrate an application of this method.

Alter, Stephen J.↗

A moving-window parameter adaptive control system for the F8-DFBW aircraft

This paper describes the moving-window parameter adaptive control system developed for the NASA F8-DFBW aircraft. The control system employs a parameter identification process that, iteratively, adjusts parameters of a model of the aircraft motions in a batch processing manner so that responses generated from the model fit the outputs of sensors stored in a finite record referred to as the moving window. Tests are made on the validity of the parameter estimates before using the parameters in an on-line design process. The on-line design process is an algebraic mapping of the parameters of the model into primary control system feedback and feedforward gains. The mapping was selected to satisfy specific flying quality characteristics over the range of parameter variations expected. Results are presented from simulation studies on the identification algorithm, tests for parameter validity, and the on-line design process.

Montgomery, R. C.↗

Three-dimensional electron temperature measurement of inertial confinement fusion hotspots using x-ray emission tomography

Here we present a novel approach to reconstruct three-dimensional (3D) electron temperature distributions of inertially confined fusion plasma hotspots at the National Ignition Facility. Using very limited number of two-dimensional (2D) x-ray imaging lines of sight, we perform 3D reconstructions of x-ray emission distributions from different x-ray energy channels ranging from 20 to 30 keV. 2D time-integrated x-ray images are processed using the algebraic reconstruction technique to reconstruct a 3D hotspot x-ray emission distribution that is self-consistent with the input images. 3D electron temperatures are computed using the energy channel ratios. We demonstrate the high accuracy and applicability of this method with different complex hotspot geometries in both synthetic and experimental results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A moving window parameter adaptive control system for the F8-DFBW aircraft

This paper describes the moving window parameter adaptive control system developed for the NASA F8-DFBW aircraft. The control system employs a parameter identification process that, iteratively, adjusts parameters of a model of the aircraft motions in a batch-processing manner so that responses generated from the model fit the outputs of sensors stored in a finite record referred to as the moving window. Tests are made on the validity of the parameter estimates before using the parameters in an on-line design process. The on-line design process is an algebraic mapping of the parameters of the model into primary control system feedback and feedforward gains. The mapping was selected to satisfy specific flying quality characteristics over the range of parameter variations expected. Results are presented from simulation studies on the identification algorithm made during the development of the system.

Dunn, H. J.↗

Developing Information Power Grid Based Algorithms and Software

This was an exploratory study to enhance our understanding of problems involved in developing large scale applications in a heterogeneous distributed environment. It is likely that the large scale applications of the future will be built by coupling specialized computational modules together. For example, efforts now exist to couple ocean and atmospheric prediction codes to simulate a more complete climate system. These two applications differ in many respects. They have different grids, the data is in different unit systems and the algorithms for inte,-rating in time are different. In addition the code for each application is likely to have been developed on different architectures and tend to have poor performance when run on an architecture for which the code was not designed, if it runs at all. Architectural differences may also induce differences in data representation which effect precision and convergence criteria as well as data transfer issues. In order to couple such dissimilar codes some form of translation must be present. This translation should be able to handle interpolation from one grid to another as well as construction of the correct data field in the correct units from available data. Even if a code is to be developed from scratch, a modular approach will likely be followed in that standard scientific packages will be used to do the more mundane tasks such as linear algebra or Fourier transform operations. This approach allows the developers to concentrate on their science rather than becoming experts in linear algebra or signal processing. Problems associated with this development approach include difficulties associated with data extraction and translation from one module to another, module performance on different nodal architectures, and others. In addition to these data and software issues there exists operational issues such as platform stability and resource management.

Dongarra, Jack↗

Mapping and imaging ionizing radiation in two and three dimensions

A two-dimensional imaging system and a two-dimensional or three-dimensional optical tomographic mapping system, each employing gas scintillation induced by ionizing radiation, i.e., radioluminescence, and corresponding methods, are disclosed. The systems may employ one or more cameras and corresponding UV filters (potentially solar blind filters) for imaging a radioluminescent scene. For two-dimensional or three-dimensional mapping, the resultant UV images are spatially registered with one another and then reconstructed to form a three-dimensional tomographic map of the ionizing radiation. The two-dimensional map is a plane of the three-dimensional map. The UV images may be spatially registered by using a reference source, optionally, a calibrated reference source allowing dosimetry calculations for the ionizing radiation. Molecular nitrogen is the primary candidate for the radioluminescent gas, though a controlled ambient in a chamber of nitric oxide, argon, krypton, or xenon may be employed. The reconstruction process employs an algebraic reconstruction technique or an Abel inversion.

Bentz, Brian Z.↗

Interactive solution-adaptive grid generation procedure

TURBO-AD is a two dimensional interactive solution adaptive grid generation program. The code uniquely combines a grid adaptation technique that uses parametric mapping with control sources and an algebraic grid generation that uses control points into a single software package. The grid adaptation is achieved by first adapting the control points to a numerical solution in the parametric domain using the control sources obtained from flow properties. Then a new grid is generated from the adapted control net using the control point formulation. The new adapted grid in the parametric domain is then mapped back to the physical domain. This solution adaptive grid generation process is efficient because the number of control points is much less than the number of grid points and the grid generation from the adapted control net is an efficient algebraic process.

Choo, Yung K.↗

Interactive solution-adaptive grid generation procedure

TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

Henderson, Todd L.↗

Interactive solution-adaptive grid generation

TURBO-AD is an interactive solution-adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution-adaptive grid generation technique into a single interactive solution-adaptive grid generation package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties that had been encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on a unit square in the parametric domain, and the new adapted grid in the parametric domain is then mapped back to the physical domain. The grid adaptation is achieved by first adapting the control points to a numerical solution in the parametric domain using control sources obtained from flow properties. Then a new modified grid is generated from the adapted control net. This solution-adaptive grid generation process is efficient because the number of control points is much less than the number of grid points and the generation of a new grid from the adapted control net is an efficient algebraic process. TURBO-AD provides the user with both local and global grid controls.

Choo, Yung K.↗

Monotonically improving approximate answers to relational algebra queries

We present here a query processing method that produces approximate answers to queries posed in standard relational algebra. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy enables us to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes appromimate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.

Smith, Kenneth P.↗

Two-Dimensional Systolic Array For Kalman-Filter Computing

Two-dimensional, systolic-array, parallel data processor performs Kalman filtering in real time. Algorithm rearranged to be Faddeev algorithm for generalized signal processing. Algorithm mapped onto very-large-scale integrated-circuit (VLSI) chip in two-dimensional, regular, simple, expandable array of concurrent processing cells. Processor does matrix/vector-based algebraic computations. Applications include adaptive control of robots, remote manipulators and flexible structures and processing radar signals to track targets.

Chang, Jaw John↗

An algebraic approach to image de-smearing: Symmetries of polynomials and their zeros

Frequently a photograph received from a spacecraft will be smeared by some process, e.g., by camera motion. Algebraically such smearing can be represented as p = sigma f, where sigma is the true picture, p is the received picture, and f is the smearing function. (p, sigma, and f are polynomials in two variables x and y.) Thus, in principle, sigma can be recovered by multiplying p by 1/f. However, there are problems involved in computing 1/f. Some of these problems are investigated.

Johnson, D. L.↗

Detection and Signal Processing for Near-Field Nanoscale Fourier Transform Infrared Spectroscopy

Researchers from a broad spectrum of scientific and engineering disciplines are increasingly using scattering-type near-field infrared spectroscopic techniques to characterize materials non-destructively with nanoscale spatial resolution. However, a sub-optimal understanding of a technique's implementation can complicate data interpretation and act as a barrier to entering the field. Here the key detection and processing steps involved in producing scattering-type near-field nanoscale Fourier transform infrared spectra (nano-FTIR) are outlined. The self-contained mathematical and experimental work derives and explains: i) how normalized complex-valued nano-FTIR spectra are generated, ii) why the real and imaginary components of spectra qualitatively relate to dispersion and absorption respectively, iii) a new and generally valid equation for spectra which can be used as a springboard for additional modeling of the scattering processes, and iv) an algebraic expression that can be used to extract an approximation to the sample's local extinction coefficient from nano-FTIR. The algebraic model for weak oscillators is validated with nano-FTIR and attenuated total reflectance Fourier transform infrared (ATR-FTIR) spectra on samples of polystyrene and Kapton and further provides a pedagogical pathway to cementing some of the technique's key qualitative attributes.

36 MATERIALS SCIENCE↗