Search

With the exponential growth in the number of academic researchers, it is crucial for editors of scientific journals to identify the highest-quality papers. While several measures exist to evaluate a paper's impact post-publication, the challenge of determining the potential impact of a manuscript during the review process remains an understudied issue. In this paper, we propose a reviewer-reputation ranking algorithm to identify high-quality papers based on paper citations, where a reviewer's reputation is computed from the correlation between their past ratings and the current number of citations received by the papers they have evaluated. During the review process, reviewers with high reputation scores are given more weight to determine the quality of papers. We test the algorithm on an artificial network with 200 reviewers and 600 papers, as well as on the American Physical Society (APS) data set, including in the analysis 308,243 papers and 274,154 mutual citations. We compare our approach with two existing methods, demonstrating that our algorithm significantly outperforms the others in identifying manuscripts with the highest quality. Our findings can help improve the impact of scientific journals, thereby contributing to academic and scientific progress. • We propose an algorithm to identify the papers with the highest quality from a large number of submissions. • We compare our new algorithm with other existing methods of aggregating user ratings in various online services. • We test our algorithm both with an artificial network and with the empirical data of the APS data set. • We show that our algorithm outperforms the other methods in identifying the papers with the highest quality. [ABSTRACT FROM AUTHOR]

It also reports simulation-based comparison study with other optimization algorithms such as particle swarm optimization, differential evolution, and whale optimization algorithm. The experiment results of the algorithm in the form of precision are compared with conventional algorithms to draw conclusions about the efficacy of the proposed algorithm. In the paper titled "Analysis of Amplitude Scintillation and Positioning Error of IRNSS/GPS/SBAS Receiver for Heavy Rainy Days", the authors examine the characteristics of amplitude scintillation on an IRNSS/SBAS/GPS receiver with all seven satellites of the Indian Regional Navigation Satellite System (IRNSS) at the low-altitude station IITRAM, Ahmedabad, on days with heavy rain. In the paper "Model Order Reduction Based Power System Stabilizer Design Using Improved Whale Optimization Algorithm", the authors present an optimization technique I viz i . improved whale optimization for designing a power system stabilizer using model-order reduction for a modified single machine infinite bus system. [Extracted from the article]

Our world today relies heavily on informatics and the internet, as computers and communications networks have increased day by day. In fact, the increase is not limited to portable devices such as smartphones and tablets, but also to home appliances such as: televisions, refrigerators, and controllers. It has made them more vulnerable to electronic attacks. The denial of service (DoS) attack is one of the most common attacks that affect the provision of services and commercial sites over the internet. As a result, we decided in this paper to create a smart model that depends on the swarm algorithms to detect the attack of denial of service in internet networks, because the intelligence algorithms have flexibility, elegance and adaptation to different situations. The particle swarm algorithm and the bee colony algorithm were used to detect the packets that had been exposed to the DoS attack, and a comparison was made between the two algorithms to see which of them can accurately characterize the DoS attack. [ABSTRACT FROM AUTHOR]

Accusations have been made against high-profile papers documenting honeybee navigation, specifically regarding the existence of an internal "odometer" that relies on visual cues. Two scientists have raised concerns about possible miscalculations, image reuse, and data manipulation in 10 key papers. The author of these papers, Mandyam Veerambudi "Srini" Srinivasan, denies the allegations and states that his conclusions remain firm and have been independently replicated. While some researchers support Srinivasan, others believe that the claims need to be revisited. The journal Science is evaluating the concerns, and further investigation may be necessary. [Extracted from the article]

