NASAP - Network Analysis for Systems Applications Program - Present capabilities of a maintained program
Flowgraph construction, input-output formulation, and subroutines for Network Analysis for Systems Applications Program /NASAP/
SEARCH · Search NASA
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.
Flowgraph construction, input-output formulation, and subroutines for Network Analysis for Systems Applications Program /NASAP/
Topological study of digital computer programming efficiency in electric network analysis, considering cost of computation
Functional network analysis of 112 GWAS-identified candidate genes for yield-related traits in pennycress ( Thlaspi arvense ). Uses RWRtools Lines of Evidence to propagate Arabidopsis orthologs through a nine-layer multiplex functional network.
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.
Data Products has particular interest in developing an efficient network analysis and monitoring system that utilizes advanced machine learning methods to mine complex network data of the type generated within large data centers, with an objective to provide tangible business-usable intelligence. The Laboratory is currently the lead institution for a U.S. Department of Energy Office of Science (DOE/SC) network research project called BigData Express (BDE). The project seeks to provide an orchestration service for high-performance data movement of data sets for large-scale science. This collaboration is believed to potentially be a highly symbiotic one, with Data Products platform development benefiting from the rich sets of network data available in the BDE development environment, and BDE benefiting from the Data Products machine learning analysis of BDE-generated data movement.
A synopsis of research on computer viruses and computer security is presented. A review of seven technical meetings attended is compiled. A technical discussion on the communication plans for the ASRM facility is presented, with a brief tutorial on the potential local area network media and protocols.
Single tree-finding program for digital computer evaluation of topological formulas for network analysis
Supermassive black hole binaries are one of the primary targets of gravitational wave (GW) searches using pulsar timing arrays (PTAs). GW signals from such systems are well represented by parameterized models, allowing the standard Generalized Likelihood Ratio Test (GLRT) to be used for their detection and estimation. However, there is a dichotomy in how the GLRT can be implemented for PTAs: there are two possible ways in which one can split the set of signal parameters for semi-analytical and numerical extremization. The straightforward extension of the method used for continuous signals in ground-based GW searches, where the so-called pulsar phase parameters are maximized numerically, was addressed in an earlier paper. In this paper, we report the first study of the performance of the second approach where the pulsar phases are maximized semi-analytically. This approach is scalable since the number of parameters left over for numerical optimization does not depend on the size of the PTA. Our results show that for the same array size (9 pulsars), the new method performs somewhat worse in parameter estimation, but not in detection, than the previous method where the pulsar phases were maximized numerically. The origin of the performance discrepancy is likely to be in the ill-posedness that is intrinsic to any network analysis method. However, the scalability of the new method allows the ill-posedness to be mitigated by simply adding more pulsars to the array. This is shown explicitly by taking a larger array of pulsars.
Derivation of conditions for existence of unique solutions to implicit equations of the form y = f(x, u) or x = h(x, u) which are frequently encountered in the analysis of nonlinear networks. The existence of such solutions is demonstrated by applying the principle of contraction mapping and by ascertaining the possibility of a functional inversion according to the Palais (1959) theorem.
Gene expression, signal transduction, protein/chemical interactions, biomedical literature cooccurrences, and other concepts are often captured in biological network representations where nodes represent a certain bioentity and edges the connections between them. While many tools to manipulate, visualize, and interactively explore such networks already exist, only few of them can scale up and follow today’s indisputable information growth. In this review, we shortly list a catalog of available network visualization tools and, from a user-experience point of view, we identify four candidate tools suitable for larger-scale network analysis, visualization, and exploration. Lastly, we comment on their strengths and their weaknesses and empirically discuss their scalability, user friendliness, and postvisualization capabilities.
This project is to explore ground motion spatial distribution using a new approach graph-based network analysis. In this study, we combine a large-N seismic array and graph analytics to explore spatial variability and correlation at a local scale using small local and regional earthquakes. In this method, each seismic station is modeled as a node and the similarities of the waveforms that represent ground motions between two stations are modeled as edges. By analyzing this graph network using the similarity matrices and community detection algorithm, we can group the stations spatially with similar patterns. A random forest algorithm is used to reveal the important features that affect the spatial grouping. The result suggests site conditions, and how they interact with the incident seismic wavefield, strongly condition the spatial correlation of ground motion. Future progress in characterizing ground motion spatial variability will require dense wavefield measurements, either through nodal deployments, or perhaps distributed acoustic sensing measurements of seismic wavefields.
Computer influence on methods of formulating network problems for designing electronic equipment
Abstract Conservation of long‐distance migratory species poses unique challenges. Migratory connectivity, that is, the extent to which groupings of individuals at breeding sites are maintained in wintering areas, is frequently used to evaluate population structure and assess use of key habitat areas. However, for species with complex or variable annual cycle movements, this traditional bimodal framework of migratory connectivity may be overly simplistic. Like many other waterfowl, sea ducks often travel to specific pre‐ and post‐breeding sites outside their nesting and wintering areas to prepare for migration by feeding extensively and, in some cases, molting their flight feathers. These additional migrations may play a key role in population structure, but are not included in traditional models of migratory connectivity. Network analysis, which applies graph theory to assess linkages between discrete locations or entities, offers a powerful tool for quantitatively assessing the contributions of different sites used throughout the annual cycle to complex spatial networks. We collected satellite telemetry data on annual cycle movements of 672 individual sea ducks of five species from throughout eastern North America and the Great Lakes. From these data, we constructed a multi‐species network model of migratory patterns and site use over the course of breeding, molting, wintering, and migratory staging. Our results highlight inter‐ and intra‐specific differences in the patterns and complexity of annual cycle movement patterns, including the central importance of staging and molting sites in James Bay, the St. Lawrence River, and southern New England to multi‐species annual cycle habitat linkages, and highlight the value of Long‐tailed Ducks ( Calengula haemalis ) as an umbrella species to represent the movement patterns of multiple sea duck species. We also discuss potential applications of network migration models to conservation prioritization, identification of population units, and integrating different data streams.
Here, the purpose is to define the operational management structure and to delineate the responsibilities of key Space Physics Analysis Network (SPAN) individuals. The management structure must take into account the large NASA and ESA science research community by giving them a major voice in the operation of the system. Appropriate NASA and ESA interfaces must be provided so that there will be adequate communications facilities available when needed. Responsibilities are delineated for the Advisory Committee, the Steering Committee, the Project Scientist, the Project Manager, the SPAN Security Manager, the Internetwork Manager, the Network Operations Manager, the Remote Site Manager, and others.
Abstract Networks with memristive devices are a potential basis for the next generation of computing devices. They are also an important model system for basic science, from modeling nanoscale conductivity to providing insight into the information-processing of neurons. The resistance in a memristive device depends on the history of the applied bias and thus displays a type of memory. The interplay of this memory with the dynamic properties of the network can give rise to new behavior, offering many fascinating theoretical challenges. But methods to analyze general memristive circuits are not well described in the literature. In this paper we develop a general circuit analysis for networks that combine memristive devices alongside resistors, capacitors and inductors and under various types of control. We derive equations of motion for the memory parameters of these circuits and describe the conditions for which a network should display properties characteristic of a resonator system. For the case of a purely memresistive network, we derive Lyapunov functions, which can be used to study the stability of the network dynamics. Surprisingly, analysis of the Lyapunov functions show that these circuits do not always have a stable equilibrium in the case of nonlinear resistance and window functions. The Lyapunov function allows us to study circuit invariances, wherein different circuits give rise to similar equations of motion, which manifest through a gauge freedom and node permutations. Finally, we identify the relation between the graph Laplacian and the operators governing the dynamics of memristor networks operators, and we use these tools to study the correlations between distant memristive devices through the effective resistance.
Not Available
Initial analysis of the Mariner 9 high resolution pictures of Phobos surface features has been completed. A control network of 38 landmarks has been established and used to determine the physical size, shape, orientation, libration, and topography properties of Phobos. The results verified the synchronous rotation of Phobos and revealed a libration of approximately 5 deg in the orbit plane of Phobos. A preliminary map of Phobos, based on the control network analysis, is given.
Predicting multi-building energy use at campus or city district scale has recently gained more attention; and more researchers have started to define reference buildings and study inter-impact between building groups. However, how to integrate the relationship to define reference buildings and predict multi-building energy use, using significantly less amount of building data and reducing complexity of prediction models, remains an open research question. To resolve this, this study proposed a novel method to predict multi-building energy use by integrating a social network analysis (SNA) with an Artificial Neural Network (ANN) technique. The SNA method was used to establish a building network (BN) by identifying reference buildings and determine correlations between reference buildings and non-reference buildings. The ANN technique was applied to learn correlations and historical building energy use, and then used to predict multi-building energy use. To validate the SNA-ANN method, 17 buildings in the Southeast University campus, located in Nanjing, China, were studied. These buildings have three years of actual monthly electricity use data and were grouped into four types: office, educational, laboratory, and residential. The results showed the integrated SNA-ANN method achieved average prediction accuracies of 90.67% for the office group, 90.79% for the educational group, 92.34% for the laboratory group, and 83.32% for the residential group. The results demonstrated the proposed SNA-ANN method achieved an accuracy of 90.28% for the predicted energy use for all building groups. Finally, this study provides insights into advancing the interdisciplinary research on multi-building energy use prediction.