Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,081 records · Page 60
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Using Direct Numerical Simulation of Pore-Level Events to Improve Pore-Network Models for Prediction of Residual Trapping of CO2

Direct numerical simulation and pore-network modeling are common approaches to study the physics of two-phase flow through natural rocks. For assessment of the long-term performance of geological sequestration of CO 2 , it is important to model the full drainage-imbibition cycle to provide an accurate estimate of the trapped CO 2 . While direct numerical simulation using pore geometry from micro-CT rock images accurately models two-phase flow physics, it is computationally prohibitive for large rock volumes. On the other hand, pore-network modeling on networks extracted from micro-CT rock images is computationally efficient but utilizes simplified physics in idealized geometric pore elements. This study uses the lattice-Boltzmann method for direct numerical simulation of CO 2 -brine flow in idealized pore elements to develop a new set of pore-level flow models for the pore-body filling and snap-off events in pore-network modeling of imbibition. Lattice-Boltzmann simulations are conducted on typical idealized pore-network configurations, and the interface evolution and local capillary pressure are evaluated to develop modified equations of local threshold capillary pressure of pore elements as a function of shape factor and other geometrical parameters. The modified equations are then incorporated into a quasi-static pore-network flow solver. The modified model is applied on extracted pore-network of sandstone samples, and saturation of residual trapped CO 2 is computed for a drainage-imbibition cycle. The modified model yields different statistics of pore-level events compared with the original model; in particular, the occurrence of snap-off in pore-throats is reduced resulting in a more frontal displacement pattern along the main injection direction. Compared to the original model, the modified model is in closer agreement with the residual trapped CO 2 obtained from core flow experiments and direct numerical simulation.

Kohanpur, Amir H.↗
DOE OSTI2022

Microbial Community Structure and Ecological Networks during Simulation of Diatom Sinking

Microbial-mediated utilization of particulate organic matter (POM) during its downward transport from the surface to the deep ocean constitutes a critical component of the global ocean carbon cycle. However, it remains unclear as to how high hydrostatic pressure (HHP) and low temperature (LT) with the sinking particles affects community structure and network interactions of the particle-attached microorganisms (PAM) and those free-living microorganisms (FLM) in the surrounding water. In this study, we investigated microbial succession and network interactions in experiments simulating POM sinking in the ocean. Diatom-derived 13C- and 12C-labeled POM were used to incubate surface water microbial communities from the East China Sea (ECS) under pressure (temperature) of 0.1 (25 °C), 20 (4 °C), and 40 (4 °C) MPa (megapascal). Our results show that the diversity and species richness of the PAM and FLM communities decreased significantly with HHP and LT. Microbial community analysis indicated an increase in the relative abundance of Bacteroidetes at high pressure (40 MPa), mostly at the expense of Gammaproteobacteria, Alphaproteobacteria, and Gracilibacteria at atmospheric pressure. Hydrostatic pressure and temperature affected lifestyle preferences between particle-attached (PA) and free-living (FL) microbes. Ecological network analysis showed that HHP and LT enhanced microbial network interactions and resulted in higher vulnerability to networks of the PAM communities and more resilience of those of the FLM communities. Most interestingly, the PAM communities occupied most of the module hubs of the networks, whereas the FLM communities mainly served as connectors of the modules, suggesting their different ecological roles of the two groups of microbes. These results provided novel insights into how HHP and LT affected microbial community dynamics, ecological networks during POM sinking, and the implications for carbon cycling in the ocean.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

A Simple and Accurate Network for Hydrogen and Carbon Chemistry in the Interstellar Medium

Chemistry plays an important role in the interstellar medium (ISM), regulating the heating and cooling of the gas and determining abundances of molecular species that trace gas properties in observations. Although solving the time-dependent equations is necessary for accurate abundances and temperature in the dynamic ISM, a full chemical network is too computationally expensive to incorporate into numerical simulations. In this paper, we propose a new simplified chemical network for hydrogen and carbon chemistry in the atomic and molecular ISM. We compare results from our chemical network in detail with results from a full photodissociation region (PDR) code, and also with the Nelson and Langer (NL99) network previously adopted in the simulation literature. We show that our chemical network gives similar results to the PDR code in the equilibrium abundances of all species over a wide range of densities, temperature, and metallicities, whereas the NL99 network shows significant disagreement. Applying our network to 1D models, we find that the CO-dominated regime delimits the coldest gas and that the corresponding temperature tracks the cosmic-ray ionization rate in molecular clouds. We provide a simple fit for the locus of CO-dominated regions as a function of gas density and column. We also compare with observations of diffuse and translucent clouds. We find that the CO, CH{sub x}, and OH{sub x} abundances are consistent with equilibrium predictions for densities n=100--1000 cm{sup −3}, but the predicted equilibrium C abundance is higher than that seen in observations, signaling the potential importance of non-equilibrium/dynamical effects.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Designing optimal greenhouse gas observing networks that consider performance and cost

