Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interfere...Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).展开更多
Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its ...Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its heterogeneity in the context of planning, software & hardware installation, radio parameters setting, drive testing, optimization, healing and maintenance. These operations are time-consuming, labor & budget-intensive and error-prone if activated manually. Hence new approaches have to be designed and applied to meet those demands in a cost-effective way, Self-organizing networks (SON), is a promising approach to handle manual tasks with autonomous manners. More specifically the self-directed functions (self-planning, self-deployment, self-configuration, self-optimization and self-healing) are aid to reduce capital expenditure (CAPEX), implementation expenditure (IMPEX) and operational expenditure (OPEX). In this study, first we investigate the aforementioned impact factors of cost combined with self-functions. Then, we analyze the relative cost benefits causing from deploying the SON functions, using the economical method to have more precise results concerning those potential benefits. At last, the result shows that there is a significant difference in expenses and revenues of WSP with and without SON after enabling self-functions in wireless network.展开更多
The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nod...The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nodes without the support of the Global Navigation Satellite System(GNSS)and other prior information remains a formidable challenge to real-time wireless networks design.Therefore,a self-organizing network methodology based on multi-agent negotiation is proposed,which autonomously determines the master node through collaborative negotiation and competitive elections.On this basis,a real-time network protocol design is carried out and a high-precision time synchronization method with motion compensation is proposed.Simulation results demonstrate that the proposed method enables rapid networking with the capability of selfdiscovery,self-organization,and self-healing.For a cluster of 8 satellites,the networking time and the reorganization time are less than 4 s.The time synchronization accuracy exceeds 10-10s with motion compensation,demonstrating excellent real-time performance and stability.The research presented in this paper provides a valuable reference for the design and application of spacebased self-organizing networks for satellite cluster.展开更多
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 article presents an adaptive fault-tolerant tracking control strategy for unknown affine nonlinear systems subject to actuator faults and external disturbances.To address the hyperparameter initialization challen...This article presents an adaptive fault-tolerant tracking control strategy for unknown affine nonlinear systems subject to actuator faults and external disturbances.To address the hyperparameter initialization challenges inherent in conventional neural network training,an improved self-organizing radial basis function neural network(SRBFNN)with an input-dependent variable structure is developed.Furthermore,a novel selforganizing RBFNN-based observer is introduced to estimate system states across all dimensions.Leveraging the reconstructed states,the proposed adaptive controller effectively compensates for all uncertainties,including estimation errors in the observer,ensuring accurate state tracking with reduced control effort.The uniform ultimate boundedness of all closed-loop signals and tracking errors is rigorously established via Lyapunov stability analysis.Finally,simulations on two different nonlinear systems comprehensively validate the effectiveness and superiority of the proposed control approach.展开更多
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.展开更多
Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performan...Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performance of PINNs in solving the temperature diffusion equation of the seawater across six scenarios,including forward and inverse problems under three different boundary conditions.Results demonstrate that PINNs achieved consistently higher accuracy with the Dirichlet and Neumann boundary conditions compared to the Robin boundary condition for both forward and inverse problems.Inaccurate weighting of terms in the loss function can reduce model accuracy.Additionally,the sensitivity of model performance to the positioning of sampling points varied between different boundary conditions.In particular,the model under the Dirichlet boundary condition exhibited superior robustness to variations in point positions during the solutions of inverse problems.In contrast,for the Neumann and Robin boundary conditions,accuracy declines when points were sampled from identical positions or at the same time.Subsequently,the Argo observations were used to reconstruct the vertical diffusion of seawater temperature in the north-central Pacific for the applicability of PINNs in the real ocean.The PINNs successfully captured the vertical diffusion characteristics of seawater temperature,reflected the seasonal changes of vertical temperature under different topographic conditions,and revealed the influence of topography on the temperature diffusion coefficient.The PINNs were proved effective in solving the temperature diffusion equation of seawater with limited data,providing a promising technique for simulating or predicting ocean phenomena using sparse observations.展开更多
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.展开更多
Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annu...Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.展开更多
Owing to intensified globalization and informatization,the structures of the urban scale hierarchy and urban networks between cities have become increasingly intertwined,resulting in different spatial effects.Therefor...Owing to intensified globalization and informatization,the structures of the urban scale hierarchy and urban networks between cities have become increasingly intertwined,resulting in different spatial effects.Therefore,this paper analyzes the spatial interaction between urban scale hierarchy and urban networks in China from 2019 to 2023,drawing on Baidu migration data and employing a spatial simultaneous equation model.The results reveal a significant positive spatial correlation between cities with higher hierarchy and those with greater network centrality.Within a static framework,we identify a positive interaction between urban scale hierarchy and urban network centrality,while their spatial cross-effects manifest as negative neighborhood interactions based on geographical distance and positive cross-scale interactions shaped by network connections.Within a dynamic framework,changes in urban scale hierarchy and urban networks are mutually reinforcing,thereby widening disparities within the urban hierarchy.Furthermore,an increase in a city’s network centrality had a dampening effect on the population growth of neighboring cities and network-connected cities.This study enhances understanding of the spatial organisation of urban systems and offers insights for coordinated regional development.展开更多
The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our met...The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.展开更多
The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learn...The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed.展开更多
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.展开更多
文摘Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).
文摘Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its heterogeneity in the context of planning, software & hardware installation, radio parameters setting, drive testing, optimization, healing and maintenance. These operations are time-consuming, labor & budget-intensive and error-prone if activated manually. Hence new approaches have to be designed and applied to meet those demands in a cost-effective way, Self-organizing networks (SON), is a promising approach to handle manual tasks with autonomous manners. More specifically the self-directed functions (self-planning, self-deployment, self-configuration, self-optimization and self-healing) are aid to reduce capital expenditure (CAPEX), implementation expenditure (IMPEX) and operational expenditure (OPEX). In this study, first we investigate the aforementioned impact factors of cost combined with self-functions. Then, we analyze the relative cost benefits causing from deploying the SON functions, using the economical method to have more precise results concerning those potential benefits. At last, the result shows that there is a significant difference in expenses and revenues of WSP with and without SON after enabling self-functions in wireless network.
基金supported by the National Natural Science Foundation of China(No.62401597)the Natural Science Foundation of Hunan Province,China(No.2024JJ6469)the Scientific Research Project of National University of Defense Technology,China(No.ZK22-02)。
文摘The information exchange among satellites is crucial for the implementation of cluster satellite cooperative missions.However,achieving fast perception,rapid networking,and highprecision time synchronization among nodes without the support of the Global Navigation Satellite System(GNSS)and other prior information remains a formidable challenge to real-time wireless networks design.Therefore,a self-organizing network methodology based on multi-agent negotiation is proposed,which autonomously determines the master node through collaborative negotiation and competitive elections.On this basis,a real-time network protocol design is carried out and a high-precision time synchronization method with motion compensation is proposed.Simulation results demonstrate that the proposed method enables rapid networking with the capability of selfdiscovery,self-organization,and self-healing.For a cluster of 8 satellites,the networking time and the reorganization time are less than 4 s.The time synchronization accuracy exceeds 10-10s with motion compensation,demonstrating excellent real-time performance and stability.The research presented in this paper provides a valuable reference for the design and application of spacebased self-organizing networks for satellite cluster.
文摘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.
基金supported in part by the National Natural Science Foundation of China(62033008,62188101,62173343,62073339)the Natural Science Foundation of Shandong Province of China(ZR2024MF072,ZR2022ZD34)the Research Fund for the Taishan Scholar Project of Shandong Province of China.
文摘This article presents an adaptive fault-tolerant tracking control strategy for unknown affine nonlinear systems subject to actuator faults and external disturbances.To address the hyperparameter initialization challenges inherent in conventional neural network training,an improved self-organizing radial basis function neural network(SRBFNN)with an input-dependent variable structure is developed.Furthermore,a novel selforganizing RBFNN-based observer is introduced to estimate system states across all dimensions.Leveraging the reconstructed states,the proposed adaptive controller effectively compensates for all uncertainties,including estimation errors in the observer,ensuring accurate state tracking with reduced control effort.The uniform ultimate boundedness of all closed-loop signals and tracking errors is rigorously established via Lyapunov stability analysis.Finally,simulations on two different nonlinear systems comprehensively validate the effectiveness and superiority of the proposed control approach.
文摘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 National Key Research and Development Program of China(No.2023YFC3008200)the Independent Research Project of Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai)(No.SML2022SP505)。
文摘Physics-informed neural networks(PINNs),as a novel artificial intelligence method for solving partial differential equations,are applicable to solve both forward and inverse problems.This study evaluates the performance of PINNs in solving the temperature diffusion equation of the seawater across six scenarios,including forward and inverse problems under three different boundary conditions.Results demonstrate that PINNs achieved consistently higher accuracy with the Dirichlet and Neumann boundary conditions compared to the Robin boundary condition for both forward and inverse problems.Inaccurate weighting of terms in the loss function can reduce model accuracy.Additionally,the sensitivity of model performance to the positioning of sampling points varied between different boundary conditions.In particular,the model under the Dirichlet boundary condition exhibited superior robustness to variations in point positions during the solutions of inverse problems.In contrast,for the Neumann and Robin boundary conditions,accuracy declines when points were sampled from identical positions or at the same time.Subsequently,the Argo observations were used to reconstruct the vertical diffusion of seawater temperature in the north-central Pacific for the applicability of PINNs in the real ocean.The PINNs successfully captured the vertical diffusion characteristics of seawater temperature,reflected the seasonal changes of vertical temperature under different topographic conditions,and revealed the influence of topography on the temperature diffusion coefficient.The PINNs were proved effective in solving the temperature diffusion equation of seawater with limited data,providing a promising technique for simulating or predicting ocean phenomena using sparse observations.
基金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 Key R&D Program of China (GrantN o.2016YFC0401407)National Natural Science Foundation of China (Grant Nos. 51479003 and 51279006)
文摘Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.
基金Under the auspices of the National Natural Science Foundation of China(No.42371222,41971167)Fundamental Scientific Research Funds of Central China Normal University(No.CCNU24ZZ120)。
文摘Owing to intensified globalization and informatization,the structures of the urban scale hierarchy and urban networks between cities have become increasingly intertwined,resulting in different spatial effects.Therefore,this paper analyzes the spatial interaction between urban scale hierarchy and urban networks in China from 2019 to 2023,drawing on Baidu migration data and employing a spatial simultaneous equation model.The results reveal a significant positive spatial correlation between cities with higher hierarchy and those with greater network centrality.Within a static framework,we identify a positive interaction between urban scale hierarchy and urban network centrality,while their spatial cross-effects manifest as negative neighborhood interactions based on geographical distance and positive cross-scale interactions shaped by network connections.Within a dynamic framework,changes in urban scale hierarchy and urban networks are mutually reinforcing,thereby widening disparities within the urban hierarchy.Furthermore,an increase in a city’s network centrality had a dampening effect on the population growth of neighboring cities and network-connected cities.This study enhances understanding of the spatial organisation of urban systems and offers insights for coordinated regional development.
基金supported by the National Natural Science Foundation of China (Grant No 60672095)the National High-Tech Research and Development Program of China (Grant No 2007AA11Z210)+3 种基金the Doctoral Fund of Ministry of Education of China (Grant No 20070286004)the Natural Science Foundation of Jiangsu Province,China (Grant No BK2008281)the Science and Technology Program of Southeast University,China (Grant No KJ2009351)the Excellent Young Teachers Program of Southeast University,China (Grant No BG2007428)
文摘The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.
文摘The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed.
文摘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.
