Protection of Collective Rights of Rural Members in the Process of Land Transfer under Shareholding Cooperative Systems

According to the legal definitions of land transfer under shareholding cooperative systems,rural groups,collective rights of members,and this paper discloses the necessity of protecting the collective rights of members.In terms of qualification definition of members,rights of fetus,married daughters and sons in law cannot be guaranteed.In terms of rights protection,partial rights cannot be assured,power of personal stake inthe collective members is imperfect which results in inadequate,unbalanced,shaky and unpunctuated benefits.Based on objective and subjectivecauses,the democratic management rights of members in land transfer process have been weakened or even deprived,the protection of the basiclife is hard to realize.The paper proposes that it is necessary to build the social protection mechanisms of rural land shareholding cooperative sys-tems.The first is to treat those members that own land,attending the shareholding cooperation but having not taken part in the land transfer proces-sion as the protection objects.The second is in the procession of land transfer,making it clear the compensation standards of land transfer,estab-lishing the intermediate agencies of land transfer and performing the collective economic organizing functions.The third is that the account capital ofsocial protection is contributed together by personal member,the land users(shareholding cooperative companies) and government.The fourth isto pay more attention to the added value and safety management of capital operation.

Distributed Control for <i>n</i>×<i>n</i>Cooperative Systems Governed by Hyperbolic Operator of Infinite Order

In this study, a distributed optimal control problem for n × n cooperative hyperbolic systems with infinite order operators and Dirichlet conditions are considered. The existence and uniqueness of the state of these systems are proved. The necessary and sufficient conditions for optimality of distributed control with constraints are found, and the set of equations and inequalities that defining the optimal control of these systems is also obtained. Finally, some examples for the control problem without constraints are given.

Reliability indexes for multi-AUV cooperative systems

With the development of multi-autonomous underwater vehicle(AUV) cooperative systems, the evaluation of their reliability is becoming more and more important. Aimed at the characteristics of the system, three reliability indexes – standard entropy of rank distribution, all-terminal reliability and standard natural connectivity are determined in this paper. Topology structure and underwater acoustic communication are considered. The calculation methods of the three reliability indexes are proposed, and the characteristics of these indexes are analyzed. The reliability indexes of two multi-AUV cooperative systems are obtained as examples. Results show that these three indexes reflect different aspects of reliability for multi-AUV cooperative systems. This paper provides some methods to evaluate the reliability of multi-AUV cooperative systems, which is of practical value.

Time-varying reliability indexes for multi-AUV cooperative system

With the development of multi-autonomous underwater vehicle(AUV) cooperative systems, the evaluation of their reliability is becoming more and more important. Since AUVs are always in motion, the reliability of the system is not stationary, but it varies with time. This paper studies the time-varying reliability evaluation indexes for multi-AUV cooperative systems. Aimed at elucidating the characteristics of the system, by considering the motion of the AUVs, two time dependent reliability evaluation indexes, natural connectivity and all-terminal reliability of the basic reliability indexes, are determined with the graph theory. Then the timevarying reliability of multi-AUV cooperative systems is evaluated combining with an actual example. This paper provides a method to evaluate the time-varying reliability of multi-AUV cooperative systems.

On intelligent Cooperative System

ＯｎｉｎｔｅｌｌｉｇｅｎｔＣｏｏｐｅｒａｔｉｖｅＳｙｓｔｅｍ￥ＬｉＴｏｎｇ；ＺｈａｉＦａｎ；ＬｉＹａｎ＆ＦｅｎｄＳｈａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＡＣＥ，ＨｕａｚｈｏｎｇＵｎｉｖｅｒｓｉｔｙｏｆＳｃｉｅｎｃｅａｎｄＴｅｃｈｎｏｌｏｇｙ，Ｗｕｈａｎ４３...

Permanence and Globally Asymptotic Stability of Cooperative System Incorporating Harvesting

The stability of a kind of cooperative models incorporating harvesting is considered in this paper. By analyzing the characteristic roots of the models and constructing suitable Lyapunov functions, we prove that nonnegative equilibrium points of the models are globally asymptotically stable. Further, the corresponding nonautonomous cooperative models have a unique asymptotically periodic solution, which is uniformly asymptotically stable. An example is given to illustrate the effectiveness of our results.

Development Model and Characteristics of Rural Land Joint Stock-cooperative System

