Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “edge network”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Geodetic measurement of deformation east of the San Andreas Fault in Central California

The shear strain rates in the Diablo Range of California have been calculated, and the slip rate along the Calaveras and Paicines faults in Central California have been estimated, on the basis of triangulation and trilateration data from two geodetic networks located between the western edge of the Great Valley and the San Andreas Fault. The orientation of the principal compressive strain predicted from the azimuth of the major structures in the region is N 25 deg E, leading to an average shear strain value that corresponds to a relative shortening rate of 4.5 + or - 2.4 mm/yr. It is inferred that the measured strain is due to compression across the fold of this area. The hypothesized uniform, fault-normal compression within the Coast Ranges is not supported by these results.

Sauber, Jeanne↗
NASA NTRS2013

Surface Hold Advisor Using Critical Sections

The Surface Hold Advisor Using Critical Sections is a system and method for providing hold advisories to surface controllers to prevent gridlock and resolve crossing and merging conflicts among vehicles traversing a vertex-edge graph representing a surface traffic network on an airport surface. The Advisor performs pair-wise comparisons of current position and projected path of each vehicle with other surface vehicles to detect conflicts, determine critical sections, and provide hold advisories to traffic controllers recommending vehicles stop at entry points to protected zones around identified critical sections. A critical section defines a segment of the vertex-edge graph where vehicles are in crossing or merging or opposite direction gridlock contention. The Advisor detects critical sections without reference to scheduled, projected or required times along assigned vehicle paths, and generates hold advisories to prevent conflicts without requiring network path direction-of-movement rules and without requiring rerouting, rescheduling or other network optimization solutions.

Law, Caleb Hoi Kei↗
NASA NTRS2002

Computing the Envelope for Stepwise-Constant Resource Allocations

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms.

Muscettola, Nicola↗
NASA NTRS1988

Using AGNESS (A Generalized Network-based Expert System Shell) for matching images

The image correspondence problem is considered the most difficult step in both stereo and motion analysis. Stereo vision is useful in determining the 3-D positions of points on visible surface in a scene. Motion analysis is useful in determining the spatial and temporal relationships of objects in an environment. Besides stereo and motion analysis, there is the image correspondence problem. Most of this work is based on point or local area properties of the observed gray level values in 2-D images. A global and general approach to this problem is described by using a knowledge-based system. The knowledge it uses consists of both physical properties and spatial relationships of the edges and regions extracted from the given images. The physical component depends on features of the edge or region) in isolation. The spatial component involves the set of edges and regions adjacent to a given edge (or region) of the first image and the set of edges and regions adjacent to each potentially matching edge (or region) of the second image; thus the spatial context of each edge or region is considered. A computational network is used to represent this knowledge, it allows the computation of the likelihood of matching two edges or regions with logical and heuristic operators. An expert system shell called AGNESS (A Generalized Network-based Expert System Shell) is used to build a prototype system.

Pong, Ting-Chuen↗
NASA NTRS1989

The effect of newly erupting flux on the polar coronal holes

Chromospheric network enhancements that occur along the edges of the polar coronal holes immediately after sunspot minimum are studied. It is shown that these enhancements accompany the eruption of the first large high-latitude bipolar magnetic regions of the new sunspot cycle, and that these eruptions must have encountered relatively concentrated polar fields whose strengths decrease rapidly equatorward of about 60 deg latitude. The helium observations are compared with current-free magnetic field calculations, and it is found that the enhanced helium network occurs where relatively strong fields at high latitude become connected to newly erupted bipolar magnetic regions.

Sheeley, N. R.↗
NASA NTRS1995

SSBRP User Operations Facility (UOF) Overview and Development Strategy

This paper will present the Space Station Biological Research Project (SSBRP) User Operations Facility (UOF) architecture and development strategy. A major element of the UOF at NASA Ames Research Center, the Communication and Data System (CDS) will be the primary focus of the discussions. CDS operational, telescience, security, and development objectives will be discussed along with CDS implementation strategy. The implementation strategy discussions will include: Object Oriented Analysis & Design, System & Software Prototyping, and Technology Utilization. A CDS design overview that includes: CDS Context Diagram, CDS Architecture, Object Models, Use Cases, and User Interfaces will also be presented. CDS development brings together "cutting edge" technologies and techniques such as: object oriented development, network security, multimedia networking, web-based data distribution, JAVA, and graphical user interfaces. Use of these "cutting edge" technologies and techniques translates directly to lower development and operations costs.

Picinich, Lou↗
NASA NTRS2001

