Adaptive Event-Triggered Time-Varying Output Group Formation Containment Control of Heterogeneous Multiagent Systems

In this paper,a class of time-varying output group formation containment control problem of general linear hetero-geneous multiagent systems(MASs)is investigated under directed topology.The MAS is composed of a number of tracking leaders,formation leaders and followers,where two different types of leaders are used to provide reference trajectories for movement and to achieve certain formations,respectively.Firstly,compen-sators are designed whose states are estimations of tracking lead-ers,based on which,a controller is developed for each formation leader to accomplish the expected formation.Secondly,two event-triggered compensators are proposed for each follower to evalu-ate the state and formation information of the formation leaders in the same group,respectively.Subsequently,a control protocol is designed for each follower,utilizing the output information,to guide the output towards the convex hull generated by the forma-tion leaders within the group.Next,the triggering sequence in this paper is decomposed into two sequences,and the inter-event intervals of these two triggering conditions are provided to rule out the Zeno behavior.Finally,a numerical simulation is intro-duced to confirm the validity of the proposed results.

Optimization Task Scheduling Using Cooperation Search Algorithm for Heterogeneous Cloud Computing Systems

Cloud computing has taken over the high-performance distributed computing area,and it currently provides on-demand services and resource polling over the web.As a result of constantly changing user service demand,the task scheduling problem has emerged as a critical analytical topic in cloud computing.The primary goal of scheduling tasks is to distribute tasks to available processors to construct the shortest possible schedule without breaching precedence restrictions.Assignments and schedules of tasks substantially influence system operation in a heterogeneous multiprocessor system.The diverse processes inside the heuristic-based task scheduling method will result in varying makespan in the heterogeneous computing system.As a result,an intelligent scheduling algorithm should efficiently determine the priority of every subtask based on the resources necessary to lower the makespan.This research introduced a novel efficient scheduling task method in cloud computing systems based on the cooperation search algorithm to tackle an essential task and schedule a heterogeneous cloud computing problem.The basic idea of thismethod is to use the advantages of meta-heuristic algorithms to get the optimal solution.We assess our algorithm’s performance by running it through three scenarios with varying numbers of tasks.The findings demonstrate that the suggested technique beats existingmethods NewGenetic Algorithm(NGA),Genetic Algorithm(GA),Whale Optimization Algorithm(WOA),Gravitational Search Algorithm(GSA),and Hybrid Heuristic and Genetic(HHG)by 7.9%,2.1%,8.8%,7.7%,3.4%respectively according to makespan.

Discreet investors exert greater influence on cooperation in the public goods game

This paper studies the evolutionary process of cooperative behavior in a public goods game model with heterogeneous investment strategies in square lattices.In the proposed model,players are divided into defectors,cooperators and discreet investors.Among these,defectors do not participate in investing,discreet investors make heterogeneous investments based on the investment behavior and cooperation value of their neighbors,and cooperators invest equally in each neighbor.In real life,heterogeneous investment is often accompanied by time or economic costs.The discreet investors in this paper pay a certain price to obtain their neighbors'investment behavior and cooperation value,which quantifies the time and economic costs of the heterogeneous investment process.The results of Monte Carlo simulation experiments in this study show that discreet investors can effectively resist the invasion of the defectors,form a stable cooperative group and expand the cooperative advantage in evolution.However,when discreet investors pay too high a price,they lose their strategic advantage.The results in this paper help us understand the role of heterogeneous investment in promoting and maintaining human social cooperation.

The Effectiveness of Group Cooperative Learning Method in Badminton Teaching in Colleges and Universities

In college badminton teaching,teachers utilize the group cooperative learning method,which not only helps to improve students’badminton skill level but also cultivates their teamwork spirit,communication skills,and self-management ability unconsciously.In view of this,this paper mainly describes the significance of applying the group cooperative learning method in college badminton teaching,analyzes the current problems in college badminton teaching,and aims to discover effective development strategies for group cooperative learning method in college badminton teaching in order to improve the effectiveness of college badminton teaching.

Competitive and Cooperative-Based Strength Pareto Evolutionary Algorithm for Green Distributed Heterogeneous Flow Shop Scheduling

