Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex 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,333 records · Page 74

A Review of Power Distribution Test Feeders in the United States and the Need for Synthetic Representative Networks

Under the increasing penetration of distributed energy resources and new smart network technologies, distribution utilities face new challenges and opportunities to ensure reliable operations, manage service quality, and reduce operational and investment costs. Simultaneously, the research community is developing algorithms for advanced controls and distribution automation that can help to address some of these challenges. However, there is a shortage of realistic test systems that are publically available for development, testing, and evaluation of such new algorithms. Concerns around revealing critical infrastructure details and customer privacy have severely limited the number of actual networks published and that are available for testing. In recent decades, several distribution test feeders and US-featured representative networks have been published, but the scale, complexity, and control data vary widely. This paper presents a first-of-a-kind structured literature review of published distribution test networks with a special emphasis on classifying their main characteristics and identifying the types of studies for which they have been used. As a result, this both aids researchers in choosing suitable test networks for their needs and highlights the opportunities and directions for further test system development. In particular, we highlight the need for building large-scale synthetic networks to overcome the identified drawbacks of current distribution test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Neural net diagnostics for VLSI test

This paper discusses the application of neural network pattern analysis algorithms to the IC fault diagnosis problem. A fault diagnostic is a decision rule combining what is known about an ideal circuit test response with information about how it is distorted by fabrication variations and measurement noise. The rule is used to detect fault existence in fabricated circuits using real test equipment. Traditional statistical techniques may be used to achieve this goal, but they can employ unrealistic a priori assumptions about measurement data. Our approach to this problem employs an adaptive pattern analysis technique based on feedforward neural networks. During training, a feedforward network automatically captures unknown sample distributions. This is important because distributions arising from the nonlinear effects of process variation can be more complex than is typically assumed. A feedforward network is also able to extract measurement features which contribute significantly to making a correct decision. Traditional feature extraction techniques employ matrix manipulations which can be particularly costly for large measurement vectors. In this paper we discuss a software system which we are developing that uses this approach. We also provide a simple example illustrating the use of the technique for fault detection in an operational amplifier.

Lin, T.↗

Stimulus Sensitivity of a Spiking Neural Network Model

Some recent papers relate the criticality of complex systems to their maximal capacity of information processing. In the present paper, we consider high dimensional point processes, known as age-dependent Hawkes processes, which have been used to model spiking neural networks. Using mean-field approximation, the response of the network to a stimulus is computed and we provide a notion of stimulus sensitivity. It appears that the maximal sensitivity is achieved in the sub-critical regime, yet almost critical for a range of biologically relevant parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the synthesis and structure of resorcinol-formaldehyde polymeric networks – Precursors to 3D-carbon macroassemblies

With the new impetus towards the development of hierarchical graphene and CNT macro-assemblies for application in fields such as advanced energy storage, catalysis and electronics; there is much renewed interest in organic carbon-based sol–gel processes as a synthetically convenient and versatile means of forming three dimensional, covalently bonded organic/inorganic networks. Such matrices can act as highly effective precursors, scaffolds or molecular ‘glues’ for the assembly of a wide variety of functional carbon macro-assemblies. However, despite the utility and broad use of organic sol–gel processes – such as the ubiquitous resorcinol-formaldehyde (RF) reaction, there are details of the reaction chemistries of these important sol–gel processes that remain poorly understood at present. It is therefore both timely and necessary to examine these reactions in more detail using modern analytical techniques in order to gain a more rigorous understanding of the mechanisms by which these organic networks form. The goal of such studies is to obtain improved and rational control over the organic network structure, in order to better direct and tailor the architecture of the final inorganic carbon matrix. In this study we have investigated in detail, the mechanism of the organic sol–gel network forming reaction of resorcinol and formaldehyde from a structural and kinetic standpoint, by using a combination of real-time high field solution state nuclear magnetic resonance (NMR), low field NMR relaxometry and differential scanning calorimetry (DSC). These investigations have allowed us to track the network formation processes in real-time, gain both detailed structural information on the mechanisms of the RF sol–gel process and a quantitative assessment of the kinetics of the global network formation process. Here, it has been shown that the mechanism, by which the RF organic network forms, proceeds via an initial exothermic step correlated to the formation of a free aromatic aldehyde. The network growth reaction then proceeds in a statistical manner following a first order Arrhenius type kinetic relationship – characteristic of a typical thermoset network poly-condensation process. Finally, despite the relative complexity and ill-defined nature of the formaldehyde staring material, the final network structure is to a large extent, governed by the substitution pattern of the resorcinol molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A multiscale anisotropic polymer network model coupled with phase field fracture

