Search

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]

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]

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]

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]

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]

In the article, we propose a new method to generate representative volume element (RVE) of random spatial distributions with cylindrical fibers and spherical particles based on the Improved Artificial Bee Colony (IABC) algorithm. In this employed bee phase of IABC, the proposed algorithm adopts a new search strategy, which improves the computational efficiency. To analyze the differences between the fiber distribution generated by this algorithm and the actual fiber distribution, we conducted statistical analysis on the distribution of the generated RVE. The statistical analysis results of the nearest neighbor distance (NND), Second-order intensity function, and pair correlation function were in good agreement with the experiment and complete spatial randomness (CSR) patterns. In addition, the predicted elastic properties were compared with experimental measurements and theoretical prediction methods. The results demonstrate the accuracy and efficiency of the proposed algorithm. This algorithm can quickly generate the RVE of cylindrical fibers and spherical particles with volume fractions of 80% and 62%, and the calculation time for generating the RVE of cylindrical fibers is about 17s. [ABSTRACT FROM AUTHOR]

Copyright of Przeglad Elektrotechniczny is the property of Przeglad Elektrotechniczny 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.)

Anomaly detection is an important field in data science that has been widely researched and applied, generating many methods. Among these methods, the isolation forest algorithm is outstanding because of its efficiency and effectiveness, especially in regard to large-scale data. Unfortunately, this algorithm has some drawbacks, such as being unable to effectively handle local outliers, possibly leading to normal data masking the detection of outliers due to space partitioning along the coordinate axes, and low utilization of training data. To address these issues, in this paper we propose an improved isolation forest algorithm based on multilayer subspace dividing, named layered isolation forest, which adapts to the different distributions of the dataset by dividing the sample space into subspaces and evaluating the anomaly degree of data in different spatial ranges. This algorithm obtains a more accurate and reasonable anomaly score, avoids the problems of the original algorithm, and improves the performance metrics. According to the experimental results, the proposed method maintains the efficiency of the original algorithm and exhibits the best comprehensive performance compared with similar algorithms on artificial synthetic datasets and real-world datasets from multiple domains. • Isolation forest algorithm demonstrates limitations in isolating local anomalies. • Local anomalies are more easily isolated in subspace. • Combining global and local isolation forests enhances anomaly identification. • Layered Isolation Forest (LIF) overcomes traditional isolation forest limitations. [ABSTRACT FROM AUTHOR]

Clustering is a fundamental data analysis task that presents challenges. Choosing proper initialization centroid techniques is critical to the success of clustering algorithms, such as k-means. The current work investigates six established methods (random, Forgy, k-means++, PCA, hierarchical clustering, and naive sharding) and three innovative swarm intelligence-based approaches--Spider Monkey Optimization (SMO), Whale Optimization Algorithm (WOA) and Grey Wolf Optimizer (GWO)--for k-means clustering (SMOKM, WOAKM, and GWOKM). The results on ten well-known datasets strongly favor swarm intelligence-based techniques, with SMOKM consistently outperforming WOAKM and GWOKM. This finding provides critical insights into selecting and evaluating centroid techniques in k-means clustering. The current work is valuable because it provides guidance for those seeking optimal solutions for clustering diverse datasets. Swarm intelligence, especially SMOKM, effectively generates distinct and well-separated clusters, which is valuable in resource-constrained settings. The research also sheds light on the performance of traditional methods such as hierarchical clustering, PCA, and k-means++, which, while promising for specific datasets, consistently underperform swarm intelligence-based alternatives. In conclusion, the current work contributes essential insights into selecting and evaluating initialization centroid techniques for k-means clustering. It highlights the superiority of swarm intelligence, particularly SMOKM, and provides actionable guidance for addressing various clustering challenges. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) is a prominent algorithm that offers great exploration capabilities among various meta-heuristic algorithms. However, its monotonous and one-dimensional search strategy limits its searching performance in the solving process. Thus, to address this issue, a Q-learning based multi-strategy integrated ABC algorithm (QMABC) is proposed. In the QMABC, multiple search strategies are proposed to utilize different individual experiences and search approaches for solution updates. Then, Q-learning is employed for strategy selection. In comparison to previous studies, this paper introduces more effective state and action configurations within the framework of Q-learning. To evaluate the performance of the QMABC, CEC 2017 benchmark functions are adopted to compare it to different meta-heuristic algorithms including ABC based and non-ABC based algorithms. Moreover, applications in path planning are implemented to further verify the effectiveness of the QMABC. Overall, it should be highlighted that the proposed QMABC demonstrates superiority in both numerical and practical experiments. • A Q-learning based multi-strategy integrated ABC algorithm is proposed. • Multiple strategies are introduced to the onlooker bee phase. • Q-learning is utilized to adaptively determine the most suitable strategy. • Novel state and action settings are designed in Q-learning framework. • Proposed algorithm shows superiority in numerical and practical experiments. [ABSTRACT FROM AUTHOR]

