Effects of channel bandwidth variation on performance of individual messages in spatially and temporally heterogeneous communication networks

As the domain of communication systems grows, heterogeneity among computers and subnetworks employed for a task also increases. Channel bandwidth available for a message on a communication network varies with time and link. This variation can have a significant effect on performance of an individual message and also that of the network as a whole. Therefore, it is important to understand effects of bandwidth heterogeneity on the network performance in order to optimally utilize a heterogeneous communication network. The ability to use such a network optimally is highly desirable in many applications such as network-based data-intensive high performance computing. The main goal of this paper is to analyze effects of temporal and spatial heterogeneity on performance of individual messages in detail via an extensive simulation, in terms of throughput, end-to-end delay, etc. Also, the problems of path selection and multi-path data transfer are considered to illustrate how the analysis results may be used in the future effort of optimizing the network performance by taking channel bandwidth heterogeneity into account.     

Nested structure acquired through simple evolutionary process

Nested structure, which is non-random, controls cooperation dynamics and biodiversity in plant-animal mutualistic networks. This structural pattern has been explained in a static (non-growth) network models. However, evolutionary processes might also influence the formation of such a structural pattern. We thereby propose an evolving network model for plant-animal interactions and show that non-random patterns such as nested structure and heterogeneous connectivity are both qualitatively and quantitatively predicted through simple evolutionary processes. This finding implies that network models can be simplified by considering evolutionary processes, and also that another explanation exists for the emergence of non-random patterns and might provide more comprehensible insights into the formation of plant-animal mutualistic networks from the evolutionary perspective.     

Using network models to approximate spatial point-process models

Spatial effects are fundamental to ecological and epidemiological systems, yet the incorporation of space into models is potentially complex. Fixed-edge network models (i.e. networks where each edge has the same fixed strength of interaction) are widely used to study spatial processes but they make simplistic assumptions about spatial scale and structure. Furthermore, it can be difficult to parameterize such models with empirical data. By comparison, spatial point-process models are often more realistic than fixed-edge network models, but are also more difficult to analyze. Here we develop a moment closure technique that allows us to define a fixed-edge network model which predicts the prevalence and rate of epidemic spread of a continuous spatial point-process epidemic model. This approach provides a systematic method for accurate parameterization of network models using data from continuously distributed populations (such as data on dispersal kernels). Insofar as point-process models are accurate representations of real spatial biological systems, our example also supports the view that network models are realistic representations of space.     

Do proteins learn to evolve? The Hopfield network as a basis for the understanding of protein evolution

Correlations between amino-acid residues can be observed in sets of aligned protein sequences, and the analysis of their statistical and evolutionary significance and distribution has been thoroughly investigated. In this paper, we present a model based on such covariations in protein sequences in which the pairs of residues that have mutual influence combine to produce a system analogous to a Hopfield neural network. The emergent properties of such a network, such as soft failure and the connection between network architecture and stored memory, have close parallels in known proteins. This model suggests that an explanation for observed characters of proteins such as the diminution of function by substitutions distant from the active site, the existence of protein folds (superfolds) that can perform several functions based on one architecture, and structural and functional resilience to destabilizing substitutions might derive from their inherent network-like structure. This model may also provide a basis for mapping the relationship between structure, function and evolutionary history of a protein family, and thus be a powerful tool for rational engineering.     

Cascading Failures in Spatially-Embedded Random Networks

Cascading failures constitute an important vulnerability of interconnected systems. Here we focus on the study of such failures on networks in which the connectivity of nodes is constrained by geographical distance. Specifically, we use random geometric graphs as representative examples of such spatial networks, and study the properties of cascading failures on them in the presence of distributed flow. The key finding of this study is that the process of cascading failures is non-self-averaging on spatial networks, and thus, aggregate inferences made from analyzing an ensemble of such networks lead to incorrect conclusions when applied to a single network, no matter how large the network is. We demonstrate that this lack of self-averaging disappears with the introduction of a small fraction of long-range links into the network. We simulate the well studied preemptive node removal strategy for cascade mitigation and show that it is largely ineffective in the case of spatial networks. We introduce an altruistic strategy designed to limit the loss of network nodes in the event of a cascade triggering failure and show that it performs better than the preemptive strategy. Finally, we consider a real-world spatial network viz. a European power transmission network and validate that our findings from the study of random geometric graphs are also borne out by simulations of cascading failures on the empirical network.     

