Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 415 records · Page 23

Partitioning problems in parallel, pipelined, and distributed computing

The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-satellite system: partitioning multiple chain-structured parallel programs, multiple arbitrarily structured serial programs, and single-tree structured parallel programs. In addition, the problem of partitioning chain-structured parallel programs across chain-connected systems is solved under certain constraints. All solutions for parallel programs are equally applicable to pipelined programs. These results extend prior research in this area by explicitly taking concurrency into account and permit the efficient utilization of multiple-computer architectures for a wide range of problems of practical interest.

Bokhari, Shahid H.↗

NASA’s High-Resolution GEOS Forecasting and Reanalysis Products: Impact of Stratospheric Intrusions on Surface Ozone Air Quality

A new approach to the study of stratospheric intrusions (SIs)? the introduction of ozone-rich lower stratospheric air into the troposphere ? uses NASA's Goddard Earth Observing System Model (GEOS) model and assimilation products with an objective feature tracking algorithm to investigate the atmospheric dynamics in the UTLS region that generate SIs and the different mechanisms through which SIs may influence tropospheric chemistry and surface air quality. In particular, SIs have been linked with surface ozone air quality exceedances, especially at the high elevations in the western USA in springtime. However, the impact of SIs in the remaining seasons and over the rest of the USA is less clear. Improved understanding of the connections between large-scale climate variability and local-scale dynamically-driven air quality events may support improved seasonal prediction of SI events. While the spring over the western USA does exhibit the largest number of SIs affecting the lower troposphere, we demonstrate that the number of intrusions in the remaining seasons and over the eastern USA is sizable. Using a multitude of observational datasets, including lidar data, ozonesondes and air quality monitoring surface sites, in combination with GEOS forecast and reanalysis products, the transport of ozone from the stratosphere toward the surface is assessed. By focusing on recent reports of high ozone at monitoring station sites likely associated with SIs, we aim to provide the public with tools which are available in near-real time to enhance their capability to identify the impact of stratospheric air on surface ozone concentrations separate from anthropogenic sources.

Knowland, K. Emma↗

Machine Learning for the Validation of Expert-Elicited Causal Risk Diagrams

Exposure to spaceflight poses risk to human health in complex ways. To help manage this risk, the Human Systems Risk Board (HSRB) at the National Aeronautics and Space Administration (NASA) maintains a set of causal diagrams that attempt to explain how spaceflight hazards generate health risks and lead to adverse outcomes both in-mission, immediately post-mission, and over the long term. These causal risk diagrams are formulated as directed acyclic graphs (DAGs) and can function as knowledge graphs of connected risks and outcomes. These DAGs have proven useful for communication, and, through network analysis, have allowed for the identification of structurally important factors in the risk network. However, the utility these DAGs provide is directly proportional to their verisimilitude, making assessment of this trait using empirical data – whether from actual human spaceflight or various spaceflight analogue exposures and model organisms – a high priority. In this research we explore the use of machine learning algorithms to learn DAG structure from empirical data as a means of evaluating human-elicited DAG structures. To do so, we test several different graph structure-learning algorithms on data concerning changes in the bones of rats and mice after exposure to either spaceflight or a spaceflight analogue. We explore potential methods for indexing the similarity between each algorithm’s output DAG with all the others and with that of the expert-elicited DAG. We discuss next steps in this ongoing line of research and open science initiatives underway to complete them.

directed acyclic graphs↗

Microprocessor arrays for large scale computation

An important new direction in computer architecture centers around the achievement of very high computational power (capacity, speed and reliability) through the use of tens of thousands of microprocessors, micromemories, and switch modules, all interconnected into a large homogeneous network using one of certain advanced connection schemes. When surrounded and supported by conventional computers and memories, such a machine holds potential for out-performing both conventional and array-based computers of the mid-1980's by one to two orders of magnitude, at least for particular classes of applications amenable to high parallelism, such as aerodynamic simulation. The homogeneous feature of this machine concept also implies size extendability, fault tolerance, and improved flexibility to handle a variety of algorithms of interest. Current work is addressing the design of technologically efficient interconnection configurations and the development of new computation algorithms that are especially efficient for highly parallel computation.

Kautz, W. H.↗

Investigation of electrodynamic stabilization and control of long orbiting tethers

