Search

Cyber Defense is becoming a major issue for every organization to keep business continuity intact. The presented paper explores the effectiveness of a meta-heuristic optimization algorithm-Artificial Bees Colony Algorithm (ABC) as an Nature Inspired Cyber Security mechanism to achieve adaptive defense. It experiments on the Denial- Of-Service attack scenarios which involves limiting the traffic flow for each node. Businesses today have adapted their service distribution models to include the use of the Internet, allowing them to effectively manage and interact with their customer data. This shift has created an increased reliance on online services to store vast amounts of confidential customer data, meaning any disruption or outage of these services could be disastrous for the business, leaving them without the knowledge to serve their customers. Adversaries can exploit such an event to gain unauthorized access to the confidential data of the customers. The proposed algorithm utilizes an Adaptive Defense approach to continuously select nodes that could present characteristics of a probable malicious entity. For any changes in network parameters, the cluster of nodes is selected in the prepared solution set as a probable malicious node and the traffic rate with the ratio of packet delivery is managed with respect to the properties of normal nodes to deliver a disaster recovery plan for potential businesses. [ABSTRACT FROM AUTHOR]

The split delivery vehicle routing problem (SDVRP) is a classic combinatorial optimization problem, which is usually solved using a heuristic algorithm. The ant colony optimization algorithm is an excellent heuristic algorithm that has been successfully applied to solve various practical problems, and it has achieved good results. However, in the existing ant colony optimization algorithms, there are issues with weak targeting of different customer selection strategies, difficulty in balancing convergence speed and global search ability, and a predisposition to become trapped in local optima. To solve these problems, this paper proposes an improved ant colony algorithm (IACA). First, in terms of customer point selection, the initial customer and noninitial customer selection strategies are proposed for different customers, and the adaptive selection threshold is designed. Second, in terms of pheromone processing, an initial pheromone distribution method based on a greedy strategy, a pheromone backtracking mechanism, and an adaptive pheromone volatile factor are proposed. Finally, based on the 2-opt local search method, vehicle path self-search and intervehicle path search are proposed to further improve the quality of the solution. This paper tests the performance of the IACA on datasets of different scales. The experimental results show that compared with the clustering algorithm, artificial bee colony algorithm, particle swarm optimization algorithm, traditional ant colony algorithm, and other algorithms, the IACA can achieve more competitive results. Specifically, compared to the path length calculated by other algorithms, the path length calculated by IACA decreased by an average of 1.58%, 4.28%, and 3.64% in small, medium, and large-scale tests, respectively. [ABSTRACT FROM AUTHOR]

INTRODUCTION: The article discusses the key steps in digital visual design reengineering, with a special emphasis on the importance of information decoding and feature extraction for flat cultural heritage. These processes not only minimize damage to the aesthetic heritage itself but also feature high quality, efficiency, and recyclability. OBJECTIVES: The aim of the article is to explore the issues of gene extraction methods in digital visual design reengineering, proposing a visual gene extraction method through an improved K-means clustering algorithm. METHODS: A visual gene extraction method based on an improved K-means clustering algorithm is proposed. Initially analyzing the digital visual design reengineering process, combined with a color extraction method using the improved JSO algorithm-based K-means clustering algorithm, a gene extraction and clustering method for digital visual design reengineering is proposed and validated through experiments. .ASA-RESULT: The results show that the proposed method improves the accuracy, robustness, and real-time performance of clustering. Through comparative analysis with Dunhuang murals, the effectiveness of the color extraction method based on the K-means-JSO algorithm in the application of digital visual design reengineering is verified. The method based on the K-means-GWO algorithm performs best in terms of average clustering time and standard deviation. The optimization curve of color extraction based on the K-means-JSO algorithm converges faster and with better accuracy compared to the K-means-ABC, K-means-GWO, K-means-DE, K-means-CMAES, and K-means-WWCD algorithms. CONCLUSION: The color extraction method of the K-means clustering algorithm improved by the JSO algorithm proposed in this paper solves the problems of insufficient standardization in feature selection, lack of generalization ability, and inefficiency in visual gene extraction methods. [ABSTRACT FROM AUTHOR]

As the terminal of the power system, the distribution network is the main area where failures occur. In addition, with the integration of distributed generation, the traditional distribution network becomes more complex, rendering the conventional fault location algorithms based on a single power supply obsolete. Therefore, it is necessary to seek a new algorithm to locate the fault of the distributed power distribution network. In existing fault localization algorithms for distribution networks, since there are only two states of line faults, which can usually be represented by 0 and 1, most algorithms use discrete algorithms with this characteristic for iterative optimization. Therefore, this paper combines the advantages of the particle swarm algorithm and genetic algorithm and uses continuous real numbers for iteration to construct a successive particle swarm genetic algorithm (SPSO-GA) different from previous algorithms. The accuracy, speed, and fault tolerance of SPSO-GA, discrete particle swarm Genetic algorithm, and artificial fish swarm algorithm are compared in an IEEE33-node distribution network with the distributed power supply. The simulation results show that the SPSO-GA algorithm has high optimization accuracy and stability for single, double, or triple faults. Furthermore, SPSO-GA has a rapid convergence velocity, requires fewer particles, and can locate the fault segment accurately for the distribution network containing distorted information. [ABSTRACT FROM AUTHOR]

One of the limitations of the dung beetle optimization (DBO) is its susceptibility to local optima and its relatively low search accuracy. Several strategies have been utilized to improve the diversity, search precision, and outcomes of the DBO. However, the equilibrium between exploration and exploitation has not been achieved optimally. This paper presents a novel algorithm called the ODBO, which incorporates cat map and an opposition-based learning strategy, which is based on symmetry theory. In addition, in order to enhance the performance of the dung ball rolling phase, this paper combines the global search strategy of the osprey optimization algorithm with the position update strategy of the DBO. Additionally, we enhance the population's diversity during the foraging phase of the DBO by incorporating vertical and horizontal crossover of individuals. This introduction of asymmetry in the crossover operation increases the exploration capability of the algorithm, allowing it to effectively escape local optima and facilitate global search. [ABSTRACT FROM AUTHOR]

