Carbon and nitrogen allocations in corn grown in Central and Northeast China: different responses to fertilization treatments

In order to reveal the impact of various fertilization strategies on carbon（C） and nitrogen（N） accumulation and allocation in corn（Zea mays L.）, corn was grown in the fields where continuous fertilization management had been lasted about 18 years at two sites located in Central and Northeast China（Zhengzhou and Gongzhuling）, and biomass C and N contents in different organs of corn at harvest were analyzed. The fertilization treatments included non-fertilizer（control）, chemical fertilizers of either nitrogen（N）, or nitrogen and phosphorus（NP）, or phosphorus and potassium（PK）, or nitrogen, phosphorus and potassium（NPK）, NPK plus manure（NPKM）, 150% of the NPKM（1.5NPKM）, and NPK plus straw（NPKS）. The results showed that accumulated C in aboveground ranged from 2 550–5 630 kg ha^–1 in the control treatment to 9 300–9 610 kg ha^–1 in the NPKM treatment, of which 57–67% and 43–50% were allocated in the non-grain organs, respectively. Accumulated N in aboveground ranged from 44.8–55.2 kg ha^-1 in the control treatment to 211–222 kg ha^–1 in the NPKM treatment, of which 35–48% and 33–44% were allocated in the non-grain parts, respectively. C allocated to stem and leaf for the PK treatment was 65 and 49% higher than that for the NPKM treatment at the both sites, respectively, while N allocated to the organs for the PK treatment was 18 and 6% higher than that for the NPKM treatment, respectively. This study demonstrated that responses of C and N allocation in corn to fertilization strategies were different, and C allocation was more sensitive to fertilization treatments than N allocation in the area.

Intelligent Resource Allocations for Software-Defined Mission-Critical IoT Services

Heterogeneous Internet of Things(IoT)applications generate a diversity of novelty applications and services in next-generation networks(NGN),which is essential to guarantee end-to-end(E2E)communication resources for both control plane(CP)and data plane(DP).Likewise,the heterogeneous 5th generation(5G)communication applications,including Mobile Broadband Communications(MBBC),massive Machine-Type Commutation(mMTC),and ultra-reliable low latency communications(URLLC),obligate to perform intelligent Quality-of-Service(QoS)Class Identifier(QCI),while the CP entities will be suffered from the complicated massive HIOT applications.Moreover,the existing management and orchestration(MANO)models are inappropriate for resource utilization and allocation in large-scale and complicated network environments.To cope with the issues mentioned above,this paper presents an adopted software-defined mobile edge computing(SDMEC)with a lightweight machine learning(ML)algorithm,namely support vector machine(SVM),to enable intelligent MANO for real-time and resource-constraints IoT applications which require lightweight computation models.Furthermore,the SVM algorithm plays an essential role in performing QCI classification.Moreover,the software-defined networking(SDN)controller allocates and configures priority resources according to the SVM classification outcomes.Thus,the complementary of SVM and SDMEC conducts intelligent resource MANO for massive QCI environments and meets the perspectives of mission-critical communication with resource constraint applications.Based on the E2E experimentation metrics,the proposed scheme shows remarkable outperformance in key performance indicator(KPI)QoS,including communication reliability,latency,and communication throughput over the various powerful reference methods.

Egalitarian Allocations and the Inverse Problem for the Shapley Value

In a cooperative transferable utilities game, the allocation of the win of the grand coalition is an Egalitarian Allocation, if this win is divided into equal parts among all players. The Inverse Set relative to the Shapley Value of a game is a set of games in which the Shapley Value is the same as the initial one. In the Inverse Set, we determined a family of games for which the Shapley Value is also a coalitional rational value. The Egalitarian Allocation of the game is efficient, so that in the set called the Inverse Set relative to the Shapley Value, the allocation is the same as the initial one, but may not be coalitional rational. In this paper, we shall find out in the same family of the Inverse Set, a subfamily of games with the Egalitarian Allocation is also a coalitional rational value. We show some relationship between the two sets of games, where our values are coalitional rational. Finally, we shall discuss the possibility that our procedure may be used for solving a very similar problem for other efficient values. Numerical examples show the procedure to get solutions for the efficient values.

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.

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.

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.

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.

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.

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.

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.

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.

A new quantum key distribution resource allocation and routing optimization scheme

Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols.However,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks.In this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet distribution.Firstly,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot scheduling.Secondly,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key resources.Finally,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key resources.Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.

