Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Complex Network Data”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Government-to-government cooperation in space station development

A memoranda of understanding was recently signed between the United States (NASA) and three international Space Station partners - Canada, European Space Agency (ESA), and Japan. The international partners are performing parallel Phase B preliminary design studies, concurrent with the U.S., on their proposed elements/systems for possible integration and operation with the U.S. Space Station System complex. During the 21-month Space Station Phase B study, a large amount of technical interface data will have to be transferred between the U.S. and the international partners. Scheduled bilateral technical coordination meetings will also be held. The coordination and large number of interfaces required to integrate the international requirements into the Space Station require a clean interface management organizational structure and operation procedures to accomplish the integration task. The international coordination management organizational structure, management tools, and communications network are discussed including the proposed international elements/systems being studied by the international partners.

Nassiff, S. H.↗
NASA NTRS2009

Development and Evaluation of Sensor Concepts for Ageless Aerospace Vehicles: Report 5 - Phase 2 Implementation of the Concept Demonstrator

This report describes the second phase of the implementation of the Concept Demonstrator experimental test-bed system containing sensors and processing hardware distributed throughout the structure, which uses multi-agent algorithms to characterize impacts and determine a suitable response to these impacts. This report expands and adds to the report of the first phase implementation. The current status of the system hardware is that all 192 physical cells (32 on each of the 6 hexagonal prism faces) have been constructed, although only four of these presently contain data-acquisition sub-modules to allow them to acquire sensor data. Impact detection.. location and severity have been successfully demonstrated. The software modules for simulating cells and controlling the test-bed are fully operational. although additional functionality will be added over time. The visualization workstation displays additional diagnostic information about the array of cells (both real and simulated) and additional damage information. Local agent algorithms have been developed that demonstrate emergent behavior of the complex multi-agent system, through the formation of impact damage boundaries and impact networks. The system has been shown to operate well for multiple impacts. and to demonstrate robust reconfiguration in the presence of damage to numbers of cells.

Batten, Adam↗
NASA NTRS2004

Fast Query-Optimized Kernel-Machine Classification

A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered statistics about how misleading the output of the k-NN model can be, relative to the outputs of the exact KM for a representative set of examples, for each possible k from 1 to the total number of SVs. From these statistics, there are derived upper and lower thresholds for each step k. These thresholds identify output levels for which the particular variant of the k-NN model already leans so strongly positively or negatively that a reversal in sign is unlikely, given the weaker SV neighbors still remaining. At query time, the partial output of each query is incrementally updated, stopping as soon as it exceeds the predetermined statistical thresholds of the current step. For an easy query, stopping can occur as early as step k = 1. For more difficult queries, stopping might not occur until nearly all SVs are touched. A key empirical observation is that this approach can tolerate very approximate nearest-neighbor orderings. In experiments, SVs and queries were projected to a subspace comprising the top few principal- component dimensions and neighbor orderings were computed in that subspace. This approach ensured that the overhead of the nearest-neighbor computations was insignificant, relative to that of the exact KM computation.

Mazzoni, Dominic↗
NASA NTRS1981

Use of Faraday-rotation data from beacon satellites to determine ionospheric corrections for interplanetary spacecraft navigation

Faraday-rotation data from the linearly polarized 137-MHz beacons of the ATS-1, SIRIO, and Kiku-2 geosynchronous satellites are used to determine the ionospheric corrections to the range and Doppler data for interplanetary spacecraft navigation. The JPL operates the Deep Space Network of tracking stations for NASA; these stations monitor Faraday rotation with dual orthogonal, linearly polarized antennas, Teledyne polarization tracking receivers, analog-to-digital converter/scanners, and other support equipment. Computer software examines the Faraday data, resolves the pi ambiguities, constructs a continuous Faraday-rotation profile and converts the profile to columnar zenith total electron content at the ionospheric reference point; a second program computes the line-of-sight ionospheric correction for each pass of the spacecraft over each tracking complex. Line-of-sight ionospheric electron content using mapped Faraday-rotation data is compared with that using dispersive Doppler data from the Voyager spacecraft; a difference of about 0.4 meters, or 5 x 10 to the 16th electrons/sq m is obtained. The technique of determining the electron content of interplanetary plasma by subtraction of the ionospheric contribution is demonstrated on the plasma torus surrounding the orbit of Io.

Royden, H. N.↗
NASA NTRS1988

Ada software productivity prototypes: A case study