The state-of-the-art in tether modelling among participants in the Tethered Satellite System (TSS) Program, the slack tether and its behavior, and certain advanced applications of the tether to problems in orbital mechanics are identified. The features and applications of the TSS software set are reviewed. Modelling the slack tether analytically with as many as 50 mass points and the application of this new model to a study of the behavior of a broken tether near the Shuttle are described. A reel control algorithm developed by SAO and examples of its use are described, including an example which also demonstrates the use of the tether in transferring a heavy payload from a low-orbiting Shuttle to a high circular orbit. Capture of a low-orbiting payload by a Space Station in high circular orbit is described. Energy transfer within a dumbbell-type spacecraft by cyclical reeling operations or gravitational effects on the natural elasticity of the connecting tether, it is shown, can circularize the orbit of the spacecraft.

Colombo, G.↗

Study of the dynamics of orbital assemblies including interactions with geometrical appendages

The complete equations for the Unified Flexible Spacecraft Simulation (UFSS) program developed for the NASA/MSFC are presented. This general purpose simulation program is based on an algorithm which utilizes the digital computer to synthesize the dynamic and kinematic equations for a topological tree configuration of N interconnected bodies (the interconnected system of bodies forms no closed loops), the terminal members of which may be flexible. Necessary input quantities to the dynamic subroutine include the mass and inertia properties of each body and the flexible characteristics of each terminal member in addition to the specification, for each body, of those bodies to which it connects. This latter description involves the specification of the number of rotational degrees of freedom at each interconnection along with the associated position vectors defining these connections relative to the mass centers of the bodies involved. These position vectors can be input as time-varying functions if desired, thus affording the capability of studying the effects of time-varying hinge locations. Springs and dampers are assumed to act at each interconnection and structural damping in the flexible terminal members is included in the form of equivalent viscous damping.

Ness, D. J.↗

Symbolic Computation of Strongly Connected Components Using Saturation

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in many applications, we employ saturation on two previously proposed approaches: the Xie-Beerel algorithm and transitive closure. First, saturation speeds up state-space exploration when computing each SCC in the Xie-Beerel algorithm. Then, our main contribution is a novel algorithm to compute the transitive closure using saturation. Experimental results indicate that our improved algorithms achieve a clear speedup over previous algorithms in some cases. With the help of the new transitive closure computation algorithm, up to 10(exp 150) SCCs can be explored within a few seconds.

Zhao, Yang↗

3-D Deformable Grid Electomagnetic PIC for Parallel Computers

We have developed a three-dimensional non-orthogonal grid electromagnetic PIC code for parallel supercomputers. The numerical formulation is based on hexahedral cells which are logically connected cubic cells but distorted to body-fit complex geometries in physical space. An outstanding area of research is to improve the accuracy of the electromagnetic field solve on distorted meshes.

3D deformable non-orthogonal grid code PIC codes p↗

Large space structures ground and flight progress

Unprecedented challenges arise in connection with the design and certification of space systems which are too large to be transported into orbit fully assembled. Special situations arising in the case of such systems make it necessary to rely much more on analysis than in past programs. The present investigation is concerned with the status of some research activities oriented primarily to the improvement of analysis capabilities through coordinated ground and flight testing. Aspects of system identification are explored, taking into account an eigensystem realization algorithm, and the Hoop-Column Antenna concept. Attention is also given to a suitable method for analyzing the Hoop-Column antenna structure, a deployment analysis, certification issues for large space structures, a generic space station model, and the use of actuators.

Pinson, L. D.↗

Improving the reconstruction of the velocity potential and primordial density fluctuations by choice of smoothing windows

Recently considerable attention has been focused on improving algorithms for restoring primordial density fluctuations in the universe or investigating large-scale velocity fields by going to higher order approximations relating nonlinear states to their initial conditions. An alternative approach is to investigate the use of alternative smoothing windows within the context of first-order approximations. I present evidence that the universally used Gaussian smoothing window is far from optimal. A sharp truncation P(k) = 0 for k greater than k(c) leads to a much more direct connection to initial conditions for either 'Gaussianization' methods or use of the Zel'dovich approximation, as discussed in the text.

Melott, Adrian L.↗

Connecting Satellite-Based Precipitation Estimates to Users

