Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “symbolic”

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 613 records · Page 34

PI in the sky: The astronaut science advisor on SLS-2

The Astronaut Science Advisor (ASA, also known as Principal-Investigator-in-a-Box) is an advanced engineering effort to apply expert systems technology to experiment monitoring and control. Its goal is to increase the scientific value of information returned from experiments on manned space missions. The first in-space test of the system will be in conjunction with Professor Larry Young's (MIT) vestibulo-ocular 'Rotating Dome' experiment on the Spacelab Life Sciences 2 mission (STS-58) in the Fall of 1993. In a cost-saving effort, off-the-shelf equipment was employed wherever possible. Several modifications were necessary in order to make the system flight-worthy. The software consists of three interlocking modules. A real-time data acquisition system digitizes and stores all experiment data and then characterizes the signals in symbolic form; a rule-based expert system uses the symbolic signal characteristics to make decisions concerning the experiment; and a highly graphic user interface requiring a minimum of user intervention presents information to the astronaut operator. Much has been learned about the design of software and user interfaces for interactive computing in space. In addition, we gained a great deal of knowledge about building relatively inexpensive hardware and software for use in space. New technologies are being assessed to make the system a much more powerful ally in future scientific research in space and on the ground.

Hazelton, Lyman R.↗

Tracking the Galileo spacecraft with the DSCC Galileo Telemetry prototype

On day of the year 062, 1994, a prototype of the Deep Space Communications Complex Galileo Telemetry subsystem successfully tracked and processed signals from the Galileo spacecraft, under fully suppressed-carrier modulation. The demonstration took place at Goldstone, employing the 70-m antenna and the 34-m high-efficiency antenna. This article presents the findings from that demonstration. Specific issues are the system performance in terms of signal-to-noise (SNR) degradation and the arraying gain. Validation of the test results is via symbol-error-rate measurement and the standard symbol SNR. The analysis is also extended to include characterization of the signal received from Galileo.

Pham, T. T.↗

System of experts for intelligent data management (SEIDAM)

A proposal to conduct research and development on a system of expert systems for intelligent data management (SEIDAM) is being developed. CCRS has much expertise in developing systems for integrating geographic information with space and aircraft remote sensing data and in managing large archives of remotely sensed data. SEIDAM will be composed of expert systems grouped in three levels. At the lowest level, the expert systems will manage and integrate data from diverse sources, taking account of symbolic representation differences and varying accuracies. Existing software can be controlled by these expert systems, without rewriting existing software into an Artificial Intelligence (AI) language. At the second level, SEIDAM will take the interpreted data (symbolic and numerical) and combine these with data models. at the top level, SEIDAM will respond to user goals for predictive outcomes given existing data. The SEIDAM Project will address the research areas of expert systems, data management, storage and retrieval, and user access and interfaces.

Goodenough, David G.↗

KRESKA: A compression system for small and very large images

An effective lossless compression system for grayscale images is presented using finite context variable order Markov models. A new method to accurately estimate the probability of the escape symbol is proposed. The choice of the best model order and rules for selecting context pixels are discussed. Two context precision and two symbol precision techniques to handle noisy image data with Markov models are introduced. Results indicate that finite context variable order Markov models lead to effective lossless compression systems for small and very large images. The system achieves higher compression ratios than some of the better known image compression techniques such as lossless JPEG, JBIG, or FELICS.

Ohnesorge, Krystyna W.↗

Learning fuzzy logic control system

The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the D.C. motor. Furthermore, the LFLC has better performance in rise time, settling time and steady state error than to the conventional PI controller. This abstract accurately represents the content of the candidate's thesis. I recommend its publication.

Lung, Leung Kam↗

Analysis of the Hessian for aeroelastic optimization

The symbol of the Hessian for an aeroelastic optimization model problem is analyzed. The flow is modeled by the small-disturbance full potential equation and the structure is modeled by an isotropic (von Karman) plate equation. The cost function consists of both aerodynamic and structural terms. In the new analysis the symbol of the cost function Hessian near the minimum is computed. The result indicates that under some conditions, which are likely fulfilled in most applications, the system is decoupled for the non-smooth components. The result also shows that the structure part in the Hessian is well-conditioned while the aerodynamic part is ill-conditioned. Applications of the result to optimization strategies are discussed.

