Search

With the continuous improvement of the network hardware environment, people turn the demand target to the network application environment and the construction of information resources. How to build a network teaching platform for general undergraduate teaching to ensure the stability of the system and high-quality services during operation especially large-scale concurrent access will inevitably lead to the increase in the business volume of each core part of the network, the number of visits, and data traffic. With the growth of the network, the corresponding processing power and computing intensity also increase rapidly, which causes problems such as overloading of core network equipment, network bottlenecks, and network congestion. Simply pursuing high-performance hardware to solve problems will undoubtedly result in high cost investment; moreover, equipment with excellent performance cannot meet the needs of the current rapidly growing business volume. According to the design goal of the dance online teaching platform, to meet the online teaching load requirements of many people at the same time, the pressure of the web server cluster must be great. Because many people in online at the same time put too much pressure on the web server, this part of the network cannot be processed in time, which leads to the phenomenon that the performance of this part and even the whole network is degraded. In severe cases, it will even cause network communication services to come to a standstill, that is, the so-called deadlock phenomenon. If the protocol software cannot detect congestion and reduce the packet sending rate, the network will be paralyzed due to congestion. This situation will cause the problem of movement delay for online dance teaching, which will seriously affect the quality of teaching. Therefore, the dance online course system should be continuously improved, the quality of online courses should be continuously improved, and the study of the practical application of load balancing technology in the network teaching environment has become an important means to solve the relationship between supply and demand of network teaching. According to the experimental analysis, when the number of Worker' actuators is fixed, the execution time span of MakeSpan increases with the increase of tasks, while the time required by the optimized load balancing algorithm proposed in this paper increases by 1.32 s on average with the increase of tasks, and the time required by heuristic algorithm and bee colony algorithm increases by 3.68 s and 3.45 s on average with the increase of tasks. On the whole, the optimized load balancing algorithm proposed in this paper has obvious advantages. [ABSTRACT FROM AUTHOR]

Aiming at the resource optimization problem in the cooperative detection task, the objective function is constructed based on the channel capacity, and the artificial bee colony (ABC) algorithm is improved to realize the joint optimization of the UAV swarm trajectory and radiation power. Firstly, a multiple input multiple output (MIMO) cooperative detection model is constructed. Then, based on the perspective of information theory, the channel capacity of the cooperative detection model is derived and used as the objective function for optimizing the detection resources of UAV swarm. Then, the factors affecting the objective function are sorted out and analyzed one by one, and the constraints are clarified. Aiming at the shortcomings of ABC algorithm, its search strategy and parameter optimization method are improved. A joint optimization process of UAV swarm trajectory and radiated power based on improved ABC algorithm is constructed. Finally, through simulation verification and algorithm comparison, it shows that the algorithm in this paper can improve the perception ability of cooperative detection of UAV swarm. [ABSTRACT FROM AUTHOR]

The mobile screening of digital movies can fully take into account the viewing experience of scattered areas. As a public cultural service system, it is playing a pivotal role. The consistency of the film screened with the tastes of the audience in the service area of the screening team has largely affected the quality of rural public culture services. Traditional recommendation algorithms directly use raw data to make predictions, leading to deviations in predictions. This article draws on the principles of immune recognition, clone selection, immune mutation, and self-adaptation of the artificial immune system to improve the recommendation effect of single-type data, the recommendation effect of sparse data, and the recommendation effect of project cold start problems and discusses the recommendation based on artificial immunity. For the single type of data, there are only positive samples, which leads to the problem that the training results are all positive. This paper proposes a single-class recommendation algorithm based on artificial immunity. The algorithm uses the positive and negative sample addition method proposed in this paper to add positive and negative samples related to user selection, so as to effectively solve the problem of difficult definition of data negative samples. Then, the artificial immune network is used to cluster the users of various activities, reduce the size of the candidate neighbor set, calculate the user's nearest neighbor set, and give recommendations. [ABSTRACT FROM AUTHOR]