Beginning in 1997, the Merged Precipitation Group at NASA Goddard has distributed gridded global precipitation products built by combining satellite and surface gauge data. This started with the Global Precipitation Climatology Project (GPCP), then the Tropical Rainfall Measuring Mission (TRMM) Multi-satellite Precipitation Analysis (TMPA), and recently the Integrated Multi-satellitE Retrievals for the Global Precipitation Measurement (GPM) mission (IMERG). This 20+-year (and on-going) activity has yielded an important set of insights and lessons learned for making state-of-the-art precipitation data accessible to the diverse communities of users. Merged-data products critically depend on the input sensors and the retrieval algorithms providing accurate, reliable estimates, but it is also important to provide ancillary information that helps users determine suitability for their application. We typically provide fields of estimated random error, and recently reintroduced the quality index concept at user request. Also at user request we have added a (diagnostic) field of estimated precipitation phase. Over time, increasingly more ancillary fields have been introduced for intermediate products that give expert users insight into the detailed performance of the combination algorithm, such as individual merged microwave and microwave-calibrated infrared estimates, the contributing microwave sensor types, and the relative influence of the infrared estimate.

Huffman, George J.↗

Recent enhancements to the GRIDGEN structured grid generation system

Significant enhancements are being implemented into the GRIDGEN3D, multiple block, structured grid generation software. Automatic, point-to-point, interblock connectivity will be possible through the addition of the domain entity to GRIDBLOCK's block construction process. Also, the unification of GRIDGEN2D and GRIDBLOCK has begun with the addition of edge grid point distribution capability to GRIDBLOCK. The geometric accuracy of surface grids and the ease with which databases may be obtained is being improved by adding support for standard computer-aided design formats (e.g., PATRAN Neutral and IGES files). Finally, volume grid quality was improved through addition of new SOR algorithm features and the new hybrid control function type to GRIDGEN3D.

Steinbrenner, John P.↗

Development of a knoweledge-based system for validating finite element models

The finite element modeling of an airframe structure requires knowledge of general purpose programs such as NASTRAN as well as a detailed understanding of the airframe structure. Due to the sophistication of general purpose programs such as NASTRAN, a substantial investment in time and effort is required to gain expertise in using them effectively. This paper describes the development of an expert system used in the validation of NASTRAN based finite element models. Experts in the NASTRAN based finite element modeling of airframe structures were interviewed to document, understand, and represent their knowledge and reasoning in the expert system. Finite element stress analysis and internal loads reports generated by the experts were reviewed to determine expert resolution of problem areas. As a result, areas requiring expert assistance in the modeling of the airframe structures were identified. The finite element input data is represented as a set of 'facts'. A rule based representation is used to code the expert knowledge. A hierarchical set of rules are applied. The expert system first acts as an intelligent front end to insure that all the prerequisites needed to perform the analysis are present. This includes material properties, boundary conditions, and connectivity information. The next step examines if incompatible sets of elements are connected. The succeeding step examines if the specific airframe component is modeled by the appropriate set of elements. The next and final step examines if the airframe members used are adequate to represent the anticipated state of stress. The expert system is designed to inform the user the severity of the error, the likely consequence and possible remedial action. The shell used in the development of the expert system is CLIPS. CLIPS contains a forward chaining inference engine based on the Rete algorithm. CLIPS may be implemented on most personal computers as well as mini computers and mainframes. The approach taken is general and can be implemented using commercially available expert system shells.

Munir, N. I.↗

Shortcomings with Tree-Structured Edge Encodings for Neural Networks

In evolutionary algorithms a common method for encoding neural networks is to use a tree structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to preexisting I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controllers for a goal-scoring task.

Hornby, Gregory S.↗

Geometrically derived difference formulae for the numerical integration of trajectory problems

The term 'trajectory problem' is taken to include problems that can arise, for instance, in connection with contour plotting, or in the application of continuation methods, or during phase-plane analysis. Geometrical techniques are used to construct difference methods for these problems to produce in turn explicit and implicit circularly exact formulae. Based on these formulae, a predictor-corrector method is derived which, when compared with a closely related standard method, shows improved performance. It is found that this latter method produces spurious limit cycles, and this behavior is partly analyzed. Finally, a simple variable-step algorithm is constructed and tested.

Mcleod, R. J. Y.↗

Multi-agent planning and scheduling, execution monitoring and incremental rescheduling: Application to motorway traffic

