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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

High resolution upwind schemes for the three-dimensional incompressible Navier-Stokes equations

Based on flux-difference splitting, implicit high resolution schemes are constructed for efficient computations of steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. These schemes use first-order accurate Euler backward-time differencing and second-order central differencing for the viscous shear fluxes. Up to third-order accurate upwind differencing is achieved through a reconstruction of the solution from its cell averages. The reconstruction is accomplished by linear interpolation, where the node stencils are selected such that in regions of smooth solution the flow is highly resolved while spurious oscillations in regions of rapid changes in gradient are still suppressed. Fairly rapid convergence to steady-state solutions is attained with a completely vectorizable hybrid time-marching method. Flows around a sharp-edged delta wing are computed with the maximum accuracy of the upwind-differencing restricted to first-, second-, and third-order, to illustrate the effect of accuracy on the global and on the local vortical flow fields. The results are validated with experimental data.

Hartwich, PETER-M.↗
NASA NTRS2021

Patched Local Lunar Gravity Solutions using GRAIL Data

We present a method to determine local gravity fields for the Moon using Gravity Recovery and Interior Laboratory (GRAIL) data. We express gravity as gridded gravity anomalies on a sphere, and we estimate adjustments to a background global start model expressed in spherical harmonics. We processed GRAIL Ka-band range-rate data with a short-arc approach, using only data over the area of interest. We determine our gravity solutions using neighbor smoothing constraints. We divided the entire Moon into twelve regions and two polar caps, with a resolution of 0.15˚ x 0.15˚ (which is equivalent to degree and order 1199 in spherical harmonics), and determined the optimal smoothing parameter for each area by comparing localized correlations between gravity and topography for each solution set. Our selected areas share nodes with surrounding areas and they are overlapping. To mitigate boundary effects, we patch the solutions together by symmetrically omitting the boundary parts of overlapping solutions. Our new solution has been iterated, and it has improved correlations with topography when compared to a fully iterated global model. Our method requires fewer resources, and can easily handle regionally varying resolution or constraints. The smooth model describes small-scale features clearly, and can be used in local studies of the structure of the lunar crust.

Sander Goossens↗
NASA NTRS2014

Distributed Transforms for Efficient Data Gathering in Sensor Networks

Devices, systems, and techniques for data collecting network such as wireless sensors are disclosed. A described technique includes detecting one or more remote nodes included in the wireless sensor network using a local power level that controls a radio range of the local node. The technique includes transmitting a local outdegree. The local outdegree can be based on a quantity of the one or more remote nodes. The technique includes receiving one or more remote outdegrees from the one or more remote nodes. The technique includes determining a local node type of the local node based on detecting a node type of the one or more remote nodes, using the one or more remote outdegrees, and using the local outdegree. The technique includes adjusting characteristics, including an energy usage characteristic and a data compression characteristic, of the wireless sensor network by selectively modifying the local power level and selectively changing the local node type.

Ortega, Antonio↗
NASA NTRS2013

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Segui, John S.↗
NASA NTRS1990

A survey of decision tree classifier methodology