This work aims to resolve the distributed heterogeneous permutation flow shop scheduling problem(DHPFSP)with minimizing makespan and total energy consumption(TEC).To solve this NP-hard problem,this work proposed a competitive and cooperative-based strength Pareto evolutionary algorithm(CCSPEA)which contains the following features:1)An initialization based on three heuristic rules is developed to generate a population with great diversity and convergence.2)A comprehensive metric combining convergence and diversity metrics is used to better represent the heuristic information of a solution.3)A competitive selection is designed which divides the population into a winner and a loser swarms based on the comprehensive metric.4)A cooperative evolutionary schema is proposed for winner and loser swarms to accelerate the convergence of global search.5)Five local search strategies based on problem knowledge are designed to improve convergence.6)Aproblem-based energy-saving strategy is presented to reduce TEC.Finally,to evaluate the performance of CCSPEA,it is compared to four state-of-art and run on 22 instances based on the Taillard benchmark.The numerical experiment results demonstrate that 1)the proposed comprehensive metric can efficiently represent the heuristic information of each solution to help the later step divide the population.2)The global search based on the competitive and cooperative schema can accelerate loser solutions convergence and further improve the winner’s exploration.3)The problembased initialization,local search,and energy-saving strategies can efficiently reduce the makespan and TEC.4)The proposed CCSPEA is superior to the state-of-art for solving DHPFSP.

Multi-Radio Cooperation Technology and Heterogeneous Network Convergence

The heterogeneous network convergence is the trend of future network development. However, many bottlenecks exist in the converged system such as high time delay, high energy consumption, and low data rate. Multi-Radio Cooperation (MRC) technology is specially designed to overcome these bottlenecks and to satisfy the requirements of heterogeneous network convergence. MRC can improve network capacity, reduce the energy consumption of radio devices, and decrease handover latency between heterogeneous networks by the cooperation of multiple radios, and by efficient management and feasible allocation of multi-radio resources. MRC makes real seamless heterogeneous network convergence possible.

Cooperative task allocation for heterogeneous multi-UAV using multi-objective optimization algorithm

The application of multiple UAVs in complicated tasks has been widely explored in recent years.Due to the advantages of flexibility,cheapness and consistence,the performance of heterogeneous multi-UAVs with proper cooperative task allocation is superior to over the single UAV.Accordingly,several constraints should be satisfied to realize the efficient cooperation,such as special time-window,variant equipment,specified execution sequence.Hence,a proper task allocation in UAVs is the crucial point for the final success.The task allocation problem of the heterogeneous UAVs can be formulated as a multi-objective optimization problem coupled with the UAV dynamics.To this end,a multi-layer encoding strategy and a constraint scheduling method are designed to handle the critical logical and physical constraints.In addition,four optimization objectives:completion time,target reward,UAV damage,and total range,are introduced to evaluate various allocation plans.Subsequently,to efficiently solve the multi-objective optimization problem,an improved multi-objective quantum-behaved particle swarm optimization(IMOQPSO)algorithm is proposed.During this algorithm,a modified solution evaluation method is designed to guide algorithmic evolution;both the convergence and distribution of particles are considered comprehensively;and boundary solutions which may produce some special allocation plans are preserved.Moreover,adaptive parameter control and mixed update mechanism are also introduced in this algorithm.Finally,both the proposed model and algorithm are verified by simulation experiments.

Improved Performance for a Heterogeneous Satellite-Cooperative Network with Best Relay Node Selection

Nowadays, hybrid satellite-terrestrial cooperative network has emerged as a key technology to provide a great variety of communication services. The deployment of this network will improve coverage and capacity in remote areas. Despite the benefits of this network, by increasing the number of users, communication efficiency based on interference management is a major challenge in satellite-based system. Also, the direct links between satellite system and the terrestrial equipment do not always have desirable channel condition. In order to avoid serious throughput degradation, choosing a cooperative relay node is very important. In this paper, Stackelberg game is exploited for interference management that is raised by satellites in down link over terrestrial equipment. Then, for interference management between ground station and relay node with other mobile users, CVX is used to allocate optimum power. Also, the best relay node in this structure is selected based on the harmonic mean function. Thus, the performance of the heterogeneous satellite-cooperative network is investigated based on three benchmarks, namely, successful transmission, energy consumption and outage probability. Finally, the simulation results showed the effect of proposed system model on the performance of next generation satellite networks.

