610
610

Jul 6, 2010
07/10

by
King, W. M

texts

#
eye 610

#
favorite 0

#
comment 0

For abstract, see N72-22781.

Topics: CODERS, LANGUAGE PROGRAMMING, MANUALS, COMPUTER PROGRAMS, SYMBOLIC PROGRAMMING, TEACHING MACHINES

447
447

Jun 26, 2010
06/10

by
Butman, S.; Timor, V

texts

#
eye 447

#
favorite 0

#
comment 0

Phase shift keyed/phase modulated system for multichannel telemetry

Topics: COMPUTER PROGRAMS, RELATIVISTIC THEORY, SYMBOLIC PROGRAMMING, APPLICATIONS OF MATHEMATICS, COSMOLOGY

218
218

Jul 11, 2010
07/10

by
SCHENK, H. D.; THOMAS, J

texts

#
eye 218

#
favorite 0

#
comment 0

A MONITOR DISPLAY IS DISCUSSED FOR AUTOMATICALLY REGULATING STEEP APPROACHES. ADVANTAGES OF THE STANDARD ILS APPROACH PROFILE ARE PRESENTED, AND THE PROBLEM OF V/STOL FLIGHT GUIDANCE IS TREATED WITH RESPECT TO THE OPERATIONAL REQUIREMENTS OF THE ICAO. A STEEP LANDING AIRCRAFT IS PROPOSED TO HANDLE THESE PROBLEMS; A REDUCED NOISE BURDEN FOR RESIDENTS OF THE AIRPORT ALSO RESULTS FROM THIS APPROACH PROFILE.

Topics: BLOCK DIAGRAMS, COMPUTER PROGRAMS, SYMBOLIC PROGRAMMING, FORTRAN, LINEAR EQUATIONS, TRANSFER...

276
276

May 31, 2011
05/11

by
Wennersten, Miriam Dvorak; Banes, Anthony Vince; Boegner, Gregory J.; Dougherty, Lamar; Edwards, Bernard L.; Roman, Josep

texts

#
eye 276

#
favorite 0

#
comment 0

NASA Goddard Space Flight Center has built an open architecture, 24 channel space flight GPS receiver. The CompactPCI PiVoT GPS receiver card is based on the Mitel/GEC Plessey Builder-2 board. PiVoT uses two Plessey 2021 correlators to allow tracking of up to 24 separate GPS SV's on unique channels. Its four front ends can support four independent antennas, making it a useful card for hosting GPS attitude determination algorithms. It has been built using space quality, radiation tolerant parts....

Topics: COMPUTER PROGRAMS, STATISTICAL ANALYSIS, SYMBOLIC PROGRAMMING, COMPUTERIZED SIMULATION, C...

193
193

Jun 21, 2010
06/10

by
Allen, W. K

texts

#
eye 193

#
favorite 0

#
comment 0

Serrodyne traveling wave tube reentrant amplifier for synchronous communication satellites operating at microwave frequencies

Topics: COMPUTER SYSTEMS PROGRAMS, LANGUAGE PROGRAMMING, SYMBOLIC PROGRAMMING, FORTRAN, FUNCTIONS...

258
258

May 23, 2011
05/11

by
Baker, Donald J

texts

#
eye 258

#
favorite 0

#
comment 0

The results of an analytical and experimental investigation of 4-ply Kevlar-49-epoxy panels loaded by in-plane shear are presented. Approximately one-half of the panels are thin-core sandwich panels and the other panels are solid-laminate panels. Selected panels were impacted with an aluminum sphere at a velocity of either 150 or 220 ft/sec. The strength of panels impacted at 150 ft/sec was not reduced when compared to the strength of the undamaged panels, but the strength of panels impacted at...

Topics: COMPUTER ASSISTED INSTRUCTION, KNOWLEDGE BASED SYSTEMS, SYMBOLIC PROGRAMMING, EDUCATION, KNOWLEDGE...