This review paper provides a structured analysis of obstacle avoidance and route planning algorithms for unmanned surface vehicles (USVs) spanning both numerical simulations and real-world applications. Our investigation encompasses the development of USV route planning from the year 2000 to date, classifying it into two main categories: global and local route planning. We emphasize the necessity for future research to embrace a dual approach incorporating both simulation-based assessments and real-world field tests to comprehensively evaluate algorithmic performance across diverse scenarios. Such evaluation systems offer valuable insights into the reliability, endurance, and adaptability of these methodologies, ultimately guiding the development of algorithms tailored to specific applications and evolving demands. Furthermore, we identify the challenges to determining optimal collision avoidance methods and recognize the effectiveness of hybrid techniques in various contexts. Remarkably, artificial potential field, reinforcement learning, and fuzzy logic algorithms emerge as standout contenders for real-world applications as consistently evaluated in simulated environments. The innovation of this paper lies in its comprehensive analysis and critical evaluation of USV route planning algorithms validated in real-world scenarios. By examining algorithms across different time periods, the paper provides valuable insights into the evolution, trends, strengths, and weaknesses of USV route planning technologies. Readers will benefit from a deep understanding of the advancements made in USV route planning. This analysis serves as a road map for researchers and practitioners by furnishing insights to advance USV route planning and collision avoidance techniques. [ABSTRACT FROM AUTHOR]

As a new abstract computational model in evolutionary transfer optimization (ETO), single-objective to multi-objective optimization (SMO) is conducted at the macroscopic level rather than the intermediate level for specific algorithms or the microscopic level for specific operators; this method aims to develop systems with a profound grasp of evolutionary dynamic and learning mechanism similar to human intelligence via a "decomposition" style (in the abstract of the well-known "Transformer" article "Attention is All You Need", they use "attention" instead). To the best of our knowledge, it is the first work of SMO for discrete cases because we extend our conference paper and inherit its originality status. In this paper, by implementing the abstract SMO in specialized memetic algorithms, key knowledge from single-objective problems/tasks to the multi-objective core problem/task can be transferred or "gathered" for permutation flow shop scheduling problems, which will reduce the notorious complexity in combinatorial spaces for multi-objective settings in a straight method; this is because single-objective tasks are easier to complete than their multi-objective versions. Extensive experimental studies and theoretical results on benchmarks (1) emphasize our decomposition root in mathematical programming, such as Lagrangian relaxation and column generation; (2) provide two "where to go" strategies for both SMO and ETO; and (3) contribute to the mission of building safe and beneficial artificial general intelligence for manufacturing via evolutionary computation. [ABSTRACT FROM AUTHOR]

In this era of intelligence, the learning methods of learners have substantially changed. Many learners choose to learn through online education platforms. Although learners may enjoy more high-quality educational resources, when they are faced with an abundance of resource information, they are prone to become lost in knowledge, among other problems. To solve this problem, a multi-algorithm collaborative, personalized, learning path recommendation model is proposed to provide learning guidance for learners of online learning platforms. First, the learner model is constructed from four perspectives: cognitive level, learning ability, learning style, and learning intensity. Second, the association rule algorithm is employed to generate a sequence of knowledge points and to plan the learning sequence of knowledge points for learners. Last, the swarm intelligence algorithm is utilized to ensure that each knowledge point is matched with personalized learning resources with a higher degree of adaptability so that learners can learn using a more targeted approach. The experimental results show that the research results of this paper can, to a certain extent, recommend ideal learning paths to target users, effectively improve the accuracy of recommended resources, and thus improve the learning quality and learning effect of users. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Natural Fibers is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The Chinese nation has accumulated a lot of precious, rich, and wonderful material and intangible culture in its historical evolution, but these cultures are facing the problem of inheritance difficulties in the long term, and it is becoming more and more difficult to innovate. In order to solve these problems, this paper puts forward the innovative development of the intangible culture of arts and crafts based on artificial intelligence decision support system, with the purpose of studying cultural inheritance, regional brand hematopoiesis promotion, and organizational goal's support for intangible culture. The method of this paper is to study the basic principles of artificial bee colony algorithms and decision support systems, and then evaluate the value of intangible culture. The purpose of this paper is to analyze the development of local intangible culture and innovation models based on local knowledge systems and confirm the influence of technological innovation on intangible culture so as to promote the sustainable development of intangible culture. This paper describes the present situation of intangible cultural innovation and then explores the innovative ways of intangible culture based on the experiment of cultural development of artificial intelligence. The experimental results show that after using the decision support method mentioned in this paper, the technical progress index of Jingdezhen porcelain culture has increased by 2.4%. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive investigation of the optimal design of an interior permanent magnet synchronous motor (IPMSM) for electric vehicles (EVs), utilizing the hybrid artificial bee colony algorithm–support vector machine (HAS) algorithm. The performance of the drive motor is a crucial determinant of the overall vehicle performance, particularly in EVs that rely solely on a motor for propulsion. In this context, interior permanent magnet synchronous motors (IPMSMs) offer a compelling choice due to their high torque density, wide speed range, superior efficiency, and robustness. However, accurate analysis of the nonlinear characteristics of IPMSMs necessitates finite element analysis, which can be time-consuming. Therefore, research into methods for deriving an optimal model with minimal computation is of significant importance. The HAS is a powerful multimodal optimization technique that is capable of exploring several optimal solutions. It enhances the navigation capability by combining the artificial bee colony algorithm (ABC) with the kernel support vector machine (KSVM). Specifically, the algorithm improves the search ability by optimizing the movement of bees in each region generated by the KSVM. Furthermore, hybridization with the Nelder–Mead method ensures accurate and quick convergence at pointers discovered in the ABC. To demonstrate the effectiveness of the proposed algorithm, this study compared its performance with a conventional algorithm in two mathematical test functions, verifying its remarkable performance. Finally, the HAS algorithm was applied to the optimal design of the IPMSM for EVs. Overall, this paper provides a thorough investigation of the application of the HAS algorithm to the design of IPMSMs for electric vehicles, and its application is expected to benefit from the combination of machine-learning techniques with various other optimization algorithms. [ABSTRACT FROM AUTHOR]

