Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer networks.”

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

Model reduction for fractured porous media: a machine learning approach for identifying main flow pathways

Discrete fracture networks (DFN) are often used to model flow and transport in fractured porous media. The accurate resolution of flow and transport behavior on a large DFN involving thousands of fractures is computationally expensive. This makes uncertainty quantification studies of quantities of interest such as travel time through the network computationally intractable, since hundreds to thousands of runs of the DFN model are required to get bounds on the uncertainty of the predictions. Prior works on the subject demonstrated that the complexity of a DFN could be reduced by considering a sub-network of it (often termed a “backbone” sub-network), one whose flow and transport properties were then shown to be similar to that of the full network. The technique is tantamount to partitioning the complete set of fractures of a network into two disjoint sets, one of which is the backbone sub-network while the other its complement. It is in this context that we present a system-reduction technique for DFNs using supervised machine learning via a Random Forest Classifier that selects a backbone sub-network from the full set of fractures. The in-sample errors (in terms of precision and recall scores) of the trained classifier are found to be very accurate indicators of the out-of-sample errors, thus exhibiting that the classifier generalizes well to test data. Moreover, this system-reduction technique yields sub-networks as small as 12% of the full DFN that still recover transport characteristics of the full network such as the peak dosage and tailing behavior for late times. Most importantly, the sub-networks remain connected, and their size can be controlled by a single dimensionless parameter. Furthermore, measures of KL-divergence and KS-statistic for the breakthrough curves of the sub-networks with respect to the full network show physically realistic trends in that the measures decrease monotonically as the size of the sub-networks increase. In conclusion, the computational efficiency gained by this technique depends on the size of the sub-network, but large reductions in computational time can be expected for small sub-networks, yielding as much as 90% computational savings for sub-networks that are as small as 10-12% of the full network.

97 MATHEMATICS AND COMPUTING↗

Towards computational polar-topotronics: Multiscale neural-network quantum molecular dynamics simulations of polar vortex states in SrTiO3/PbTiO3 nanowires

Recent discoveries of polar topological structures ( e.g ., skyrmions and merons) in ferroelectric/paraelectric heterostructures have opened a new field of polar topotronics. However, how complex interplay of photoexcitation, electric field and mechanical strain controls these topological structures remains elusive. To address this challenge, we have developed a computational approach at the nexus of machine learning and first-principles simulations. Our multiscale neural-network quantum molecular dynamics molecular mechanics approach achieves orders-of-magnitude faster computation, while maintaining quantum-mechanical accuracy for atoms within the region of interest. This approach has enabled us to investigate the dynamics of vortex states formed in PbTiO 3 nanowires embedded in SrTiO 3 . We find topological switching of these vortex states to topologically trivial, uniformly polarized states using electric field and trivial domain-wall states using shear strain. These results, along with our earlier results on optical control of polar topology, suggest an exciting new avenue toward opto-electro-mechanical control of ultrafast, ultralow-power polar topotronic devices.

Linker, Thomas↗

Self port scanning tool : providing a more secure computing Environment through the use of proactive port scanning

Secure computing is a necessity in the hostile environment that the internet has become. Protection from nefarious individuals and organizations requires a solution that is more a methodology than a one time fix. One aspect of this methodology is having the knowledge of which network ports a computer has open to the world, These network ports are essentially the doorways from the internet into the computer. An assessment method which uses the nmap software to scan ports has been developed to aid System Administrators (SAs) with analysis of open ports on their system(s). Additionally, baselines for several operating systems have been developed so that SAs can compare their open ports to a baseline for a given operating system. Further, the tool is deployed on a website where SAs and Users can request a port scan of their computer. The results are then emailed to the requestor. This tool aids Users, SAs, and security professionals by providing an overall picture of what services are running, what ports are open, potential trojan programs or backdoors, and what ports can be closed.

nMap↗

Open Solutions to Distributed Control in Ground Tracking Stations

The advent of high speed local area networks has made it possible to interconnect small, powerful computers to function together as a single large computer...This paper examines a model for tracking stations and their requirements for inter-processor communications in the next century.

