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.展开更多
Convolutional neural networks depend on deep network architectures to extract accurate information for image super‐resolution.However,obtained information of these con-volutional neural networks cannot completely exp...Convolutional neural networks depend on deep network architectures to extract accurate information for image super‐resolution.However,obtained information of these con-volutional neural networks cannot completely express predicted high‐quality images for complex scenes.A dynamic network for image super‐resolution(DSRNet)is presented,which contains a residual enhancement block,wide enhancement block,feature refine-ment block and construction block.The residual enhancement block is composed of a residual enhanced architecture to facilitate hierarchical features for image super‐resolution.To enhance robustness of obtained super‐resolution model for complex scenes,a wide enhancement block achieves a dynamic architecture to learn more robust information to enhance applicability of an obtained super‐resolution model for varying scenes.To prevent interference of components in a wide enhancement block,a refine-ment block utilises a stacked architecture to accurately learn obtained features.Also,a residual learning operation is embedded in the refinement block to prevent long‐term dependency problem.Finally,a construction block is responsible for reconstructing high‐quality images.Designed heterogeneous architecture can not only facilitate richer structural information,but also be lightweight,which is suitable for mobile digital devices.Experimental results show that our method is more competitive in terms of performance,recovering time of image super‐resolution and complexity.The code of DSRNet can be obtained at https://github.com/hellloxiaotian/DSRNet.展开更多
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.展开更多
The mobility of service providers brings new features into the research of dynamic network based service composition.From an optimistic perspective,the mobility of services could benefit the optimization of service co...The mobility of service providers brings new features into the research of dynamic network based service composition.From an optimistic perspective,the mobility of services could benefit the optimization of service composition,if properly handled.Therefore,the impacts of node mobility on the dynamic network based service composition are investigated.Then,a movement-assisted optimization method,namely MASCO,is proposed to improve the performance of the composited services by minimizing the length of data stream and the hop-counts of the service routes in the underlying networks.The correctness and efficiency of the proposed method are then verified through theoretical analysis and computer simulations.展开更多
Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to tra...Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational complexity.SPDNE tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic NE.Then,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is proposed.The performance of SPDNE over three dynamical NE models(i.e.sparse architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world networks.The experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE models.The results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.展开更多
The central concept of strategic benchmarking is resource management efficiency,which ultimately results in profitability.However,little is known about performance measurement from resource-based perspectives.This stu...The central concept of strategic benchmarking is resource management efficiency,which ultimately results in profitability.However,little is known about performance measurement from resource-based perspectives.This study uses the data envelopment analysis(DEA)model with a dynamic network structure to measure the resource management and profitability efficiencies of 287 US commercial banks from 2010 to 2020.Furthermore,we provide frontier projections and incorporate five variables,namely capital adequacy,asset quality,management quality,earning ability,and liquidity(i.e.,the CAMEL ratings).The results revealed that the room for improvement in bank performance is 55.4%.In addition,we found that the CAMEL ratings of efficient banks are generally higher than those of inefficient banks,and management quality,earnings quality,and liquidity ratios positively contribute to bank performance.Moreover,big banks are generally more efficient than small banks.Overall,this study continues the current heated debate on performance measurement in the banking industry,with a particular focus on the DEA application to answer the fundamental question of why resource management efficiency reflects benchmark firms and provides insights into how efficient management of CAMEL ratings would help in improving their performance.展开更多
We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In ...We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.展开更多
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.展开更多
Leukemia is a malignant disease characterized by progressive accumulation with high morbidity and mortality rates,and investigating its disease genes is crucial for understanding its etiology and pathogenesis.Network ...Leukemia is a malignant disease characterized by progressive accumulation with high morbidity and mortality rates,and investigating its disease genes is crucial for understanding its etiology and pathogenesis.Network propagation methods have emerged and been widely employed in disease gene prediction,but most of them focus on static biological networks,which hinders their applicability and effectiveness in the study of progressive diseases.Moreover,there is currently a lack of special algorithms for the identification of leukemia disease genes.Here,we proposed a novel Dynamic Network-based model integrating Differentially expressed Genes(DyNDG)to identify leukemia-related genes.Initially,we constructed a time-series dynamic network to model the development trajectory of leukemia.Then,we built a background-temporal multilayer network by integrating both the dynamic network and the static background network,which was initialized with differentially expressed genes at each stage.To quantify the associations between genes and leukemia,we extended a random walk process to the background-temporal multilayer network.The results demonstrate that DyNDG achieves superior accuracy compared to several state-of-the-art methods.Moreover,after excluding housekeeping genes,DyNDG yields a set of promising candidate genes associated with leukemia progression or potential biomarkers,indicating the value of dynamic network information in identifying leukemia-related genes.The implementation of DyNDG is available at both https://ngdc.cncb.ac.cn/biocode/tool/BT7617 and https://github.com/CSUBioGroup/DyNDG.展开更多
For emerging respiratory infectious diseases like COVID-19,non-pharmaceutical interventions such as isolation are crucial for controlling the spread.From the perspective of network transmission,non-pharmaceutical inte...For emerging respiratory infectious diseases like COVID-19,non-pharmaceutical interventions such as isolation are crucial for controlling the spread.From the perspective of network transmission,non-pharmaceutical interventions like isolation alter the degree distribution and other topological structures of the network,thereby controlling the spread of the infectious disease.In this paper,we establish a SEIR mean-field propagation dynamics model for the synchronous evolution of dynamic networks caused by propagation and tracing isolation.We employ the reducing-dimension method to convert the mean-field model in networks into an equivalent and simpler low-dimension model,and then calculate the exact expression of the final size.In addition,we get the differential equations of the degree distribution over time in dynamic networks under tracing isolation and the relationships between the first and second moment of the dynamic network.While the degree of a node remains constant regardless of its state in many previous studies,this paper takes into account that the degree of each node changes over time whatever its state under the disease spread and intervention measures.展开更多
The topological structure of the air transport network is complex and can be analyzed with different approaches,measures and perspectives.In this study a dynamic network analysis is utilized and an additional function...The topological structure of the air transport network is complex and can be analyzed with different approaches,measures and perspectives.In this study a dynamic network analysis is utilized and an additional functional layer,passenger flows,is defined to analyze the flow of connectivity.Therefore,the approach provides additional and differentiated results to assess the European air transport network.The study is based on a time series of monthly European demand and schedule data for the years 2010-2023.This makes the study relevant for the recent evaluation of the European air transport network.The study aims to measure the connectivity of the intra-European network and how this connectivity changes over time.The view on connectivity is extended from accessibility and connectivity to two additional perspectives,competition and robustness.The flow of connec-tivity is assessed using dynamic network analysis,which identifies trends,standard deviation and mean absolute change.This allows comparison of the entire network over time as well as comparisons between airports.This paper introduces a framework that integrates and categorizes a broad range of network analysis measures.It provides a foundation for future developments and practical applications across diverse use cases and other networks.The study demonstrates that the connectivity of the network undergoes changes over time,both in terms of trend and in terms of similarity between airports,with differences evident in the four different perspectives.The accessibility among airports is becoming more uniform,indicating a convergence in connectivity measures.At the same time,airports are becoming increasingly interconnected with less relative importance of hubs.How-ever,the passenger utilization becomes more diverse.Competition among airports has been steadily increasing.Additionally,there is a correlation between demand,competition,and the network’s structure.In less competitive markets,there are fewer travelers and reduced capacity,and airports often exhibit weaker centrality within the network.展开更多
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.展开更多
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.展开更多
Aqueous Zn-metal batteries(AZMBs)performance is hampered by freezing water at low temperatures,which hampers their multi-scenario application.Hydrogen bonds(HBs)play a pivotal role in water freezing,and proton transpo...Aqueous Zn-metal batteries(AZMBs)performance is hampered by freezing water at low temperatures,which hampers their multi-scenario application.Hydrogen bonds(HBs)play a pivotal role in water freezing,and proton transport is indispensable for the establishment of HBs.Here,the accelerated proton transport modulates the dynamic hydrogen bonding network of a Zn(BF4)2/EMIMBF4impregnated polyacrylamide/poly(vinyl alcohol)/xanthan gum dual network eutectic gel electrolyte(PPX-ILZSE)for lowtemperature AZMBs.The PPX-ILZSE forms more HBs,shorter HBs lifetimes,higher tetrahedral entropy,and faster desolvation processes,as demonstrated by experimental and theoretical calculations.This enhanced dynamic proton transport promotes rapid cycling of HBs formation-failure,and for polyaniline cathode(PANI)abundant redox sites of proton,confers excellent low temperature electrochemical performance to the Zn//PANI full cell.Specific capacities for 1000 and 5000 cycles at 1 and 5 A g^(-1)were149.8 and 128.4 m A h g^(-1)at room temperature,respectively.Furthermore,specific capacities of 131.1 mA hg^(-1)(92.4%capacity retention)and 0.0066%capacity decay per lap were achieved for 3000and 3500 laps at-30 and 40℃,respectively,at 0.5 A g^(-1).Furthermore,in-situ protective layer of ZnOHF nano-arrays on the Zn anode surface to eliminate dendrite growth and accelerate Zn-ions adsorption and charge transfer.展开更多
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.展开更多
Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been...Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.展开更多
Epithelial–mesenchymal transition(EMT) is a complex nonlinear biological process that plays essential roles in fundamental biological processes such as embryogenesis, wounding healing, tissue regeneration,and cancer ...Epithelial–mesenchymal transition(EMT) is a complex nonlinear biological process that plays essential roles in fundamental biological processes such as embryogenesis, wounding healing, tissue regeneration,and cancer metastasis. A hallmark of EMT is the switch-like behavior during state transition, which is characteristic of phase transitions. Hence, detecting the tipping point just before mesenchymal state transition is critical for understanding molecular mechanism of EMT. Through dynamic network biomarkers(DNB) model, a DNB group with 37 genes was identified which can provide the early-warning signals of EMT. Particularly, we found that two DNB genes, i.e., SMAD7 and SERPINE1 promoted EMT by switching their regulatory network which was further validated by biological experiments. Survival analyses revealed that SMAD7 and SERPINE1 as DNB genes further acted as prognostic biomarkers for lung adenocarcinoma.展开更多
This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employi...This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.展开更多
The architecture of cislunar multi-hop communication networks, which focuses on the requirements of lunar full-coverage and continuous cislunar communications, is presented on the basis of Geosynchronous Orbit (GEO) s...The architecture of cislunar multi-hop communication networks, which focuses on the requirements of lunar full-coverage and continuous cislunar communications, is presented on the basis of Geosynchronous Orbit (GEO) satellite network relays. According to the geographical distribution of the forthcoming Chinese Deep Space Measuring and Controlling Network (DSMCN), two networking schemes are proposed and two elevation angle optimization models are established for locating GEO relay satellites. To analyze the dynamic connectivity, a dynamic network model is constructed with respect to the time-varying characteristics of cislunar trunk links. The advantages of the two proposed schemes, in terms of the Connectivity Rate (CR), Interruption Frequency (IF), and Average Length of Connecting Duration (ALCD), are corroborated by several simulations. In the case of the lunar polar orbit constellation case, the gains in the performance of scheme I are observed to be 134.55%, 117.03%, and 217.47% compared with DSMCN for three evaluation indicators, and the gains in the performance of scheme II are observed to be 238. 22%, 240.40%, and 572.71%. The results validate that the connectivity of GEO satellites outperforms that of earth facilities significantly and schemes based on GEO satellite relays are promising options for cislunar multi-hop communication networking.展开更多
基金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.
基金the TCL Science and Technology Innovation Fundthe Youth Science and Technology Talent Promotion Project of Jiangsu Association for Science and Technology,Grant/Award Number:JSTJ‐2023‐017+4 种基金Shenzhen Municipal Science and Technology Innovation Council,Grant/Award Number:JSGG20220831105002004National Natural Science Foundation of China,Grant/Award Number:62201468Postdoctoral Research Foundation of China,Grant/Award Number:2022M722599the Fundamental Research Funds for the Central Universities,Grant/Award Number:D5000210966the Guangdong Basic and Applied Basic Research Foundation,Grant/Award Number:2021A1515110079。
文摘Convolutional neural networks depend on deep network architectures to extract accurate information for image super‐resolution.However,obtained information of these con-volutional neural networks cannot completely express predicted high‐quality images for complex scenes.A dynamic network for image super‐resolution(DSRNet)is presented,which contains a residual enhancement block,wide enhancement block,feature refine-ment block and construction block.The residual enhancement block is composed of a residual enhanced architecture to facilitate hierarchical features for image super‐resolution.To enhance robustness of obtained super‐resolution model for complex scenes,a wide enhancement block achieves a dynamic architecture to learn more robust information to enhance applicability of an obtained super‐resolution model for varying scenes.To prevent interference of components in a wide enhancement block,a refine-ment block utilises a stacked architecture to accurately learn obtained features.Also,a residual learning operation is embedded in the refinement block to prevent long‐term dependency problem.Finally,a construction block is responsible for reconstructing high‐quality images.Designed heterogeneous architecture can not only facilitate richer structural information,but also be lightweight,which is suitable for mobile digital devices.Experimental results show that our method is more competitive in terms of performance,recovering time of image super‐resolution and complexity.The code of DSRNet can be obtained at https://github.com/hellloxiaotian/DSRNet.
基金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.
基金Supported by the National Natural Science Foundation of China(No.61070182,60873192)
文摘The mobility of service providers brings new features into the research of dynamic network based service composition.From an optimistic perspective,the mobility of services could benefit the optimization of service composition,if properly handled.Therefore,the impacts of node mobility on the dynamic network based service composition are investigated.Then,a movement-assisted optimization method,namely MASCO,is proposed to improve the performance of the composited services by minimizing the length of data stream and the hop-counts of the service routes in the underlying networks.The correctness and efficiency of the proposed method are then verified through theoretical analysis and computer simulations.
基金National Natural Science Foundation of China,Grant/Award Numbers:62173236,61876110,61806130,61976142,82304204.
文摘Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature space.However,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational complexity.SPDNE tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic NE.Then,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is proposed.The performance of SPDNE over three dynamical NE models(i.e.sparse architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world networks.The experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE models.The results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.
基金provided by Ministry of Science and Technology(Grant No.MOST 107-2410-H-034-056-MY3).
文摘The central concept of strategic benchmarking is resource management efficiency,which ultimately results in profitability.However,little is known about performance measurement from resource-based perspectives.This study uses the data envelopment analysis(DEA)model with a dynamic network structure to measure the resource management and profitability efficiencies of 287 US commercial banks from 2010 to 2020.Furthermore,we provide frontier projections and incorporate five variables,namely capital adequacy,asset quality,management quality,earning ability,and liquidity(i.e.,the CAMEL ratings).The results revealed that the room for improvement in bank performance is 55.4%.In addition,we found that the CAMEL ratings of efficient banks are generally higher than those of inefficient banks,and management quality,earnings quality,and liquidity ratios positively contribute to bank performance.Moreover,big banks are generally more efficient than small banks.Overall,this study continues the current heated debate on performance measurement in the banking industry,with a particular focus on the DEA application to answer the fundamental question of why resource management efficiency reflects benchmark firms and provides insights into how efficient management of CAMEL ratings would help in improving their performance.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.71801066 and 71431003)the Fundamental Research Funds for the Central Universities of China(Grant Nos.PA2019GDQT0020 and JZ2017HGTB0186)
文摘We investigate the similarities and differences among three queue rules,the first-in-first-out(FIFO)rule,last-in-firstout(LIFO)rule and random-in-random-out(RIRO)rule,on dynamical networks with limited buffer size.In our network model,nodes move at each time step.Packets are transmitted by an adaptive routing strategy,combining Euclidean distance and node load by a tunable parameter.Because of this routing strategy,at the initial stage of increasing buffer size,the network density will increase,and the packet loss rate will decrease.Packet loss and traffic congestion occur by these three rules,but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks.If packets are lost and traffic congestion occurs,different dynamic characteristics are shown by these three queue rules.Moreover,a phenomenon similar to Braess’paradox is also found by the LIFO rule and the RIRO rule.
基金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.
基金supported by grants from the National Natural Science Foundation of China(Grant No.62225209)to Min Lithe National Natural Science Foundation of China(Grant No.62472051)to Ju Xiangthe High Performance Computing Center of Central South University,China.
文摘Leukemia is a malignant disease characterized by progressive accumulation with high morbidity and mortality rates,and investigating its disease genes is crucial for understanding its etiology and pathogenesis.Network propagation methods have emerged and been widely employed in disease gene prediction,but most of them focus on static biological networks,which hinders their applicability and effectiveness in the study of progressive diseases.Moreover,there is currently a lack of special algorithms for the identification of leukemia disease genes.Here,we proposed a novel Dynamic Network-based model integrating Differentially expressed Genes(DyNDG)to identify leukemia-related genes.Initially,we constructed a time-series dynamic network to model the development trajectory of leukemia.Then,we built a background-temporal multilayer network by integrating both the dynamic network and the static background network,which was initialized with differentially expressed genes at each stage.To quantify the associations between genes and leukemia,we extended a random walk process to the background-temporal multilayer network.The results demonstrate that DyNDG achieves superior accuracy compared to several state-of-the-art methods.Moreover,after excluding housekeeping genes,DyNDG yields a set of promising candidate genes associated with leukemia progression or potential biomarkers,indicating the value of dynamic network information in identifying leukemia-related genes.The implementation of DyNDG is available at both https://ngdc.cncb.ac.cn/biocode/tool/BT7617 and https://github.com/CSUBioGroup/DyNDG.
基金supported by the National Natural Science Foundation of China(Grant No.12231012,No.U23A20331)Key Research and Development Project in Shanxi Province,China(Grant No.202003D31011/GZ).
文摘For emerging respiratory infectious diseases like COVID-19,non-pharmaceutical interventions such as isolation are crucial for controlling the spread.From the perspective of network transmission,non-pharmaceutical interventions like isolation alter the degree distribution and other topological structures of the network,thereby controlling the spread of the infectious disease.In this paper,we establish a SEIR mean-field propagation dynamics model for the synchronous evolution of dynamic networks caused by propagation and tracing isolation.We employ the reducing-dimension method to convert the mean-field model in networks into an equivalent and simpler low-dimension model,and then calculate the exact expression of the final size.In addition,we get the differential equations of the degree distribution over time in dynamic networks under tracing isolation and the relationships between the first and second moment of the dynamic network.While the degree of a node remains constant regardless of its state in many previous studies,this paper takes into account that the degree of each node changes over time whatever its state under the disease spread and intervention measures.
文摘The topological structure of the air transport network is complex and can be analyzed with different approaches,measures and perspectives.In this study a dynamic network analysis is utilized and an additional functional layer,passenger flows,is defined to analyze the flow of connectivity.Therefore,the approach provides additional and differentiated results to assess the European air transport network.The study is based on a time series of monthly European demand and schedule data for the years 2010-2023.This makes the study relevant for the recent evaluation of the European air transport network.The study aims to measure the connectivity of the intra-European network and how this connectivity changes over time.The view on connectivity is extended from accessibility and connectivity to two additional perspectives,competition and robustness.The flow of connec-tivity is assessed using dynamic network analysis,which identifies trends,standard deviation and mean absolute change.This allows comparison of the entire network over time as well as comparisons between airports.This paper introduces a framework that integrates and categorizes a broad range of network analysis measures.It provides a foundation for future developments and practical applications across diverse use cases and other networks.The study demonstrates that the connectivity of the network undergoes changes over time,both in terms of trend and in terms of similarity between airports,with differences evident in the four different perspectives.The accessibility among airports is becoming more uniform,indicating a convergence in connectivity measures.At the same time,airports are becoming increasingly interconnected with less relative importance of hubs.How-ever,the passenger utilization becomes more diverse.Competition among airports has been steadily increasing.Additionally,there is a correlation between demand,competition,and the network’s structure.In less competitive markets,there are fewer travelers and reduced capacity,and airports often exhibit weaker centrality within the network.
文摘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.
基金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.
基金supported by the National Natural Science Foundation of China(NSFC 52432002,52372041,and 52302087)China Postdoctoral Science Foundation(Grant No.2023 M740895)+1 种基金Heilongjiang Touyan Team Programthe Fundamental Research Funds for the Central Universities(Grant No.HIT.OCEF.2021003 and HIT.DZJJ.2025002)。
文摘Aqueous Zn-metal batteries(AZMBs)performance is hampered by freezing water at low temperatures,which hampers their multi-scenario application.Hydrogen bonds(HBs)play a pivotal role in water freezing,and proton transport is indispensable for the establishment of HBs.Here,the accelerated proton transport modulates the dynamic hydrogen bonding network of a Zn(BF4)2/EMIMBF4impregnated polyacrylamide/poly(vinyl alcohol)/xanthan gum dual network eutectic gel electrolyte(PPX-ILZSE)for lowtemperature AZMBs.The PPX-ILZSE forms more HBs,shorter HBs lifetimes,higher tetrahedral entropy,and faster desolvation processes,as demonstrated by experimental and theoretical calculations.This enhanced dynamic proton transport promotes rapid cycling of HBs formation-failure,and for polyaniline cathode(PANI)abundant redox sites of proton,confers excellent low temperature electrochemical performance to the Zn//PANI full cell.Specific capacities for 1000 and 5000 cycles at 1 and 5 A g^(-1)were149.8 and 128.4 m A h g^(-1)at room temperature,respectively.Furthermore,specific capacities of 131.1 mA hg^(-1)(92.4%capacity retention)and 0.0066%capacity decay per lap were achieved for 3000and 3500 laps at-30 and 40℃,respectively,at 0.5 A g^(-1).Furthermore,in-situ protective layer of ZnOHF nano-arrays on the Zn anode surface to eliminate dendrite growth and accelerate Zn-ions adsorption and charge transfer.
基金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 is supported by the NSFC Major Research Program under Grant No. 60496321, the National Natural Science Foundation of China under Grant No. 60503016, and the National High-Tech Development 863 Program of China under Grant No. 2003AA118020..
文摘Community structure is an important property of network. Being able to identify communities can provide invaluable help in exploiting and understanding both social and non-social networks. Several algorithms have been developed up till now. However, all these algorithms can work well only with small or moderate networks with vertexes of order 104. Besides, all the existing algorithms are off-line and cannot work well with highly dynamic networks such as web, in which web pages are updated frequently. When an already clustered network is updated, the entire network including original and incremental parts has to be recalculated, even though only slight changes are involved. To address this problem, an incremental algorithm is proposed, which allows for mining community structure in large-scale and dynamic networks. Based on the community structure detected previously, the algorithm takes little time to reclassify the entire network including both the original and incremental parts. Furthermore, the algorithm is faster than most of the existing algorithms such as Girvan and Newman＇s algorithm and its improved versions. Also, the algorithm can help to visualize these community structures in network and provide a new approach to research on the evolving process of dynamic networks.
基金supported by the National Key Research and Development Program of China (2017YFA0505500)the National Natural Science Foundation of China (31930022, 31771476, 61773196)+5 种基金Shanghai Municipal Science and Technology Major Project (2017SHZDZX01)Key Project of Zhangjiang National Innovation Demonstration Zone Special Development Fund (ZJ2018ZD-013)Ministry of Science and Technology Project (2017YFC0907505)Guangdong Provincial Key Laboratory Funds (2017B030301018, 2019B030301001)Shenzhen Research Funds (JCYJ20170307104535585, ZDSYS20140509142721429)Shenzhen Peacock Plan (KQTD2016053117035204)
文摘Epithelial–mesenchymal transition(EMT) is a complex nonlinear biological process that plays essential roles in fundamental biological processes such as embryogenesis, wounding healing, tissue regeneration,and cancer metastasis. A hallmark of EMT is the switch-like behavior during state transition, which is characteristic of phase transitions. Hence, detecting the tipping point just before mesenchymal state transition is critical for understanding molecular mechanism of EMT. Through dynamic network biomarkers(DNB) model, a DNB group with 37 genes was identified which can provide the early-warning signals of EMT. Particularly, we found that two DNB genes, i.e., SMAD7 and SERPINE1 promoted EMT by switching their regulatory network which was further validated by biological experiments. Survival analyses revealed that SMAD7 and SERPINE1 as DNB genes further acted as prognostic biomarkers for lung adenocarcinoma.
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.
基金supported by the National High Technology Research and Development Program of P.R.China under Grant No.2012 AA121604 the National Natural Science Foundation of China under Grants No.60902042,No.61170014,No.61202079+1 种基金 the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20090006110014 the Foundation for Key Program of Ministry of Education of China under Grant No.311007
文摘The architecture of cislunar multi-hop communication networks, which focuses on the requirements of lunar full-coverage and continuous cislunar communications, is presented on the basis of Geosynchronous Orbit (GEO) satellite network relays. According to the geographical distribution of the forthcoming Chinese Deep Space Measuring and Controlling Network (DSMCN), two networking schemes are proposed and two elevation angle optimization models are established for locating GEO relay satellites. To analyze the dynamic connectivity, a dynamic network model is constructed with respect to the time-varying characteristics of cislunar trunk links. The advantages of the two proposed schemes, in terms of the Connectivity Rate (CR), Interruption Frequency (IF), and Average Length of Connecting Duration (ALCD), are corroborated by several simulations. In the case of the lunar polar orbit constellation case, the gains in the performance of scheme I are observed to be 134.55%, 117.03%, and 217.47% compared with DSMCN for three evaluation indicators, and the gains in the performance of scheme II are observed to be 238. 22%, 240.40%, and 572.71%. The results validate that the connectivity of GEO satellites outperforms that of earth facilities significantly and schemes based on GEO satellite relays are promising options for cislunar multi-hop communication networking.
