Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 577 records · Page 32

Prediction and integration of regulatory and protein-protein interactions

Knowledge of transcriptional regulatory interactions (TRIs) is essential for exploring functional genomics and systems biology in any organism. While several results from genome-wide analysis of transcriptional regulatory networks are available, they are limited to model organisms such as yeast [1] and worm [2]. Beyond these networks, experiments on TRIs study only individual genes and proteins of specific interest. In this chapter, we present a method for the integration of various data sets to predict TRIs for 54 organisms in the Bioverse [3]. We describe how to compile and handle various formats and identifiers of data sets from different sources, and how to predict the TRIs using a homology-based approach, utilizing the compiled data sets. Integrated data sets include experimentally verified TRIs, binding sites of transcription factors, promoter sequences, protein sub-cellular localization, and protein families. Predicted TRIs expand the networks of gene regulation for a large number of organisms. The integration of experimentally verified and predicted TRIs with other known protein-protein interactions (PPIs) gives insight into specific pathways, network motifs, and the topological dynamics of an integrated network with gene expression under different conditions, essential for exploring functional genomics and systems biology.

59 BASIC BIOLOGICAL SCIENCES↗

Intermittent and sustained periodic windows in networked chaotic Rössler oscillators

Route to chaos (or periodicity) in dynamical systems is one of fundamental problems. Here, dynamical behaviors of coupled chaotic Rössler oscillators on complex networks are investigated and two different types of periodic windows with the variation of coupling strength are found. Under a moderate coupling, the periodic window is intermittent, and the attractors within the window extremely sensitively depend on the initial conditions, coupling parameter, and topology of the network. Therefore, after adding or removing one edge of network, the periodic attractor can be destroyed and substituted by a chaotic one, or vice versa. In contrast, under an extremely weak coupling, another type of periodic window appears, which insensitively depends on the initial conditions, coupling parameter, and network. It is sustained and unchanged for different types of network structure. It is also found that the phase differences of the oscillators are almost discrete and randomly distributed except that directly linked oscillators more likely have different phases. These dynamical behaviors have also been generally observed in other networked chaotic oscillators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗

NASA Communications Augmentation network

The NASA Communications (Nascom) Division of the Mission Operations and Data Systems Directorate (MO&DSD) is to undertake a major initiative to develop the Nascom Augmentation (NAUG) network to achieve its long-range service objectives for operational data transport to support the Space Station Freedom Program, the Earth Observing System (EOS), and other projects. The NAUG is the Nascom ground communications network being developed to accommodate the operational traffic of the mid-1990s and beyond. The NAUG network development will be based on the Open Systems Interconnection Reference Model (OSI-RM). This paper describes the NAUG network architecture, subsystems, topology, and services; addresses issues of internetworking the Nascom network with other elements of the Space Station Information System (SSIS); discusses the operations environment. This paper also notes the areas of related research and presents the current conception of how the network will provide broadband services in 1998.

Omidyar, Guy C.↗

Improved image classification with neural networks by fusing multispectral signatures with topological data

Automated schemes are needed to classify multispectral remotely sensed data. Human intelligence is often required to correctly interpret images from satellites and aircraft. Humans suceed because they use various types of cues about a scene to accurately define the contents of the image. Consequently, it follows that computer techniques that integrate and use different types of information would perform better than single source approaches. This research illustrated that multispectral signatures and topographical information could be used in concert. Significantly, this dual source tactic classified a remotely sensed image better than the multispectral classification alone. These classifications were accomplished by fusing spectral signatures with topographical information using neural network technology. A neural network was trained to classify Landsat mulitspectral signatures. A file of georeferenced ground truth classifications were used as the training criterion. The network was trained to classify urban, agriculture, range, and forest with an accuracy of 65.7 percent. Another neural network was programmed and trained to fuse these multispectral signature results with a file of georeferenced altitude data. This topological file contained 10 levels of elevations. When this nonspectral elevation information was fused with the spectral signatures, the classifications were improved to 73.7 and 75.7 percent.

Harston, Craig↗

Resistive Network Optimal Power Flow: Uniqueness and Algorithms

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

Tan, CW↗

Maxwell rigidity and topological constraints in amorphous phase-change networks

