Multi-layer network embedding on scc-based network with motif

Interconnection of all things challenges the traditional communication methods,and Semantic Communication and Computing(SCC)will become new solutions.It is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based networks.In previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node classification.However,the content of semantic information is quite complex.Although graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of loss.Therefore,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology network.The Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node classification.We verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.

Target Controllability of Multi-Layer Networks With High-Dimensional Nodes

This paper studies the target controllability of multilayer complex networked systems,in which the nodes are highdimensional linear time invariant(LTI)dynamical systems,and the network topology is directed and weighted.The influence of inter-layer couplings on the target controllability of multi-layer networks is discussed.It is found that even if there exists a layer which is not target controllable,the entire multi-layer network can still be target controllable due to the inter-layer couplings.For the multi-layer networks with general structure,a necessary and sufficient condition for target controllability is given by establishing the relationship between uncontrollable subspace and output matrix.By the derived condition,it can be found that the system may be target controllable even if it is not state controllable.On this basis,two corollaries are derived,which clarify the relationship between target controllability,state controllability and output controllability.For the multi-layer networks where the inter-layer couplings are directed chains and directed stars,sufficient conditions for target controllability of networked systems are given,respectively.These conditions are easier to verify than the classic criterion.

Dynamic interwell connectivity analysis of multi-layer waterflooding reservoirs based on an improved graph neural network

The analysis of interwell connectivity plays an important role in the formulation of oilfield development plans and the description of residual oil distribution. In fact, sandstone reservoirs in China's onshore oilfields generally have the characteristics of thin and many layers, so multi-layer joint production is usually adopted. It remains a challenge to ensure the accuracy of splitting and dynamic connectivity in each layer of the injection-production wells with limited field data. The three-dimensional well pattern of multi-layer reservoir and the relationship between injection-production wells can be equivalent to a directional heterogeneous graph. In this paper, an improved graph neural network is proposed to construct an interacting process mimics the real interwell flow regularity. In detail, this method is used to split injection and production rates by combining permeability, porosity and effective thickness, and to invert the dynamic connectivity in each layer of the injection-production wells by attention mechanism.Based on the material balance and physical information, the overall connectivity from the injection wells,through the water injection layers to the production layers and the output of final production wells is established. Meanwhile, the change of well pattern caused by perforation, plugging and switching of wells at different times is achieved by updated graph structure in spatial and temporal ways. The effectiveness of the method is verified by a combination of reservoir numerical simulation examples and field example. The method corresponds to the actual situation of the reservoir, has wide adaptability and low cost, has good practical value, and provides a reference for adjusting the injection-production relationship of the reservoir and the development of the remaining oil.

Target layer state estimation in multi-layer complex dynamical networks considering nonlinear node dynamics

In many engineering networks, only a part of target state variables are required to be estimated.On the other hand,multi-layer complex network exists widely in practical situations.In this paper, the state estimation of target state variables in multi-layer complex dynamical networks with nonlinear node dynamics is studied.A suitable functional state observer is constructed with the limited measurement.The parameters of the designed functional observer are obtained from the algebraic method and the stability of the functional observer is proven by the Lyapunov theorem.Some necessary conditions that need to be satisfied for the design of the functional state observer are obtained.Different from previous studies, in the multi-layer complex dynamical network with nonlinear node dynamics, the proposed method can estimate the state of target variables on some layers directly instead of estimating all the individual states.Thus, it can greatly reduce the placement of observers and computational cost.Numerical simulations with the three-layer complex dynamical network composed of three-dimensional nonlinear dynamical nodes are developed to verify the effectiveness of the method.

Assessing edge-coupled interdependent network disintegration via rank aggregation and elite enumeration

The disintegration of networks is a widely researched topic with significant applications in fields such as counterterrorism and infectious disease control. While the traditional approaches for achieving network disintegration involve identifying critical sets of nodes or edges, limited research has been carried out on edge-based disintegration strategies. We propose a novel algorithm, i.e., a rank aggregation elite enumeration algorithm based on edge-coupled networks(RAEEC),which aims to implement tiling for edge-coupled networks by finding important sets of edges in the network while balancing effectiveness and efficiency. Our algorithm is based on a two-layer edge-coupled network model with one-to-one links, and utilizes three advanced edge importance metrics to rank the edges separately. A comprehensive ranking of edges is obtained using a rank aggregation approach proposed in this study. The top few edges from the ranking set obtained by RAEEC are then used to generate an enumeration set, which is continuously iteratively updated to identify the set of elite attack edges.We conduct extensive experiments on synthetic networks to evaluate the performance of our proposed method, and the results indicate that RAEEC achieves a satisfactory balance between efficiency and effectiveness. Our approach represents a significant contribution to the field of network disintegration, particularly for edge-based strategies.

