Search NASA⌕ Search

SEARCH · Search NASA

Results for “automata”

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

Anomalies of global symmetries on the lattice

't Hooft anomalies of global symmetries play a fundamental role in quantum many-body systems and quantum field theory (QFT). In this paper, we make a systematic analysis of lattice anomalies - the analog of 't Hooft anomalies in lattice systems - for which we give a precise definition. Crucially, a lattice anomaly is not a feature of a specific Hamiltonian, but rather is a topological invariant of the symmetry action. The controlled setting of lattice systems allows for a systematic and rigorous treatment of lattice anomalies, shorn of the technical challenges of QFT. We find that lattice anomalies reproduce the expected properties of QFT anomalies in many ways, but also have crucial differences. In particular, lattice anomalies and QFT anomalies are not, contrary to a common expectation, in one-to-one correspondence, and there can be non-trivial anomalies on the lattice that are infrared (IR) trivial: they admit symmetric trivial gapped ground states, and map to trivial QFT anomalies at low energies. Nevertheless, we show that lattice anomalies (including IR-trivial ones) have a number of interesting consequences in their own right, including connections to commuting projector models, phases of many-body localized (MBL) systems, and quantum cellular automata (QCA). We make substantial progress on the classification of lattice anomalies and develop several theoretical tools to characterize their consequences on symmetric Hamiltonians. Our work places symmetries of quantum many-body lattice systems into a unified theoretical framework and may also suggest new perspectives on symmetries in QFT.