The Artificial Bee Colony algorithm (ABC) is a swarm intelligence algorithm inspired by honey bee harvesting behavior. It boasts the benefits of minimal parameters and strong exploration capabilities. However, the ABC algorithm is still susceptible to local optima entrapment and lacks consideration of selection probability in the onlooker bee phase, leading to reduced convergence accuracy in later search stages. To address these issues, this paper introduces an enhanced ABC algorithm called Hierarchical Learning-based Artificial Bee Colony (HLABC). Initially, a hierarchical learning approach is devised, dividing the entire population into distinct layers based on solution quality. In this hierarchical approach, bees at lower layers can access much better advantageous information from higher layers. Secondly, the exploitation ability of onlooker bees is enhanced through novel strategies designed based on hierarchical learning. Thirdly, the exploration ability of scout bees is strengthened by implementing an opposition-based learning method. To evaluate the performance of the proposed algorithm, 69 benchmark functions from four benchmark suites (CEC2005, CEC2010, CEC2013 and CEC2022) are used to test the performance of HLABC, along with five variants of the ABC algorithm, The experimental statistical results show that the HLABC algorithm outperforms the ABC algorithm on all test problems with an average winning rate of 89%. Furthermore, to validate the performance of the HLABC algorithm in real-world optimization problems, this paper applies the HLABC algorithm to two practical applications: the deployment of wireless sensor networks (WSNs), the power scheduling problem in a smart home (PSPSH) and the multi-thresholding image segmentation (MIS). The experimental and statistical results demonstrate that HLABC is an efficient and stable optimizer. It shows better or comparable performance compared to other ABC variants when considering the quality of solutions for a suite of benchmark problems and real-world optimization problems. These findings affirm the effectiveness and versatility of the HLABC algorithm in addressing both theoretical and practical optimization challenges. [ABSTRACT FROM AUTHOR]

Artificial physical optimizer (APO), as a new heuristic stochastic algorithm, is difficult to balance convergence and diversity when dealing with complex multi-objective problems. This paper introduces the advantages of R2 indicator and target space decomposition strategy, and constructs the candidate solution of external archive pruning technology selection based on APO algorithm. A hybrid strategy guided multi-objective artificial physical optimizer algorithm (HSGMOAPO) is proposed. Firstly, R2 indicator is used to select the candidate solutions that have great influence on the convergence of the whole algorithm. Secondly, the target space decomposition strategy is used to select the remaining solutions to improve the diversity of the algorithm. Finally, the restriction processing method is used to improve the ability to avoid local optimization. In order to verify the comprehensive ability of HSGMOAPO algorithm in solving multi-objective problems, five comparison algorithms were evaluated experimentally on standard test problems and practical problems. The results show that HSGMOAPO algorithm has good convergence and diversity in solving multi-objective problems, and has the potential to solve practical problems. [ABSTRACT FROM AUTHOR]

Highly-deviated wells are the key technology to reduce the risk of drilling accidents and improve the utilization of reservoirs. However, for reservoirs with complex lithology, highly-deviated wells are faced with the problems of geomechanical transformation and fracturing parameter optimization. The research on fracturing parameter optimization technology of high-deviated wells in complex lithologic reservoirs is helpful to the research and application of geomechanics in deep unconventional reservoirs. This paper is based on geological mechanics laboratory experiments and logging interpretation, combined with regional geological background, to clarify the geological and mechanical characteristics of the Fengcheng Formation shale oil region in the Mabei Slope. On this basis, based on the current geostress field and natural fracture distribution pattern of the Mabei Slope, an integrated model of shale oil geological engineering in local well areas was established. Based on the finite element method, optimization design was carried out for the cluster spacing, construction fluid volume, displacement, and sand volume of highly deviated well fracturing, and three-dimensional simulation of fracturing fractures was completed. The research results indicate that: (1) The current dominant direction of the maximum principal stress in the Fengcheng Formation on theMabei Slope is from northeast to southwest, with themaximum horizontal principal stress generally ranging from 90 to 120 MPa and the minimum horizontal principal stress generally ranging from 70 to 110 MPa. (2) The difference in stress between the two horizontal directions is relatively large, generally greater than 8 MPa. Two sets of natural fractures have developed in the research area, one with a northwest southeast trend and the other with a northeast southwest trend. The natural fracture density of the Fengcheng Formation shale reservoir in the Mabei Slope is 0.32-1.12/m, with an average of 0.58/m, indicating amoderate to high degree of fracture development. (3) The geological model and three-dimensional geo-mechanical model are established according to the actual drilling geological data, and different schemes are designed to carry out single parameter optimization. The optimization results show that the optimal cluster spacing of the subdividing cutting volume pressure of the highly deviated wells in the Fengcheng Formation of the Mabei Slope is 12 m, the optimal construction fluid volume is 1400-1600 m³/section, the optimal construction displacement is 8 m³/min, and the optimal sanding strength is 2.5 m³/m. At the same time, by comparing the fracturing implementation effect with the fracturing scheme design, it is proven that the artificial parameter optimization method for highly deviated wells based on the finite element method based on the regional stress background and the natural fracture development law proposed in this paper is feasible and can provide a scientific basis for the fracturing development of highly deviated wells in complex lithologic reservoirs. This research has been well applied in Mahu area of Xinjiang oilfield. [ABSTRACT FROM AUTHOR]

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]

This paper introduces a novel meta-heuristic algorithm named Rhinopithecus Swarm Optimization (RSO) to address optimization problems, particularly those involving high dimensions. The proposed algorithm is inspired by the social behaviors of different groups within the rhinopithecus swarm. RSO categorizes the swarm into mature, adolescent, and infancy individuals. Due to this division of labor, each category of individuals employs unique search methods, including vertical migration, concerted search, and mimicry. To evaluate the effectiveness of RSO, we conducted experiments using the CEC2017 test set and three constrained engineering problems. Each function in the test set was independently executed 36 times. Additionally, we used the Wilcoxon signed-rank test and the Friedman test to analyze the performance of RSO compared to eight well-known optimization algorithms: Dung Beetle Optimizer (DBO), Beluga Whale Optimization (BWO), Salp Swarm Algorithm (SSA), African Vultures Optimization Algorithm (AVOA), Whale Optimization Algorithm (WOA), Atomic Retrospective Learning Bare Bone Particle Swarm Optimization (ARBBPSO), Artificial Gorilla Troops Optimizer (GTO), and Harris Hawks Optimization (HHO). The results indicate that RSO exhibited outstanding performance on the CEC2017 test set for both 30 and 100 dimension. Moreover, RSO ranked first in both dimensions, surpassing the mean rank of the second-ranked algorithms by 7.69% and 42.85%, respectively. Across the three classical engineering design problems, RSO consistently achieves the best results. Overall, it can be concluded that RSO is particularly effective for solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

