Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “SYMBOL”

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 451 records · Page 25

Synthesis and characterization of d{sup 10} metal complexes with mixed 1,3-di(1H-imidazol-4-yl)benzene and multicarboxylate ligands

Seven new coordination polymers [Zn(H{sub 2}L)(mbdc)] (1), [Zn(H{sub 3}L)(btc)] (2), [Zn(H{sub 2}L)(Hbtc)] (3), [Zn(H{sub 2}L)(Hbtc)]·H{sub 2}O (4), [Zn{sub 2}(H{sub 2}L)(btc)(μ{sub 2}-OH)] (5), [Cd(H{sub 2}L)(mbdc)] (6) and [Cd{sub 3}(H{sub 2}L){sub 2}(btc){sub 2}(H{sub 2}O)]·5H{sub 2}O (7) were synthesized by reactions of the corresponding metal salt with rigid ligand 1,3-di(1H-imidazol-4-yl)benzene (H{sub 2}L) and different carboxylic acids of 1,3-benzenedicarboxylic acid (H{sub 2}mbdc) and benzene-1,3,5-tricarboxylic acid (H{sub 3}btc), respectively. The results of X-ray crystallographic analysis indicate that complex 1 is 1D chain while 2 is a (3,3)-connected 2D network with Point (Schläfli) symbol of (4,8{sup 2}). Complexes 3 and 6 are 2D networks, 4 is a 3-fold interpenetrating 3D framework with Point (Schläfli) symbol of (6{sup 5},8) and 5 is a (3,8)-connected 2D network with Point (Schläfli) symbol of (3,4{sup 2}){sub 2}(3{sup 4},4{sup 6},5{sup 6},6{sup 8},7{sup 3},8), while 7 is a (3,10)-connected 3D net with Schläfli symbol of (3,4,5){sub 2}(3{sup 4},4{sup 8},5{sup 18},6{sup 12},7{sup 2},8). The thermal stability and photoluminescence of the complexes were investigated. Furthermore, DFT calculations were performed for 2–4 to discuss the temperature controlled self-assembly of the complexes. - Graphical abstract: Seven new coordination polymers with multicarboxylate and rigid ditopic 4-imidazole containing ligands have been obtained and found to show different structures and topologies. - Highlights: • Metal complexes with diverse structures of 1D chain, 2D network and 3D framework. • Mixed ligands of 1,3-di(1H-imidazol-4-yl)benzene and multicarboxylate. • Photoluminescence property.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Synthesis, crystal structures and luminescent properties of zinc(II) metal–organic frameworks constructed from terpyridyl derivative ligand

Five zinc(II) metal–organic frameworks, [Zn{sub 3}(344-pytpy){sub 2}Cl{sub 6}]{sub n}·n(H{sub 2}O) (1), [Zn(344-pytpy)(ox)]{sub n} (2), [Zn{sub 2}(344-pytpy)(bdc){sub 2}]{sub n}·1.5n(H{sub 2}O) (3), [Zn{sub 2}(344-pytpy){sub 2} (sfdb){sub 2}]{sub n}·1.5n(H{sub 2}O) (4) and [Zn{sub 3}(344-pytpy){sub 2}(btc){sub 2}]{sub n}·2n(H{sub 2}O) (5), (344-pytpy=4′-(3-pyridyl)-4,2′:6′,4″-terpyridine, H{sub 2}ox=oxalic acid, H{sub 2}bdc=1,4-benzenedi-carboxylic acid, H{sub 2}sfdb=4,4′-sulfonyldibenzoic acid and H{sub 3}btc=1,3,5-benzene-tricarboxylic acid) have been prepared by hydrothermal reactions. Compound 1 is a 1D chain structure, in which 344-pytpy ligand links three Zn{sup II} centers through three of terminal N-donors. Compound 2 is a 4-connected 3D framework with the dia topological net and the Schläfli symbol of 6{sup 6}. Compound 3 displays a unusual 3-fold interpenetrating 3D coordination network which exhibits a new intriguing (3,3,4)-connected topological net with the Schläfli symbol of (4.8{sup 2})(4.8{sup 5})(8{sup 3}). Compound 4 features a two-fold interpenetrating 4-connected 2D framework with the sql topological net and the Schläfli symbol of (4{sup 4}.6{sup 2}). Compound 5 is a new self-interpenetrating (3,3,4,4)-connected topological net with the Schläfli symbol of (6.8{sup 2}){sub 2}(6{sup 2}.8{sup 2}.10.12)(6{sup 2}.8{sup 3}.10){sub 2}(6{sup 2}.8){sub 2}. The luminescence properties of 1–5 have been investigated by emission spectra and they possess great thermal stabilities which can be stable up to around 400 °C. - Graphical abstract: Five new Zn(II) metal–organic frameworks based on dicarboxylate and terpyridyl derivative ligands have been synthesized by hydrothermal reactions, giving networks from 1D to 3D structures. The thermal stability and luminescent property have been investigated. - Highlights: • Five zinc(II) metal–organic frameworks have been prepared under hydrothermal conditions. • Their crystal and topological structures have been investigated. • The luminescent properties have been investigated. • They possess great thermal stabilities which can be stable up to around 400 °C.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral characteristics of convolutionally coded digital signals