Two different approaches to high performance systems for Artificial Intelligence (AI) applications have been set forth at Berkeley: one by the SPUR (Symbolic Processing Upon RISC) group, the other by the Aquarius group. In particular, the SPUR group proposed multiple, homogeneous, RISCs (Reduced Instruction Set Computers) with a functional programming (LISP) paradigm while the Aquarius group proposes multiple, heterogeneous, specialized processors with a logic-programming (Prolog) paradigm. The...

Topics: DTIC Archive, Despain, Alvin, CALIFORNIA UNIV BERKELEY, *SYMBOLIC PROGRAMMING, ARTIFICIAL...

369
369

Jun 21, 2010
06/10

by
Barna, G. J.; Heller, J. A.; Moss, T. A

texts

#
eye 369

#
favorite 0

#
comment 0

System analysis of lithium-cooled Rankine cycle nuclear-electric space power unit

Topics: COMPUTER PROGRAMS, LANGUAGE PROGRAMMING, COMPUTER AIDED DESIGN, COMPUTERS, MAN MACHINE SYSTEMS,...

Our research group has designed and implemented a symbolic knowledge representation system called PARKA which runs on the Connection Machine, a massively parallel SfMD computer. The semantics of this system are discussed. The details of the Connection Machine implementation and discussions of performance considerations can he found. In the past year the PARKA project has made significant advances along several fronts of both theoretical and practical significance. This paper summarizes some of...

Topics: DTIC Archive, Spector, Lee, MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, *KNOWLEDGE BASED...

A manual designed both as an instructional manual for beginning coders and as a reference manual for the coding language INSTRUCT, is presented. The manual includes the major programs necessary to implement the teaching system and lists the limitation of current implementation. A detailed description is given of how to code a lesson, what buttons to push, and what utility programs to use. Suggestions for debugging coded lessons and the error messages that may be received during assembly or...

Topics: NASA Technical Reports Server (NTRS), CODERS, LANGUAGE PROGRAMMING, MANUALS, COMPUTER PROGRAMS,...

585
585

Jun 1, 2011
06/11

by
Tessler, Alexander; Sleight, David W.; Wang, John T

texts

#
eye 585

#
favorite 0

#
comment 0

Thin solar sail membranes of very large span are being envisioned for near-term space missions. One major design issue that is inherent to these very flexible structures is the formation of wrinkling patterns. Structural wrinkles may deteriorate a solar sail's performance and, in certain cases, structural integrity. In this paper, a geometrically nonlinear, updated Lagrangian shell formulation is employed using the ABAQUS finite element code to simulate the formation of wrinkled deformations in...

Topics: PROGRAM VERIFICATION (COMPUTERS), MATHEMATICAL MODELS, HEURISTIC METHODS, SYMBOLIC PROGRAMMING,...

Symbolics and Apple computer systems to enhance neural network modeling research were provided under this Defense University Instrumentation Program grant. The Symbolics hardware has been operational for some time, but appropriate software is still under development. There have been three revisions of system software since the grant proposal was written. Furthermore, object- oriented programming is to be used for at least one major project, and this was begun using the currently most advanced...

Topics: DTIC Archive, Gardner, Daniel, CORNELL UNIV ITHACA NY, *NEURAL NETS, *COMPUTER PROGRAMMING,...

This paper presents experimental results on the performance effect of using symbolic simulation with SAT-based reparametrization within the Counter-example Guided Abstraction Refinement framework. Abstraction refinement has been applied successfully to prove safety properties of large industrial circuits. However, all existing abstraction refinement frameworks simply use SAT-based Bounded Model Checking (BMC) to refute the property. The model used for the BMC instance is not abstracted, and...

Topics: DTIC Archive, Chauhan, Pankaj, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE,...

Topics: DTIC Archive, Chipman, Susan, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, *HIGH...