Community structure is an important feature of complex networks. Detecting overlapping communities in complex networks is a hot research topic in data mining and graph theory, aiming at the shortcomings of community detection algorithm based on seed expansion, such as the instability of community detection results caused by randomly selecting seeds, the similarity of selected seeds leading to similar communities after different seed expansion, and the increase of calculation caused by deleting nodes in the process of seed expansion. This paper proposes an overlapping community detection algorithm based on high-quality subgraph extension in local core regions of the network (OLCRE). First, a novel seed community selection method is designed. By analyzing the sum of node degrees of the subgraph formed by a node and its neighbor nodes in the local core region of the network and the tightness of the internal and external connections of the subgraph, a seed community selection function is proposed. According to this function, high-quality subgraphs are selected from all the local core regions of the network as seed communities. Then, taking the definition of community as the guideline, a new community expansion strategy is proposed. Considering the influence of the neighbor node on the inner and outer connection tightness of the seed community comprehensively, it is determined whether the neighbor node can join the seed community. Finally, after the completion of all seed community expansion, overlapping nodes and possible missing nodes should be simplified and redetected to further improve the quality of community detection. The proposed algorithm is tested on the artificial and real-world networks and compared with several overlapping community detection algorithms. The experimental results verify the effectiveness and feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the research on the spectral clustering algorithm is still in the early stage of development. Many existing algorithms are very sensitive to clustering parameters, especially scale parameters, and need to manually input the number of clustering. Therefore, a density-sensitive similarity measure is introduced in this paper, which is obtained by introducing new parameters to transform the Gaussian function. Under this metric, the distance between data points belonging to different classes will be effectively amplified, while the distance between data points belonging to the same class will be reduced, and finally, the distribution of data will be effectively clustered. At the same time, the idea of Eigen gap is introduced into the spectral clustering algorithm, and the verified gap sequence is constructed on the basis of Laplace matrix, so as to solve the problem of the number of initial clustering. The strong global search ability of artificial bee colony algorithm is used to make up for the shortcoming of spectral clustering algorithm that is easy to fall into local optimal. The experimental results show that the adaptive spectral clustering algorithm can better identify the initial clustering center, perform more effective clustering, and detect abnormal behavior more accurately. [ABSTRACT FROM AUTHOR]

For the sensing layer of the Internet of Things, the mobile wireless sensor network has problems such as limited energy of the sensor nodes, unbalanced energy consumption, unreliability, and long transmission delay in the data collection process. It is proved by mathematical derivation and theory that this is a typical multiobjective optimization problem. In this paper, the optimization goal is to minimize the energy consumption and improve the reliability under time-delay constraints and propose a path optimization mechanism to optimize the mobile Sink of mobile wireless sensor networks based on the improved dragonfly optimization algorithm. The algorithm takes full advantage of the abundant storage space, sufficient energy, and strong computing power of the mobile Sink to ensure network connectivity and improve network communication efficiency. Through simulation comparison and analysis, compared with random movement method, artificial bee colony algorithm, and basic dragonfly optimization algorithm, the energy consumption of the network is reduced, the lifespan of the network is increased, and the connectivity and transmission delay of the network are improved. The proposed algorithm balances the energy consumption of the sensors nodes to meet the network service quality and improve the reliability of the network. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth study and analysis of large datasets of mixed and attribute features under Spark using a large dataset clustering algorithm. The classical algorithm K-means based on division and the density-based clustering algorithm DPC, which has become more popular in recent years, are selected as the research objects of this paper. Secondly, the original K-means algorithm is improved by combining holdout validation and K-means++ method to address the shortcomings of the K-means algorithm that the number of class clusters K needs to be set in advance and the initial class cluster centers are chosen randomly, which leads to unstable iterations and slow convergence of clustering results. The similarity matrix will be continuously updated during the iterative process. It mainly refers to the process of dividing objects into multiple classes according to the degree of similarity between objects. After the division, the objects within the class are like each other, while the objects between the classes are different from each other. The comparison experiments of the improved algorithm before and after the MovieLens dataset are conducted to verify that the new algorithm has better performance in terms of clustering accuracy and efficiency. Again, to address the drawback that the clustering results in the DPC algorithm rely heavily on the subjective selection of the truncation distance parameter cd, and it is difficult to handle datasets with complex distribution and large density variation, the algorithm can generate the optimal cd adaptively by combining K-nearest neighbors and introducing the distance comparison quantity, which has a better performance by considering the overall and local distribution of the data. The feasibility of the improved method is verified by validating the algorithm with artificial datasets and UCI datasets as well as separation tests. Finally, the parallelized design and implementation of the improved K-means algorithm and CDPC-KNN algorithm are completed by building a Spark clustering environment, and the parallelized algorithm is verified to have much better data processing capability and be more adaptable to the clustering analysis of large-scale data by comparing algorithm string parallelism experiments. [ABSTRACT FROM AUTHOR]

