SEARCH · Search NASA

Results for “graph generation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1981

Free-field propagation of high intensity noise

Research on high intensity (finite amplitude) acoustic waves shows that nonlinear distortion effects generally result in a shift of energy to higher frequencies. The higher intensities associated with supersonic jets would therefore indicate that high frequency enhancement of the spectrum should occur, resulting in the differences observed between subsonic and supersonic jets. A 10,000 acoustic watt source installed in an anechoic chamber generates sound levels such that acoustic shocks are readily observable. Dual frequency excitation of the source produces a strong parametric effect with a difference frequency comparable in level to the primary frequency. The test set up and recording equipment being used to determine the finite amplitude noise representative of an actual supersonic jet are described as well as the development of a computer program based on Burger's equation. The spectra of 1/2 octave band, 1 kHz sine wave, and dual frequency input and output are presented in graphs along with waveforms at Z = .025, 0.1, and 1.0.

Mcdaniel, O. H.↗

NASA NTRS1974

Noise generated by quiet engine fans. 2: Fan A

A significant effort within the NASA Quiet Engine Program has been devoted to acoustical evaluation at the Lewis Research Center noise test facility of a family of full-scale fans. This report, documents the noise results obtained with fan A - a 1.5-pressure-ratio, 1160-ft/sec-tip-speed fan. The fan is described and some aerodynamic operating data are given. Far-field noise around the fan was measured for a variety of configurations pertaining to acoustical treatment and over a range of operating conditions. Complete results of 1/3-octave band analysis of the data are presented in tabular form. Included also are power spectra and sideline perceived noise levels. Some representative 1/3-octave band data are presented graphically, and sample graphs of continuous narrow-band spectra are also provided.

Montegani, F. J.↗

NASA NTRS1986

Towards automatic Markov reliability modeling of computer architectures

The analysis and evaluation of reliability measures using time-varying Markov models is required for Processor-Memory-Switch (PMS) structures that have competing processes such as standby redundancy and repair, or renewal processes such as transient or intermittent faults. The task of generating these models is tedious and prone to human error due to the large number of states and transitions involved in any reasonable system. Therefore model formulation is a major analysis bottleneck, and model verification is a major validation problem. The general unfamiliarity of computer architects with Markov modeling techniques further increases the necessity of automating the model formulation. This paper presents an overview of the Automated Reliability Modeling (ARM) program, under development at NASA Langley Research Center. ARM will accept as input a description of the PMS interconnection graph, the behavior of the PMS components, the fault-tolerant strategies, and the operational requirements. The output of ARM will be the reliability of availability Markov model formulated for direct use by evaluation programs. The advantages of such an approach are (a) utility to a large class of users, not necessarily expert in reliability analysis, and (b) a lower probability of human error in the computation.

Liceaga, C. A.↗

NASA NTRSDate not supplied

Automated Multi-Robot Assembly of Compliance Optimized Structures

Autonomous assembly of large structures is one of the fundamental challenges on the way towards NASA’s objectives of deep space exploration. In this work, we propose an algorithmic framework to optimize the assembly process of a prescribed target structure by constraining the assembly effort as well as maintaining structural soundness throughout the process. This framework uses structural topology optimization with assembly effort metrics to generate checkpoints for robotic traversal algorithms. Assembly effort is quantified by the Wasserstein metric between consecutive structural configurations during the assembly process. The robotic assembly task is split into two subtasks, where we first optimize for a set of key frames, then perform reconfiguration between consecutive frames. Key frames are optimized by adopting topology optimization techniques to reduce assembly effort and maintain structural integrity during the assembly process, while reconfiguration between key frames is performed using a path planning algorithm with a minimum weight maximum matching approach on a bipartite graph. We employ a Crystalline robot model in which each structural element is capable of locomotion through the structure and locking into place with neighboring elements after reaching its destination. An example assembly of a two-dimensional cantilever beam under volume constraints and structural compliance considerations is presented to demonstrate the approach. Finally, we conclude by discussing possible future extensions to this work, including adoption of better metrics, extension to three-dimensional large-scale problems, and exacting finer control of structural integrity during the path-planning phase.