Energy-Efficient Resource Allocation for Heterogeneous Network with Grouping D2D

In this paper,a new communication model is built named grouping D2D(GD2D).Different from the traditional D2D coordination,we proposed GD2D communication in licensed and unlicensed spectrum simultaneously.We formulate a resource allocation problem,which aims at maximizing the energy efficiency(EE)of the system while guaranteeing the quality-of-service(Qos)of users.To efficiently solve this problem,the non-convex optimization problem is first transformed into a convex optimization problem.By transforming the fractional-form problem into an equivalent subtractive-form problem,an iterative power allocation algorithm is proposed to maximize the system EE.Moreover,the optimal closedform power allocation expressions are derived by the Lagrangian approach.Simulation results show that our algorithm achieves higher EE performance than the traditional D2D communication scheme.

Quaternary-ammonium-immobilized polystyrenes as efficient and reusable heterogeneous catalysts for synthesis of cyclic carbonate:Effects of linking chains and pendent hydroxyl group

Spherical polystyrene‐supported ammonium salts containing different linking chains between the support and ammonium groups were prepared as efficient and easily reusable heterogeneous catalysts for the cycloadditions of CO2and epoxides.The effects of the length of the linking chains and a hydroxyl group pendent on the linking chain on the catalytic performance of ionic liquid immobilized catalysts and their mechanisms were studied through experiments and density functional theory calculations.It was found that,compared with a short linking chain,a long chain can make the halogen anion more negative and provide a larger contact area of the catalysts with the reactants,thus enhancing the reaction kinetics.The hydroxyl group can stretch the C-O bonds of the epoxides,promoting the reaction thermodynamics.As a result,for the cycloaddition of propylene oxide,the yield of propylene carbonate is much higher for the catalyst with a long linking chain(yield:91.4%)compared with the yield for that with a short chain(yield:70.9%),and is further increased in the presence of pendent hydroxyl groups(yield:98.5%).The catalyst also shows a high catalytic activity even at mild temperature and good reusability(yield:≥96%for10cycles),and the selectivity is always above99%.

Controllability of heterogeneous interdependent group systems under undirected and directed topology

The controllability problem of heterogeneous interdependent group systems with undirected and directed topology is investigated in this paper. First, the interdependent model of the heterogeneous system is set up according to the difference of individual characteristics. An extended distributed protocol with the external sliding-mode control is designed, under which it is shown that a heterogeneous interdependent group system is controllable when the corresponding communication topology is controllable. Then, using the network eigenvalue method, the driving individuals are determined for a heterogeneous system with undirected topology. Under directed topology, the maximum match method is utilized to confirm the driving individuals. Some sufficient and necessary conditions are presented to assure that the heterogeneous interdependent group system is structurally controllable. Via theoretical analysis, the controllability of heterogeneous interdependent systems is related to the interdependent manner and the structure of the heterogeneous system. Numerical simulations are provided to demonstrate the effectiveness of the theoretical results.

CCOIC and Suning Commerce Group Signed Strategic Cooperation agreement

The signing ceremony of strategic cooperation agreement between China Chamber of International Commerce(CCOIC)and Suning Commerce Group Co.,Ltd(Suning)was heldin Beijing on August 23.Chairman of the CCPIT and CCOIC Jiang Zengwei and chairman of Suning Zhang Jindong attended and witnessed the ceremony.Secretary-General of the CCOIC Yu Jianlong and vice president of

Cooperation Oriented Computing:A Computing Model Based on Emergent Dynamics of Group Cooperation

Traditional way of problem solving tries to deliver data to program.But when the problem’s complexity exponentially increases as the data scale increases,to obtain the solution is difficult.Group cooperation computing model works in an inverse way by delivering program to data.It first models each single data as individual and data unit as group of individuals.Then,different cooperation rules are designed for individuals to cooperate with each other.Finally,the solution of the problem emerges through individuals’cooperation process.This study applies group cooperation computing model to solve Hamilton Path problem which has NP-complete time complexity.Experiment results show that the cooperation model works much better than genetic algorithm.More importantly,the following properties of group cooperation computing are found which may be different from the traditional computing theory.(1)By using different cooperation rules,the same problem with the same scale may exhibit different complexities,such as liner or exponent.(2)By using the same cooperation rule,when the problem scale is less than a specific threshold,the problem’s time complexity is liner.Otherwise,the problem complexity may be exponent.