The study of polymers has continued to gain substantial attention due to their expanding range of applications, spanning essential engineering fields to emerging domains like stretchable electronics, soft robotics, and implantable sensors. These materials exhibit remarkable properties, primarily stemming from their intricate polymer chain network, which, in turn, increases the complexity of precisely modeling their behavior. Especially for modeling elastomers and their fracture behavior, accurately accounting for the deformations of the polymer chains is vital for predicting the rupture in highly stretched chains. Despite the importance, many robust multiscale continuum frameworks for modeling elastomer fracture tend to simplify network deformations by assuming uniform behavior among chains in all directions. Recognizing this limitation, our study proposes a multiscale fracture model that accounts for the anisotropic nature of elastomer network responses. At the microscale, damage in the chains is assumed to be driven by both the chain's entropy and the internal energy due to molecular bond distortions. In order to bridge the stretching in the chains to the macroscale deformation, we employ the maximal advance path constraint network model, inherently accommodating anisotropic network responses. As a result, chains oriented differently can be predicted to exhibit varying stretch and, consequently, different damage levels. To drive macroscale fracture based on damages in these chains, we utilize the micromorphic regularization theory, which involves the introduction of dual local-global damage variables at the macroscale. The macroscale local damage variable is obtained through the homogenization of the chain damage values, resulting in the prediction of an isotropic material response. The macroscale global damage variable is subjected to nonlocal effects and boundary conditions in a thermodynamically consistent phase field continuum formulation. Moreover, the total dissipation in the system is considered to be mainly due to the breaking of the molecular bonds at the microscale. To validate our model, we employ the double-edge notched tensile test as a benchmark, comparing simulation predictions with existing experimental data. Additionally, to enhance our understanding of the fracturing process, we conduct uniaxial tensile experiments on a square film made up of polydimethylsiloxane (PDMS) rubber embedded with a hole and notches and then compare our simulation predictions with the experimental observations. Furthermore, we visualize the evolution of stretch and damage values in chains oriented along different directions to assess the predictive capacity of the model. In conclusion, the results are also compared with another existing model to evaluate the utility of our model in accurately simulating the fracture behavior of rubber-like materials.

42 ENGINEERING↗

Homochiral coordination polymers constructed from aminocarboxylate derivates: Effect of bipyridine on the amidation reaction

Using aminocarboxylate derivates (S)-N-(4-cyanobenzoic)-glutamic acid (denoted as cbg, 1a) and (S)-N-(4-nitrobenzoic)-glutamic acid (denoted as nbg, 1b) as chiral ligands, five new homochiral coordination polymers formulated as [Cu(cbg)(H{sub 2}O){sub 2}]{sub n} (3), [Cu(cbop){sub 2}(4,4 Prime -bipy)(H{sub 2}O)]{sub n} (4) (cbop=(S)-N-(4-cyanobenzoic)-5-oxoproline, 4,4 Prime -bipy=4,4 Prime -bipyridine), {l_brace}[Cu(nbop){sub 2}(4,4 Prime -bipy)]{center_dot}4H{sub 2}O{r_brace}{sub n} (5) (nbop=(S)-N-(4-nitrobenzoic)-5-oxoproline), {l_brace}[Cd(nbop){sub 2}(4,4 Prime -bipy)]{center_dot}2H{sub 2}O{r_brace}{sub n} (6), and [Ni(nbop){sub 2}(4,4 Prime -bipy)(H{sub 2}O){sub 2}]{sub n} (7) have been hydrothermally synthesized and structurally characterized. Single-crystal X-ray diffraction study reveals that the original chirality of aminocarboxylate derivates is maintained in all these complexes. Complexes 3, 4, and 7 are one-dimensional infinite chain coordination polymers, while complexes 5 and 6 possess two-dimensional network structures. In situ cyclization of 1a and 1b was taken place in the formation of complexes 4-7, which may be due to the competition of 4,4 Prime -bipyridine with chiral ligands during the coordination process. Preliminary optical behavior investigation indicates that ligands 1a, 1b, and complexes 6, 7 are nonlinear optical active. - Graphical abstract: Using aminocarboxylate derivates as chiral ligands, five new homochiral coordination polymers possessing second harmonic generation activities have been hydrothermally synthesized. Highlights: Black-Right-Pointing-Pointer Two new chiral aminocarboxylate derivates were firstly synthesized. Black-Right-Pointing-Pointer Five new homochiral metal organic complexes were obtained hydrothermally based on these ligands. Black-Right-Pointing-Pointer Intramolecular amidation was taken place on the aminocarboxylate derivates during the formation of these complexes. Black-Right-Pointing-Pointer In situ amidation may be due to the impact of 4,4 Prime -bipyridine. Black-Right-Pointing-Pointer The homochiral complexes are nonlinear optical active.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