robotic assembly↗

NASA NTRS2002

Contingency Planning for Planetary Rovers

There has been considerable work in AI on planning under uncertainty. But this work generally assumes an extremely simple model of action that does not consider continuous time and resources. These assumptions are not reasonable for a Mars rover, which must cope with uncertainty about the duration of tasks, the power required, the data storage necessary, along with its position and orientation. In this paper, we outline an approach to generating contingency plans when the sources of uncertainty involve continuous quantities such as time and resources. The approach involves first constructing a "seed" plan, and then incrementally adding contingent branches to this plan in order to improve utility. The challenge is to figure out the best places to insert contingency branches. This requires an estimate of how much utility could be gained by building a contingent branch at any given place in the seed plan. Computing this utility exactly is intractable, but we outline an approximation method that back propagates utility distributions through a graph structure similar to that of a plan graph.

Dearden, Richard↗

NASA NTRS2003

Incremental Contingency Planning

There has been considerable work in AI on planning under uncertainty. However, this work generally assumes an extremely simple model of action that does not consider continuous time and resources. These assumptions are not reasonable for a Mars rover, which must cope with uncertainty about the duration of tasks, the energy required, the data storage necessary, and its current position and orientation. In this paper, we outline an approach to generating contingency plans when the sources of uncertainty involve continuous quantities such as time and resources. The approach involves first constructing a "seed" plan, and then incrementally adding contingent branches to this plan in order to improve utility. The challenge is to figure out the best places to insert contingency branches. This requires an estimate of how much utility could be gained by building a contingent branch at any given place in the seed plan. Computing this utility exactly is intractable, but we outline an approximation method that back propagates utility distributions through a graph structure similar to that of a plan graph.

Dearden, Richard↗

NASA NTRS2009

Constructing LDPC Codes from Loop-Free Encoding Modules

A method of constructing certain low-density parity-check (LDPC) codes by use of relatively simple loop-free coding modules has been developed. The subclasses of LDPC codes to which the method applies includes accumulate-repeat-accumulate (ARA) codes, accumulate-repeat-check-accumulate codes, and the codes described in Accumulate-Repeat-Accumulate-Accumulate Codes (NPO-41305), NASA Tech Briefs, Vol. 31, No. 9 (September 2007), page 90. All of the affected codes can be characterized as serial/parallel (hybrid) concatenations of such relatively simple modules as accumulators, repetition codes, differentiators, and punctured single-parity check codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. These codes can also be characterized as hybrid turbolike codes that have projected graph or protograph representations (for example see figure); these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The present method comprises two related submethods for constructing LDPC codes from simple loop-free modules with circulant permutations. The first submethod is an iterative encoding method based on the erasure-decoding algorithm. The computations required by this method are well organized because they involve a parity-check matrix having a block-circulant structure. The second submethod involves the use of block-circulant generator matrices. The encoders of this method are very similar to those of recursive convolutional codes. Some encoders according to this second submethod have been implemented in a small field-programmable gate array that operates at a speed of 100 megasymbols per second. By use of density evolution (a computational- simulation technique for analyzing performances of LDPC codes), it has been shown through some examples that as the block size goes to infinity, low iterative decoding thresholds close to channel capacity limits can be achieved for the codes of the type in question having low maximum variable node degrees. The decoding thresholds in these examples are lower than those of the best-known unstructured irregular LDPC codes constrained to have the same maximum node degrees. Furthermore, the present method enables the construction of codes of any desired rate with thresholds that stay uniformly close to their respective channel capacity thresholds.

Divsalar, Dariush↗

NASA NTRS1987

High resolution infrared spectroscopy from space: A preliminary report on the results of the Atmospheric Trace Molecule Spectroscopy (ATMOS) experiment on Spacelab 3