In this paper, we present the MU (multi-user) MIMO (multiple-input & multiple-output) system which is capable to serve the maximum number of users without additional bandwidth or power budget. MIMO systems maximize the channel capability as per the DPC scheme (Dirty Paper Coding). According to DPC, several antennas distributed over the base station are used for serving multiple users simultaneously. Nevertheless, DPC is a comprehensive search algorithm employing sequences of encoded user data for transmitting information to multiple users. Due to increased user density and subsequent transmit antennas in the MU-MIMO system, the exhaustive search (i.e. DPC) becomes cumbersome with the expanded search space domain. This search task would not be completed within a coherence time frame of the packet data communication system. The required objective is to consider this as a cost function for optimization to maximize the realizable sum-rate (throughput) of the MU-MIMO systems. This paper illuminates the joint antenna and user scheduling (JAAU) process with binary artificial bee colony (binary ABC) accomplishing nearly 98–99% of system throughput with the suggestively decreased figure in computation complexity and run time. Binary ABC is observed to have the global optimum value swiftly within the stipulated packet time frame of next-generation wireless data communications. Moreover, binary ABC achieves an appreciable system capacity for MU-MIMO systems as compared with DPC (which attains the maximum system throughput with the highest complexity). These findings are corroborated with exhaustive simulation results presented in this article. [ABSTRACT FROM AUTHOR]

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]

Distribution generation (DG) technology based on a variety of renewable energy technologies has developed rapidly. A large number of multi-type DG are connected to the distribution network (DN), resulting in a decline in the stability of DN operation. It is urgent to find a method that can effectively connect multi-energy DG to DN. photovoltaic (PV), wind power generation (WPG), fuel cell (FC), and micro gas turbine (MGT) are considered in this paper. A multi-objective optimization model was established based on the life cycle cost (LCC) of DG, voltage quality, voltage fluctuation, system network loss, power deviation of the tie-line, DG pollution emission index, and meteorological index weight of DN. Multi-objective artificial bee colony algorithm (MOABC) was used to determine the optimal location and capacity of the four kinds of DG access DN, and compared with the other three heuristic algorithms. Simulation tests based on IEEE 33 test node and IEEE 69 test node show that in IEEE 33 test node, the total voltage deviation, voltage fluctuation, and system network loss of DN decreased by 49.67%, 7.47% and 48.12%, respectively, compared with that without DG configuration. In the IEEE 69 test node, the total voltage deviation, voltage fluctuation and system network loss of DN in the MOABC configuration scheme decreased by 54.98%, 35.93% and 75.17%, respectively, compared with that without DG configuration, indicating that MOABC can reasonably plan the capacity and location of DG. Achieve the maximum trade-off between DG economy and DN operation stability. [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]

Mobile object detection and tracking is an important application of wireless sensor network. However, longevity of such application is a challenge as sensor nodes in wireless sensor network operates on battery power. Therefore, there is the requirement for increasing the lifetime of this application by optimal usage of energy while tracking. Of course, while optimizing the energy usage, tracking accuracy should not be compromised. A number of research works are carried out in the past to enhance the wireless sensor network lifetime but no work resolved the problem completely. This paper studies the issue of data routing to sink in energy constrained wireless sensor network based application where tracking information collected from different sensor nodes are processed to determine the object's presence in the monitoring area. This paper proposes an energy efficient hybrid artificial bee colony-modified Dijkstra (HABC-MD) algorithm for cluster based network for optimum usage of energy during routing of packet. The objective of this algorithm is to save the energy of the network by optimizing the number of node-to-node transmission while tracking. It uses metaheuristic approach based artificial bee colony algorithm for selection of cluster head in each round and heuristic approach-based Dijkstra algorithm for selection of optimum route between source node and sink for packet transmission. Modified Dijkstra algorithm considers both distance between source and destination and energy of the source node for determination of optimum route to sink. The performance of HABC-MD is compared with existing hybrid LEACH-Dijkstra algorithm and is found that performance of our algorithm is better in comparison to later algorithm. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to focus on a medical goods distribution problem and pharmacological waste collection by plug-in hybrid vehicles with some real-world restrictions. In this research, considering alternative energy sources and simultaneous pickup and delivery led to a decrease in greenhouse gas emissions and distribution costs, respectively. Design/methodology/approach: Here, this problem has been modeled as mixed-integer linear programming with the traveling and energy consumption costs objective function. The GAMS was used for model-solving in small-size instances. Because the problem in this research is an NP-hard problem and solving real-size problems in a reasonable time is impossible, in this study, the artificial bee colony algorithm is used. Findings: Then, the algorithm results are compared with a simulated annealing algorithm that recently was proposed in the literature. Finally, the results obtained from the exact solution and metaheuristic algorithms are compared, analyzed and reported. The results showed that the artificial bee colony algorithm has a good performance. Originality/value: In this paper, medical goods distribution with pharmacological waste collection is studied. The paper was focused on plug-in hybrid vehicles with simultaneous pickup and delivery. The problem was modeled with environmental criteria. The traveling and energy consumption costs are considered as an objective function. [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]