Cheung, Kar-Ming↗

DISCRETE EVENT SIMULATION OF OPTICAL SWITCH MATRIX PERFORMANCE IN COMPUTER NETWORKS

In this paper, we present application of a Discrete Event Simulator (DES) for performance modeling of optical switching devices in computer networks. Network simulators are valuable tools in situations where one cannot investigate the system directly. This situation may arise if the system under study does not exist yet or the cost of studying the system directly is prohibitive. Most available network simulators are based on the paradigm of discrete-event-based simulation. As computer networks become increasingly larger and more complex, sophisticated DES tool chains have become available for both commercial and academic research. Some well-known simulators are NS2, NS3, OPNET, and OMNEST. For this research, we have applied OMNEST for the purpose of simulating multi-wavelength performance of optical switch matrices in computer interconnection networks. Our results suggest that the application of DES to computer interconnection networks provides valuable insight in device performance and aids in topology and system optimization.

Imam, Neena↗

Modeling and simulation of pore-scale multiphase fluid flow and reactive transport in fractured and porous media

In the subsurface fluids play a critical role by transporting dissolved minerals, colloids and contaminants (sometimes over long distances), by mediating dissolution and precipitation processes and enabling chemical transformations in solution and at mineral surfaces. Although the complex geometries of fracture apertures, fracture networks and pore spaces may make it difficult to accurately predict fluid flow in saturated (single-phase) subsurface systems, well developed methods are available. The simulation of multiphase fluid flow in the subsurface is much more challenging because of the large density and/or viscosity ratios found in important applications (water/air in the vadose zone, water/oil, water/gas, gas/oil and water/oil/gas in oil reservoirs, water/air/non-aqueous phase liquids (NAPL) in contaminated vadose zone systems and gas/molten rock in volcanic systems, for example). In addition, the complex behavior of fluid-fluid-solid contact lines, and its impact on dynamic contact angles, must also be taken into account, and coupled with the fluid flow. Pore network models and simple statistical physics based models such as the invasion percolation and diffusion-limited aggregation models have been used quite extensively. However, these models for multiphase fluid flow are based on simplified models for pore space geometries and simplified physics. Other methods such a lattice Boltzmann and lattice gas models, molecular dynamics, Monte Carlo methods, and particle methods such as dissipative particle dynamics and smoothed particle hydrodynamics are based more firmly on first principles, and they do not require simplified pore and/or fracture geometries. However, they are less (in some cases very much less) computationally efficient that pore network and statistical physics models. Recently a combination of continuum computation fluid dynamics, fluid-fluid interface tracking or capturing and simple models for the dependence of contact angles on fluid velocity at the contact line has been used to simulate multiphase fluid flow in fracture apertures, fracture networks and pore spaces. Fundamental conservation principles - conservation of momentum, and conservation of mass (or conservation of volume for incompressible fluids) and conservation of energy, as well as symmetries (Galilean invariance and isotropy) are central to the physics of fluids and the models used to simulate them. In molecular and mesoscale models observance of these conservation principles and symmetries at the microscopic level leads to macroscopic fluid dynamics that can be represented by the Navier Stokes equation. The remarkable fact that the flow of all simpe fluids, irrespective of their chemical nature, can be described by the Navier-Stokes equation is a result of these conservation principles and symmetries acting on the molecular level.