By analyzing first-principles molecular-dynamics simulations of different telluride amorphous networks, we develop a method for the enumeration of radial and angular topological constraints, and show that the phase diagram of the most popular system Ge-Sb-Te can be split into two compositional elastic phases: a tellurium rich flexible phase and a stressed rigid phase that contains most of the materials used in phase-change applications. This sound atomic scale insight should open new avenues for the understanding of phase-change materials and other complex amorphous materials from the viewpoint of rigidity.

36 MATERIALS SCIENCE↗

Atypical water lattices and their possible relevance to the amorphous ices: A density functional study

Of the fifteen known crystalline forms of ice, eleven consist of a single topologically connected hydrogen bond network with four H-bonds at every O. The other four, Ices VI–VIII and XV, consist of two topologically connected networks, each with four H-bonds at every O. The networks interpenetrate but do not share H-bonds. This article presents two new periodic water lattice families whose topological connectivity is “atypical”: they consist of many two-dimensional layers that share no H-bonds. Layers are held together only by dispersion forces. Within each layer there are still four H-bonds at each O. Called “Hexagonal Bilayer Water” (HBW) and “Pleated Sheet Water” (PSW), they have computed densities of about 1.1 g/mL and 1.3 g/mL respectively, and nearest neighbor O-coordination is 4.5 to 5.5 and 6 to 8 respectively. Using density functional theory (BLYP-D/TZVP), various proton ordered forms of HBW and PSW are optimized and categorized. There are simple pathways connecting Ice-Ih to HBW and HBW to PSW. Their computed properties suggest similarities to the high density and very high density amorphous ices (HDA and VHDA) respectively. It is unknown whether HDA, VHDA, and Low Density Amorphous Ice (LDA) are fully disordered glasses down to the molecular level, or whether there is some short-range local order. Based on estimated radial distribution functions (RDFs), one proton ordered form of HBW matches HDA best. The idea is explored that HDA could contain islands with this underlying structure, and likewise, that VHDA could contain regions of PSW. A “microlattice model version 1” (MLM1) is presented as a device to compare key experimental data on the amorphous ices with these atypical structures and with a microlattice form of Ice-XI for LDA. Resemblances are found with the amorphs’ RDFs, densities, Raman spectra, and transition behaviors. There is not enough information in the static models to assign either a microlattice structure or a partial microlattice structure to any amorphous ice phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Percolation of secret correlations in a network

In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards a unified description of the hydrogen bond network of liquid water: A dynamics based approach

The definition of a hydrogen bond (H-bond) is intimately related to the topological and dynamic properties of the hydrogen bond network within liquid water. The development of a universal H-bond definition for water is an active area of research as it would remove many ambiguities in the network properties that derive from the fixed definition employed to assign whether a water dimer is hydrogen bonded. This work investigates the impact that an electronic-structure based definition, an energetic, and a geometric definition of the H-bond has upon both topological and dynamic network behavior of simulated water. In each definition, the use of a cutoff (either geometric or energetic) to assign the presence of a H-bond leads to the formation of transiently bonded or broken dimers, which have been quantified within the simulation data. The relative concentration of transient species, and their duration, results in two of the three definitions sharing similarities in either topological or dynamic features (H-bond distribution, H-bond lifetime, etc.), however no two definitions exhibit similar behavior for both classes of network properties. In fact, two networks with similar local network topology (as indicated by similar average H-bonds) can have dramatically different global network topology (as indicated by the defect state distributions) and altered H-bond lifetimes. A dynamics based correction scheme is then used to remove artificially transient H-bonds and to repair artificially broken bonds within the network such that the corrected network exhibits the same structural and dynamic properties for two H-bond definitions (the properties of the third definition being significantly improved). The algorithm described represents a significant step forward in the development of a unified hydrogen bond network whose properties are independent of the original hydrogen bond definition that is employed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Topological Relationship–Based Flow Direction Modeling: Mesh–Independent River Networks Representation