Arian, Eyal↗

Machine Learning Techniques in Optimal Design

Many important applications can be formalized as constrained optimization tasks. For example, we are studying the engineering domain of two-dimensional (2-D) structural design. In this task, the goal is to design a structure of minimum weight that bears a set of loads. A solution to a design problem in which there is a single load (L) and two stationary support points (S1 and S2) consists of four members, E1, E2, E3, and E4 that connect the load to the support points is discussed. In principle, optimal solutions to problems of this kind can be found by numerical optimization techniques. However, in practice [Vanderplaats, 1984] these methods are slow and they can produce different local solutions whose quality (ratio to the global optimum) varies with the choice of starting points. Hence, their applicability to real-world problems is severely restricted. To overcome these limitations, we propose to augment numerical optimization by first performing a symbolic compilation stage to produce: (a) objective functions that are faster to evaluate and that depend less on the choice of the starting point and (b) selection rules that associate problem instances to a set of recommended solutions. These goals are accomplished by successive specializations of the problem class and of the associated objective functions. In the end, this process reduces the problem to a collection of independent functions that are fast to evaluate, that can be differentiated symbolically, and that represent smaller regions of the overall search space. However, the specialization process can produce a large number of sub-problems. This is overcome by deriving inductively selection rules which associate problems to small sets of specialized independent sub-problems. Each set of candidate solutions is chosen to minimize a cost function which expresses the tradeoff between the quality of the solution that can be obtained from the sub-problem and the time it takes to produce it. The overall solution to the problem, is then obtained by solving in parallel each of the sub-problems in the set and computing the one with the minimum cost. In addition to speeding up the optimization process, our use of learning methods also relieves the expert from the burden of identifying rules that exactly pinpoint optimal candidate sub-problems. In real engineering tasks it is usually too costly to the engineers to derive such rules. Therefore, this paper also contributes to a further step towards the solution of the knowledge acquisition bottleneck [Feigenbaum, 1977] which has somewhat impaired the construction of rulebased expert systems.

Cerbone, Giuseppe↗

A Comparison of Telemetry Signals in the Presence and Absence of a Subcarrier

The performance of deep-space telemetry signals that employ a residual carrier modulation technique is compared in the presence and absence of a subcarrier. When the subcarrier is present, the performance for the resulting pulse-coded modulation/phase-shift keyed/phase-modulated (PCM/PSK/PM) scheme is evaluated for both sine-wave and square-wave subcarriers and Non-Return-to Zero (NRZ) data. When the subcarrier is absent, the performance for the resulting PCM/PM technique is evaluated for both the NRZ and the bi-phase data format. The comparison is based on telemetry performance as well as bandwidth efficiency. The first criterion is characterized in terms of the Symbol Error Rate (SER) as a function of symbol SNR, loop bandwidth-to-data rate ratio, and modulation index. The bandwidth efficiency is characterized by the occupancy factor. The results of both the analysis and measurements show that when the Interference-to-Carrier Ratio (ICR) is less than -20 dB, the performance degradation in the absence of a subcarrier is negligible. Various combinations of loop bandwidth-to-data rate ratios and modulation indices that achieve this performance are derived and listed. Bandwidth occupancy comparison indicates that PCM/PM/NRZ is the most efficient in this regard. Therefore, by eliminating the subcarrier and using the PCM/PM/NRZ scheme, many advantages can be realized without any sacrifice in performance.

Shihabi, Mazen M.↗

The Simulation of Read-time Scalable Coherent Interface

Scalable Coherent Interface (SCI, IEEE/ANSI Std 1596-1992) (SCI1, SCI2) is a high performance interconnect for shared memory multiprocessor systems. In this project we investigate an SCI Real Time Protocols (RTSCI1) using Directed Flow Control Symbols. We studied the issues of efficient generation of control symbols, and created a simulation model of the protocol on a ring-based SCI system. This report presents the results of the study. The project has been implemented using SES/Workbench. The details that follow encompass aspects of both SCI and Flow Control Protocols, as well as the effect of realistic client/server processing delay. The report is organized as follows. Section 2 provides a description of the simulation model. Section 3 describes the protocol implementation details. The next three sections of the report elaborate on the workload, results and conclusions. Appended to the report is a description of the tool, SES/Workbench, used in our simulation, and internal details of our implementation of the protocol.

