Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Node selection”

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 73 records · Page 4

Advanced Electric Propulsion for Space Solar Power Satellites

The sun tower concept of collecting solar energy in space and beaming it down for commercial use will require very affordable in-space as well as earth-to-orbit transportation. Advanced electric propulsion using a 200 kW power and propulsion system added to the sun tower nodes can provide a factor of two reduction in the required number of launch vehicles when compared to in-space cryogenic chemical systems. In addition, the total time required to launch and deliver the complete sun tower system is of the same order of magnitude using high power electric propulsion or cryogenic chemical propulsion: around one year. Advanced electric propulsion can also be used to minimize the stationkeeping propulsion system mass for this unique space platform. 50 to 100 kW class Hall, ion, magnetoplasmadynamic, and pulsed inductive thrusters are compared. High power Hall thruster technology provides the best mix of launches saved and shortest ground to Geosynchronous Earth Orbital Environment (GEO) delivery time of all the systems, including chemical. More detailed studies comparing launch vehicle costs, transfer operations costs, and propulsion system costs and complexities must be made to down-select a technology. The concept of adding electric propulsion to the sun tower nodes was compared to a concept using re-useable electric propulsion tugs for Low Earth Orbital Environment (LEO) to GEO transfer. While the tug concept would reduce the total number of required propulsion systems, more launchers and notably longer LEO to GEO and complete sun tower ground to GEO times would be required. The tugs would also need more complex, longer life propulsion systems and the ability to dock with sun tower nodes.

Oleson, Steve↗

Quantized-"Gray-Scale" Electronic Synapses

Proposed array of programmable synaptic connections for electronic neural network applications offers multiple quantized levels of connection strength using only simple, two-terminal, binary microswitch devices. Subgrids in fine grid of programmable resistive connections connected externally in parallel to form coarser synaptic grid. By selection of pattern of connections in each subgrid, connection strength of synaptic node represented by that subgrid set at quantized "gray level". Device structures promise implementations of quantized-"gray-scale" synaptic arrays with very high density.

Lamb, James L.↗

Browsing schematics: Query-filtered graphs with context nodes

The early results of a research project to create tools for building interfaces to intelligent systems on the NASA Space Station are reported. One such tool is the Schematic Browser which helps users engaged in engineering problem solving find and select schematics from among a large set. Users query for schematics with certain components, and the Schematic Browser presents a graph whose nodes represent the schematics with those components. The query greatly reduces the number of choices presented to the user, filtering the graph to a manageable size. Users can reformulate and refine the query serially until they locate the schematics of interest. To help users maintain orientation as they navigate a large body of data, the graph also includes nodes that are not matches but provide global and local context for the matching nodes. Context nodes include landmarks, ancestors, siblings, children and previous matches.

Ciccarelli, Eugene C.↗

Space-Subdivision Algorithm for Abstract Trajectories

Computational overhead in testing links between nodes reduced. Computationally efficient algorithm facilitates subdivision of n-dimensional spaces during selection, testing, or optimization of trajectories in those spaces. Reduces cost of computation in such diverse problems as scheduling of interrelated events to avoid conflicts, devising efficient production-line layouts and operating schedules, routing telephone calls, and analyzing the motions of gas particles.

Lyon, Douglas K.↗

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗

Discrete observability and numerical quadrature

The authors consider the problem of approximate observability of a one-dimensional diffusion equation on a finite spatial domain with spatial point measurements. The problem of the optimal selection of the measurement points is considered under three conditions: (1) no preassigned measurement nodes; (2) one preassigned node and; (3) two preassigned nodes. The main observation is that the optimal choice is related to three classical procedures in numerical analysis: (1) Gaussian quadrature; (2) Radau quadrature and; (3) Lobatto quadrature. It is shown that the existence of the Radau and Lobatto quadrature is closely related to classical root locus theory.

Martin, Clyde F.↗

Structure identification in fuzzy inference using reinforcement learning

