SEARCH · Engineering Papers
Results for “AUTOMATON”
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.
Steampunk Meets Spacecraft: Hybrid Automaton Rover - Venus (HAR-V)
No abstract provided
Fuzzy automata and pattern matching
A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.
Monitoring with Data Automata
We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton-based monitoring approaches. Data automata are also characterized by allowing transition conditions to refer to other parameterized states, and by allowing transitions sequences. The presented automaton concept is inspired by rule-based systems, especially the Rete algorithm, which is one of the well-established algorithms for executing rule-based systems. We present an optimized external DSL for data automata, as well as a comparable unoptimized internal DSL (API) in the Scala programming language, in order to compare the two solutions. An evaluation compares these two solutions to several other monitoring systems.
Extending the field of application of the method of inertial subscripts
Inertial subcircuits for transforming arbitrary sequential automaton into asynchronous sequential automaton
Eye directed view
This paper presents the concept of extended intelligence and describes modifications to a commercially available automaton, using state-of-the-art technology, that demonstrates the practical use of extended intelligence. The natural inclination of an operator to look beyond the boundaries of a work scene as presented on a video monitor is used to command the pan and tilt of television cameras. In a teleoperator system, this capability allows the natural expansion of a work scene without burdening the operator with either a trivial cerebral task or a time consuming motor task. The automaton is unobtrusive, allows complete operator freedom, and approaches full dependability of command response with minimal operator orientation.
Distribution functions of probabilistic automata
Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.
Automation Rover for Extreme Environments
Almost 2,300 years ago the ancient Greeks built the Antikythera automaton. This purely mechanical computer accurately predicted past and future astronomical events long before electronics existed1. Automata have been credibly used for hundreds of years as computers, art pieces, and clocks. However, in the past several decades automata have become less popular as the capabilities of electronics increased, leaving them an unexplored solution for robotic spacecraft. The Automaton Rover for Extreme Environments (AREE) proposes an exciting paradigm shift from electronics to a fully mechanical system, enabling longitudinal exploration of the most extreme environments within the solar system.
The high level trigger and express data production at STAR
To meet the demands of the Beam Energy Scan phase-II (BES-II) program, the STAR experiment at the Relativistic Heavy Ion Collider (RHIC) developed a dual real-time framework consisting of a High Level Trigger (HLT) and an Express Data Production system (xProduction). The HLT operates online within the Data Acquisition (DAQ) chain on a dedicated multi-core CPU cluster with the option to offload compute-intensive kernels to Xeon Phi coprocessors. It uses parallelized algorithms, such as the Cellular Automaton (CA) Track Finder, to perform rapid tracking, vertexing, and event filtering. This allows it to select events of interest in real time and provide immediate feedback on detector and beam conditions. In contrast, the xProduction workflow runs concurrently and independently of the DAQ loop. It applies near offline-quality calibration and reconstruction within hours of data collection. The xProduction input is the express data stream, whose content can be enriched by HLT trigger/priority selections under DAQ/HLT resource constraints, and it uses the STAR calibration/conditions framework, incorporating online calibration/QA information when available. This enables early preliminary physics analysis, including the reconstruction of rare signals, such as hyperons and hypernuclei. It also provides collaboration-wide access to analysis-ready datasets. Together, the HLT and xProduction systems form a complementary architecture: the HLT performs online event selection while the xProduction chain delivers high-quality results within a short amount of time. This integrated framework has enabled the prompt reconstruction of the $^5_Λ$ He hypernucleus with high statistical significance and the efficient processing of hundreds of millions of heavy-ion collision events. In conclusion, its demonstrated scalability and robustness establish a model for future high-luminosity experiments requiring both online event filtering and rapid access to analysis-quality data.
Kinetic-controlled transformations of group-III arsenide nanocubes
Tracking the structural evolution of colloidal nanocrystals (NCs) facilitates the mechanistic studies of their materials chemistry. NC engineering via phase transformation reveals the chemical and physical determinants that drive lattice-scale dynamic processes such as cation exchange. Here, in this study, we employed NCs to demonstrate the cation exchange process from Cu 3 As to InAs and GaAs within nanocubes. The symmetry conversion in unit cells from cubic Cu 3 As to hexagonal InAs and GaAs can be described using a schematic cellular automaton model, which suggests a simplified cube-to-sphere transition. The strong covalent characteristics of III–V materials highlight the kinetic control that navigates the tailorable transformation through either an isotropic trajectory, leading to hollow structures, or a topotaxial trajectory, with abundant stacking faults. The reconstruction of complex covalent bonds is envisioned as the foundation for the synthesis of NCs.
Channel capacity of Moore automata.
Algorithm for calculating Moore automaton or connected network channel capacity and source of input symbols for full capacity utilization
Research and applications: Artificial intelligence
The program is reported for developing techniques in artificial intelligence and their application to the control of mobile automatons for carrying out tasks autonomously. Visual scene analysis, short-term problem solving, and long-term problem solving are discussed along with the PDP-15 simulator, LISP-FORTRAN-MACRO interface, resolution strategies, and cost effectiveness.
Holography and the control of self-propelled vehicles
The possibility of applying the principles of holography and optical data processing in the control of self-propelled space vehicles is considered. Various methods of controlling space vehicles are described: (1) by the results of comparing the image with the standard hologram; (2) by holographic images transmitted over moon earth communications channels; and (3) on the basis of using autotelevision cameras with a three dimensional screen. Procedures are presented for obtaining the standard holograms. The structural organization of the microprogrammed automaton controlling the movement of the space vehicle is also presented.
Application of a hierarchical structure stochastic learning automation
A hierarchical structure automaton was developed using a two state stochastic learning automato (SLA) in a time shared model. Application of the hierarchical SLA to systems with multidimensional, multimodal performance criteria is described. Results of experiments performed with the hierarchical SLA using a performance index with a superimposed noise component of ? or - delta distributed uniformly over the surface are discussed.
Automatic procedures generator for orbital rendezvous maneuver
This paper describes the development of an expert system for defining and dynamically updating procedures for an orbital rendezvous maneuver. The product of the expert system is a procedure represented by a Moore automaton. The construction is recursive and driven by a simulation of the rendezvousing bodies.
On the periodicity of symbolic observations of piecewise smooth discrete-time systems
A study is made of the behavior of discrete-time systems composed of a set of smooth transition maps coupled by a quantized feedback function. The feedback function partitions the state space into disjoint regions and assigns a smooth transition function to each region. The main result is that under a constraint on the norm of the derivative of the transition maps, a bounded state trajectory with limit points in the interior of the switching regions leads to a region index sequence that is eventually periodic. Under these assumptions, it is shown that eventually the feedback function is determined by a finite state automaton. A similar result is proved in the case of finite state dynamic feedback.
Interesting examples of supervised continuous variable systems
The authors analyze two simple deterministic flow models for multiple buffer servers which are examples of the supervision of continuous variable systems by a discrete controller. These systems exhibit what may be regarded as the two extremes of complexity of the closed loop behavior: one is eventually periodic, the other is chaotic. The first example exhibits chaotic behavior that could be characterized statistically. The dual system, the switched server system, exhibits very predictable behavior, which is modeled by a finite state automaton. This research has application to multimodal discrete time systems where the controller can choose from a set of transition maps to implement.
Lattice Boltzmann model for simulation of magnetohydrodynamics
A numerical method, based on a discrete Boltzmann equation, is presented for solving the equations of magnetohydrodynamics (MHD). The algorithm provides advantages similar to the cellular automaton method in that it is local and easily adapted to parallel computing environments. Because of much lower noise levels and less stringent requirements on lattice size, the method appears to be more competitive with traditional solution methods. Examples show that the model accurately reproduces both linear and nonlinear MHD phenomena.