Understanding of optimization algorithm's behavior is a vital part that is needed for quality progress in the field of stochastic optimization algorithms. To be able to overcome this deficiency, we need to establish new standards for understanding optimization algorithm behavior, which will provide understanding of the working principles behind the stochastic optimization algorithms. In their paper I Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations i , Quinzan et al. develop suitable Evolutionary Algorithms (EAs) to tackle submodular optimization problems. The paper I Improving convergence in swarm algorithms by controlling range of random movement i by Chaudhary and Banati studies the applicability of the IS technique over different swarm algorithms employing different random distributions. [Extracted from the article]

Data clustering is one of the branches of unsupervised learning and it is a process whereby the samples are divided into categories whose members are similar to each other. The K-means algorithm is a simple and fast clustering technique, but it has many initial problems, for example, it depends heavily on the initial value for better clustering. Moreover, it is susceptible to outliers and unbalanced clusters. The artificial bee colony (ABC) algorithm is one of the meta-heuristic algorithms that is used nowadays to solve many optimization problems including clustering and the fundamental problem of this algorithm is exploration and late convergence. In this paper, to solve the problem of exploration and late convergence in ABC are used Random Memory (RM) and Elite Memory (EM) called ABCWOA algorithm. RM in the ABCWOA algorithm has used the search stage for the bait in the whale optimization algorithm (WOA) and EM is also used to increase convergence. In addition, we control the use of EM dynamically. Finally, the proposed method was implemented on ten standard datasets from the UCI Machine Learning Database for evaluation. Moreover, it was compared in terms of statistical criteria and analysis of variance (ANOVA) test with basic ABC and WOA, vortex search (VS) algorithm, butterfly optimization algorithm (BOA), crow search (CS) algorithm, and cuckoo search algorithm (CSA). The simulation results showed that the degree of convergence maintained its performance by increasing the number of repetitions of the proposed method, but the ABC algorithm has shown poor performance by increasing the repetition of performance. ANOVA results also confirmed that the ABCWOA algorithm has a positive effect on the population and it contains less noise than other comparative algorithms. The ABCWOA algorithm show that the ABCWOA algorithm performs better than other meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

In this issue, we first thank the reviewers for their hard work in handling papers during the year 2020 for the Visual Computer. Regular papers The following 6 papers have been submitted as regular papers to the Visual Computer Naoki Kita et al., titled: "Computational design of polyomino puzzles" (also presented at CGI2020 conference). SI: Learning representation from visual data We are happy to present 5 papers for the special issue "Learning representation from visual data" that has been handled by 4 guest editors who are: Dr. Wenming Zheng, Southeast University, China (lead Editor and Associate Editor of the Visual Computer). [Extracted from the article]

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]

Internet of Vehicles (IoV) applications integrating with edge computing will significantly drive the growth of IoV. However, the contradiction between the high-speed mobility of vehicles, the delay sensitivity of corresponding IoV applications and the limited coverage and resource capacity of distributed edge servers will pose challenges to the service continuity and stability of IoV applications. IoV application migration is a promising solution that can be supported by application containerization, a technology for seamless cross-edge-server application migration without user perception. Therefore, this paper proposes the container-based IoV edge application migration mechanism, consisting of three parts. The first is the migration trigger determination algorithm for cross-border migration and service degradation migration, respectively, based on trajectory prediction and traffic awareness to improve the determination accuracy. The second is the migration target decision calculation model for minimizing the average migration time and maximizing the average service time to reduce migration times and improve the stability and adaptability of migration decisions. The third is the migration decision algorithm based on the improved artificial bee colony algorithm to avoid local optimal migration decisions. Simulation results show that the proposed migration mechanism can reduce migration times, reduce average migration time, improve average service time and enhance the stability and adaptability of IoV application services. [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]