In our previous work on the GARIC architecture, we have shown that the system can start with surface structure of the knowledge base (i.e., the linguistic expression of the rules) and learn the deep structure (i.e., the fuzzy membership functions of the labels used in the rules) by using reinforcement learning. Assuming the surface structure, GARIC refines the fuzzy membership functions used in the consequents of the rules using a gradient descent procedure. This hybrid fuzzy logic and reinforcement learning approach can learn to balance a cart-pole system and to backup a truck to its docking location after a few trials. In this paper, we discuss how to do structure identification using reinforcement learning in fuzzy inference systems. This involves identifying both surface as well as deep structure of the knowledge base. The term set of fuzzy linguistic labels used in describing the values of each control variable must be derived. In this process, splitting a label refers to creating new labels which are more granular than the original label and merging two labels creates a more general label. Splitting and merging of labels directly transform the structure of the action selection network used in GARIC by increasing or decreasing the number of hidden layer nodes.

Berenji, Hamid R.↗

Accurate Adaptive Level Set Method and Sharpening Technique for Three Dimensional Deforming Interfaces

In this paper, we demonstrate improved accuracy of the level set method for resolving deforming interfaces by proposing two key elements: (1) accurate level set solutions on adapted Cartesian grids by judiciously choosing interpolation polynomials in regions of different grid levels and (2) enhanced reinitialization by an interface sharpening procedure. The level set equation is solved using a fifth order WENO scheme or a second order central differencing scheme depending on availability of uniform stencils at each grid point. Grid adaptation criteria are determined so that the Hamiltonian functions at nodes adjacent to interfaces are always calculated by the fifth order WENO scheme. This selective usage between the fifth order WENO and second order central differencing schemes is confirmed to give more accurate results compared to those in literature for standard test problems. In order to further improve accuracy especially near thin filaments, we suggest an artificial sharpening method, which is in a similar form with the conventional re-initialization method but utilizes sign of curvature instead of sign of the level set function. Consequently, volume loss due to numerical dissipation on thin filaments is remarkably reduced for the test problems

Kim, Hyoungin↗

Trade-Off Analysis Report

NASAs Glenn Research Center (GRC) defines and develops advanced technology for high priority national needs in communications technologies for application to aeronautics and space. GRC tasked Computer Networks and Software Inc. (CNS) to examine protocols and architectures for an In-Space Internet Node. CNS has developed a methodology for network reference models to support NASAs four mission areas: Earth Science, Space Science, Human Exploration and Development of Space (REDS), Aerospace Technology. CNS previously developed a report which applied the methodology, to three space Internet-based communications scenarios for future missions. CNS conceptualized, designed, and developed space Internet-based communications protocols and architectures for each of the independent scenarios. GRC selected for further analysis the scenario that involved unicast communications between a Low-Earth-Orbit (LEO) International Space Station (ISS) and a ground terminal Internet node via a Tracking and Data Relay Satellite (TDRS) transfer. This report contains a tradeoff analysis on the selected scenario. The analysis examines the performance characteristics of the various protocols and architectures. The tradeoff analysis incorporates the results of a CNS developed analytical model that examined performance parameters.

Dhas, Chris↗

Distributed Finite Element Analysis Using a Transputer Network

The principal objective of this research effort was to demonstrate the extraordinarily cost effective acceleration of finite element structural analysis problems using a transputer-based parallel processing network. This objective was accomplished in the form of a commercially viable parallel processing workstation. The workstation is a desktop size, low-maintenance computing unit capable of supercomputer performance yet costs two orders of magnitude less. To achieve the principal research objective, a transputer based structural analysis workstation termed XPFEM was implemented with linear static structural analysis capabilities resembling commercially available NASTRAN. Finite element model files, generated using the on-line preprocessing module or external preprocessing packages, are downloaded to a network of 32 transputers for accelerated solution. The system currently executes at about one third Cray X-MP24 speed but additional acceleration appears likely. For the NASA selected demonstration problem of a Space Shuttle main engine turbine blade model with about 1500 nodes and 4500 independent degrees of freedom, the Cray X-MP24 required 23.9 seconds to obtain a solution while the transputer network, operated from an IBM PC-AT compatible host computer, required 71.7 seconds. Consequently, the $80,000 transputer network demonstrated a cost-performance ratio about 60 times better than the $15,000,000 Cray X-MP24 system.

Watson, James↗

Finite element mesh refinement criteria for stress analysis