Computing the Envelope for Stepwise Constant Resource Allocations

Estimating tight resource level is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with noises equal to the events and edges equal to the necessary predecessor links between events. The incremental solution of a staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. The staged algorithm has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible for use in the inner loop of search-based scheduling algorithms.

Muscettola, Nicola↗
NASA NTRS2007

Photodiode Preamplifier for Laser Ranging With Weak Signals

An improved preamplifier circuit has been designed for processing the output of an avalanche photodiode (APD) that is used in a high-resolution laser ranging system to detect laser pulses returning from a target. The improved circuit stands in contrast to prior such circuits in which the APD output current pulses are made to pass, variously, through wide-band or narrow-band load networks before preamplification. A major disadvantage of the prior wide-band load networks is that they are highly susceptible to noise, which degrades timing resolution. A major disadvantage of the prior narrow-band load networks is that they make it difficult to sample the amplitudes of the narrow laser pulses ordinarily used in ranging. In the improved circuit, a load resistor is connected to the APD output and its value is chosen so that the time constant defined by this resistance and the APD capacitance is large, relative to the duration of a laser pulse. The APD capacitance becomes initially charged by the pulse of current generated by a return laser pulse, so that the rise time of the load-network output is comparable to the duration of the return pulse. Thus, the load-network output is characterized by a fast-rising leading edge, which is necessary for accurate pulse timing. On the other hand, the resistance-capacitance combination constitutes a lowpass filter, which helps to suppress noise. The long time constant causes the load network output pulse to have a long shallow-sloping trailing edge, which makes it easy to sample the amplitude of the return pulse. The output of the load network is fed to a low-noise, wide-band amplifier. The amplifier must be a wide-band one in order to preserve the sharp pulse rise for timing. The suppression of noise and the use of a low-noise amplifier enable the ranging system to detect relatively weak return pulses.

Abramovici, Alexander↗
NASA NTRS1974

The two-dimensional tunnel structures of K3Sb5O14 and K2Sb4O11

The structures of K3Sb5O14 and K2Sb4O11 have been solved by the single-crystal X-ray direct method and the heavy-atom method, respectively. The structure of K3Sb5O14 is orthorhombic, with space group Pbam and cell parameters a = 24.247 (4), b = 7.157 (2), c = 7.334 (2) A, Z = 4. The structure of K2Sb4O11 is monoclinic, with space group C2/m and cell parameters a = 19.473 (4), b = 7.542 (1), c = 7.198 (1) A, beta = 94.82 (2) deg, Z = 4. A full-matrix least-squares refinement gave R = 0.072 and R = 0.067, respectively. In both structures, oxygen atoms form an octahedron around each Sb atom and an irregular polyhedron around each K atom. By sharing corners and edges, the octahedra form a skeleton network having intersecting b-axis and c-axis tunnels. The K(+) ions, which have more than ten oxygen near neighbors, are located in these tunnels. Evidence for K(+)-ion transport within and between tunnels comes from ion exchange of the alkali ions in molten salts and anisotropic temperature factors that are anomalously large in the direction of the tunnels.

Hong, H. Y.-P.↗
NASA NTRS2016

The Mathematics of Dispatchability Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, the dispatchability property has both theoretical and practical interest. One thing that hampers further work in this area is the underdeveloped theory. The existing definitions are expressed in terms of algorithms, and are less suitable for mathematical proofs. In this paper, we develop a new formal theory of dispatchability in terms of execution sequences. We exploit this to prove a characterization of dispatchability involving the structural properties of the STN graph. This facilitates the potential application of the theory to uncertainty reasoning.

control↗
NASA NTRS2016

The Mathematics of Dispatchability, Revisited

Dispatchability is an important property for the efficient execution of temporal plans where the temporal constraints are represented as a Simple Temporal Network (STN). It has been shown that every STN may be reformulated as a dispatchable STN, and dispatchability ensures that the temporal constraints need only be satisfied locally during execution. Recently, it has also been shown that Simple Temporal Networks with Uncertainty, augmented with wait edges, are Dynamically Controllable provided every projection is dispatchable. Thus, dispatchability has considerable theoretical as well as practical significance. One thing that hampers further work in this area is the underdeveloped theory. Moreover, the existing foundation is inadequate in certain respects. In this paper, we develop a new mathematical theory of dispatchability and its relationship to execution. We also provide several characterizations of dispatchability, including characterizations in terms of the structural properties of the STN graph. This facilitates the potential application of the theory to other areas.

mathematical models↗
NASA NTRS1989