Today’s management solutions depend precisely on the successful solution of optimization problems, which are discontinuous, undifferentiated and multimodal. One of the approaches to increase the efficiency of solving optimization problems is bio-inspired algorithms. The object of the study is complex dynamic objects. The subject of the study is the decision-making process in the problems of managing complex dynamic objects. A management method using a bio-inspired algorithm is proposed. The research is based on the goose algorithm – for finding a solution to the state of dynamic objects with a hierarchical structure. Evolving artificial neural networks are used to train goose agents (GA) and an advanced genetic algorithm is used to select the best ones in the combined swarm algorithm. The originality of the proposed method lies in setting GA taking into account the uncertainty of the initial data, improved global and local search procedures. Also, the originality of the study lies in determining GA food locations, which allows choosing the priority of search in a given direction. The next element in the originality of the study is the ability to determine the indicators of guard GA, which allows adjusting the amount of time during which the GA flock will be located. Another original element of the study is the determination of the initial velocity of each GA. This makes it possible to optimize the speed of conducting exploration by each GA in a certain research direction. The method allows increasing the efficiency of data processing at the level of 10–12 % by using additional improved procedures. The proposed method should be used to solve problems of evaluating complex dynamic objects. [ABSTRACT FROM AUTHOR]

The data aggregation process in this study has been enhanced by the hybrid firefly-artificial bee colony algorithm (HFABC) by increasing the average packet delivery ratio, end-to-end delay, and lifespan computation. In this study, HFABC and Multi Hop LEACH are two algorithms that are used to aggregate IoT data. Their performance is compared using evaluation criteria including average End-to-End Delay, PDR, and network lifetime. The HFABC method reduces average End-to-End Delay more effectively than Multi Hop LEACH, with gains of 2.20 to 8.66 %. This demonstrates how well it works to reduce the lag times for data transfer in IoT networks. With improvements ranging from 3.45% to 45.39%, HFABC has a greater success rate than Multi Hop LEACH in effectively delivering packets. HFABC increases network lifetime by 0.047 to 2.286 percent, indicating that it helps keep IoT networks operating for longer. For effective data aggregation in IoT networks, HFABC is a superior solution that decreases delays, improves packet delivery, and lengthens network lifetime. [ABSTRACT FROM AUTHOR]

Path planning is crucial for unmanned surface vehicles (USVs) to navigate and avoid obstacles efficiently. This study evaluates and contrasts various USV path-planning algorithms, focusing on their effectiveness in dynamic obstacle avoidance, resistance to water currents, and path smoothness. Meanwhile, this research introduces a novel collective intelligence algorithm tailored for two-dimensional environments, integrating dynamic obstacle avoidance and smooth path optimization. The approach tackles the global-path-planning challenge, specifically accounting for moving obstacles and current influences. The algorithm adeptly combines strategies for dynamic obstacle circumvention with an eight-directional current resistance approach, ensuring locally optimal paths that minimize the impact of currents on navigation. Additionally, advanced artificial bee colony algorithms were used during the research process to enhance the method and improve the smoothness of the generated path. Simulation results have verified the superiority of the algorithm in improving the quality of USV path planning. Compared with traditional bee colony algorithms, the improved algorithm increased the length of the optimization path by 8%, shortened the optimization time by 50%, and achieved almost 100% avoidance of dynamic obstacles. [ABSTRACT FROM AUTHOR]

An effective security model with low computational complexity, minimal quality-compromised, and improved security robustness is essential due to the rapid expansion of multimedia data communication through different cloud services. An image steganography model has been proposed for the security of multimedia data in an unreliable cloud environment. This study's main goal is to provide efficient steganography with barely hidden information. A secure data communication model has been developed over a cloud environment using the Adaptive Artificial Bee Colony Algorithm and the Optimum Pixel Adjustment Algorithm Based Image Steganography Method. An adaptive ABC (artificial bee colony) technique is applied to select the optimal pixel positions in the cover image because the goal of this investigation is to increase PSNR. The Optimal Pixel Adjustment approach is used to minimise embedding errors while maintaining the stego image's appearance identical to the cover image after embedding. The MATLAB platform is used to implement the proposed method. The results show that the proposed AABC-based OPA is more efficient across all measures investigated during the embedding and extraction processes. [ABSTRACT FROM AUTHOR]