This paper enlightens the use of artificial intelligence (AI) for distribution of fresh foods by searching more viable route to keep intact the food attributes. In recent years, very hard-hitting competition is for food industries because of the individuals living standards and their responsiveness for fresh food products demand within stipulated time period. Food industry deals with the extensive kind of activities such as food processing, food packaging and distribution, and instrumentation and control. To meet market demand, customer satisfaction, and maintaining its own brand and ranking on global scale, artificial intelligence can play a vibrant role in decision-making by providing analytical solutions with adjusting available resources. Therefore, by integrating innovative technologies for fresh food distribution, potential benefits have been increased, and simultaneously risk associated with the food quality is reduced. Time is a major factor upon which food quality depends; hence, time required to complete the task must be minimized, and it is achieved by reducing the distance travelled; so, path optimization is the key for the overall task. Swarm intelligence (SI) is a subfield of artificial intelligence and consists of many algorithms. SI is a branch of nature-inspired algorithm, having a capability of global search, and gives optimized solution for real-time problems adaptive in nature. An artificial bee colony (ABC) optimization and cuckoo search (CS) algorithm also come into the category of SI algorithm. Researchers have implemented ABC algorithm and CS algorithm to optimize the distribution route for fresh food delivery in time window along with considering other factors: fixed number of delivery vehicles and fixed cost and fuel by covering all service locations. Results show that this research provides an efficient approach, i.e., artificial bee colony algorithm for fresh food distribution in time window without penalty and food quality loss. [ABSTRACT FROM AUTHOR]

Emergency response to hazardous gases in the environment is an important research field in environmental monitoring. In recent years, with the rapid development of sensor technology and mobile device technology, more autonomous search algorithms for hazardous gas emission sources are proposed in uncertain environment, which can avoid emergency personnel from contacting hazardous gas in a short distance. Infotaxis is an autonomous search strategy without a concentration gradient, which uses scattered sensor data to track the location of the release source in turbulent environment. This paper optimizes the imbalance of exploitation and exploration in the reward function of Infotaxis algorithm and proposes a mobile strategy for the three-dimensional scene. In two-dimensional and three-dimensional scenes, the average steps of search tasks are used as the evaluation criteria to analyze the information trend algorithm combined with different reward functions and mobile strategies. The results show that the balance between the exploitation item and exploration item of the reward function proposed in this paper is better than that of the reward function in the Infotaxis algorithm, no matter in the two-dimensional scenes or in the three-dimensional scenes. [ABSTRACT FROM AUTHOR]

It is common that many roads in disaster areas are damaged and obstructed after sudden-onset disasters. The phenomenon often comes with escalated traffic deterioration that raises the time and cost of emergency supply scheduling. Fortunately, repairing road network will shorten the time of in-transit distribution. In this paper, according to the characteristics of emergency supplies distribution, an emergency supply scheduling model based on multiple warehouses and stricken locations is constructed to deal with the failure of part of road networks in the early postdisaster phase. The detailed process is as follows. When part of the road networks fail, we firstly determine whether to repair the damaged road networks, and then a model of reliable emergency supply scheduling based on bi-level programming is proposed. Subsequently, an improved artificial bee colony algorithm is presented to solve the problem mentioned above. Finally, through a case study, the effectiveness and efficiency of the proposed model and algorithm are verified. [ABSTRACT FROM AUTHOR]

The sparrow search algorithm is a new type of swarm intelligence optimization algorithm with better effect, but it still has shortcomings such as easy to fall into local optimality and large randomness. In order to solve these problems, this paper proposes an adaptive spiral flying sparrow search algorithm (ASFSSA), which reduces the probability of getting stuck into local optimum, has stronger optimization ability than other algorithms, and also finds the shortest and more stable path in robot path planning. First, the tent mapping based on random variables is used to initialize the population, which makes the individual position distribution more uniform, enlarges the workspace, and improves the diversity of the population. Then, in the discoverer stage, the adaptive weight strategy is integrated with Levy flight mechanism, and the fusion search method becomes extensive and flexible. Finally, in the follower stage, a variable spiral search strategy is used to make the search scope of the algorithm more detailed and increase the search accuracy. The effectiveness of the improved algorithm ASFSSA is verified by 18 standard test functions. At the same time, ASFSSA is applied to robot path planning. The feasibility and practicability of ASFSSA are verified by comparing the algorithms in the raster map planning routes of two models. [ABSTRACT FROM AUTHOR]