The power spectral density of the output symbol sequence of a convolutional encoder is computed for two different input symbol stream source models, namely, an NRZ signaling format and a first-order Markov source. The effects of alternate symbol inversion on this spectrum are also considered. The mathematical results are illustrated with many examples corresponding to optimal performance codes. It is demonstrated that only for the case of a purely random input source (e.g., NRZ data with equiprobable symbols) and a particular class of codes is the output spectrum identical to the input spectrum except for a frequency scaling (expansion) by the reciprocal of the code rate.

Divsalar, D.↗

Test Sequences for Reed-Solomon Encoders

Theory of Reed-Solomon codes yields sequences of input test symbols. Two specific sequences worked out for codes of 8 bits per symbol with 223 information symbols and 32 parity check symbols per code words. Test patterns also used for decoders.

Lee, J. J.↗

On the probability of undetected error for the maximum distance separable codes

The performance of maximum-distance-separable codes with symbols from GF(1) when they are used for pure error detection or for simultaneous error correction and detection is investigated. These codes are good for symbol error detection. Their probability of undetected error is upper bounded by q to the -r and decreases monotonically as the symbol error probability epsilon decreases from (q-1)/q to 0, where r is the number of parity-check symbols of a code.

Kasami, T.↗

On the probability of undetected error for the maximum distance separable codes

The performance of maximum-distance-separable codes with symbols from GF(1) when they are used for pure error detection or for simultaneous error correction and detection is investigated. These codes are good for symbol error detection. Their probability of undetected error is upper bounded by q to the -r and decreases monotonically as the symbol error probability epsilon decreases from (q-1)/q to 0, where r is the number of parity-check symbols of a code.

Kasami, T.↗

Single-Chip VLSI Reed-Solomon Encoder

Reed-Solomon (RS) encoder based on Berlekamp bit-serial multiplier algorithm. RS code standard, based on code words of 255 8-bit symbols, of which 223 symbols convey information and remaining 32 are check symbols. This code enables correction of up to 16 erroneous information symbols per word. Berlekamp algorithm based on code-generating polynomial with 32 roots that occur in reciprocal pairs. Choice of algorithm permits compact design.

Truong, T. K.↗

Erasure information for a Reed-Solomon decoder

Many Reed-Solomon decoders, including the one decoding the outer code for Voyager data from Uranus, assume that all symbols have the same chance of being correct or incorrect. Insome cases, like in a burst of incorrect symbols, this is not the case, and a Reed-Solomon decoder could make use of this. The use of information about bit quality sent to the Reed-Solomon from an (inner) Viterbi decoder is examined, as well as information about the error status of adjacent symbols in decoding interleaved Reed-Solomon encoded symbols. It is discovered that, in a region of interest, only about 0.04 dB can gained.