Disordered Systems and Neural Networks (cond-mat.d↗
DOE OSTI2023

AdditiveFOAM

AdditiveFOAM is a continuum heat transfer and fluid flow code for metal additive manufacturing developed on the OpenFOAM CFD Framework. The main components of AdditiveFOAM include: a dynamic heat source model representing heat input from independently moving beams; a robust and efficient thermodynamic solver for solid-liquid phase change in metal alloys; a library to export thermal data to ExaCA— a cellular automata (CA) code used for predicting solidification grain growth. By integrating these capabilities, AdditiveFOAM offers valuable insights into the process-structure relationships of metal additive manufacturing components.

Coleman, John [Oak Ridge National Laboratory (ORNL↗
DOE OSTI2025

HYBRD (High Resolution HYBrid Regional Downscaling) Model: Input data and Code

The HYBRD (HYBrid Regional Downscaling) model is a high-resolution urban land downscaling model that can be used to downscale intermediate urban land use and land cover (LULC) products into a high-resolution (30-meters). HYBRD uses a sequential hybrid process, combining statistical models with cellular-automata-based spatial algorithms. This repository contains all the necessary model code and inputs needed to successfully run HYBRD for Los Angeles, California. The repo also contains example outputs of each model step, except the final simulated raster outputs. Examples of simulated raster outputs for multiple scenarios for Los Angeles are available at DOI: 10.57931/2575233. Please refer to Related Works below.

Land↗
NASA NTRS1973

The inclusion problem for monadic recursion schemes

The inclusion problem for the class of monadic recursion schemes is shown to be undecidable. The proof illustrates the close relationship between monadic recursion schemes and deterministic pushdown automata. The proof is extended to show that both the weak equivalence problem for the class of monadic recursion schemes and the weak equivalence problem for the class of free schemes without identity are undecidable.

Friedman, E. P.↗
NASA NTRS1974

Reversal-bounded multipushdown machines

Several representations of the recursively enumerable (r.e.) sets are presented. The first states that every r.e. set is the homomorphic image of the intersection of two linear context-free languages. The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one change from 'pushing' to 'popping'). It is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors. This provides evidence that reversal bounds are not a natural measure of computational complexity for multitape Turing acceptors.

Baker, B. S.↗
NASA NTRS1982

Management and control of self-replicating systems: A systems model

In 1980, a conceptual engineering approach to self-replicating systems was achieved. The design was based on von Newmann's kinematic version of self-replicating automata. The systems management and control and the organization of the control elements are reported. After developing the functional requirements of such a system, a hierarchy of three management and control levels is described. These are an autonomous, an external, and an intelligent management and control system. Systems recycling, systems specialization, and information replication are discussed.

Vontiesenhausen, G.↗
NASA NTRS1983

Population Control of Self-Replicating Systems: Option C

From the conception and development of the theory of self-replicating automata by John von Neumann, others have expanded on his theories. In 1980, Georg von Tiesenhausen and Wesley A. Darbro developed a report which is a "first' in presenting the theories in a conceptualized engineering setting. In that report several options involving self-replicating systems are presented. One of the options allows each primary to generate n replicas, one in each sequential time frame after its own generation. Each replica is limited to a maximum of m ancestors. This study involves determining the state vector of the replicas in an efficient manner. The problem is cast in matrix notation, where F = fij is a non-diagonalizable matrix. Any element fij represents the number of elements of type j = (c,d) in time frame k+1 generated from type i = (a,b) in time frame k. It is then shown that the state vector is: bar F(k)=bar F (non-zero) X F sub K = bar F (non-zero) xmx J sub kx m sub-1 where J is a matrix in Jordan form having the same eigenvalues as F. M is a matrix composed of the eigenvectors and the generalized eigenvectors of F.

Mccord, R. L.↗
NASA NTRS1987

Neural nets on the MPP

The Massively Parallel Processor (MPP) is an ideal machine for computer experiments with simulated neural nets as well as more general cellular automata. Experiments using the MPP with a formal model neural network are described. The results on problem mapping and computational efficiency apply equally well to the neural nets of Hopfield, Hinton et al., and Geman and Geman.

Hastings, Harold M.↗
NASA NTRS1987

Cellular automaton formulation of passive scalar dynamics

Cellular automata modeling of the advection of a passive scalar in a two-dimensional flow is examined in the context of discrete lattice kinetic theory. It is shown that if the passive scalar is represented by tagging or 'coloring' automation particles a passive advection-diffusion equation emerges without use of perturbation expansions. For the specific case of the hydrodynamic lattice gas model of Frisch et al. (1986), the diffusion coefficient is calculated by perturbation.

Chen, Hudong↗
NASA NTRS1988

Partitioning of regular computation on multiprocessor systems

Problem partitioning of regular computation over two dimensional meshes on multiprocessor systems is examined. The regular computation model considered involves repetitive evaluation of values at each mesh point with local communication. The computational workload and the communication pattern are the same at each mesh point. The regular computation model arises in numerical solutions of partial differential equations and simulations of cellular automata. Given a communication pattern, a systematic way to generate a family of partitions is presented. The influence of various partitioning schemes on performance is compared on the basis of computation to communication ratio.

Lee, Fung Fung↗
NASA NTRS1988

Computer vision techniques for rotorcraft low-altitude flight

A description is given of research that applies techniques from computer vision to automation of rotorcraft navigation. The effort emphasizes the development of a methodology for detecting the ranges to obstacles in the region of interest based on the maximum utilization of passive sensors. The range map derived from the obstacle detection approach can be used as obstacle data for the obstacle avoidance in an automataic guidance system and as advisory display to the pilot. The lack of suitable flight imagery data, however, presents a problem in the verification of concepts for obstacle detection. This problem is being addressed by the development of an adequate flight database and by preprocessing of currently available flight imagery. Some comments are made on future work and how research in this area relates to the guidance of other autonomous vehicles.

Sridhar, Banavar↗
NASA NTRS1988

Hardware proofs using EHDM and the RSRE verification methodology

Examined is a methodology for hardware verification developed by Royal Signals and Radar Establishment (RSRE) in the context of the SRI International's Enhanced Hierarchical Design Methodology (EHDM) specification/verification system. The methodology utilizes a four-level specification hierarchy with the following levels: functional level, finite automata model, block model, and circuit level. The properties of a level are proved as theorems in the level below it. This methodology is applied to a 6-bit counter problem and is critically examined. The specifications are written in EHDM's specification language, Extended Special, and the proofs are improving both the RSRE methodology and the EHDM system.

Butler, Ricky W.↗
NASA NTRS1989

Intent inferencing with a model-based operator's associate

A portion of the Operator Function Model Expert System (OFMspert) research project is described. OFMspert is an architecture for an intelligent operator's associate or assistant that can aid the human operator of a complex, dynamic system. Intelligent aiding requires both understanding and control. The understanding (i.e., intent inferencing) ability of the operator's associate is discussed. Understanding or intent inferencing requires a model of the human operator; the usefulness of an intelligent aid depends directly on the fidelity and completeness of its underlying model. The model chosen for this research is the operator function model (OFM). The OFM represents operator functions, subfunctions, tasks, and actions as a heterarchic-hierarchic network of finite state automata, where the arcs in the network are system triggering events. The OFM provides the structure for intent inferencing in that operator functions and subfunctions correspond to likely operator goals and plans. A blackboard system similar to that of Human Associative Processor (HASP) is proposed as the implementation of intent inferencing function. This system postulates operator intentions based on current system state and attempts to interpret observed operator actions in light of these hypothesized intentions.

Jones, Patricia M.↗
NASA NTRS1988

MHD turbulent processes

Three areas of study in MHD turbulence are considered. These are the turbulent relaxation of the toroidal Z pinch, density fluctuations in MHD fluids, and MHD cellular automata. A Boolean computer game that updates a cellular representation in parallel and that has macroscopic averages converging to solutions of the two-dimensional MHD equations is discussed.

Montgomery, David↗