As a novel swarm intelligence algorithm, artificial bee colony (ABC) algorithm inspired by individual division of labor and information exchange during the process of honey collection has advantage of simple structure, less control parameters, and excellent performance characteristics and can be applied to neural network, parameter optimization, and so on. In order to further improve the exploration ability of ABC, an artificial bee colony algorithm with random location updating (RABC) is proposed in this paper, and the modified search equation takes a random location in swarm as a search center, which can expand the search range of new solution. In addition, the chaos is used to initialize the swarm population, and diversity of initial population is improved. Then, the tournament selection strategy is adopted to maintain the population diversity in the evolutionary process. Through the simulation experiment on a suite of unconstrained benchmark functions, the results show that the proposed algorithm not only has stronger exploration ability but also has better effect on convergence speed and optimization precision, and it can keep good robustness and validity with the increase of dimension. [ABSTRACT FROM AUTHOR]

The selection of positions for unified power flow controller (UPFC) placement in transmission network is an essential factor, which aids in operating the system in a more reliable and secured manner. This paper focuses on strengthening the power system performance through UPFC placement employing self-adaptive firefly algorithm (SAFA), which selects the best positions along with parameters for UPFC placement. Three single objectives of real power loss reduction, voltage profile improvement, and voltage stability enhancement are considered in this work. IEEE 14, 30, and 57 test systems are selected to accomplish the simulations and to reveal the efficacy of the proposed SAFA approach; besides, solutions are compared with two other algorithms solutions of honey bee algorithm (HBA) and bacterial foraging algorithm (BFA). The proposed SAFA contributes real power loss reduction, voltage profile improvement, and voltage stability enhancement by optimally choosing the placement for UPFC. [ABSTRACT FROM AUTHOR]

The Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a swarm-based collaborative optimization algorithm, which has drawn attention from researchers due to its simple structure, easy implementation, and powerful performance. However, it needs to be improved regarding the exploration, especially in the late stage of evolution, and the problem of easy falling into a local optimal solution. This paper proposes an improved algorithm named Quasi-Affine Transformation Evolutionary with double excellent guidance (QUATRE-DEG). The algorithm uses not only the global optimal solution but also the global suboptimal solution to guide the individual evolution. We establish a model to determine the guiding force by the distance between the global optimal position and the suboptimal position and propose a new mutation strategy through the double population structure. The optimization of population structure and the improvement of operation mechanisms bring more exploration for the algorithm. To optimize the algorithm, the experiments on parameter settings were made to determine the size of the subpopulation and to achieve a balance between exploration and development. The performance of QUATRE-DEG algorithm is evaluated under CEC2013 and CEC2014 test suites. Through comparison and analysis with some ABC variants known for their strong exploration ability and advanced QUATRE variants, the competitiveness of the proposed QUATRE-DEG algorithm is validated. [ABSTRACT FROM AUTHOR]

Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms (EAs) were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- (SI-) based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization (PSO), firefly algorithm, ant colony optimization (ACO), and bat algorithm (BA) have gained much popularity and they have successfully tackled various test suites of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm (MSIA) is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. [ABSTRACT FROM AUTHOR]

Clustering algorithm is one of the important research topics in the field of machine learning. Neutrosophic clustering is the generalization of fuzzy clustering and has been applied to many fields. This paper presents a new neutrosophic clustering algorithm with the help of regularization. Firstly, the regularization term is introduced into the FC-PFS algorithm to generate sparsity, which can reduce the complexity of the algorithm on large data sets. Secondly, we propose a method to simplify the process of determining regularization parameters. Finally, experiments show that the clustering results of this algorithm on artificial data sets and real data sets are mostly better than other clustering algorithms. Our clustering algorithm is effective in most cases. [ABSTRACT FROM AUTHOR]

In view of the miniaturization and decentralization characteristics of agricultural equipment factories in China, agricultural equipment manufacturing is well suited to the cloud manufacturing model, but there is no specific research on cloud services optimization for it. To fill the research gap, a cloud service optimization method is proposed in this paper. For the optimization model, the dynamic coefficient strategy and the reliability feedback update strategy are added to the mathematical model to strengthen the applicability of farming season. As optimization algorithm, a dynamic artificial ant-bee colony algorithm (DAABA) based on artificial ant colony algorithm and bee colony algorithm is presented. The optimal fusion evaluation strategy is used to save optimization time by reducing the useless iteration, and the iterative adjustment threshold strategy is adopted to improve the accuracy of cloud service by increasing the size of bee colony. Finally, the performance of DAABA is verified to be more superior by comparing with other algorithms. [ABSTRACT FROM AUTHOR]

