Search NASA⌕ Search

SEARCH · Search NASA

Results for “random 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 19 records

Ideal isotropic auxetic networks from random networks

We design and create isotropically auxetic networks with Poisson's ratio close to −1 in experiments. To achieve this, we selectively prune bonds from disordered networks, and then optimize the properties of individual bonds and nodes.

Reid, Daniel R.↗

Network Randomization and Dynamic Defense for Critical Infrastructure Systems

Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and development to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Diffusion in random networks

The ensemble averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket mass density. The so-called dual-porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem, we consider the one-dimensional mass diffusion in a semi-infinite domain. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt $-$1/4 rather than xt $-$1/2 as in the traditional theory. We found this early time similarity can be explained by random walk theory through the network.

97 MATHEMATICS AND COMPUTING↗

Damage spreading in spatial and small-world random boolean networks

Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.

42 ENGINEERING↗

Synchronized states and multistability in a random network of coupled discontinuous maps

The synchronization behavior of coupled chaotic discontinuous maps over a ring network with dynamic random connections is reported in this paper. It is observed that random rewiring stabilizes one of the two strongly unstable fixed points of the local map. Depending on initial conditions, the network synchronizes to different unstable fixed points, which signifies the existence of synchronized multistability in the complex network. Moreover, the length of discontinuity of the local map has an important role in generating windows of different synchronized fixed points. Synchronized fixed point and synchronized periodic orbits are found in the network depending on coupling strength and different parameter values of the local map. We have identified the existence of period subtracting bifurcation with respect to coupling strength in the network. The range of coupling strength for the occurrence of synchronized multistable spatiotemporal fixed points is determined. This range strongly depends upon the dynamic rewiring probability and also on the local map.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hyperuniform and nearly hyperuniform random network materials

This invention is in the field of physical chemistry and relates to novel hyperuniform and nearly hyperuniform random network materials and methods of making said materials. Methods are described for controlling or altering the band gap of a material, and in particular commercially useful materials such as amorphous silicon. These methods can be exploited in the design of semiconductors, transistors, diodes, solar cells and the like.

36 MATERIALS SCIENCE↗

Hyperuniform and nearly hyperuniform random network materials

This invention is in the field of physical chemistry and relates to novel hyperuniform and nearly hyperuniform random network materials and methods of making said materials. Methods are described for controlling or altering the band gap of a material, and in particular commercially useful materials such as amorphous silicon. These methods can be exploited in the design of semiconductors, transistors, diodes, solar cells and the like.

36 MATERIALS SCIENCE↗

High electron mobility through the edge states in random networks of c-axis oriented wedge-shaped GaN nanowalls grown by molecular beam epitaxy

Transport and optical properties of random networks of c-axis oriented wedge-shaped GaN nanowalls grown spontaneously on c-plane sapphire substrates through molecular beam epitaxy are investigated. Our study suggests a one dimensional confinement of carriers at the top edges of these connected nanowalls, which results in a blue shift of the band edge luminescence, a reduction of the exciton-phonon coupling, and an enhancement of the exciton binding energy. Not only that, the yellow luminescence in these samples is found to be completely suppressed even at room temperature. All these changes are highly desirable for the enhancement of the luminescence efficiency of the material. More interestingly, the electron mobility through the network is found to be significantly higher than that is typically observed for GaN epitaxial films. This dramatic improvement is attributed to the transport of electrons through the edge states formed at the top edges of the nanowalls.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Dynamic defense and network randomization for computer systems

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissance stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.

97 MATHEMATICS AND COMPUTING↗

Random networks and aligned arrays of single-walled carbon nanotubes for electronic device applications

Singled-walled carbon nanotubes (SWNTs), in the form of ultrathin films of random networks, aligned arrays, or anything in between, provide an unusual type of electronic material that can be integrated into circuits in a conventional, scalable fashion. The electrical, mechanical, and optical properties of such films can, in certain cases, approach the remarkable characteristics of the individual SWNTs, thereby making them attractive for applications in electronics, sensors, and other systems. This review discusses the synthesis and assembly of SWNTs into thin film architectures of various types and provides examples of their use in digital electronic circuits with levels of integration approaching 100 transistors and in analog radio frequency (RF) systems with operating frequencies up to several gigahertz, including transistor radios in which SWNT transistors provide all of the active functionality. The results represent important steps in the development of an SWNT-based electronics technology that could find utility in areas such as flexible electronics, RF analog devices and others that might complement the capabilities of established systems.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Lyotropic Phase Behavior of Poly(ethylene oxide)-Poly(butadiene) Diblock Copolymers: Evolution of the Random Network Morphology