A case study of the impact of Ada on a Command and Control project completed at the Jet Propulsion Laboratory (JPL) is given. The data for this study was collected as part of a general survey of software costs and productivity at JPL and other NASA sites. The task analyzed is a successful example of the use of rapid prototyping as applied to command and control for the U.S. Air Force and provides the U.S. Air Force Military Airlift Command with the ability to track aircraft, air crews and payloads worldwide. The task consists of a replicated database at several globally distributed sites. The local databases at each site can be updated within seconds after changes are entered at any one site. The system must be able to handle up to 400,000 activities per day. There are currently seven sites, each with a local area network of computers and a variety of user displays; the local area networks are tied together into a single wide area network. Using data obtained for eight modules, totaling approximately 500,000 source lines of code, researchers analyze the differences in productivities between subtasks. Factors considered are percentage of Ada used in coding, years of programmer experience, and the use of Ada tools and modern programming practices. The principle findings are the following. Productivity is very sensitive to programmer experience. The use of Ada software tools and the use of modern programming practices are important; without such use Ada is just a large complex language which can cause productivity to decrease. The impact of Ada on development effort phases is consistent with earlier reports at the project level but not at the module level.

Hihn, Jairus M.↗
NASA NTRS2012

Future Expansion of the Lightning Surveillance System at the Kennedy Space Center and the Cape Canaveral Air Force Station, Florida, USA

The NASA Kennedy Space Center (KSC) and the Air Force Eastern Range (ER) use data from two cloud-to-ground (CG) lightning detection networks, the Cloud-to-Ground Lightning Surveillance System (CGLSS) and the U.S. National Lightning Detection Network (NLDN), and a volumetric mapping array, the lightning detection and ranging II (LDAR II) system: These systems are used to monitor and characterize lightning that is potentially hazardous to launch or ground operations and hardware. These systems are not perfect and both have documented missed lightning events when compared to the existing lightning surveillance system at Launch Complex 39B (LC39B). Because of this finding it is NASA's plan to install a lightning surveillance system around each of the active launch pads sharing site locations and triggering capabilities when possible. This paper shows how the existing lightning surveillance system at LC39B has performed in 2011 as well as the plan for the expansion around all active pads.

Mata, C. T.↗
NASA NTRS2015

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Majumdar, A. K.↗
NASA NTRS2016

Comparison of Atmospheric Delay Statistics from Deep Space Network Arrays and Nearby Test Interferometers

Several techniques have been explored and demonstrated that allow for greater data return on space-to-ground links. Among these techniques, arraying several smaller diameter dish antennas together is one method used in several arenas. These arrays can achieve larger effective area and gain than are available from a single larger antenna. This technique is routinely used by the NASA Deep Space Network (DSN) at 8.4 GHz where the incoming signals are much weaker than those experienced by the near-Earth satellite community. When considering arraying at much higher frequencies such as 32 GHz deep-space Ka-band, the phase alignment of the individual antenna signals is significantly disrupted by atmospheric turbulence. Since 2012, several downlink array demonstrations have been conducted using 32 GHz carrier signals emitted by the deep space probes Cassini and Kepler. Site test interferometers (STIs) that receive signals from geostationary satellites have been deployed at all three DSN tracking complexes for long-term monitoring of atmospheric delay fluctuations. In a previous DSN array demonstration study involving the Cassini spacecraft, it was shown that statistics of the adjusted STI phase fluctuations matched the statistics of concurrent array demonstration phase fluctuations. These adjustments accounted for differences in antenna separation, elevation angle and spacecraft frequencies. The STI antenna separations were about 200 m and the DSN antenna separations were about 300 m. These adjustments made use of the thick-layer turbulence model that was applicable to the Goldstone desert climate during the summer months for which the data were acquired. In this paper, we report on the results of additional array demonstrations involving the Kepler spacecraft and compare the adjusted STI phase fluctuations with those seen by a nearby two-element array of 34 m diameter antennas tracking Kepler’s 32 GHz signal at the Goldstone, California and Madrid, Spain DSN sites. We also discuss results from a demonstration using an array over a longer 12.5 km baseline. The Cassini and Kepler array demonstrations were found to validate the long term statistics acquired from several years of STI data as well as the models used to adjust the statistics for the conditions of an array. These statistics represent reliable estimates of the phase fluctuations that would be seen by an array tracking a deep space signal after applying appropriate adjustments for a given array configuration, elevation angle profile and observing frequency.