Decision Tree Classifiers (DTC's) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps, the most important feature of DTC's is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issue. After considering potential advantages of DTC's over single stage classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

Safavian, S. Rasoul↗
NASA NTRS1991

A survey of decision tree classifier methodology

Decision tree classifiers (DTCs) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps the most important feature of DTCs is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.

Safavian, S. R.↗
NASA NTRS1982

Controlling the complexity of menu networks

A common approach to the design of user interfaces for computer systems is the menu selection technique. Each menu frame can be considered a node in an information/action network. The set of nodes and the permissible transitions between them (menu selections) form a directed graph which, in a system of substantial size, can be large and enormously complex. The solution to this problem of unmanageable complexity is the same for menu networks as for programs: the disciplined use of a set of well-defined one-in-one-out structures. This paper defines a set of such structures and offers some guidelines for their use.

Brown, J. W.↗
NASA NTRS1973

Search properties of some sequential decoding algorithms.

Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered, and their properties are compared. It is shown that the stack algorithm introduced by Zigangirov (1966) and by Jelinek (1969) is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different. A modified Fano algorithm is introduced, in which the quantizing parameter is eliminated. It can be inferred from limited simulation results that, at least in some applications, the new algorithm is computationally inferior to the old. However, it is of some theoretical interest since the conventional Fano algorithm may be considered to be a quantized version of it.

Geist, J. M.↗
NASA NTRS1993

Submission of Earth-based ring occultation observations to the NASA planetary data system rings discipline node

This is a technical report summarizing our progress in our program of contributing high quality Earth-based occultation observations to NASA's Planetary Data System (PDS) Rings Node. During our first year of funding, we selected five data sets for eventual inclusion in the PDS Rings Node. These were Uranus occultation observations obtained by the PI and co-workers from the IRTF of event stars U34 (26 April 1986), U1052 (5 May 1988), U65 (21 June 1990), U7872 (25 June 1991), and U7808 (28 June 1991). In our original proposal, we described four tasks: data sets to a common format; documentation of the occultation observations and associated calibrations; calculation of the occultation geometry for each event; establish prototype PDS templates. As discussed in our renewal proposal, submitted 8 June 1993, we have completed the first three tasks, and are working on the fourth. As an indication of our progress to date, we provide information about each of the data sets, their formats, the documentation, and the method used for reconstructing the occultation geometry.

French, Richard G.↗
NASA NTRS1981

A development of grid generation procedure for multicomponent aerodynamic configuration

Two approaches for solving the transonic flow in a multi-block grid were explored. The first approach examines a method involving "zonal decomposition" wherein block boundaries are treated as true boundary surfaces separating interfacing grids. The issues investigated involve techniques for matching solutions at a block boundary. A feasibility study was completed and the results are presented. The second approach involves overlapping grids for differencing across a block boundary near an artificially induced coordinate singularity occurring at a fictitious corner. This approach selects a set of neighboring nodes for the fictitious corner such that the resulting physical cells for a node are topologically the same as any other node on the airfoil surface.

Chen, H. C.↗
NASA NTRS2014

Rate-Compatible Protograph LDPC Codes

Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.

Nguyen, Thuy V.↗
NASA NTRS2009

Modification of the International Space Station USOS to Support Installation and Activation of the Node 3 Element

The International Space Station (ISS) program is nearing an assembly complete configuration with the addition of the final resource node module in early 2010. The Node 3 module will provide critical functionality in support of permanent long duration crews aboard ISS. The new module will permanently house the regenerative Environment Control and Life Support Systems (ECLSS) and will also provide important habitability functions such as waste management and exercise facilities. The ISS program has selected the Port side of the Node 1 "Unity" module as the permanent location for Node 3 which will necessitate architecture changes to provide the required interfaces. The USOS ECLSS fluid and ventilation systems, Internal Thermal Control Systems, and Avionics Systems require significant modifications in order to support Node 3 interfaces at the Node 1 Port location since it was not initially designed for that configuration. This paper outlines the design, development, certification, and implementation of these changes in support of ISS assembly complete.

Link, Dwight E., Jr.↗
NASA NTRS2000

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

Long, Jason D.↗
NASA NTRS2004

Evolution of the Baseline ISS ECLSS Technologies: The Next Logical Steps

The baseline Environmental Control and Life Support Systems which are currently deployed on the International Space Station or planned to be launched in Node 3 are based on technologies selected in the early 1990's. While they are generally meeting or exceeding requirements for supporting the ISS crew, lessons learned from years of on orbit and ground testing, new advances in technology state of the art, and requirements for future manned missions prompt consideration of the next logical step to enhance these systems to increase performance, robustness, reliability, and reduce on-orbit and logistical resource requirements. This paper discusses the current state of the art in ISS ECLSS technologies, and possible areas for enhancement/improvement. Potential utilization of the ISS as a testbed for on-orbit checkout of selected technology improvements is also addressed.

Carrasquillo, Robyn L.↗
NASA NTRS1993

Reversible non-volatile switch based on a TCNQ charge transfer complex

A solid-state synaptic memory matrix (10) having switchable weakly conductive connections at each node (24) whose resistances can be selectably increased or decreased over several orders of magnitude by control signals of opposite polarity, and which will remain stable after the signals are removed, comprises an insulated substrate (16), a set of electrical conductors (14) upon which is deposited a layer (18) of an organic conducting polymer, which changes from an insulator to a conductor upon the transfer of electrons, such as polymerized pyrrole doped with 7,7,8,8-tetracyanoquinodimethane (TCNQ), covered by a second set of conductors (20) laid at right angles to the first.

Nagasubramanian, Ganesan↗
NASA NTRS1993

Conversion of the proprietary ROLM (tm) inter-node link from multimode to singlemode operation

Many NASA centers have selected ROLM(TM) Computerized Branch Exchanges (CBX's) as their standard telephone exchange. The ROLM 9751 CBX Model 70 with ROLM software release 9005 can inter-communicate as a 'multi-node' system over a multimode fiber optic link of 450 to 6,000 meters. Singlemode fiber installations are not supported by ROLM. Two New Mexico-based NASA satellite ground terminals were already connected via a 6 kilometer singlemode fiber optic link. The ROLM Inter-Node Link (INL) was converted from multimode LED transmitters to singlemode laser transmitters and two ROLM CBX systems were interconnected using the modified INL. On activation, the system operated normally and has done so for six months. System testing indicates sufficient margin to drive 45 kilometers of singlemode fiber, an important benefit for widely separated facilities.

Boucher, Larry↗
NASA NTRS2003

Masked Proportional Routing

Distributed approach for determining a path connecting adjacent network nodes, for probabilistically or deterministically transporting an entity, with entity characteristic mu from a source node to a destination node. Each node i is directly connected to an arbitrary number J(mu) of nodes, labeled or numbered j=jl, j2, .... jJ(mu). In a deterministic version, a J(mu)-component baseline proportion vector p(i;mu) is associated with node i. A J(mu)-component applied proportion vector p*(i;mu) is determined from p(i;mu) to preclude an entity visiting a node more than once. Third and fourth J(mu)-component vectors, with components iteratively determined by Target(i;n(mu);mu),=alpha(mu).Target(i;n(mu)-1;mu)j+beta(mu).p* (i;mu)j and Actual(i;n(mu);+a(mu)j. Actual(i;n(mu)-l;mu)j+beta(mu).Sent(i;j'(mu);n(mu)-1;mu)j, are computed, where n(mu) is an entity sequence index and alpha(mu) and beta(mu) are selected numbers. In one embodiment, at each node i, the node j=j'(mu) with the largest vector component difference, Target(i;n(mu);mu)j'- Actual (i;n(mu);mu)j'. is chosen for the next link for entity transport, except in special gap circumstances, where the same link is optionally used for transporting consecutively arriving entities. The network nodes may be computer-controlled routers that switch collections of packets, frames, cells or other information units. Alternatively, the nodes may be waypoints for movement of physical items in a network or for transformation of a physical item. The nodes may be states of an entity undergoing state transitions, where allowed transitions are specified by the network and/or the destination node.

David H Wolpert↗