Search

In the mobile crowdsensing task assignment, under the premise that the data platform does not know the user's perceived quality or cost value, how to establish a suitable user recruitment mechanism is the critical issue that this article needs to solve. It is necessary to learn the user's perceived quality in the execution p. It also needs to try its best to ensure the efficiency and profit maximization of the mobile group intelligence perception platform. Therefore, this paper proposes a mobile crowdsensing user recruitment algorithm based on Combinatorial Multiarmed Bandit (CMAB) to solve the recruitment problem with known and unknown user costs. Firstly, the user recruitment process is modeled as a combined multiarm bandit model. Each rocker arm represents the selection of different users, and the income obtained represents the user's perceived quality. Secondly, it proposes the upper confidence bound (UCB) algorithm, which updates the user's perceptual quality according to the completion of the task. This algorithm sorts the users' perceived quality values from high to low, then selects the most significant ratio of perceived quality to recruitment costs under the budget condition, assigns tasks, and updates their perceived quality. Finally, this paper introduces the regret value to measure the efficiency of the user recruitment algorithm and conducts many experimental simulations based on real data sets to verify the feasibility and effectiveness of the algorithm. The experimental results show that the recruitment algorithm with known user cost is close to the optimal algorithm, and the recruitment algorithm with unknown user cost is more than 75% of the optimal algorithm result, and the gap tends to decrease as the budget cost increases, compared with other comparisons. The algorithm is 25% higher, which proves that the proposed algorithm has good learning ability and can independently select high-quality users to realize task assignments. [ABSTRACT FROM AUTHOR]

The biggest view of the whole world on science and technology and sports is that science and technology and sports both represent national strength. At present, the integration of sports and science and technology has not reached a certain height, especially in the prediction of sports behavior and injury assessment, and the investment in science and technology is still lacking. This leads to a high number of injuries caused by sports every year. However, swarm intelligence algorithm has made few breakthrough achievements in the past few years, and the combination of sports behavior and swarm intelligence algorithm can just solve this problem. It is very important to choose the algorithm for predicting and assessing sports behavior. We should choose an efficient algorithm with high stability, high convergence speed, and optimization ability. In this paper, the IPSGWO algorithm is proposed to realize this application. IPSGWO algorithm is based on the GWO algorithm, with appropriate strategies and ideas, to maximize the improvement. In this paper, the convergence curve of PSO, GWO, and IPSGWO is tested to determine whether the IPSGWO algorithm has more stable and higher performance, and the simulation experiment is used to determine whether the IPSGWO algorithm is suitable for prediction and injury assessment compared with the other two. From the experimental results, the IPSGWO algorithm does have higher performance; because of this, it is more accurate for prediction and injury assessment. [ABSTRACT FROM AUTHOR]

Cost management is an important part of enterprise management and is fundamental to the survival and development of enterprises. Cost management is of great significance to promote production and cost-saving, strengthen cost accounting, improve management, and enhance the overall management level of enterprises. In this paper, different factors affecting mapping are combined with a group intelligence algorithm to study virtual network mapping, which dissects enterprise cost management in a new perspective and analyzes the relationship between enterprises in each supply chain and the association between the processes of each link in the supply chain. The algorithm uses node CPU, node degree, and neighboring bandwidth resources as advisors' strategies, respectively, and customers consult multiple advisors in the process of constructing mapping solutions, and the advisors give suggestions to customers according to their strategies. CGS-VNE uses an advisor-guided search mechanism to ensure the diversity of mapping solutions, which can fully explore the solution space and derive high-quality enterprise costing solutions through iteration. Whether in evaluating enterprise cost control or enhancing enterprise cost control capability, the value chain theory can be practically applied to clarify the current situation of enterprise cost control under the premise of combining theory and practice and truly achieve the fundamental purpose of helping enterprises to fully implement cost control. [ABSTRACT FROM AUTHOR]

In the past few decades, metaheuristic algorithms (MA) have been developed tremendously and have been successfully applied in many fields. In recent years, a large number of new MA have been proposed. Slime mould algorithm (SMA) is a novel swarm-based intelligence optimization algorithm. SMA solves the optimization problem by imitating the foraging and movement behavior of slime mould. It can effectively obtain a promising global optimal solution. However, it still suffers some shortcomings such as the unstable convergence speed, the imprecise search accuracy, and incapability of identifying a local optimal solution when faced with complicated optimization problems. With the purpose of overcoming the shortcomings of SMA, this paper proposed a multistrategy enhanced version of SMA called ESMA. The three enhanced strategies are chaotic initialization strategy (CIS), orthogonal learning strategy (OLS), and boundary reset strategy (BRS). The CIS is used to generate an initial population with diversity in the early stage of ESMA, which can increase the convergence speed of the algorithm and the quality of the final solution. Then, the OLS is used to discover the useful information of the best solutions and offer a potential search direction, which enhances the local search ability and raises the convergence rate. Finally, the BRS is used to correct individual positions, which ensures the population diversity and enhances the overall search capabilities of ESMA. The performance of ESMA was validated on the 30 IEEE CEC2014 functions and three IIR model identification problems, compared with other nine well-regarded and state-of-the-art algorithms. Simulation results and analysis prove that the ESMA has a superior performance. The three strategies involved in ESMA have significantly improved the performance of the basic SMA. [ABSTRACT FROM AUTHOR]