The phase behavior of poly(ethylene oxide)-poly(butadiene) (PEO-PB) diblock copolymers mixed with water was studied using small-angle X-ray scattering (SAXS), cryogenic scanning electron microscopy (cryo-SEM), cryogenic transmission electron microscopy (cryo-TEM), and dynamic mechanical spectroscopy. Two sets of diblocks were synthesized by adding different lengths of PEO to hydroxy terminated PB with degrees of polymerization N{sub PB} = 46 and 170. Two-component mixtures were investigated as a function of block composition and copolymer molecular weight, between 1 and 100 wt % polymer content. Melt phase behavior is consistent with established theory and known experimental behavior for diblock copolymers. Various lyotropic liquid crystalline structures, notably lamellae (L), hexagonally packed cylinders (H), and spheres (S) arranged on cubic (body-centered cubic, face-centered cubic) lattices, were documented as a function of water content. At the higher molecular weights (N{sub PB} = 170), a random network phase (N) was identified over a sizable portion of the phase portrait, located between hexagonally ordered cylinders and ordered lamellae. This new structure, along with branching of cylindrical micelles in the dilute limit, bear a striking similarity to experimentally observed and theoretically predicted phase behavior in certain ternary water/oil/surfactant systems. These findings demonstrate that block copolymer surfactants are characterized by at least four structural building blocks -- spheres, cylinders, bilayers, and branched cylinders -- above a threshold molecular weight.

36 MATERIALS SCIENCE↗

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Eastern Cooperative Oncology Group and American College of Radiology Imaging Network Randomized Phase 2 Trial of Neoadjuvant Preoperative Paclitaxel/Cisplatin/Radiation Therapy (RT) or Irinotecan/Cisplatin/RT in Esophageal Adenocarcinoma: Long-Term Outcome and Implications for Trial Design

Purpose: Toxicity, pathologic complete response, and long-term outcomes are reported for the neoadjuvant therapies assessed in a randomized phase 2 Eastern Cooperative Oncology Group and American College of Radiology Imaging Network trial for operable esophageal adenocarcinoma, staged as II-IVa by endoscopy/ultrasonography (EUS). Methods and Materials: A total of 86 eligible patients began treatment. For arm A, preoperative chemotherapy was cisplatin, 30 mg/m{sup 2}, and irinotecan, 50 mg/m{sup 2}, on day 1, 8, 22, 29 during 45 Gy radiation therapy (RT), 1.8 Gy per day over 5 weeks. Adjuvant therapy was cisplatin, 30 mg/m{sup 2}, and irinotecan, 65 mg/m{sup 2} day 1, 8 every 21 days for 3 cycles. Arm B therapy was cisplatin, 30 mg/m{sup 2}, and paclitaxel, 50 mg/m{sup 2}, day 1, 8, 15, 22, 29 with RT, followed by adjuvant cisplatin, 75 mg/m{sup 2}, and paclitaxel, 175 mg/m{sup 2}, day 1 every 21 days for 3 cycles. Stratification included EUS stage and performance status. Results: In arm A, median overall survival was 35 months, and 5-, 6-, and 7-year survival rates were 46%, 39%, and 35%, respectively, whereas for arm B, they were 21 months and 27%, 27%, and 23%, respectively. Median progression- or recurrence-free survival (PFS) was 39.8 months with a 3-year PFS of 50% for arm A and 12.4 months (P=.046) with 3-year PFS of 28% for arm B. Eighty percent of the observed incidents of progression occurred within 19 months. Survival did not differ significantly by EUS and performance status strata. Conclusions: Long-term survival was similar for both arms and did not appear superior to results achieved with other standard regimens.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Opinion dynamics in financial markets via random networks

We investigate financial market dynamics by introducing a heterogeneous agent-based opinion formation model. In this work, we organize individuals in a financial market according to their trading strategy, namely, whether they are noise traders or fundamentalists. The opinion of a local majority compels the market exchanging behavior of noise traders, whereas the global behavior of the market influences the decisions of fundamentalist agents. We introduce a noise parameter, q , to represent the level of anxiety and perceived uncertainty regarding market behavior, enabling the possibility of adrift financial action. We place individuals as nodes in an Erdös-Rényi random graph, where the links represent their social interactions. At any given time, individuals assume one of two possible opinion states ±1 regarding buying or selling an asset. The model exhibits fundamental qualitative and quantitative real-world market features such as the distribution of logarithmic returns with fat tails, clustered volatility, and the long-term correlation of returns. We use Student’s t distributions to fit the histograms of logarithmic returns, showing a gradual shift from a leptokurtic to a mesokurtic regime depending on the fraction of fundamentalist agents. Furthermore, we compare our results with those concerning the distribution of the logarithmic returns of several real-world financial indices.

97 MATHEMATICS AND COMPUTING↗

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