Research on the Reform of School-Enterprise Cooperation Teaching and Education Mode for Computer Majors

This paper discusses the innovative methods of school-enterprise cooperation education mode in computer applied talent training.An innovative training model based on school-enterprise cooperation is proposed to promote the cultivation of students’practical and innovative skills,so as to better adapt to the needs of society.By analyzing the key links and influencing factors of the training mode,this paper puts forward some concrete suggestions and measures to provide guidelines for universities and enterprises in personnel training.

Solving the Urban Domestic Waste Classification Dilemma from a Coalitional Game Perspective

The effective classification of urban domestic waste is the key to achieve a “waste-free city” and provides an essential guarantee for resource utilization. This article takes a coalitional game perspective to study the dilemmas in urban domestic waste separation from the cooperative interaction of residents, government, and enterprises. The study finds that urban domestic waste classification in China is currently facing many problems, focusing on: 1) insufficient consensus among residents, 2) shortage of input funds, 3) corporate profitability difficulties, 4) weak policy constraints, and 5) difficulties in integrating goals. In this regard, each participating body still needs to focus on collective interests, coalitional games, break the dilemma society, and promote the long-term management of urban domestic waste.

Exploration of the Training Mode of School-enterprise Collaborative AI Innovative Talents Based on PaddlePaddle

This paper takes the school-enterprise cooperation between the University of Electronic Science and Technology of China(UESTC)and Baidu(China)Co.,Ltd.as an example to build the Paddle Paddle(Sichuan)AI Education Innovation Center by enjoying the best of both UESTC and Baidu(China),and cooperating with 16 universities in Sichuan Province.With the support of this center,both the school and the enterprise successfully built a school-enterprise collaborative AI innovative talent training model,which mainly serves the universities,industries,and districts.Furthermore,this training model is able to facilitate the update of the industrial intelligence and the regional economic development in southwest China,and also provide a reference for deep integration of school-enterprise collaboration and the cultivation of innovative talents in electronic information fields.

Coalitional game based resource allocation in D2D-enabled V2V communication

The joint resource block(RB)allocation and power optimization problem is studied to maximize the sum-rate of the vehicle-to-vehicle(V2V)links in the device-to-device(D2D)-enabled V2V communication system,where one feasible cellular user(FCU)can share its RB with multiple V2V pairs.The problem is first formulated as a nonconvex mixed-integer nonlinear programming(MINLP)problem with constraint of the maximum interference power in the FCU links.Using the game theory,two coalition formation algorithms are proposed to accomplish V2V link partitioning and FCU selection,where the transferable utility functions are introduced to minimize the interference among the V2V links and the FCU links for the optimal RB allocation.The successive convex approximation(SCA)is used to transform the original problem into a convex one and the Lagrangian dual method is further applied to obtain the optimal transmit power of the V2V links.Finally,numerical results demonstrate the efficiency of the proposed resource allocation algorithm in terms of the system sum-rate.

MAV/UAV task coalition phased-formation method

The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.

Coalition Formation for Multiple UAVs Cooperative Search and Attack with Communication Constraints in Unknown Environment

A coalition formation algorithm is presented with limited communication ranges and delays in unknown environment,for the performance of multiple heterogeneous unmanned aerial vehicles(UAVs)in cooperative search and attack missions.The mathematic model of coalition formation is built on basis of the minimum attacking time and the minimum coalition size with satisfying resources and simultaneous strikes requirements.A communication protocol based on maximum number of hops is developed to determine the potential coalition members in dynamic network.A multistage sub-optimal coalition formation algorithm(MSOCFA)with polynomial time is established.The performances of MSOCFA and particle swarm optimization(PSO)algorithms are compared in terms of complexity,mission performance and computational time.A complex scenario is deployed to illustrate how the coalitions are formed and validate the feasibility of the MSOCFA.The effect of communication constraints(hop delay and max-hops)on mission performance is studied.The results show that it is beneficial to determine potential coalition members in a wide and deep range over the network in the presence of less delay.However,when the delays are significant,it is more advantageous to determine coalitions from among the immediate neighbors.

Algorithm to Form Coalition in Multi-Agent Cooperation

In multi-agent systems, autonomous agents may form coalition to increase the efficiency of problem solving. But the current coalition algorithm is very complex, and cannot satisfy the condition of optimality and stableness simultaneously. To solve the problem, an algorithm that uses the mechanism of distribution according to work for coalition formation is presented, which can achieve global optimal and stable solution in subadditive task oriented domains. The validity of the algorithm is demonstrated by both experiments and theory.

Evaluation Model for Capability of Enterprise Agent Coalition Based on Information Fusion and Attribute Reduction

