This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocatio...This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.展开更多
In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its as...In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its associated users on its own bandwidth.We aim at maximizing the overall common throughput in a finite time period.Such a problem is a typical mixed integer nonlinear problem,which involves both continuous-variable and combinatorial optimizations.To efficiently solve this problem,we propose a two-layer algorithm,which separately tackles continuous-variable and combinatorial optimization.Specifically,in the inner layer given one user association scheme,subproblems of bandwidth allocation,power allocation and trajectory design are solved based on alternating optimization.In the outer layer,a small number of candidate user association schemes are generated from an initial scheme and the best solution can be determined by comparing all the candidate schemes.In particular,a clustering algorithm based on K-means is applied to produce all candidate user association schemes,the successive convex optimization technique is adopted in the power allocation subproblem and a logistic function approximation approach is employed in the trajectory design subproblem.Simulation results show that the proposed NOMA scheme outperforms three baseline schemes in downlink common throughput,including one solution proposed in an existing literature.展开更多
Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapmen...Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapment in low-value-added production,and driving industrial upgrading.Given the distinct market environment in which China’s hidden champions have emerged,it is both timely and practically significant to examine their growth trajectories and underlying mechanisms.This study adopts a resource allocation perspective to investigate the development path of Chinese manufacturing enterprises into hidden champions,using a vertical case study of Hailiya Group.The findings reveal that such enterprises achieve hidden champion status by vertically concentrating on niche markets while harnessing technological potential and horizontally diversifying their technology application scenarios.Their growth follows a“T-shaped”strategy,combining vertical specialization in a focused market with horizontal expansion into new applications.Four critical mechanisms underpin the rise of manufacturing hidden champions:market niche positioning,innovation-driven focus,application scenario expansion,and ecosystem development.Specifically,these enterprises strategically target niche markets,establish a technology-oriented competitive edge,broaden technology applications to unlock new profit opportunities,and develop collaborative ecosystems to share resources and drive industrial advancement.This paper not only extends the interpretive boundaries of resource allocation theory but also offers fresh insights into the emergence of Chinese manufacturing enterprises as hidden champions,enriching our understanding of their unique growth dynamics.展开更多
With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements ...With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements imposed by the new medical reform on human resource allocation in public hospitals,examines existing issues such as an unbalanced personnel structure,unscientific job design,and an inadequate talent mobility mechanism,and proposes corresponding optimization strategies.These strategies include improving the recruitment and selection process,scientifically planning job structures,and establishing a flexible talent mobility mechanism.The goal is to enhance the quality of medical services,improve hospital operational efficiency,and promote the sustainable development of public hospitals.展开更多
Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for t...Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for the global ground users.In this paper,the computation offloading problem and resource allocation problem are formulated as a mixed integer nonlinear program(MINLP)problem.This paper proposes a computation offloading algorithm based on deep deterministic policy gradient(DDPG)to obtain the user offloading decisions and user uplink transmission power.This paper uses the convex optimization algorithm based on Lagrange multiplier method to obtain the optimal MEC server resource allocation scheme.In addition,the expression of suboptimal user local CPU cycles is derived by relaxation method.Simulation results show that the proposed algorithm can achieve excellent convergence effect,and the proposed algorithm significantly reduces the system utility values at considerable time cost compared with other algorithms.展开更多
A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV s...A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV swarm needs to detect the environment first and then attack the detected targets.The heterogeneity of UAVs,multiple types of tasks,and the dynamic nature of task environment lead to uneven load and time sequence problems.This paper proposes an improved contract net protocol (CNP) based task allocation scheme,which effectively balances the load of UAVs and improves the task efficiency.Firstly,two types of task models are established,including regional reconnaissance tasks and target attack tasks.Secondly,for regional reconnaissance tasks,an improved CNP algorithm using the uncertain contract is developed.Through uncertain contracts,the area size of the regional reconnaissance task is determined adaptively after this task assignment,which can improve reconnaissance efficiency and resource utilization.Thirdly,for target attack tasks,an improved CNP algorithm using the fuzzy integrated evaluation and the double-layer negotiation is presented to enhance collaborative attack efficiency through adjusting the assignment sequence adaptively and multi-layer allocation.Finally,the effectiveness and advantages of the improved method are verified through comparison simulations.展开更多
Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus t...Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.展开更多
To mitigate the impact of wind power volatility on power system scheduling,this paper adopts the wind-storage combined unit to improve the dispatchability of wind energy.And a three-level optimal scheduling and power ...To mitigate the impact of wind power volatility on power system scheduling,this paper adopts the wind-storage combined unit to improve the dispatchability of wind energy.And a three-level optimal scheduling and power allocation strategy is proposed for the system containing the wind-storage combined unit.The strategy takes smoothing power output as themain objectives.The first level is the wind-storage joint scheduling,and the second and third levels carry out the unit combination optimization of thermal power and the power allocation of wind power cluster(WPC),respectively,according to the scheduling power of WPC and ESS obtained from the first level.This can ensure the stability,economy and environmental friendliness of the whole power system.Based on the roles of peak shaving-valley filling and fluctuation smoothing of the energy storage system(ESS),this paper decides the charging and discharging intervals of ESS,so that the energy storage and wind power output can be further coordinated.Considering the prediction error and the output uncertainty of wind power,the planned scheduling output of wind farms(WFs)is first optimized on a long timescale,and then the rolling correction optimization of the scheduling output of WFs is carried out on a short timescale.Finally,the effectiveness of the proposed optimal scheduling and power allocation strategy is verified through case analysis.展开更多
In the Industrial Internet of Things(IIoT),sensors generate time series data to reflect the working state.When the systems are attacked,timely identification of outliers in time series is critical to ensure security.A...In the Industrial Internet of Things(IIoT),sensors generate time series data to reflect the working state.When the systems are attacked,timely identification of outliers in time series is critical to ensure security.Although many anomaly detection methods have been proposed,the temporal correlation of the time series over the same sensor and the state(spatial)correlation between different sensors are rarely considered simultaneously in these methods.Owing to the superior capability of Transformer in learning time series features.This paper proposes a time series anomaly detection method based on a spatial-temporal network and an improved Transformer.Additionally,the methods based on graph neural networks typically include a graph structure learning module and an anomaly detection module,which are interdependent.However,in the initial phase of training,since neither of the modules has reached an optimal state,their performance may influence each other.This scenario makes the end-to-end training approach hard to effectively direct the learning trajectory of each module.This interdependence between the modules,coupled with the initial instability,may cause the model to find it hard to find the optimal solution during the training process,resulting in unsatisfactory results.We introduce an adaptive graph structure learning method to obtain the optimal model parameters and graph structure.Experiments on two publicly available datasets demonstrate that the proposed method attains higher anomaly detection results than other methods.展开更多
The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the...The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CsI feedback stage.In fact,the downlink communication generally includes three stages,i.e.,pilot training,CsI feedback,and data transmission.These three stages are mutually related and jointly determine the overall system performance.Unfortunately,there exist few studies on the reduction of csIT acquisition overhead from the global point of view.In this paper,we integrate the Minimum Mean Square Error(MMSE)channel estimation,Random Vector Quantization(RVQ)based limited feedback and Maximal Ratio Combining(MRC)precoding into a unified framework for investigating the resource allocation problem.In particular,we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio(SNR)based on the deterministic equivalence theory.Then the three performance metrics(the spectral efficiency,energy efficiency,and total energy consumption)oriented problems are formulated analytically.With practical system requirements,these three metrics can be collaboratively optimized.Finally,we propose an optimization solver to derive the optimal partition of channel coherence time.Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.展开更多
To clarify the connotations and extensions of urban resilience,this study focuses on the Chengdu-Chongqing Economic Circle with 16 cities as research subjects.A comprehensive evaluation index system was constructed to...To clarify the connotations and extensions of urban resilience,this study focuses on the Chengdu-Chongqing Economic Circle with 16 cities as research subjects.A comprehensive evaluation index system was constructed to measure the resilience of each city from 2003 to 2020.The spatial-temporal evolution characteristics were analyzed using Kernel density estimation,standard deviation ellipse,and spatial Markov chain analysis,and the spatial Tobit model was introduced to discover the influencing factors.The results indicate the following:①Urban resilience in the Chengdu-Chongqing Economic Circle displays an upward trend,with the center of gravity moving to the southwest,and the polarization phenomenon intensifying.②The urban resilience level in a region has certain spatial and geographical dependence,while the probability of urban resilience transfer differs in adjacent cities with different resilience levels.③Urban centrality,economic scale,openness level,and financial development promote urban resilience,whereas government scale significantly inhibits it.Finally,this paper proposes countermeasures and suggestions to improve the urban resilience of the Chengdu-Chongqing Economic Circle.展开更多
The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries an...The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries and other fields.Furthermore,it is important to construct a digital twin system.However,existing methods do not take full advantage of the potential properties of variables,which results in poor predicted accuracy.In this paper,we propose the Adaptive Fused Spatial-Temporal Graph Convolutional Network(AFSTGCN).First,to address the problem of the unknown spatial-temporal structure,we construct the Adaptive Fused Spatial-Temporal Graph(AFSTG)layer.Specifically,we fuse the spatial-temporal graph based on the interrelationship of spatial graphs.Simultaneously,we construct the adaptive adjacency matrix of the spatial-temporal graph using node embedding methods.Subsequently,to overcome the insufficient extraction of disordered correlation features,we construct the Adaptive Fused Spatial-Temporal Graph Convolutional(AFSTGC)module.The module forces the reordering of disordered temporal,spatial and spatial-temporal dependencies into rule-like data.AFSTGCN dynamically and synchronously acquires potential temporal,spatial and spatial-temporal correlations,thereby fully extracting rich hierarchical feature information to enhance the predicted accuracy.Experiments on different types of MTS datasets demonstrate that the model achieves state-of-the-art single-step and multi-step performance compared with eight other deep learning models.展开更多
A real-time adaptive roles allocation method based on reinforcement learning is proposed to improve humanrobot cooperation performance for a curtain wall installation task.This method breaks the traditional idea that ...A real-time adaptive roles allocation method based on reinforcement learning is proposed to improve humanrobot cooperation performance for a curtain wall installation task.This method breaks the traditional idea that the robot is regarded as the follower or only adjusts the leader and the follower in cooperation.In this paper,a self-learning method is proposed which can dynamically adapt and continuously adjust the initiative weight of the robot according to the change of the task.Firstly,the physical human-robot cooperation model,including the role factor is built.Then,a reinforcement learningmodel that can adjust the role factor in real time is established,and a reward and actionmodel is designed.The role factor can be adjusted continuously according to the comprehensive performance of the human-robot interaction force and the robot’s Jerk during the repeated installation.Finally,the roles adjustment rule established above continuously improves the comprehensive performance.Experiments of the dynamic roles allocation and the effect of the performance weighting coefficient on the result have been verified.The results show that the proposed method can realize the role adaptation and achieve the dual optimization goal of reducing the sum of the cooperator force and the robot’s Jerk.展开更多
With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both local...With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.展开更多
Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC a...Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.展开更多
Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus t...Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.展开更多
With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)...With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points(NCPs).Considering the amount of task data and the idle resources of NCPs,a computing resource scheduling model for NCPs is established.Taking the heterogeneous task execution delay threshold as a constraint,the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs.The proposed problem is proven to be NP-hard by using the method of reduction to a 0-1 knapsack problem.A many-to-many matching algorithm based on resource preferences is proposed.The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs.This enables the filtering out of un-schedulable NCPs in the initial stage of matching,reducing the solution space dimension.To solve the matching problem between ICVs and NCPs,a new manyto-many matching algorithm is proposed to obtain a unique and stable optimal matching result.The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6%compared to the reference scheme,and the total performance can be improved by up to 15.9%.展开更多
Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource allocation.While traditional methods for task allocation can help reduce costs and improve efficiency,they may encoun...Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource allocation.While traditional methods for task allocation can help reduce costs and improve efficiency,they may encounter challenges when dealing with abnormal data flow nodes,leading to decreased allocation accuracy and efficiency.To address these issues,this study proposes a novel two-part invalid detection task allocation framework.In the first step,an anomaly detection model is developed using a dynamic self-attentive GAN to identify anomalous data.Compared to the baseline method,the model achieves an approximately 4%increase in the F1 value on the public dataset.In the second step of the framework,task allocation modeling is performed using a twopart graph matching method.This phase introduces a P-queue KM algorithm that implements a more efficient optimization strategy.The allocation efficiency is improved by approximately 23.83%compared to the baseline method.Empirical results confirm the effectiveness of the proposed framework in detecting abnormal data nodes,enhancing allocation precision,and achieving efficient allocation.展开更多
To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAV...To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.展开更多
Unlike the traditional decentralized channel,the drop-shipping channel entails a retailer relaying consumers’orders to the manufacturer,which proceeds to stock the orders and directly ship them to the consumers.This ...Unlike the traditional decentralized channel,the drop-shipping channel entails a retailer relaying consumers’orders to the manufacturer,which proceeds to stock the orders and directly ship them to the consumers.This study explores supply chain coordination and product quality in drop-shipping and traditional channels.Specifically,we analyze the performance of both channels under wholesale price and revenue-sharing contracts.Our study yields several key findings.First,the revenue-sharing contract can coordinate both traditional and drop-shipping channels,effectively increasing supply chain performance.Second,given the channel structure,the retailer prefers the wholesale price contract,whereas the manufacturer prefers the revenue-sharing contract.Third,product quality is higher in the drop-shipping channel when demand uncertainty is high.Finally,the implementation of the revenue-sharing contract increases product quality in the traditional channel,whereas it keeps product quality unchanged in the drop-shipping channel.展开更多
文摘This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.
基金supported by Beijing Natural Science Fund–Haidian Original Innovation Joint Fund(L232040 and L232045).
文摘In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its associated users on its own bandwidth.We aim at maximizing the overall common throughput in a finite time period.Such a problem is a typical mixed integer nonlinear problem,which involves both continuous-variable and combinatorial optimizations.To efficiently solve this problem,we propose a two-layer algorithm,which separately tackles continuous-variable and combinatorial optimization.Specifically,in the inner layer given one user association scheme,subproblems of bandwidth allocation,power allocation and trajectory design are solved based on alternating optimization.In the outer layer,a small number of candidate user association schemes are generated from an initial scheme and the best solution can be determined by comparing all the candidate schemes.In particular,a clustering algorithm based on K-means is applied to produce all candidate user association schemes,the successive convex optimization technique is adopted in the power allocation subproblem and a logistic function approximation approach is employed in the trajectory design subproblem.Simulation results show that the proposed NOMA scheme outperforms three baseline schemes in downlink common throughput,including one solution proposed in an existing literature.
基金supported by the following projects:The Youth Project of the National Natural Science Foundation of China(NSFC)“Research on Chinese Multinational Companies’Componovation under Resource Constraint:From a Dynamic Circulation Logic of Home and Host Countries”(Grant No.72102030)The Research Project of Humanities and Social Sciences of the Ministry of Education“Research on Chinese Multinational Companies’Learning by Doing Mechanism under Resource Constraint”(Grant No.21C10173022)The General Project of the China Postdoctoral Science Foundation“Research on the Realization Path and Motivations for the Domestic Replacement of Core Technologies for Chinese Manufacturing Enterprises”(Grant No.2022M720975).
文摘Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapment in low-value-added production,and driving industrial upgrading.Given the distinct market environment in which China’s hidden champions have emerged,it is both timely and practically significant to examine their growth trajectories and underlying mechanisms.This study adopts a resource allocation perspective to investigate the development path of Chinese manufacturing enterprises into hidden champions,using a vertical case study of Hailiya Group.The findings reveal that such enterprises achieve hidden champion status by vertically concentrating on niche markets while harnessing technological potential and horizontally diversifying their technology application scenarios.Their growth follows a“T-shaped”strategy,combining vertical specialization in a focused market with horizontal expansion into new applications.Four critical mechanisms underpin the rise of manufacturing hidden champions:market niche positioning,innovation-driven focus,application scenario expansion,and ecosystem development.Specifically,these enterprises strategically target niche markets,establish a technology-oriented competitive edge,broaden technology applications to unlock new profit opportunities,and develop collaborative ecosystems to share resources and drive industrial advancement.This paper not only extends the interpretive boundaries of resource allocation theory but also offers fresh insights into the emergence of Chinese manufacturing enterprises as hidden champions,enriching our understanding of their unique growth dynamics.
文摘With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements imposed by the new medical reform on human resource allocation in public hospitals,examines existing issues such as an unbalanced personnel structure,unscientific job design,and an inadequate talent mobility mechanism,and proposes corresponding optimization strategies.These strategies include improving the recruitment and selection process,scientifically planning job structures,and establishing a flexible talent mobility mechanism.The goal is to enhance the quality of medical services,improve hospital operational efficiency,and promote the sustainable development of public hospitals.
基金supported by National Natural Science Foundation of China No.62231012Natural Science Foundation for Outstanding Young Scholars of Heilongjiang Province under Grant YQ2020F001Heilongjiang Province Postdoctoral General Foundation under Grant AUGA4110004923.
文摘Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for the global ground users.In this paper,the computation offloading problem and resource allocation problem are formulated as a mixed integer nonlinear program(MINLP)problem.This paper proposes a computation offloading algorithm based on deep deterministic policy gradient(DDPG)to obtain the user offloading decisions and user uplink transmission power.This paper uses the convex optimization algorithm based on Lagrange multiplier method to obtain the optimal MEC server resource allocation scheme.In addition,the expression of suboptimal user local CPU cycles is derived by relaxation method.Simulation results show that the proposed algorithm can achieve excellent convergence effect,and the proposed algorithm significantly reduces the system utility values at considerable time cost compared with other algorithms.
基金National Natural Science Foundation of China (12202293)Sichuan Science and Technology Program (2023NSFSC0393,2022NSFSC1952)。
文摘A task allocation problem for the heterogeneous unmanned aerial vehicle (UAV) swarm in unknown environments is studied in this paper.Considering that the actual mission environment information may be unknown,the UAV swarm needs to detect the environment first and then attack the detected targets.The heterogeneity of UAVs,multiple types of tasks,and the dynamic nature of task environment lead to uneven load and time sequence problems.This paper proposes an improved contract net protocol (CNP) based task allocation scheme,which effectively balances the load of UAVs and improves the task efficiency.Firstly,two types of task models are established,including regional reconnaissance tasks and target attack tasks.Secondly,for regional reconnaissance tasks,an improved CNP algorithm using the uncertain contract is developed.Through uncertain contracts,the area size of the regional reconnaissance task is determined adaptively after this task assignment,which can improve reconnaissance efficiency and resource utilization.Thirdly,for target attack tasks,an improved CNP algorithm using the fuzzy integrated evaluation and the double-layer negotiation is presented to enhance collaborative attack efficiency through adjusting the assignment sequence adaptively and multi-layer allocation.Finally,the effectiveness and advantages of the improved method are verified through comparison simulations.
基金supported in part by the National Key R&D Program of China under Grant 2020YFB1005900the National Natural Science Foundation of China under Grant 62001220+3 种基金the Jiangsu Provincial Key Research and Development Program under Grants BE2022068the Natural Science Foundation of Jiangsu Province under Grants BK20200440the Future Network Scientific Research Fund Project FNSRFP-2021-YB-03the Young Elite Scientist Sponsorship Program,China Association for Science and Technology.
文摘Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.
基金supported by the State Grid Jiangsu Electric Power Co.,Ltd.Technology Project(J2023035).
文摘To mitigate the impact of wind power volatility on power system scheduling,this paper adopts the wind-storage combined unit to improve the dispatchability of wind energy.And a three-level optimal scheduling and power allocation strategy is proposed for the system containing the wind-storage combined unit.The strategy takes smoothing power output as themain objectives.The first level is the wind-storage joint scheduling,and the second and third levels carry out the unit combination optimization of thermal power and the power allocation of wind power cluster(WPC),respectively,according to the scheduling power of WPC and ESS obtained from the first level.This can ensure the stability,economy and environmental friendliness of the whole power system.Based on the roles of peak shaving-valley filling and fluctuation smoothing of the energy storage system(ESS),this paper decides the charging and discharging intervals of ESS,so that the energy storage and wind power output can be further coordinated.Considering the prediction error and the output uncertainty of wind power,the planned scheduling output of wind farms(WFs)is first optimized on a long timescale,and then the rolling correction optimization of the scheduling output of WFs is carried out on a short timescale.Finally,the effectiveness of the proposed optimal scheduling and power allocation strategy is verified through case analysis.
基金This work is partly supported by the National Key Research and Development Program of China(Grant No.2020YFB1805403)the National Natural Science Foundation of China(Grant No.62032002)the 111 Project(Grant No.B21049).
文摘In the Industrial Internet of Things(IIoT),sensors generate time series data to reflect the working state.When the systems are attacked,timely identification of outliers in time series is critical to ensure security.Although many anomaly detection methods have been proposed,the temporal correlation of the time series over the same sensor and the state(spatial)correlation between different sensors are rarely considered simultaneously in these methods.Owing to the superior capability of Transformer in learning time series features.This paper proposes a time series anomaly detection method based on a spatial-temporal network and an improved Transformer.Additionally,the methods based on graph neural networks typically include a graph structure learning module and an anomaly detection module,which are interdependent.However,in the initial phase of training,since neither of the modules has reached an optimal state,their performance may influence each other.This scenario makes the end-to-end training approach hard to effectively direct the learning trajectory of each module.This interdependence between the modules,coupled with the initial instability,may cause the model to find it hard to find the optimal solution during the training process,resulting in unsatisfactory results.We introduce an adaptive graph structure learning method to obtain the optimal model parameters and graph structure.Experiments on two publicly available datasets demonstrate that the proposed method attains higher anomaly detection results than other methods.
基金supported by the foundation of National Key Laboratory of Electromagnetic Environment(Grant No.JCKY2020210C 614240304)Natural Science Foundation of ZheJiang province(LQY20F010001)+1 种基金the National Natural Science Foundation of China under grant numbers 82004499State Key Laboratory of Millimeter Waves under grant numbers K202012.
文摘The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CsI feedback stage.In fact,the downlink communication generally includes three stages,i.e.,pilot training,CsI feedback,and data transmission.These three stages are mutually related and jointly determine the overall system performance.Unfortunately,there exist few studies on the reduction of csIT acquisition overhead from the global point of view.In this paper,we integrate the Minimum Mean Square Error(MMSE)channel estimation,Random Vector Quantization(RVQ)based limited feedback and Maximal Ratio Combining(MRC)precoding into a unified framework for investigating the resource allocation problem.In particular,we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio(SNR)based on the deterministic equivalence theory.Then the three performance metrics(the spectral efficiency,energy efficiency,and total energy consumption)oriented problems are formulated analytically.With practical system requirements,these three metrics can be collaboratively optimized.Finally,we propose an optimization solver to derive the optimal partition of channel coherence time.Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.
基金supported by the Graduate Research and Innovation Project of Chongqing Normal University[Grant No.YKC23035],comprehensive evaluation,and driving factors of urban resilience in the Chengdu-Chongqing Economic Circle.
文摘To clarify the connotations and extensions of urban resilience,this study focuses on the Chengdu-Chongqing Economic Circle with 16 cities as research subjects.A comprehensive evaluation index system was constructed to measure the resilience of each city from 2003 to 2020.The spatial-temporal evolution characteristics were analyzed using Kernel density estimation,standard deviation ellipse,and spatial Markov chain analysis,and the spatial Tobit model was introduced to discover the influencing factors.The results indicate the following:①Urban resilience in the Chengdu-Chongqing Economic Circle displays an upward trend,with the center of gravity moving to the southwest,and the polarization phenomenon intensifying.②The urban resilience level in a region has certain spatial and geographical dependence,while the probability of urban resilience transfer differs in adjacent cities with different resilience levels.③Urban centrality,economic scale,openness level,and financial development promote urban resilience,whereas government scale significantly inhibits it.Finally,this paper proposes countermeasures and suggestions to improve the urban resilience of the Chengdu-Chongqing Economic Circle.
基金supported by the China Scholarship Council and the CERNET Innovation Project under grant No.20170111.
文摘The prediction for Multivariate Time Series(MTS)explores the interrelationships among variables at historical moments,extracts their relevant characteristics,and is widely used in finance,weather,complex industries and other fields.Furthermore,it is important to construct a digital twin system.However,existing methods do not take full advantage of the potential properties of variables,which results in poor predicted accuracy.In this paper,we propose the Adaptive Fused Spatial-Temporal Graph Convolutional Network(AFSTGCN).First,to address the problem of the unknown spatial-temporal structure,we construct the Adaptive Fused Spatial-Temporal Graph(AFSTG)layer.Specifically,we fuse the spatial-temporal graph based on the interrelationship of spatial graphs.Simultaneously,we construct the adaptive adjacency matrix of the spatial-temporal graph using node embedding methods.Subsequently,to overcome the insufficient extraction of disordered correlation features,we construct the Adaptive Fused Spatial-Temporal Graph Convolutional(AFSTGC)module.The module forces the reordering of disordered temporal,spatial and spatial-temporal dependencies into rule-like data.AFSTGCN dynamically and synchronously acquires potential temporal,spatial and spatial-temporal correlations,thereby fully extracting rich hierarchical feature information to enhance the predicted accuracy.Experiments on different types of MTS datasets demonstrate that the model achieves state-of-the-art single-step and multi-step performance compared with eight other deep learning models.
基金The research has been generously supported by Tianjin Education Commission Scientific Research Program(2020KJ056),ChinaTianjin Science and Technology Planning Project(22YDTPJC00970),China.The authors would like to express their sincere appreciation for all support provided.
文摘A real-time adaptive roles allocation method based on reinforcement learning is proposed to improve humanrobot cooperation performance for a curtain wall installation task.This method breaks the traditional idea that the robot is regarded as the follower or only adjusts the leader and the follower in cooperation.In this paper,a self-learning method is proposed which can dynamically adapt and continuously adjust the initiative weight of the robot according to the change of the task.Firstly,the physical human-robot cooperation model,including the role factor is built.Then,a reinforcement learningmodel that can adjust the role factor in real time is established,and a reward and actionmodel is designed.The role factor can be adjusted continuously according to the comprehensive performance of the human-robot interaction force and the robot’s Jerk during the repeated installation.Finally,the roles adjustment rule established above continuously improves the comprehensive performance.Experiments of the dynamic roles allocation and the effect of the performance weighting coefficient on the result have been verified.The results show that the proposed method can realize the role adaptation and achieve the dual optimization goal of reducing the sum of the cooperator force and the robot’s Jerk.
基金the Fundamental Research Program of Guangdong,China,under Grants 2020B1515310023 and 2023A1515011281in part by the National Natural Science Foundation of China under Grant 61571005.
文摘With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.
基金supported by the Key Research and Development Project in Anhui Province of China(Grant No.202304a05020059)the Fundamental Research Funds for the Central Universities of China(Grant No.PA2023GDSK0055)the Project of Anhui Province Economic and Information Bureau(Grant No.JB20099).
文摘Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.
基金This work was supported in part by the National Key R&D Program of China under Grant 2020YFB1005900the National Natural Science Foundation of China under Grant 62001220+3 种基金the Jiangsu Provincial Key Research and Development Program under Grants BE2022068the Natural Science Foundation of Jiangsu Province under Grants BK20200440the Future Network Scientific Research Fund Project FNSRFP-2021-YB-03the Young Elite Scientist Sponsorship Program,China Association for Science and Technology.
文摘Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.
基金supported by the National Natural Science Foundation of China(Grant No.62072031)the Applied Basic Research Foundation of Yunnan Province(Grant No.2019FD071)the Yunnan Scientific Research Foundation Project(Grant 2019J0187).
文摘With the development of vehicles towards intelligence and connectivity,vehicular data is diversifying and growing dramatically.A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle(ICV)applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points(NCPs).Considering the amount of task data and the idle resources of NCPs,a computing resource scheduling model for NCPs is established.Taking the heterogeneous task execution delay threshold as a constraint,the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs.The proposed problem is proven to be NP-hard by using the method of reduction to a 0-1 knapsack problem.A many-to-many matching algorithm based on resource preferences is proposed.The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs.This enables the filtering out of un-schedulable NCPs in the initial stage of matching,reducing the solution space dimension.To solve the matching problem between ICVs and NCPs,a new manyto-many matching algorithm is proposed to obtain a unique and stable optimal matching result.The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6%compared to the reference scheme,and the total performance can be improved by up to 15.9%.
基金National Natural Science Foundation of China(62072392).
文摘Crowdsourcing technology is widely recognized for its effectiveness in task scheduling and resource allocation.While traditional methods for task allocation can help reduce costs and improve efficiency,they may encounter challenges when dealing with abnormal data flow nodes,leading to decreased allocation accuracy and efficiency.To address these issues,this study proposes a novel two-part invalid detection task allocation framework.In the first step,an anomaly detection model is developed using a dynamic self-attentive GAN to identify anomalous data.Compared to the baseline method,the model achieves an approximately 4%increase in the F1 value on the public dataset.In the second step of the framework,task allocation modeling is performed using a twopart graph matching method.This phase introduces a P-queue KM algorithm that implements a more efficient optimization strategy.The allocation efficiency is improved by approximately 23.83%compared to the baseline method.Empirical results confirm the effectiveness of the proposed framework in detecting abnormal data nodes,enhancing allocation precision,and achieving efficient allocation.
基金supported by Project funded by China Postdoctoral Science Foundation(No.2021MD703980)。
文摘To improve the efficiency and fairness of the spectrum allocation for ground communication assisted by unmanned aerial vehicles(UAVs),a joint optimization method for on-demand deployment and spectrum allocation of UAVs is proposed,which is modeled as a mixed-integer non-convex optimization problem(MINCOP).An algorithm to estimate the minimum number of required UAVs is firstly proposed based on the pre-estimation and simulated annealing.The MINCOP is then decomposed into three sub-problems based on the block coordinate descent method,including the spectrum allocation of UAVs,the association between UAVs and ground users,and the deployment of UAVs.Specifically,the optimal spectrum allocation is derived based on the interference mitigation and channel reuse.The association between UAVs and ground users is optimized based on local iterated optimization.A particle-based optimization algorithm is proposed to resolve the subproblem of the UAVs deployment.Simulation results show that the proposed method could effectively improve the minimum transmission rate of UAVs as well as user fairness of spectrum allocation.
基金supported by the Key Fund Project for Youth Innovation of USTC(WK2040000042).
文摘Unlike the traditional decentralized channel,the drop-shipping channel entails a retailer relaying consumers’orders to the manufacturer,which proceeds to stock the orders and directly ship them to the consumers.This study explores supply chain coordination and product quality in drop-shipping and traditional channels.Specifically,we analyze the performance of both channels under wholesale price and revenue-sharing contracts.Our study yields several key findings.First,the revenue-sharing contract can coordinate both traditional and drop-shipping channels,effectively increasing supply chain performance.Second,given the channel structure,the retailer prefers the wholesale price contract,whereas the manufacturer prefers the revenue-sharing contract.Third,product quality is higher in the drop-shipping channel when demand uncertainty is high.Finally,the implementation of the revenue-sharing contract increases product quality in the traditional channel,whereas it keeps product quality unchanged in the drop-shipping channel.