Emission rates of greenhouse gases (GHGs) entering into the atmosphere can be inferred using mathematical inverse approaches that combine observations from a network of stations with forward atmospheric transport models. Some locations for collecting observations are better than others for constraining GHG emissions through the inversion, but the best locations for the inversion may be inaccessible or limited by economic and other non-scientific factors. We present a method to design an optimal GHG observing network in the presence of multiple objectives that may be in conflict with each other. As a demonstration, we use our method to design a prototype network of six stations to monitor summertime emissions in California of the potent GHG 1,1,1,2-tetrafluoroethane (CH 2 FCF 3 , HFC-134a). We use a multiobjective genetic algorithm to evolve network configurations that seek to jointly maximize the scientific accuracy of the inferred HFC-134a emissions and minimize the associated costs of making the measurements. The genetic algorithm effectively determines a set of "optimal" observing networks for HFC-134a that satisfy both objectives (i.e., the Pareto frontier). The Pareto frontier is convex, and clearly shows the tradeoffs between performance and cost, and the diminishing returns in trading one for the other. Without difficulty, our method can be extended to design optimal networks to monitor two or more GHGs with different emissions patterns, or to incorporate other objectives and constraints that are important in the practical design of atmospheric monitoring networks.

Lucas, D. D.↗
NASA NTRS1972

Satellite networks for education.

Consideration of satellite-based educational networking. The characteristics and structure of networks are reviewed, and pressures within the educational establishment that are providing motivation for various types of networks are discussed. A number of studies are cited in which networking needs for educational sectors and services are defined. The current status of educational networking for educational radio and television, instructional television fixed services, inter- and intrastate educational communication networks, computer networks, cable television for education, and continuing and proposed educational experiments using NASA's Applications Technology Satellites is reviewed. Possible satellite-based educational telecommunication services and three alternatives for implementing educational satellite systems are described. Some remarks are made concerning public policy aspects of future educational satellite system development.

Singh, J. P.↗
NASA NTRS1975

The Deep Space Network

This report presents DSN progress in flight project support, tracking and data acquisition (TDA) research and technology, network engineering, hardware and software implementation, and operations. Each issue presents material in some, but not all, of the following categories in the order indicated. - Description of the DSN - Mission Support Ongoing Planetary/Interplanetary Flight Projects Advanced Flight Projects - Radio Science - Special Projects - Supporting Research and Technology Tracking and Ground-Based Navigation Communications--Spacecraft/Ground Station Control and Operations Technology Network Control and Data Processing - Network and Facility Engineering and Implementation Network Network Operations Control Center Ground Communications Deep Space Stations - Operations Network Operations Network Operations Control Center Ground Communications Deep Space Stations - Program Planning TDA Planning Quality Assurance In each issue, the part entitled "Description of the DSN" describes the functions and facilities of the DSN and may report the current configuration of one of the five DSN systems (Tracking, Telemetry, Command, Monitor & Control, and Test & Training). The work described in this report series is either performed or managed by the Tracking and Data Acquisition organization of JPL for NASA.

Tracking and Data Acquisition organization↗
NASA NTRS1980

Networks consolidation program

The Networks Consolidation Program (NCP) goals were defined to include the planning, designing, and implementing of a single network of ground tracking stations. The proposed consolidated network is to make use of facilities that are now included in the Goddard Ground Spaceflight Tracking and Data Network as well as the existing JPL Deep Space Network. These facilities are to be combined and modified to provide a consolidated network capable of supporting the set of planetary and Highly Elliptical Earth Orbiter missions that are planned for the Tracking and Data Relay Satellite System era. The history of activities and events that led to the decision to consolidate the NASA ground tracking and data networks are traced. A summary of the management and planning activities that have taken place at the Jet Propulsion Laboratory, Goddard Space Flight Center, and at the NASA Headquarters Office of Space Tracking and Data Systems, with respect to the NCP, from the time of decision in October 1979 to the present, are discussed.

Yeater, M. L.↗
NASA NTRS1981

Networks consolidation program