Software cost estimation (SCE), estimating the cost and time required for software development, plays a highly significant role in managing software projects. A somewhat accurate SCE is necessary for a software project to be successful. It allows effective control of construction time and cost. In the past few decades, various models have been presented to evaluate software projects, including mathematical models and machine learning algorithms. In this paper, a new model based on the hybrid of the artificial fish swarm algorithm (AFSA) and the artificial bee colony (ABC) algorithm is presented for SCE. The initial population of AFSA, which includes the values of the effort factors, is generated using the ABC algorithm. ABC algorithm is used to solve the problems of the AFSA algorithm such as population diversity and getting stuck in a local optimum. ABC algorithm achieves the best solutions using observer and scout bees. The evaluation of the combined method has been implemented on eight different data sets and evaluated based on eight different criteria such as mean magnitude of relative error and PRED (0.25). The proposed method is more error-free than current SCE methods, according to the results. The error value of the proposed method is lower on NASA60, NASA63, and NASA93 datasets. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) swarm intelligence technology has shown unique advantages in agricultural and forestry disaster detection, early warning, and prevention with its efficient and precise cooperative operation capability. In this paper, a systematic application strategy of UAV swarms in forest fire detection is proposed, including fire point detection, fire assessment, and control measures, based on the fusion of particle swarm optimization (PSO) and the artificial bee colony (ABC) algorithm. The UAV swarm application strategy provides optimized paths to quickly locate multiple mountain forest fire points in 3D forest modeling environments and control measures based on the analysis of the fire situation. This work lays a research foundation for studying the precise application of UAV swarm technology in real-world forest fire detection and prevention. [ABSTRACT FROM AUTHOR]

Over the last decade, dual active bridge (DAB) converters have become critical components in high-frequency power conversion systems. Recently, intensive efforts have been directed at optimizing DAB converter design and control. In particular, several strategies have been proposed to improve the performance of DAB control systems. For example, fractional-order (FO) control methods have proven potential in several applications since they offer improved controllability, flexibility, and robustness. However, the FO controller design process is critical for industrializing their use. Conventional FO control design methods use frequency domain-based design schemes, which result in complex and impractical designs. In addition, several nonlinear equations need to be solved to determine the optimum parameters. Currently, metaheuristic algorithms are used to design FO controllers due to their effectiveness in improving system performance and their ability to simultaneously tune possible design parameters. Moreover, metaheuristic algorithms do not require precise and detailed knowledge of the controlled system model. In this paper, a hybrid algorithm based on the chaotic artificial ecosystem-based optimization (AEO) and manta-ray foraging optimization (MRFO) algorithms is proposed with the aim of combining the best features of each. Unlike the conventional MRFO method, the newly proposed hybrid AEO-CMRFO algorithm enables the use of chaotic maps and weighting factors. Moreover, the AEO and CMRFO hybridization process enables better convergence performance and the avoidance of local optima. Therefore, superior FO controller performance was achieved compared to traditional control design methods and other studied metaheuristic algorithms. An exhaustive study is provided, and the proposed control method was compared with traditional control methods to verify its advantages and superiority. [ABSTRACT FROM AUTHOR]

Campus basketball culture is gradually affecting students' sports spirit and sports accomplishment. As for the evaluation of basketball teaching achievements, the method of specified items is generally used for testing, which is highly subjective. It's completely teacher-led, and teachers make relevant evaluations of students' basketball behavior. Teachers can't be absolutely fair and just in the evaluation, because teacher evaluation can be affected by many factors, such as teachers' mood on that day, teachers' affection for students, and so on, the traditional way of teacher basketball evaluation is easy to cause negative emotional impact on some students, so that students have negative emotions on basketball activities, and even affect their sports quality, and finally affect their health. Based on the evaluation method of basketball teaching, this paper introduced a reliability intelligent evaluation model based on swarm intelligence and edge computing and used this model to evaluate students' performance in basketball teaching classes. Moreover, this paper designed a related experiment, the experimental results showed that boys and girls in basketball level gap was more obvious. As far as dribbling skills were concerned, the highest score of boy A was 91 points, while the lowest score of girl C was 54 points. The gap was quite large. At the same time, the introduction results of the reliability intelligent evaluation model were studied by using the questionnaire survey method. As can be seen from the results of the questionnaire, the number of people who are very interested in basketball teaching activities is obviously high, and the number of people who are still not interested in the six activities is no more than 2. Through the change data of students' interests and attitudes, it was proved that the reliability intelligent evaluation model could improve the students' enthusiasm for learning basketball courses, thus improving their sports quality. This study provided a reference value for the application of swarm intelligence and edge computing in the intelligent evaluation model of basketball teaching reliability, and provided a direction for the future development of basketball teaching. [ABSTRACT FROM AUTHOR]

The artificial bee colony algorithm (ABC) is a promising metaheuristic algorithm for continuous optimization problems, but it performs poorly in solving discrete problems. To address this issue, this paper proposes a hybrid discrete artificial bee colony (HDABC) algorithm based on label similarity for the point-feature label placement (PFLP) problem. Firstly, to better adapt to PFLP, we have modified the update mechanism for employed bees and onlooker bees. Employed bees learn the label position of the better individuals, while onlooker bees perform dynamic probability searches using two neighborhood operators. Additionally, the onlooker bees' selection method selects the most promising solutions based on label similarity, which improves the algorithm's search capabilities. Finally, the Metropolis acceptance strategy is replaced by the original greedy acceptance strategy to avoid the premature convergence problem. Systematic experiments are conducted to verify the effectiveness of the neighborhood solution generation method, the selection operation based on label similarity, and the Metropolis acceptance strategy in this paper. In addition, experimental comparisons were made at different instances and label densities. The experimental results show that the algorithm proposed in this paper is better or more competitive with the compared algorithm. [ABSTRACT FROM AUTHOR]

