Tree encoding of memoryless time-discrete sources with a fidelity criterion.
Tree codes for memoryless time discrete sources with bounded fidelity criterion
SEARCH · Engineering Papers
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.
Tree codes for memoryless time discrete sources with bounded fidelity criterion
Space station safety study - fault tree analyses
Number of trees with arbitrary number of terminal nodes
Remote sensing of changes in morphology and physiology of trees under stress
Multispectral sensing techniques to detect ponderosa pine trees under stress from insect or diseases
Day/night thermal IR imagery detection of moisture stress of girdled trees in upland forest
Supervisory controlled manipulation system for complex manipulation tasks on unmanned space vehicles using AND TREE computer data structure
Computer program for Monte Carlo simulation of fault trees in analysis of large complex systems
TREETRAN subroutine package in FORTRAN 4 for manipulation of tree structured data
Relationship between tree ring growth variations and solar activity since 1700 in western North America
Application of multispectral sensors to detect insect and disease infestation of ponderosa pine trees
The computer program listing for the MAIN program and those subroutines unique to the fault tree analysis are described. Some subroutines are used for analyzing the reliability block diagram. The program is written in FORTRAN 5 and is running on a UNIVAC 1108.
An analog tree-organized multiplexer (ATOM) which is intended for use in the telemetry system of an interplanetary spacecraft is designed. The ATOM will be fabricated by a monolithic, dielectric isolation process, and will contain silicon junction field effect transistors (JFET) as the active elements. The effect of the radiation environment on the performance of the ATOM is analyzed. The result indicates that the expected radiation environment will cause only minor changes in the preradiation characteristics of ATOM. The JFET in the ATOM is designed to meet the electrical requirements when fabricated by either the double poly-dielectric isolation process or the raised dielectric isolation process. The effect of the heat treatment required for the dielectric isolation process on the diffusion profile of the JFET is described. The layout of the ATOM circuit for fabrication by either the double poly or raised dielectric isolation process is also given.
Remote sensing with infrared color aerial photography (Kodak Ektachrome Infrared Aero 8443 film) for detecting citrus tree anomalies is described. Illustrations and discussions are given for detecting nutrient toxicity symptoms, for detecting foot rot and sooty mold fungal diseases, and for distinguishing among citrus species. Also, the influence of internal leaf structure on light reflectance, transmittance, and absorptance are considered; and physiological and environmental factors that affect citrus leaf light reflectance are reviewed briefly and illustrated.
Consideration of a particular series formed by deleting certain branches of the complete graph K sub t with t vertices. A class of graphs which contains the m series as a special case is considered, and a new formula is given for the m series itself (an m series graph is obtained from K sub t by removing m branches forming a closed loop). A formula is derived for the number of labeled spanning trees in the graph obtained by deleting certain branches from K sub t.
Study of a broad class of tree-manipulating systems called subtree replacement systems. The use of this framework is illustrated by general theorems analogous to the Church-Rosser theorem and by applications of these theorems. Sufficient conditions are derived for the Church-Rosser property, and their applications to recursive definitions, the lambda calculus, and parallel programming are discussed. McCarthy's (1963) recursive calculus is extended by allowing a choice between call-by-value and call-by-name. It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm. It is also shown that these functions solve their defining equations in a 'canonical' manner.