Search NASA⌕ Search

SEARCH · Search NASA

Results for “Symbolic computing”

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 487 records · Page 27

Isotropic N-point basis functions and their properties

Isotropic functions of positions r 1 , r 2 ,..., r N , i.e. functions invariant under simultaneous rotations of all the coordinates, are conveniently formed using spherical harmonics and Clebsch–Gordan coefficients. An orthonormal basis of such functions provides a formalism suitable for analyzing isotropic distributions such as those that arise in cosmology, for instance in the clustering of galaxies as revealed by large-scale structure surveys. The algebraic properties of the basis functions are conveniently expressed in terms of 6-j and 9-j symbols. Finally, the calculation of relations among the basis functions is facilitated by 'Yutsis' diagrams for the addition and recoupling of angular momenta.

97 MATHEMATICS AND COMPUTING↗

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.↗

Computer analysis of general linear networks using digraphs.

Investigation of the application of digraphs in analyzing general electronic networks, and development of a computer program based on a particular digraph method developed by Chen. The Chen digraph method is a topological method for solution of networks and serves as a shortcut when hand calculations are required. The advantage offered by this method of analysis is that the results are in symbolic form. It is limited, however, by the size of network that may be handled. Usually hand calculations become too tedious for networks larger than about five nodes, depending on how many elements the network contains. Direct determinant expansion for a five-node network is a very tedious process also.

Mcclenahan, J. O.↗

Numerical analysis of stiffened shells of revolution. Volume 4: Engineer's program manual for STARS-2S shell theory automated for rotational structures - 2 (statics) digital computer program

The engineering programming information for the digital computer program for analyzing shell structures is presented. The program is designed to permit small changes such as altering the geometry or a table size to fit the specific requirements. Each major subroutine is discussed and the following subjects are included: (1) subroutine description, (2) pertinent engineering symbols and the FORTRAN coded counterparts, (3) subroutine flow chart, and (4) subroutine FORTRAN listing.

Svalbonas, V.↗

Explicit robust schemes for implementation of a class of principal value-based constitutive models: Symbolic and numeric implementation

The issue of developing effective and robust schemes to implement a class of the Ogden-type hyperelastic constitutive models is addressed. To this end, special purpose functions (running under MACSYMA) are developed for the symbolic derivation, evaluation, and automatic FORTRAN code generation of explicit expressions for the corresponding stress function and material tangent stiffness tensors. These explicit forms are valid over the entire deformation range, since the singularities resulting from repeated principal-stretch values have been theoretically removed. The required computational algorithms are outlined, and the resulting FORTRAN computer code is presented.

Arnold, S. M.↗

Computer simulation results for PCM/PM/NRZ receivers in nonideal channels

This article studies, by computer simulations, the performance of deep-space telemetry signals that employ the pulse code modulation/phase modulation (PCM/PM) technique, using nonreturn-to-zero data, under the separate and combined effects of unbalanced data, data asymmetry, and a band-limited channel. The study is based on measuring the symbol error rate performance and comparing the results to the theoretical results presented in previous articles. Only the effects of imperfect carrier tracking due to an imperfect data stream are considered. The presence of an imperfect data stream (unbalanced and/or asymmetric) produces undesirable spectral components at the carrier frequency, creating an imperfect carrier reference that will degrade the performance of the telemetry system. Further disturbance to the carrier reference is caused by the intersymbol interference created by the band-limited channel.

Anabtawi, A.↗

Model Elliptic Boundary-Value Problems for Pseudodifferential Operators in Canonical Nonsmooth Domains

We consider a simplest elliptic pseudodifferential equation in a multi-dimensional cone (multi-dimensional angle) and describe all possible structures of its solutions related to the wave factorization of the elliptic symbol. Depending on the index of wave factorization, we consider various statements of well-posed boundary-value problems. The existence of solutions is studied in Sobolev–Slobodetskii spaces.

97 MATHEMATICS AND COMPUTING↗

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↗

Performance analysis of the word synchronization properties of the outer code in a TDRSS decoder

A self-synchronizing coding scheme for NASA's TDRSS satellite system is a concatenation of a (2,1,7) inner convolutional code with a (255,223) Reed-Solomon outer code. Both symbol and word synchronization are achieved without requiring that any additional symbols be transmitted. An important parameter which determines the performance of the word sync procedure is the ratio of the decoding failure probability to the undetected error probability. Ideally, the former should be as small as possible compared to the latter when the error correcting capability of the code is exceeded. A computer simulation of a (255,223) Reed-Solomon code as carried out. Results for decoding failure probability and for undetected error probability are tabulated and compared.

Costello, D. J., Jr.↗

Beginning the 21st century with advanced Automatic Parts Identification (API)