Fusing satellite (remote sensing) images is an interesting topic in processing satellite images. The result image is achieved through fusing information from spectral and panchromatic images for sharpening. In this paper, a new algorithm based on based the Artificial bee colony (ABC) algorithm with peak signal-to-noise ratio (PSNR) index optimization is proposed to fusing remote sensing images in this paper. Firstly, Wavelet transform is used to split the input images into components over the high and low frequency domains. Then, two fusing rules are used for obtaining the fused images. The first rule is "the high frequency components are fused by using the average values". The second rule is "the low frequency components are fused by using the combining rule with parameter". The parameter for fusing the low frequency components is defined by using ABC algorithm, an algorithm based on PSNR index optimization. The experimental results on different input images show that the proposed algorithm is better than some recent methods. [ABSTRACT FROM AUTHOR]

With the significant growth of the cyber environment over recent years, defensive mechanisms against adversaries have become an important step in maintaining online safety. The adaptive defense mechanism is an evolving approach that, when combined with nature-inspired algorithms, allows users to effectively run a series of artificial intelligence-driven tests on their customized networks to detect normal and under attack behavior of the nodes or machines attached to the network. This includes a detailed analysis of the difference in the throughput, end-to-end delay, and packet delivery ratio of the nodes before and after an attack. In this paper, we compare the behavior and fitness of the nodes when nodes under a simulated attack are altered, aiding several nature-inspired cyber security-based adaptive defense mechanism approaches and achieving clear experimental results. The simulation results show the effectiveness of the fitness of the nodes and their differences through a specially crafted metric value defined using the network performance statistics and the actual throughput difference of the attacked node before and after the attack. [ABSTRACT FROM AUTHOR]

Under partial-shading conditions (PSCs), the output P-V curve of the photovoltaic array shows a multi-peak shape. This poses a challenge for traditional maximum power point tracking (MPPT) algorithms to accurately track the global maximum power point (GMPP). Single intelligent algorithms such as PSO and ABC have difficulty balancing tracking speed and tracking accuracy. Additionally, there is significant power oscillation during the tracking process. Therefore, this paper proposes a new hybrid method called the Cuckoo Search Algorithm and Artificial Bee Colony algorithm (CSA-ABC) for photovoltaic MPPT. The CSA-ABC algorithm combines the local random walk and the global levy flight mechanism of the cuckoo algorithm, by probability selection, to decide whether to group the population, and introduces adaptive weight factors and gravitational mechanisms between adjacent individuals, incorporating an algorithm restart mechanism to track new MPPs in response to changes in the external environment. The algorithm is implemented in MATLAB/Simulink using a photovoltaic power-generation system model. Simulation verification is performed under different PSC scenarios. The results show that the proposed MPPT algorithm is 6.2–78.6% faster than the PSO, CSA, and ABC algorithms and two other hybrid algorithms, with a smaller power oscillation during the tracking process and zero power oscillation during the steady process. [ABSTRACT FROM AUTHOR]

In the context of multi-vehicle formation, obstacle avoidance in unknown environments presents a number of challenges, including obstacles near the target, susceptibility to local minima, and dynamic obstacle avoidance. To address these issues in multi-vehicle formation control and obstacle avoidance within unknown environments, this paper uses PID control to optimize the potential field function of the artificial potential field method and conducts simulation experiments. The results demonstrate that the proposed algorithm achieves reductions of 39.7%, 41.9%, 24.8% and 32.0% in four efficiency functions (total iteration times, formation efficiency function value, energy consumption and standard deviation of iteration times) compared to other algorithms. The improved algorithm more effectively addresses the challenge of slow obstacle avoidance when vehicles approach the target and can handle unexpected situations such as local minima and dynamic obstacles. It achieves energy-efficient optimization for multi-vehicle obstacle avoidance in complex environments. [ABSTRACT FROM AUTHOR]

Feature selection aims to select crucial features to improve classification accuracy in machine learning and data mining. In this paper, a new binary grasshopper optimization algorithm using time-varying Gaussian transfer functions (BGOA-TVG) is proposed for feature selection. Compared with the traditional S-shaped and V-shaped transfer functions, the proposed Gaussian time-varying transfer functions have the characteristics of a fast convergence speed and a strong global search capability to convert a continuous search space to a binary one. The BGOA-TVG is tested and compared to S-shaped and V-shaped binary grasshopper optimization algorithms and five state-of-the-art swarm intelligence algorithms for feature selection. The experimental results show that the BGOA-TVG has better performance in UCI, DEAP, and EPILEPSY datasets for feature selection. [ABSTRACT FROM AUTHOR]

Aiming at the problem of difficult obstacle avoidance for unmanned ground vehicles (UGVs) in complex dynamic environments, an improved A*-APF algorithm (BA*-MAPF algorithm) is proposed in this paper. Addressing the A* algorithm's challenges of lengthy paths, excess nodes, and lack of smoothness, the BA*-MAPF algorithm integrates a bidirectional search strategy, applies interpolation to remove redundant nodes, and uses cubic B-spline curves for path smoothing. To rectify the traditional APF algorithm's issues with local optimization and ineffective dynamic obstacle avoidance, the BA*-MAPF algorithm revises the gravitational field function by incorporating a distance factor, and fine-tunes the repulsive field function to vary with distance. This adjustment ensures a reduction in gravitational force as distance increases and moderates the repulsive force near obstacles, facilitating more effective local path planning and dynamic obstacle navigation. Through our experimental analysis, the BA*-MAPF algorithm has been validated to significantly outperform existing methods in achieving optimal path planning and dynamic obstacle avoidance, thereby markedly boosting path planning efficiency in varied scenarios. [ABSTRACT FROM AUTHOR]

Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman's rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration. [ABSTRACT FROM AUTHOR]