pore-scale, multiphase flow, reactive transport, n↗

Modeling and Simulation of Pore Scale Multiphase Fluid Flow and Reactive Transport in Fractured and Porous Media

In the subsurface fluids play a critical role by transporting dissolved minerals, colloids and contaminants (sometimes over long distances), by mediating dissolution and precipitation processes and enabling chemical transformations in solution and at mineral surfaces. Although the complex geometries of fracture apertures, fracture networks and pore spaces may make it difficult to accurately predict fluid flow in saturated (single-phase) subsurface systems, well developed methods are available. The simulation of multiphase fluid flow in the subsurface is much more challenging because of the large density and/or viscosity ratios found in important applications (water/air in the vadose zone, water/oil, water/gas, gas/oil and water/oil/gas in oil reservoirs, water/air/non-aqueous phase liquids (NAPL) in contaminated vadose zone systems and gas/molten rock in volcanic systems, for example). In addition, the complex behavior of fluid-fluid-solid contact lines, and its impact on dynamic contact angles, must also be taken into account, and coupled with the fluid flow. Pore network models and simple statistical physics based models such as the invasion percolation and diffusion-limited aggregation models have been used quite extensively. However, these models for multiphase fluid flow are based on simplified models for pore space geometries and simplified physics. Other methods such a lattice Boltzmann and lattice gas models, molecular dynamics, Monte Carlo methods, and particle methods such as dissipative particle dynamics and smoothed particle hydrodynamics are based more firmly on first principles, and they do not require simplified pore and/or fracture geometries. However, they are less (in some cases very much less) computationally efficient that pore network and statistical physics models. Recently a combination of continuum computation fluid dynamics, fluid-fluid interface tracking or capturing and simple models for the dependence of contact angles on fluid velocity at the contact line has been used to simulate multiphase fluid flow in fracture apertures, fracture networks and pore spaces. Fundamental conservation principles - conservation of momentum, and conservation of mass (or conservation of volume for incompressible fluids) and conservation of energy, as well as symmetries (Galilean invariance and isotropy) are central to the physics of fluids and the models used to simulate them. In molecular and mesoscale models observance of these conservation principles and symmetries at the microscopic level leads to macroscopic fluid dynamics that can be represented by the Navier Stokes equation. The remarkable fact that the flow of all simpe fluids, irrespective of their chemical nature, can be described by the Navier-Stokes equation is a result of these conservation principles and symmetries acting on the molecular level.

99 GENERAL AND MISCELLANEOUS↗

Delay/Disruption Tolerant Networking

Communicating from Earth to any spacecraft is a complex challenge, largely due to the extreme distances involved. When data are transmitted and received across thousands and even millions of miles, the delay and potential for disruption or data loss is significant. Delay/Disruption Tolerant Networking (DTN) is NASA’s solution to reliable internet working for space missions.

delay tolerant networking↗

On the impact of communication complexity in the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical algorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In the second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D.↗

On the impact of communication complexity on the design of parallel numerical algorithms

This paper describes two models of the cost of data movement in parallel numerical alorithms. One model is a generalization of an approach due to Hockney, and is suitable for shared memory multiprocessors where each processor has vector capabilities. The other model is applicable to highly parallel nonshared memory MIMD systems. In this second model, algorithm performance is characterized in terms of the communication network design. Techniques used in VLSI complexity theory are also brought in, and algorithm-independent upper bounds on system performance are derived for several problems that are important to scientific computation.

Gannon, D. B.↗

Simulation of gas mixture dynamics in a pipeline network using explicit staggered-grid discretization

Here we develop an explicit staggered finite difference discretization scheme for simulating the transport of highly heterogeneous gas mixtures through pipeline networks. This study is motivated by the proposed blending of hydrogen into natural gas pipelines to reduce end use carbon emissions while using existing pipeline systems throughout their planned lifetimes. Our computational method accommodates an arbitrary number of constituent gases with very different physical properties that may be injected into a network with significant spatiotemporal variation. In this setting, the gas flow physics are highly location- and time- dependent, so that local composition and nodal mixing must be accounted for. The resulting conservation laws are formulated in terms of pressure, partial densities and flows, and volumetric and mass fractions of the constituents. We include non-ideal equations of state that employ linear approximations of gas compressibility factors, so that the pressure dynamics propagate locally according to a variable wave speed that depends on mixture composition and density. We derive compatibility relationships for network edge boundary values that are more complex than for a homogeneous gas. The simulation method is evaluated on initial boundary value problems for a single pipe and a small network, is cross-validated with a lumped element simulation, and used to demonstrate a local monitoring and control policy for maintaining allowable concentration levels.