Under the direction of the NASA George C. Marshall Space Flight Center, Huntsville, Alabama, the development and commercialization of an advanced Automated Parts Indentification (API) system is being undertaken by Rockwell International Corporation. The new API system is based on a variable sized, machine-readable, two-dimensioanl matrix symbol that can be applied directly onto most metallic and nonmetallic materials using safe, permanent marking methods. Its checkerboard-like structure is the most space efficient of all symbologies. This high data-density symbology can be applied to products of different material sizes and geometries using application-dependent, computer-driven marking devices. The high fidelity markings produced by these devices can then be captured using a specially designed camera linked to any IBM-compatible computer. Applications of compressed symbology technology will reduce costs and improve quality, productivity, and processes in a wide variety of federal and commercial applications.

Schramm, Fred↗

Less-Complex Method of Classifying MPSK

An alternative to an optimal method of automated classification of signals modulated with M-ary phase-shift-keying (M-ary PSK or MPSK) has been derived. The alternative method is approximate, but it offers nearly optimal performance and entails much less complexity, which translates to much less computation time. Modulation classification is becoming increasingly important in radio-communication systems that utilize multiple data modulation schemes and include software-defined or software-controlled receivers. Such a receiver may "know" little a priori about an incoming signal but may be required to correctly classify its data rate, modulation type, and forward error-correction code before properly configuring itself to acquire and track the symbol timing, carrier frequency, and phase, and ultimately produce decoded bits. Modulation classification has long been an important component of military interception of initially unknown radio signals transmitted by adversaries. Modulation classification may also be useful for enabling cellular telephones to automatically recognize different signal types and configure themselves accordingly. The concept of modulation classification as outlined in the preceding paragraph is quite general. However, at the present early stage of development, and for the purpose of describing the present alternative method, the term "modulation classification" or simply "classification" signifies, more specifically, a distinction between M-ary and M'-ary PSK, where M and M' represent two different integer multiples of 2. Both the prior optimal method and the present alternative method require the acquisition of magnitude and phase values of a number (N) of consecutive baseband samples of the incoming signal + noise. The prior optimal method is based on a maximum- likelihood (ML) classification rule that requires a calculation of likelihood functions for the M and M' hypotheses: Each likelihood function is an integral, over a full cycle of carrier phase, of a complicated sum of functions of the baseband sample values, the carrier phase, the carrier-signal and noise magnitudes, and M or M'. Then the likelihood ratio, defined as the ratio between the likelihood functions, is computed, leading to the choice of whichever hypothesis - M or M'- is more likely. In the alternative method, the integral in each likelihood function is approximated by a sum over values of the integrand sampled at a number, 1, of equally spaced values of carrier phase. Used in this way, 1 is a parameter that can be adjusted to trade computational complexity against the probability of misclassification. In the limit as 1 approaches infinity, one obtains the integral form of the likelihood function and thus recovers the ML classification. The present approximate method has been tested in comparison with the ML method by means of computational simulations. The results of the simulations have shown that the performance (as quantified by probability of misclassification) of the approximate method is nearly indistinguishable from that of the ML method (see figure).

Hamkins, Jon↗

Chaos control of Hastings–Powell model by combining chaotic motions

In this paper, we propose a Parameter Switching (PS) algorithm as a new chaos control method for the Hastings–Powell (HP) system. The PS algorithm is a convergent scheme that switches the control parameter within a set of values while the controlled system is numerically integrated. The attractor obtained with the PS algorithm matches the attractor obtained by integrating the system with the parameter replaced by the averaged value of the switched parameter values. The switching rule can be applied periodically or randomly over a set of given values. In this way, every stable cycle of the HP system can be approximated if its underlying parameter value equalizes the average value of the switching values. Moreover, the PS algorithm can be viewed as a generalization of Parrondo's game, which is applied for the first time to the HP system, by showing that losing strategy can win: “losing + losing = winning.” If “loosing” is replaced with “chaos” and, “winning” with “order” (as the opposite to “chaos”), then by switching the parameter value in the HP system within two values, which generate chaotic motions, the PS algorithm can approximate a stable cycle so that symbolically one can write “chaos + chaos = regular.” Also, by considering a different parameter control, new complex dynamics of the HP model are revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A B-ISDN-compatible modem/codec

Coded modulation techniques for development of a broadband integrated services digital network (B-ISDN)-compatible modem/codec are investigated. The selected baseband processor system must support transmission of 155.52 Mbit/s of data over an INTELSAT 72-MHz transponder. Performance objectives and fundamental system parameters, including channel symbol rate, code rate, and the modulation scheme are determined. From several candidate codes, a concatenated coding system consisting of a coded octal phase shift keying modulation as the inner code and a high rate Reed-Solomon as the outer code is selected and its bit error rate performance is analyzed by computer simulation. The hardware implementation of the decoder for the selected code is also described.

Hemmati, F.↗

Operator vision aids for space teleoperation assembly and servicing