Li, Qiang↗

Moving-Base Simulation Evaluation of Control/Display Integration Issues for ASTOVL Aircraft

A moving-base simulation has been conducted on the Vertical Motion Simulator at Ames Research Center using a model of an advanced, short takeoff and vertical landing (STOVL) lift fan fighter aircraft. This experiment expanded on investigations during previous simulations with this STOVL configuration with the objective of evaluating (1) control law modifications over the low speed flight envelope, (2) integration of the throttle inceptor with flight control laws that provide direct thrust command for conventional flight, vertical and short takeoff, and flightpath or vertical velocity command for transition, hover, and vertical landing, (3) control mode blending for pitch, roll, yaw, and flightpath control during transition from wing-borne to jet-borne flight, and (4) effects of conformal versus nonconformal presentation of flightpath and pursuit guidance symbology on the out-the-window display for low speed STOVL operations. Assessments were made for takeoff, transition, hover, and landing, including precision hover and landing aboard an LPH-type amphibious assault ship in the presence of winds and rough seas. Results yielded Level 1 pilot ratings for the flightpath and vertical velocity command modes for a range of land-based and shipboard operation and were consistent with previous experience with earlier control laws and displays for this STOVL concept. Control mode blending was performed over speed ranges in accord with the pilot's tasks and with the change of the basic aircraft's characteristics between wing-borne and hover flight. Blending of yaw control from heading command in hover to sideslip command in wing-borne flight performed over a broad speed range helped reduce yaw transients during acceleration through the low speed regime. Although the pilots appreciated conformality of flightpath and guidance symbols with the external scene during the approach, increased sensitivity of the symbols for lateral path tracking elevated the pilots' control activity in the presence of turbulence. The pilots preferred the choice of scaling that was originally established during the display development and in-flight evaluations.

Franklin, James A.↗

Walking to Olympus: An EVA Chronology

Spacewalkers enjoy a view of Earth once reserved for Apollo, Zeus, and other denizens of Mt. Olympus. During humanity's first extravehicular activity (EVA), Alexei Leonov floated above Gibraltar, the rock ancient seafarers saw as the gateway to the great unknown Atlantic. The symbolism was clear, Leonov stepped past a new Gibraltar when he stepped into space. More than 32 years and 154 EVAs later, Jerry Linenger conducted an EVA with Vladimir Tsibliyev as part of International Space Station Phase 1. They floated together above Gibraltar. Today the symbolism has new meaning: humanity is starting to think of stepping out of Earth orbit, space travel's new Gibraltar, and perhaps obtaining a new olympian view, a close-up look at Olympus Mons on Mars. Walking to Olympus: An EVA Chronology chronicles the 154 EVAs conducted from March 1965 to April 1997. It is intended to make clear the crucial role played by EVA in the history of spaceflight, as well as to chronicle the large body of EVA "lessons learned." Russia and the U.S. define EVA differently. Russian cosmonauts are said to perform EVA any time they are in vacuum in a space suit. A U.S. astronaut must have at least his head outside his spacecraft before he is said to perform an EVA. The difference is based in differing spacecraft design philoso- phies. Russian and Soviet spacecraft have always had a specialized airlock through which the EVA cosmonaut egressed, leaving the main habitable volume of the spacecraft pressurized. The U.S. Gemini and Apollo vehicles, on the other hand, depressurized their entire habitable volume for egress. In this document, we apply the Russian definition to Russian EVAS, and the U.S. definition to U.S. EVAS. Thus, for example, Gemini 4 Command Pilot James McDivitt does not share the honor of being first American spacewalker with Ed White, even though he was suited and in vacuum when White stepped out into space. Non-EVA spaceflights are listed in the chronology to provide context and to display the large num- ber of flights in which EVA played a role. This approach also makes apparent significant EVA gaps, for example, the U.S. gap between 1985 and 1991 following the Challenger accident. This NASA History Monograph is an edited extract from an extensive EVA Chronology and Reference Book being produced by the EVA Project Office, NASA Johnson Space Center, Houston, Texas. The larger work will be published as part of the NASA Formal Series in 1998. The authors gratefully acknowledge the assistance rendered by Max Ary, Ashot Bakunts, Gert-Jan Bartelds, Frank Cepollina, Andrew Chaikin, Phillip Clark, Richard Fullerton, Steven Glenn, Linda Godwin, Jennifer Green, Greg Harris, Clifford Hess, Jeffrey Hoffman, David Homan, Steven Hopkins, Nicholas Johnson, Eric Jones, Neville Kidger, Joseph Kosmo, Alexei Lebedev, Mark Lee, James LeBlanc, Dmitri Leshchenskii, Jerry Linenger, Igor Lissov, James McBarron, Clay McCullough, Joseph McMann, Story Musgrave, Dennis Newkirk, James Oberg, Joel Powell, Lee Saegesser, Andy Salmon, Glen Swanson, Joseph Tatarewicz, Kathy Thornton, Chris Vandenberg, Charles Vick, Bert Vis, David Woods, Mike Wright, John Young, and Keith Zimmerman. Special thanks to Laurie Buchanan, John Charles, Janet Kovacevich, Joseph Loftus, Sue McDonald, Martha Munies, Colleen Rapp, and Jerry Ross. Any errors remain the responsibility of the authors.