We introduce and analyze operating mechanism of three major rural land joint-stock cooperative systems in China,including community type(Nanhai model),collective leasing type(Ningxia Pingluo model) and joint operating type(Zhejiang Jiande model).Current rural land joint-stock cooperative system has following characteristics.Firstly,adhere to the collective ownership and household contract responsibility system in rural areas.Secondly,safeguard farmers' land contractual rights and interests.Thirdly,implement large-scale agricultural production and operation.Fourthly,carry out normative operation of farmers' cooperatives.On the basis of these,we point out such problems as backward technology and short of funds in development of rural land joint-stock cooperative system.Finally,we conclude that the development of rural land joint-stock cooperative system should fully draw lessons from foreign advanced experience,actively try new model like securitization of rural land,to explore a road suitable for current national conditions.

BOUNDARY BLOW-UP RATE OF THE LARGE SOLUTION FOR AN ELLIPTIC COOPERATIVE SYSTEM

In this article we consider positive large solution of cooperative systems of the form -△u1=λ1u1 + a1u1u2^q1 -b1(x)u1^p1+1,-△u2=λ2u2 + a2u1^q2u2 -b2(x)u2^p2+1 in a bounded smooth domainΩ■ R^N(λi ∈ R, ai, bi>0, 0 < qi < pj, i, j ∈{1, 2}, i ≠ j), Based on the construction of certain sup and sub-solution, we show existence, uniqueness and blow-up rate of the large solution.

Cooperative Rate Splitting Transmit Design for Full-Duplex-Enabled Multiple Multicast Communication Systems

This paper examines the performance of Full-Duplex Cooperative Rate Splitting(FD-CRS)with Simultaneous Wireless Information and Power Transfer(SWIPT)support in Multiple Input Single Output(MISO)networks.In a Rate Splitting Multiple Access(RSMA)multicast system with two local users and one remote user,the common data stream contains the needs of all users,and all users can decode the common data stream.Therefore,each user can receive some information that other users need,and local users with better channel conditions can use this information to further enhance the reception reliability and data rate of users with poor channel quality.Even using Cell-Center-Users(CCUs)as a cooperative relay to assist the transmission of common data can improve the average system speed.To maximize the minimum achievable rate,we optimize the beamforming vector of Base Station(BS),the common streamsplitting vector,the cooperative distributed beamvector and the strong user transmission power under the power budget constraints of BS and relay devices and the service quality requirements constraints of users.Since the whole problem is not convex,we cannot solve it directly.Therefore,we propose a low complexity algorithm based on Successive Convex Approximation(SCA)technology to find the optimal solution to the problemunder consideration.The simulation results show that FD C-RSMA has better gain andmore powerful than FD C-NOMA,HD C-RSMA,RSMA and NOMA.

SR-DCSK Cooperative Communication System with Code Index Modulation:A New Design for 6G New Radios

This paper proposes a high-throughput short reference differential chaos shift keying cooperative communication system with the aid of code index modulation,referred to as CIM-SR-DCSK-CC system.In the proposed CIM-SR-DCSK-CC system,the source transmits information bits to both the relay and destination in the first time slot,while the relay not only forwards the source information bits but also sends new information bits to the destination in the second time slot.To be specific,the relay employs an N-order Walsh code to carry additional log_(2)N information bits,which are superimposed onto the SRDCSK signal carrying the decoded source information bits.Subsequently,the superimposed signal carrying both the source and relay information bits is transmitted to the destination.Moreover,the theoretical bit error rate(BER)expressions of the proposed CIMSR-DCSK-CC system are derived over additive white Gaussian noise(AWGN)and multipath Rayleigh fading channels.Compared with the conventional DCSKCC system and SR-DCSK-CC system,the proposed CIM-SR-DCSK-CC system can significantly improve the throughput without deteriorating any BER performance.As a consequence,the proposed system is very promising for the applications of the 6G-enabled lowpower and high-rate communication.

MUTS-Based Cooperative Target Stalking for A Multi-USV System