During the tenure of this grant significant progress on several problems was made. A simple treatment with much improved proofs of Hofbauer's theory of symbolic dynamics for mappings of an interval were obtained. Moreover, the researchers generalized and extended his results to more complicated interval mappings and to certain maps in two dimensional systems. Furthermore, they made progress on developing a general theory of symbolic dynamics for systems with two degrees of freedom. Finally,...

Topics: DTIC Archive, Newhouse, Sheldon E, NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF MATHEMATICS,...

The primary goal of this research-effort was to develop a domain independent activity scheduling algorithm that would be able to handle ad-hoc constraints. The activity scheduling problem is one of assigning tasks (activities) to objects (jobs) while adhering to time and resource constraints. Operations researchers originally had approached the problem using mathematical programming techniques. This approach, however, is poor at solving real world problems. Real World problems tend to be very...

Topics: DTIC Archive, Navinchandra,, CONSTRUCTION ENGINEERING RESEARCH LAB (ARMY) CHAMPAIGN IL,...

The current trend of multi-core and multi-processor computing is causing a paradigm shift from inherently sequential to highly concurrent and parallel applications. Certain thread interleavings, data input values, or combinations of both often cause errors in the system. Systematic verification techniques such as explicit state model checking and symbolic execution are extensively used to detect errors in such systems [7, 9]. Explicit state model checking enumerates possible thread schedules...

Topics: NASA Technical Reports Server (NTRS), SYMBOLIC PROGRAMMING, CENTRAL PROCESSING UNITS, POLYMORPHISM,...

Symbolic inversion is examined from several perspectives. First, a number of symbolic algebra and mathematical tool packages were studied in order to evaluate their capabilities and methods, specifically with respect to symbolic inversion. Second, the KATE system (without hardware interface) was ported to a Zenith Z-248 microcomputer running Golden Common Lisp. The interesting thing about the port is that it allows the user to have measurements vary and components fail in a non-deterministic...

Topics: NASA Technical Reports Server (NTRS), ARTIFICIAL INTELLIGENCE, COMPUTER PROGRAMS, INVERSIONS,...

Bugs in user input sanitation of software systems often lead to vulnerabilities. Among them many are caused by improper use of regular replacement. This paper presents a precise modeling of various semantics of regular substitution, such as the declarative, finite, greedy, and reluctant, using finite state transducers (FST). By projecting an FST to its input/output tapes, we are able to solve atomic string constraints, which can be applied to both the forward and backward image computation in...

Topics: NASA Technical Reports Server (NTRS), PROGRAM VERIFICATION (COMPUTERS), SOFTWARE ENGINEERING,...

Current approaches to program analysis largely rely on the use of an intermediate language to derive intermediate representations of source code or binaries under evaluation. This can simplify semantics when dealing with a complex instruction set such as the Intel Industry Standard Architecture (ISA) instruction set. However, a question that remains is whether these intermediate languages truly retain semantic fidelity or whether elements of the ISA instruction set get lost in translation. This...

Topics: DTIC Archive, NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *SYMBOLIC PROGRAMMING, *THEOREMS, CODING,...

Parallel processing of symbolic computations on a message-passing multi-processor presents one challenge: To effectively utilize the available processors, the load must be distributed uniformly to all the processors. However, the structure of these computations cannot be predicted in advance. go, static scheduling methods are not applicable. In this paper, we compare the performance of two dynamic, distributed load balancing methods with extensive simulation studies. The two schemes are: the...

Topics: NASA Technical Reports Server (NTRS), PARALLEL PROCESSING (COMPUTERS), SYMBOLIC PROGRAMMING,...

A practical algorithm is described that allows an LR parser to parse past the point at which an error was detected. By thus parsing, context beyond the point of error detection is gathered. Several important properties about this forward context are proven its usefulness in the selection and evaluation of error repairs is demonstrated. At first specifically restricting the consideration to single occurrences of errors of insertion, deletion, or replacement of a single terminal symbol, the...

Topics: DTIC Archive, Pennello, Thomas J, CALIFORNIA UNIV SANTA CRUZ INFORMATION SCIENCES, *PARSERS,...