The ATMOS (Atmospheric Trace Molecule Spectroscopy) experiment has the broad purpose of investigating the physical structure, chemistry, and dynamics of the upper atmosphere through the study of the distributions of the neutral minor and trace constituents and their seasonal and long-term variations. The technique used is high-resolution infrared absorption spectroscopy using the Sun as the radiation source, observing the changes in the transmission of the atmosphere as the line-of-sight from the Sun to the spacecraft penetrates the atmosphere close to the Earth's limb at sunrise and sunset. During these periods, interferograms are generated at the rate of one each second which yield, when transformed, high resolution spectra covering the 2.2 to 16 micron region of the infrared. Twenty such occultations were recorded during the Spacelab 3 flight, which have produced concentration profiles for a large number of minor and trace upper atmospheric species in both the Northern and Southern Hemispheres. Several of these species have not previously been observed in spectroscopic data. The data reduction and analysis procedures used following the flight are discussed; a number of examples of the spectra obtained are shown, and a bar graph of the species detected thus far in the analysis is given which shows the altitude ranges for which concentration profiles were retrieved.

Farmer, Crofton B.↗

NASA NTRS2004

Website of the Systems and Analysis Branch Supported Projects and Graph Analysis

Throughout the past few weeks I have learned a great amount of information about many interesting aspects that go on here at NASA Glenn Research Center Branch 7820. Branch 7820 is the Systems and Analysis Branch. The people involved in this Branch deal with in a nutshell the analysis of propulsion systems for Earth to orbit and space transportation systems. The first project that I had worked on was helping my mentor learn more about lunar geography and the most recommended way to maintain communication for our future lunar missions. During this time I studied the craters of the moon, especially the South Pole, to provide her with information so that she can make decisions. I also researched to provide her with contact information on those people who are specialized in lunar geography so that she may talk to them to find out more in depth information. Most of my time spent here has been helping to develop a comprehensive explanation and background of the different projects our Branch has supported. When I first came to NASA Glenn and started working with the 7820 Branch there website had many holes that needed to be filled in. I have spent numerous weeks researching information about topics such as Project Prometheus itself and one of its components Jupiter s Icy Moons Orbiter (JIMO). I have also done a large amount of research on propulsion systems and how different kinds work. I have learned many facts about Nuclear Electric Propulsion (NEP) all the way to Nuclear Thermal Propulsion (NTP) systems. I will continue to do this until all the holes are filled and find out about Global Integrated Design Environment (GLIDE) and Next Generation Launch technology (NGLT). Since most of my job was providing information to go onto a website I has to learn how to put my information into a HTML format. I had no previous knowledge on how to do that kind of task and had to study how to do it and am now able to create a document in HTML format. There has been reorganizing done here at NASA Glenn and our Branch was moved to another building. Therefore, our library had to be moved with us. I spent time helping to put together the boxes, pack the library, and label them accordingly. This was not an easy task but was an experience in itself. I was able to see old posters that NASA had produced about different space missions and look at Russian map of the US and books on space missions. I was also about to see what was in the library in terms of reference material helped because now I can make use of the information for my research on the website. Throughout my internship my mentor will provide me with graphs to analyze and recreate so that she may use them to her advantage. I will learn from every piece of data that comes my way. Later, I will study and analysis gravity-loss for Earth departure trajectories. Since I haven't done that yet I cannot really describe what 1 will learn or what exactly the project entails. The whole experience has been great and I have no doubt that it will exceed every expectation previously thought.

Kellerman, Corinne↗

NASA NTRS1993

Parametric binary dissection

Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.

Bokhari, Shahid H.↗

NASA NTRS2001

Ceiling Fires Studied to Simulate Low-Gravity Fires