Improving the performance of the Hopfield-Tank neural network through normalization and annealing

A simple formulation of the TSP energy function is described which, in combination with a normalized Hopfield-Tank neural network, eliminates the difficulty in finding valid tours. This technique is applicable to many other optimization problems involving n-way decisions (such as VLSI layout and resource allocation) and is easily implemented in a VLSI neural network. The solution quality is shown to be dependent on the formation of seed-points which are influenced by the constraint penalties and the temperature (i.e. the neural gain). Near-optimal tours are found by annealing the network down to a critical temperature at which a single seed-point is dominant. The seed-points and critical temperature (which also affect standard Hopfield network solutions to the TSP) can be predicted with reasonable accuracy. It is also shown that the annealing process is not necessary and good tours result if the network is allowed to converge solely at the critical temperature. The seed-points can be eliminated entirely by assigning different temperatures to groups of neurons such that the tour evolves uniformly throughout the cities. The resulting network finds the optimum tour in a 30-city example in 30% of the trials.     

Actin network growth under load

Many processes in eukaryotic cells, including the crawling motion of the whole cell, rely on the growth of branched actin networks from surfaces. In addition to their well-known role in generating propulsive forces, actin networks can also sustain substantial pulling loads thanks to their persistent attachment to the surface from which they grow. The simultaneous network elongation and surface attachment inevitably generate a force that opposes network growth. Here, we study the local dynamics of a growing actin network, accounting for simultaneous network elongation and surface attachment, and show that there exist several dynamical regimes that depend on both network elasticity and the kinetic parameters of actin polymerization. We characterize this in terms of a phase diagram and provide a connection between mesoscopic theories and the microscopic dynamics of an actin network at a surface. Our framework predicts the onset of instabilities that lead to the local detachment of the network and translate to oscillatory behavior and waves, as observed in many cellular phenomena and in vitro systems involving actin network growth, such as the saltatory dynamics of actin-propelled oil drops.     

Automatic Context-Specific Subnetwork Discovery from Large Interaction Networks

Genes act in concert via specific networks to drive various biological processes, including progression of diseases such as cancer. Under different phenotypes, different subsets of the gene members of a network participate in a biological process. Single gene analyses are less effective in identifying such core gene members (subnetworks) within a gene set/network, as compared to gene set/network-based analyses. Hence, it is useful to identify a discriminative classifier by focusing on the subnetworks that correspond to different phenotypes. Here we present a novel algorithm to automatically discover the important subnetworks of closely interacting molecules to differentiate between two phenotypes (context) using gene expression profiles. We name it COSSY (COntext-Specific Subnetwork discoverY). It is a non-greedy algorithm and thus unlikely to have local optima problems. COSSY works for any interaction network regardless of the network topology. One added benefit of COSSY is that it can also be used as a highly accurate classification platform which can produce a set of interpretable features.     

Interplay between Graph Topology and Correlations of Third Order in Spiking Neuronal Networks