Topics: DTIC Archive, HillL, C L, SYSTEM DEVELOPMENT CORP SANTA MONICA CA, *COMPUTER PROGRAMMING, *INPUT...

A simple but effective system for the manipulation of polynomials of several variables in APL is presented. The system is especially advantageous in situations where more sophisticated symbolic computing systems are not available, or have failed to solve particular problems. The system is shown to successfully solve a problem not resolved by a more sophisticated system.

Topics: DTIC Archive, Billard, B., ELECTRONICS RESEARCH LAB ADELAIDE (AUSTRALIA), *ALGEBRA, *COMPUTER...

This report provides a brief introduction to the use of MACSYMA, a symbolic manipulation program for mathematics. The first Chapter outlines invoking Macsyma, running tutorials and demos, saving transcripts and programs, editing and plotting facilities. The second Chapter provides 12 examples of Macsyma use. The following topics are touched upon: factorization, integration, matrix multiplications, eigenvalue problem, infinite series, recursion definitions and relations, solving systems of...

Topics: DTIC Archive, Hereman, Willy, WISCONSIN UNIV-MADISON CENTER FOR MATHEMATICAL SCIENCES, *PROGRAMMING...

This paper is concerned with constructing, for each expression in a given program text, a symbolic expression whose value is equal to the value of the text expression for all executions of the program. A cover is a mapping from text expressions to such symbolic expressions. Covers can be used for constant propagation, code motion, and a variety of other program optimizations. Covers can also be used as an aid in symbolic program execution and for finding loop invariants for program...

Topics: DTIC Archive, Reif,John H, HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB, *ALGORITHMS, *SYMBOLIC...

Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that algorithm is then extensively tweaked to add just enough precision for the coding idioms seen in practice, without sacrificing too much efficiency. There are several downsides to adding precision in this way: the tool's implementation becomes much more complicated; it can be hard for an end-user to interpret the tool's...

Topics: DTIC Archive, MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER SCIENCE, *SYMBOLIC PROGRAMMING,...

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as...

Topics: NASA Technical Reports Server (NTRS), BLOCK DIAGRAMS, COMPUTER PROGRAMS, SYMBOLIC PROGRAMMING,...

As control systems become more complex in response to desires for greater system flexibility, performance and reliability, the promise is held out that artificial intelligence might provide the means for building such systems. An obstacle to the use of symbolic processing constructs in this domain is the need for verification and validation (V and V) of the systems. Techniques currently in use do not seem appropriate for knowledge-based software. An outline of a formal approach to V and V for...

Topics: NASA Technical Reports Server (NTRS), CONTROL SYSTEMS DESIGN, EXPERT SYSTEMS, KNOWLEDGE...

This paper describes the knowledge based approach to program acquisition and synthesis, and is based upon an earlier work. Several diverse potential applications are mentioned, including synthesizing the harmonic-set formation module of an acoustic signal understanding system for knowledge based ship classification, creating retrieval and analysis programs for ship classification hypothesis structures, and making operating systems and programming languages more portable.

Topics: DTIC Archive, Green,C, SYSTEMS CONTROL INC (VT) PALO ALTO CA, *ACOUSTIC SIGNALS, *SYMBOLIC...

This paper presents a new look at Weispfenning's method of quantifier elimination by virtual term substitution and provides two important improvements. Virtual term substitution eliminates a quantified variable by substituting formulas in the remaining variables for each atomic formula in which the quantified variable appears. This paper investigates the polynomials that arise in substitution formulas Weispfenning proposed and, based on this examination, provides a simpler substitution for the...

Topics: DTIC Archive, Brown, Christopher W, NAVAL ACADEMY ANNAPOLIS MD DEPT OF COMPUTER SCIENCE,...

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in many applications, we employ saturation on two previously proposed approaches: the Xie-Beerel...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, LOGICAL ELEMENTS, PROVING, SYMBOLIC PROGRAMMING,...