Pitt, G. H., III↗

SNR estimation for the baseband assembly

The expected value and the variance of the Baseband Assembly symbol signal-to-noise ratio (SNR) estimation algorithm are derived. The SNR algorithm treated here is designated as the Split Symbol Moments Estimator (SSME). It consists of averaging the first two moments of the integrated half symbols. The SSME is a biased, consistent estimator. The SNR degradation factor due to the jitter in the subcarrier demodulation and symbol synchronization loops is taken into account. Curves of the expected value of the SNR estimator versus the actual SNR are presented.

Simon, M. K.↗

STAR (Simple Tool for Automated Reasoning): Tutorial guide and reference manual

STAR is an interactive, interpreted programming language for the development and operation of Artificial Intelligence application systems. The language is intended for use primarily in the development of software application systems which rely on a combination of symbolic processing, central to the vast majority of AI algorithms, with routines and data structures defined in compiled languages such as C, FORTRAN and PASCAL. References to routines and data structures defined in compiled languages are intermixed with symbolic structures in STAR, resulting in a hybrid operating environment in which symbolic and non-symbolic processing and organization of data may interact to a high degree within the execution of particular application systems. The STAR language was developed in the course of a project involving AI techniques in the interpretation of imaging spectrometer data and is derived in part from a previous language called CLIP. The interpreter for STAR is implemented as a program defined in the language C and has been made available for distribution in source code form through NASA's Computer Software Management and Information Center (COSMIC). Contained within this report are the STAR Tutorial Guide, which introduces the language in a step-by-step manner, and the STAR Reference Manual, which provides a detailed summary of the features of STAR.

Borchardt, G. C.↗

STAR - A computer language for hybrid AI applications

Constructing Artificial Intelligence application systems which rely on both symbolic and non-symbolic processing places heavy demands on the communication of data between dissimilar languages. This paper describes STAR (Simple Tool for Automated Reasoning), a computer language for the development of AI application systems which supports the transfer of data structures between a symbolic level and a non-symbolic level defined in languages such as FORTRAN, C and PASCAL. The organization of STAR is presented, followed by the description of an application involving STAR in the interpretation of airborne imaging spectrometer data.

Borchardt, G. C.↗

On codes with multi-level error-correction capabilities

In conventional coding for error control, all the information symbols of a message are regarded equally significant, and hence codes are devised to provide equal protection for each information symbol against channel errors. However, in some occasions, some information symbols in a message are more significant than the other symbols. As a result, it is desired to devise codes with multilevel error-correcting capabilities. Another situation where codes with multi-level error-correcting capabilities are desired is in broadcast communication systems. An m-user broadcast channel has one input and m outputs. The single input and each output form a component channel. The component channels may have different noise levels, and hence the messages transmitted over the component channels require different levels of protection against errors. Block codes with multi-level error-correcting capabilities are also known as unequal error protection (UEP) codes. Structural properties of these codes are derived. Based on these structural properties, two classes of UEP codes are constructed.

Lin, Shu↗

Efficient parallel algorithms for string editing and related problems

The string editing problem for input strings x and y consists of transforming x into y by performing a series of weighted edit operations on x of overall minimum cost. An edit operation on x can be the deletion of a symbol from x, the insertion of a symbol in x or the substitution of a symbol x with another symbol. This problem has a well known O((absolute value of x)(absolute value of y)) time sequential solution (25). The efficient Program Requirements Analysis Methods (PRAM) parallel algorithms for the string editing problem are given. If m = ((absolute value of x),(absolute value of y)) and n = max((absolute value of x),(absolute value of y)), then the CREW bound is O (log m log n) time with O (mn/log m) processors. In all algorithms, space is O (mn).

Apostolico, Alberto↗

Execution environment for intelligent real-time control systems