This paper discusses procedures for finite-element mesh selection and refinement. The objective is to improve accuracy. The procedures are based on (1) the minimization of the stiffness matrix race (optimizing node location); (2) the use of h-version refinement (rezoning, element size reduction, and increasing the number of elements); and (3) the use of p-version refinement (increasing the order of polynomial approximation of the elements). A step-by-step procedure of mesh selection, improvement, and refinement is presented. The criteria for 'goodness' of a mesh are based on strain energy, displacement, and stress values at selected critical points of a structure. An analysis of an aircraft lug problem is presented as an example.

Kittur, Madan G.↗

Complex Dynamics of Air Traffic Flow

Air traffic in the United States has continued to grow at a steady pace since 1980, except for a dip immediately after the tragic events of September 11, 2001. There are different growth scenarios associated both with the magnitude and the composition of the future air traffic. The Terminal Area Forecast (TAF), prepared every year by the FAA, projects the growth of traffic in the United States. Both Boeing and Airbus publish market outlooks for air travel annually. Although predicting the future growth of traffic is difficult, there are two significant trends: heavily congested major airports continue to see an increase in traffic, and the emergence of regional jets and other smaller aircraft with fewer passengers operating directly between non-major airports. The interaction between air traffic demand and the ability of the system to provide the necessary airport and airspace resources can be modeled as a network. The size of the resulting network varies depending on the choice of its nodes. It would be useful to understand the properties of this network to guide future design and development. Many questions, such as the growth of delay with increasing traffic demand and impact of the en route weather on future air traffic, require a systematic understanding of the properties of the air traffic network. There has been a major advance in the understanding of the behavior of networks with a large number of components. Several theories have been advanced about the evolution of large biological and engineering networks by authors in diversified disciplines like physics, mathematics, biology and computer science. Several networks exhibit a scale-free property in the sense that the probabilistic distribution of their nodes as a function of connections decreases slower than an exponential. These networks are characterized by the fact that a small number of components have a disproportionate influence on the performance of the network. Scale-free networks are tolerant to random failure of components, but are vulnerable to selective attack on components. This paper examines two network representations for the baseline air traffic system. A network defined with the 40 major airports as nodes and with standard flight routes as links has a characteristic scale: all nodes have 60 or more links and no node has more than 460 links. Another network is defined with baseline aircraft routing structure exhibits an exponentially truncated scale-free behavior. Its degree ranges from 2 connections to 2900 connections, and 225 nodes have more than 250 connections. Furthermore, those high-degree nodes are homogeneously distributed in the airspace. A consequence of this scale-free behavior is that the random loss of a single node has little impact, but the loss of multiple high-degree nodes (such as occurs during major storms in busy airspace) can adversely impact the system. Two future scenarios of air traffic growth are used to predict the growth of air traffic in the United States. It is shown that a three-times growth in the overall traffic may result in a ten-times impact on the density of traffic in certain parts of the United States.

Scale-free Networks↗

Concurrent communication among multi-transceiver stations over shared media

In order to increase a local-area network's throughput beyond a single bus data rate without using dedicated switching nodes, multiple buses and multitransceiver stations are required. The design space of single-hop interconnections is explored among such stations. Interconnections are presented whose throughput can grow quadratically with the number of transmitters and receivers per station. These are referred to as selective broadcast interconnections (SBIs). The performance of various SBIs are studied. A spread-spectrum channel can accommodate several current successful transmission, and a single-transceiver node can thus utilize only a small fraction of the channel capacity. In order to allocate the appropriate fraction of capacity to a busy node, it is proposed to equip it with several transmitters and receivers, thereby turning it into a supernode. Several architectures and operation policies for supernodes are suggested and compared. It is shown that a supernode can significantly outperform a collection of independent conventional nodes with the same total numbers of transmitters and receivers. Packet-radio networks with half-duplex nodes, as well as networks with full-duplex nodes, are considered.

Birk, Yitzhak↗

PHALANX: Expendable Projectile Sensor Networks for Planetary Exploration