This article describes a planning method applicable to agents with great perception and decision-making capabilities and the ability to communicate with other agents. Each agent has a task to fulfill allowing for the actions of other agents in its vicinity. Certain simultaneous actions may cause conflicts because they require the same resource. The agent plans each of its actions and simultaneously transmits these to its neighbors. In a similar way, it receives plans from the other agents and must take account of these plans. The planning method allows us to build a distributed scheduling system. Here, these agents are robot vehicles on a highway communicating by radio. In this environment, conflicts between agents concern the allocation of space in time and are connected with the inertia of the vehicles. Each vehicle made a temporal, spatial, and situated reasoning in order to drive without collision. The flexibility and reactivity of the method presented here allows the agent to generate its plan based on assumptions concerning the other agents and then check these assumptions progressively as plans are received from the other agents. A multi-agent execution monitoring of these plans can be done, using data generated during planning and the multi-agent decision-making algorithm described here. A selective backtrack allows us to perform incremental rescheduling.

Mourou, Pascal↗

NASA Tech Briefs, July 2012

Topics covered include: Instrument Suite for Vertical Characterization of the Ionosphere-Thermosphere System; Terahertz Radiation Heterodyne Detector Using Two-Dimensional Electron Gas in a GaN Heterostructure; Pattern Recognition Algorithm for High-Sensitivity Odorant Detection in Unknown Environments; Determining Performance Acceptability of Electrochemical Oxygen Sensors; Versatile Controller for Infrared Lamp and Heater Arrays; High-Speed Scanning Interferometer Using CMOS Image Sensor and FPGA Based on Multifrequency Phase-Tracking Detection; Ultra-Low-Power MEMS Selective Gas Sensors; Compact Receiver Front Ends for Submillimeter-Wave Applications; Dynamically Reconfigurable Systolic Array Accelerator; Blocking Losses With a Photon Counter; Motion-Capture-Enabled Software for Gestural Control of 3D Mod; Orbit Software Suite; CoNNeCT Baseband Processor Module Boot Code SoftWare (BCSW); Trajectory Software With Upper Atmosphere Model; ALSSAT Version 6.0; Employing a Grinding Technology to Assess the Microbial Density for Encapsulated Organisms; Demonstration of Minimally Machined Honeycomb Silicon Carbide Mirrors; Polyimide Aerogel Thin Films; Nanoengineered Thermal Materials Based on Carbon Nanotube Array Composites; Composite Laminate With Coefficient of Thermal Expansion Matching D263 Glass; Robust Tensioned Kevlar Suspension Design; Focal Plane Alignment Utilizing Optical CMM; Purifying, Separating, and Concentrating Cells From a Sample Low in Biomass; Virtual Ultrasound Guidance for Inexperienced Operators; Beat-to-Beat Blood Pressure Monitor; Non-Contact Conductivity Measurement for Automated Sample Processing Systems; An MSK Radar Waveform; Telescope Alignment From Sparsely Sampled Wavefront Measurements Over Pupil Subapertures; Method to Remove Particulate Matter from Dusty Gases at Low Pressures; Terahertz Quantum Cascade Laser With Efficient Coupling and Beam Profile; Measurement Via Optical Near-Nulling and Subaperture Stitching; 885-nm Pumped Ceramic Nd:YAG Master Oscillator Power Amplifier Laser System; Airborne Hyperspectral Imaging System; Heat Shield Employing Cured Thermal Protection Material Blocks Bonded in a Large-Cell Honeycomb Matrix; and Asymmetric Supercapacitor for Long-Duration Power Storage.

Source record↗

A generic fine-grained parallel C

With the present availability of parallel processors of vastly different architectures, there is a need for a common language interface to multiple types of machines. The parallel C compiler, currently under development, is intended to be such a language. This language is based on the belief that an algorithm designed around fine-grained parallelism can be mapped relatively easily to different parallel architectures, since a large percentage of the parallelism has been identified. The compiler generates a FORTH-like machine-independent intermediate code. A machine-dependent translator will reside on each machine to generate the appropriate executable code, taking advantage of the particular architectures. The goal of this project is to allow a user to run the same program on such machines as the Massively Parallel Processor, the CRAY, the Connection Machine, and the CYBER 205 as well as serial machines such as VAXes, Macintoshes and Sun workstations.

Hamet, L.↗