Economic dispatch (ED) aims to allocate the generation of units to minimize the total production cost. This dispatch is generally formulated with nonsmooth and nonconvex cost function due to valve-point effects and various constraints, where the conventional methods are inapplicable. An improved social spider optimization algorithm, namely, ISSO, is proposed in this paper to solve the ED problem with valve-point effects. That is, dynamic updating mechanism of the subpopulations, Gaussian mating radius, and multimating strategy are introduced into the ISSO. These mechanisms facilitate a compromise between the global exploration and local exploitation of the search process. Numerical experiments are conducted on benchmark functions and different scale generation units commonly considered in the literature to validate the feasibility of the proposed ISSO. Computational results are analyzed in terms of solution quality by the statistical method, which shows the superiority of the ISSO algorithm in comparison with the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

To obtain the optimal uniform prestress of a tensegrity structure with geometric configuration given, a novel method is developed for prestress design of tensegrity structures by utilizing the artificial fish swarm algorithm (AFSA). In the beginning, the form-finding process is implemented by solving a linear homogeneous system concerning the self-equilibrium system. The issue is subsequently performed as a minimum problem by regulating the value of an objective function where the unilateral condition and the stress uniformity condition are entirely considered. The AFSA is adopted to search for the global minimum, leading to a set of initial prestresses that guarantee all the above conditions. Two illustrative examples have been fully studied to prove the accuracy and efficiency of the presented approach in prestress design of tensegrities according to the practical requirements. Furthermore, the numerical examples investigated in this paper confirm that the AFSA has explicit advantages of rapid convergence and overcoming the local minima. [ABSTRACT FROM AUTHOR]

Parameter optimization of a hydrological model is intrinsically a high dimensional, nonlinear, multivariable, combinatorial optimization problem which involves a set of different objectives. Currently, the assessment of optimization results for the hydrological model is usually made through calculations and comparisons of objective function values of simulated and observed variables. Thus, the proper selection of objective functions' combination for model parameter optimization has an important impact on the hydrological forecasting. There exist various objective functions, and how to analyze and evaluate the objective function combinations for selecting the optimal parameters has not been studied in depth. Therefore, to select the proper objective function combination which can balance the trade-off among various design objectives and achieve the overall best benefit, a simple and convenient framework for the comparison of the influence of different objective function combinations on the optimization results is urgently needed. In this paper, various objective functions related to parameters optimization of hydrological models were collected from the literature and constructed to nine combinations. Then, a selection and evaluation framework of objective functions is proposed for hydrological model parameter optimization, in which a multiobjective artificial bee colony algorithm named RMOABC is employed to optimize the hydrological model and obtain the Pareto optimal solutions. The parameter optimization problem of the Xinanjiang hydrological model was taken as the application case for long-term runoff prediction in the Heihe River basin. Finally, the technique for order preference by similarity to ideal solution (TOPSIS) based on the entropy theory is adapted to sort the Pareto optimal solutions to compare these combinations of objective functions and obtain the comprehensive optimal objective functions' combination. The experiments results demonstrate that the combination 2 of objective functions can provide more comprehensive and reliable dominant options (i.e., parameter sets) for practical hydrological forecasting in the study area. The entropy-based method has been proved that it is effective to analyze and evaluate the performance of different combinations of objective functions and can provide more comprehensive and impersonal decision support for hydrological forecasting. [ABSTRACT FROM AUTHOR]

A fuzzy cloud resource scheduling model with time-cost constraints is built using fuzzy triangular numbers to represent uncertain task execution time. Task scheduling reduces total time and cost spent on a project. It connects virtual machines and functions. Particle swarm optimization (HPO) is used to plan cloud resources (HSOA). The approach uses orthogonal particle swarm initialization to increase the quality of the initial particle exploration, rerandomization to regulate the particle search range, and real-time updating of inertia weights to control particle speed. The suggested problem model and optimization approach are evaluated using random simulation data provided by the CloudSim simulation platform. Less overall execution time and a lower cost are shown to have fast convergence and solution capabilities in experiments. [ABSTRACT FROM AUTHOR]

