How to allocate public health manpower in township health centers in China scientifically and reasonably

INTRODUCTION The global health issue is not a shortage of capital or technology, but a shortage of health manpower. Health human resource （HHR）, an important component of health resources, determines the quantity, quality and effectiveness of health service, thus greatly impacting on health service to the citizens.

Total Maximum Allocated Loads on Stoichiometry of Nitrogen and Identification of Critical Form in Jiaozhou Bay, China

Total pollutant load control management for total dissolved nitrogen(TDN) is an urgent task required to gain a good water quality status in Jiaozhou Bay(JZB), China. In this paper, the stoichiometry of multiform TDN on land-ocean interactions associated with marine biogeochemical reaction(LOIMBR) was studied by modeling the load-response relationship based on a three-dimensional water quality model of nitrogen in JZB. The results showed that the stoichiometry on LOIMBR of dissolved organic nitrogen(DON), NO3-N and NH4-N was 3:1:1, with one-third of the contribution on the concentration of dissolved inorganic nitrogen(DIN) in JZB for the land-based DON loads to DIN loads. Based on the stoichiometric relationship of nitrogen forms, the total maximum allocated load(TMAL) of equivalent TDN(ETDN) was approximately 5300 t a^-1 in JZB, equivalent to the TMAL of 5700, 5800 and 15600 t a^-1 for NH4-N, NO3-N and DON, respectively. According to the loads of ETDN, there were four outfalls overloaded in JZB in 2015, which lie in the head of the bay. In the four overloaded outfalls, besides NO3-N, NH4-N was the critical nitrogen control form for Moshui River, while DON for Dagu River and Haibo River. The results of numerical experiments further showed that JZB will achieve good water quality after 7 years by implementation of the 'different emission reduction' based on TMAL of ETDN, which is significantly better than 'equal percent removal'.

Low-Cost Federated Broad Learning for Privacy-Preserved Knowledge Sharing in the RIS-Aided Internet of Vehicles

High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility environment.In order to protect data privacy and improve data learning efficiency in knowledge sharing,we propose an asynchronous federated broad learning(FBL)framework that integrates broad learning(BL)into federated learning(FL).In FBL,we design a broad fully connected model(BFCM)as a local model for training client data.To enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients,we construct a joint resource allocation and reconfigurable intelligent surface(RIS)configuration optimization framework for FBL.The problem is decoupled into two convex subproblems.Aiming to improve the resource scheduling efficiency in FBL,a double Davidon–Fletcher–Powell(DDFP)algorithm is presented to solve the time slot allocation and RIS configuration problem.Based on the results of resource scheduling,we design a reward-allocation algorithm based on federated incentive learning(FIL)in FBL to compensate clients for their costs.The simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency,accuracy,and cost for knowledge sharing in the IoV.

Use of machine learning models for the prognostication of liver transplantation: A systematic review

BACKGROUND Liver transplantation(LT)is a life-saving intervention for patients with end-stage liver disease.However,the equitable allocation of scarce donor organs remains a formidable challenge.Prognostic tools are pivotal in identifying the most suitable transplant candidates.Traditionally,scoring systems like the model for end-stage liver disease have been instrumental in this process.Nevertheless,the landscape of prognostication is undergoing a transformation with the integration of machine learning(ML)and artificial intelligence models.AIM To assess the utility of ML models in prognostication for LT,comparing their performance and reliability to established traditional scoring systems.METHODS Following the Preferred Reporting Items for Systematic Reviews and Meta-Analysis guidelines,we conducted a thorough and standardized literature search using the PubMed/MEDLINE database.Our search imposed no restrictions on publication year,age,or gender.Exclusion criteria encompassed non-English studies,review articles,case reports,conference papers,studies with missing data,or those exhibiting evident methodological flaws.RESULTS Our search yielded a total of 64 articles,with 23 meeting the inclusion criteria.Among the selected studies,60.8%originated from the United States and China combined.Only one pediatric study met the criteria.Notably,91%of the studies were published within the past five years.ML models consistently demonstrated satisfactory to excellent area under the receiver operating characteristic curve values(ranging from 0.6 to 1)across all studies,surpassing the performance of traditional scoring systems.Random forest exhibited superior predictive capabilities for 90-d mortality following LT,sepsis,and acute kidney injury(AKI).In contrast,gradient boosting excelled in predicting the risk of graft-versus-host disease,pneumonia,and AKI.CONCLUSION This study underscores the potential of ML models in guiding decisions related to allograft allocation and LT,marking a significant evolution in the field of prognostication.