Portree, David S. F.↗

Development and Demonstration of an Ada Test Generation System

In this project we have built a prototype system that performs Feasible Path Analysis on Ada programs: given a description of a set of control flow paths through a procedure, and a predicate at a program point feasible path analysis determines if there is input data which causes execution to flow down some path in the collection reaching the point so that tile predicate is true. Feasible path analysis can be applied to program testing, program slicing, array bounds checking, and other forms of anomaly checking. FPA is central to most applications of program analysis. But, because this problem is formally unsolvable, syntactic-based approximations are used in its place. For example, in dead-code analysis the problem is to determine if there are any input values which cause execution to reach a specified program point. Instead an approximation to this problem is computed: determine whether there is a control flow path from the start of the program to the point. This syntactic approximation is efficiently computable and conservative: if there is no such path the program point is clearly unreachable, but if there is such a path, the analysis is inconclusive, and the code is assumed to be live. Such conservative analysis too often yields unsatisfactory results because the approximation is too weak. As another example, consider data flow analysis. A du-pair is a pair of program points such that the first point is a definition of a variable and the second point a use and for which there exists a definition-free path from the definition to the use. The sharper, semantic definition of a du-pair requires that there be a feasible definition-free path from the definition to the use. A compiler using du-pairs for detecting dead variables may miss optimizations by not considering feasibility. Similarly, a program analyzer computing program slices to merge parallel versions may report conflicts where none exist. In the context of software testing, feasibility analysis plays an important role in identifying testing requirements which are infeasible. This is especially true for data flow testing and modified condition/decision coverage. Our system uses in an essential way symbolic analysis and theorem proving technology, and we believe this work represents one of the few successful uses of a theorem prover working in a completely automatic fashion to solve a problem of practical interest. We believe this work anticipates an important trend away from purely syntactic-based methods for program analysis to semantic methods based on symbolic processing and inference technology. Other results demonstrating the practical use of automatic inference is being reported in hardware verification, although there are significant differences between the hardware work and ours. However, what is common and important is that general purpose theorem provers are being integrated with more special-purpose decision procedures to solve problems in analysis and verification. We are pursuina commercial opportunities for this work, and will use and extend the work in other projects we are engaged in. Ultimately we would like to rework the system to analyze C, C++, or Java as a key step toward commercialization.

Source record↗

A Proposal to Develop Interactive Classification Technology