When solving complex problems, setting up models for complex systems, and developing algorithms for search and optimization in such models and systems, it must be considered that such problems are intractable from the mathematical point of view. 2010: 431-442 8 Nguyen P.T.H., Sudholt D. Memetic algorithms beat evolutionary algorithms on the class of hurdle problems, GECCO' 18. Thus, the asymmetric role played by the problem to solve and the model/algorithm for the solution must be balanced and, that way, the whole problem-solution complex must be brought into a symmetrical configuration. Sometimes, if there is a "guarantee" for obtaining a reasonably good solution for a particular concrete problem, where the expected time and space costs can be well estimated for arbitrary size, the applier is happier than when having a sometimes more efficient, but for some topologies, problem sub-classes, or certain large sizes inapplicable algorithm. [Extracted from the article]

With the rapid development of the geometric modeling industry and computer technology, the design and shape optimization of complex curve shapes have now become a very important research topic in CAGD. In this paper, the Hybrid Artificial Hummingbird Algorithm (HAHA) is used to optimize complex composite shape-adjustable generalized cubic Ball (CSGC–Ball, for short) curves. Firstly, the Artificial Hummingbird algorithm (AHA), as a newly proposed meta-heuristic algorithm, has the advantages of simple structure and easy implementation and can quickly find the global optimal solution. However, there are still limitations, such as low convergence accuracy and the tendency to fall into local optimization. Therefore, this paper proposes the HAHA based on the original AHA, combined with the elite opposition-based learning strategy, PSO, and Cauchy mutation, to increase the population diversity of the original algorithm, avoid falling into local optimization, and thus improve the accuracy and rate of convergence of the original AHA. Twenty-five benchmark test functions and the CEC 2022 test suite are used to evaluate the overall performance of HAHA, and the experimental results are statistically analyzed using Friedman and Wilkerson rank sum tests. The experimental results show that, compared with other advanced algorithms, HAHA has good competitiveness and practicality. Secondly, in order to better realize the modeling of complex curves in engineering, the CSGC–Ball curves with global and local shape parameters are constructed based on SGC–Ball basis functions. By changing the shape parameters, the whole or local shape of the curves can be adjusted more flexibly. Finally, in order to make the constructed curve have a more ideal shape, the CSGC–Ball curve-shape optimization model is established based on the minimum curve energy value, and the proposed HAHA is used to solve the established shape optimization model. Two representative numerical examples comprehensively verify the effectiveness and superiority of HAHA in solving CSGC–Ball curve-shape optimization problems. [ABSTRACT FROM AUTHOR]

This paper introduces a new variant of the Bees Algorithm (BA) called Bees Algorithm with 2-parameter (BA2), which is a population-based metaheuristic algorithm designed to solve continuous and combinatorial optimisation problems. The proposed algorithm simplified the BA's parameters by combining exploration and exploitation strategies while preserving the algorithm's core principles to efficiently search for optimal solutions. The paper provides a detailed description of the algorithm's core principles and its application to two engineering problems, the air-cooling system design (ACSD) and the printed circuit board assembly sequence optimisation (PASO). The results show that BA2 outperforms previous versions of the basic BA in terms of convergence speed and solution quality. However, the authors acknowledge that further research is needed to test the scalability and generalisability of the algorithm to larger and more diverse optimisation problems. Overall, this paper provides valuable insights into the potential of metaheuristics for solving real-world optimisation problems. [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 goal of any well‐established deregulated power sector is to satisfy their customer by delivering the power with maintaining the best quality at a reasonable price. This paper presents the impression of the wind farm (WF) and compressed air energy storage (CAES) hybrid systems in the congested deregulated power system. The main motto of this work is to enhance social welfare by using a market‐clearing mechanism of the WFCAES hybrid system. To determine the effect of the hybrid system, initially the market‐clearing power (MCPO) problem is measured without considering the WF‐CAES hybrid system, and then the same work has been carried out with considering the WF‐CAES hybrid system. The bus sensitivity factor (BSF) decides the optimal position of the WF‐CAES hybrid system in the congested day‐ahead electrical system. The study is followed out through generator sensitivity factor (GSF) with the application of artificial bee colony algorithm (ABC) and slime mould algorithm (SMA) to calculate optimal market clearing price (MCP) and market clearing volume (MCV). The market‐clearing power problem has been solved in a modified IEEE‐30 bus test system. The SMA algorithm is been implemented in the market‐clearing mechanism for the first time which is the novelty of this paper. [ABSTRACT FROM AUTHOR]

Software defects are problems in software that destroy normal operation ability and reflect the quality of the software. Software fault can be predicted by the software reliability model. In this paper, the hybrid algorithm is applied to parameter estimation in software defect prediction. As a biological heuristic algorithm, BAS (Beetle Antennae Search Algorithm) has fast convergence speed and is easy to implement. ABC (Artificial Bee Colony Algorithm) is better in optimization and has strong robustness. In this paper, the BAS-ABC hybrid algorithm is proposed by mixing the two algorithms and the goal of the proposed method is to improve the convergence and stability of the algorithm. Five datasets were used to carry out the experiments, and the data results showed that the hybrid algorithm was more accurate than the single algorithm, with stronger convergence and stability, so it was more suitable for parameter estimation of the software reliability model. Meanwhile, this paper implemented the comparison between hybrid BAS + ABC and hybrid PSO + SSA, and the result shows that BAS + ABC has better performance both in convergence and stability. The comparison result shows the strong ability in estimation and prediction of software defects hybrid BAS and ABC. [ABSTRACT FROM AUTHOR]