A single consolidated network of ground tracking stations to replace the present two ground-based spacecraft tracking networks is proposed. The proposed consolidated network uses facilities that are now included in the Ground Spaceflight Tracking and Data Network (GSTDN), operated by Goddard Space Flight (GSFC), as well as the existing Deep Space Network (DSN), operated by Jet Propulsion Laboratory (JPL). These facilities are combined and modified to provide a consolidated network managed and operated by JPL and capable of supporting the set of planetary and Highly Elliptical Earth Orbiter (HEEO) missions planned for the Tracking and Data Relay Satellite System (TDRSS) era. The consolidated network is planned to be operational after the TDRSS becomes operational. It will continue to support planetary missions that are now supported by the DSN and also provide support to a broad class of other spacecraft missions which are not compatible with or which, for other reasons, cannot be supported by the TDRSS.

Yeater, M. L.↗
NASA NTRS1988

On the stability, storage capacity, and design of nonlinear continuous neural networks

The stability, capacity, and design of a nonlinear continuous neural network are analyzed. Sufficient conditions for existence and asymptotic stability of the network's equilibria are reduced to a set of piecewise-linear inequality relations that can be solved by a feedforward binary network, or by methods such as Fourier elimination. The stability and capacity of the network is characterized by the post synaptic firing rate function. An N-neuron network with sigmoidal firing function is shown to have up to 3N equilibrium points. This offers a higher capacity than the (0.1-0.2)N obtained in the binary Hopfield network. Moreover, it is shown that by a proper selection of the postsynaptic firing rate function, one can significantly extend the capacity storage of the network.

Guez, Allon↗
NASA NTRS1989

Queuing theory models for computer networks

A set of simple queuing theory models which can model the average response of a network of computers to a given traffic load has been implemented using a spreadsheet. The impact of variations in traffic patterns and intensities, channel capacities, and message protocols can be assessed using them because of the lack of fine detail in the network traffic rates, traffic patterns, and the hardware used to implement the networks. A sample use of the models applied to a realistic problem is included in appendix A. Appendix B provides a glossary of terms used in this paper. This Ames Research Center computer communication network is an evolving network of local area networks (LANs) connected via gateways and high-speed backbone communication channels. Intelligent planning of expansion and improvement requires understanding the behavior of the individual LANs as well as the collection of networks as a whole.

Galant, David C.↗
NASA NTRS1991

Structural factoring approach for analyzing stochastic networks

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Hayhurst, Kelly J.↗
NASA NTRS1989

Space physics analysis network node directory (The Yellow Pages): Fourth edition

The Space Physics Analysis Network (SPAN) is a component of the global DECnet Internet, which has over 17,000 host computers. The growth of SPAN from its implementation in 1981 to its present size of well over 2,500 registered SPAN host computers, has created a need for users to acquire timely information about the network through a central source. The SPAN Network Information Center (SPAN-NIC) an online facility managed by the National Space Science Data Center (NSSDC) was developed to meet this need for SPAN-wide information. The remote node descriptive information in this document is not currently contained in the SPAN-NIC database, but will be incorporated in the near future. Access to this information is also available to non-DECnet users over a variety of networks such as Telenet, the NASA Packet Switched System (NPSS), and the TCP/IP Internet. This publication serves as the Yellow Pages for SPAN node information. The document also provides key information concerning other computer networks connected to SPAN, nodes associated with each SPAN routing center, science discipline nodes, contacts for primary SPAN nodes, and SPAN reference information. A section on DECnet Internetworking discusses SPAN connections with other wide-area DECnet networks (many with thousands of nodes each). Another section lists node names and their disciplines, countries, and institutions in the SPAN Network Information Center Online Data Base System. All remote sites connected to US-SPAN and European-SPAN (E-SPAN) are indexed. Also provided is information on the SPAN tail circuits, i.e., those remote nodes connected directly to a SPAN routing center, which is the local point of contact for resolving SPAN-related problems. Reference material is included for those who wish to know more about SPAN. Because of the rapid growth of SPAN, the SPAN Yellow Pages is reissued periodically.

Peters, David J.↗
NASA NTRS1990

30 years of adaptive neural networks - Perceptron, Madaline, and backpropagation

Fundamental developments in feedforward artificial neural networks from the past thirty years are reviewed. The history, origination, operating characteristics, and basic theory of several supervised neural-network training algorithms (including the perceptron rule, the least-mean-square algorithm, three Madaline rules, and the backpropagation technique) are described. The concept underlying these iterative adaptation algorithms is the minimal disturbance principle, which suggests that during training it is advisable to inject new information into a network in a manner that disturbs stored information to the smallest extent possible. The two principal kinds of online rules that have developed for altering the weights of a network are examined for both single-threshold elements and multielement networks. They are error-correction rules, which alter the weights of a network to correct error in the output response to the present input pattern, and gradient rules, which alter the weights of a network during each pattern presentation by gradient descent with the objective of reducing mean-square error (averaged over all training patterns).