The study of processes evolving on networks has recently become a very popular research field, not only because of the rich mathematical theory that underpins it, but also because of its many possible applications, a number of them in the field of biology. Indeed, molecular signaling pathways, gene regulation, predator-prey interactions and the communication between neurons in the brain can be seen as examples of networks with complex dynamics. The properties of such dynamics depend largely on the topology of the underlying network graph. In this work, we want to answer the following question: Knowing network connectivity, what can be said about the level of third-order correlations that will characterize the network dynamics? We consider a linear point process as a model for pulse-coded, or spiking activity in a neuronal network. Using recent results from theory of such processes, we study third-order correlations between spike trains in such a system and explain which features of the network graph (i.e. which topological motifs) are responsible for their emergence. Comparing two different models of network topology—random networks of Erdős-Rényi type and networks with highly interconnected hubs—we find that, in random networks, the average measure of third-order correlations does not depend on the local connectivity properties, but rather on global parameters, such as the connection probability. This, however, ceases to be the case in networks with a geometric out-degree distribution, where topological specificities have a strong impact on average correlations.     

Financial Time Series Prediction Using Spiking Neural Networks

In this paper a novel application of a particular type of spiking neural network, a Polychronous Spiking Network, was used for financial time series prediction. It is argued that the inherent temporal capabilities of this type of network are suited to non-stationary data such as this. The performance of the spiking neural network was benchmarked against three systems: two “traditional”, rate-encoded, neural networks; a Multi-Layer Perceptron neural network and a Dynamic Ridge Polynomial neural network, and a standard Linear Predictor Coefficients model. For this comparison three non-stationary and noisy time series were used: IBM stock data; US/Euro exchange rate data, and the price of Brent crude oil. The experiments demonstrated favourable prediction results for the Spiking Neural Network in terms of Annualised Return and prediction error for 5-Step ahead predictions. These results were also supported by other relevant metrics such as Maximum Drawdown and Signal-To-Noise ratio. This work demonstrated the applicability of the Polychronous Spiking Network to financial data forecasting and this in turn indicates the potential of using such networks over traditional systems in difficult to manage non-stationary environments.     

A new measure of the robustness of biochemical networks

MOTIVATION: The robustness of a biochemical network is defined as the tolerance of variations in kinetic parameters with respect to the maintenance of steady state. Robustness also plays an important role in the fail-safe mechanism in the evolutionary process of biochemical networks. The purposes of this paper are to use the synergism and saturation system (S-system) representation to describe a biochemical network and to develop a robustness measure of a biochemical network subject to variations in kinetic parameters. Since most biochemical networks in nature operate close to the steady state, we consider only the robustness measurement of a biochemical network at the steady state. RESULTS: We show that the upper bound of the tolerated parameter variations is related to the system matrix of a biochemical network at the steady state. Using this upper bound, we can calculate the tolerance (robustness) of a biochemical network without testing many parametric perturbations. We find that a biochemical network with a large tolerance can also better attenuate the effects of variations in rate parameters and environments. Compensatory parameter variations and network redundancy are found to be important mechanisms for the robustness of biochemical networks. Finally, four biochemical networks, such as a cascaded biochemical network, the glycolytic-glycogenolytic pathway in a perfused rat liver, the tricarboxylic acid cycle in Dictyostelium discoideum and the cAMP oscillation network in bacterial chemotaxis, are used to illustrate the usefulness of the proposed robustness measure.     

Reconstructible Phylogenetic Networks: Do Not Distinguish the Indistinguishable

Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are indistinguishable. This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.     

Dynamical systems for predictive control of autonomous robots

Summary Regularities in the environment are accessible to an autonomous agents as reproducible relations between actions and perceptions and can be exploited by unsupervised learning. Our approach is based on the possibility to perform and to verify predictions about perceivable consequences of actions. It is implemented as a three-layer neural network that combines predictive perception, internal-state transitions and action selection into a loop which closes via the environment. In addition to minimizing prediction errors, the goal of network adaptation comprises also an optimization of the minimization rate such that new behaviors are favored over already learned ones, which would result in a vanishing improvement of predictability. Previously learned behaviors are reactivated or continued if triggering stimuli are available and an externally or otherwise given reward overcompensates the decay of the learning rate. In the model, behavior learning and learning behavior are brought about by the same mechanism, namely the drive to continuously experience learning success. Behavior learning comprises representation and storage of learned behaviors and finally their inhibition such that a further exploration of the environment is possible. Learning behavior, in contrast, detects the frontiers of the manifold of learned behaviors and provides estimates of the learnability of behaviors leading outwards the field of expertise. The network module has been implemented in a Khepera miniature robot. We also consider hierarchical architectures consisting of several modules in one agent as well as groups of several agents, which are controlled by such networks.     