Morabito, David D.↗
NASA NTRS1990

Random access to mobile networks with advanced error correction

A random access scheme for unreliable data channels is investigated in conjunction with an adaptive Hybrid-II Automatic Repeat Request (ARQ) scheme using Rate Compatible Punctured Codes (RCPC) Forward Error Correction (FEC). A simple scheme with fixed frame length and equal slot sizes is chosen and reservation is implicit by the first packet transmitted randomly in a free slot, similar to Reservation Aloha. This allows the further transmission of redundancy if the last decoding attempt failed. Results show that a high channel utilization and superior throughput can be achieved with this scheme that shows a quite low implementation complexity. For the example of an interleaved Rayleigh channel and soft decision utilization and mean delay are calculated. A utilization of 40 percent may be achieved for a frame with the number of slots being equal to half the station number under high traffic load. The effects of feedback channel errors and some countermeasures are discussed.

Dippold, Michael↗
NASA NTRS1993

Security aspects of space operations data

This paper deals with data security. It identifies security threats to European Space Agency's (ESA) In Orbit Infrastructure Ground Segment (IOI GS) and proposes a method of dealing with its complex data structures from the security point of view. It is part of the 'Analysis of Failure Modes, Effects Hazards and Risks of the IOI GS for Operations, including Backup Facilities and Functions' carried out on behalf of the European Space Operations Center (ESOC). The security part of this analysis has been prepared with the following aspects in mind: ESA's large decentralized ground facilities for operations, the multiple organizations/users involved in the operations and the developments of ground data systems, and the large heterogeneous network structure enabling access to (sensitive) data which does involve crossing organizational boundaries. An IOI GS data objects classification is introduced to determine the extent of the necessary protection mechanisms. The proposal of security countermeasures is oriented towards the European 'Information Technology Security Evaluation Criteria (ITSEC)' whose hierarchically organized requirements can be directly mapped to the security sensitivity classification.

Schmitz, Stefan↗
NASA NTRS1999

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗
NASA NTRS2000

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗
NASA NTRS2018

A 3D Citizen Science Video Game for NeMO-Net, the NASA Neural Multi-Modal Observation and Training Network for Global Coral Reef Assessment

NeMO-Net, the NASA neural multi-modal observation and training network for global coral reef assessment, is an open-source deep convolutional neural network aimed at accurately assessing the present and past dynamics of coral reef ecosystems through determination of percent living cover and morphology. We present here the active learning component of the project, which consists of an interactive video game prototype for tablet and mobile devices where players are able to intuitively label morphology classifications over mm-scale 3D coral reef imagery. Active learning applications present a novel methodology for engaging the public while efficiently providing large-scale training and test data for increasingly complex and data-intensive machine learning algorithms. NeMO-Net trains players on domain-specific knowledge through interactive tutorials and periodically checks players' input against pre-classified coral imagery to gauge their accuracy and utilize in-game mechanics to provide personalized classification training. Players can rate the classifications of other players, unlock rewards and join a global community as they explore and classify coral reefs and other shallow marine environments.

Citizen Science↗
NASA NTRS2016

Achieving Fast Operational Intelligence in NASA's Deep Space Network Through Complex Event Processing

NASA’s Deep Space Network (DSN) is a complex, global project, in which the expertise of human operators remain crucial for its successful operation. To find ways to save costs in operations and to improve its services, a number of modernization efforts are underway in the DSN. One such effort is a research and technology development task at the Jet Propulsion Laboratory that is investigating the use of complex event processing (CEP) for intelligent assessment of situations, trend analysis, and advanced automation. The technology leverages the significant business intelligence (BI) and data science advancements made in the enterprise industries over the last several years. The open source big data processing engine Apache SparkTM and the high-throughput, distributed messaging system Apache Kafka form the core of the DSN Complex Event Processing (DCEP) framework. This paper discusses the system engineering perspective of why achieving efficient, lower-cost operations in the DSN is a challenging problem, how the DCEP system handles the use cases that help realize intelligent operations, and how this solution fits into the overall model of the planned DSN Follow-the- Sun Operations (FtSO).

Choi, Joshua S.↗
NASA NTRSDate not supplied

Using AI/ML to Address Satellite Cloud Remote Sensing Challenges