A unique new way to study low-gravity flames in normal gravity has been developed. To study flame structure and extinction characteristics in low-stretch environments, a normal gravity low-stretch diffusion flame was generated using a cylindrical PMMA sample of varying large radii, as shown in the photograph. These experiments have demonstrated that low-gravity flame characteristics can be generated in normal gravity through the proper use of scaling. On the basis of this work, it is feasible to apply this concept toward the development of an Earth-bound method of evaluating material flammability in various gravitational environments from normal gravity to microgravity, including the effects of partial gravity low-stretch rates such as those found on the Moon (1/6g) or Mars (1/3g). During these experiments, the surface regression rates for PMMA were measured for the first time over the full range of flammability in air, from blowoff at high stretch, to quenching at low stretch, as plotted in the graph. The solid line drawn through the central portion of the data (3<a<100 sec-1) has a slope of unity, which indicates regression is proportional to stretch. The figure coordinates assume that the values of stretch are equivalent, whether derived from forced stretch or from buoyant stretch. The excellent correlation of the regression-rate data over the two-order-of-magnitude variation of stretch shows the reasonableness of this assumption.

Olson, Sandra L.↗

NASA NTRS1987

Efficient reordering of Prolog programs

Redundant search often makes Prolog programs inefficient. Prolog execution corresponds to a depth-first traversal of an AND/OR graph; often a large subgraph will be searched successfully, with failure resulting from a subsequent small one. It is shown how reordering of Prolog clauses and especially goals can prevent unnecessary search. The restrictions on reordering are characterized and how they may be detected is shown. A new system of calling modes for Prolog, geared to reordering, and a system for inferring them automatically are designed. An improved method for determining a good goal order for Prolog clauses is presented, and it is used as the basis for a reordering system, showing how it can be guided by information about modes and restrictions to generate reordered Prolog that behaves correctly.

Gooley, Markian M.↗

NASA NTRS1972

Strongly coupled stress waves in heterogeneous plates.

Consideration of coupled stress waves generated by an impulsive load applied at one end of a semiinfinite plate. For the field equations governing the one-dimensional coupled waves a hyperbolic system of equations is obtained in which a strong coupling in the second derivatives exists. The method of characteristics described by Chou and Mortimer (1967) is extended to cover the case of strong coupling, and a study is made of the transient stress waves in a semiinfinite plate subjected to an initial step input. Coupled discontinuity fronts are found to propagate at different velocities. The normal plate stress and the bending moment at different time regimes are illustrated by graphs.

Wang, A. S. D.↗

NASA NTRS2015

A Fast Goal Recognition Technique Based on Interaction Estimates

Goal Recognition is the task of inferring an actor's goals given some or all of the actor's observed actions. There is considerable interest in Goal Recognition for use in intelligent personal assistants, smart environments, intelligent tutoring systems, and monitoring user's needs. In much of this work, the actor's observed actions are compared against a generated library of plans. Recent work by Ramirez and Geffner makes use of AI planning to determine how closely a sequence of observed actions matches plans for each possible goal. For each goal, this is done by comparing the cost of a plan for that goal with the cost of a plan for that goal that includes the observed actions. This approach yields useful rankings, but is impractical for real-time goal recognition in large domains because of the computational expense of constructing plans for each possible goal. In this paper, we introduce an approach that propagates cost and interaction information in a plan graph, and uses this information to estimate goal probabilities. We show that this approach is much faster, but still yields high quality results.

gola recognition↗

NASA NTRS2010

Software Tool Integrating Data Flow Diagrams and Petri Nets

Data Flow Diagram - Petri Net (DFPN) is a software tool for analyzing other software to be developed. The full name of this program reflects its design, which combines the benefit of data-flow diagrams (which are typically favored by software analysts) with the power and precision of Petri-net models, without requiring specialized Petri-net training. (A Petri net is a particular type of directed graph, a description of which would exceed the scope of this article.) DFPN assists a software analyst in drawing and specifying a data-flow diagram, then translates the diagram into a Petri net, then enables graphical tracing of execution paths through the Petri net for verification, by the end user, of the properties of the software to be developed. In comparison with prior means of verifying the properties of software to be developed, DFPN makes verification by the end user more nearly certain, thereby making it easier to identify and correct misconceptions earlier in the development process, when correction is less expensive. After the verification by the end user, DFPN generates a printable system specification in the form of descriptions of processes and data.