With the rapid economic development and urbanization process accelerating, motor vehicle ownership in large cities is increasing year by year; urban traffic congestion, parking difficulties, and other problems are becoming increasingly serious; in ordinary daily life, continuous risk of disturbance, having a flexible transportation system network is more able to alleviate daily congestion in the city, and the main thing about flexible transportation network is its algorithm. It is worth noting that congestion in many cities is generally reflected in the main roads, while many secondary roads and branch roads are underutilized, and the limited road resources in cities are not fully utilized. As an economic and effective road traffic management measure, one-way traffic can balance the spatial and temporal distribution of traffic pressure within the road network, make full use of the existing urban road network capacity, and solve the traffic congestion problem. Therefore, it is of great theoretical and practical significance to develop a reasonable and scientific one-way traffic scheme according to the characteristics of traffic operation in different regions. Based on the fixed demand model, the influence of traffic demand changes is further considered, the lower-level model is designed as an elastic demand traffic distribution model, the excess demand method is used to transform the elastic demand problem into an equivalent fixed demand problem based on the extended network, and the artificial bee colony algorithm based on risk perturbation is designed to solve the two-level planning model. The case study gives a one-way traffic organization optimization scheme that integrates three factors, namely, the average load degree overload limit of arterial roads, the detour coefficient, and the number of on-street parking spaces on feeder roads, and performs sensitivity analysis on the demand scaling factor. [ABSTRACT FROM AUTHOR]

Real-time data stream mining algorithms are largely based on binary datasets and do not handle continuous quantitative data streams, especially in medical data mining field. Therefore, this paper proposes a new weighted sliding window fuzzy frequent pattern mining algorithm based on interval type-2 fuzzy set theory over data stream (WSWFFP-T2) with a single scan based on the artificial datasets of medical data stream. The weighted fuzzy frequent pattern tree based on type-2 fuzzy set theory (WFFPT2-tree) and fuzzy-list sorted structure (FLSS) is designed to mine the fuzzy frequent patterns (FFPs) over the medical data stream. The experiments show that the proposed WSWFFP-T2 algorithm is optimal for mining the quantitative data stream and not limited to the fragile databases; the performance is reliable and stable under the condition of the weighted sliding window. Moreover, the proposed algorithm has high performance in mining the FFPs compared with the existing algorithms under the condition of recall and precision rates. [ABSTRACT FROM AUTHOR]

As one of the key technologies in the fifth generation of mobile communications, massive multi-input multioutput (MIMO) can improve system throughput and transmission reliability. However, if all antennas are used to transmit data, the same number of radiofrequency chains is required, which not only increases the cost of system but also reduces the energy efficiency (EE). To solve these problems, in this paper, we propose an EE optimization based on the particle swarm optimization (PSO) algorithm. First, we consider the base station (BS) antennas and terminal users and analyze their impact on EE in the uplink and downlink of a single-cell multiuser massive MIMO system. Second, a dynamic power consumption model is used under zero-forcing processing, and it obtains the expression of EE that is used as the fitness function of the PSO algorithm under perfect and imperfect channel state information (CSI) in single-cell scenarios and imperfect CSI in multicell scenarios. Finally, the optimal EE value is obtained by updating the global optimal positions of the particles. The simulation results show that compared with the traditional iterative algorithm and artificial bee colony algorithm, the proposed algorithm not only possesses the lowest complexity but also obtains the highest optimal value of EE under the single-cell perfect CSI scenario. In the single-cell and multicell scenarios with imperfect CSI, the proposed algorithm is capable of obtaining the same or slightly lower optimal EE value than that of the traditional iterative algorithm, but the running time is at most only 1/12 of that imposed by the iterative algorithm. [ABSTRACT FROM AUTHOR]

Cloud computing provides multiple services such as computational services, data processing, and resource sharing through multiple nodes. These nodes collaborate for all prementioned services in the data center through the head/leader node. This head node is responsible for reliability, higher performance, latency, and deadlock handling and enables the user to access cost-effective computational services. However, the optimal head nodes' selection is a challenging problem due to consideration of resources such as memory, CPU-MIPS, and bandwidth. The existing methods are monolithic, as they select the head nodes without taking the resources of the nodes. Still, there is a need for the candidate node which can be selected as a head node in case of head node failure. Therefore, in this paper, we proposed a technique, i.e., Head Node Selection Algorithm (HNSA), for optimal head node selection from the data center, which is based on the genetic algorithm (GA). In our proposed method, there are three modules, i.e., initial population generation, head node selection, and candidate node selection. In the first module, we generate the initial population by randomly mapping the task on different servers using a scheduling algorithm. After that, we compute the overall cost and the cost of each node based on resources. In the second module, the best optimal nodes are selected as a head node by applying the genetic operations such as crossover, mutation, and fitness function by considering the available resources. In the selected optimal nodes, one node is chosen as a head node and the other is considered as a candidate node. In the third module, the candidate node becomes the head node in the case of head node failure. The proposed method HNSA is compared against the state-of-the-art algorithms such as Bees Life Algorithm (BLA) and Heterogeneous Earliest Finished Time (HEFT). The simulation analysis shows that the proposed HNSA technique performs better in terms of execution time, memory utilization, service level sgreement (SLA) violation, and energy consumption. [ABSTRACT FROM AUTHOR]

Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA), on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others. [ABSTRACT FROM AUTHOR]