Explosive synchronization of multi-layer complex networks based on star connection between layers with delay

Explosive synchronization(ES)is a kind of first-order jump phenomenon that exists in physical and biological systems.In recent years,researchers have focused on ES between single-layer and multi-layer networks.Most research on complex networks with delay has focused on single-layer or double-layer networks,multi-layer networks are seldom explored.In this paper,we propose a Kuramoto model of frequency weights in multi-layer complex networks with delay and star connections between layers.Through theoretical analysis and numerical verification,the factors affecting the backward critical coupling strength are analyzed.The results show that the interaction between layers and the average node degree has a direct effect on the backward critical coupling strength of each layer network.The location of the delay,the size of the delay,the number of network layers,the number of nodes,and the network topology are revealed to have no direct impact on the backward critical coupling strength of the network.Delay is introduced to explore the influence of delay and other related parameters on ES.

Percolation transitions in edge-coupled interdependent networks with directed dependency links

We propose a model of edge-coupled interdependent networks with directed dependency links(EINDDLs)and develop the theoretical analysis framework of this model based on the self-consistent probabilities method.The phase transition behaviors and parameter thresholds of this model under random attacks are analyzed theoretically on both random regular(RR)networks and Erd¨os-Renyi(ER)networks,and computer simulations are performed to verify the results.In this EINDDL model,a fractionβof connectivity links within network B depends on network A and a fraction(1-β)of connectivity links within network A depends on network B.It is found that randomly removing a fraction(1-p)of connectivity links in network A at the initial state,network A exhibits different types of phase transitions(first order,second order and hybrid).Network B is rarely affected by cascading failure whenβis small,and network B will gradually converge from the first-order to the second-order phase transition asβincreases.We present the critical values ofβfor the phase change process of networks A and B,and give the critical values of p andβfor network B at the critical point of collapse.Furthermore,a cascading prevention strategy is proposed.The findings are of great significance for understanding the robustness of EINDDLs.

Multi-layer Tectonic Model for Intraplate Deformation and Plastic-Flow Network in the Asian Continental Lithosphere

In a large area of the east—central Asian continent there is a unified seismic network system composed of two families of large—seismic belts that intersect conjugately. Such a seismic network in the middle—upper crust is actually a response to the plastic flow network in the lower lithosphere including the lower crust and lithospheric mantle. The existence of the unified plastic flow system confirms that the driving force for intraplate tectonic deformation results mainly from the compression of the India plate, while the long-range transmission of the force is carried out chiefly by means of plastic flow. The plastic flow network has a control over the intraplate tectonic deformation.

Laplacian energy maximizationfor multi-layer air transportation networks

To increase airspace capacity, alleviate flight delay,and improve network robustness, an optimization method of multi-layer air transportation networks is put forward based on Laplacian energy maximization. The effectiveness of taking Laplacian energy as a measure of network robustness is validated through numerical experiments. The flight routes addition optimization model is proposed with the principle of maximizing Laplacian energy. Three methods including the depth-first search( DFS) algorithm, greedy algorithm and Monte-Carlo tree search( MCTS) algorithm are applied to solve the proposed problem. The trade-off between system performance and computational efficiency is compared through simulation experiments. Finally, a case study on Chinese airport network( CAN) is conducted using the proposed model. Through encapsulating it into multi-layer infrastructure via k-core decomposition algorithm, Laplacian energy maximization for the sub-networks is discussed which can provide a useful tool for the decision-makers to optimize the robustness of the air transportation network on different scales.

Distributed Contact Plan Design for Multi-Layer Satellite-Terrestrial Network