Resource Allocation in Multi-User Cellular Networks:A Transformer-Based Deep Reinforcement Learning Approach

To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.

Fixed-Time Sliding Mode Control With Varying Exponent Coefficient for Modular Reconfigurable Flight Arrays

The modular system can change its physical structure by self-assembly and self-disassembly between modules to dynamically adapt to task and environmental requirements. Recognizing the adaptive capability of modular systems, we introduce a modular reconfigurable flight array(MRFA) to pursue a multifunction aircraft fitting for diverse tasks and requirements,and investigate the attitude control and the control allocation problem by using the modular reconfigurable flight array as a platform. First, considering the variable and irregular topological configuration of the modular array, a center-of-mass-independent flight array dynamics model is proposed to allow control allocation under over-actuated situations. Secondly, in order to meet the stable, fast and accurate attitude tracking performance of the MRFA, a fixed-time convergent sliding mode controller with state-dependent variable exponent coefficients is proposed to ensure fast convergence rate both away from and near the system equilibrium point without encountering the singularity. It is shown that the controller also has fixed-time convergent characteristics even in the presence of external disturbances. Finally,simulation results are provided to demonstrate the effectiveness of the proposed modeling and control strategies.

Computing Resource Allocation for Blockchain-Based Mobile Edge Computing

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.

Resource Allocation for Cognitive Network Slicing in PD-SCMA System Based on Two-Way Deep Reinforcement Learning

In this paper,we propose the Two-way Deep Reinforcement Learning(DRL)-Based resource allocation algorithm,which solves the problem of resource allocation in the cognitive downlink network based on the underlay mode.Secondary users(SUs)in the cognitive network are multiplexed by a new Power Domain Sparse Code Multiple Access(PD-SCMA)scheme,and the physical resources of the cognitive base station are virtualized into two types of slices:enhanced mobile broadband(eMBB)slice and ultrareliable low latency communication(URLLC)slice.We design the Double Deep Q Network(DDQN)network output the optimal codebook assignment scheme and simultaneously use the Deep Deterministic Policy Gradient(DDPG)network output the optimal power allocation scheme.The objective is to jointly optimize the spectral efficiency of the system and the Quality of Service(QoS)of SUs.Simulation results show that the proposed algorithm outperforms the CNDDQN algorithm and modified JEERA algorithm in terms of spectral efficiency and QoS satisfaction.Additionally,compared with the Power Domain Non-orthogonal Multiple Access(PD-NOMA)slices and the Sparse Code Multiple Access(SCMA)slices,the PD-SCMA slices can dramatically enhance spectral efficiency and increase the number of accessible users.

Role Dynamic Allocation of Human-Robot Cooperation Based on Reinforcement Learning in an Installation of Curtain Wall

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.

Stochastic Gradient Compression for Federated Learning over Wireless Network

As a mature distributed machine learning paradigm,federated learning enables wireless edge devices to collaboratively train a shared AI-model by stochastic gradient descent(SGD).However,devices need to upload high-dimensional stochastic gradients to edge server in training,which cause severe communication bottleneck.To address this problem,we compress the communication by sparsifying and quantizing the stochastic gradients of edge devices.We first derive a closed form of the communication compression in terms of sparsification and quantization factors.Then,the convergence rate of this communicationcompressed system is analyzed and several insights are obtained.Finally,we formulate and deal with the quantization resource allocation problem for the goal of minimizing the convergence upper bound,under the constraint of multiple-access channel capacity.Simulations show that the proposed scheme outperforms the benchmarks.

Online Learning-Based Offloading Decision and Resource Allocation in Mobile Edge Computing-Enabled Satellite-Terrestrial Networks

Mobile edge computing(MEC)-enabled satellite-terrestrial networks(STNs)can provide Internet of Things(IoT)devices with global computing services.Sometimes,the network state information is uncertain or unknown.To deal with this situation,we investigate online learning-based offloading decision and resource allocation in MEC-enabled STNs in this paper.The problem of minimizing the average sum task completion delay of all IoT devices over all time periods is formulated.We decompose this optimization problem into a task offloading decision problem and a computing resource allocation problem.A joint optimization scheme of offloading decision and resource allocation is then proposed,which consists of a task offloading decision algorithm based on the devices cooperation aided upper confidence bound(UCB)algorithm and a computing resource allocation algorithm based on the Lagrange multiplier method.Simulation results validate that the proposed scheme performs better than other baseline schemes.