For the issue of evaluation of capability of enterprise agent coalition,an evaluation model based on information fusion and entropy weighting method is presented. The attribute reduction method is utilized to reduce indicators of the capability according to the theory of rough set. The new indicator system can be determined. Attribute reduction can also reduce the workload and remove the redundant information,when there are too many indicators or the indicators have strong correlation. The research complexity can be reduced and the efficiency can be improved. Entropy weighting method is used to determine the weights of the remaining indicators,and the importance of indicators is analyzed. The information fusion model based on nearest neighbor method is developed and utilized to evaluate the capability of multiple agent coalitions,compared to cloud evaluation model and D-S evidence method. Simulation results are reasonable and with obvious distinction. Thus they verify the effectiveness and feasibility of the model. The information fusion model can provide more scientific,rational decision support for choosing the best agent coalition,and provide innovative steps for the evaluation process of capability of agent coalitions.

Coalition Formation in Weighted Simple-majority Games under Proportional Payoff Allocation Rules

In this paper, we introduce a simple coalition formation game in the environment of bidding, which is a special case of the weighted majority game （WMG）, and is named the weighted simple-majority game （WSMG）. In WSMG, payoff is allocated to the winners proportional to the players powers, which can be measured in various ways. We define a new kind of stability： the counteraction-stability （C-stability）, where any potential deviating players will confront counteractions of the other players. We show that C-stable coalition structures in WSMG always contains a minimal winning coalition of minimum total power. For the variant where powers are measured directly by their weights, we show that it is NP-hard to find a C-stable coalition structure and design a pseudo-polynomial time algorithm. Sensitivity analysis for this variant, which shows many interesting properties, is also done. We also prove that it is NP-hard to compute the Holler-Packel indices in WSMGs, and hence in WMGs as well.

On the Coalitional Rationality and the Inverse Problem for Shapley Value and the Semivalues

In cooperative game theory, a central problem is to allocate fairly the win of the grand coalition to the players who agreed to cooperate and form the grand coalition. Such allocations are obtained by means of values, having some fairness properties, expressed in most cases by groups of axioms. In an earlier work, we solved what we called the Inverse Problem for Semivalues, in which the main result was offering an explicit formula providing the set of all games with an a priori given Semivalue, associated with a given weight vector. However, in this set there is an infinite set of games for which the Semivalues are not coalitional rational, perhaps not efficient, so that these are not fair practical solutions of the above fundamental problem. Among the Semivalues, coalitional rational solutions for the Shapley Value and the Banzhaf Value have been given in two more recent works. In the present paper, based upon a general potential basis, relative to Semivalues, for a given game and a given Semivalue, we solve the connected problem: in the Inverse Set, find out a game with the same Semivalue, which is also coalitional rational. Several examples will illustrate the corresponding numerical technique.

Advocacy Coalition by External Actors and Strategies Used to Influence the Emergence of the National Nutrition Policy in Lao PDR

This article aims to explore the coalition of external actors and the strategies it deployed to influence the emergence of the National Nutrition Policy (NNP) in Lao People’s Democratic Republic (Lao PDR). The Advocacy Coalition Framework and the conceptual model of Effective Advocacy Strategies for Influencing Government Nutrition Policy were used to frame the data collection and their analysis. Sources of information were semi-structured interviews conducted with government and external actors, as well as all available documents on nutrition policy in Laos. The commitment of the government to achieve the Millennium Development Goals (MDGs) and to leave the Least Developed Country status created a favorable condition to support the emergence of the NNP in Laos. This context was a driving force for the building of an effective and convincing coalition of United Nations agencies able to accompany the government in redefining health priorities. Various strategies were used by the coalition to this end, including generating, disseminating, and using scientific evidence, assisting the government with a budget and technical expertise, providing decision-makers with opportunities to learn from other countries, and building relationships with the key actor. External actors can be a major force to support the emergence of a public policy in Laos, but this requires a window of opportunity like what the MDGs have been able to bring.

ANALYSIS OF GROUP MULTIUSER DETECTION BASED ON COALITION GAME THEORY

Coalition game theory is introduced to investigate the performance,fairness and stability of decorrelating group multiuser detection receiver,not only from the perspective of individual nodes,but also various coalitions and the whole system as well. Firstly,to derive how the system scale with coalition size,a stochastic model with transferable payoffs (stochastic TU-model) is provided. Secondly,to find the most preferred coalition structures from the view point of individual nodes,a model with Non-Transferable payoffs (NTU-model) is presented. Theoretical analysis and simulation results suggest that stochasticaly the grand coalition is payoff maximizing for the system as a whole,while individual nodes with good-conditioned channels may prefer local "win-win coalitions".

Mode Innovation of School-Enterprise Cooperation on Food Safety Testing Laboratory Reform

In view of the difficulties about school-enterprise cooperation on food safety testing laboratory reform,the current training program,teaching methods and teaching forms are not suitable for the new platform.This paper provides new ideas and modes to solve these problems,such as integrating the resource elements between school and enterprise,establishing new platforms with the help of external force and innovating the cooperation modes to improve the laboratory,which can fully serve teaching,scientific research and enterprise production.