lan↗

Object-oriented Tools for Distributed Computing

Distributed computing systems are proliferating, owing to the availability of powerful, affordable microcomputers and inexpensive communication networks. A critical problem in developing such systems is getting application programs to interact with one another across a computer network. Remote interprogram connectivity is particularly challenging across heterogeneous environments, where applications run on different kinds of computers and operating systems. NetWorks! (trademark) is an innovative software product that provides an object-oriented messaging solution to these problems. This paper describes the design and functionality of NetWorks! and illustrates how it is being used to build complex distributed applications for NASA and in the commercial sector.

Adler, Richard M.↗

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗

Connecting Separate Computers to a Common Bus

Network bus adapter (NBA) handles protocols for computer-tocomputer communications. NBA does all protocol handling and communications with bus for its host computer, that processor of different speeds sends data to each other continuously at maximum speed. Any host can communicate with any other, or several or with all.

Agrawan, A. K.↗

An investigation of networking techniques for the ASRM facility

This report is based on the early design concepts for a communications network for the Advanced Solid Rocket Motor (ASRM) facility being built at Yellow Creek near Iuka, MS. The investigators have participated in the early design concepts and in the evaluation of the initial concepts. The continuing system design effort and any modification of the plan will require a careful evaluation of the required bandwidth of the network, the capabilities of the protocol, and the requirements of the controllers and computers on the network. The overall network, which is heterogeneous in protocol and bandwidth, is being modeled, analyzed, simulated, and tested to obtain some degree of confidence in its performance capabilities and in its performance under nominal and heavy loads. The results of the proposed work should have an impact on the design and operation of the ASRM facility.

Moorhead, Robert J., II↗

Data communication network at the ASRM facility

This three-year project (February 1991 to February 1994) has involved analyzing and helping to design the communication network for the Advanced Solid Rocket Motor (ASRM) facility at Yellow Creek, near Iuka, MS. The principal concerns in the analysis were the bandwidth (both on average and in the worst case) and the expandability of the network. As the communication network was designed and modified, a careful evaluation of the bandwidth of the network, the capabilities of the protocol, and the requirements of the controllers and computers on the network was required. The overall network, which was heterogeneous in protocol and bandwidth, needed to be modeled, analyzed, and simulated to obtain some degree of confidence in its performance capabilities and in its performance under nominal and heavy loads. The results of our analysis did have an impact on the design and operation of the ASRM facility. During 1993 we analyzed many configurations of this basic network structure. The analyses are described in detail in Section 2 and 3 herein. Section 2 reports on an analysis of the whole network. The preliminary results of that research indicated that the most likely bottleneck as the network traffic increased would be the hubs. Thus a study of Cabletron hubs was initiated. The results of that study are in Section 3. Section 4 herein reports on the final network configuration analyzed. When the ASRM facility was mothballed in December of 1993, this was basically the planned and partially installed network. A briefing was held at NASA/MSFC on December 7, 1993, at which time our final analysis and conclusions were disseminated. This report contains a written record of most of the information disseminated at that briefing.

Moorhead, Robert J., III↗

A new method for satellite orbit determination using an operational worldwide transponder network

The method utilizes computer programs developed for the forthcoming ATS-F/NIMBUS-F tracking and data relay experiment where the basic tracking measurements are multiple path round-trip propagation times and rates. This method of orbit computation has recently been successfully evaluated by tracking a geostationary satellite (ATS-3) using an existing VHF (150 MHz) network of automatic transponders. A master station sequentially interrogates each transponder via the ATS-3. The master site is located at Schenectady, N. Y. and four automatic transponders were located at Shannon, Reykajavik, Buenos Aires, and Seattle respectively. Data at hourly intervals were collected during a 24 hour period on April 18-19, 1973. After correcting this data for known systematic errors it was provided as input to an orbit determination program where all satellite motions during signal propagation are rigorously accounted for. The resulting estimated ATS-3 orbit yielded observational residuals on the order of 100 meters. By using more than one satellite the present scheme is further capable of accurately locating several stationary or mobile terminals as part of the overall orbital solution.