Technologies enabling long-term, wide-ranging measurement in hard-to-reach areas are a critical need for planetary science inquiry. Phenomena of interest include flows or variations in volatiles, gas composition or concentration, particulate density, or even simply temperature. Improved measurement of these processes enables understanding of exotic geologies and distributions or correlating indicators of trapped water or biological activity. However, such data is often needed in unsafe areas such as caves, lava tubes, or steep ravines not easily reached by current spacecraft and planetary robots. To address this capability gap, we have developed miniaturized, expendable sensors which can be ballistically lobbed from a robotic rover or static lander - or even dropped during a flyover. These projectiles can perform sensing during flight and after anchoring to terrain features. By augmenting exploration systems with these sensors, we can extend situational awareness, perform long-duration monitoring, and reduce utilization of primary mobility resources, all of which are crucial in surface missions. We call the integrated payload that includes a cold gas launcher, smart projectiles, planning software, network discovery, and science sensing: PHALANX. In this paper, we introduce the mission architecture for PHALANX and describe an exploration concept that pairs projectile sensors with a rover “mothership.” Science use cases explored include reconnaissance using ballistic cameras, volatiles detection, and building timelapse maps of temperature and illumination conditions. Strategies to autonomously coordinate constellations of deployed sensors to self-discover and localize with peer ranging (i.e. a “local GPS”) are summarized, thus providing communications infrastructure beyond-line-of-sight (BLOS) of the rover. Capabilities were demonstrated through both simulation and physical testing with a terrestrial prototype. The approach to developing a terrestrial prototype is discussed, including design of the launching mechanism, projectile optimization, micro-electronics fabrication, and sensor selection. Results from early testing and characterization of commercial-off-the-shelf (COTS) components are reported. Nodes were subjected to successful burn-in tests over 48 hours at full logging duty cycle. Integrated field tests were conducted in the Roverscape, a half-acre planetary analog environment at NASA Ames, where we tested up to 10 sensor nodes simultaneously coordinating with an exploration rover. Ranging accuracy has been demonstrated to be within +/-10cm over 20m using commodity radios when compared to high-resolution laser scanner ground truthing. Evolution of the design, including progressive miniaturization of the electronics and iterated modifications of the enclosure housing for streamlining and optimized radio performance are described. Finally, lessons learned to date, gaps toward eventual flight mission implementation, and continuing future development plans are discussed.

Dille, Michael↗

Clearance Analysis of Node 3 Aft CBM to the Stowed FGB Solar Array