Thronesbery, Carroll↗

NASA NTRSDate not supplied

Citizen Science Approach for Searching and Curating Literature of the Effects of Spaceflight on Cardiovascular Outcomes in Rodents and Humans

The spaceflight environment causes significant changes to the structure and function of the cardiovascular system, including fluid redistribution, alterations in blood pressure, and changes in cardiac output. The goal of this project is to quantitatively summarize the data on the effects of actual or simulated microgravity and radiation exposure resulting from spaceflight on the cardiovascular system. As the first step, a group of investigators approached through a collaboration of the Ames Life Science Data Archive (ALSDA) Analysis Working Group developed a list of relevant cardiovascular search terms. Based on these, medical librarians generated and executed the search strategy in Medline, CINAHL, Embase and NASA repositories. In parallel, we recruited students and young professionals from various space industry-affiliated organizations, resulting in ~100 individuals joining. With this program we aimed to reach students and young people underrepresented in STEM, including first-generation, female, minorities, disadvantaged backgrounds, fostered individuals, etc. These individuals completed a virtual training course on the nature and methodologies of the project. Following this, the participants were structured into teams with more senior/experienced individuals designated as team leaders. Currently, the teams are screening approximately 15,000 studies using the systematic review tool, Covidence. Teams will be extracting and curating data for meta-analysis of the cardiovascular spaceflight literature, but also extracting, submitting, and curating appropriate datasets into the new ALSDA submission portal and repository. This effort will result in collaborative publications based upon the literature meta-analyses, and a number of publicly accessible datasets for reuse, modeling, machine learning, and knowledge graph-type approaches. This approach reduces the length of time to complete title/abstract screening time from 1-2 years needed for this volume of studies, to 3-4 months, while also providing a unique, open-access educational experience to space research and training in knowledge synthesis tools to interested individuals.

space biology↗

NASA NTRS2004

Software for Analyzing Sequences of Flow-Related Images

Spotlight is a computer program for analysis of sequences of images generated in combustion and fluid physics experiments. Spotlight can perform analysis of a single image in an interactive mode or a sequence of images in an automated fashion. The primary type of analysis is tracking of positions of objects over sequences of frames. Features and objects that are typically tracked include flame fronts, particles, droplets, and fluid interfaces. Spotlight automates the analysis of object parameters, such as centroid position, velocity, acceleration, size, shape, intensity, and color. Images can be processed to enhance them before statistical and measurement operations are performed. An unlimited number of objects can be analyzed simultaneously. Spotlight saves results of analyses in a text file that can be exported to other programs for graphing or further analysis. Spotlight is a graphical-user-interface-based program that at present can be executed on Microsoft Windows and Linux operating systems. A version that runs on Macintosh computers is being considered.

Klimek, Robert↗

NASA NTRS2012

Calculation of Sensitivity Derivatives in an MDAO Framework

During gradient-based optimization of a system, it is necessary to generate the derivatives of each objective and constraint with respect to each design parameter. If the system is multidisciplinary, it may consist of a set of smaller "components" with some arbitrary data interconnection and process work ow. Analytical derivatives in these components can be used to improve the speed and accuracy of the derivative calculation over a purely numerical calculation; however, a multidisciplinary system may include both components for which derivatives are available and components for which they are not. Three methods to calculate the sensitivity of a mixed multidisciplinary system are presented: the finite difference method, where the derivatives are calculated numerically; the chain rule method, where the derivatives are successively cascaded along the system's network graph; and the analytic method, where the derivatives come from the solution of a linear system of equations. Some improvements to these methods, to accommodate mixed multidisciplinary systems, are also presented; in particular, a new method is introduced to allow existing derivatives to be used inside of finite difference. All three methods are implemented and demonstrated in the open-source MDAO framework OpenMDAO. It was found that there are advantages to each of them depending on the system being solved.

Moore, Kenneth T.↗