A class of models for activity-driven networks is proposed in which nodes vary in two states： active and inactive. Only active nodes can receive links from others which represent instantaneous dynamical interactions....A class of models for activity-driven networks is proposed in which nodes vary in two states： active and inactive. Only active nodes can receive links from others which represent instantaneous dynamical interactions. The evolution of the network couples the addition of new nodes and state transitions of old ones. The active group changes with activated nodes entering and deactivated ones leaving. A general differential equation framework is developed to study the degree distribution of nodes of integrated networks where four different schemes are formulated.展开更多
This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid s...This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.展开更多
This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of ...This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of FxTS is independent of the initial values and parameters of the CNs,a modified fixed-time(FxT)stability theorem is proposed,where the ST is determined by an arbitrary positive number given in advance.Then,continuous controller and discontinuous controller are designed to realize the modified FxTS target of CNs.In addition,based on the designed controllers,CNs can achieve synchronization at any given time,or even earlier.And control strategies effectively solve the problem of ST related to the parameters of CNs.Finally,an appropriate simulation example is conducted to examine the effectiveness of the designed control strategies.展开更多
The dynamics of network power response play a crucial role in system stability.However,the integration of power electronic equipment leads to amplitude and angular frequency(abbreviated as"frequency")time-va...The dynamics of network power response play a crucial role in system stability.However,the integration of power electronic equipment leads to amplitude and angular frequency(abbreviated as"frequency")time-varying characteristics of the node voltage during dynamic processes.As a result,traditional calcu-lation methods for and characteristics of the power response of the network based on phasor and impe-dance lose their validity.Therefore,this paper undertakes mathematical calculations to reveal the power response of a network under excitation by voltage with time-varying amplitude and frequency(TVAF),relying on the original mathematical relationships and superimposed step response.Then,the multi-timescale characteristics of both the active and reactive power of the network are explored physically.Additionally,this paper reveals a new phenomenon of storing and releasing the active and reactive power of the network.To meet practical engineering requirements,a simplified power expression is presented.Finally,the theoretical analysis is validated through time-domain simulations.展开更多
This paper investigates a class of constrained distributed zeroth-order optimization(ZOO) problems over timevarying unbalanced graphs while ensuring privacy preservation among individual agents. Not taking into accoun...This paper investigates a class of constrained distributed zeroth-order optimization(ZOO) problems over timevarying unbalanced graphs while ensuring privacy preservation among individual agents. Not taking into account recent progress and addressing these concerns separately, there remains a lack of solutions offering theoretical guarantees for both privacy protection and constrained ZOO over time-varying unbalanced graphs.We hereby propose a novel algorithm, termed the differential privacy(DP) distributed push-sum based zeroth-order constrained optimization algorithm(DP-ZOCOA). Operating over time-varying unbalanced graphs, DP-ZOCOA obviates the need for supplemental suboptimization problem computations, thereby reducing overhead in comparison to distributed primary-dual methods. DP-ZOCOA is specifically tailored to tackle constrained ZOO problems over time-varying unbalanced graphs,offering a guarantee of convergence to the optimal solution while robustly preserving privacy. Moreover, we provide rigorous proofs of convergence and privacy for DP-ZOCOA, underscoring its efficacy in attaining optimal convergence without constraints. To enhance its applicability, we incorporate DP-ZOCOA into the federated learning framework and formulate a decentralized zeroth-order constrained federated learning algorithm(ZOCOA-FL) to address challenges stemming from the timevarying imbalance of communication topology. Finally, the performance and effectiveness of the proposed algorithms are thoroughly evaluated through simulations on distributed least squares(DLS) and decentralized federated learning(DFL) tasks.展开更多
The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynam...The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynamic agents belong to distinct groups.Interactions are cooperative-antagonistic within each group and sign-in-degree balanced across the inter-groups.Firstly,a state feedback control protocol is designed to ensure that the trajectories of followers in diverse groups can converge to distinct convex hulls formed by their corresponding leaders,respectively.As an extension,the bipartite control problem with time-variant formation for the multi-agent system(MAS)is also considered,and a corresponding control protocol with formation compensation vectors is given.Finally,in view of Lyapunov stability theory and matrix inequality,the sufficient conditions for realizing the bipartite containment control are obtained,and several simulations are provided to verify the validity of the above methods.展开更多
Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review a...To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review and SwissADME platform.Genes related to the inflammation were collected using Genecards and OMIM databases,and the intersection genes were submitted on STRING and DAVID websites.Then,the protein interaction network(PPI),gene ontology(GO)and pathway(KEGG)were analyzed.Cytoscape 3.7.2 software was used to construct the“Hibiscus mutabilis L.-active ingredient-target-inflammation”network diagram,and AutoDockTools-1.5.6 software was used for the molecular docking verification.The antiinflammatory effect of Hibiscus mutabilis L.active ingredient was verified by the RAW264.7 inflammatory cell model.The results showed that 11 active components and 94 potential targets,1029 inflammatory targets and 24 intersection targets were obtained from Hibiscus mutabilis L..The key anti-inflammatory active ingredients of Hibiscus mutabilis L.are quercetin,apigenin and luteolin.Its action pathway is mainly related to NF-κB,cancer pathway and TNF signaling pathway.Cell experiments showed that total flavonoids of Hibiscus mutabilis L.could effectively inhibit the expression of tumor necrosis factor(TNF-α),interleukin 8(IL-8)and epidermal growth factor receptor(EGFR)in LPS-induced RAW 264.7 inflammatory cells.It also downregulates the phosphorylation of human nuclear factor ĸB inhibitory protein α(IĸBα)and NF-κB p65 subunit protein(p65).Overall,the anti-inflammatory effect of Hibiscus mutabilis L.is related to many active components,many signal pathways and targets,which provides a theoretical basis for its further development and application.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induc...Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induced delays,packet dropouts,and packet disorders.Despite significant advancements,the increasing complexity and dynamism of network environments,along with the growing complexity of systems,pose new challenges for NPC.These challenges include difficulties in system modeling,cyber attacks,component faults,limited network bandwidth,and the necessity for distributed collaboration.This survey aims to provide a comprehensive review of NPC strategies.It begins with a summary of the primary challenges faced by NCSs,followed by an introduction to the control structure and core concepts of NPC.The survey then discusses several typical NPC schemes and examines their extensions in the areas of secure control,fault-tolerant control,distributed coordinated control,and event-triggered control.Moreover,it reviews notable works that have implemented these schemes.Finally,the survey concludes by exploring typical applications of NPC schemes and highlighting several challenging issues that could guide future research efforts.展开更多
Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for so...Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.展开更多
With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intr...With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intrusion detection systems(NIDS)have been extensively studied,and recent efforts have shifted toward integrating distributed learning to enable intelligent and scalable detection mechanisms.However,most existing works focus on individual distributed learning frameworks,and there is a lack of systematic evaluations that compare different algorithms under consistent conditions.In this paper,we present a comprehensive evaluation of representative distributed learning frameworks—Federated Learning(FL),Split Learning(SL),hybrid collaborative learning(SFL),and fully distributed learning—in the context of AI-driven NIDS.Using recent benchmark intrusion detection datasets,a unified model backbone,and controlled distributed scenarios,we assess these frameworks across multiple criteria,including detection performance,communication cost,computational efficiency,and convergence behavior.Our findings highlight distinct trade-offs among the distributed learning frameworks,demonstrating that the optimal choice depends strongly on systemconstraints such as bandwidth availability,node resources,and data distribution.This work provides the first holistic analysis of distributed learning approaches for AI-driven NIDS and offers practical guidelines for designing secure and efficient intrusion detection systems in decentralized environments.展开更多
Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present so...Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.展开更多
With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a ...With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.展开更多
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h...In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.展开更多
Dear Editor,The letter proposes a tensor low-rank orthogonal compression(TLOC)model for a convolutional neural network(CNN),which facilitates its efficient and highly-accurate low-rank representation.Model compression...Dear Editor,The letter proposes a tensor low-rank orthogonal compression(TLOC)model for a convolutional neural network(CNN),which facilitates its efficient and highly-accurate low-rank representation.Model compression is crucial for deploying deep neural network(DNN)models on resource-constrained embedded devices.展开更多
Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relati...Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relationships among nodes.This paper proposes a novel graph coupling convolutional model that introduces an adaptive weighting mechanism to assign distinct importance to neighboring nodes based on their similarity to the central node.Unlike traditional methods,the proposed coupling strategy enhances the interpretability of node interactions while maintaining competitive classification performance.The model operates in the spatial domain,utilizing adjacency list structures for efficient convolution and addressing the limitations of weight sharing through a coupling-based similarity computation.Extensive experiments are conducted on five graph-structured datasets,including Cora,Citeseer,PubMed,Reddit,and BlogCatalog,as well as a custom topology dataset constructed from the Open University Learning Analytics Dataset(OULAD)educational platform.Results demonstrate that the proposed model achieves good classification accuracy,while significantly reducing training time through direct second-order neighbor fusion and data preprocessing.Moreover,analysis of neighborhood order reveals that considering third-order neighbors offers limited accuracy gains but introduces considerable computational overhead,confirming the efficiency of first-and second-order convolution in practical applications.Overall,the proposed graph coupling model offers a lightweight,interpretable,and effective framework for multi-label node classification in complex networks.展开更多
Dear Editor,This letter deals with the distributed recursive set-membership filtering(DRSMF)issue for state-saturated systems under encryption-decryption mechanism.To guarantee the data security,the encryption-decrypt...Dear Editor,This letter deals with the distributed recursive set-membership filtering(DRSMF)issue for state-saturated systems under encryption-decryption mechanism.To guarantee the data security,the encryption-decryption mechanism is considered in the signal transmission process.Specifically,a novel DRSMF scheme is developed such that,for both state saturation and encryption-decryption mechanism,the filtering error(FE)is limited to the ellipsoid domain.Then,the filtering error constraint matrix(FECM)is computed and a desirable filter gain is derived by minimizing the FECM.Besides,the bound-edness evaluation of the FECM is provided.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11665009)the Natural Science Research Project of Guizhou Provincial Education Bureau(Grant No.KY[2015]355)
文摘A class of models for activity-driven networks is proposed in which nodes vary in two states： active and inactive. Only active nodes can receive links from others which represent instantaneous dynamical interactions. The evolution of the network couples the addition of new nodes and state transitions of old ones. The active group changes with activated nodes entering and deactivated ones leaving. A general differential equation framework is developed to study the degree distribution of nodes of integrated networks where four different schemes are formulated.
基金Project supported by Jilin Provincial Science and Technology Development Plan(Grant No.20220101137JC).
文摘This paper study the finite time internal synchronization and the external synchronization(hybrid synchronization)for duplex heterogeneous complex networks by time-varying intermittent control.There few study hybrid synchronization of heterogeneous duplex complex networks.Therefore,we study the finite time hybrid synchronization of heterogeneous duplex networks,which employs the time-varying intermittent control to drive the duplex heterogeneous complex networks to achieve hybrid synchronization in finite time.To be specific,the switch frequency of the controllers can be changed with time by devise Lyapunov function and boundary function,the internal synchronization and external synchronization are achieved simultaneously in finite time.Finally,numerical examples are presented to illustrate the validness of theoretical results.
基金Supported by the National Natural Science Foundation of China(62476082)。
文摘This paper investigates modified fixed-time synchronization(FxTS)of complex networks(CNs)with time-varying delays based on continuous and discontinuous controllers.First,for the sake of making the settling time(ST)of FxTS is independent of the initial values and parameters of the CNs,a modified fixed-time(FxT)stability theorem is proposed,where the ST is determined by an arbitrary positive number given in advance.Then,continuous controller and discontinuous controller are designed to realize the modified FxTS target of CNs.In addition,based on the designed controllers,CNs can achieve synchronization at any given time,or even earlier.And control strategies effectively solve the problem of ST related to the parameters of CNs.Finally,an appropriate simulation example is conducted to examine the effectiveness of the designed control strategies.
基金supported in part by the National Natural Science Fundation of China(52225704 and 52107096).
文摘The dynamics of network power response play a crucial role in system stability.However,the integration of power electronic equipment leads to amplitude and angular frequency(abbreviated as"frequency")time-varying characteristics of the node voltage during dynamic processes.As a result,traditional calcu-lation methods for and characteristics of the power response of the network based on phasor and impe-dance lose their validity.Therefore,this paper undertakes mathematical calculations to reveal the power response of a network under excitation by voltage with time-varying amplitude and frequency(TVAF),relying on the original mathematical relationships and superimposed step response.Then,the multi-timescale characteristics of both the active and reactive power of the network are explored physically.Additionally,this paper reveals a new phenomenon of storing and releasing the active and reactive power of the network.To meet practical engineering requirements,a simplified power expression is presented.Finally,the theoretical analysis is validated through time-domain simulations.
基金supported in part by the National Key Research and Development Program of China(2022ZD0120001)the National Natural Science Foundation of China(62233004,62273090,62073076)the Jiangsu Provincial Scientific Research Center of Applied Mathematics(BK20233002)
文摘This paper investigates a class of constrained distributed zeroth-order optimization(ZOO) problems over timevarying unbalanced graphs while ensuring privacy preservation among individual agents. Not taking into account recent progress and addressing these concerns separately, there remains a lack of solutions offering theoretical guarantees for both privacy protection and constrained ZOO over time-varying unbalanced graphs.We hereby propose a novel algorithm, termed the differential privacy(DP) distributed push-sum based zeroth-order constrained optimization algorithm(DP-ZOCOA). Operating over time-varying unbalanced graphs, DP-ZOCOA obviates the need for supplemental suboptimization problem computations, thereby reducing overhead in comparison to distributed primary-dual methods. DP-ZOCOA is specifically tailored to tackle constrained ZOO problems over time-varying unbalanced graphs,offering a guarantee of convergence to the optimal solution while robustly preserving privacy. Moreover, we provide rigorous proofs of convergence and privacy for DP-ZOCOA, underscoring its efficacy in attaining optimal convergence without constraints. To enhance its applicability, we incorporate DP-ZOCOA into the federated learning framework and formulate a decentralized zeroth-order constrained federated learning algorithm(ZOCOA-FL) to address challenges stemming from the timevarying imbalance of communication topology. Finally, the performance and effectiveness of the proposed algorithms are thoroughly evaluated through simulations on distributed least squares(DLS) and decentralized federated learning(DFL) tasks.
基金National Natural Science Foundation of China(No.12071370)。
文摘The bipartite containment control problem for heterogeneous nonlinear multi-agent systems(HNMASs)within multi-group networks under signed digraphs is investigated,where the first-order and second-order nonlinear dynamic agents belong to distinct groups.Interactions are cooperative-antagonistic within each group and sign-in-degree balanced across the inter-groups.Firstly,a state feedback control protocol is designed to ensure that the trajectories of followers in diverse groups can converge to distinct convex hulls formed by their corresponding leaders,respectively.As an extension,the bipartite control problem with time-variant formation for the multi-agent system(MAS)is also considered,and a corresponding control protocol with formation compensation vectors is given.Finally,in view of Lyapunov stability theory and matrix inequality,the sufficient conditions for realizing the bipartite containment control are obtained,and several simulations are provided to verify the validity of the above methods.
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
文摘To explore the material basis and mechanisms of the anti-inflammatory effects of Hibiscus mutabilis L..The active ingredients and potential targets of Hibiscus mutabilis L.were obtained through the literature review and SwissADME platform.Genes related to the inflammation were collected using Genecards and OMIM databases,and the intersection genes were submitted on STRING and DAVID websites.Then,the protein interaction network(PPI),gene ontology(GO)and pathway(KEGG)were analyzed.Cytoscape 3.7.2 software was used to construct the“Hibiscus mutabilis L.-active ingredient-target-inflammation”network diagram,and AutoDockTools-1.5.6 software was used for the molecular docking verification.The antiinflammatory effect of Hibiscus mutabilis L.active ingredient was verified by the RAW264.7 inflammatory cell model.The results showed that 11 active components and 94 potential targets,1029 inflammatory targets and 24 intersection targets were obtained from Hibiscus mutabilis L..The key anti-inflammatory active ingredients of Hibiscus mutabilis L.are quercetin,apigenin and luteolin.Its action pathway is mainly related to NF-κB,cancer pathway and TNF signaling pathway.Cell experiments showed that total flavonoids of Hibiscus mutabilis L.could effectively inhibit the expression of tumor necrosis factor(TNF-α),interleukin 8(IL-8)and epidermal growth factor receptor(EGFR)in LPS-induced RAW 264.7 inflammatory cells.It also downregulates the phosphorylation of human nuclear factor ĸB inhibitory protein α(IĸBα)and NF-κB p65 subunit protein(p65).Overall,the anti-inflammatory effect of Hibiscus mutabilis L.is related to many active components,many signal pathways and targets,which provides a theoretical basis for its further development and application.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
基金supported by the National Natural Science Foundation of China(62173002,62403235,62403010,52301408,62173255)the Beijing Natural Science Foundation(L241015,4222045)+2 种基金the Yuxiu Innovation Project of NCUT(2024NCUTYXCX111)the China Postdoctoral Science Foundation(2025T180466)the Beijing Postdoctoral Research Foundation(2025-ZZ-70)。
文摘Networked predictive control(NPC) has gained significant attention in recent years for its ability to effectively and actively address communication constraints in networked control systems(NCSs),such as network-induced delays,packet dropouts,and packet disorders.Despite significant advancements,the increasing complexity and dynamism of network environments,along with the growing complexity of systems,pose new challenges for NPC.These challenges include difficulties in system modeling,cyber attacks,component faults,limited network bandwidth,and the necessity for distributed collaboration.This survey aims to provide a comprehensive review of NPC strategies.It begins with a summary of the primary challenges faced by NCSs,followed by an introduction to the control structure and core concepts of NPC.The survey then discusses several typical NPC schemes and examines their extensions in the areas of secure control,fault-tolerant control,distributed coordinated control,and event-triggered control.Moreover,it reviews notable works that have implemented these schemes.Finally,the survey concludes by exploring typical applications of NPC schemes and highlighting several challenging issues that could guide future research efforts.
文摘Identifying the community structure of complex networks is crucial to extracting insights and understanding network properties.Although several community detection methods have been proposed,many are unsuitable for social networks due to significant limitations.Specifically,most approaches depend mainly on user-user structural links while overlooking service-centric,semantic,and multi-attribute drivers of community formation,and they also lack flexible filtering mechanisms for large-scale,service-oriented settings.Our proposed approach,called community discovery-based service(CDBS),leverages user profiles and their interactions with consulted web services.The method introduces a novel similarity measure,global similarity interaction profile(GSIP),which goes beyond typical similarity measures by unifying user and service profiles for all attributes types into a coherent representation,thereby clarifying its novelty and contribution.It applies multiple filtering criteria related to user attributes,accessed services,and interaction patterns.Experimental comparisons against Louvain,Hierarchical Agglomerative Clustering,Label Propagation and Infomap show that CDBS reveals the higher performance as it achieves 0.74 modularity,0.13 conductance,0.77 coverage,and significantly fast response time of 9.8 s,even with 10,000 users and 400 services.Moreover,community discoverybased service consistently detects a larger number of communities with distinct topics of interest,underscoring its capacity to generate detailed and efficient structures in complex networks.These results confirm both the efficiency and effectiveness of the proposed method.Beyond controlled evaluation,communities discovery based service is applicable to targeted recommendations,group-oriented marketing,access control,and service personalization,where communities are shaped not only by user links but also by service engagement.
基金supported by the Research year project of the KongjuNational University in 2025 and the Institute of Information&Communications Technology Planning&Evaluation(IITP)grant funded by the Korea government(MSIT)(No.RS-2024-00444170,Research and International Collaboration on Trust Model-Based Intelligent Incident Response Technologies in 6G Open Network Environment).
文摘With the growing complexity and decentralization of network systems,the attack surface has expanded,which has led to greater concerns over network threats.In this context,artificial intelligence(AI)-based network intrusion detection systems(NIDS)have been extensively studied,and recent efforts have shifted toward integrating distributed learning to enable intelligent and scalable detection mechanisms.However,most existing works focus on individual distributed learning frameworks,and there is a lack of systematic evaluations that compare different algorithms under consistent conditions.In this paper,we present a comprehensive evaluation of representative distributed learning frameworks—Federated Learning(FL),Split Learning(SL),hybrid collaborative learning(SFL),and fully distributed learning—in the context of AI-driven NIDS.Using recent benchmark intrusion detection datasets,a unified model backbone,and controlled distributed scenarios,we assess these frameworks across multiple criteria,including detection performance,communication cost,computational efficiency,and convergence behavior.Our findings highlight distinct trade-offs among the distributed learning frameworks,demonstrating that the optimal choice depends strongly on systemconstraints such as bandwidth availability,node resources,and data distribution.This work provides the first holistic analysis of distributed learning approaches for AI-driven NIDS and offers practical guidelines for designing secure and efficient intrusion detection systems in decentralized environments.
基金supported in part by the National Natural Science Foundation of China(62273255,62350003,62088101)the Shanghai Science and Technology Cooperation Project(22510712000,21550760900)+1 种基金the Shanghai Municipal Science and Technology Major Project(2021SHZDZX0100)the Fundamental Research Funds for the Central Universities
文摘Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.
基金National Natural Science Foundation of China(Grant No.62103434)National Science Fund for Distinguished Young Scholars(Grant No.62176263).
文摘With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.
基金funding from the European Commission by the Ruralities project(grant agreement no.101060876).
文摘In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services.
基金supported by the Science and Technology Innovation Key R&D Program of Chongqing(CSTB2025TIAD-STX0032)National Key Research and Development Program of China(2024YFF0908200)+1 种基金the Chongqing Technology Innovation and Application Development Special Key Project(CSTB2024TIAD-KPX0018)the Southwest University Graduate Student Research Innovation(SWUB24051)。
文摘Dear Editor,The letter proposes a tensor low-rank orthogonal compression(TLOC)model for a convolutional neural network(CNN),which facilitates its efficient and highly-accurate low-rank representation.Model compression is crucial for deploying deep neural network(DNN)models on resource-constrained embedded devices.
基金Support by Sichuan Science and Technology Program[2023YFSY0026,2023YFH0004]Guangzhou Huashang University[2024HSZD01,HS2023JYSZH01].
文摘Graph neural networks(GNN)have shown strong performance in node classification tasks,yet most existing models rely on uniform or shared weight aggregation,lacking flexibility in modeling the varying strength of relationships among nodes.This paper proposes a novel graph coupling convolutional model that introduces an adaptive weighting mechanism to assign distinct importance to neighboring nodes based on their similarity to the central node.Unlike traditional methods,the proposed coupling strategy enhances the interpretability of node interactions while maintaining competitive classification performance.The model operates in the spatial domain,utilizing adjacency list structures for efficient convolution and addressing the limitations of weight sharing through a coupling-based similarity computation.Extensive experiments are conducted on five graph-structured datasets,including Cora,Citeseer,PubMed,Reddit,and BlogCatalog,as well as a custom topology dataset constructed from the Open University Learning Analytics Dataset(OULAD)educational platform.Results demonstrate that the proposed model achieves good classification accuracy,while significantly reducing training time through direct second-order neighbor fusion and data preprocessing.Moreover,analysis of neighborhood order reveals that considering third-order neighbors offers limited accuracy gains but introduces considerable computational overhead,confirming the efficiency of first-and second-order convolution in practical applications.Overall,the proposed graph coupling model offers a lightweight,interpretable,and effective framework for multi-label node classification in complex networks.
基金supported by the National Natural Science Foundation of China(12471416,12171124,12301567)the Heilongjiang Provincial Natural Science Foundation of China(PL2024F015)+2 种基金the Postdoctoral Science Foundation of Heilongjiang Province of China(LBH-Z22199)the Fundamental Research Foun-dation for Universities of Heilongjiang Province of China(2022-KYYWF-0141)the Alexander von Humboldt Foundation of Germany.
文摘Dear Editor,This letter deals with the distributed recursive set-membership filtering(DRSMF)issue for state-saturated systems under encryption-decryption mechanism.To guarantee the data security,the encryption-decryption mechanism is considered in the signal transmission process.Specifically,a novel DRSMF scheme is developed such that,for both state saturation and encryption-decryption mechanism,the filtering error(FE)is limited to the ellipsoid domain.Then,the filtering error constraint matrix(FECM)is computed and a desirable filter gain is derived by minimizing the FECM.Besides,the bound-edness evaluation of the FECM is provided.