A prototype scheduler for space experiments originally programmed in a dialect of LISP using some of the more traditional techniques of that language, was recast using an object-oriented LISP, Common LISP with Flavors on the Symbolics. This object-structured version was in turn partially implemented in Ada. The Flavors version showed a decided improvement in both speed of execution and readability of code. The recasting into Ada involved various practical problems of implementation as well as...

Topics: NASA Technical Reports Server (NTRS), ADA (PROGRAMMING LANGUAGE), ARTIFICIAL INTELLIGENCE, LISP...

Recent developments in formula manipulation compilers and the design of several symbol manipulation languages, enable computers to be used for symbolic mathematical computation. A computer system and language that can be used to perform symbolic manipulations in an interactive mode are used to formulate a mathematical model of an aeronautical system. The example demonstrates that once the procedure is established, the formulation and modification of models for simulation studies can be reduced...

Topics: NASA Technical Reports Server (NTRS), AIRCRAFT MODELS, COMPUTERIZED SIMULATION, MATHEMATICAL...

This task represents an initial part of a long term project aimed at making both theoretical and practical advances in the field of formal reasoning. The main goal is to provide a framework for designing and experimenting with symbol manipulation programs, and in particular, to provide a general software architecture for implementing formal reasoning systems and interfaces to existing software components including special purpose theorem provers, program transformers, and databases. The kernel...

Topics: DTIC Archive, McCarthy, John, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE, *REASONING, *COMPUTER...

For abstract, see N77-29826.

Topics: NASA Technical Reports Server (NTRS), AIRBORNE/SPACEBORNE COMPUTERS, ASSEMBLY LANGUAGE, PROVING,...

The investigation was centered on how to map context-free grammar recognition onto systolic arrays. We are currently in the final phases of the preparation of a technical report which will document this work. Current research efforts are to extend our method to other algorithms. A new method was developed for mapping algorithms into parallel architectures. This new method works very well for a class of dynamic programming problems, including CFG recognition.

Topics: DTIC Archive, Reif, John H, DUKE UNIV DURHAM NC, *DYNAMIC PROGRAMMING, *SYMBOLIC PROGRAMMING,...

One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanujan's Notebooks. They were selected because they are non-trivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematical that can prove all the challenge problems completely automatically. The axioms and inference rules for constructing the...

Topics: DTIC Archive, Clarke, Edmund, CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE,...

We introduce a new, efficient method for constructing compact symbolic representations of very large stochastic labelled transition systems. Contrary to known symbolic state space generation techniques, our technique is applicable to general high-level models which do not have to possess any particular structure. The method is based on zero-suppressed binary decision diagrams which we extended to the multi- terminal case. The symbolic representation is obtained by evaluating the semantics of...

Topics: DTIC Archive, LAMPKA, KAI, UNIVERSITAET DER BUNDESWEHR MUENCHEN NEUBIBERG (GERMANY F R) FAKULTAET...

Symbolic execution is a well-known program analysis technique which represents values of program inputs with symbolic values instead of concrete (initialized) data and executes the program by manipulating program expressions involving the symbolic values. Symbolic execution has been proposed over three decades ago but recently it has found renewed interest in the research community, due in part to the progress in decision procedures, availability of powerful computers and new algorithmic...

Topics: NASA Technical Reports Server (NTRS), PROGRAM VERIFICATION (COMPUTERS), DATA STRUCTURES, SYMBOLIC...

In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee and Akers, but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical...

Topics: DTIC Archive, Bryant, Randal E, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE,...

Artificial Intelligence research has come under fire for failing to fulfill its promises. A growing number of AI researchers are reexamining the bases of AI research and are challenging the assumption that intelligent behavior can be fully explained as manipulation of symbols by algorithms. Three recent books -- Mind over Machine (H. Dreyfus and S. Dreyfus), Understanding Computers and Cognition (T. Winograd and F. Flores), and Brains, Behavior, and Robots (J. Albus) -- explore alternatives and...