River networks are important features in surface hydrology. However, accurately representing river networks in spatially distributed hydrologic and Earth system models is often sensitive to the model's spatial resolution. Specifically, river networks are often misrepresented because of the mismatch between the model's spatial resolution and river network details, resulting in significant uncertainty in the projected flow direction. In this study, we developed a topological relationship-based river network representation method for spatially distributed hydrologic models. This novel method uses (a) graph theory algorithms to simplify real-world vector-based river networks and assist in mesh generation; and (b) a topological relationship-based method to reconstruct conceptual river networks. The main advantages of our method are that (a) it combines the strengths of vector-based and DEM raster-based river network extraction methods; and (b) it is mesh-independent and can be applied to both structured and unstructured meshes. This method paves a path for advanced terrain analysis and hydrologic modeling across different scales.

54 ENVIRONMENTAL SCIENCES↗

Disordered topological graphs enhancing nonlinear phenomena

Complex networks play a fundamental role in understanding phenomena from the collective behavior of spins, neural networks, and power grids to the spread of diseases. Topological phenomena in such networks have recently been exploited to preserve the response of systems in the presence of disorder. We propose and demonstrate topological structurally disordered systems with a modal structure that enhances nonlinear phenomena in the topological channels by inhibiting the ultrafast leakage of energy from edge modes to bulk modes. We present the construction of the graph and show that its dynamics enhances the topologically protected photon pair generation rate by an order of magnitude. Disordered nonlinear topological graphs will enable advanced quantum interconnects, efficient nonlinear sources, and light-based information processing for artificial intelligence.

42 ENGINEERING↗

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗

Soft Communities in Similarity Space

The S{sup 1} model has been central in the development of the field of network geometry. It places nodes in a similarity space and connects them with a likelihood depending on an effective distance which combines similarity and popularity dimensions, with popularity directly related to the degrees of the nodes. The S{sup 1} model has been mainly studied in its homogeneous regime, in which angular coordinates are independently and uniformly scattered on the circle. We now investigate if the model can generate networks with targeted topological features and soft communities, that is, inhomogeneous angular distributions. To that end, hidden degrees must depend on angular coordinates, and we propose a method to estimate them. We conclude that the model can be topologically invariant with respect to the soft-community structure. Our results expand the scope of the model beyond the independent hidden variables limit and can have an important impact in the embedding of real-world networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Epidemic Propagation In Overlaid Wireless Networks

Witb tbe emergence of computer worms tbat can spread over air interfaces, wireless ad boc and sensor networks can be vulnerable to node compromises even if the deployed network is not connected to the backbone. Depending on the physical topology of the wireless network, even a single infected node can compromise the whole network. In this work, epidemic (e.g., worm) propagation in a static wireless network is studied, where a number of inCected mobile nodes are injected over the existing network. It is shown that the epidemic spread threshold and size depend on the physical topology of the underlying static wireless network as well as the mobility model employed by the infected mobile nodes. More specifically, results show that in a Cully-connected static wirelessnctwork targeted attacks are more effective, wbereas Cor a random topology random attacks can be sufficient to compromise the whole network.

42 ENGINEERING↗

Finite and infinite matrix product states for Gutzwiller projected mean-field wave functions

Matrix product states (MPS) and “dressed” ground states of quadratic mean fields (e.g., Gutzwiller projected Slater determinants) are both important classes of variational wave functions. This latter class has played important roles in understanding superconductivity and quantum spin liquids. We present a method to obtain both the finite and infinite MPS (iMPS) representation of the ground state of an arbitrary fermionic quadratic mean-field Hamiltonian (which in the simplest case is a Slater determinant and in the most general case is a Pfaffian). We also show how to represent products of such states (e.g., determinants times Pfaffians). From this representation one can project to single occupancy and evaluate the entanglement spectra after Gutzwiller projection. We then obtain the MPS and iMPS representation of Gutzwiller projected mean-field states that arise from the variational slave-fermion approach to the S = 1 bilinear-biquadratic quantum spin chain. To accomplish this, we develop an approach to orthogonalize degenerate iMPS to find all the states in the degenerate ground-state manifold. We find the energies of the MPS and iMPS states match the variational energies closely, indicating the method is accurate and there is minimal loss due to truncation error. We then present an exploration of the entanglement spectra of projected slave-fermion states, exploring their qualitative features and finding good qualitative agreement with the respective exact ground-state spectra found from density matrix renormalization group.

1-dimensional spin chains↗