Widrow, Bernard↗
NASA NTRS1991

International global network of fiducial stations: Scientific and implementation issues

In this report, an ad hoc panel of the National Research Council's Committee on Geodesy, Board of Earth Sciences and Resources (1) evaluates the scientific importance of a global network of fiducial sites, monitored very precisely, using a combination of surface- and space-geodetic techniques; (2) examines strategies for implementing and operating such a network; and (3) assesses whether such a network would provide a suitable global infrastructure for geodetic and other geophysical systems of the next century. The panel concludes that a global network of fiducial sites would be a valuable tool for addressing global change issues and play a critical role in providing a reference frame for scientific Earth missions. The panel suggests that existing global networks be integrated and anticipates that such a network would grow from about 30 to the ultimate size of about 200 fiducial sites. It is noted that such a global network will provide a long-term infrastructure for geodetic and geophysical studies. The panel expects that these fiducial sites would evolve into terrestrial observatories or laboratories that would permit more comprehensive studies of the Earth than those now possible.

Source record↗
NASA NTRS1991

Automated implementation of rule-based expert systems with neural networks for time-critical applications

In fault diagnosis, control and real-time monitoring, both timing and accuracy are critical for operators or machines to reach proper solutions or appropriate actions. Expert systems are becoming more popular in the manufacturing community for dealing with such problems. In recent years, neural networks have revived and their applications have spread to many areas of science and engineering. A method of using neural networks to implement rule-based expert systems for time-critical applications is discussed here. This method can convert a given rule-based system into a neural network with fixed weights and thresholds. The rules governing the translation are presented along with some examples. We also present the results of automated machine implementation of such networks from the given rule-base. This significantly simplifies the translation process to neural network expert systems from conventional rule-based systems. Results comparing the performance of the proposed approach based on neural networks vs. the classical approach are given. The possibility of very large scale integration (VLSI) realization of such neural network expert systems is also discussed.

Ramamoorthy, P. A.↗
NASA NTRS1991

Using a CLIPS expert system to automatically manage TCP/IP networks and their components

A expert system that can directly manage networks components on a Transmission Control Protocol/Internet Protocol (TCP/IP) network is described. Previous expert systems for managing networks have focused on managing network faults after they occur. However, this proactive expert system can monitor and control network components in near real time. The ability to directly manage network elements from the C Language Integrated Production System (CLIPS) is accomplished by the integration of the Simple Network Management Protocol (SNMP) and a Abstract Syntax Notation (ASN) parser into the CLIPS artificial intelligence language.

Faul, Ben M.↗
NASA NTRS1993

Program Helps Simulate Neural Networks

Neural Network Environment on Transputer System (NNETS) computer program provides users high degree of flexibility in creating and manipulating wide variety of neural-network topologies at processing speeds not found in conventional computing environments. Supports back-propagation and back-propagation-related algorithms. Back-propagation algorithm used is implementation of Rumelhart's generalized delta rule. NNETS developed on INMOS Transputer(R). Predefines back-propagation network, Jordan network, and reinforcement network to assist users in learning and defining own networks. Also enables users to configure other neural-network paradigms from NNETS basic architecture. Small portion of software written in OCCAM(R) language.

Villarreal, James↗
NASA NTRS1992

Membership generation using multilayer neural network

There has been intensive research in neural network applications to pattern recognition problems. Particularly, the back-propagation network has attracted many researchers because of its outstanding performance in pattern recognition applications. In this section, we describe a new method to generate membership functions from training data using a multilayer neural network. The basic idea behind the approach is as follows. The output values of a sigmoid activation function of a neuron bear remarkable resemblance to membership values. Therefore, we can regard the sigmoid activation values as the membership values in fuzzy set theory. Thus, in order to generate class membership values, we first train a suitable multilayer network using a training algorithm such as the back-propagation algorithm. After the training procedure converges, the resulting network can be treated as a membership generation network, where the inputs are feature values and the outputs are membership values in the different classes. This method allows fairly complex membership functions to be generated because the network is highly nonlinear in general. Also, it is to be noted that the membership functions are generated from a classification point of view. For pattern recognition applications, this is highly desirable, although the membership values may not be indicative of the degree of typicality of a feature value in a particular class.

Kim, Jaeseok↗