School-Enterprise Cooperation in Excellent Engineer Education and Training Program at UESTC

School of Information and Software Engineering at University of Electronic Science and Technology of China(abbreviated hereafter as "SISE") joined Excellent Engineer Education and Training Program launched by Ministry of Education of China in 2011. This paper discussed nine models of school-enterprise cooperation practiced at SISE since 2011. The school-enterprise cooperation model effectively broadens the students' horizons and improves the students' practical ability and has been recognized by academic circles.

EIAS:An Efficient Identity-Based Aggregate Signature Scheme for WSNs Against Coalition Attack

Wireless sensor networks(WSNs)are the major contributors to big data acquisition.The authenticity and integrity of the data are two most important basic requirements for various services based on big data.Data aggregation is a promising method to decrease operation cost for resource-constrained WSNs.However,the process of data acquisitions in WSNs are in open environments,data aggregation is vulnerable to more special security attacks with hiding feature and subjective fraudulence,such as coalition attack.Aimed to provide data authenticity and integrity protection for WSNs,an efficient and secure identity-based aggregate signature scheme(EIAS)is proposed in this paper.Rigorous security proof shows that our proposed scheme can be secure against all kinds of attacks.The performance comparisons shows EIAS has clear advantages in term of computation cost and communication cost when compared with similar data aggregation scheme for WSNs.

Multi-task Coalition Parallel Formation Strategy Based on Reinforcement Learning

代理人联盟是代理人协作和合作的一种重要方式。形成一个联盟，代理人能提高他们的能力解决问题并且获得更多的实用程序。在这份报纸，新奇多工联盟平行形成策略被介绍，并且多工联盟形成的过程是一个 Markov 决定过程的结论理论上被证明。而且，学习的加强被用来解决多工联盟平行的代理人行为策略，和这个过程形成被描述。在多工面向的领域，策略罐头有效地并且平行形式多工联盟。

A Comparative Study of School-enterprise Cooperation and Work-study Combination System Construction in Vocational Education at Home and Abroad

In this paper, based on the experience and practice of school-enterprise cooperation in developed countries, the current situation ofschool-enterprise cooperation in China was studied. Through analysis and comparison, the mode of school-enterprise cooperationsuitable for higher vocational education in China was explored to promote the development of higher vocational education inChina. The current situation and existing problems of work-study integration in higher vocational education in China wereanalyzed, and different modes of work-study combination in foreign higher vocational education were compared. Under thecurrent situation, earnestly studying and drawing lessons from the experience of foreign developed countries is of greatsignificance to the continuing development of school-enterprise cooperation and the talent training mode of work-studycombination in national model colleges and key universities.

The Coalition Cooperative Game Method and Its Application in Multi-objective Optimization Design

This paper proposes a multi-objective optimization design method based on the coalition cooperative game theory where the three design goals have been seen as three game players. By calculating the affecting factors and fuzzy clustering, the design variables are divided into different strategic spaces which belong to each player, then it constructs a payoff function based on the coalition mechanism. Each game player takes its own revenue function as a target and obtains the best strategy versus other players. The best strategies of all players consist of the strategy permutation of a round game and it obtains the final game solutions through multi-round games according to the convergence criterion. A multi-objective optimization example of the luff mechanism of compensative sheave block shows the effectiveness of the coalition cooperative game method.

Coalition Game Based Full-Duplex Concurrent Scheduling in Millimeter Wave Wireless Backhaul Network

With the development of self-interference(SI) cancelation technology, full-duplex(FD) communication becomes possible. FD communication can theoretically double the spectral efficiency. When the time slot(TS) resources are limited and the number of flows is large, the scheduling mechanism of the flows becomes more important. Therefore, the effectiveness of FD scheduling mechanism for the flows is studied in millimeter wave wireless backhaul network with the limited TS resources. We proposed a full duplex concurrent scheduling algorithm based on coalition game(FDCG) to maximize the number of flows with their QoS requirements satisfied. We transformed the problem of maximizing the number of flows with their QoS requirements satisfied into the problem of maximizing sum rate of concurrently scheduled flows in each slot. We obtained the scheduled flows with maximum sum rate in first slot by using coalition game.And then with certain restrictions, the maximum sum rate of concurrently scheduled flows can also be achieved in subsequent time slots. The simulation results show that the proposed FDCG algorithm canachieve superior performance in terms of the number of flows that meet their QoS requirements and system throughput compared with other three algorithms.

Coalition Emergency Response System, City Security and City Sustainable Development

The relations among the establishment of Coalition Emergency Response System （CERS）, city security and city sustainable development are analyzed in the article. According to the relation analysis, it is concluded that cities should build up their CERS to deal with the thread of damage in China. The recommendations about the establishment of the system are also provided.