This paper is concerned with the cooperative target stalking for a multi-unmanned surface vehicle(multi-USV)system.Based on the multi-agent deep deterministic policy gradient(MADDPG)algorithm,a multi-USV target stalking(MUTS)algorithm is proposed.Firstly,a V-type probabilistic data extraction method is proposed for the first time to overcome shortcomings of the MADDPG algorithm.The advantages of the proposed method are twofold:1)it can reduce the amount of data and shorten training time;2)it can filter out more important data in the experience buffer for training.Secondly,in order to avoid the collisions of USVs during the stalking process,an action constraint method called Safe DDPG is introduced.Finally,the MUTS algorithm and some existing algorithms are compared in cooperative target stalking scenarios.In order to demonstrate the effectiveness of the proposed MUTS algorithm in stalking tasks,mission operating scenarios and reward functions are well designed in this paper.The proposed MUTS algorithm can help the multi-USV system avoid internal collisions during the mission execution.Moreover,compared with some existing algorithms,the newly proposed one can provide a higher convergence speed and a narrower convergence domain.

Cooperative game theory-based steering law design of a CMG system

Spacecraft require a large-angle manoeuvre when performing agile manoeuvring tasks, therefore a control moment gyroscope(CMG) is employed to provide a strong moment.However, the control of the CMG system easily falls into singularity, which renders the actuator unable to output the required moment. To solve the singularity problem of CMGs, the control law design of a CMG system based on a cooperative game is proposed. First, the cooperative game model is constructed according to the quadratic programming problem, and the cooperative strategy is constructed. When the strategy falls into singularity, the weighting coefficient is introduced to carry out the strategy game to achieve the optimal strategy. In theory, it is proven that the cooperative game manipulation law of the CMG system converges, the sum of the CMG frame angular velocities is minimized, the energy consumption is small, and there is no output torque error. Then, the CMG group system is simulated.When the CMG system is near the singular point, it can quickly escape the singularity. When the CMG system falls into the singularity, it can also escape the singularity. Considering the optimization of angular momentum and energy consumption, the feasibility of the CMG system steering law based on a cooperative game is proven.

Evaluation of Linear Precoding Schemes for Cooperative Multi-Cell MU MIMO in Future Mobile Communication Systems

In Mobile Communication Systems, inter-cell interference becomes one of the challenges that degrade the system’s performance, especially in the region with massive mobile users. The linear precoding schemes were proposed to mitigate interferences between the base stations (inter-cell). These schemes are categorized into linear and non-linear;this study focused on linear precoding schemes, which are grounded into three types, namely Zero Forcing (ZF), Block Diagonalization (BD), and Signal Leakage Noise Ratio (SLNR). The study included the Cooperative Multi-cell Multi Input Multi Output (MIMO) System, whereby each Base Station serves more than one mobile station and all Base Stations on the system are assisted by each other by shared the Channel State Information (CSI). Based on the Multi-Cell Multiuser MIMO system, each Base Station on the cell is intended to maximize the data transmission rate by its mobile users by increasing the Signal Interference to Noise Ratio after the interference has been mitigated due to the usefully of linear precoding schemes on the transmitter. Moreover, these schemes used different approaches to mitigate interference. This study mainly concentrates on evaluating the performance of these schemes through the channel distribution models such as Ray-leigh and Rician included in the presence of noise errors. The results show that the SLNR scheme outperforms ZF and BD schemes overall scenario. This implied that when the value of SNR increased the performance of SLNR increased by 21.4% and 45.7% for ZF and BD respectively.

Research on the cooperative train control method in the metro system for energy saving

Purpose–To address the problem that the current train operation mode that train selects one of several offline pre-generated control schemes before the departure and operates following the scheme after the departure,energy-saving performance of the whole metro system cannot be guaranteed.Design/methodology/approach–A cooperative train control framework is formulated to regulate a novel train operation mode.The classic train four-phase control strategy is improved for generating specific energy-efficient control schemes for each train.An improved brute force(BF)algorithm with a two-layer searching idea is designed to solve the optimisation model of energy-efficient train control schemes.Findings–Case studies on the actual metro line in Guangzhou,China verify the effectiveness of the proposed train control methods compared with four-phase control strategy under different kinds of train operation scenarios and calculation parameters.The verification on the computation efficiency as well as accuracy of the proposed algorithm indicates that it meets the requirement of online optimisation.Originality/value–Most existing studies optimised energy-efficient train timetable or train control strategies through an offline process,which has a defect in coping with the disturbance or delays effectively and promptly during real-time train operation.This paper studies an online optimisation of cooperative train control based on the rolling optimisation idea,where energy-efficient train operation can be realised once train running time is determined,thus mitigating the impact of unpredictable operation situations on the energy-saving performance of trains.

Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks

Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.