Lynn, J. J.↗

Neuromorphic overparameterisation and few-shot learning in multilayer physical neural networks

Abstract Physical neuromorphic computing, exploiting the complex dynamics of physical systems, has seen rapid advancements in sophistication and performance. Physical reservoir computing, a subset of neuromorphic computing, faces limitations due to its reliance on single systems. This constrains output dimensionality and dynamic range, limiting performance to a narrow range of tasks. Here, we engineer a suite of nanomagnetic array physical reservoirs and interconnect them in parallel and series to create a multilayer neural network architecture. The output of one reservoir is recorded, scaled and virtually fed as input to the next reservoir. This networked approach increases output dimensionality, internal dynamics and computational performance. We demonstrate that a physical neuromorphic system can achieve an overparameterised state, facilitating meta-learning on small training sets and yielding strong performance across a wide range of tasks. Our approach’s efficacy is further demonstrated through few-shot learning, where the system rapidly adapts to new tasks.

Science & Technology - Other Topics↗

Compact Interconnection Networks Based on Quantum Dots

Architectures that would exploit the distinct characteristics of quantum-dot cellular automata (QCA) have been proposed for digital communication networks that connect advanced digital computing circuits. In comparison with networks of wires in conventional very-large-scale integrated (VLSI) circuitry, the networks according to the proposed architectures would be more compact. The proposed architectures would make it possible to implement complex interconnection schemes that are required for some advanced parallel-computing algorithms and that are difficult (and in many cases impractical) to implement in VLSI circuitry. The difficulty of implementation in VLSI and the major potential advantage afforded by QCA were described previously in Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42. To recapitulate: Wherever two wires in a conventional VLSI circuit cross each other and are required not to be in electrical contact with each other, there must be a layer of electrical insulation between them. This, in turn, makes it necessary to resort to a noncoplanar and possibly a multilayer design, which can be complex, expensive, and even impractical. As a result, much of the cost of designing VLSI circuits is associated with minimization of data routing and assignment of layers to minimize crossing of wires. Heretofore, these considerations have impeded the development of VLSI circuitry to implement complex, advanced interconnection schemes. On the other hand, with suitable design and under suitable operating conditions, QCA-based signal paths can be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. The proposed architectures require two advances in QCA-based circuitry beyond basic QCA-based binary-signal wires described in the cited prior article. One of these advances would be the development of QCA-based wires capable of bidirectional transmission of signals. The other advance would be the development of QCA circuits capable of high-impedance state outputs. The high-impedance states would be utilized along with the 0- and 1-state outputs of QCA.

Fijany, Amir↗

Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications (Final Report)

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operation optical WDM networks.

97 MATHEMATICS AND COMPUTING↗

From biological neural networks to thinking machines: Transitioning biological organizational principles to computer technology

The three-dimensional organization of the vestibular macula is under study by computer assisted reconstruction and simulation methods as a model for more complex neural systems. One goal of this research is to transition knowledge of biological neural network architecture and functioning to computer technology, to contribute to the development of thinking computers. Maculas are organized as weighted neural networks for parallel distributed processing of information. The network is characterized by non-linearity of its terminal/receptive fields. Wiring appears to develop through constrained randomness. A further property is the presence of two main circuits, highly channeled and distributed modifying, that are connected through feedforward-feedback collaterals and biasing subcircuit. Computer simulations demonstrate that differences in geometry of the feedback (afferent) collaterals affects the timing and the magnitude of voltage changes delivered to the spike initiation zone. Feedforward (efferent) collaterals act as voltage followers and likely inhibit neurons of the distributed modifying circuit. These results illustrate the importance of feedforward-feedback loops, of timing, and of inhibition in refining neural network output. They also suggest that it is the distributed modifying network that is most involved in adaptation, memory, and learning. Tests of macular adaptation, through hyper- and microgravitational studies, support this hypothesis since synapses in the distributed modifying circuit, but not the channeled circuit, are altered. Transitioning knowledge of biological systems to computer technology, however, remains problematical.

Ross, Muriel D.↗

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