On the centrality and uniqueness of species from the network perspective

Identifying important species for maintaining ecosystem functions is a challenge in ecology. Since species are components of food webs, one way to conceptualize and quantify species importance is from a network perspective. The importance of a species can be quantified by measuring the centrality of its position in a food web, because a central node may have greater influence on others in the network. A species may also be important because it has a unique network position, such that its loss cannot be easily compensated. Therefore, for a food web to be robust, we hypothesize that central species must be functionally redundant in terms of their network position. In this paper, we test our hypothesis by analysing the Prince William Sound ecosystem. We found that species centrality and uniqueness are negatively correlated, and such an observation is also carried over to other food webs.     

VNF-EQ: dynamic placement of virtual network functions for energy efficiency and QoS guarantee in NFV

With the advances of network function virtualization and cloud computing technologies, a number of network services are implemented across data centers by creating a service chain using different virtual network functions (VNFs) running on virtual machines. Due to the complexity of network infrastructure, creating a service chain requires high operational cost especially in carrier-grade network service providers and supporting stringent QoS requirements from users is also a complicated task. There have been various research efforts to address these problems that only focus on one aspect of optimization goal either from users such as latency minimization and QoS based optimization, or from service providers such as resource optimization and cost minimization. However, meeting the requirements both from users and service providers efficiently is still a challenging issue. This paper proposes a VNF placement algorithm called VNF-EQ that allows users to meet their service latency requirements, while minimizing the energy consumption at the same time. The proposed algorithm is dynamic in a sense that the locations or the service chains of VNFs are reconfigured to minimize the energy consumption when the traffic passing through the chain falls below a pre-defined threshold. We use genetic algorithm to formulate this problem because it is a variation of the multi-constrained path selection problem known as NP-complete. The benchmarking results show that the proposed approach outperforms other heuristic algorithms by as much as 49% and reduces the energy consumptions by rearranging VNFs.     

Effects of selective neutrality on the evolution of molecular species

We introduce a model of evolution on a fitness landscape possessing a tunable degree of neutrality. The model allows us to study the general properties of molecular species undergoing neutral evolution. We find that a number of phenomena seen in RNA sequence-structure maps are present also in our general model. Examples are the occurrence of ''common'' structures that occupy a fraction of the genotype space which tends to unity as the length of the genotype increases, and the formation of percolating neutral networks that cover the genotype space in such a way that a member of such a network can be found within a small radius of any point in the space. We also describe a number of new phenomena that appear to be general properties of systems possessing selective neutrality. In particular, we show that the maximum fitness attained during the adaptive walk of a population evolving on such a fitness landscape increases with increasing degree of neutrality, and is directly related to the fitness of the most fit percolating network.     

Oscillations and synchrony in a cortical neural network

In this paper, the oscillations and synchronization status of two different network connectivity patterns based on Izhikevich model are studied. One of the connectivity patterns is a randomly connected neuronal network, the other one is a small-world neuronal network. This Izhikevich model is a simple model which can not only reproduce the rich behaviors of biological neurons but also has only two equations and one nonlinear term. Detailed investigations reveal that by varying some key parameters, such as the connection weights of neurons, the external current injection, the noise of intensity and the neuron number, this neuronal network will exhibit various collective behaviors in randomly coupled neuronal network. In addition, we show that by changing the number of nearest neighbor and connection probability in small-world topology can also affect the collective dynamics of neuronal activity. These results may be instructive in understanding the collective dynamics of mammalian cortex.