Concurrent hypercube system with improved message passing

A network of microprocessors, or nodes, are interconnected in an n-dimensional cube having bidirectional communication links along the edges of the n-dimensional cube. Each node's processor network includes an I/O subprocessor dedicated to controlling communication of message packets along a bidirectional communication link with each end thereof terminating at an I/O controlled transceiver. Transmit data lines are directly connected from a local FIFO through each node's communication link transceiver. Status and control signals from the neighboring nodes are delivered over supervisory lines to inform the local node that the neighbor node's FIFO is empty and the bidirectional link between the two nodes is idle for data communication. A clocking line between neighbors, clocks a message into an empty FIFO at a neighbor's node and vica versa. Either neighbor may acquire control over the bidirectional communication link at any time, and thus each node has circuitry for checking whether or not the communication link is busy or idle, and whether or not the receive FIFO is empty. Likewise, each node can empty its own FIFO and in turn deliver a status signal to a neighboring node indicating that the local FIFO is empty. The system includes features of automatic message rerouting, block message transfer and automatic parity checking and generation.

Peterson, John C.↗
NASA NTRS1997

System and Method for Modeling the Flow Performance Features of an Object

The method and apparatus includes a neural network for generating a model of an object in a wind tunnel from performance data on the object. The network is trained from test input signals (e.g., leading edge flap position, trailing edge flap position, angle of attack, and other geometric configurations, and power settings) and test output signals (e.g., lift, drag, pitching moment, or other performance features). In one embodiment, the neural network training method employs a modified Levenberg-Marquardt optimization technique. The model can be generated 'real time' as wind tunnel testing proceeds. Once trained, the model is used to estimate performance features associated with the aircraft given geometric configuration and/or power setting input. The invention can also be applied in other similar static flow modeling applications in aerodynamics, hydrodynamics, fluid dynamics, and other such disciplines. For example, the static testing of cars, sails, and foils, propellers, keels, rudders, turbines, fins, and the like, in a wind tunnel, water trough, or other flowing medium.

Jorgensen, Charles↗
NASA NTRS2004

Image Analysis via Fuzzy-Reasoning Approach: Prototype Applications at NASA

A set of imaging techniques based on Fuzzy Reasoning (FR) approach was built for NASA at Kennedy Space Center (KSC) to perform complex real-time visual-related safety prototype tasks, such as detection and tracking of moving Foreign Objects Debris (FOD) during the NASA Space Shuttle liftoff and visual anomaly detection on slidewires used in the emergency egress system for Space Shuttle at the launch pad. The system has also proved its prospective in enhancing X-ray images used to screen hard-covered items leading to a better visualization. The system capability was used as well during the imaging analysis of the Space Shuttle Columbia accident. These FR-based imaging techniques include novel proprietary adaptive image segmentation, image edge extraction, and image enhancement. Probabilistic Neural Network (PNN) scheme available from NeuroShell(TM) Classifier and optimized via Genetic Algorithm (GA) was also used along with this set of novel imaging techniques to add powerful learning and image classification capabilities. Prototype applications built using these techniques have received NASA Space Awards, including a Board Action Award, and are currently being filed for patents by NASA; they are being offered for commercialization through the Research Triangle Institute (RTI), an internationally recognized corporation in scientific research and technology development. Companies from different fields, including security, medical, text digitalization, and aerospace, are currently in the process of licensing these technologies from NASA.

Dominguez, Jesus A.↗
NASA NTRSDate not supplied

SPIKE-Dx : A Low-Power High-Throughput Fault Diagnostics Tool using Spiking Neural Networks for Constrained Systems

Diagnostic systems are important for many aerospace systems, which are severely limited in available power, like cubesats or UAVs. Therefore, traditional diagnostics systems cannot be used due to their substantial footprint and constraints. In this paper, we present our very low power diagnostic tool SPIKE-DX to monitor critical systems with constrained computational and energy resources. This is made possible through spiking neural networks (SNNs), which are executable within optimized simulation environments and further implemented on on cutting-edge neuromorphic hardware. Based upon FMEA (Failure Mode and Effect Analysis) framework, Diagnostic Bayesian Networks (DBNs) can be constructed that provide powerful means for diagnostic reasoning. In this paper, we describe such DBNs and a method to automatically translate the DBN into highly structured networks of spiking neurons for execution in SPIKE-DX.

Spiking Neural Networks↗
NASA NTRSDate not supplied

Contact Multigraph Routing: Overview and Implementation