A disassembly line is an effective disassembly system to recover end-of-life products. In real life, as end-of-life products are subject to varying degrees of wear and tear, task failure may occur in the disassembly process. In this paper, the task failure risks are considered, and an expected profit-based stochastic disassembly line balancing problem is studied. First, a mathematical model is presented to maximise the expected recovering profit with task failures. Then, a hybrid metaheuristic approach is developed to efficiently solve the proposed model, which is integrated with a variable neighbourhood descent method and an artificial bee colony algorithm. Finally, the effectiveness and robustness of the proposed algorithm are verified by three cases, and experiment results show that the solution performance of the proposed approach is superior to the other three existing methods. [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]

Image segmentation is a significant step in image analysis and computer vision. Many entropy-based approaches have been presented on this topic. Among them, Tsallis entropy isone of the best-performing methods. In this paper, the surface defect images of galvanised steel sheets were studied. Atwo-dimensional asymmetric Tsallis cross-entropy image segmentation algorithm based on chaotic bee colony algorithm optimisation was used to investigate the segmentation of surface defects under complex texture backgrounds. On the basis of Tsallis entropy threshold segmentation, a more concise expression form was used to define the asymmetric Tsallis cross-entropy in order to reduce the calculation complexity of the algorithm. The chaotic algorithm was combined with the artificial bee colony (ABC) algorithm to construct the chaotic bee colony algorithm, so that the optimal threshold of Tsallis entropy could be quickly identified. The experimental results showed that compared with the maximum Shannon entropy algorithm, the calculation time of this algorithm decreased by about 58% and the threshold value increased by about (26%, 54%). Compared with the two-dimensional Tsallis cross-entropy algorithm, the calculation time of this algorithm decreased by about 35% and about 20% was improved in the g-axis direction only. Compared with the two-dimensional asymmetric Tsallis cross-entropy algorithm, the calculation time of this algorithm decreased by about 30% and the threshold values of the two algorithms were almost the same. The algorithm proposed in this paper can rapidly and effectively segment defect targets, making it a more suitable method for detecting surface defects in factories with a rapid production pace. [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]

In this paper, a novel Artificial Bee Colony algorithm is proposed to solve a variant of the Job Shop Scheduling Problem where only an interval of possible processing times is known for each operation. The solving method incorporates a diversification strategy based on the seasonal behaviour of bees. That is, the bees tend to explore more at the beginning of the search (spring) and be more conservative towards the end (summer to winter). This new strategy helps the algorithm avoid premature convergence, which appeared to be an issue in previous papers tackling the same problem. A thorough parametric analysis is conducted and a comparison of different seasonal models is performed on a set of benchmark instances from the literature. The results illustrate the benefit of using the new strategy, improving the performance of previous ABC-based methods for the same problem. An additional study is conducted to assess the robustness of the solutions obtained under different ranking operators, together with a sensitivity analysis to compare the effect that different levels of uncertainty have on the solutions' robustness. [ABSTRACT FROM AUTHOR]

Accurate numerical values of aerodynamic parameters are important in aircraft design. The knowledge of stability and control aerodynamic parameters is essential to postulate high-fidelity control laws. The aerodynamic forces and moments are strong functions of the angle of attack (AOA), Reynolds number, and control surface deflections. Typically, conventional estimation techniques such as maximum likelihood (MLE) and least-squares (LS) principles facilitate the determination of these parameters. Unsteady aerodynamics may complicate the estimation of aerodynamic parameters at high AOA. Data-driven techniques employing neural networks provide an alternative for modeling the system behavior based on its observed state and control input variables. Nonlinearity increases because of flow separation at high AOA, which is close to stall. This paper explores the feasibility of employing a machine learning approach using neural networks to predict aircraft dynamics in a limited sense to identify aerodynamic characteristics. Integrating a neural network with the artificial bee colony (ABC) method facilitated the optimization of unknowns of the proposed aerodynamic model (AM). The proposed neural artificial bee colony (NABC) optimization approach estimated the longitudinal dynamics and stall properties for two experimental aircraft. Comparison of the estimates provided by the NABC approach with those of the standard MLE and neural Gauss–Newton (NGN) techniques established its efficacy. Furthermore, robust statistical analysis indicated that the proposed method provides a viable alternative for parameter estimation in nonlinear applications. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) 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.)