In multi-layer satellite-terrestrial network, Contact Graph Routing(CGR) uses the contact information among satellites to compute routes. However, due to the resource constraints in satellites, it is extravagant to configure lots of the potential contacts into contact plans. What's more, a huge contact plan makes the computing more complex, which further increases computing time. As a result, how to design an efficient contact plan becomes crucial for multi-layer satellite network, which usually has a large scaled topology. In this paper, we propose a distributed contact plan design scheme for multi-layer satellite network by dividing a large contact plan into several partial parts. Meanwhile, a duration based inter-layer contact selection algorithm is proposed to handle contacts disruption problem. The performance of the proposed design was evaluated on our Identifier/Locator split based satellite-terrestrial network testbed with 79 simulation nodes. Experiments showed that the proposed design is able to reduce the data delivery delay.

Software-Defined Space-Air-Ground Integrated Network Architecture with the Multi-Layer Satellite Backbone Network

Under the background of the rapid development of ground mobile communication,the advantages of high coverage,survivability,and flexibility of satellite communication provide air support to the construction of space information network.According to the requirements of the future space information communication,a software-defined Space-Air-Ground Integrated network architecture was proposed.It consisted of layered structure satellite backbone network,deep space communication network,the stratosphere communication network and the ground network.The Space-Air-Ground Integrated network was supported by the satellite backbone network.It provided data relay for the missions such as deep space exploration and controlled the deep-space spacecraft when needed.In addition,it safeguarded the anti-destructibility of stratospheric communication and assisted the stratosphere to supplement ground network communication.In this paper,algorithm requirements of the congestion control and routing of satellite backbone protocols for heterogeneous users’services were proposed.The algorithm requirements of distinguishing different service objects for the deep space communication and stratospheric communication network protocols were described.Considering the realistic demand for the dynamic coverage of the satellite backbone network and node cost,the multi-layer satellite backbone network architecture was constructed.On this basis,the proposed Software-defined Space-Air-Ground Integrated network architecture could be built as a large,scalable and efficient communication network that could be integrated into space,air,and ground.

Efficient Training of Multi-Layer Neural Networks to Achieve Faster Validation

Artificial neural networks(ANNs)are one of the hottest topics in computer science and artificial intelligence due to their potential and advantages in analyzing real-world problems in various disciplines,including but not limited to physics,biology,chemistry,and engineering.However,ANNs lack several key characteristics of biological neural networks,such as sparsity,scale-freeness,and small-worldness.The concept of sparse and scale-free neural networks has been introduced to fill this gap.Network sparsity is implemented by removing weak weights between neurons during the learning process and replacing them with random weights.When the network is initialized,the neural network is fully connected,which means the number of weights is four times the number of neurons.In this study,considering that a biological neural network has some degree of initial sparsity,we design an ANN with a prescribed level of initial sparsity.The neural network is tested on handwritten digits,Arabic characters,CIFAR-10,and Reuters newswire topics.Simulations show that it is possible to reduce the number of weights by up to 50%without losing prediction accuracy.Moreover,in both cases,the testing time is dramatically reduced compared with fully connected ANNs.

Impact of asymptomatic infected individuals on epidemic transmission dynamics in multiplex networks with partial coupling

The theory of network science has attracted great interest of many researchers in the realm of biomathematics and public health,and numerous valuable epidemic models have been developed.In previous studies,it is common to set up a one-to-one correspondence between the nodes of a multi-layer network,ignoring the more complex situations in reality.In the present work,we explore this situation by setting up a partially coupled model of a two-layer network and investigating the impact of asymptomatic infected individuals on epidemics.We propose a self-discovery mechanism for asymptomatic infected individuals,taking into account situations such as nucleic acid testing in the community and individuals performing self-antigen testing during the epidemic.Considering these factors together,through the microscopic Markov chain approach(MMCA)and extensive Monte Carlo(MC)numerical simulations,we find that the greater the coupling between the networks,the more information dissemination is facilitated.In order to control the epidemics,more asymptomatic infected individuals should be made aware of their infection.Massive adoption of nucleic acid testing and individual adoption of antigenic self-testing can help to contain epidemic outbreaks.Meanwhile,the epidemic threshold of the proposed model is derived,and then miscellaneous factors affecting the epidemic threshold are also discussed.Current results are conducive to devising the prevention and control policies of pandemics.

Recommendation System Based on Perceptron and Graph Convolution Network