In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list of contacts, periods during which two DTN nodes may communicate, is used to construct a contact graph, in which contacts are vertices. A version of Dijkstra’s algorithm can then be used to find paths through this model of the timevarying network. However, since contact graphs may be large compared to the network, potentially growing with the square of the number of network nodes and linearly with the time interval represented, the resulting algorithm does not scale well with the size of the network or time. Any improvement to the routing algorithm will bring significant returns to scale. In a previous paper, we briefly introduced an alternative to the contact graph model for routing. This alternative model is based on a multigraph (a graph in which there may be multiple edges between a pair of vertices) where vertices represent network nodes instead of contacts. A version of Dijkstra’s algorithm in these multigraph models reduces the time needed to perform the same routing computations done in the existing CGR algorithm. Moreover, a modified version of Yen’s algorithm for multigraphs is included. Our variation of CGR, which we call Contact Multigraph Routing (CMR), provides an in-line replacement for the previously used pathfinding algorithms. This paper describes an implementation created based on the CMR approach, and experimental comparisons to traditional CGR are given. In addition, we explore some additional modifications to the routing pipeline traditionally assumed in CGR. These modifications range from the theoretical to the practical in terms of size and scope. We step forward our understanding of sheaftheoretic networking and describe how to model the routing pipeline using sheaves. We detail some enhanced route selection criteria that addresses some of the added complexity of DTNbased systems. We also include a future works section on future improvements and implementations that would be of service to the broader DTN community.

contact graph routing↗
NASA NTRS2024

Microgravity Effects on Nonequilibrium Melt Processing of Neodymium Titanate: Thermophysical Properties, Atomic Structure, Glass Formation and Crystallization

The relationships between materials processing and structure can vary between terrestrial and reduced gravity environments. As one case study, we compare the nonequilibrium melt processing of a rare-earth titanate, nominally 83TiO 2 -17Nd 2 O 3 , and the structure of its glassy and crystalline products. Density and thermal expansion for the liquid, supercooled liquid, and glass are measured over 300–1850 °C using the Electrostatic Levitation Furnace (ELF) in microgravity, and two replicate density measurements were reproducible to within 0.4%. Cooling rates in ELF are 40–110 °C s −1 lower than those in a terrestrial aerodynamic levitator due to the absence of forced convection. X-ray/neutron total scattering and Raman spectroscopy indicate that glasses processed on Earth and in microgravity exhibit similar atomic structures, with only subtle differences that are consistent with compositional variations of ~2 mol. % Nd 2 O 3 . The glass atomic network contains a mixture of corner- and edge-sharing Ti-O polyhedra, and the fraction of edge-sharing arrangements decreases with increasing Nd 2 O 3 content. X-ray tomography and electron microscopy of crystalline products reveal substantial differences in microstructure, grain size, and crystalline phases, which arise from differences in the melt processes.

thermophysical properties↗
NASA NTRS2008

Efficient Probabilistic Diagnostics for Electrical Power Systems

We consider in this work the probabilistic approach to model-based diagnosis when applied to electrical power systems (EPSs). Our probabilistic approach is formally well-founded, as it based on Bayesian networks and arithmetic circuits. We investigate the diagnostic task known as fault isolation, and pay special attention to meeting two of the main challenges . model development and real-time reasoning . often associated with real-world application of model-based diagnosis technologies. To address the challenge of model development, we develop a systematic approach to representing electrical power systems as Bayesian networks, supported by an easy-to-use speci.cation language. To address the real-time reasoning challenge, we compile Bayesian networks into arithmetic circuits. Arithmetic circuit evaluation supports real-time diagnosis by being predictable and fast. In essence, we introduce a high-level EPS speci.cation language from which Bayesian networks that can diagnose multiple simultaneous failures are auto-generated, and we illustrate the feasibility of using arithmetic circuits, compiled from Bayesian networks, for real-time diagnosis on real-world EPSs of interest to NASA. The experimental system is a real-world EPS, namely the Advanced Diagnostic and Prognostic Testbed (ADAPT) located at the NASA Ames Research Center. In experiments with the ADAPT Bayesian network, which currently contains 503 discrete nodes and 579 edges, we .nd high diagnostic accuracy in scenarios where one to three faults, both in components and sensors, were inserted. The time taken to compute the most probable explanation using arithmetic circuits has a small mean of 0.2625 milliseconds and standard deviation of 0.2028 milliseconds. In experiments with data from ADAPT we also show that arithmetic circuit evaluation substantially outperforms joint tree propagation and variable elimination, two alternative algorithms for diagnosis using Bayesian network inference.

Mengshoel, Ole J.↗