Optimization of Cooperative RelayingMolecular Communications for Nanomedical Applications

Recently,nano-systems based on molecular communications via diffusion(MCvD)have been implemented in a variety of nanomedical applications,most notably in targeted drug delivery system(TDDS)scenarios.Furthermore,because the MCvD is unreliable and there exists molecular noise and inter symbol interference(ISI),cooperative nano-relays can acquire the reliability for drug delivery to targeted diseased cells,especially if the separation distance between the nano transmitter and nano receiver is increased.In this work,we propose an approach for optimizing the performance of the nano system using cooperative molecular communications with a nano relay scheme,while accounting for blood flow effects in terms of drift velocity.The fractions of the molecular drug that should be allocated to the nano transmitter and nano relay positioning are computed using a collaborative optimization problem solved by theModified Central Force Optimization(MCFO)algorithm.Unlike the previous work,the probability of bit error is expressed in a closed-form expression.It is used as an objective function to determine the optimal velocity of the drug molecules and the detection threshold at the nano receiver.The simulation results show that the probability of bit error can be dramatically reduced by optimizing the drift velocity,detection threshold,location of the nano-relay in the proposed nano system,and molecular drug budget.

Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals

Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.

Cooperative UAV search strategy based on DMPC-AACO algorithm in restricted communication scenarios

Improvement of integrated battlefield situational awareness in complex environments involving dynamic factors such as restricted communications and electromagnetic interference(EMI)has become a contentious research problem.In certain mission environments,due to the impact of many interference sources on real-time communication or mission requirements such as the need to implement communication regulations,the mission stages are represented as a dynamic combination of several communication-available and communication-unavailable stages.Furthermore,the data interaction between unmanned aerial vehicles(UAVs)can only be performed in specific communication-available stages.Traditional cooperative search algorithms cannot handle such situations well.To solve this problem,this study constructed a distributed model predictive control(DMPC)architecture for a collaborative control of UAVs and used the Voronoi diagram generation method to re-plan the search areas of all UAVs in real time to avoid repetition of search areas and UAV collisions while improving the search efficiency and safety factor.An attention mechanism ant-colony optimization(AACO)algorithm is proposed for UAV search-control decision planning.The search strategy is adaptively updated by introducing an attention mechanism for regular instruction information,a priori information,and emergent information of the mission to satisfy different search expectations to the maximum extent.Simulation results show that the proposed algorithm achieves better search performance than traditional algorithms in restricted communication constraint scenarios.

Cooperative Anti-Jamming and Interference Mitigation for UAV Networks: A Local Altruistic Game Approach

To improve the anti-jamming and interference mitigation ability of the UAV-aided communication systems, this paper investigates the channel selection optimization problem in face of both internal mutual interference and external malicious jamming. A cooperative anti-jamming and interference mitigation method based on local altruistic is proposed to optimize UAVs’ channel selection. Specifically, a Stackelberg game is modeled to formulate the confrontation relationship between UAVs and the jammer. A local altruistic game is modeled with each UAV considering the utilities of both itself and other UAVs. A distributed cooperative anti-jamming and interference mitigation algorithm is proposed to obtain the Stackelberg equilibrium. Finally, the convergence of the proposed algorithm and the impact of the transmission power on the system loss value are analyzed, and the anti-jamming performance of the proposed algorithm can be improved by around 64% compared with the existing algorithms.

Cooperative Relaying in a Three User Downlink NOMA System Using Dynamic Power Allocation

Non-orthogonal multiple access(NOMA)represents the latest addition to the array of multiple access techniques,enabling simultaneous servicing of multiple users within a singular resource block in terms of time,frequency,and code.A typical NOMA configuration comprises a base station along with proximate and distant users.The proximity users experience more favorable channel conditions in contrast to distant users,resulting in a compromised performance for the latter due to the less favorable channel conditions.When cooperative communication is integrated with NOMA,the overall system performance,including spectral efficiency and capacity,is further elevated.This study introduces a cooperative NOMA setup in the downlink,involving three users,and employs dynamic power allocation(DPA).Within this framework,User 2 acts as a relay,functioning under the decode-and-forward protocol,forwarding signals to both User 1 and User 3.This arrangement aims to bolster the performance of the user positioned farthest from the base station,who is adversely affected by weaker channel conditions.Theoretical and simulation outcomes reveal enhancements within the system’s performance.