Various AI/ML tools, employed within the Clouds and the Earth's Radiant Energy System (CERES) Satellite Cloud and Radiation Property retrieval System (SatCORPS) project, are being used to mitigate satellite radiance artifacts and thereby yield more accurate cloud and radiation data products. Neural network and K-nearest neighbor approaches have been developed that enable us to better address common passive satellite remote sensing challenges, such as corrupted imagery, day/night cloud property discontinuities, solar terminator artifacts, inadequate knowledge of the land surface emission temperature (i.e., skin temperature), and poor assumptions about vertical cloud structure, that have otherwise proven difficult to solve using more conventional methods. Fixing these problems promotes a more consistent Earth radiation budget record. These efforts demonstrate effective use of AI/ML architecture to exploit complex, multivariate predictor relationships and produce usable output at satellite spatial and temporal resolutions that would otherwise be ignored or have large biases.

Benjamin Scarino↗
NASA NTRS2004

Fossil Signatures Using Elemental Abundance Distributions and Bayesian Probabilistic Classification

Elemental abundances (C6, N7, O8, Na11, Mg12, Al3, P15, S16, Cl17, K19, Ca20, Ti22, Mn25, Fe26, and Ni28) were obtained for a set of terrestrial fossils and the rock matrix surrounding them. Principal Component Analysis extracted five factors accounting for the 92.5% of the data variance, i.e. information content, of the elemental abundance data. Hierarchical Cluster Analysis provided unsupervised sample classification distinguishing fossil from matrix samples on the basis of either raw abundances or PCA input that agreed strongly with visual classification. A stochastic, non-linear Artificial Neural Network produced a Bayesian probability of correct sample classification. The results provide a quantitative probabilistic methodology for discriminating terrestrial fossils from the surrounding rock matrix using chemical information. To demonstrate the applicability of these techniques to the assessment of meteoritic samples or in situ extraterrestrial exploration, we present preliminary data on samples of the Orgueil meteorite. In both systems an elemental signature produces target classification decisions remarkably consistent with morphological classification by a human expert using only structural (visual) information. We discuss the possibility of implementing a complexity analysis metric capable of automating certain image analysis and pattern recognition abilities of the human eye using low magnification optical microscopy images and discuss the extension of this technique across multiple scales.

Hoover, Richard B.↗
NASA NTRS2021

Planetary Boundary Layer Height Estimates From ICESat-2 and CATS Backscatter Measurements

The lowest layer of the atmosphere in which all human activity occurs is called the Planetary Boundary Layer (PBL). All physical interactions with the surface, such as heat and moisture transport, pollution dispersion and transport happen in this relatively shallow layer. The ability to understand and model the complex interactions that occur in the PBL is very important to air quality, weather prediction and climate modeling. A fundamental and physically important property of the PBL is its thickness or height. This work presents two methods to obtain global PBL height using satellite lidar data from the Ice, Cloud and land Elevation Satellite-2 (ICESat-2) and the Cloud-Aerosol Transport System (CATS). The first method is a straightforward backscatter threshold technique and the second is a machine learning approach known as a Convolutional Neural Network. The PBL height retrievals from the two methods are compared with each other and with PBL height from the NASA GEOS MERRA-2 reanalysis. The lidar-retrieved PBL heights have a high degree of spatial correlation with the model heights but are generally higher over ocean (∼400 m) and over northern hemisphere high latitude regions (∼1,000 m). Over mid-latitude and tropical land areas, the satellite estimated PBL heights agree well with model mid-day estimates. This work demonstrates the feasibility of using satellite lidar backscatter measurements to obtain global PBL height estimates, as well as determining seasonal and regional variability of PBL height.

Stephen P Palm↗
NASA NTRS2005

Going End to End to Deliver High-Speed Data

By the end of the 1990s, the optical fiber "backbone" of the telecommunication and data-communication networks had evolved from megabits-per-second transmission rates to gigabits-per-second transmission rates. Despite this boom in bandwidth, however, users at the end nodes were still not being reached on a consistent basis. (An end node is any device that does not behave like a router or a managed hub or switch. Examples of end node objects are computers, printers, serial interface processor phones, and unmanaged hubs and switches.) The primary reason that prevents bandwidth from reaching the end nodes is the complex local network topology that exists between the optical backbone and the end nodes. This complex network topology consists of several layers of routing and switch equipment which introduce potential congestion points and network latency. By breaking down the complex network topology, a true optical connection can be achieved. Access Optical Networks, Inc., is making this connection a reality with guidance from NASA s nondestructive evaluation experts.

Source record↗