Satellite Communications with 5G, B5G, and 6G: Challenges and Prospects

Satellite communications, pivotal for global connectivity, are increasingly converging with cutting-edge mobile networks, notably 5G, B5G, and 6G. This amalgamation heralds the promise of universal, high-velocity communication, yet it is not without its challenges. Paramount concerns encompass spectrum allocation, the harmonization of network architectures, and inherent latency issues in satellite transmissions. Potential mitigations, such as dynamic spectrum sharing and the deployment of edge computing, are explored as viable solutions. Looking ahead, the advent of quantum communications within satellite frameworks and the integration of AI spotlight promising research trajectories. These advancements aim to foster a seamless and synergistic coexistence between satellite communications and next-gen mobile networks.

Understory seedlings of Quercus mongolica survive by phenological escape

Understanding understory seedling regeneration mechanisms is important for the sustainable development of temperate primary forests in the context of increasingly intense climate warming events.The poor regeneration of dominant tree species,however,is one of the biggest challenges it faces at the moment.Especially,the regeneration of the shade-intolerant Quercus mongolica seedling is difficult in primary forests,which contrasts with the extreme abundance of understory seedlings in secondary forests.The mechanism behind the interesting phenomenon is still unknown.This study used in-situ monitoring and nursery-controlled experiment to investigate the survival rate,growth performance,as well as nonstructural carbohydrate (NSC) concentrations and pools of various organ tissues of seedlings for two consecutive years,further analyze the understory light availability and simulate the foliage carbon (C) gain in the secondary and primary forest.Results suggested that seedlings in the secondary forest had greater biomass allocation aboveground,height and specific leaf area (SLA) in summer,which allowed the seedling to survive longer in the canopy closure period.High light availability and positive C gain in early spring and late autumn are key factors affecting the growth and survival of understory seedlings in the secondary forest,whereas seedlings in the primary forest had annual negative carbon gain.Through the growing season,the total NSC concentrations of seedlings gradually decreased,whereas those of seedlings in the secondary forest increased significantly in autumn,and were mainly stored in roots for winter consumption and the following year's summer shade period,which was verified by the nursery-controlled experiment that simulated autumn enhanced light availability improved seedling survival rate and NSC pools.In conclusion,our results revealed the survival trade-off strategies of Quercus mongolica seedlings and highlighted the necessity of high light availability during the spring and autumn phenological periods for shade-intolerant tree seedling recruitment.

Optimization of resource allocation in FDD massive MIMO systems

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.

Activation Distance and Capacity Analysis for Ambient Backscatter Communications with Sensitivity Constraint and Beamforming

Circuit sensitivity of sensors or tags without battery is one practical constraint for ambient backscatter communication systems.This letter considers using beamforming to reduce the sensitivity constraint and evaluates the corresponding performance in terms of the tag activation distance and the system capacity.Specifically,we derive the activation probabilities of the tag in the case of single-antenna and multi-antenna transmitters.Besides,we obtain the capacity expressions for the ambient backscatter communication system with beamforming and illustrate the power allocation that maximizes the system capacity when the tag is activated.Finally,simulation results are provided to corroborate our proposed studies.

Mega-Constellations Based TT&C Resource Sharing: Keep Reliable Aeronautical Communication in an Emergency

With the development of the transportation industry, the effective guidance of aircraft in an emergency to prevent catastrophic accidents remains one of the top safety concerns. Undoubtedly, operational status data of the aircraft play an important role in the judgment and command of the Operational Control Center(OCC). However, how to transmit various operational status data from abnormal aircraft back to the OCC in an emergency is still an open problem. In this paper, we propose a novel Telemetry, Tracking,and Command(TT&C) architecture named Collaborative TT&C(CoTT&C) based on mega-constellation to solve such a problem. CoTT&C allows each satellite to help the abnormal aircraft by sharing TT&C resources when needed, realizing real-time and reliable aeronautical communication in an emergency. Specifically, we design a dynamic resource sharing mechanism for CoTT&C and model the mechanism as a single-leader-multi-follower Stackelberg game. Further, we give an unique Nash Equilibrium(NE) of the game as a closed form. Simulation results demonstrate that the proposed resource sharing mechanism is effective, incentive compatible, fair, and reciprocal. We hope that our findings can shed some light for future research on aeronautical communications in an emergency.

