Algorithms for the dichotomous representation of macrocircuits.
Algorithms for dichotomous representation of macrocircuits, considering computer programs and establishment of flow graphs
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.
Algorithms for dichotomous representation of macrocircuits, considering computer programs and establishment of flow graphs
Sensitivity coefficients through flowgraphic representation of network function, discussing algorithmic computer program
Analysis method utilizes graph-theoretic approach for evaluating computation cost and makes logical distinction between linear graph of a computation and linear graph of a program. It applies equally well to other processes which depend on quatitative edge nomenclature and precedence relationships between edges.
The question is posed whether forced air flow should be incorporated into flammability tests as a relevant variable. A test apparatus is described which permits tests to be conducted on small test specimens in a forced flow which is (continuously) variable over flow velocities from zero to 300 feet per minute (1.52 m/s). The effects of air-flow rate and oxygen concentration on flame propagation rate, maximum smoke density, and pyrolytic product toxicity were measured for a single material and were statistically evaluated. Regression analysis was used to graph the resulting relationships. It is concluded that air velocity is an important variable for laboratory flammability testing.
Through the empirical correlation of experimental data and theoretical analysis, a set of graphs has been developed which summarize the inviscid aerodynamics of delta wings at supersonic speeds. The various graphs which detail the aerodynamic performance of delta wings at both zero-lift and lifting conditions were then employed to define a preliminary wing design approach in which both the low-lift and high-lift design criteria were combined to define a feasible design space.
Some technologies developed for system level modeling and analysis of algorithms/architectures using an architecture design and development system are reviewed. Modeling and analysis is described with attention given to modeling constraints and analysis using constrained software graphs. An example is presented of an ADAS graph and its associated attributes, such as firing delay, token consume rate, token produce rate, firing threshold, firing condition, arc queue lengths, associated C or Ada functional model, and stochastic behavior.
CUTSETS computer program identifies all minimal cut sets for given node. Software package contains subprograms that solve for minimal cut sets of fault trees and digraphs by use of object-oriented programming techniques. Cut-set codes used to solve graph models for reliability analysis and identify potential single-point failures in modeled system. Includes utility subprogram that converts popular COD-format diagraph-model-description files into text input files suitable for use with other CUT-SETS subprograms. FEAT (MSC-21873) and FIRM (MSC-21860). Written in C language.
A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.
The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.
To guide development of microwave process technology that could be used during in situ construction on the Moon, we measured the high-temperature basic dielectric properties (εʹ and εʺ) of 17 lunar simulants and related materials. In order to confidently use these data one needs to understand the data’s strengths and weaknesses. Therefore, a goal of this publication is to provide insights into the comparative effects of sample composition, pre-treatments, experimental variables, high temperatures, and other factors on the measured response. The dielectric measurements were performed using the cavity perturbation method over a temperature range between room temperature to 1000 °C, or higher, and provided the real and imaginary components of permittivity at six frequencies. The utility of the original values was limited by the varying density of the pellets used in the measurement. Therefore, all of the εʹ and εʺ measurements at the frequency of 2466 MHz have been scaled to a constant density, 1.75 g/cm 3 . Here the data are presented as graphs chosen to aid analysis within and across simulant groups. To gain additional insight into the processes happening at the elevated temperatures in the dielectric measurements, heat capacity data was obtained using differential scanning calorimetry (DSC) on several of the simulant materials. Our data show that over the frequency range 397 MHz – 2985 MHz a material’s behavior does not greatly change, as compared to the scale of differences observed between lunar mare and highland simulants at high temperatures. For example at 1000 °C, the mare simulant JSC-1A absorbs 10 times more power than the highland simulant NUW-LHT-5M. We observe that as melting temperatures are reached both permittivity and dielectric loss rise non-linearly, helping to explain thermal runaway during microware heating. Our data show that even less than a few weight % of many non-lunar minerals, and the use of mixtures in simulants can affect the dielectric behavior at higher temperatures. A comparison of our results with published dielectric data for Apollo samples and with remote sensing of the Moon supports the conclusion the simulants and lunar material at room temperature have very similar dielectric values.
A technique has been developed for combining features of a systems architecture design and assessment tool and a software development tool. This technique reduces simulation development time and expands simulation detail. The Architecture Design and Assessment System (ADAS), developed at the Research Triangle Institute, is a set of computer-assisted engineering tools for the design and analysis of computer systems. The ADAS system is based on directed graph concepts and supports the synthesis and analysis of software algorithms mapped to candidate hardware implementations. Greater simulation detail is provided by the ADAS functional simulator. With the functional simulator, programs written in either Ada or C can be used to provide a detailed description of graph nodes. A Computer-Aided Software Engineering tool developed at the Charles Stark Draper Laboratory (CSDL CASE) automatically generates Ada or C code from engineering block diagram specifications designed with an interactive graphical interface. A technique to use the tools together has been developed, which further automates the design process.
Systematic errors in perception and memory present a challenge to theories of perception and memory and to applied psychologists interested in overcoming them as well. A number of systematic errors in memory for maps and graphs are reviewed, and they are accounted for by an analysis of the perceptual processing presumed to occur in comprehension of maps and graphs. Visual stimuli, like verbal stimuli, are organized in comprehension and memory. For visual stimuli, the organization is a consequence of perceptual processing, which is bottom-up or data-driven in its earlier stages, but top-down and affected by conceptual knowledge later on. Segregation of figure from ground is an early process, and figure recognition later; for both, symmetry is a rapidly detected and ecologically valid cue. Once isolated, figures are organized relative to one another and relative to a frame of reference. Both perceptual (e.g., salience) and conceptual factors (e.g., significance) seem likely to affect selection of a reference frame. Consistent with the analysis, subjects perceived and remembered curves in graphs and rivers in maps as more symmetric than they actually were. Symmetry, useful for detecting and recognizing figures, distorts map and graph figures alike. Top-down processes also seem to operate in that calling attention to the symmetry vs. asymmetry of a slightly asymmetric curve yielded memory errors in the direction of the description. Conceptual frame of reference effects were demonstrated in memory for lines embedded in graphs. In earlier work, the orientation of map figures was distorted in memory toward horizontal or vertical. In recent work, graph lines, but not map lines, were remembered as closer to an imaginary 45 deg line than they had been. Reference frames are determined by both perceptual and conceptual factors, leading to selection of the canonical axes as a reference frame in maps, but selection of the imaginary 45 deg as a reference frame in graphs.
High spatial resolution (5 m) remote sensing data obtained using the airborne Thermal Infrared Multispectral Scanner (TIMS) sensor for daytime and nighttime have been used to measure thermal energy responses for 2 broad classes and 10 subclasses of vegetation typical of the Salt Lake City, Utah urban landscape. Polygons representing discrete areas corresponding to the 10 subclasses of vegetation types have been delineated from the remote sensing data and are used for analysis of upwelling thermal energy for day, night, and the change in response between day and night or flux, as measured by the TIMS. These data have been used to produce three-dimensional graphs of energy responses in W/ sq m for day, night, and flux, for each urban vegetation land cover as measured by each of the six channels of the TIMS sensor. Analysis of these graphs provides a unique perspective for both viewing and understanding thermal responses, as recorded by the TIMS, for selected vegetation types common to Salt Lake City. A descriptive interpretation is given for each of the day, night, and flux graphs along with an analysis of what the patterns mean in reference to the thermal properties of the vegetation types surveyed in this study. From analyses of these graphs, it is apparent that thermal responses for vegetation can be highly varied as a function of the biophysical properties of the vegetation itself, as well as other factors. Moreover, it is also seen where vegetation, particularly trees, has a significant influence on damping or mitigating the amount of thermal radiation upwelling into the atmosphere across the Salt Lake City urban landscape. Published by Elsevier Science Ltd.
A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.
In the Turbine Branch, scientists carry out experimental and computational work to advance the efficiency and diminish the noise production of jet engine turbines. One way to do this is by decreasing the heat that the turbine blades receive. Most of the experimental work is carried out by taking a single turbine blade and analyzing the air flow patterns around it, because this data indicates the sections of the turbine blade that are getting too hot. Since the cost of doing turbine blade air flow experiments is very high, researchers try to do computational work that fits the experimental data. The goal of computational fluid dynamics is for scientists to find a numerical way to predict the complex flow patterns around different turbine blades without physically having to perform tests or costly experiments. When visualizing flow patterns, scientists need a way to represent the flow conditions around a turbine blade. A researcher will assign specific zones that surround the turbine blade. In a two-dimensional view, the zones are usually quadrilaterals. The next step is to assign boundary conditions which define how the flow enters or exits one side of a zone. way of setting up computational zones and grids, visualizing flow patterns, and storing all the flow conditions in a file on the computer for future computation. Such a program is necessary because the only method for creating flow pattern graphs is by hand, which is tedious and time-consuming. By using a computer program to create the zones and grids, the graph would be faster to make and easier to edit. Basically, the user would run a program that is an editable graph. The user could click and drag with the mouse to form various zones and grids, then edit the locations of these grids, add flow and boundary conditions, and finally save the graph for future use and analysis. My goal this summer is to create a graphical user interface (GUI) that incorporates all of these elements. I am writing the program in Java, a language that is portable among platforms, because it can run on different operating systems such as Windows and Unix without having to be rewritten. I had no prior experience of programming in Java at the start of my internship; I am continuously learning as I create the program. I have written the part of the program that enables a user to draw several zones, edit them, and store their locations. The next phase of my project is to allow the user to click on the side of a zone and create a boundary condition for it. A previous intern wrote a program that allows the user to input boundary conditions. I can integrate the two programs to create a larger, more usable program. After that, I will develop a way for the user to save the graph for future reference. Another eventual goal is to make the GUI capable of creating three-dimensional zones as well. Researchers such as my mentor, Dr. David Ashpis, need a quick, user-friendly
A graph is shown which compares SEASAT synthetic aperture radar (SAR) wave length measurements and Krasman's shallow water dispersion relationship for a swell system of deep water length 210 m and period 11.7 sec. The data were taken during the Duck experiment. The status of the production of optically correlated SAR data is given along with a tabulation of both digitally and optically processed SAR image data available to the user community as of Aug. 1979. Results from several SAR workshops are mentioned.
The experimental methodologies are illustrated by graphs, charts and line drawings. Typical ultrasonic echo signals for dry and wet ice growth, ice accretion rates for various tunnel configurations, the experimental configuration for flight tests of the ultrasonic measuring system and heat balance models used to predict ice growth are among the topics that are illustrated and briefly discussed.
The topics are presented in view graph form and include the following: Computer Human Interaction Models (CHIMES) methodology; the CHIMES-2 prototype; and CHIMES future development.