All the accepted papers either discuss the recent solutions related to big data analytics or proposes an innovative way of handling big data across diverse infrastructure deployments. After the completion of the peer review process, we have accepted 10 seminal contributions related to big data analytics for Industry 4.0. For this reason, cloud computing and big data technologies (Hadoop and Map-Reduce) can improve the anticipated response and reaction times. It provides ground-breaking research from academia and industry, that emphasizes the novel solutions, applications, tools, software, and algorithms designed to handle the industrial big data. [Extracted from the article]

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]

This paper represents the idea of implementing bio-inspired algorithms in designing an optimized PID controller to investigate the stability and improve the performance of the closed-loop CUK converter. Bio-inspired algorithms (BIA) such as Firefly Algorithm (FA), Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) are stochastic optimization techniques and have been increasingly applied to attain optimal solution for designing and optimizing power converters in current times. The closed-loop transfer function of the CUK converter has been developed by the State Space Average (SSA) technique. This paper assesses both the cases of converter stability when it is integrated with the conventional PID controller and the BIA-PID controllers (FA-PID, PSO-PID, ABC-PID) and eventually compares the outcomes from all the controllers. For examining the stability of the system, three objective functions (IAE, ITAE, and ISE) and various performance specifications such as percentage of overshoot, rise time, settling time, and peak amplitude are tabulated. MATLAB and Simulink are used to carry out the simulations meticulously. Hence, a comparative analysis is illustrated in this paper to state a clear-sighted evaluation of the performances. [ABSTRACT FROM AUTHOR]

Summary: Many sorts of services in the cloud environments must be composited based on the user's requests to meet the requirements. Thus, the distributed services are joined to the cloud services through service composition. Also, it is known as NP‐hard problems and many researchers significantly are focused on this problem in recent years. Therefore, many different nature‐inspired meta‐heuristic techniques are proposed for solving this problem. The nature‐inspired meta‐heuristic techniques have an important role in solving the service composition problem in the cloud environments, but there is not a wide‐ranging and detailed paper about reviewing and studying the important mechanisms in this field. Therefore, this study presents a comprehensive analysis of the nature‐inspired meta‐heuristic techniques for the service composition issue in the cloud computing. The review also contains a classification of the important techniques. These classifications include Ant Colony Optimization, Bee Colony Optimization, Genetic Algorithm, Particle Swarm Optimization, Cuckoo Optimization Algorithm, Bat Algorithm, greedy algorithm, and hybrid algorithm. An important aim of this paper is to highlight the emphasis on the optimization algorithms, and the benefits to tackle the challenges are encountered in the cloud service composition. Also, this paper presents the advantages and disadvantages of the nature‐inspired meta‐heuristic algorithms for solving the service composition problem in the cloud environments. Moreover, this paper aims to provide more efficient service composition algorithms in the future. Finally, the obtained results have shown that the discussed algorithms have an important effect in solving the cloud service composition problem, and this effect has been increased in recent years. [ABSTRACT FROM AUTHOR]

Based on prior knowledge, image information is expressed in a bottom-up manner, thereby overcoming the limitation of data shortage. Machine-learning-based convergence modeling technologies such as visualization for observation after data cleaning and processing; model-based error detection for estimation of causal relationships; fault prediction; and model evaluation have seen rapid development. Because it is possible to determine causes of the results, the proposed technique exhibits reliability of leukemia classification in terms of data characteristics and model prediction. In diverse industrial domains, data with highly complex objects, events, and relationships are collected and pre-processed through internal and external IoT sensing. [Extracted from the article]