The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution network.The current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction data.This paper presents a new approach to address such issues,utilizing the graph convolution network to extract association relations.The proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction layer.The embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation layer.The forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph convolution.Furthermore,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction layer.The score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,respectively.Finally,the prediction score of users to items is obtained.The recall rate and normalized discounted cumulative gain were used as evaluation indexes.The proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.

Identification of Important FPGA Modules Based on Complex Network

The globalization of hardware designs and supply chains,as well as the integration of third-party intellectual property(IP)cores,has led to an increased focus from malicious attackers on computing hardware.However,existing defense or detection approaches often require additional circuitry to perform security verification,and are thus constrained by time and resource limitations.Considering the scale of actual engineering tasks and tight project schedules,it is usually difficult to implement designs for all modules in field programmable gate array(FPGA)circuits.Some studies have pointed out that the failure of key modules tends to cause greater damage to the network.Therefore,under limited conditions,priority protection designs need to be made on key modules to improve protection efficiency.We have conducted research on FPGA designs including single FPGA systems and multi-FPGA systems,to identify key modules in FPGA systems.For the single FPGA designs,considering the topological structure,network characteristics,and directionality of FPGA designs,we propose a node importance evaluationmethod based on the technique for order preference by similarity to an ideal solution(TOPSIS)method.Then,for the multi-FPGA designs,considering the influence of nodes in intra-layer and inter-layers,they are constructed into the interdependent network,and we propose a method based on connection strength to identify the important modules.Finally,we conduct empirical research using actual FPGA designs as examples.The results indicate that compared to other traditional indexes,node importance indexes proposed for different designs can better characterize the importance of nodes.

The Invulnerability of Directed Interdependent Networks with Multiple Dependency Relations

The paper aims to study the invulnerability of directed interdependent networks with multiple dependency relations: dependent and supportive. We establish three models and simulate in three network systems to deal with this question. To improve network invulnerability, we’d better avoid dependent relations transmission and add supportive relations symmetrically.

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

Many real communication networks, such as oceanic monitoring network and land environment observation network,can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue（HMQ） routing strategy and global forward-predicting hybrid minimum degree and queue（HMDQ） routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity.

Explosive synchronization of multi-layer complex networks based on inter-layer star network connection

Explosive synchronization(ES)is a first-order transition phenomenon that is ubiquitous in various physical and biological systems.In recent years,researchers have focused on explosive synchronization in a single-layer network,but few in multi-layer networks.This paper proposes a frequency-weighted Kuramoto model in multi-layer complex networks with star connection between layers and analyzes the factors affecting the backward critical coupling strength by both theoretical analysis and numerical validation.Our results show that the backward critical coupling strength of each layer network is influenced by the inter-layer interaction strength and the average degree.The number of network layers,the number of nodes,and the network topology can not directly affect the synchronization of the network.Enhancing the inter-layer interaction strength can prevent the emergence of explosive synchronization and increasing the average degree can promote the generation of explosive synchronization.

Hausdorff Dimension of Multi-Layer Neural Networks

This elucidation investigates the Hausdorff dimension of the output space of multi-layer neural networks. When the factor map from the covering space of the output space to the output space has a synchronizing word, the Hausdorff dimension of the output space relates to its topological entropy. This clarifies the geometrical structure of the output space in more details.

Learning Performance of Linear and Exponential Activity Function with Multi-layered Neural Networks

This paper presents a study on the improvement of MLNNs(multi-layer neural networks)performance by an activity function for multi logic training patterns.Our model network has L hidden layers of two inputs and three,four to six output training using BP(backpropagation)neural network.We used logic functions of XOR(exclusive OR),OR,AND,NAND(not AND),NXOR(not exclusive OR)and NOR(not OR)as the multi logic teacher signals to evaluate the training performance of MLNNs by an activity function for information and data enlargement in signal processing(synaptic divergence state).We specifically used four activity functions from which we modified one and called it L&exp.function as it could give the highest training abilities compared to the original activity functions of Sigmoid,ReLU and Step during simulation and training in the network.And finally,we propose L&exp.function as being good for MLNNs and it may be applicable for signal processing of data and information enlargement because of its performance training characteristics with multiple training logic patterns hence can be adopted in machine deep learning.