Providing the required metrics for different service respectively is a basic characteristic in multi-service networks. The different service can be accessed and forwarded differently to provide the different transmiss...Providing the required metrics for different service respectively is a basic characteristic in multi-service networks. The different service can be accessed and forwarded differently to provide the different transmission performance. The state information between admission control and scheduling can be exchanged each other by the defined correlation coefficient to adjust the flow distribution in progress. The priority queue length measured by scheduler implicitly can describe the priority flows load. And the fair rate can describe the non-priority flows load. Different admission decision will be made according to the state of scheduler to assure the time-delay upper threshold for the priority flows under heavy load and the fairness for elastic flows in light load, respectively. The stability condition was conduced and proved. Simulation results show the policy can ensure both the delay for the priority flows and the minimal throughput for non-priority flows.展开更多
Multi-service aggregated transmission is the direction of IP network. Providing different Quality of Service (QoS) assurance for different services has become a crucial problem in future network. Admission control is ...Multi-service aggregated transmission is the direction of IP network. Providing different Quality of Service (QoS) assurance for different services has become a crucial problem in future network. Admission control is a vital function for multi-service IP network. This paper proposes a novel fuzzy admission control scheme based on coarse granularity service-aware technique. Different service has discriminative sensitivity to the same QoS characteristic parameter in general. The traffic class can be perceived by the service request parameter and the proposed QoS function. And requirements of dif- ferent applications can be met by maintaining the life parameter. From simulation results, the proposed scheme shows a better QoS provisioning than those traditional fuzzy logic based methods under the same admission probability.展开更多
In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overl...In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overlooking congestion issues on feeder links caused by the limited number and centralized distribution of ground stations.Hence,a multi-service routing algorithm called the Multi-service Load Bal-ancing Routing Algorithm for Traffic Return(MLB-TR)is proposed.Unlike traditional approaches,MLB-TR aims to achieve a broader and more comprehensive load balancing objective.Specifically,based on the service type,an appropriate landing satellite is first selected by considering factors such as shortest path hop count and satellite load.Then,a set of candidate paths from the source satellite to the selected landing satellite is computed.Finally,using the regional load balancing index as the optimization objective,the final transmission path is selected from the candidate path set.Simulation results show that the proposed algo-rithm outperforms the existing works.展开更多
Multi-service SDH networks support both packet- and circuit-switched traffic. Optimal design of such a network means to guarantee the circuit connections and configure a logical packet-switched topology with lowest co...Multi-service SDH networks support both packet- and circuit-switched traffic. Optimal design of such a network means to guarantee the circuit connections and configure a logical packet-switched topology with lowest congestion. This letter first formulates the problem as a mixed integer linear programming, which achieves optimal solution but has high computation. Then a heuristic algorithm is proposed to yield near-optimal solution efficiently. Performance of the algorithm is verified by an example.展开更多
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.展开更多
The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-gener...The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.展开更多
This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential g...This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.展开更多
Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and ...Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.展开更多
The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.H...The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.展开更多
This paper is dedicated to fixed-time passivity and synchronization for multi-weighted spatiotemporal directed networks.First,to achieve fixed-time passivity,a type of decentralized power-law controller is developed,i...This paper is dedicated to fixed-time passivity and synchronization for multi-weighted spatiotemporal directed networks.First,to achieve fixed-time passivity,a type of decentralized power-law controller is developed,in which only one parameter needs to be adjusted in the power-law terms;this greatly decreases the inconvenience of parameter adjustment.Second,several fixed-time passivity criteria with LMI forms are derived by using a Gauss divergence theorem to deal with the spatial diffusion of nodes and by applying the Hölder’s inequality to dispose rigorously the power-law term greater than one in the designed control scheme;this improves the previous theoretical analysis.Additionally,the fixed-time synchronization of spatiotemporal directed networks with multi-weights is addressed as a direct result of fixed-time strict passivity.Finally,a numerical example is presented in order to show the validity of the theoretical analysis.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow fie...The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.展开更多
Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the...Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.展开更多
With the challenge of great growing of services diversity,service-oriented supporting ability is required by current high-speed passive optical network( PON). Aimed at enhancing the quality of service( Qo S) brought b...With the challenge of great growing of services diversity,service-oriented supporting ability is required by current high-speed passive optical network( PON). Aimed at enhancing the quality of service( Qo S) brought by diversified-services,this study proposes an echo state network( ESN)based multi-service awareness mechanism in 10-Gigabite ethernet passive optical network( 10GEPON). In the proposed approach,distributed architecture is adopted to realize this ESN based multi-service awareness. According to the network architecture of 10G-EPON,where a main ESN is running in OLT and a number of ESN agents works in ONUs. The main-ESN plays the main function of service-awareness from the total view of various kinds of services in 10G-EPON system,by full ESN training. Then,the reservoir information of well-trained ESN in OLT will be broadcasted to all ONUs and those ESN agents working in ONUs are allowed to conduct independent service-awareness function. Thus,resources allocation and transport policy are both determined only in ONUs. Simulation results show that the proposed mechanism is able to better support the ability of multiple services.展开更多
In this paper model of integrated voice/data cellular wireless networks (CWN) are investigated. The unified approximate approach to calculate the desired Quality of Service (QoS) metrics in an isolated cell of such ne...In this paper model of integrated voice/data cellular wireless networks (CWN) are investigated. The unified approximate approach to calculate the desired Quality of Service (QoS) metrics in an isolated cell of such networks under two multi-parametric call admission control (CAC) strategies is developed. One of them is based on the guard channels scheme while the second is based on a threshold scheme. Results of the numerical experiments are given and a comparison of QoS metrics under different CAC strategies is carried out.展开更多
Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the u...Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the use of virtual reality(VR)technology.VR has been demonstrated to be an effective treatment for pain associated with medical procedures,as well as for chronic pain conditions for which no effective treatment has been established.The precise mechanism by which the diversion from reality facilitated by VR contributes to the diminution of pain and anxiety has yet to be elucidated.However,the provision of positive images through VR-based visual stimulation may enhance the functionality of brain networks.The salience network is diminished,while the default mode network is enhanced.Additionally,the medial prefrontal cortex may establish a stronger connection with the default mode network,which could result in a reduction of pain and anxiety.Further research into the potential of VR technology to alleviate pain could lead to a reduction in the number of individuals who overdose on painkillers and contribute to positive change in the medical field.展开更多
Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently...Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.展开更多
Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in us...Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.展开更多
Deep neural networks(DNNs)are effective in solving both forward and inverse problems for nonlinear partial differential equations(PDEs).However,conventional DNNs are not effective in handling problems such as delay di...Deep neural networks(DNNs)are effective in solving both forward and inverse problems for nonlinear partial differential equations(PDEs).However,conventional DNNs are not effective in handling problems such as delay differential equations(DDEs)and delay integrodifferential equations(DIDEs)with constant delays,primarily due to their low regularity at delayinduced breaking points.In this paper,a DNN method that combines multi-task learning(MTL)which is proposed to solve both the forward and inverse problems of DIDEs.The core idea of this approach is to divide the original equation into multiple tasks based on the delay,using auxiliary outputs to represent the integral terms,followed by the use of MTL to seamlessly incorporate the properties at the breaking points into the loss function.Furthermore,given the increased training dificulty associated with multiple tasks and outputs,we employ a sequential training scheme to reduce training complexity and provide reference solutions for subsequent tasks.This approach significantly enhances the approximation accuracy of solving DIDEs with DNNs,as demonstrated by comparisons with traditional DNN methods.We validate the effectiveness of this method through several numerical experiments,test various parameter sharing structures in MTL and compare the testing results of these structures.Finally,this method is implemented to solve the inverse problem of nonlinear DIDE and the results show that the unknown parameters of DIDE can be discovered with sparse or noisy data.展开更多
基金Supported by the National Natural Science Foundation of China (No. 60872002, 61003237)the Open Research Foundation of National Mobile Communications Research Lab, Southeast University, China (W200912)the Natural Science Foundation of Nantong Universty (No. 08Z025)
文摘Providing the required metrics for different service respectively is a basic characteristic in multi-service networks. The different service can be accessed and forwarded differently to provide the different transmission performance. The state information between admission control and scheduling can be exchanged each other by the defined correlation coefficient to adjust the flow distribution in progress. The priority queue length measured by scheduler implicitly can describe the priority flows load. And the fair rate can describe the non-priority flows load. Different admission decision will be made according to the state of scheduler to assure the time-delay upper threshold for the priority flows under heavy load and the fairness for elastic flows in light load, respectively. The stability condition was conduced and proved. Simulation results show the policy can ensure both the delay for the priority flows and the minimal throughput for non-priority flows.
基金the High-tech Project of Jiangsu Province (No.BG2003001).
文摘Multi-service aggregated transmission is the direction of IP network. Providing different Quality of Service (QoS) assurance for different services has become a crucial problem in future network. Admission control is a vital function for multi-service IP network. This paper proposes a novel fuzzy admission control scheme based on coarse granularity service-aware technique. Different service has discriminative sensitivity to the same QoS characteristic parameter in general. The traffic class can be perceived by the service request parameter and the proposed QoS function. And requirements of dif- ferent applications can be met by maintaining the life parameter. From simulation results, the proposed scheme shows a better QoS provisioning than those traditional fuzzy logic based methods under the same admission probability.
基金supported by the National Key Research and Development Program of China under Grant No.2022YFB2902501the Fundamental Research Funds for the Central Universities under Grant No.2023ZCJH09the Haidian District Golden Bridge Seed Fund of Beijing Municipality under Grant No.S2024161.
文摘In recent years,load balancing routing al-gorithms have been extensively studied in satellite net-works.Most existing studies focus on path selection and hop-count optimization for end-to-end transmis-sion,while overlooking congestion issues on feeder links caused by the limited number and centralized distribution of ground stations.Hence,a multi-service routing algorithm called the Multi-service Load Bal-ancing Routing Algorithm for Traffic Return(MLB-TR)is proposed.Unlike traditional approaches,MLB-TR aims to achieve a broader and more comprehensive load balancing objective.Specifically,based on the service type,an appropriate landing satellite is first selected by considering factors such as shortest path hop count and satellite load.Then,a set of candidate paths from the source satellite to the selected landing satellite is computed.Finally,using the regional load balancing index as the optimization objective,the final transmission path is selected from the candidate path set.Simulation results show that the proposed algo-rithm outperforms the existing works.
文摘Multi-service SDH networks support both packet- and circuit-switched traffic. Optimal design of such a network means to guarantee the circuit connections and configure a logical packet-switched topology with lowest congestion. This letter first formulates the problem as a mixed integer linear programming, which achieves optimal solution but has high computation. Then a heuristic algorithm is proposed to yield near-optimal solution efficiently. Performance of the algorithm is verified by an example.
文摘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.
基金supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(RS-2025-00559546)supported by the IITP(Institute of Information&Coummunications Technology Planning&Evaluation)-ITRC(Information Technology Research Center)grant funded by the Korea government(Ministry of Science and ICT)(IITP-2025-RS-2023-00259004).
文摘The advent of sixth-generation(6G)networks introduces unprecedented challenges in achieving seamless connectivity,ultra-low latency,and efficient resource management in highly dynamic environments.Although fifth-generation(5G)networks transformed mobile broadband and machine-type communications at massive scales,their properties of scaling,interference management,and latency remain a limitation in dense high mobility settings.To overcome these limitations,artificial intelligence(AI)and unmanned aerial vehicles(UAVs)have emerged as potential solutions to develop versatile,dynamic,and energy-efficient communication systems.The study proposes an AI-based UAV architecture that utilizes cooperative reinforcement learning(CoRL)to manage an autonomous network.The UAVs collaborate by sharing local observations and real-time state exchanges to optimize user connectivity,movement directions,allocate power,and resource distribution.Unlike conventional centralized or autonomous methods,CoRL involves joint state sharing and conflict-sensitive reward shaping,which ensures fair coverage,less interference,and enhanced adaptability in a dynamic urban environment.Simulations conducted in smart city scenarios with 10 UAVs and 50 ground users demonstrate that the proposed CoRL-based UAV system increases user coverage by up to 10%,achieves convergence 40%faster,and reduces latency and energy consumption by 30%compared with centralized and decentralized baselines.Furthermore,the distributed nature of the algorithm ensures scalability and flexibility,making it well-suited for future large-scale 6G deployments.The results highlighted that AI-enabled UAV systems enhance connectivity,support ultra-reliable low-latency communications(URLLC),and improve 6G network efficiency.Future work will extend the framework with adaptive modulation,beamforming-aware positioning,and real-world testbed deployment.
文摘This paper investigates the traffic offloading optimization challenge in Space-Air-Ground Integrated Networks(SAGIN)through a novel Recursive Multi-Agent Proximal Policy Optimization(RMAPPO)algorithm.The exponential growth of mobile devices and data traffic has substantially increased network congestion,particularly in urban areas and regions with limited terrestrial infrastructure.Our approach jointly optimizes unmanned aerial vehicle(UAV)trajectories and satellite-assisted offloading strategies to simultaneously maximize data throughput,minimize energy consumption,and maintain equitable resource distribution.The proposed RMAPPO framework incorporates recurrent neural networks(RNNs)to model temporal dependencies in UAV mobility patterns and utilizes a decentralized multi-agent reinforcement learning architecture to reduce communication overhead while improving system robustness.The proposed RMAPPO algorithm was evaluated through simulation experiments,with the results indicating that it significantly enhances the cumulative traffic offloading rate of nodes and reduces the energy consumption of UAVs.
基金funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01296).
文摘Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.
基金supported by the National Key Research and Development Program of China under Grant 2022YFB2901501in part by the Science and Technology Innovation leading Talents Subsidy Project of Central Plains under Grant 244200510038.
文摘The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.
基金supported by the National Natural Science Foundation of China(62373317)the Tianshan Talent Training Program(2022TSYCCX0013)+3 种基金the Key Project of Natural Science Foundation of Xinjiang(2021D01D10)the Basic Research Foundation for Universities of Xinjiang(XJEDU2023P023)the Xinjiang Key Laboratory of Applied Mathematics(XJDX1401)the Intelligent Control and Optimization Research Platform in Xinjiang University.
文摘This paper is dedicated to fixed-time passivity and synchronization for multi-weighted spatiotemporal directed networks.First,to achieve fixed-time passivity,a type of decentralized power-law controller is developed,in which only one parameter needs to be adjusted in the power-law terms;this greatly decreases the inconvenience of parameter adjustment.Second,several fixed-time passivity criteria with LMI forms are derived by using a Gauss divergence theorem to deal with the spatial diffusion of nodes and by applying the Hölder’s inequality to dispose rigorously the power-law term greater than one in the designed control scheme;this improves the previous theoretical analysis.Additionally,the fixed-time synchronization of spatiotemporal directed networks with multi-weights is addressed as a direct result of fixed-time strict passivity.Finally,a numerical example is presented in order to show the validity of the theoretical analysis.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金supported by the National Natural Science Foundation of China(Grant No.12272316).
文摘The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.
基金supported by the Science and Technology Project of Sichuan Electric Power Company“Power Supply Guarantee Strategy for Urban Distribution Networks Considering Coordination with Virtual Power Plant during Extreme Weather Event”(No.521920230003).
文摘Ensuring reliable power supply in urban distribution networks is a complex and critical task.To address the increased demand during extreme scenarios,this paper proposes an optimal dispatch strategy that considers the coordination with virtual power plants(VPPs).The proposed strategy improves systemflexibility and responsiveness by optimizing the power adjustment of flexible resources.In the proposed strategy,theGaussian Process Regression(GPR)is firstly employed to determine the adjustable range of aggregated power within the VPP,facilitating an assessment of its potential contribution to power supply support.Then,an optimal dispatch model based on a leader-follower game is developed to maximize the benefits of the VPP and flexible resources while guaranteeing the power balance at the same time.To solve the proposed optimal dispatch model efficiently,the constraints of the problem are reformulated and resolved using the Karush-Kuhn-Tucker(KKT)optimality conditions and linear programming duality theorem.The effectiveness of the strategy is illustrated through a detailed case study.
基金Supported by the National High Technology Research and Development Programme of China(No.2012AA050804)
文摘With the challenge of great growing of services diversity,service-oriented supporting ability is required by current high-speed passive optical network( PON). Aimed at enhancing the quality of service( Qo S) brought by diversified-services,this study proposes an echo state network( ESN)based multi-service awareness mechanism in 10-Gigabite ethernet passive optical network( 10GEPON). In the proposed approach,distributed architecture is adopted to realize this ESN based multi-service awareness. According to the network architecture of 10G-EPON,where a main ESN is running in OLT and a number of ESN agents works in ONUs. The main-ESN plays the main function of service-awareness from the total view of various kinds of services in 10G-EPON system,by full ESN training. Then,the reservoir information of well-trained ESN in OLT will be broadcasted to all ONUs and those ESN agents working in ONUs are allowed to conduct independent service-awareness function. Thus,resources allocation and transport policy are both determined only in ONUs. Simulation results show that the proposed mechanism is able to better support the ability of multiple services.
文摘In this paper model of integrated voice/data cellular wireless networks (CWN) are investigated. The unified approximate approach to calculate the desired Quality of Service (QoS) metrics in an isolated cell of such networks under two multi-parametric call admission control (CAC) strategies is developed. One of them is based on the guard channels scheme while the second is based on a threshold scheme. Results of the numerical experiments are given and a comparison of QoS metrics under different CAC strategies is carried out.
文摘Medical procedures are inherently invasive and carry the risk of inducing pain to the mind and body.Recently,efforts have been made to alleviate the discomfort associated with invasive medical procedures through the use of virtual reality(VR)technology.VR has been demonstrated to be an effective treatment for pain associated with medical procedures,as well as for chronic pain conditions for which no effective treatment has been established.The precise mechanism by which the diversion from reality facilitated by VR contributes to the diminution of pain and anxiety has yet to be elucidated.However,the provision of positive images through VR-based visual stimulation may enhance the functionality of brain networks.The salience network is diminished,while the default mode network is enhanced.Additionally,the medial prefrontal cortex may establish a stronger connection with the default mode network,which could result in a reduction of pain and anxiety.Further research into the potential of VR technology to alleviate pain could lead to a reduction in the number of individuals who overdose on painkillers and contribute to positive change in the medical field.
基金National Natural Science Foundation of China(11971211,12171388).
文摘Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.
文摘Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.
文摘Deep neural networks(DNNs)are effective in solving both forward and inverse problems for nonlinear partial differential equations(PDEs).However,conventional DNNs are not effective in handling problems such as delay differential equations(DDEs)and delay integrodifferential equations(DIDEs)with constant delays,primarily due to their low regularity at delayinduced breaking points.In this paper,a DNN method that combines multi-task learning(MTL)which is proposed to solve both the forward and inverse problems of DIDEs.The core idea of this approach is to divide the original equation into multiple tasks based on the delay,using auxiliary outputs to represent the integral terms,followed by the use of MTL to seamlessly incorporate the properties at the breaking points into the loss function.Furthermore,given the increased training dificulty associated with multiple tasks and outputs,we employ a sequential training scheme to reduce training complexity and provide reference solutions for subsequent tasks.This approach significantly enhances the approximation accuracy of solving DIDEs with DNNs,as demonstrated by comparisons with traditional DNN methods.We validate the effectiveness of this method through several numerical experiments,test various parameter sharing structures in MTL and compare the testing results of these structures.Finally,this method is implemented to solve the inverse problem of nonlinear DIDE and the results show that the unknown parameters of DIDE can be discovered with sparse or noisy data.