In early 2011, the ISS Vehicle Configuration Office began considering the relocation of the Permanent Multipurpose Module (PMM) to the aft facing Common Berthing Mechanism (CBM) on Node 3 to open a berthing location for visiting vehicles on the Node 1 nadir CBM. In this position, computer-aided design (CAD) models indicated that the aft end of the PMM would be only a few inches from the stowed Functional Cargo Block (FGB) port solar array. To validate the CAD model clearance analysis, in the late summer of 2011 the Image Science and Analysis Group (ISAG) was asked to determine the true geometric relationship between the on-orbit aft facing Node 3 CBM and the FGB port solar array. The desired measurements could be computed easily by photogrammetric analysis if current imagery of the ISS hardware were obtained. Beginning in the fall of 2011, ISAG used the Dynamic Onboard Ubiquitous Graphics (DOUG) program to design a way to acquire imagery of the aft face of Node 3, the aft end-cone of Node 1, the port side of pressurized mating adapter 1 (PMA1), and the port side of the FGB out to the tip of the port solar array using cameras on the Space Station Remote Manipulator System (SSRMS). This was complicated by the need to thread the SSRMS under the truss, past Node 3 and the Cupola, and into the space between the aft side of Node 3 and the FGB solar array to acquire more than 100 images from multiple positions. To minimize the number of SSRMS movements, the Special Purpose Dexterous Manipulator (SPDM) would be attached to the SSRMS. This would make it possible to park the SPDM in one position and acquire multiple images by changing the viewing orientation of the SPDM body cameras using the pan/tilt units on which the cameras are mounted. Using this implementation concept, ISAG identified four SSRMS/SPDM positions from which all of the needed imagery could be acquired. Based on a photogrammetric simulation, it was estimated that the location of the FGB solar array could be measured within an accuracy of about 1 in. in each axis relative to the ISS Analysis Coordinate System (ISSACS). In October 2011, a proposed image-acquisition plan was drafted by ISAG and released for review. The ISS Robotics flight control team (ROBO) proposed minor changes to SPDM positions 1 and 4 to meet ISS proximity requirements. The updated image acquisition plan and draft chit were presented to and approved by the Systems Working Group (SWG) November 18 and were sent to the Vehicle Configuration Board (VCB) in early December 2011. Working with ROBO on 3 successive days (February 21, 22, and 23), ISAG collected 161 images of the ISS. Approximately 40 images were collected from each of the four different SSRMS/SPDM positions, with each set mapping the region from the Node 3 end cone, across Node 1, along the forward port side portion of the FGB, and out the port side FGB solar arrays. From this imagery, the best 80 images were selected for use in the analysis. The images were radiometrically enhanced to improve color and contrast and loaded into the FotoG analysis software along with the camera parameters and control data, which consisted of the coordinates for 54 handrail attachment bolts on the aft face of Node 3, in the ISSACS coordinate system. The results of this analysis produced the measured coordinates of 116 points distributed across the face of the FGB solar array panels (see figure 3) along with propagated uncertainty estimates in each coordinate axis. These results were sent to the ISS Vehicle Configuration Office, which sent them to the Configuration Analysis Modeling and Mass Properties (CAMMP) team for comparison with the Russian-provided CAD model for the retracted FGB solar arrays. The CAMMP analysis unexpectedly showed that the measured location of the port FGB solar array was up to 41-in. further outboard than the design and was slightly twisted about its rotational axis. The unexpected comparison results produced some initial concern regarding the accuracy of the photogrammetric measurements. To verify the measured results, ISAG personnel conducted a second analysis using just the imagery of the solar arrays in an arbitrary coordinate system defined by the three corner points of the inboard-most panel, with the design distance between points A1 and A10 as the only scale. The new measurements agreed with the original results to within less than 1 in. RMS in each axis, confirming the original solar array measurements. ISAG produced a final report for the ISS Vehicle Configuration Office documenting an apparent anomaly in the retracted configuration of the port FGB solar arrays. A copy of the measurement report was translated and sent to the Russian Space Agency. During a Vehicle Integrated Performance and Resources (VIPeR) teleconference September 24, 2012, the Russians acknowledged receipt of a translated copy of the ISAG report. The Russian representative stated that the head of the solar array design team claimed that the measured configuration was impossible unless the structure was physically broken. The Russians acknowledged that they had no expertise in photogrammetry, so the analysis technique employed was a "black box" to them, and they did not know how to use the ISAG results. They asked for a single image in which the overextension of the port solar array could be obviously seen. On November 10, 2012, during a face-to-face meeting with their Russian counterparts at JSC, ISAG presented nadir-view imagery of the FGB acquired during Space Shuttle rendezvous. Using the known width of the pressurized portion of the FGB as a scale, this analysis clearly showed that the port FGB solar array was extended outboard further than the Russian design for the retracted solar array.

Liddle, Donn↗

Space station orbit selection

Architecture and operations with respect to a permanent manned space facility are being studied, and basic modules of such a space station could be in orbit by 1992. A manned space station in low-earth orbit (LEO) represents a transportation node between the Space Shuttle and orbital transfer vehicles which together comprise a total space transportation system. The present investigation has the objective to examine the trades between performance and operational requirements of a space transportation system which affect space station orbit selection. Factors influencing the trades and selection process include launch vehicle and orbital transfer vehicle (OTV) delivery performance, vehicle launch frequency and windows, station drag characteristics, drag-makeup propulsion, and minimum orbital lifetime requirements.

Talay, T. A.↗

BETA: Behavioral testability analyzer and its application to high-level test generation and synthesis for testability

In this thesis, a behavioral-level testability analysis approach is presented. This approach is based on analyzing the circuit behavioral description (similar to a C program) to estimate its testability by identifying controllable and observable circuit nodes. This information can be used by a test generator to gain better access to internal circuit nodes and to reduce its search space. The results of the testability analyzer can also be used to select test points or partial scan flip-flops in the early design phase. Based on selection criteria, a novel Synthesis for Testability approach call Test Statement Insertion (TSI) is proposed, which modifies the circuit behavioral description directly. Test Statement Insertion can also be used to modify circuit structural description to improve its testability. As a result, Synthesis for Testability methodology can be combined with an existing behavioral synthesis tool to produce more testable circuits.

Chen, Chung-Hsing↗