Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchro...Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.展开更多
Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly ...Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly optimized topologies.But the key problems arise:how to compress a network to best enhance its compactness,and what the compression limit of the network reflects?We abstract the topological compression of complex networks as a dynamic process of making them more compact and propose the local compression modulus that plays a key role in effective compression evolution of networks.Subsequently,we identify topological compressibility-a general property of complex networks that characterizes the extent to which a network can be compressed-and provide its approximate quantification.We anticipate that our findings and established theory will provide valuable insights into both dynamics and various applications of complex networks.展开更多
An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other han...An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.展开更多
Air transport systems are highly dynamic at temporal scales from minutes to years.This dynamic behavior not only characterizes the evolution of the system but also affect the system＇s functioning.Understanding the ev...Air transport systems are highly dynamic at temporal scales from minutes to years.This dynamic behavior not only characterizes the evolution of the system but also affect the system＇s functioning.Understanding the evolutionary mechanisms is thus fundamental in order to better design optimal air transport networks that benefits companies,passengers and the environment.In this review,we briefly present and discuss the state-of-the-art on time-evolving air transport networks.We distinguish the structural analysis of sequences of network snapshots,ideal for long-term network evolution（e.g.annual evolution）,and temporal paths,preferred for short-term dynamics（e.g.hourly evolution）.We emphasize that most previous research focused on the first modeling approach（i.e.long-term） whereas only a few studies look at high-resolution temporal paths.We conclude the review highlighting that much research remains to be done,both to apply already available methods and to develop new measures for temporal paths on air transport networks.In particular,we identify that the study of delays,network resilience and optimization of resources（aircraft and crew） are critical topics.展开更多
This paper investigates epidemic dynamics over dynamic networks via the approach of semi-tensor product of matrices. First, a formal susceptible-infected-susceptible epidemic dynamic model over dynamic networks （SISE...This paper investigates epidemic dynamics over dynamic networks via the approach of semi-tensor product of matrices. First, a formal susceptible-infected-susceptible epidemic dynamic model over dynamic networks （SISED-DN） is given. Second, based on a class of determinate co-evolutionary rule, the matrix expressions are established for the dynamics of individual states and network topologies, respectively. Then, all possible final spreading equilibria are obtained for any given initial epidemic state and network topology by the matrix expression. Third, a sufficient and necessary condition of the existence of state feedback vaccination control is presented to make every individual susceptible. The study of illustrative examples shows the effectiveness of our new results.展开更多
Social organisms often show collective behaviors such as group foraging or movement.Collective behaviors can emerge from interactions between group members and may depend on the behavior of key individuals.When social...Social organisms often show collective behaviors such as group foraging or movement.Collective behaviors can emerge from interactions between group members and may depend on the behavior of key individuals.When social interactions change over time,collective behaviors may change because these behaviors emerge from interactions among individuals.Despite the importance of,and growing interest in,the temporal dynamics of social interactions,it is not clear how to quantify changes in interactions over time or measure their stability.Furthermore,the temporal scale at which we should observe changes in social networks to detect biologically meaningful changes is not always apparent.Here we use multilayer network analysis to quantify temporal dynamics of social networks of the social spider Stegodyphus dumicola and determine how these dynamics relate to individual and group behaviors.We found that social interactions changed over time at a constant rate.Variation in both network structure and the identity of a keystone individual was not related to the mean or variance of the collective prey attack speed.Individuals that maintained a large and stable number of connections,despite changes in network structure,were the boldest individuals in the group.Therefore,social interactions and boldness are linked across time,but group collective behavior is not influenced by the stability of the social network.Our work demonstrates that dynamic social networks can be modeled in a multilayer framework.This approach may reveal biologically important temporal changes to social structure in other systems.展开更多
This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency do...This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.展开更多
The outbreak of corona virus disease 2019 has profoundly affected people’s way of life.It is increasingly necessary to investigate epidemics over social networks.This paper studies susceptible-infected-removed(SIR)ep...The outbreak of corona virus disease 2019 has profoundly affected people’s way of life.It is increasingly necessary to investigate epidemics over social networks.This paper studies susceptible-infected-removed(SIR)epidemics via the semi-tensor product.First,a formal susceptible-infected-removed epidemic dynamic model over probabilistic dynamic networks(SIRED-PDN)is given.Based on an evolutionary rule,the algebraic form for the dynamics of individual states and network topologies is given,respectively.Second,the SIRED-PDN can be described by a probabilistic mix-valued logical network.After providing an algorithm,all possible final spreading equilibria can be obtained for any given initial epidemic state and network topology by seeking attractors of the network.And the shortest time for all possible initial epidemic state and network topology profiles to evolve to the final spreading equilibria can be obtained by seeking the transient time of the network.Finally,an illustrative example is given to show the effectiveness of our model.展开更多
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 ...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.展开更多
Brain mechanisms of lexical-semantic processing have been well researched using electroencephalography(EEG)technique with high temporal resolution.However,the detailed brain dynamics regarding spatial connectivity and...Brain mechanisms of lexical-semantic processing have been well researched using electroencephalography(EEG)technique with high temporal resolution.However,the detailed brain dynamics regarding spatial connectivity and the spectral characteristics remain to be clarified.For this reason,this study performed frequency-specific effective connectivity analysis for the EEG recordings during the processing of real and pseudowords.In addition,we introduced f MRI-based network templates into a representational similarity analysis to compare the functional differences between real and pseudowords in different frequency bands.Our results revealed that real words could rapidly activate the brain network for speech perception and complete its comprehension with efficiency,especially when the first syllable of the real word has clear categorical features.In contrast,the pseudowords were delayed in the initiation of speech perception and required a longer time span to retrieve its meaning.The frequency-specific analysis showed that the theta,alpha,and beta rhythms contribute more to semantic processing than the gamma oscillation.These results showed that semantic processing is frequency-specific and time-dependent on the word categories.展开更多
Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision p...Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.展开更多
The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are cr...The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.展开更多
As the international environment changes,frequent geopolitical crises continue to hinder the healthy development of global stock markets.To analyze in-depth the risk contagion path between the international stock mark...As the international environment changes,frequent geopolitical crises continue to hinder the healthy development of global stock markets.To analyze in-depth the risk contagion path between the international stock market and geopolitics under the impact of extreme events,this paper explores the tail risk interactive contagion mechanism and dynamic effects of the double-layer network between the international stock market and geopolitics from the perspective of complex networks.Empirical research finds that geopolitical conflicts exacerbate risk contagion among international stock markets,and there are significant differences in risk contagion between developed and emerging economies.The analysis of the complex interaction effect in the doublelayer network of the international stock market and geopolitics shows that the intralayer risk spillover effect of geopolitics in the short term is significantly higher than that of the stock price volatility network layer.Finally,the study on the dynamic changes of the double-layer network connectedness between the international stock market and geopolitics found that the shock of extreme events,such as military conflict and public health security,is an important factor in triggering the cross-contagion of risks.The research conclusions provide new ideas for preventing the cross-contagion of geopolitical risks in the stock markets of various countries under the evolution of the global political and economic pattern.展开更多
Infrared imaging technology has been widely adopted in various fields,such as military reconnaissance,medical diagnosis,and security monitoring,due to its excellent ability to penetrate smoke and fog.However,the preva...Infrared imaging technology has been widely adopted in various fields,such as military reconnaissance,medical diagnosis,and security monitoring,due to its excellent ability to penetrate smoke and fog.However,the prevalent low resolution of infrared images severely limits the accurate interpretation of their contents.In addition,deploying super-resolution models on resource-constrained devices faces significant challenges.To address these issues,this study proposes a lightweight super-resolution network for infrared images based on an adaptive attention mechanism.The network’s dynamic weighting module automatically adjusts the weights of the attention and nonattention branch outputs based on the network’s characteristics at different levels.Among them,the attention branch is further subdivided into pixel attention and brightness-texture attention,which are specialized for extracting the most informative features in infrared images.Meanwhile,the non-attention branch supplements the extraction of those neglected features to enhance the comprehensiveness of the features.Through ablation experiments,we verify the effectiveness of the proposed module.Finally,through experiments on two datasets,FLIR and Thermal101,qualitative and quantitative results demonstrate that the model can effectively recover high-frequency details of infrared images and significantly improve image resolution.In detail,compared with the suboptimal method,we have reduced the number of parameters by 30%and improved the model performance.When the scale factor is 2,the peak signal-tonoise ratio of the test datasets FLIR and Thermal101 is improved by 0.09 and 0.15 dB,respectively.When the scale factor is 4,it is improved by 0.05 and 0.09 dB,respectively.In addition,due to the lightweight design of the network structure,it has a low computational cost.It is suitable for deployment on edge devices,thus effectively enhancing the sensing performance of infrared imaging devices.展开更多
This study focuses on the detection of infection sources in dynamic networks,which is very important for network analysis,cybersecurity,and public health.We aim to improve source detection in complex networks using da...This study focuses on the detection of infection sources in dynamic networks,which is very important for network analysis,cybersecurity,and public health.We aim to improve source detection in complex networks using data,computational advances,and machine learning to improve epidemic response and public health protection.We explore dynamic network analysis and recent algorithms for infection source detection,emphasizing data integration and machine learning.Our approach involves reviewing existing research,identifying gaps,and proposing dynamic network-based infectious disease source detection strategies.Our study highlights evolving infection source detection methods and underscores the potential of machine learning and artificial intelligence.We acknowledge ongoing challenges due to network complexity and outline promising research directions.Detecting infection sources in dynamic networks is vital.This study emphasizes the need for improved techniques and technology integration to address complexities effectively.Advancements will empower us to identify and mitigate epidemics,reducing their societal and public health impacts.展开更多
The distribution networks sometimes suffer from excessive losses and voltage violations in densely populated areas. The aim of the present study is to improve the performance of a distribution network by successively ...The distribution networks sometimes suffer from excessive losses and voltage violations in densely populated areas. The aim of the present study is to improve the performance of a distribution network by successively applying mono-capacitor positioning, multiple positioning and reconfiguration processes using GA-based algorithms implemented in a Matlab environment. From the diagnostic study of this network, it was observed that a minimum voltage of 0.90 pu induces a voltage deviation of 5.26%, followed by active and reactive losses of 425.08 kW and 435.09 kVAR, respectively. Single placement with the NSGAII resulted in the placement of a 3000 kVAR capacitor at node 128, which proved to be the invariably neuralgic point. Multiple placements resulted in a 21.55% reduction in losses and a 0.74% regression in voltage profile performance. After topology optimization, the loss profile improved by 65.08% and the voltage profile improved by 1.05%. Genetic algorithms are efficient and effective tools for improving the performance of distribution networks, whose degradation is often dynamic due to the natural variability of loads.展开更多
Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weight...Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.展开更多
Intelligent polymers have garnered significant attention for enhancing component safety,but there are still obstacles to achieving rapid self-healing at room temperature.Here,inspired by the microscopic layered struct...Intelligent polymers have garnered significant attention for enhancing component safety,but there are still obstacles to achieving rapid self-healing at room temperature.Here,inspired by the microscopic layered structure of mother-of-pearl,we have developed a biomimetic composite with high strength and self-repairing capabilities,achieved by the ordered arrangement of pearl-like structures within a flexible polyurethane matrix and GO nanosheets functionalized by in situ polymerization of carbon dots(CDs),this biomimetic interface design approach results in a material strength of 8 MPa and toughness(162 MJ m^(-3)),exceptional ductile properties(2697%elongation at break),and a world-record the fast and high-efficient self-healing ability at room temperature(96%at 25℃for 60 min).Thereby these composites overcome the limitations of dynamic composite networks of graphene that struggle to balance repair capability and robustness,and the CDs in situ loaded in the interfacial layer inhibit corrosion and prevent damage to the metal substrate during the repair process.(TheƵ_(f=0.01Hz)was 1.81×10^(9)Ωcm^(2)after 2 h of healing).Besides,the material can be intelligently actuated and shape memory repaired,which provides reliable protection for developments in smart and flexible devices such as robots and electronic skins.展开更多
Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a netwo...Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a network, the delay is with epistemic uncertainty, which makes the traditional routing scheme based on deterministic theory or probability theory not applicable. Motivated by this problem, the MCN with epistemic uncertainty is first summarized as a dynamic uncertain network based on uncertainty theory, which is widely applied to model epistemic uncertainties. Then by modeling the uncertain end-toend delay, a new delay bounded routing scheme is proposed to find the path with the maximum belief degree that satisfies the delay threshold for the dynamic uncertain network. Finally, a lowEarth-orbit satellite communication network(LEO-SCN) is used as a case to verify the effectiveness of our routing scheme. It is first modeled as a dynamic uncertain network, and then the delay bounded paths with the maximum belief degree are computed and compared under different delay thresholds.展开更多
Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate ...Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.展开更多
基金supported by the Major Research plan of the National Natural Science Foundation of China 9118008National Key Technology R&D Program of the Ministry of Science and Technology 2014BAC16B01
文摘Efficient multi-machine cooperation and network dynamics still remain open that jeopardize great applications in largescale machine-to-machine(M2M) networks. Among all possible machine cooperation controls, to synchronize tremendous machines in a timing-efficient brings one of the greatest challenge and serves as the foundation for any other network control policies. In this paper, we propose a linear-time synchronization protocol in large M2M networks. Specifically, a closed-form of synchronization rate is provided by developing the statistical bounds of the second smallest eigenvalue of the graph Laplacian matrix. These bounds enable the efficient control of network dynamics, facilitating the timing synchronization in networks. Through a practical study in Metropolis, simulation results confirm our theoretical analysis and provide effective selection of wireless technologies, including Zigbee, Wi-Fi, and cellular systems, with respect to the deployed density of machines. Therefore, this paper successfully demonstrates a practical timing synchronization, to make a breakthrough of network dynamic control in real-world machine systems, such as Internet of Things.
基金supported inpart by the National Natural Science Foundation of China(Grant No. 12371088)the Innovative Research Group Project of Natural Science Foundation of Hunan Provinceof China (Grant No. 2024JJ1008)in part by the Australian Research Council (ARC) through the Discovery Projects scheme (Grant No. DP220100580)。
文摘Accurately modeling real network dynamics is a grand challenge in network science.The network dynamics arise from node interactions,which are shaped by network topology.Real networks tend to exhibit compact or highly optimized topologies.But the key problems arise:how to compress a network to best enhance its compactness,and what the compression limit of the network reflects?We abstract the topological compression of complex networks as a dynamic process of making them more compact and propose the local compression modulus that plays a key role in effective compression evolution of networks.Subsequently,we identify topological compressibility-a general property of complex networks that characterizes the extent to which a network can be compressed-and provide its approximate quantification.We anticipate that our findings and established theory will provide valuable insights into both dynamics and various applications of complex networks.
基金supported by the National Natural Science Foundation of China (Grants Nos. 61072139,61072106,61203303,61003198,61272279,and 61003199)
文摘An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.
基金supported by the Fonds De La Recherche Scientifique-FNRS
文摘Air transport systems are highly dynamic at temporal scales from minutes to years.This dynamic behavior not only characterizes the evolution of the system but also affect the system＇s functioning.Understanding the evolutionary mechanisms is thus fundamental in order to better design optimal air transport networks that benefits companies,passengers and the environment.In this review,we briefly present and discuss the state-of-the-art on time-evolving air transport networks.We distinguish the structural analysis of sequences of network snapshots,ideal for long-term network evolution（e.g.annual evolution）,and temporal paths,preferred for short-term dynamics（e.g.hourly evolution）.We emphasize that most previous research focused on the first modeling approach（i.e.long-term） whereas only a few studies look at high-resolution temporal paths.We conclude the review highlighting that much research remains to be done,both to apply already available methods and to develop new measures for temporal paths on air transport networks.In particular,we identify that the study of delays,network resilience and optimization of resources（aircraft and crew） are critical topics.
基金This work was supported by the National Natural Science Foundation of China （Nos. 61374065, 61503225）, the Research Fund for the Taishan Scholar Project of Shandong Province, and the Natural Science Foundation of Shandong Province （No. ZR2015FQ003）.
文摘This paper investigates epidemic dynamics over dynamic networks via the approach of semi-tensor product of matrices. First, a formal susceptible-infected-susceptible epidemic dynamic model over dynamic networks （SISED-DN） is given. Second, based on a class of determinate co-evolutionary rule, the matrix expressions are established for the dynamics of individual states and network topologies, respectively. Then, all possible final spreading equilibria are obtained for any given initial epidemic state and network topology by the matrix expression. Third, a sufficient and necessary condition of the existence of state feedback vaccination control is presented to make every individual susceptible. The study of illustrative examples shows the effectiveness of our new results.
基金This work was supported by the National Science Foundation IOS grant 1456010the National Institute of Health grant GM115509 to N.P.-W.
文摘Social organisms often show collective behaviors such as group foraging or movement.Collective behaviors can emerge from interactions between group members and may depend on the behavior of key individuals.When social interactions change over time,collective behaviors may change because these behaviors emerge from interactions among individuals.Despite the importance of,and growing interest in,the temporal dynamics of social interactions,it is not clear how to quantify changes in interactions over time or measure their stability.Furthermore,the temporal scale at which we should observe changes in social networks to detect biologically meaningful changes is not always apparent.Here we use multilayer network analysis to quantify temporal dynamics of social networks of the social spider Stegodyphus dumicola and determine how these dynamics relate to individual and group behaviors.We found that social interactions changed over time at a constant rate.Variation in both network structure and the identity of a keystone individual was not related to the mean or variance of the collective prey attack speed.Individuals that maintained a large and stable number of connections,despite changes in network structure,were the boldest individuals in the group.Therefore,social interactions and boldness are linked across time,but group collective behavior is not influenced by the stability of the social network.Our work demonstrates that dynamic social networks can be modeled in a multilayer framework.This approach may reveal biologically important temporal changes to social structure in other systems.
基金Supported by the National Natural Science Foundation of China (60574088, 60274014)
文摘This paper proposes second-order consensus protocols and gives a measure of the robustness of the protocols to the time-delays existing in the dynamics of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states achieve second-order consensus asymptotically for appropriate time-delay if the topology of the network is connected. Particularly, a nonconservative upper bound on the fixed time-delay that can be tolerated is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which makes the proposed protocols scalable. It reduces the complexity of connections among agents significantly. Simulation results are provided to verify the effectiveness of the theoretical results for second-order consensus in networks in the presence of time-delays existing in the dynamics of agents.
基金supported by the National Natural Science Foundation of China(Nos.61973175,62203328)the Tianjin Natural Science Foundation(Nos.20JCYBJC01060,21JCQNJC00840)the General Terminal IC Interdisciplinary Science Center of Nankai University.
文摘The outbreak of corona virus disease 2019 has profoundly affected people’s way of life.It is increasingly necessary to investigate epidemics over social networks.This paper studies susceptible-infected-removed(SIR)epidemics via the semi-tensor product.First,a formal susceptible-infected-removed epidemic dynamic model over probabilistic dynamic networks(SIRED-PDN)is given.Based on an evolutionary rule,the algebraic form for the dynamics of individual states and network topologies is given,respectively.Second,the SIRED-PDN can be described by a probabilistic mix-valued logical network.After providing an algorithm,all possible final spreading equilibria can be obtained for any given initial epidemic state and network topology by seeking attractors of the network.And the shortest time for all possible initial epidemic state and network topology profiles to evolve to the final spreading equilibria can be obtained by seeking the transient time of the network.Finally,an illustrative example is given to show the effectiveness of our model.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.62373197 and 61873326)。
文摘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.
基金supported partially by JSPS KAKENHI Grant(20K11883)
文摘Brain mechanisms of lexical-semantic processing have been well researched using electroencephalography(EEG)technique with high temporal resolution.However,the detailed brain dynamics regarding spatial connectivity and the spectral characteristics remain to be clarified.For this reason,this study performed frequency-specific effective connectivity analysis for the EEG recordings during the processing of real and pseudowords.In addition,we introduced f MRI-based network templates into a representational similarity analysis to compare the functional differences between real and pseudowords in different frequency bands.Our results revealed that real words could rapidly activate the brain network for speech perception and complete its comprehension with efficiency,especially when the first syllable of the real word has clear categorical features.In contrast,the pseudowords were delayed in the initiation of speech perception and required a longer time span to retrieve its meaning.The frequency-specific analysis showed that the theta,alpha,and beta rhythms contribute more to semantic processing than the gamma oscillation.These results showed that semantic processing is frequency-specific and time-dependent on the word categories.
基金supported by the National Nature Science Foundation of China(71771201,72531009,71973001)the USTC Research Funds of the Double First-Class Initiative(FSSF-A-240202).
文摘Social interaction with peer pressure is widely studied in social network analysis.Game theory can be utilized to model dynamic social interaction,and one class of game network models assumes that people’s decision payoff functions hinge on individual covariates and the choices of their friends.However,peer pressure would be misidentified and induce a non-negligible bias when incomplete covariates are involved in the game model.For this reason,we develop a generalized constant peer effects model based on homogeneity structure in dynamic social networks.The new model can effectively avoid bias through homogeneity pursuit and can be applied to a wider range of scenarios.To estimate peer pressure in the model,we first present two algorithms based on the initialize expand merge method and the polynomial-time twostage method to estimate homogeneity parameters.Then we apply the nested pseudo-likelihood method and obtain consistent estimators of peer pressure.Simulation evaluations show that our proposed methodology can achieve desirable and effective results in terms of the community misclassification rate and parameter estimation error.We also illustrate the advantages of our model in the empirical analysis when compared with a benchmark model.
文摘The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.
基金supported by the National Natural Science Foundation of China(Nos.72271135,72141304,71901130)National Social Science Fund of China(22&ZD117)+3 种基金Laboratory of Computation and Analyticsof Complex Management Systems(Tianjin University)Special Funds for Taishan Scholars(tsqn202211120)2024 QingdaoFinance Society Key Project2024 Qingdao Social Science Planning Project.
文摘As the international environment changes,frequent geopolitical crises continue to hinder the healthy development of global stock markets.To analyze in-depth the risk contagion path between the international stock market and geopolitics under the impact of extreme events,this paper explores the tail risk interactive contagion mechanism and dynamic effects of the double-layer network between the international stock market and geopolitics from the perspective of complex networks.Empirical research finds that geopolitical conflicts exacerbate risk contagion among international stock markets,and there are significant differences in risk contagion between developed and emerging economies.The analysis of the complex interaction effect in the doublelayer network of the international stock market and geopolitics shows that the intralayer risk spillover effect of geopolitics in the short term is significantly higher than that of the stock price volatility network layer.Finally,the study on the dynamic changes of the double-layer network connectedness between the international stock market and geopolitics found that the shock of extreme events,such as military conflict and public health security,is an important factor in triggering the cross-contagion of risks.The research conclusions provide new ideas for preventing the cross-contagion of geopolitical risks in the stock markets of various countries under the evolution of the global political and economic pattern.
基金funded in part by theHenan ProvinceKeyR&DProgramProject,“Research and Application Demonstration of Class Ⅱ Superlattice Medium Wave High Temperature Infrared Detector Technology”under Grant No.231111210400.
文摘Infrared imaging technology has been widely adopted in various fields,such as military reconnaissance,medical diagnosis,and security monitoring,due to its excellent ability to penetrate smoke and fog.However,the prevalent low resolution of infrared images severely limits the accurate interpretation of their contents.In addition,deploying super-resolution models on resource-constrained devices faces significant challenges.To address these issues,this study proposes a lightweight super-resolution network for infrared images based on an adaptive attention mechanism.The network’s dynamic weighting module automatically adjusts the weights of the attention and nonattention branch outputs based on the network’s characteristics at different levels.Among them,the attention branch is further subdivided into pixel attention and brightness-texture attention,which are specialized for extracting the most informative features in infrared images.Meanwhile,the non-attention branch supplements the extraction of those neglected features to enhance the comprehensiveness of the features.Through ablation experiments,we verify the effectiveness of the proposed module.Finally,through experiments on two datasets,FLIR and Thermal101,qualitative and quantitative results demonstrate that the model can effectively recover high-frequency details of infrared images and significantly improve image resolution.In detail,compared with the suboptimal method,we have reduced the number of parameters by 30%and improved the model performance.When the scale factor is 2,the peak signal-tonoise ratio of the test datasets FLIR and Thermal101 is improved by 0.09 and 0.15 dB,respectively.When the scale factor is 4,it is improved by 0.05 and 0.09 dB,respectively.In addition,due to the lightweight design of the network structure,it has a low computational cost.It is suitable for deployment on edge devices,thus effectively enhancing the sensing performance of infrared imaging devices.
文摘This study focuses on the detection of infection sources in dynamic networks,which is very important for network analysis,cybersecurity,and public health.We aim to improve source detection in complex networks using data,computational advances,and machine learning to improve epidemic response and public health protection.We explore dynamic network analysis and recent algorithms for infection source detection,emphasizing data integration and machine learning.Our approach involves reviewing existing research,identifying gaps,and proposing dynamic network-based infectious disease source detection strategies.Our study highlights evolving infection source detection methods and underscores the potential of machine learning and artificial intelligence.We acknowledge ongoing challenges due to network complexity and outline promising research directions.Detecting infection sources in dynamic networks is vital.This study emphasizes the need for improved techniques and technology integration to address complexities effectively.Advancements will empower us to identify and mitigate epidemics,reducing their societal and public health impacts.
文摘The distribution networks sometimes suffer from excessive losses and voltage violations in densely populated areas. The aim of the present study is to improve the performance of a distribution network by successively applying mono-capacitor positioning, multiple positioning and reconfiguration processes using GA-based algorithms implemented in a Matlab environment. From the diagnostic study of this network, it was observed that a minimum voltage of 0.90 pu induces a voltage deviation of 5.26%, followed by active and reactive losses of 425.08 kW and 435.09 kVAR, respectively. Single placement with the NSGAII resulted in the placement of a 3000 kVAR capacitor at node 128, which proved to be the invariably neuralgic point. Multiple placements resulted in a 21.55% reduction in losses and a 0.74% regression in voltage profile performance. After topology optimization, the loss profile improved by 65.08% and the voltage profile improved by 1.05%. Genetic algorithms are efficient and effective tools for improving the performance of distribution networks, whose degradation is often dynamic due to the natural variability of loads.
基金supported by the Key R&D Projects in Jiangsu Province(BE2021729)the Key Primary Research Project of Primary Strengthening Program(KYZYJKKCJC23001).
文摘Multi-agent systems often require good interoperability in the process of completing their assigned tasks.This paper first models the static structure and dynamic behavior of multiagent systems based on layered weighted scale-free community network and susceptible-infected-recovered(SIR)model.To solve the problem of difficulty in describing the changes in the structure and collaboration mode of the system under external factors,a two-dimensional Monte Carlo method and an improved dynamic Bayesian network are used to simulate the impact of external environmental factors on multi-agent systems.A collaborative information flow path optimization algorithm for agents under environmental factors is designed based on the Dijkstra algorithm.A method for evaluating system interoperability is designed based on simulation experiments,providing reference for the construction planning and optimization of organizational application of the system.Finally,the feasibility of the method is verified through case studies.
基金support of the Jiangsu Provincial Department of Science and Technology Innovation Support Program(No.BK20222004)the National Natural Science Foundation of China(No.52201077).
文摘Intelligent polymers have garnered significant attention for enhancing component safety,but there are still obstacles to achieving rapid self-healing at room temperature.Here,inspired by the microscopic layered structure of mother-of-pearl,we have developed a biomimetic composite with high strength and self-repairing capabilities,achieved by the ordered arrangement of pearl-like structures within a flexible polyurethane matrix and GO nanosheets functionalized by in situ polymerization of carbon dots(CDs),this biomimetic interface design approach results in a material strength of 8 MPa and toughness(162 MJ m^(-3)),exceptional ductile properties(2697%elongation at break),and a world-record the fast and high-efficient self-healing ability at room temperature(96%at 25℃for 60 min).Thereby these composites overcome the limitations of dynamic composite networks of graphene that struggle to balance repair capability and robustness,and the CDs in situ loaded in the interfacial layer inhibit corrosion and prevent damage to the metal substrate during the repair process.(TheƵ_(f=0.01Hz)was 1.81×10^(9)Ωcm^(2)after 2 h of healing).Besides,the material can be intelligently actuated and shape memory repaired,which provides reliable protection for developments in smart and flexible devices such as robots and electronic skins.
基金National Natural Science Foundation of China (61773044,62073009)National key Laboratory of Science and Technology on Reliability and Environmental Engineering(WDZC2019601A301)。
文摘Delay aware routing is now widely used to provide efficient network transmission. However, for newly developing or developed mobile communication networks(MCN), only limited delay data can be obtained. In such a network, the delay is with epistemic uncertainty, which makes the traditional routing scheme based on deterministic theory or probability theory not applicable. Motivated by this problem, the MCN with epistemic uncertainty is first summarized as a dynamic uncertain network based on uncertainty theory, which is widely applied to model epistemic uncertainties. Then by modeling the uncertain end-toend delay, a new delay bounded routing scheme is proposed to find the path with the maximum belief degree that satisfies the delay threshold for the dynamic uncertain network. Finally, a lowEarth-orbit satellite communication network(LEO-SCN) is used as a case to verify the effectiveness of our routing scheme. It is first modeled as a dynamic uncertain network, and then the delay bounded paths with the maximum belief degree are computed and compared under different delay thresholds.
基金supported by the Natural Science Foundation of China(No.U22A2099)the Innovation Project of Guangxi Graduate Education(YCBZ2023130).
文摘Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.