Joint Task Allocation and Resource Optimization for Blockchain Enabled Collaborative Edge Computing

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.

Security-Reliability Tradeoff Analysis for Jamming Aided Decode-and-Forward Relay Networks

In this paper,we explore a cooperative decode-and-forward(DF)relay network comprised of a source,a relay,and a destination in the presence of an eavesdropper.To improve physical-layer security of the relay system,we propose a jamming aided decodeand-forward relay(JDFR)scheme combining the use of artificial noise and DF relaying which requires two stages to transmit a packet.Specifically,in stage one,the source sends confidential message to the relay while the destination acts as a friendly jammer and transmits artificial noise to confound the eavesdropper.In stage two,the relay forwards its re-encoded message to the destination while the source emits artificial noise to confuse the eavesdropper.In addition,we analyze the security-reliability tradeoff(SRT)performance of the proposed JDFR scheme,where security and reliability are evaluated by deriving intercept probability(IP)and outage probability(OP),respectively.For the purpose of comparison,SRT of the traditional decode-and-forward relay(TDFR)scheme is also analyzed.Numerical results show that the SRT performance of the proposed JDFR scheme is better than that of the TDFR scheme.Also,it is shown that for the JDFR scheme,a better SRT performance can be obtained by the optimal power allocation(OPA)between the friendly jammer and user.

Mobile Crowdsourcing Task Allocation Based on Dynamic Self-Attention GANs

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.

An Adaptive Hybrid Optimization Strategy for Resource Allocation in Network Function Virtualization

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.

Power Allocation for SE Maximization in Uplink Massive MIMO System Under Minimum Rate Constraint

In this paper,we optimize the spectrum efficiency(SE)of uplink massive multiple-input multiple-output(MIMO)system with imperfect channel state information(CSI)over Rayleigh fading channel.The SE optimization problem is formulated under the constraints of maximum power and minimum rate of each user.Then,we develop a near-optimal power allocation(PA)scheme by using the successive convex approximation(SCA)method,Lagrange multiplier method,and block coordinate descent(BCD)method,and it can obtain almost the same SE as the benchmark scheme with lower complexity.Since this scheme needs three-layer iteration,a suboptimal PA scheme is developed to further reduce the complexity,where the characteristic of massive MIMO(i.e.,numerous receive antennas)is utilized for convex reformulation,and the rate constraint is converted to linear constraints.This suboptimal scheme only needs single-layer iteration,thus has lower complexity than the near-optimal scheme.Finally,we joint design the pilot power and data power to further improve the performance,and propose an two-stage algorithm to obtain joint PA.Simulation results verify the effectiveness of the proposed schemes,and superior SE performance is achieved.

Channel assignment and power allocation for throughput improvement with PPO in B5G heterogeneous edge networks

In Beyond the Fifth Generation(B5G)heterogeneous edge networks,numerous users are multiplexed on a channel or served on the same frequency resource block,in which case the transmitter applies coding and the receiver uses interference cancellation.Unfortunately,uncoordinated radio resource allocation can reduce system throughput and lead to user inequity,for this reason,in this paper,channel allocation and power allocation problems are formulated to maximize the system sum rate and minimum user achievable rate.Since the construction model is non-convex and the response variables are high-dimensional,a distributed Deep Reinforcement Learning(DRL)framework called distributed Proximal Policy Optimization(PPO)is proposed to allocate or assign resources.Specifically,several simulated agents are trained in a heterogeneous environment to find robust behaviors that perform well in channel assignment and power allocation.Moreover,agents in the collection stage slow down,which hinders the learning of other agents.Therefore,a preemption strategy is further proposed in this paper to optimize the distributed PPO,form DP-PPO and successfully mitigate the straggler problem.The experimental results show that our mechanism named DP-PPO improves the performance over other DRL methods.

Robot-Oriented 6G Satellite-UAV Networks: Requirements, Paradigm Shifts, and Case Studies