In existing meta-heuristic algorithms, population initialization forms a huge part towards problem optimization. These calculations can impact variety and combination to locate a productive ideal arrangement. Especially, for perceiving the significance of variety and intermingling, different specialists have attempted to improve the presentation of meta-heuristic algorithms. Particle Swarm Optimization (PSO) algorithm is a populace-based, shrewd stochastic inquiry strategy that is motivated by the inherent honey bee swarm food search mechanism. Population initialization is an indispensable factor in the PSO algorithm. To improve the variety and combination factors, rather than applying the irregular circulation for the introduction of the populace, semi-arbitrary successions are more helpful. This examination presents a thorough overview of the different PSO initialization approaches which are dependent on semi-arbitrary successions systems. In this precise review, the best in class in the populace instatement is uncovered. The procedures are classified by utilizing a theoretical model that parts the cycle of populace introduction into two phases: that is, right now expressly or certainly utilized for reinstatement in every single present approach. The deliberate investigation unveils the potential examination zones of populace introduction and, furthermore, research holes, despite the fact that the fundamental center is to give the headings to future upgrade and advancement around there. This paper gives a deliberate study identified with this calculated model for the cutting edge of exploration, which is talked about in the predefined writing to date. The study is envisioned to be useful in examining the PSO algorithm in detail for the specialist. Likewise, the paper finds the proficiency of numerous quasi-random sequences (QRS) based on initialization approaches by looking at their exhibition analyzed for sixteen notable benchmark test problems. [ABSTRACT FROM AUTHOR]

The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize complex engineering problems. To overcome the shortcomings, a novel modified shuffled frog leaping algorithm (MSFLA) with inertia weight is proposed in this paper. To extend the scope of the direction and length of the updated worst frog (vector) of the original SFLA, the inertia weight α was introduced and its meaning and range of the new parameters are fully explained. Then the convergence of the MSFLA is deeply analyzed and proved theoretically by a new dynamic equation formed by Z-transform. Finally, we have compared the solution of the 7 benchmark functions with the original SFLA, other improved SFLAs, genetic algorithm, PSO, artificial bee colony algorithm, and the grasshopper optimization algorithm with invasive weed optimization. The testing results showed that the modified algorithms can effectively improve the solution accuracy and convergence property, and exhibited an excellent ability of global optimization in high-dimensional space and complex function problems. [ABSTRACT FROM AUTHOR]

In urban railway systems, the timetable guides the section operation of the single train and the arrangement of the train group to meet the dual needs of cost and passengers. This paper proposes a two‐objective train operation optimization based on eco‐driving and timetabling to restore a more realistic scene, including a method level and an objective level. For the method level, the speed curve optimization of the single train and the timetable optimization of the train group are adopted jointly. For the objective level, both the total energy consumption of the train group and the consuming time of passengers are considered. A hybrid solution strategy based on quadratic programming and improved artificial bee colony algorithm is proposed. A hardware‐in‐the‐loop platform is built to carry out validation experiments. Both the cases in general hours and special hours are verified based on the actual data from Beijing Metro Line 15. The results show that both the energy consumption and the passenger consuming time are reduced simultaneously. Correspondingly, the speed curve and the time distribution of the timetable are individually optimized based on the fluctuating passenger flow. [ABSTRACT FROM AUTHOR]

Recently, the Distributed Generation (DG) structure has become an important aspect of daily planning and has achieved a variety of functions while maximizing the functionality of utilities. It should balance the energy equilibrium of the system components and the production limit. Uncertainties arise during the operation of the DG, represented by generator power, load requirements and fluctuations in electricity prices. The reactive power problem is the major concern associated with the DG system. This paper analyzes both DG and an energy storage system along with their optimal performance using a specific algorithm. For optimal analysis of DG and ESS, an Improved Artificial Bee Colony Algorithm (IABC) is proposed. The IABC evaluates the performance of distribution network. It takes DG and ESS into account for analyzing optimal design problems, the main goal of which is to minimize their reactive power dispersion functions. In addition, there are barriers to reducing the DG's operating costs. The proposed method is implemented on the MATLAB platform and tested using the IEEE 33-bus system. To confirm the effectiveness of the proposed method, it will be compared with the existing methods such as artificial bee colony (ABC) and levy-based method, respectively. [ABSTRACT FROM AUTHOR]

Device-to-Device (D2D) communication is an emerging technology that is vital for the future of cellular networks, including 5G and beyond. Its potential lies in enhancing system throughput, offloading the network core, and improving spectral efficiency. Therefore, optimizing resource and power allocation to reduce co-channel interference is crucial for harnessing these benefits. In this paper, we conduct a comparative study of meta-heuristic algorithms, employing Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), Bee Life Algorithm (BLA), and a novel combination of matching techniques with BLA for joint channel and power allocation optimization. The simulation results highlight the effectiveness of bio-inspired algorithms in addressing these challenges. Moreover, the proposed amalgamation of the matching algorithm with BLA outperforms other meta-heuristic algorithms, namely, PSO, BLA, and GA, in terms of throughput, convergence speed, and achieving practical solutions. [ABSTRACT FROM AUTHOR]

This paper proposes a virtual inertia control strategy for wind farms based on auto disturbance rejection controller with artificial bee colony (ABC) algorithm. First, based on the system frequency dynamic response equation, an active disturbance rejection controller is designed according to the non‐linear feedback control law and the extended state observer to improve the anti‐interference capability of the virtual inertia control system. Second, in order to solve the problem of difficulty in tuning the parameters of the active disturbance rejection control (ADRC), an ABC algorithm based on nectar collection behaviour was proposed to iteratively optimize the parameters of ADRC. Finally, the proposed control method is effectively verified based on Matlab/Simulink. The simulation results show that compared with traditional algorithms, the proposed ABC‐ADRC can effectively control the rotor speed to adjust the frequency of the power grid system, achieve power sharing and adaptive noise elimination, reduce the complexity of parameter settings, not only improve anti‐interference ability, but also enhance the robustness of the system. [ABSTRACT FROM AUTHOR]

To meet the production demand of workshop, this paper proposes an efficient discrete artificial bee colony (DABC) algorithm to solve a new automatic guided vehicle (AGV) scheduling problem with delivery and pickup in a matrix manufacturing workshop. The goal is to produce a AGV transportation solution that minimizes the total cost, including travel cost, time cost, and AGV cost. Therefore, a mixed integer linear programming model is established. To improve the transportation efficiency, a dynamic calculation method is developed. In the DABC algorithm, a heuristic algorithm and a median based probability selection method are used. For improving the quality of the solutions, four effective neighborhood operators are introduced. In the local search, a rule is given to save the operation time and a problem-based search operator is proposed to improve the quality of the best individual. Finally, a series of comparison experiments were implemented with the iterative greedy algorithm, artificial bee colony algorithm, hybrid fruit fly optimization algorithm, discrete artificial bee colony algorithm, improved harmony search, and hybrid genetic-sweep algorithm. The results show that the proposed DABC algorithm has high performance on solving the delivery and pickup problem. [ABSTRACT FROM AUTHOR]