97 MATHEMATICS AND COMPUTING↗

Detecting Outliers in Network Transfers with Feature Extraction

Reliable file transfers are essential for successful science computations and experiments that need large complex data files to be moved across long distances. Networks use protocols such as TCP and UDP to support file transfers, and their performance degrades under packet losses and duplications, thereby adversely affecting science applications. Hence, scientists and engineers often monitor network statistics to find and repair network problems that cause such degradations.Outliers or anomalies can be detected using statistical and machine learning methods that highlight abnormal behaviors. However, without knowing what is normal, it is very difficult and subjective to determine the anomalies. In this paper, we investigate statistical and machine learning approaches to extract unknown or unsupervised features from TCP and perfSONAR data sets, with the aim to identify anomalies such as packet loss, duplication and retransmission sequencing that affect file transfer performance. Simple statistical and feature extraction methods (e.g. PCA) have shown that detecting anomalies is simpler if labeled data sets of normal behavior are available. While perfSONAR logs record losses,they do not detect duplications and reordering. We show that PCA applied to TCP statistics is able to determine abnormal behavior in the above cases. In particular, our results show that simple feature extraction techniques provide building blocks for more advanced network monitoring tools that can quickly flag anomalies using simple measurements, thereby helping to build confidence in file transfer reliability.

Rao, Nageswara S.↗

Application of a data-mining method based on Bayesian networks to lesion-deficit analysis

Although lesion-deficit analysis (LDA) has provided extensive information about structure-function associations in the human brain, LDA has suffered from the difficulties inherent to the analysis of spatial data, i.e., there are many more variables than subjects, and data may be difficult to model using standard distributions, such as the normal distribution. We herein describe a Bayesian method for LDA; this method is based on data-mining techniques that employ Bayesian networks to represent structure-function associations. These methods are computationally tractable, and can represent complex, nonlinear structure-function associations. When applied to the evaluation of data obtained from a study of the psychiatric sequelae of traumatic brain injury in children, this method generates a Bayesian network that demonstrates complex, nonlinear associations among lesions in the left caudate, right globus pallidus, right side of the corpus callosum, right caudate, and left thalamus, and subsequent development of attention-deficit hyperactivity disorder, confirming and extending our previous statistical analysis of these data. Furthermore, analysis of simulated data indicates that methods based on Bayesian networks may be more sensitive and specific for detecting associations among categorical variables than methods based on chi-square and Fisher exact statistics.

NASA Discipline Neuroscience↗

Observing System Simulation Experiments for Fun and Profit

Observing System Simulation Experiments can be powerful tools for evaluating and exploring both the behavior of data assimilation systems and the potential impacts of future observing systems. With great power comes great responsibility - given a pure modeling framework, how can we be sure our results are meaningful? The challenges and pitfalls of OSSE calibration and validation will be addressed, as well as issues of incestuousness, selection of appropriate metrics, and experiment design. The use of idealized observational networks to investigate theoretical ideas in a fully complex modeling framework will also be discussed

Observational Networks↗

Automated Discovery for Emulytics

Sandia has an extensive background in cybersecurity research and is currently extending its state-of-the-art modeling via emulation capability. However, a key part of Sandia's modeling methodology is the discovery and specification of the information-system under study, and the ability to recreate that specification with the highest fidelity possible in order to extrapolate meaningful results. This work details a method to conduct information system discovery and develop tools to enable the creation of high-fidelity emulation models that can be used to enable assessment of our infrastructure information system security posture and potential system impacts that could result from cyber threats. The outcome are a set of tools and techniques to go from network discovery of operational systems to emulating complex systems. As a concrete usecase, we have applied these tools and techniques at Supercomputing 2016 to model SCinet, the world's largest research network. This model includes five routers and nearly 10,000 endpoints which we have launched in our emulation platform.

97 MATHEMATICS AND COMPUTING↗