Modern telerobot control technology requires the integration of symbolic and non-symbolic programming techniques, different models of parallel computations, and various programming paradigms. The Multigraph Architecture, which has been developed for the implementation of intelligent real-time control systems is described. The layered architecture includes specific computational models, integrated execution environment and various high-level tools. A special feature of the architecture is the tight coupling between the symbolic and non-symbolic computations. It supports not only a data interface, but also the integration of the control structures in a parallel computing environment.

Sztipanovits, Janos↗

Open-loop frequency acquisition for suppressed-carrier biphase signals using one-pole arm filters

Open loop frequency acquisition performance is discussed for suppressed carrier binary phase shift keyed signals in terms of the probability of detecting the carrier frequency offset when the arms of the Costas loop detector have one pole filters. The approach, which does not require symbol timing, uses fast Fourier transforms (FFTs) to detect the carrier frequency offset. The detection probability, which depends on both the 3 dB arm filter bandwidth and the received symbol signal to noise ratio, is derived and is shown to be independent of symbol timing. It is shown that the performance of this technique is slightly better that other open loop acquisition techniques which use integrators in the arms and whose detection performance varies with symbol timing.

Shah, B.↗

Using fuzzy logic to integrate neural networks and knowledge-based systems

Outlined here is a novel hybrid architecture that uses fuzzy logic to integrate neural networks and knowledge-based systems. The author's approach offers important synergistic benefits to neural nets, approximate reasoning, and symbolic processing. Fuzzy inference rules extend symbolic systems with approximate reasoning capabilities, which are used for integrating and interpreting the outputs of neural networks. The symbolic system captures meta-level information about neural networks and defines its interaction with neural networks through a set of control tasks. Fuzzy action rules provide a robust mechanism for recognizing the situations in which neural networks require certain control actions. The neural nets, on the other hand, offer flexible classification and adaptive learning capabilities, which are crucial for dynamic and noisy environments. By combining neural nets and symbolic systems at their system levels through the use of fuzzy logic, the author's approach alleviates current difficulties in reconciling differences between low-level data processing mechanisms of neural nets and artificial intelligence systems.

Yen, John↗

Multi-layered reasoning by means of conceptual fuzzy sets

The real world consists of a very large number of instances of events and continuous numeric values. On the other hand, people represent and process their knowledge in terms of abstracted concepts derived from generalization of these instances and numeric values. Logic based paradigms for knowledge representation use symbolic processing both for concept representation and inference. Their underlying assumption is that a concept can be defined precisely. However, as this assumption hardly holds for natural concepts, it follows that symbolic processing cannot deal with such concepts. Thus symbolic processing has essential problems from a practical point of view of applications in the real world. In contrast, fuzzy set theory can be viewed as a stronger and more practical notation than formal, logic based theories because it supports both symbolic processing and numeric processing, connecting the logic based world and the real world. In this paper, we propose multi-layered reasoning by using conceptual fuzzy sets (CFS). The general characteristics of CFS are discussed along with upper layer supervision and context dependent processing.

Takagi, Tomohiro↗

Improvements in hover display dynamics for a combat helicopter

This paper describes a piloted simulation conducted on the NASA Ames Vertical Motion Simulator. The objective of the experiment was to investigate the handling qualities benefits attainable using new display law design methods for hover displays. The new display laws provide improved methods to specify the behavior of the display symbol that predicts the vehicle's ground velocity in the horizontal plane; it is the primary symbol that the pilot uses to control aircraft horizontal position. The display law design was applied to the Apache helmet-mounted display format, using the Apache vehicle dynamics to tailor the dynamics of the velocity predictor symbol. The representations of the Apache vehicle used in the display design process and in the simulation were derived from flight data. During the simulation, the new symbol dynamics were seen to improve the pilots' ability to maneuver about hover in poor visual cuing environments. The improvements were manifested in pilot handling qualities ratings and in measured task performance. The paper details the display design techniques, the experiment design and conduct, and the results.

Eshow, Michelle M.↗