The direction-based label propagation clustering (DBC) algorithm needs to set the number of neighbors (k) and the angle value (degree), which are highly sensitive. Moreover, DBC algorithm is not suitable for datasets with uneven neighbor density distribution. To overcome above problems, we propose an improved DBC algorithm based on adaptive angle and label redistribution (ALR-DBC). The ALR-DBC algorithm no longer input parameter degree, but dynamically adjusts the deviation angle through the concept of high-low density region to determine the receiving range. This flexible receiving range is no longer affected by the uneven distribution of neighbor density. Finally, those points that do not meet the expectations of the main direction are redistributed. Experiments show that the ALR-DBC algorithm performs better than DBC algorithm in most artificial datasets and real datasets. It is also superior to the classical algorithms listed. It also has good experimental results when applied to wireless sensor data annotation. [ABSTRACT FROM AUTHOR]

Aiming at the multiconstraint complex problem of path planning, a hybrid algorithm with fast convergence and fast obstacle avoidance is proposed. According to the actual aircraft, a multiconstrained path cost model with seven components is constructed and defined the parameters and penalty factors of each part. To improve the sensitivity of each part of the trace planning cost function, according to the inconsistency of the cost index unit and measurement range, the expert scoring method is used to configure and normalize the index with weight. Make full advantage of the ACO algorithm and the artificial potential field algorithm to form the ACA hybrid algorithm, a pheromone heuristic function improvement method is proposed, and a control factor is introduced. The proposed model and planning algorithm are simulated based on the MATLAB platform environment, and it is shown by simulations that the hybrid algorithm has obvious advantages in terms of motion trajectory smoothness, number of iterations, and minimum path cost.It well solved the practical application problem of fast path planning convergence and fast avoiding obstacles in the complex environment. [ABSTRACT FROM AUTHOR]

To study the archery culture based on the particle swarm algorithm, the dissemination mode of external intelligence is differentiated. Firstly, the algorithm based on a particle swarm is introduced, and the external intelligence dissemination mode is distributed. Then, taking the spread of archery as the research object, mainly using questionnaires and other methods, from the perspectives of intelligent differentiation, organizational communication, and mass communication, we investigated and analyzed the dissemination activities of archery. Finally, the relevant countermeasures to promote the spread and development of archery are summarized and put forward. The experimental results show the following: the process of interpersonal communication of archery has the characteristics of many channels of information transmission, flexible methods, and strong interaction; the leadership of elite archers and the interpersonal communication of archery played a good role in promoting. Dissemination of external intelligence and mass dissemination, in the process of human-to-human communication of archery, have the same significance. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low shortest path selection accuracy, longer response time, and poor selection effect in current cold chain logistics transportation methods, a cold chain logistics transportation shortest path selection algorithm based on improved artificial bee colony is proposed. The improved algorithm is used to initialize the food source, reevaluate the fitness value of the food source, generate a new food source, optimize the objective function and food source evaluation strategy, and get an improved artificial bee colony algorithm. Based on the improved artificial bee colony algorithm, the group adaptive mechanism of particle swarm algorithm is introduced to initialize the position and velocity of each particle randomly. Dynamic detection factor and octree algorithm are adopted to dynamically update the path of modeling environment information. According to the information sharing mechanism between individual particles, the group adaptive behavior control is performed. After the maximum number of cycles, the path planning is completed, the shortest path is output, and the shortest path selection of cold chain logistics transportation is realized. The experimental results show that the shortest path selection effect of the cold chain logistics transportation of the proposed algorithm is better, which can effectively improve the shortest path selection accuracy and reduce the shortest path selection time. [ABSTRACT FROM AUTHOR]