Networked robots can perceive their surroundings, interact with each other or humans,and make decisions to accomplish specified tasks in remote/hazardous/complex environments. Satelliteunmanned aerial vehicle(UAV) networks can support such robots by providing on-demand communication services. However, under traditional open-loop communication paradigm, the network resources are usually divided into user-wise mostly-independent links,via ignoring the task-level dependency of robot collaboration. Thus, it is imperative to develop a new communication paradigm, taking into account the highlevel content and values behind, to facilitate multirobot operation. Inspired by Wiener’s Cybernetics theory, this article explores a closed-loop communication paradigm for the robot-oriented satellite-UAV network. This paradigm turns to handle group-wise structured links, so as to allocate resources in a taskoriented manner. It could also exploit the mobility of robots to liberate the network from full coverage,enabling new orchestration between network serving and positive mobility control of robots. Moreover,the integration of sensing, communications, computing and control would enlarge the benefit of this new paradigm. We present a case study for joint mobile edge computing(MEC) offloading and mobility control of robots, and finally outline potential challenges and open issues.

Downlink network-coded multiple access with diverse power

Normally,in the downlink Network-Coded Multiple Access(NCMA)system,the same power is allocated to different users.However,equal power allocation is unsuitable for some scenarios,such as when user devices have different Quality of Service(QoS)requirements.Hence,we study the power allocation in the downlink NCMA system in this paper,and propose a downlink Network-Coded Multiple Access with Diverse Power(NCMA-DP),wherein different amounts of power are allocated to different users.In terms of the Bit Error Rate(BER)of the multi-user decoder,and the number of packets required to correctly decode the message,the performance of the user with more allocated power is greatly improved compared to the Conventional NCMA(NCMA-C).Meanwhile,the performance of the user with less allocated power is still much better than NCMA-C.Furthermore,the overall throughput of NCMA-DP is greatly improved compared to that of NCMA-C.The simulation results demonstrate the remarkable performance of the proposed NCMA-DP.

Hybrid Block Diagonalization Precoding for Multi-User Weighted Sum-Rate Maximization

This paper studies large-scale multi-input multi-output(MIMO)orthogonal frequency division multiplexing(OFDM)communications in a broadband frequency-selective channel,where a massive MIMO base station(BS)communicates with multiple users equipped with multi-antenna.We develop a hybrid precoding design to maximize the weighted sum-rate(WSR)of the users by optimizing the digital and the analog precoders alternately.For the digital part,we employ block-diagonalization to eliminate inter-user interference and apply water-filling power allocation to maximize the WSR.For the analog part,the optimization of the PSN is formulated as an unconstrained problem,which can be efficiently solved by a gradient descent method.Numerical results show that the proposed block-diagonal hybrid precoding algorithm can outperform the existing works.

Joint Allocation of Computing and Connectivity Resources in Survivable Inter-Datacenter Elastic Optical Networks

Inter-datacenter elastic optical networks(EON)need to provide the service for the requests of cloud computing that require not only connectivity and computing resources but also network survivability.In this paper,to realize joint allocation of computing and connectivity resources in survivable inter-datacenter EONs,a survivable routing,modulation level,spectrum,and computing resource allocation algorithm(SRMLSCRA)algorithm and three datacenter selection strategies,i.e.Computing Resource First(CRF),Shortest Path First(SPF)and Random Destination(RD),are proposed for different scenarios.Unicast and manycast are applied to the communication of computing requests,and the routing strategies are calculated respectively.Simulation results show that SRMLCRA-CRF can serve the largest amount of protected computing tasks,and the requested calculation blocking probability is reduced by 29.2%,28.3%and 30.5%compared with SRMLSCRA-SPF,SRMLSCRA-RD and the benchmark EPS-RMSA algorithms respectively.Therefore,it is more applicable to the networks with huge calculations.Besides,SRMLSCRA-SPF consumes the least spectrum,thereby exhibiting its suitability for scenarios where the amount of calculation is small and communication resources are scarce.The results demonstrate that the proposed methods realize the joint allocation of computing and connectivity resources,and could provide efficient protection for services under single-link failure and occupy less spectrum.

Joint Optimization for on-Demand Deployment of UAVs and Spectrum Allocation in UAVs-Assisted Communication

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.