In rough set theory, a construct is an attribute subset with the same ability to discern objects belonging to different classes as the whole set of attributes, while maintaining the similarity between objects belonging to the same class. Although algorithms for reducts computation can be adapted to compute constructs, practical problems exist where these algorithms cannot compute all constructs within a reasonable time frame. Therefore, this paper introduces an algorithm for computing all constructs of a decision system. The results of experiments with various decision systems (both artificial and real-world) suggest that our algorithm is, in most cases, faster than the state-of-the-art algorithms when the simplified binary discernibility–similarity matrix has a density of less than 0.29. [ABSTRACT FROM AUTHOR]

Lateral vehicle control is of high importance in automated vehicles as it directly influences the vehicle's performance and safety during operation. The linear quadratic regulator (LQR) controller stands out due to its high-performance characteristics and is used in the open source for self-driving functions. However, a notable limitation of the current approach is the manual calibration of LQR controllers based on the experience and intuition of the designers, leading to empirical uncertainties. To address this issue and enhance the lateral control performance, this paper concentrates on refining the LQR by employing three optimization algorithms: artificial bee colony optimization (ABC), genetic algorithm (GA), and particle swarm optimization (PSO). These algorithms aim to overcome the reliance on empirical methods and enable a data-driven approach to LQR calibration. By comparing the outcomes of these optimization algorithms to the manual LQR controller within an offline multibody simulation as a testing platform, this study highlights the superiority of the best-performing optimization approach. Following this, the optimal algorithm is implemented on a real-time system for the full vehicle level, revealing the model-in-the-loop and the hardware-in-the-loop gap up to 78.89% with lateral velocity when we use the relative error criterion (REC) method to validate and 2.35 m with lateral displacement when considering the maximum absolute value method. [ABSTRACT FROM AUTHOR]

It is necessary to study the application of digital technology in English speech feature recognition. This paper combines the actual needs of English speech feature recognition to improve the digital algorithm. Moreover, this paper combines fuzzy algorithm to analyze English speech features, analyzes the shortcomings of traditional algorithms, proposes the fuzzy digitized English speech recognition algorithm, and builds an English speech feature recognition model on this basis. In addition, this paper conducts time-frequency analysis on chaotic signals and speech signals, eliminates noise in English speech features, improves the recognition effect of English speech features, and builds an English speech feature recognition system based on digital means. Finally, this paper conducts grouping experiments by inputting students' English pronunciation forms and counts the results of the experiments to test the performance of the system. The research results show that the method proposed in this paper has a certain effect. [ABSTRACT FROM AUTHOR]

The world's increasing dependence on computer‐assisted education systems has raised significant challenges about student assessment methods, such as automated test design. The exam questions should test the students' potential from various aspects, such as their intellectual and cognitive levels, which can be defined as attributes of the questions to assess student knowledge. Test design is challenging when various question attributes, such as category, learning outcomes, difficulty, and so forth, are considered with the exam constraints, such as exam difficulty and duration. In this paper, four contributions are provided to overcome test design challenges for the student assessment. First, a tool is developed to generate a synthetic question pool. Second, an objective function is designed based on the considered attributes. Third, the popular swarm and evolutionary optimization methods, namely particle swarm optimization, genetic algorithm, artificial bee colony, differential search algorithm are comparatively studied with novel methodologies applied to them. Finally, as the state of the art methods, artificial bee colony, and differential search algorithm are further modified to improve the solution of the test design. To perform the proposed algorithms, a dataset of 1000 questions is built with the proposed question attributes of the test design. Algorithms are evaluated in terms of their successes in both minimizing the objective function and running time. Additionally, Friedman's test and Wilcoxon rank‐sum statistical tests are applied to statistically compare the algorithms' performances. The results show that the improved artificial bee colony and the improved differential search provide better results than others in terms of optimization error and running time. [ABSTRACT FROM AUTHOR]

In the processing of panoramic video, projection mapping is a very critical step. The selection of the projection mapping format will affect the performance, transmission mode, and rendering mode of the panoramic video codec. Therefore, this article starts from the projection mapping format, analyzes the mapping process of the standard mapping format, and then proposes a method of rendering panoramic video in the projection mapping format. By analyzing the parallel design schemes of swarm intelligence algorithms under different granularities, this paper proposes a parallel swarm intelligence optimization algorithm design method and then designs and implements a parallel artificial bee colony algorithm. With the help of the ArcGIS Engine development platform, this paper defines the interface for data exchange. With the support of Multipatch format data in ArcGIS software, through secondary development, the three-dimensional pipeline automatic modeling module is established, and the pipeline model is automatically generated. The digital construction and visualization of the company play a driving role. Based on the understanding of the characteristics of the pipeline image itself, combined with the analysis of the shortcomings of the existing methods, this paper proposes a new deep learning-based high-definition rendering solution for the pipeline image. In this paper, the pipeline image is preprocessed, and then the processed pipeline image is converted into a style pipeline image through the pipeline image style transfer technology, and the obtained style pipeline image is postprocessed to enhance the effect. The preprocessing of pipeline images mainly includes pipeline image enhancement and pipeline image filtering operations. Its purpose is to change the distribution of pipeline images to improve the quality of pipeline images and make them more suitable for subsequent style conversion. In the part of pipeline image style conversion, this paper proposes a new deep learning-based pipeline image high-definition rendering network, which consists of three subnetworks: pipeline image feature modeling module, feature model alignment module, and pipeline image re-rendering module. This article has conducted sufficient experiments to fully compare the processing results of the method proposed in this article and other existing methods and at the same time shows the high-quality high-definition rendering results. The experimental results verify the excellent performance of the method proposed in this paper. [ABSTRACT FROM AUTHOR]

Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can't solve discrete optimization problems directly. Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete traveling salesman problems. To verify the effectiveness of this method, the algorithm has been tested on 23 symmetric benchmarks and compared its performance with other algorithms. The results have shown that the proposed UPBA outperforms all the other alternatives significantly in most cases. [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]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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]