Considering the competition between rescue points, we use artificial intelligence (AI) driven Internet of Thing (IoT) and regional material storage data to propose a multiobjective scheduling algorithm of flood control materials based on Pareto artificial bee colony (MSA_PABC). To address the scheduling of flood control materials, the multiple types of flood control materials, the multiple disaster sites, and entertain both emergency and fairness of rescue need to be considered comprehensively. The MSA_PABC has the constraints such as storage quantity constraint of warehouse materials, material demand constraint, and maximum transportation distance of flood control materials. We establish the scheduling optimization model of flood control materials for each disaster rescue point and the total scheduling optimization model for all flood control materials. Then, MSA_PABC uses the modified Pareto artificial bee colony algorithm to solve the multiobjective models. Three types of initialization strategies are proposed to calculate the fitness of each rescue point and the overall evaluation value of the food source. We propose the employ bee operations such as niche technology and local search of the variable neighborhood, the onlooker bee operations such as Pareto nondominated sorting and crossover operation, the scout bee operations such as maximum evolutionary threshold, and end elimination mechanism. Finally, our proposed solution obtains the nondominated solution set and its optimal solution. The experimental results show that no matter how the number of rescue points changes, MSA_PABC can find the nondominated solution set and optimal solution quickly. It improves the convergence rate of MSA_PABC and material satisfaction rate. Our solution also reduces the average maximum transportation distance, the standard deviation of maximum transportation distance, and the standard deviation of material satisfaction rate. The evaluation also demonstrates MSA_PABC outperforms the state-of-arts such as ABC (artificial bee colony), NSGA2 (nondominated sorting genetic algorithm 2), and MOPSO (multiobjective particle swarm optimization). [ABSTRACT FROM AUTHOR]

In order to improve reliability and fatigue life of cylinder gaskets in heavy duty diesel engine, several methods and algorithms are applied to optimize operating factors of gaskets. Finite element method is utilized to figure out and analyze the temperature fields, thermal-mechanical coupling stress fields, and deformations of gasket. After determining the maximum values of three state parameters, the orthogonal experimental design method is adopted to analyze the influence rules of five operating factors on three state parameters of the gaskets and four factors which most significantly affect these state parameters are determined. Then, the method which uses operating factors to predict state parameters is established on the application of hybrid neuron network based on partial least squares regression and deep neural network. The comparison results between the predicted values and real values verified the accuracy of the hybrid neuron network method. Based on artificial bee colony algorithm, improvement is attached to the way three kinds of grey wolves locate preys in grey wolf algorithm and the way how using different hierarchy wolfs in grey wolf algorithm to determine three weight coefficients and the location of prey is put forward with. The method using artificial bee colony algorithm to optimize the grey wolf algorithm is called ABC and GWO. The proposed HNN and the ABC and GWO method are applied to work out operating factors values which correspond to optimal state parameters of gasket, and the gaskets are optimized according to the optimal values. It has been demonstrated by finite element analysis results that maximum temperature, maximum coupling stress, and the maximum deformation decrease to 6 K, 12.57 MPa, and 0.0925 mm compared to the original values, respectively, which proves the accuracy of the algorithm and the validity of the improvement. [ABSTRACT FROM AUTHOR]

Viscoelastic artificial boundary elements are one of the most commonly used artificial boundaries when solving dynamic soil-structure interactions or near-field wave propagation problems. However, due to the lack of clear and practical stability criteria for the explicit algorithm that considers the influence of viscoelastic artificial boundary elements, the determination of the stable time increment in such numerical analyses is still a challenge. In this study, we proposed a numerical stability analysis method for the explicit algorithm with a 3D viscoelastic artificial boundary element based on the idea of a subsystem. Through this method, the artificial boundary subsystem that controls the stability of the overall numerical system is determined, and the analytical solution for the stability condition of the explicit integration algorithm with 3D viscoelastic artificial boundary elements is obtained. On this basis, the maximum time increment for solving dynamic problems with viscoelastic artificial boundary elements can be determined. [ABSTRACT FROM AUTHOR]

Node localization is a fundamental issue in wireless sensor network (WSN), as many applications depend on the precise location of the sensor nodes (SNs). Among all localization algorithms, DV_Hop is a typical range-free localization algorithm characterized by such advantages as simple realization and low energy cost. From detailed analysis of localization error for the basic DV_Hop algorithm, we propose a connectivity weighting DV_Hop localization algorithm using modified artificial bee colony optimization. Firstly, the proposed algorithm calculates the average hop distance (AHD) of anchor nodes in terms of the minimum mean squared distance error between the estimated distances of anchor nodes and the corresponding actual distances from them. After that, a connectivity weighting method, considering the influence from both local network properties of anchor nodes and the distances from anchor nodes to unknown nodes, is designed to obtain the AHD of unknown nodes. In addition, we set up the weighting calculation proportion of anchor nodes at the same time. Finally, a modified artificial bee colony algorithm which enlarges searching space is used to optimize the execution of multilateral localization. The experimental results demonstrate that the connectivity weighting approach has better localization effect, and the AHD of unknown nodes close to true value can be obtained at a relatively large probability. Moreover, the modified artificial bee colony algorithm can reduce the probability of premature convergence, and thus the localization accuracy is further improved. [ABSTRACT FROM AUTHOR]