This paper investigates concepts for visual operator aids required for effective telerobotic control. Operator visual aids, as defined here, mean any operational enhancement that improves man-machine control through the visual system. These concepts were derived as part of a study of vision issues for space teleoperation. Extensive literature on teleoperation, robotics, and human factors was surveyed to definitively specify appropriate requirements. This paper presents these visual aids in three general categories of camera/lighting functions, display enhancements, and operator cues. In the area of camera/lighting functions concepts are discussed for: (1) automatic end effector or task tracking; (2) novel camera designs; (3) computer-generated virtual camera views; (4) computer assisted camera/lighting placement; and (5) voice control. In the technology area of display aids, concepts are presented for: (1) zone displays, such as imminent collision or indexing limits; (2) predictive displays for temporal and spatial location; (3) stimulus-response reconciliation displays; (4) graphical display of depth cues such as 2-D symbolic depth, virtual views, and perspective depth; and (5) view enhancements through image processing and symbolic representations. Finally, operator visual cues (e.g., targets) that help identify size, distance, shape, orientation and location are discussed.

Brooks, Thurston L.↗

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM systems

A simple amplitude decision based symbol timing synchronization method for real-time IMDD-OOFDM transmission systems is proposed and experimentally evaluated by using directly modulated DFB laser in 25 km SSMF. The experimental results show that the hardware resource consumption of the proposed synchronization technique is only 6% of the total system which can effectively release the computation complexity without sacrificing the synchronization accuracy. Less than 2 samples offset error of synchronization accuracy can be achieved at received optical power as low as − 20 dBm without employing correlation and multiplication operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fusion of monocular cues to detect man-made structures in aerial imagery

The extraction of buildings from aerial imagery is a complex problem for automated computer vision. It requires locating regions in a scene that possess properties distinguishing them as man-made objects as opposed to naturally occurring terrain features. It is reasonable to assume that no single detection method can correctly delineate or verify buildings in every scene. A cooperative-methods paradigm is useful in approaching the building extraction problem. Using this paradigm, each extraction technique provides information which can be added or assimilated into an overall interpretation of the scene. Thus, the main objective is to explore the development of computer vision system that integrates the results of various scene analysis techniques into an accurate and robust interpretation of the underlying three dimensional scene. The problem of building hypothesis fusion in aerial imagery is discussed. Building extraction techniques are briefly surveyed, including four building extraction, verification, and clustering systems. A method for fusing the symbolic data generated by these systems is described, and applied to monocular image and stereo image data sets. Evaluation methods for the fusion results are described, and the fusion results are analyzed using these methods.

Shufelt, Jefferey↗

Ultra-Thin Coatings Beautify Art

The craftsmen in the Roman Empire who constructed the Lycurgus Cup 17 centuries ago probably didn't think their artifact would survive for nearly 2,000 years as a prized possession. And they certainly couldn't have known that the technology they used to make it would eventually become an important part of space exploration. Carved from one solid mass, the cup is one of the few complete glass objects from that period, and the only one made from dichroic glass. Meaning "two-colored" in Greek, dichroic glass was originally created by adding trace amounts of gold and silver to a large volume of glass melt. The resulting medium partially reflects the light passing through it, causing an observer to see different colors depending on the direction of the light source. The Lycurgus Cup, for example, is famous for appearing green in daylight and red when lit at night, symbolic of the ripening grapes used to fill it with wine. NASA revitalized the production of dichroic glass in the 1950s and 1960s as a means of protecting its astronauts. Ordinary clear substances cannot protect human vision from the harsh rays of unfiltered sunlight, and everything from the human body to spacecraft sensors and computers are at risk if left unprotected from the radiation that permeates space. The microscopic amounts of metal present in dichroic glass make it an effective barrier against such harmful radiation. While the ancient manufacturing technique called for adding metals to glass melt, NASA developed a process in which metals are vaporized by electron beams in a vacuum chamber and then applied directly to surfaces in an ultra-thin film. The vapor condenses in the form of crystal structures, and the process is repeated for up to several dozen coatings. The resulting material, still only about 30 millionths of an inch thick, is sufficient to reflect radiation even while the glass, or polycarbonate, as in the case of space suit helmets, remains transparent to the human eye.

Source record↗

Reference Correlation for the Viscosity of Carbon Dioxide

A comprehensive database of experimental and computed data for the viscosity of carbon dioxide (CO 2 ) was compiled and a new reference correlation was developed. Literature results based on an ab initio potential energy surface were the foundation of the correlation of the viscosity in the limit of zero density in the temperature range from 100 K to 2000 K. Guided symbolic regression was employed to obtain a new functional form that extrapolates correctly to T → 0 K and to 10 000 K. Coordinated measurements at low density made it possible to implement the temperature dependence of the Rainwater-Friend theory in the linear-in-density viscosity term. The residual viscosity could be formulated with a scaling term ργ/T the significance of which was confirmed by symbolic regression. The final viscosity correlation covers temperatures from 100 K to 2000 K for gaseous CO 2 , and from 220 K to 700 K with pressures along the melting line up to 8000 MPa for compressed and supercritical liquid states. The data representation is more accurate than with the previous correlations, and the covered pressure and temperature range is significantly extended. The critical enhancement of the viscosity of CO 2 is included in the new correlation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