Research for the first year was oriented towards: 1) the design of an interactive classification tool (ICT); and 2) the development of an appropriate theory of inference for use in ICT technology. The general objective was to develop a theory of classification that could accommodate a diverse array of objects, including events and their constituent objects. Throughout this report, the term "object" is to be interpreted in a broad sense to cover any kind of object, including living beings, non-living physical things, events, even ideas and concepts. The idea was to produce a theory that could serve as the uniting fabric of a base technology capable of being implemented in a variety of automated systems. The decision was made to employ two technologies under development by the principal investigator, namely, SMS (Symbolic Manipulation System) and SL (Symbolic Language) [see debessonet, 1991, for detailed descriptions of SMS and SL]. The plan was to enhance and modify these technologies for use in an ICT environment. As a means of giving focus and direction to the proposed research, the investigators decided to design an interactive, classificatory tool for use in building accessible knowledge bases for selected domains. Accordingly, the proposed research was divisible into tasks that included: 1) the design of technology for classifying domain objects and for building knowledge bases from the results automatically; 2) the development of a scheme of inference capable of drawing upon previously processed classificatory schemes and knowledge bases; and 3) the design of a query/ search module for accessing the knowledge bases built by the inclusive system. The interactive tool for classifying domain objects was to be designed initially for textual corpora with a view to having the technology eventually be used in robots to build sentential knowledge bases that would be supported by inference engines specially designed for the natural or man-made environments in which the robots would be called upon to operate.

deBessonet, Cary↗

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗

The Science of Computing: Expert Systems

The creative urge of human beings is coupled with tremendous reverence for logic. The idea that the ability to reason logically--to be rational--is closely tied to intelligence was clear in the writings of Plato. The search for greater understanding of human intelligence led to the development of mathematical logic, the study of methods of proving the truth of statements by manipulating the symbols in which they are written without regard to the meanings of those symbols. By the nineteenth century a search was under way for a universal system of logic, one capable of proving anything provable in any other system.

Denning, Peter J.↗

"Interactive Classification Technology"

The investigators are upgrading a knowledge representation language called SL (Symbolic Language) and an automated reasoning system called SMS (Symbolic Manipulation System) to enable the technologies to be used in automated reasoning and interactive classification systems. The overall goals of the project are: a) the enhancement of the representation language SL to accommodate multiple perspectives and a wider range of meaning; b) the development of a sufficient set of operators to enable the interpreter of SL to handle representations of basic cognitive acts; and c) the development of a default inference scheme to operate over SL notation as it is encoded. As to particular goals the first-year work plan focused on inferencing and.representation issues, including: 1) the development of higher level cognitive/ classification functions and conceptual models for use in inferencing and decision making; 2) the specification of a more detailed scheme of defaults and the enrichment of SL notation to accommodate the scheme; and 3) the adoption of additional perspectives for inferencing.

deBessonet, Cary↗

High-Speed Research Surveillance Symbology Assessment Experiment

Ten pilots flew multiple approach and departure scenarios in a simulation experiment of the High-Speed Civil Transport to evaluate the utility of different airborne surveillance display concepts. The primary eXternal Visibility System (XVS) display and the Navigation Display (ND) were used to present tactical and strategic surveillance information, respectively, to the pilot. Three sensors, the Traffic Alert and Collision Avoidance System, radar, and the Automatic Dependent Surveillance-Broadcast system, were modeled for this simulation and the sensors surveillance information was presented in two different symbology sets to the pilot. One surveillance symbology set used unique symbol shapes to differentiate among the sensors, while the other set used common symbol shapes for the sensors. Surveillance information in the form of escape guidance from threatening traffic was also presented to the pilots. The surveillance information (sensors and escape guidance) was either presented head-up on the primary XVS display and head-down on the ND or head-down on the ND only. Both objective and subjective results demonstrated that the display concepts having surveillance information presented head-up and head-down have surveillance performance benefits over those concepts having surveillance information displayed head-down only. No significant symbology set differences were found for surveillance task performance.

Kramer, Lynda J.↗

An Overview of SAL

To become practical for assurance, automated formal methods must be made more scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and utility can be derived from an emphasis on a systematic separation of concerns during verification. SAL (Symbolic Analysis Laboratory) attempts to address these issues. It is a framework for combining different tools to calculate properties of concurrent systems. The heart of SAL is a language, developed in collaboration with Stanford, Berkeley, and Verimag for specifying concurrent systems in a compositional way. Our instantiation of the SAL framework augments PVS with tools for abstraction, invariant generation, program analysis (such as slicing), theorem proving, and model checking to separate concerns as well as calculate properties (i.e., perform, symbolic analysis) of concurrent systems. We. describe the motivation, the language, the tools, their integration in SAL/PAS, and some preliminary experience of their use.

Bensalem, Saddek↗