Topics: NASA Technical Reports Server (NTRS), ARTIFICIAL INTELLIGENCE, COGNITION, DECISION MAKING, EXPERT...

We describe STELLA,1 a strongly typed, object-oriented, Lisp-like language, designed to facilitate symbolic programming tasks in artificial intelligence applications. STELLA preserves those features of Common Lisp deemed essential for symbolic programming such as built-in support for dynamic data structures, heterogeneous collections, first-class symbols, powerful iteration constructs, name spaces, an object-oriented type system with a meta-object protocol, exception handling, and language...

Topics: DTIC Archive, Chalupsky, Hans, UNIVERSITY OF SOUTHERN CALIFORNIA MARINA DEL REY INFORMATION...

Topics: DTIC Archive, Oppenheim, Alan V, MASSACHUSETTS INST OF TECH CAMBRIDGE RESEARCH LAB OF ELECTRONICS,...

A simple and powerful system for keeping track of derived images and accessory information about images has been designed and implemented. It takes advantage of extra room in image file headers to store information in the form of NAME-TYPE-VALUE triples. The NAME is a string name for the triple, the TYPE an integer designating the type, and thus the internal format, of the VALUE. This report describes the format and use of NTV information, including design decisions, current uses, and user...

Topics: DTIC Archive, Selfridge,Peter G, ROCHESTER UNIV NY DEPT OF COMPUTER SCIENCE, *IMAGE PROCESSING,...

An exploratory study of the automatic generation and optimization of symbolic programs using DECOM - a prototypical requirement specification model implemented in pure LISP was undertaken. It was concluded, on the basis of this study, that symbolic processing languages such as LISP can support a style of programming based upon formal transformation and dependent upon the expression of constraints in an object-oriented environment. Such languages can represent all aspects of the software...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, DATA PROCESSING, DISTRIBUTED PROCESSING,...

This report presents the results of a case study into practice issues involved in using the Symbolic Model Verifier (SMV) for model checking software systems. The case study is of a Simplex implementation-the Simplex coordinated demonstration system for reliable system upgrade. The investigation consisted of generating a system model (using both statechart and SMV notations), specifying claims (expected properties) of the system as temporal logic formulae, and checking those formulae with...

Topics: DTIC Archive, Srinivasan, Grama R., CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INST,...

A family of standardized thick-oxide P-MOS building blocks (standard cells) is described. The information is presented in a form useful for systems designs, logic design, and the preparation of inputs to both sets of Design Automation programs for array design and analysis. A data sheet is provided for each cell and gives the cell name, the cell number, its logic symbol, Boolean equation, truth table, circuit schematic circuit composite, input-output capacitances, and revision date. The circuit...

Topics: NASA Technical Reports Server (NTRS), BOOLEAN FUNCTIONS, CIRCUIT DIAGRAMS, COMPUTER AIDED DESIGN,...

We present an automatic iterative abstraction-refinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or spurious ) connterexamples. We devise new symbolic techniques which analyze such counterexamples and refine the abstract model correspondingly. The refinement algorithm keeps the size of the abstract state space small due to the use of abstraction functions...

Topics: DTIC Archive, Clarke, E, CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE, *COMPUTER...

581
581

Jul 25, 2010
07/10

by
Bennethum, W. H.; Sherwood, L. T

texts

#
eye 581

#
favorite 0

#
comment 0

The results of a literature survey and concept analysis related to sensing techniques for measuring of surface temperature, strain, and heat flux for (non-specific) ceramic materials exposed to elevated temperatures (to 2200 K) are summarized. Concepts capable of functioning in a gas turbine hot section environment are favored but others are reviewed also. Recommendation are made for sensor development in each of the three areas.

Topics: APPLICATIONS PROGRAMS (COMPUTERS), RESPONSE TIME (COMPUTERS), SYMBOLIC PROGRAMMING, EXPERT SYSTEMS,...