Research on the Causes and Governance of Non-standard Problems of Heterogeneous Agricultural Cooperatives-based on the Reality Observation from X County in Ganzi Prefecture, China

Over the years,the positive effect of the growth of China’s agricultural cooperatives on the development of rural economy is undoubted,but many problems have been exposed in practice,such as the non-standard problems of shell cooperatives.This paper takes 355 cooperatives in a county of Ganzi as an example to study the types and reasons of nonstandard phenomena in the development of heterogeneous cooperatives,and then puts forward the construction of cooperative governance mechanism based on principal-agent relationship;propagandizing the new cooperative law,enhancing the sense of legal system of members and other governance suggestions to promote the healthy and high-quality development of agricultural cooperatives.

Cooperative Group互动式课堂活动创意设计

合作学习是一种富有创意和实效的教学理论与策略体系,常以Cooperative Group的形式出现,以学生为中心组织学习活动,最终达到改善课堂心理气氛、提高学习主动性、促进良好的非认知品质的目的。本文浅述了Discussing法、PPT Show法、Telling-story法、Roleplaying法等四种Cooperative Group学习方法策略,以期改变传统教学模式,提高大学英语课堂教学有效性。

Detecting fake reviewers in heterogeneous networks of buyers and sellers:a collaborative training-based spammer group algorithm

It is not uncommon for malicious sellers to collude with fake reviewers(also called spammers)to write fake reviews for multiple products to either demote competitors or promote their products'reputations,forming a gray industry chain.To detect spammer groups in a heterogeneous network with rich semantic information from both buyers and sellers,researchers have conducted extensive research using Frequent Item Mining-based and graph-based meth-ods.However,these methods cannot detect spammer groups with cross-product attacks and do not jointly consider structural and attribute features,and structure-attribute correlation,resulting in poorer detection performance.There-fore,we propose a collaborative training-based spammer group detection algorithm by constructing a heterogene-ous induced sub-network based on the target product set to detect cross-product attack spammer groups.To jointly consider all available features,we use the collaborative training method to learn the feature representations of nodes.In addition,we use the DBSCAN clustering method to generate candidate groups,exclude innocent ones,and rank them to obtain spammer groups.The experimental results on real-world datasets indicate that the overall detection performance of the proposed method is better than that of the baseline methods.

A Secure Key Management Scheme for Heterogeneous Secure Vehicular Communication Systems

Intelligent transportation system （ITS） is proposed as the most effective way to improve road safety and traffic efficiency. However, the future of ITS for large scale transportation infrastructures deployment highly depends on the security level of vehicular communication systems （VCS）. Security applications in VCS are fulfilled through secured group broadcast. Therefore, secure key management schemes are considered as a critical research topic for network security. In this paper, we propose a framework for providing secure key management within heterogeneous network. The seeurity managers （SMs） play a key role in the framework by retrieving the vehicle departnre infi^rmation, encapsulating block to transport keys and then executing rekeying to vehicles within the same security domain. The first part of this framework is a novel Group Key Management （GKM） scheme basing on leaving probability （LP） of vehicles to depart current VCS region. Vehicle＇s LP factor is introduced into GKM scheme to achieve a more effieient rekeying scheme and less rekeying costs. The second component of the framework using the blockchain concept to simplify the distributed key management in heterogeneous VCS domains. Extensive simulations and analysis are provided to show the effectiveness and effieiency of the proposed framework： Our GKM results demonstrate that probability-based BR reduees rekeying eost compared to the benchmark scheme, while the blockchain deereases the time eost of key transmission over heterogeneous net-works.

Evolutionary snowdrift game on heterogeneous Newman-Watts small-world network

We study the evolutionary snowdrift game in a heterogeneous Newman-Watts small-world network. The heterogeneity of the network is controlled by the number of hubs. It is found that the moderate heterogeneity of the network can promote the cooperation best. Besides, we study how the hubs affect the evolution of cooperative behaviours of the heterogeneous Newman-Watts small-world network. Simulation results show that both the initial states of hubs and the connections between hubs can play an important role. Our work gives a further insight into the effect of hubs on the heterogeneous networks.