The COVID-19 pandemic has emphasized the crucial role of ventilation systems in mitigating cross-infections, especially in infectious disease hospitals. This study introduces a dual-design operation ventilation system that can operate under two sets of ventilation conditions for normal and epidemic times. A challenge is optimizing duct diameters for required airflow while maintaining hydraulic balance. We design a genetic algorithm with adaptive penalty factor, the velocity constraint and the improved crossover and mutation probability. The improved genetic algorithm is suitable for ventilation system networks, which can find a better air duct diameters combination to improve the hydraulic balance rate, and reduce the usage of air valves, resulting in efficient hydraulic balancing commissioning. Compared with the traditional genetic algorithm, it has a faster search speed and a better global search ability, which is effective for the optimal design of ventilation system networks.

The Double U-pipe ground heat exchanger, recognized for its straightforward process, cost-effectiveness, high heat exchange efficiency, and low thermal resistance, stands as the predominant ground heat exchanger type in today's shallow geothermal energy development and utilization. Recent years have seen significant research into the heat transfer influencing factors and heat exchange performance of Double U-pipe ground heat ex-changers via experimental testing methods. Yet, studies integrating numerical simulation with in-situ testing have been less frequent. Drawing on the cylindrical heat source model theory and the outcomes of regional in-situ thermal response tests, this paper develops a Double U-pipe ground heat transfer model by establishing physical, mathematical, and heat transfer geometric models. It assesses the impact of varying inlet temperatures, flow rates, and initial ground temperatures on heat exchange efficiency under heating conditions. The results validate the precision of the double U-pipe ground heat exchanger model based on in-situ testing. They show that enhancing the temperature differential between the inlet and initial temperatures, elevating the initial ground temperature, and moderately increasing the flow rate can boost the system's heat exchange efficiency.

Pedestrian multi-target tracking technology plays an important role in artificial intelligence, driverless, virtual reality and other fields. The pedestrian multi-target tracking algorithm DeepSORT based on detection is widely used in industry. It mainly tracks multiple pedestrian targets continuously and keeps their ID unchanged. In order to improve the applicability and tracking accuracy of DeepSORT algorithm, this paper improved the IOU distance measurement in the matching process. At the same time, ResNet50 is used as the feature extraction backbone network, and combined with FPN (Feature Pyramid Network), the appearance features of multi-layer pedestrians are fused to improve the tracking accuracy of DeepSORT algorithm. The proposed algorithm is verified on the public data set MOT-16 and it’s tracking accuracy is enhanced to 4.1%.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

This paper proposes a parameter coordination optimization design of Power System Stabilizer (PSS) based on an improved Quasi-Affine Transformation Evolutionary (QUATRE) algorithm to suppress low-frequency oscillation and improve the dynamic stability of power system. To begin, the Simulated Annealing (SA) algorithm randomly updates the globally optimal solution of each QUATRE iteration and matches the inferior solution with a certain probability to escape the local extreme point. This new algorithm is first applied to power system. Second, Since damping ratio is one of the criteria to measure the dynamic stability of power system, this paper sets the objective function according to the principle of maximization of damping coefficient of electromechanical mode, and uses SA-QUATRE to search a group of global optimal PSS parameter combinations to improve the stability margin of the system as much as possible. Finally, the method's rationality and validity were validated by applying it to the simulation examples of IEEE 4-machine 2-area system with different operation states. The comparison with the traditional optimization algorithm shows that the proposed method has more advantages for multi-machine PSS parameter coordination optimization, and can restrain the low-frequency oscillation of power system more effectively and enhance the system stability.

Wearing gloves while operating machinery in workshops is an essential precaution to prevent mechanical injuries and burns from high temperatures, among other potential hazards. Ensuring workers are properly equipped with gloves, which is a crucial measure in accident prevention. Glove images often occupy a minimal proportion of the frame and are easily obscured by cluttered backgrounds, especially with limited edge computing resources. Consequently, this study proposes a glove detection algorithm called YOLOv8-AFPN-M-C2f based on YOLOv8, offering swifter detection speeds, lower computational demands, and enhanced accuracy for workshop scenarios. This research innovates by substituting the head of YOLOv8 with the AFPN-M-C2f network, amplifying the pathways for feature vector propagation, and mitigating semantic discrepancies between non-adjacent feature layers. Additionally, the introduction of a superficial feature layer enriches surface feature information, augmenting the model's sensitivity to smaller objects. To assess the performance of the YOLOv8-AFPN-M-C2f model, we conducted multiple experiments using a factory glove detection dataset compiled for this study. The results indicate that the enhanced YOLOv8 model surpasses other network models. Compared to the baseline YOLOv8 model, the refined version shows a 2.6% increase in mAP@50%, a 90.1% rise in FPS, and a 13% reduction in the number of parameters. This research contributes an effective solution for the detection of glove adherence.

Deadlock is a real problem that can cause expensive, time-dependent hang-ups or failures in distributed computing systems. Some studies have been conducted with deadlock detection and resolution in generalized request computing models, most of these studies are based on the diffusing computation scheme, where forward and backward propagated probe and reply messages respectively are diffused between dependent processes. The replies carry the dependency information between processes for the initiator. Using this dependency information initiator can detect and resolve the deadlock cycle. It has been proven in the literature that a deadlock cycle length distribution is skewed with a large majority of cycles (90%) having length two. Based on this fact an improved algorithm is proposed for handling deadlock detection in distributed computing systems under the distributed request model where each process has several requests at a time. The improved algorithm depends mainly on message propagation and timeout policy. Probe and reply messages are propagated between the initiator and its successors only to detect deadlock cycles between them. Global timeout policy is used to detect potential deadlock cycles with large length distribution. The proposed algorithm can handle concurrent executions. Simulation experiments are performed to see the effectiveness of the improved algorithm. It is found that the improved algorithm compares favorably with other existing algorithms and it shows better results for several performance metrics especially in reducing deadlock latency and execution time.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

Forest fires are one of the world's deadliest natural disasters. Early detection of forest fires can help minimize the damage to ecosystems and forest life. In this paper, we propose an improved fire detection method YOLOv5-IFFDM for YOLOv5. Firstly, the fire and smoke detection accuracy and the network perception accuracy of small targets are improved by adding attention mechanism in the backbone network. Secondly, the loss function is improved and the SoftPool pyramid pooling structure is used to improve the regression accuracy and detection effect of the model and the robustness of the model. In addition, random Mosaic augmentation technique is used to enhance the data to increase the generalization ability of the model, and re-clustering of flame and smoke detection a priori frames are used to improve the accuracy and speed. Finally, the parameters of the convolutional and normalization layers of the trained model are homogeneously merged to further reduce the model responsibility to improve the detection speed. Experimental results on homemade forest fire and smoke datasets show that this algorithm has high detection accuracy and fast detection speed, with average accuracy of fire up to 90.5% and smoke up to 84.3%, and detection speed up to 75 FPS (frames per second transmission), which can meet the requirements of real-time and efficient fire detection.

Aiming at the problems that the parameters of YOLOv5s model are too large and the computing resources of development board memory are limited, a new target detection method based on deep learning YOLOv5 algorithm model is proposed. First, the light-weight module Gz-ShffleNetv2 is used to construct cotton top bud feature extraction unit, which reduces the number of parameters and improves the running speed. It can be better applied in image classification, speed up detection and meet the requirements of mobile end of development board. Secondly, in order to solve the problem of decreasing detection accuracy caused by lightweight, BotNet and C3SE attention mechanism are added to focus on specific areas of cotton terminal bud. Combined with YYG loss function XIOU boundary frame regression loss, more feature information and rich feature MAP were obtained to further improve the accuracy of target detection. Through analysis of research and experimental results, the average accuracy map reached 91.3% under the Windos system NVIDIA Geforce RTX 2060 SUPER detection. While maintaining high precision identification, the number of parameters of YOLOv6 and YOLOv7-tiny network model is reduced by 83% and 53%, respectively, and the detection accuracy is increased by 1.2% and 7.7%, respectively. Compared with YOLOv5 reasoning image, the speed of image is increased by 0.035s, and the detection accuracy of MAP_0.5:0.95 is increased by 1%. At the same time, PyQt5 and YOLOv5 target detection algorithms are used to design a cotton top bud identification system, which makes cotton top bud detection more intuitive and convenient for subsequent hardware development and use.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

The weight coefficients of the diaphragm spring depend on experiences in the traditional optimization. However, this method not only cannot guarantee the optimal solution but it is also not universal. Therefore, a new optimization target function is proposed. The new function takes the minimum of average compress force changing of the spring and the minimum force of the separation as total objectives. Based on the optimization function, the result of the clutch diaphragm spring in a car is analyzed by the non-dominated sorting genetic algorithm (NSGA-II) and the solution set of Pareto is obtained. The results show that the pressing force of the diaphragm spring is improved by 4.09%by the new algorithmand the steering separation force is improved by 6.55%, which has better stability and steering portability. The problem of the weight coefficient in the traditional empirical design is solved. The pressing force of the optimized diaphragm spring varied slightly during the abrasion range of the friction film, and the manipulation became remarkably light.

This article describes the choice of an optimization algorithm for solving problems and the optimal design of an unmanned aerial vehicle propeller. To solve the problem using evolutionary algorithms, it was transformed into an unconstrained optimization problem using a penalty function. The airfoil contours were constructed using a Bezier curve. Design variables were divided into two types: those that describe in general terms the propeller geometry or operation, such as propeller diameter, number of blades, and rev/min; and those that vary with propeller radius, such as chord length, effective airfoil angle, and airfoil geometry. The objective function is the calculation of the propeller power required to achieve a given thrust. The differential evolution algorithm was used to solve this problem.

This study presents the synthesis and electrochemical evaluation of nitrogen-doped vanadium oxide (N-V2O3/C) as a cathode material for aqueous zinc-ion batteries (AZIBs), using a hydrothermal method. Compared to undoped V2O3/C, N-V2O3/C exhibits enhanced electrical conductivity, capacity, and electrochemical kinetics, attributed to the incorporation of pyridinic and pyrrolic nitrogen. Initial charge-discharge cycles indicate phase transitions to amorphous vanadium oxides, enhancing conductivity. N-V2O3/C shows a high specific capacity of 168.4 mAh g−1 at 10 A g−1 and remarkable reversibility, highlighted by the transient existence of intermediate species during cycling. Optimal electrochemical performance is achieved with a vanadium to nitrogen molar ratio of 2:3, indicating the significant impact of nitrogen doping concentration on the material’s efficiency. This work underscores the potential of N-V2O3/C as a superior cathode material for AZIBs.

Using density functional theory (DFT), the density of states of NH4V3O8 (NVO) was analyzed pre and post-oxygen defects (Od) formation. The findings revealed a reduced bandgap in NVO after Od introduction, emphasizing the role of Od in enhancing conductivity of the material, thus improving its electrochemical attributes. Through the water bath method, both NVO and its oxygen-deficient counterpart, (NH4)2V10O25⸱8H2O (NVOd), were synthesized as potential cathode materials for aqueous zinc-ion batteries (AZIBs). Experimental outcomes resonated with DFT predictions, highlighting the beneficial role of oxygen defects in boosting electrical conductivity. Notably, the refined material displayed a remarkable capacity of 479.3 mAh g-1 at 0.1 A g-1, underscoring its promise for advanced energy storage solutions.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

Land cover segmentation, a fundamental task within the domain of remote sensing, boasts a broad spectrum of application potential. In this article, we focus on the land cover segmentation tasks and complete the following research work: Firstly, to address the issues of uneven distribution of foreground and background and significant differences in target scales in remote sensing images, we propose a decoder called MDCFD based on multi-dilation rate convolution fusion. The decoder utilizes dilated convolution to expand the receptive field, enhancing the model's ability to capture global features and thus improving the model's ability to distinguish between foreground and background. Meanwhile, we design a multi-dilation rate convolution fusion module (MDCFM), which fuses the outputs of different dilation rate convolution layers. Secondly, aiming at the problems of diverse scenes, significant differences between categories, and many background interferences in remote sensing images, we propose a hybrid attention module called LKSHAM based on large kernel convolution. This module combines spatial attention and channel attention mechanisms and combines the two attention modules in series. By introducing large kernel convolution, the model's ability to extract contextual information is improved. At the same time, we adopt a strategy of decomposing large kernel convolution into multiple depthwise convolutions to reduce computational complexity. The improved network models designed by this paper can achieve an improvement of over 1.1% in the mIoU metric on segmentation tasks on the Potsdam and Vaihingen datasets.

Aiming at the problem that dynamic targets in indoor environments lead to low accuracy and large errors in the localization and position estimation of visual SLAM systems and the inability to build maps containing semantic information, a semantic visual SLAM algorithm based on the semantic segmentation network DeepLabV3+ and LK optical flow is proposed based on ORB-SLAM2 system. First, the dynamic target feature points are detected and rejected based on the lightweight semantic segmentation network DeepLabV3+ and LK optical flow method. second, the static environment occluded by the dynamic target is repaired using the time-weighted multi-frame fusion background repair technique. Lastly, the filtered static feature points are used for feature matching and position calculation. Meanwhile, the semantic labeling information of static objects obtained based on the lightweight semantic segmentation network DeepLabV3+ is fused with the static environment information after background repair to generate dense point cloud maps containing semantic information, and the semantic dense point cloud maps are transformed into semantic octree maps using the octree spatial segmentation data structure. The localization accuracy of the visual SLAM system and the construction of the semantic maps are verified using the TUM RGB-D widely used dataset and real scene data, respectively. The experimental results show that the proposed semantic visual SLAM algorithm can effectively reduce the influence of dynamic targets on the system, has a higher localization accuracy, and compared with other advanced algorithms, such as DynaSLAM, has the highest performance in indoor dynamic environments while considering both localization accuracy and real-time performance. In addition, semantic maps can be constructed so that the robot can better understand and adapt to the indoor dynamic environment.

Because of the rapid advancement in the use of photovoltaic (PV) energy systems, it has become critical to look for ways to improve the energy generated by them. The extracted power from the PV modules is proportional to the output voltage. The relationship between output power and array voltage has only one peak under uniform irradiance, whereas it has multiple peaks under partial shade circumstances (PSC). There is only one global peak (GP) and many local peaks (LPs), where the typical maximum power point trackers (MPPT) may become locked in one of the LPs, significantly reducing the PV system's generated power and efficiency. The metaheuristic optimization algorithms (MOAs) solved this problem, albeit at the expense of the convergence time, which is one of these algorithms' key shortcomings. Most MOAs attempt to lower the convergence time at the cost of the failure rate and the accuracy of the findings because these two factors are interdependent. To address these issues, this work introduces the dandelion optimization algorithm (DOA), a novel optimization algorithm. The DOA's convergence time and failure rate are compared to other modern MOAs in critical scenarios of partial shade PV systems to demonstrate the DOA's superiority. The results obtained from this study showed substantial performance improvement compared to other MOAs, where the convergence time is reduced to 0.4 s with zero failure rate compared to 0.9 s, 1.25 s, and 0.43 s for other MOAs under study. The optimal number of search agents in the swarm, optimal initialization of search agents, and optimal design of the dc-dc converter is introduced for optimal MPPT performance.

Previously, we described the initial use of Flipped Team‐Based learning (FTBL) defined as TBL approach combined with flipped classroom learning methodology, in which students previewed online lectures and applied their knowledge in different in-class activities. The purpose of the present study is to review the progress within this approach and to investigate how constant changes in team allocation can affect student’s perception regarding this modified FTBL approach. Although students showed reluctance initially to get out of their ‘comfort zone’, our findings show that learners perceived the adoption of the continued random allocation, and became accustomed to this learning approach, which finally assisted them to enhance their team-work skills and classroom performance, to develop their reflective capabilities as well as improving their rapport building skills, learning and academic performance. Learners also believed that this learning strategy that creates critical incidents can simulate their future work environment as they might be expected to work in unfamiliar situations. Therefore, the present study indicated strong support for the modified FTBL method and was seen to work exceptionally well, despite some minor problems that students can experience working in a team and/or with different teammates in every session.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

Underwater target detection is widely used in various applications such as underwater search and rescue, underwater environment monitoring, and Marine resources survey. However, the visibility of the underwater environment and the accuracy of target detection can be affected by complex underwater light changes and unpredictable background noise. To address these issues, we propose an improved underwater target detection algorithm based on YOLOv8n. Our algorithm focuses on three aspects. Firstly, we replace the original C2f module with Deformable Convnets v2 to enhance the adaptive ability of the target region in the convolution check feature map and extract the target region's features more accurately. Secondly, we introduce SimAm, a non-parametric attention mechanism, which can deduce and assign three-dimensional attention weights without adding network parameters. Lastly, we optimize the loss function by replacing the CIOU loss function with the Wise-IOU loss function. To conduct our experiments, we create our own dataset of underwater target detection for experimentation. Meanwhile, we also utilized the Pascal VOC dataset to evaluate our approach. The [email protected] and [email protected]:0.95 of the original YOLOv8n algorithm on the underwater target detection were 88.6% and 51.8%, respectively, and the improved algorithm [email protected] and [email protected]:0.95 can reach 91.8% and 55.9%. The original YOLOV8n algorithm was 62.2% and 45.9% [email protected] and [email protected]:0.95 on the Pascal VOC dataset, respectively. The improved YOLOV8n algorithm [email protected] and [email protected]:0.95 were 65.7% and 48.3%, respectively. The floating-point computation volume of the model is reduced by about 6%. The above experimental results prove the effectiveness of our method.

This paper proposed a triangular inequality-based rewiring method for the Rapidly exploring Random Tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

Traditional path planning algorithms have drawbacks in unmanned vehicle path planning, such as low efficiency, unsuitability for dynamic environments, and high computational complexity. To address these issues, this paper proposes a dynamic path planning method for unmanned vehicles that combines the A* algorithm with an improved Dynamic Window Approach (DWA). Firstly, a collision risk function is incorporated into the DWA algorithm to evaluate scores based on the braking distance corresponding to the current vehicle speed and the distance to obstacles, determining whether timely braking or obstacle avoidance is feasible. The earlier the braking or obstacle avoidance, the higher the score, thereby enhancing the evaluation algorithm of the DWA. Secondly, the key points extracted by the A* algorithm are used as temporary target points for the DWA algorithm, reducing the eight search directions to five. Finally, the key points of the A* algorithm’s path are set as the temporary end points for the DWA algorithm, integrating the two algorithms to plan a smoother curved path that can avoid unknown and dynamic obstacles. Simulation data demonstrates that compared to traditional artificial potential field methods, RRT, and Dijkstra’s algorithm, the new fusion algorithm reduces time by 11.71 seconds, a decrease of 6.9%, and shortens path length by 3.093 meters, a reduction of 4.16%, while increasing average linear velocity by 2.9%. The proposed algorithm ensures smoother paths while also making paths more rational and efficient

This study reports on the development of bio-based hydrophobic coatings for packaging papers through deposition of polyhydroxybutyrate (PHB) particles in combination with nanofibrillated cellulose (NFC) and plant wax. In a first approach, PHB particles in micrometer range (PHB-MP) were prepared through a phase-separation technique providing internally nanosized structures. The particles were transferred as a coating by dip-coating filter papers in the particle suspension, followed by sizing with a carnauba wax solution. This approach allowed partial to almost full surface coverage of PHB-MP over the paper surface resulting in static water contact angles of 105° to 122° and 129° to 144° after additional wax coating. In a second approach, PHB particles with submicron sizes (PHB-SP) were synthesized by an oil-in-emulsion (o/w) solvent evaporation method, and mixed in aqueous suspensions with 0 to 7 wt% NFC. After dip-coating filter papers in PHB-SP/NFC suspensions and sizing with a carnauba wax solution, static water contact angles of 112° to 152° were obtained. The intrinsic properties of the particles were analyzed by scanning electron microscopy, thermal analysis and infrared spectroscopy, indicating higher crystallinity for PHB-SP than PHB-MP. The chemical interactions between the more amorphous PHB-MP particles and paper fibers were identified as an esterification reaction, while the morphology of the NFC fibrillar network was playing a key role as binding agent in the retention of more crystalline PHB-SP at the paper surface, hence contributing to higher hydrophobicity.

This study introduces an advanced dual-mode composite attitude control framework for reusable launch vehicles (RLVs), underpinned by an enhanced particle swarm optimization (PSO) algorithm. This innovative strategy is tailored to meet the stringent demands for precision and robust anti-interference capabilities across the entire flight envelope of RLVs. The research commences with the formulation of a comprehensive attitude dynamics model and diverse heterogeneous actuator representations, meticulously crafted to reflect the distinct phases of RLV flight. Building upon this foundation, a synergistic control paradigm is engineered, integrating PID and fuzzy PID controllers, complemented by a refined fitness evaluation function. The crux of the study is the application of an upgraded PSO algorithm to fine-tune the controllers' weighting coefficients, culminating in an optimized dual-mode composite attitude control system. A series of comparative simulation analyses are meticulously executed to appraise the system's responsiveness, stability, precision, and resilience to interference. The findings unequivocally substantiate the superior performance of the proposed control system, affirming its substantial contribution to the advancement of RLV attitude control.

The Complete Coverage Path Planning (CCPP) is a key technology in the field of agricultural robot, and has great significance for improving the efficiency and quality of tillage, fertilization, harvesting and other agricultural robot operations, as well as reducing the operation energy consumption. The traditional boustrophedon or heuristic search algorithm based CCPP methods, when coping with the field with irregular boundaries, obstacles and other complex environments, still face many problems and challenges, such as large repeated work areas, multiple turns or U-turns, low operation efficiency and prone to local optimum. In order to solve the above problems, an improved-genetic-algorithm-based CCPP method was proposed in this paper, which introduces the idea of chromosome pairs and multi-points mutation to improve its global optimization ability in complex environments, reduce the repeated work areas and the number of turns and U-turns, and thereby improve the operation efficiency. The simulation and experimental results on simple regular fields showed that the proposed improved genetic algorithm-based CCPP method achieved the comparable performance with the traditional boustrophedon-based CCPP method. However, on the complex irregular fields, although the proposed CCPP method increased the number of turns by 13.76%, the area of repeated operation and the number of U-turns were decreased by 38.54% and 35.00% respectively, and saves the battery voltage by 7.82% on average compared to the boustrophedon-based CCPP method. This proved that the proposed CCPP method has strong adaptive capacity to the environment, and has practical application value in improving the efficiency and quality of agricultural machinery operations, and reducing the energy consumption.

Some traditional robots are based on offline programming reciprocal motion, and with the continuous upgrading of vision technology, more and more tasks are replaced by machine vision. For the current problem of insufficient accuracy of robot target localization based on binocular vision, and an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance For the current problem of insufficient accuracy of robot target localization based on binocular vision, an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance of multi Firstly, the RANSAC algorithm is improved based on the SURF algorithm; then the parallax gradient method is applied to iterate the matched point pairs several times to further optimize the data; then the 3D reconstruction is completed by the program technique; finally the obtained data is finally the obtained data is input into the robot arm and the camera internal and external parameters are obtained by the calibration method so that the robot can accurately locate and The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi- The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi-vision system.

The paper aims at presenting the results obtained in the development of a system allowing the detection and monitoring of forest fires and the continuous comparison of their intensity when several events occur simultaneously, as usually happens in the European Mediterranean countries during the summer season. The system, called SFIDE (Satellite FIre DEtection), exploits a geostationary satellite sensor (SEVIRI on board of MSG satellite series). The algorithm was developed several years ago in the framework of a project (SIGRI) funded by the Italian Space Agency (ASI). This algorithm has been completely reviewed in order to enhance its efficiency by reducing false alarms rate preserving a high sensitivity. Due to the very low spatial resolution of SEVIRI images (4x4 km² at Mediterranean latitude) the sensitivity of the algorithm should be very high to detect even small fires. The improvement of the algorithm has been obtained by: introducing the sun elevation angle in the computation of the preliminary thresholds to identify potential thermal anomalies (hot spots), introducing a contextual analysis in the detection of clouds and in the detection of night-time fires. The results of the algorithm have been validated in the Sardinia region by using ground true data provided by the regional Corpo Forestale e di Vigilanza Ambientale (CFVA). A significant reduction of the commission error (less than 10%) has been obtained with respect to the previous version of the algorithm and also with respect to fire-detection algorithms based on low earth orbit satellites.

Abstract In order to solve the problem that it is difficult to obtain the accurate trigger signal moment when using the time difference of UAV flight acoustic signals collected by acoustic sensors arranged in advance to locate the position of UAVs when they cannot be tracked by radar and are difficult to be observed by the human eye, an acoustic source localisation method with improved empirical modal decomposition (REMD) under an adaptive frequency window is proposed. Firstly, the collected UAV flight signals are smoothed and filtered, then the robust empirical modal decomposition (REMD) is used for IMF modal decomposition and spectral analysis of the collected signals, and a panning frequency window with variable bandwidth is introduced for corresponding frequency locking and extracting the IMFs; the GWO optimisation is used and the sliding metrics are set to determine the position of the panning frequency window automatically; finally, the extracted Finally, the extracted IMF components are reconstructed according to the criterion, and the trigger signal moments in the reconstructed IMF components are resolved and recorded, and the algorithm is used to calculate the difference between the reception moments of different sensors; for the traditional sound source localisation algorithms with a small detection range, which are prone to fall into the no-solution or false-solution, i.e., unable to achieve the localisation, a weighted least-squares-based Chan-Taylor algorithm is proposed for the localisation computation, and a weighted least-squares algorithm is proposed for the localisation computation, through the Inputting the sensor delay parameter and solving the linear equation system to get the target position information; finally, this paper verifies the robustness and performance of the design method with simulated and actual signals. The results show that the maximum positioning error is no more than 5% in an area with a side length of 15m in the measurement area. With the improved accuracy of time delay estimation, the positioning simulation results meet the positioning requirements even though the positioning error is further expanded when the measurement area is further expanded.

Earth observation satellites can capture images of specific areas in Earth's orbit based on user requirements. Despite the high demand for satellite imagery, satellites remain a scarce resource. When there are many observation tasks that are large and dense, they may interfere with each other due to satellite mobility. To address this issue, a multi-satellite scheduling algorithm based on a task merging mechanism has been proposed. This paper proposes a two-stage approach to the problem: task merging phase and merging task scheduling phase. The task merging phase introduces two methods based on Mean Shift and Complete Graph to generate the merging task set. In the merging task scheduling phase, a multi-satellite scheduling algorithm based on merging tasks is employed to solve the problem. Finally, certain measurement experiments suggest the effectiveness of the algorithm.

Amid the swift progression of the global automobile industry, the aspiration for lightweight vehicle design has surfaced as a crucial approach to boost fuel efficiency and curtail environmental impact. The objective of this study revolves around achieving holistic optimization of vehicle structure via detailed scrutiny of vehicle process characteristics, amalgamated with a Back Propagation neural network (BPNN) optimized by a genetic algorithm (GA) and a topology optimization (TO) method.The process initiates with an examination of the vehicle's technical characteristics, succeeded by an optimization protocol that couples GA with BPNN. This exhaustive optimization procedure derives the best-fit values of design parameters and identifies the globally optimal lightweight design approach. Subsequently, a comprehensive structural optimization is actualized by modifying the topological distribution of the structure.A simulation experiment of the conceptual car body beam skeleton is conducted as a conclusive step, and the anti-collision capacity of the car body beam skeleton is assessed by measuring deformation intrusion. The findings reveal that in the vehicle topology optimization, a comparative analysis of pre and post-optimization results indicates an improved topological density across diverse sections. The topological density of the vehicle's frontal structure escalates from 0.75 to 0.8. Following optimization, the stiffness assessment records a marginal increase (within the range of 0.02–0.05), implying that the lightweight design does not compromise the general rigidity of the structure.The optimized body structure manifests superior crashworthiness in the crash test: the deformation intrusion diminishes by 27% in front-end collisions. In side impacts, the deformation and intrusion at critical points are reduced by 13.15% to 10% respectively. The comprehensive method proposed herein proves to be an efficient strategy to actualize the lightweight design of vehicles.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

Enhancing underwater images in epicontinental sea is a challenging problem owing to the influence of ocean currents, the refraction, absorption and scattering of light by suspended particles, and the weak illumination intensity. Recently, different methods have relied on the underwater image formation model and deep learning techniques to restore the underwater image, but they tend to degrade underwater image, interference of background clutter and miss boundary details of blue regions. Improved image fusion and enhancement algorithm based on a priori dark channel is proposed in this paper. Image edge features sharpening and dark detail enhancement by homomorphism filtering in CIELab color space is realized. In RGB color space, the multi-scale retinal with color restoration (MSRCR) algorithm is used to improve color deviation and enhance color saturation, and the contrast-limited adaptive histogram equalization (CLAHE) algorithm is used to de fog and enhance image contrast. Finally, according to the dark channel images of the three processing results, the final enhanced image is obtained by linear fusion of multiple images and multiple channels. Experimental results demonstrate the effectiveness and practicality of the proposed method on various datasets.

Mental stress state recognition using electroencephalogram (EEG) signals for real-life applications needs a conventional wearable device. This requires an efficient number of EEG channels and an optimal feature set. The main objective of the study is to identify an optimal feature subset that can best discriminate mental stress states while enhancing the overall performance. Thus, multi-domain feature extraction methods were employed, namely, time domain, frequency domain, time-frequency domain, and network connectivity features, to form a large feature vector space. To avoid the computational complexity of high dimensional space, a hybrid feature selection (FS) method of minimum Redundancy Maximum Relevance with Particle Swarm Optimization and Support Vector Machine (mRMR-PSO-SVM) is proposed to remove noise, redundant, and irrelevant features and keep the optimal feature subset. The performance of the proposed method is evaluated and verified using four datasets, namely EDMSS, DEAP, SEED, and EDPMSC. To further consolidate, the effectiveness of the proposed method is compared with that of the state-of-the-art heuristic methods. The proposed model has significantly reduced the features vector space by an average of 70% in comparison to the state-of-the-art methods while significantly increasing overall detection performance.

In this paper, a multi-patch weakly singular isogeometric boundary element method (WSIGABEM) for two-dimensional elastostatics is proposed. Since the method based on the weakly singular boundary integral equation, the quadrature techniques, dedicated for the weakly singular and regular integrals, are applied in the method. A new formula for the generation of collocation points is suggested to take the full advantage of the multi-patch technique. The generated collo-cation points are essentially inside the patches without any correction. If the boundary conditions are assumed to be continuous in every patch, no collocation point lies on the discontinuous boundaries, thus simplifying the implementation. The multi-patch WSIGABEM is verified by the simple examples with analytical solutions. The feature of the present multi-patch WSIGABEM is investigated by the comparison with the traditional IGABEM. Furthermore, the combination of the present multi-patch WSIGABEM and the particle swarm optimization algorithm results in a shape optimization method in two-dimensional elastostatics. By changing some specific control points and their weights, the shape optimizations of the fillet corner, the spanner and the arch bridge are verified to be effective.

This paper proposes a new approach for multi-focus images fusion based on Region Mosaicing on Contrast Pyramids (REMCP). A density-based region growing method is developed to construct a focused region mask for multi-focus images. The segmented focused region mask is decomposed into a mask pyramid, which is then used for supervised region mosaicking on a contrast pyramid. In this way, the focus measurement and the continuity of focused regions are incorporated and the pixel level pyramid fusion is improved at the region level. Objective and subjective experiments show that the proposed REMCP is more robust to noise than compared algorithms and can fully preserves the focus information of the multi-focus images meanwhile reducing distortions of the fused images.

Clustering is a crucial at the same time challenging task in several application domains. It is important to incorporate the optimum feature finding into our clustering algorithms for getting better prediction accuracy but this is difficult when there is no or little information about the importance or relevance of features. To tackle this task in an efficient manner we employ the natural evolution process inherent in genetic algorithms (GA) to find the optimum features for clustering for the healthy aging dataset. In order to empirically verify the findings, genetic algorithms were combined with a number of clustering algorithms including parti-tional, density based as well as agglomerative. A variant of the popular KMeans algorithm, named KMeans++ gave the best performance on all performance metrics when combined with GA.

The market for microfluidic chips is experiencing significant growth; however, their development is hindered by a complex design process and low efficiency. Enhancing microfluidic chips’ design quality and efficiency has emerged as an integral approach to foster their advancement. Currently, the existing structural design schemes lack careful consideration regarding the impact of chip area, microchannel length, and the number of intersections on chip design. This inadequacy leads to redundant chip structures resulting from the separation of layout and wiring design. This study proposes a structural optimization method for microfluidic chips to address these issues utilizing a simulated annealing algorithm. The simulated annealing algorithm generates an initial solution in advance using the fast sequence pair algorithm. Subsequently, an improved simulated annealing algorithm is employed to obtain the optimal solution for the device layout. During the wiring stage, an advanced wiring method is used to designate the high wiring area, thereby increasing the success rate of microfluidic chip wiring. Furthermore, the connection between layout and routing is reinforced through an improved layout adjustment method, which reduces the length of microchannels and the number of intersections. Finally, the effectiveness of the structural optimization approach is validated through six sets of test cases, successfully achieving the objective of enhancing the design quality of microfluidic chips.

Water distribution networks are vital infrastructure, needed for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of the optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of a computer program, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies Genetic Algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, Genetic Algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed program was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.

Pavement crack detection is one of the key links in highway pavement maintenance management. In the current road crack detection, the network model easily ignores the shallow geometric features of cracks and cannot extract the key feature information of cracks. Aiming at the above problems, an EC-YOLOX network model is proposed. The CFPN is constructed to cross-fuse different scale features to solve the feature scale invariance. In the strengthen feature extraction layer, ECANet is fused to enhance the ability to pay attention to key information. The WEIoU loss function is proposed, which assigns different penalty terms to the target box in the vertical and horizontal directions. In terms of data, geometric distortion constraint correction is performed on the single-point perspective pavement image. The experimental data show that the accuracy of EC-YOLOX on the self-built data set reaches 76.34% [email protected], which is 4.45% higher than that of YOLOX. The loss curve of EC-YOLOX is smoother than that of YOLOX, and the minimum training loss value is 2.136, which is 0.648 lower than the minimum loss value 2.784 of YOLOX. Many experiments have verified the effectiveness of EC-YOLOX in improving the detection effect in pavement crack detection.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

Cyber-Physical Systems (CPS) play an essential role in today’s production processes, leveraging Artificial Intelligence (AI) to enhance operations such as optimization, anomaly detection, and predictive maintenance. This article reviews a cognitive architecture for artificial intelligence, which has been developed to establish a standard framework for integrating AI solutions into existing production processes. Given that machines in these processes continuously generate large streams of data, Online Machine Learning (OML) was identified as a crucial extension to the existing architecture. To substantiate this claim, real-world experiments using a slitting machine were conducted to compare the performance of OML with traditional Batch Machine Learning. The evaluations clearly indicate that OML adds significant value to CPS and is strongly recommeded as an extension of related architectures such as the cognitive architecture for AI discussed in this article. Additionally, surrogate model-based optimization is employed to determine the optimal hyperparameter settings for the corresponding OML algorithms, aiming to achieve peak performance in their respective tasks.

Railway transportation is one of the main modes of long-distance coal transportation, and it is inevitable to cause environmental pollution during the transportation process. In order to improve the environment along the railway and increase the utilization rate of coal resources, this paper proposes a detection algorithm for scattered coal solidification layer during transportation based on the YOLO v8 model, and designs an intelligent recognition model suitable for coal solidification layer detection devices by combining fluorescence detection methods. Through experimental analysis, the model meets the requirements of practical detection and plays a crucial role in environmental protection, with strong practical application value.

To address the large hysteresis and susceptibility to instability in high-speed deposition fusion moulding (FDM) 3D printing’s temperature control, this paper proposes an improved ant-lion optimization algorithm (OCALO) to optimize the PID parameters.The improvement aims to solve the problem that the traditional ant-lion optimization algorithm (ALO) reduces the population diversity and tends to fall into the local optimal solution when it is close to the global optimal solution.The generation of the initial solution is enhanced by the introduction of a new Tent-Logistic-Cotangent composite chaotic mapping. This integration into Elite Opposition-Based Learning aids in optimizing population diversity. Concurrently, the incorporation of cosine factors of a specified parameter into the elitist formula of the traditional ALO algorithm is aimed at reducing the tendency of ants to randomly gravitate towards ant-lions with lower fitness values. This adjustment helps in balancing the exploration-exploitation trade-off in the algorithmic process. Compared with two existing classical algorithms and three improved ALO algorithms, the algorithm improves the convergence speed, global search ability and the ability to jump out of the local optimal solution. The improved algorithm was combined with PID control to design an OCALO-PID temperature controller and simulated on a high-speed 3D printing temperature model identified by modelling. The results show that the method improves the transient and steady-state performance of reactor temperature control with good control accuracy and robustness. Finally, the proposed algorithm is applied to a physical experimental platform to verify the feasibility of the algorithm.

Calligraphy works have high artistic value, but there is a rampant problem of forgery. Indeed, authentication of traditional calligraphy heavily relies on calligraphers' subjective judgment. Therefore, spurred by the recent development of neural networks, this paper proposes a method for authenticating calligraphy works based on an improved EfficientNet network. Specifically, the developed method utilizes the character box algorithm and the centroid algorithm to extract individual calligraphy characters, which are then augmented and used as the training set for the model. The training process employs CBAM and Self-Attention modules to enhance the attention mechanism of the EfficientNet network. The model is tested on authentic works, imitated works, and works from other calligraphers and is compared with other networks. The experimental results demonstrate that the proposed method effectively achieves the authentication of calligraphy works, and the improved CBAM-EfficientNet network and SA-EfficientNet network achieve better authentication performance.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

A methodology for selecting rational parameters of atmospheric aircrafts at the initial stages of design using an optimization algorithm of differential evolution and numerical mathematical modeling of aerodynamics problems is proposed. The technique involves the implementation of weight and aerodynamic balance in the main flight modes, has the ability to consider atmospheric aircrafts with one or two lifting surfaces, apply parallel calculations and automatically generate a three-dimensional geometric model of aircraft appearance based on the optimization results. A method for accelerating the process of optimizing the parameters of an aircraft in terms of take-off weight by more than three times by introducing a objective function into a set of design variables is proposed and demonstrated. The results of assessing the reliability of the used mathematical models of aerodynamics and the correctness of the calculation the objective function, taking into account various constraints, are presented. A comprehensive test of the performance and efficiency of the methodology is considered by solving demonstration problems to optimize more than ten main design parameters the appearance of two existing heavy-class unmanned aerial vehicles with known characteristics from open sources.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

With the continuous breakthrough of natural language processing, the application of intelligent question answering technology in electric power system has attracted wide attention. However, at present, the traditional question answering system has poor performance and is difficult to be applied in engineering practice. This paper proposes an improved BERTserini algorithm for intelligent answering of electric power regulations based on a BERT model. The proposed algorithm is implemented in two stages. The first stage is the text segmentation stage, where a multi-document long text preprocessing technique is utilized that accommodates the rules and regulations text, and then Anserini is used to extract paragraphs with high relevance to the given question. The second stage is answer generation and source retrieval stage, where a two-step fine-tuning based on the Chinese BERT model is applied to generate precise answers based on given questions, while the information regarding documents, chapters, and page numbers of these answers are also output simultaneously. The algorithm proposed in this paper eliminates the necessity for manual organization of professional question-answer pairs, thereby effectively reducing the manual labor cost compared to traditional question answering systems. Additionally, this algorithm exhibits a higher degree of exact match rate and a faster response time for providing answers.

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

This paper introduces new improvements to the modified version of the BIRECT (BI secting RECTangles) algorithm referred to as BIRECTv. We explore various approaches, by first including a grouping strategy for hyper-rectangles having almost the same sizes by categorizing them into different classes. Therefore constraining them not to exceed a certain pre-defined threshold (a small positive value to define the tolerance level). This approach allows for more efficient computation and can be particularly useful when dealing with a large number of hyper-rectangles with varying sizes. To avoid over-sampling, and preventing redundant or excessive sampling, at some shared vertices in descendant subregions, a particular vertex database is used to limit the number of samples taken within each subregion to two. The experimental investigation shows that these improvements have a positive impact on the performance of the BIRECTv(imp.) algorithm and the proposal is a promising global optimization algorithm compared to the original BIRECTv algorithm and its variants. Additionally, the BIRECTv(imp.) algorithm showed particular efficacy in solving high-dimensional problems.

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. Firstly, the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction, were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and its application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption, 0.094 s, compared with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can enhance the new & old soil boundary effectively than any other methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering, meanwhile, has the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new & old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

The eddy current loss should be optimized to be as less as possible for the stability of permanent magnet in high speed permanent magnet synchronous motor (HSPMSM) rotor and ensure the high efficiency and low temperature of the motor. This paper analyzes the eddy current distribution in rotor, with consideration of the conflict of the thickness of sleeve and diameter of the rotor, calculating the eddy current loss (ECL) and the thermal distribution via Separation of variables method for solving Maxwell's equations with analytical hieratical model of ECL constructed. The optimization result of ECL of the HSPMSM whose power and rated speed is 30kw 48000r/min can be got by multi-objective optimization method, combined weighting coefficient method and traversal algorithm based on chaotic local search particle swarm optimization (CLSPSO), utilizing ECL analytical model and other analytical constraints. Related experiment and measurement has been implemented with new approach of loss separation.

Has anyone ever missed an event because he was confused in days and dates? Do we remember the date of any day without looking at a calendar? Is the current Gregorian Calendar efficient enough for use, and does it facilitate our life or make it more complicated? Have you ever thought about a much simpler way to calculate days and dates in a year? All these questions are answered in this paper, in which the author proposes original optimization algorithm that creates optimal perennial calendars. Results show that there is more than one way to create a perennial calendar, in which the number of days in each month does not change, neither the dates. Hence, all months have the same sequence of days and dates. In other meaning, Monday becomes the first day of every month, and Sunday becomes the last day. Consequently, the calendars become much easier to memorize and very simple to predict the days and dates in any year.

The aim of this review was to summarize the available literature regarding resident and medical student education utilizing the spaced repetition program Anki. This review enables current residents and medical students to recognize and utilize evidence-proven study techniques to increase learning efficacy. A systemic review of papers across all medical journals available on Pubmed was conducted to identify studies published without time constraints. The search was for (Anki) and (spaced repetition residency). Available outcome data was collected and discussed independently for students and residents. Many studies showed a statistically significant increase in exam performance associated with Anki use and high levels of satisfaction among residents and medical students. Further research is warranted to provide high-quality evidence of Anki’s applications and there is a need for exploration in additional residency specialties. Anki use has steadily increased with both medical students and residents. The application demonstrated consistent improvement on exam-based performance and was regarded highly by users. As burnout and time constrictions threaten educational workflow, Anki may serve as a powerful tool to improve the quality of learning. Further data needs to be collected and analyzed in specialties where Anki use may already exist.

Keeping the bus voltage within acceptable limits depends on dispatching reactive power. Power quality improves as a result of creating an effective power flow system, which also helps to reduce power loss. Therefore, Optimal Reactive Power Dispatch (ORPD) studies aim at designing appropriate system configurations to enable a reliable operation of power systems. Establishment of such a configuration is handled through control variables in power systems. On the other hand, installing Distributed Generation Unit (DGU) into a power system can have an important effect on power quality and power loss minimization. In this paper, Grey Wolf Optimization (GWO method is applied to ORPD problem for the first time, to find optimal placement of newly installed DGUs at the power system. Active power loss and voltage minimization have been minimized by optimizing the control variables while keeping them within their upper and lower bounds, and by finding the optimal placement of a newly installed DGU in power system. On the basis of IEEE 30 bus and IEEE 118 bus systems, performance of the suggested approach is investigated. A comparison is also performed among the proposed method and some other methods. Test results demonstrate that the resulting configuration contributes to growing the rate of renewable integration to a power system. The results also indicate that the suggested optimization approach applied to ORPD problem has improved power system performance in terms of both on power loss and voltage deviation. The promising results highlight the potential of the GWO algorithm to facilitate the integration of renewable power sources, and its role in promoting sustainable energy solutions.

Underwater visual detection technology plays a pivotal role in fields such as marine exploration. With the increasing demand for underwater monitoring, the quest for efficient and reliable methods for underwater target recognition has become particularly significant. To address this requirement, this study developed an innovative underwater object detection architecture based on YOLOv8, named YOLOv8-MU, aimed at significantly enhancing detection accuracy.By integrating the LarK module proposed in UniRepLKNet to optimize the backbone network, YOLOv8-MU aims to achieve a larger receptive field without increasing the model’s depth. Further, this research introduces C2fSTR, an innovative method that combines Swin Transformer with the C2f module. Additionally, we have incorporated the SPPFCSPC_EMA module, which combines Cross-Stage Partial Fast Spatial Pyramid Pooling (SPPFCSPC) with attention mechanisms, significantly improving the detection accuracy and robustness of various biological targets. Moreover, by introducing a fusion block based on DAMO-YOLO into the neck of the model, we further enhanced the model’s capability in multi-scale feature extraction. Finally, the adoption of the MPDIoU loss function, designed around vertex distance, effectively tackles the challenges of localization accuracy and boundary clarity in underwater organism detection. Experimental results on the URPC2019 dataset demonstrate that the YOLOv8-MU model achieved an [email protected] of 78.4%, marking improvements of 5.6%, 1.1%, and 4.0% over YOLOv5s, YOLOv7, and YOLOv8n respectively, indicating the leading performance (SOTA) of this method. On the other hand, further evaluation on the URPC2020 dataset confirmed the generalization capability of the YOLOv8-MU architecture, with its [email protected] reaching 80.4%, surpassing various models including YOLOv5x and YOLOv8n, showcasing the wide applicability of our proposed improved model architecture.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

A novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

To date, several independent methods and algorithms exist exploiting constraint-based stoichiometric models to find metabolic engineering strategies that optimize microbial production performance. Optimization procedures based on metaheuristics facilitate a straightforward adaption and expansion of engineering objectives as well as fitness functions, while being particularly suited for solving problems of high complexity. With the increasing interest in multi-scale models and a need for solving advanced engineering problems, we strive to advance genetic algorithms, which stand out due to their intuitive optimization principles and proven usefulness in this field of research. A drawback of genetic algorithms is that premature convergence to sub-optimal solutions easily occurs if the optimization parameters are not adapted to the specific problem. Here, we conducted comprehensive parameter sensitivity analyses to study their impact on finding optimal strain designs. We further demonstrate the capability of genetic algorithms to simultaneously handle (i) multiple, non-linear engineering objectives, (ii) the identification of gene target-sets according to logical gene-protein-reaction associations, (iii) minimization of the number of network perturbations, and (iv) the insertion of non-native reactions, while employing genome-scale metabolic models. This framework adds a level of sophistication in terms of strain design robustness, which is exemplarily tested on succinate overproduction in Escherichia coli.

This paper investigates an innovative photovoltaic cell configuration, denoted as “Au/CuSCN/RbGeI3/CdTe/ZnO/TiO2/FTO", using SCAPS-1D simulation. The research focuses on optimizing device performance by analyzing key components, including ZnO as the electron transport layer (ETL), RbGeI3 as the perovskite absorber layer, CuSCN as the hole transport layer (HTL), and CdTe as the active buffer layer. A comparison is made with the standard “Au/CuSCN/CH3NH3SnI3/CdTe/ZnO/TiO2/FTO" configuration under dark and illuminated conditions. Through an in-depth investigation involving temperature effects, generation rate analysis, RbGeI3 absorber layer thickness, Nd level, and interface defect levels, an optimized design for a unit area is achieved. The proposed solar cell demonstrates outstanding performance metrics, including an open circuit voltage (Voc) of 0.94V, a short circuit current density (Jsc) of 34.52mA/cm2, a fill factor (FF) of 77.77%, and an energy conversion efficiency (η) of 25.40%. These values significantly outperform the reference models with energy conversion efficiencies of 10.11% and 21.09%. Real-world applicability is validated by implementing these optimized characteristics in a photovoltaic system for Pakistan’s geographical location using PVSyst software. The suggested solar cell achieves a remarkable performance ratio (PR) of 85.6%, surpassing the PR of the reference basic solar cell model at 83%. The findings of this research offer a promising and superior solar cell design, incorporating innovative materials and optimization techniques to achieve exceptional energy conversion efficiency and overall performance. This study’s outcomes have the potential to advance photovoltaic technology and contribute to sustainable energy solutions worldwide.

Data integrity and security are among the most essential things in this digital era performance. Digital certificates can be one solution to this problem. This research will develop the architecture of digital certificate verification and validation using blockchain. The blockchain concept for digital certificates uses three stages: requirements planning, workshop design, and implementation. Digital certificate files will be tested based on a scenario in which there could be any changes to those files, such as compressing files, changing data of files, inserting images in the file, and rotating files. This system architecture will detect any changes that could occur to the digital certificate file by using a digital signature, Keccak256 hash algorithm, and blockchain. This research shows that change detection accuracy for digital certificate files is 100%. However, there is a digital signature nature that could reduce the accuracy of change detection, and several solutions can be resolved. The average time to generate a signature using blockchain technology is 2.11 seconds, faster than 3.23 seconds when it does not use blockchain. The average time to validate a signature is 2.11 seconds without using blockchain, which is reduced to 0.22 seconds using blockchain technology. This research concludes that the architecture for digital certificate verification and validation using blockchain technology has successfully improved the security of digital certificates. Testing showed that even minor changes to a digital certificate could affect the signature, ensuring the certificate's integrity. For further research, evaluating the performance of various hash algorithms within the blockchain network is recommended.

The EigenAnt algorithm has been proposed to find the shortest path between two nodes with a proof of convergence. Two novel features are noticeable in EigenAnt compared to the conventional ant colony optimization algorithms. Pheromone evaporation in the EigenAnt algorithm is done locally for the selected path and it does not use heuristic information in its selection phase. On the other hand, a simple version of ant colony optimization that also does not use heuristic information has been used for analyzing convergence, considering parameter impact analysis, in the problem of finding the shortest path for 1-node binary chain problems. In this paper, we propose to improve the EigenAnt algorithm by adding additional parameters in such a way as to be able to take advantage of the analysis developed for the simple ant colony optimization algorithm. We demonstrate through our analysis that since the Improved EigenAnt algorithm has one parameter more than ant colony optimization algorithms, tuning of convergence speed is decoupled from tuning of convergence features in the algorithm. Thus, IEigenAnt, which can be interpreted as having two uncorrelated intensification and diversification components, makes it possible to achieve a balance between intensification and diversification. In order to illustrate the advantages of this decoupling, we present experimental results for the routing network problem.

This study presents a groundbreaking approach in the field of gaming AI, focusing on the classic game” Pacman” through the lens of DRL integrated with advanced optimization techniques. The core of the research involves adapting DRL models for” Pacman”, utilizing the ESO for hyper- parameter tuning. These novel adaptations significantly enhance the AI agent’s performance, demonstrating a remarkable improvement in adaptability, responsiveness, and efficiency within the game environment. A pivotal aspect of this research is the innovative integration of metaheuristic optimization techniques into the DRL framework, a first in the domain of Atari gaming AI. This integration has proven essential in fine-tuning the DRL models, leading to a more effective and dynamic gaming experience. The study thoroughly evaluates and compares the performance of these algorithms, providing empirical support for their effectiveness and setting a new benchmark in AI-driven game development. The implications of this research extend beyond gaming AI, opening up possibilities for future exploration in several directions. Expanding DRL models to other complex gaming environments, continuous algorithmic enhancements, real-time learning adaptations, and applying these principles to robotics and autonomous vehicles are examples. The research also emphasizes ethical and responsible AI use in gaming to address fairness and addiction issues.

This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

In this paper, carbon nanotubes modified screen-printed electrode (CNTs/SPE) was prepared and the CNTs/SPE was employed for the electrochemical determination of antioxidant substance Chlorogenic acids (CGAs). A pair of well-defined redox peak of CGA was observed at the CNTs/SPE in 0.10 mol∙L^-1 acetic acid-sodium acetate buffer (pH 6.2) and electrode process is adsorption-controlled. Cyclic voltammetry (CV) and differential pulse voltammetry (DPV) method for the determination of CGA were proposed based on the CNTs/SPE. Under the optimal conditions, the proposed method exhibited linear ranges from 4.73×10^-7 to 4.45×10^-5 mol∙L^-1, the linear regression equation was Ipa(µA) = 4.1993 C (mol∙L^-1)+1.1039 (r = 0.9976) and the detection limit for CGA could reach 3.25×10^-6 mol∙L^-1. The recovery of matrine was 94.74~106.65% (RSD = 2.92%) in coffe beans. The proposed method is quick, sensitive, reliable, and can be used for the determination of CGA.

Intrahepatic cholangiocarcinoma (ICCA) is a malignant epithelial neoplasm characterized by biliary differentiation within the liver. ICCA is molecularly heterogeneous and exhibits a broad spectrum of histopathological features. It is a highly aggressive carcinoma with high mortality and poor survival rates. ICCAs are classified into two main subtypes: small duct type and large duct types. These two tumor types have different cell origins and clinicopathological features. ICCAs are characterized by numerous molecular alterations, including mutations in KRAS, TP53, IDH1/2, ARID1A, BAP1, BRAF, SAMD4, and EGFR, and FGFR2 fusion. Two main molecular subtypes–inflammation and proliferation–have been proposed. Recent advances in high-throughput assays using next-generation sequencing have improved our understanding of ICCA pathogenesis and molecular genetics. The diagnosis of ICCA poses a significant challenge for pathologists because of its varied morphologies and phenotypes. Accurate diagnosis of ICCA is essential for effective patient management and prognostic determination. This article provides an updated overview of ICCA pathology, focusing particularly on molecular features, histological subtypes, and diagnostic approaches.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

An improved anti-noise morphology vision navigation algorithm is proposed for intelligent tractor tillage in a complex agricultural field environment. At first the two key steps, Guided Filtering and improved anti-noise morphology navigation line extraction were addressed in detail. Then the experiments were carried out in order to verify the effectiveness and advancement of the presented algorithm. Finally, the optimal template and it’s application condition were studied for improving the image processing speed. The comparison experiment results show that the YCbCr color space has minimum time consumption of 0.094 s in comparison with HSV, HIS and 2R-G-B color spaces. The Guided Filtering method can effectively distinguish the boundary between the new and old soil than other competing vanilla methods such as Tarel, Multi-scale Retinex, Wavelet-based Retinex and Homomorphic Filtering inspite of having the fastest processing speed of 0.113 s. The extracted soil boundary line of the improved anti-noise morphology algorithm has best precision and speed compared with other operators such as Sobel, Roberts, Prewitt and Log. After comparing different size of image template, the optimal template with the size of 140×260 pixels can meet high precision vision navigation while the course deviation angle is not more than 7.5°. The maximum tractor speed of the optimal template and global template are 51.41 km/h and 27.47 km/h respectively which can meet real-time vision navigation requirement of the smart tractor tillage operation in the field. The experimental vision navigation results demonstrated the feasibility of the autonomous vision navigation for tractor tillage operation in the field using the new and old soil boundary line extracted by the proposed improved anti-noise morphology algorithm which has broad application prospect.

A real-time monitoring system for the operational status of fishing vessels is an essential element for the modernization of the fishing industry. The operational status of fishing vessels can be identified by using onboard cameras to detect the deck crew and the use of fishing nets. Due to the typically limited processing capacity of shipboard equipment and the significant memory consumption of detection models, however, general target detection models are unable to perform real-time image detection to identify the operational status of fishing vessels. In this paper, we propose a lightweight real-time deck crew and the use of fishing nets detection method, YOLOv5s-SGC. It is based on the YOLOv5s model, which uses surveillance cameras to obtain video of fishing vessels operating at sea and enhances the dataset. YOLOv5s-SGC replaces YOLOv5s’s backbone and the ordinary convolutional blocks in the feature fusion network with ShufflNetV2 and Ghost module.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

High-strength low-alloy steels (HSLAs) are widely used in the structural body components of many domestic motor vehicles owing to their better mechanical properties and greater resistance. The real production process of HSLA steelmaking can be regarded as a model that builds on the relationship between process parameters and product quality attributes. A surrogate modeling method is used, and the resulting production process model can be applied to predict the optimal manufacturing process parameters. We used different methods in this paper to build such a surrogate model, including linear regression, random forests, support vector regression, multilayer perception, and a simplified VGG model. We then applied three bio-inspired search algorithms, namely particle swarm optimization, the artificial bee colony algorithm, and the firefly algorithm, to search for the optimal controllable manufacturing process parameters. Through experiments on 9,000 test samples used for building the surrogate model, and 299 test samples for making the optimal process parameter selection, we found that the combination of a simplified VGG model and the firefly algorithm was the most successful at reaching a success rate of 100%—in other words, when the product quality attributes of all test samples satisfy the mechanical requirements of the end products.

Against the backdrop of the current carbon peaking and carbon neutrality policies, higher requirements have been put forward for the upgrading and construction of smart grids. Non-intrusive load monitoring (NILM) technology is a key technology for advanced measurement systems at the end of the power grid. It obtains detailed power information of the load, without the need for traditional hardware deployment. The key step to solve this problem is load decomposition and identification. This paper first utilized Long Short Term Memory-Denoising Autoencoder(LSTM-DAE) to decompose the mixed current signal on the household busbar and obtain the current signals of multiple independent loads that constituted the mixed current. Then, the obtained independent current signals were combined with voltage signals to generate multi-cycle colored Voltage-Current(VI) trajectories, which were color-coded according to the background. These colored VI trajectories with background colors formed a feature library. When the CNN network was used for load recognition, considering the influence of hyperparameters on recognition results, the BOA algorithm was used for optimization, and the optimized CNN network was employed for VI trajectory recognition. Finally, the proposed method was validated using the PLAID dataset. Experimental results showed that the proposed method exhibited better performance in load decomposition and identification.

In this paper, we implement a new method binary Particle Swarm Optimization (PSO) for solving the kidney exchange problem, which will improve the future decisions of kidney exchange programs. Because using a kidney exchange, we can help incompatible patient-donor couples to swap donors to receive a compatible kidney. Kidney paired donation programs provide an innovative approach for increasing the number of available kidneys. Further, we implementing binary particle swarm optimization in parallel with MATLAB with one, two, three and four threads and from the computations point of view, the authors compare the performance to reduce the running time for kidney exchange to match patients as fast as possible to help clinicians. Moreover, implementing binary particle swarm optimization in solving the kidney exchange problem is an effective method. The obtained results indicate that binary PSO outperforms other stochastic-based methods such as genetic algorithm, ant lion optimization, and efficient the number of resulting exchanges.

In today's human society, diesel generators (DGs) are highly applied into the human energy and electricity supply system due to its technical, operational and economic advantages. This paper proposes an intelligent nonlinear $H_2/H_{\infty}$ robust controller based on the chaos particle swarm gravity search optimization algorithm (CPSOGSA), which controls the speed and excitation of a DG. In this method, firstly, establish the nonlinear mathematical model of the DG and then design the nonlinear $H_2/H_{\infty}$ robust controller based on this. The direct feedback linearization and the $H_2/H_{\infty}$ robust control theory are combined and applied. Based on the design of the integrated controller for DG speed and excitation, the system's performance requirements are transformed into a standard robust $H_2/H_{\infty}$ control problem. The parameters of the proposed solution controller are optimized by using the proposed CPSOGSA. The introduction of CPSOGSA completes the design of an intelligent nonlinear $H_2/H_{\infty}$ robust controller for DG. The simulation is implemented in MATLAB/Simulink, and the results are compared with the PID control method. The obtained results prove that the proposed method can effectively improve the dynamic accuracy of the system and the ability to suppress disturbances and improve the stability of the system.

Detection of subsurface archaeological remains using a range of remote sensing methods, poses several challenges until today. Recent studies regarding the detection of archaeological proxies like those of cropmarks highlight the complexity of the phenomenon. In this work we present three different methods, and associated indices, for identifying stressed reflectance signatures indicating buried archaeological remains, based on a dataset of measured ground spectroradiometric reflectance. Several spectral profiles between the visible and near infrared part of the spectrum, were taken over a controlled environment in Cyprus during the 2011-2012 and are re-used in this study. The first two (spectral) methods are based on a suitable analysis of the spectral signatures in (1) the visible part of the spectrum, and in particular in the neighborhood of 570 nm, and (2) the red edge-near infrared part of the spectrum, in the neighborhood of 730 nm. Machine learning (decision trees) allows for the deduction of suitable wavelengths to focus on, in order to formulate the proposed indices and the associated classification criteria (decision boundaries) that can enhance the detection probability of stressed vegetation. Noise in the signal is taken into account by simulating reflectance signatures perturbed by white noise. Applying decision tree classification on the ensemble of simulations and basic statistical analysis we refine the formulation of the indices and criteria for the noisy signatures. The success rate of the proposed methods is over 90%. The third method rests on the estimation of vegetation/canopy reflectance parameters through inversion of the physical-based PROSAIL reflectance model and the associated classification through machine learning methods. The obtained results provide further insights into the formation of stress vegetation that occurred due to the presence of shallow buried archaeological remains, which are well aligned with physical-based models and existing empirical knowledge. To the best of the authors' knowledge, this is the first study demonstrating the usefulness of radiative transfer models such as PROSAIL for understanding the formation of cropmarks. Similar studies can support future research directions towards the development of regional remote sensing methods and algorithms if systematic observations are adequately dispersed in space and time.

This study will lead to the development of a numerical data set that will assist in the design of Savonius wind turbines. A major objective of this study is to develop a better design for Savonius turbine blades in order to increase their torque coefficients, rotational speeds, and pressure coefficients. As part of the experimental design methodology, a full dataset was generated by simulating three-dimensional scale models utilizing computational fluid dynamics (CFD) simulations that were validated by wind tunnel data. This process is multi-objective optimization for optimizing turbine performance. The twist angle, aspect ratio, and overlap ratio are all important factors in determining the optimal torque and power coefficients. The group method of data handling (GMDH) algorithm was utilized to model objective functions based on input-output data. The Pareto fronts were plotted using polynomial models obtained from the evolutionary Pareto-based optimization approach (modified NSGA-II), and the optimal commercial points were determined using TOPSIS. A comparison of three- and two-objective optimization data revealed that two-objective optimization data lie within the boundaries of a three-objective optimization problem. The torque coefficient, rotational speed, and power coefficient are all improved by 13.74%, 0.071%, and 5.32%, respectively, using multi-objective optimization. As a result of the multi-objective optimization of the turbine, some significant characteristics of objective functions were discovered.

Accurate and stable cost forecasting of substation projects is of great significance to ensure the economic construction and sustainable operation of power engineering projects. In this paper, a forecasting model based on the improved least squares support vector machine (ILSSVM) optimized by wolf pack algorithm(WPA) is proposed to improve the accuracy and stability of the cost forecasting of substation projects. Firstly, the optimal features are selected through the data inconsistency rate (DIR), which helps reduce redundant input vectors. Secondly, the wolf pack algorithm is used to optimize the parameters of the improved least square support vector machine. Lastly, the cost forecasting method of WPA-DIR-ILSSVM is established. In this paper, 88 substation projects in different regions from 2015 to 2017 are chosen to conduct the training tests to verify the validity of the model. The results indicate that the new hybrid WPA-DIR-ILSSVM model presents better accuracy, robustness and generality in cost forecasting of substation projects.

Image compression is a top priority today due to the need for faster encoding and decoding. To achieve this, the present study has proposed the use of Canonical Huffman Coding (CHC) as an entropy coder, which has a lower decoding time complexity than binary Huffman codes. For image compression, combining of the Discrete Wavelet Transform (DWT) and CHC with Principal Component Analysis (PCA) has been recommended. The lossy method has been introduced by using PCA, followed by DWT and CHC to enhance compression efficiency. By using DWT and CHC instead of PCA alone, the reconstructed image has been found to have a better peak signal-to-noise ratio (PSNR) value. This study has developed a hybrid compression model combining the advantages of DWT, CHC and PCA. With the increasing use of image data, better image compression techniques are necessary for efficient use of storage space. The proposed technique has achieved up to 60% compression while maintaining high visual quality. This method has also outperformed the currently available techniques in terms of both PSNR (in dB) and bit-per-pixel (bpp) scores. This approach has been tested on various color images, including Peppers 512×512 and Couple 256×256, showing improvement by 17 dB and 22 dB, respectively, while reducing bpp by 0.56 and 0.10, respectively. For grayscale images, i.e., Lena 512×512 and Boat 256×256, the proposed method has shown an improvement by 5 dB and 8 dB, respectively, with a decrease of 0.02 bpp in both cases.

Improper design of friction pendulum bearings can lead to poor seismic reduction performance and may result in the failure of local vulnerable components. And the parameter design of friction pendulum bearings mainly relies on experience and verification calculations at present. This paper proposes an adaptive genetic algorithm considering the overall evolution state of the population, adjusting crossover and mutation probabilities adaptively based on individual fitness and population diversity. Compared to traditional algorithms, it exhibits better global search capabilities and convergence efficiency. Combining the improved genetic algorithm with finite element models, a parameter optimization method is proposed. The parameters of friction pendulum bearings are optimized, providing reference for the design of seismic isolation devices.

This paper proposes an approach to estimate the parameters of an AC-DC boost power factor corrector converter which includes an EMI filter. To this end, once the topology is known, measurements at the input and output terminals of the converter are done to identify the values of the passive elements. The proposed methodology is based on the trust-region nonlinear least squares algorithm to identify the parameters of the converter. The steady-state and the transient signals of the converter at the input/output terminals are acquired non-intrusively without any internal modification of the circuitry. The accuracy of the parameter identification carried out is determined by comparing the estimated values with the actual values provided by the manufacturer, and by contrasting the measured signals with the ones obtained with a simulation model with the estimated values of the parameters. The results presented in this paper prove the accuracy of the proposed approach, which can be extended to other power converters and filters.

Background: Circulating rare cells participate in breast cancer evolution as systemic components of the disease and thus, are a source of theranostic information. Exploration of cancer-associated rare cells is in its infancy. We determined the validity of a rare-cell detection platform and demonstrated the usefulness of a certain rare cell subset as a novel approach to characterize the breast cancer system. Methods: Linearity of the Rarmax® platform was established using a spike-in approach. The platform includes red blood cell lysis, leukocyte depletion and high-resolution fluorescence image recording. Rare cell analysis was conducted on 28 samples (before and after surgery) from 14 patients with breast cancer, 20 healthy volunteers and 9 non-cancer control volunteers. In-depth identification of rare cells, including circulating tumor cells, endothelial-like cells, erythroblasts and inflammation-associated cells, was performed using a phenotype and morphology-based classification system. Results: The platform performed linearly over a range of 5-950 spiked cells, with an average recovery of 84.6%. Circulating epithelial and endothelial-like cell subsets have been demonstrated to be associated with or independent of cancer with tumor presence. Furthermore, certain cell patterns may be associated with treatment-related adverse effects. The sensitivity in detecting tumor-presence and cancer-associated abnormality before surgery was 50% and 85.7%, respectively and the specificity was 100% and 96.6%, respectively. Conclusion: The present study supports the idea of a cancer-associated rare cell abnormality to represent tumor entities as well as systemic cancer. The latter is independent of the apparent clinical cancer.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Of all the renewable energy sources, solar photovoltaic (PV) power is estimated to be a popular source due to several advantages such as its free availability, absence of rotating parts, integration to building such as rooftops, and less maintenance cost. The nonlinear current-voltage (I–V) characteristics and power generated from a PV array primarily depend on solar insolation/irradiation and panel temperature. The extracted PV output power is influenced by the accuracy with which the nonlinear power–voltage (P–V) characteristic curve is traced by the maximum power point tracking (MPPT) controller. In this paper, a bio-inspired roach infestation optimization (RIO) algorithm is proposed to extract the maximum power from the PV system (PVS). To validate the usefulness of the RIO MPPT algorithm, MATLAB/Simulink simulations are performed under varying environmental conditions, for example, step changes in solar irradiance, and partial shading of the PV array. Furthermore, the search performance of the RIO algorithm is examined on different unconstrained benchmark functions, and it is that realized that the RIO algorithm has improved convergence characteristics in terms of finding the optimal solution than Particle swarm optimization (PSO). The results demonstrated that the RIO-based MPPT performs remarkably in tracking with high accuracy as the PSO-based MPPT.

A Demand-side management technique are deployed along with battery energy-storage systems (BESSs) to lower the electricity cost by mitigating the peak load of a building. Most of the existing methods rely on manual operation of the BESS, or even an elaborate building energy-management system resorting to a deterministic method that is susceptible to unforeseen growth in demand. In this study we propose a real-time optimal operating strategy for BESS based on density demand forecast and stochastic optimization. This method takes into consideration uncertainties in demand when accounting for an optimal BESS schedule, making it robust compared to the deterministic case. The proposed method is verified and tested against existing algorithms. Data obtained from a real site in South Korea is used for verification and testing. The results show that the proposed method is effective, even for the cases where the forecasted demand deviates from the observed demand

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

Since financial institutions faced to fatal scenario like subprime mortgage crisis and COVID-19, the factor-based asset allocation methodology is noticed. Asset-only approach which make to consider restrictive risk volatility as individual assets had limitation of macro factor risk. For instance, an institution which allocated assets by asset-only approach cannot deal with the inflation crisis. We review the problem of the traditional modern portfolio approach that is used by Korean financial institutions. For reasonable investment of institution, we notice improved factor-based allocation approach. The first result of this paper is that Mean-variance approach as considered only return of asset recorded lower performance than multi factor-based portfolio in macro factor crisis. Second, we notice allocation model which can minimize probability passing the liability risk exposed macro factors to investment risk exposed macro factors. There are three steps in multi-macro factor-based asset allocation approach: discovering macro factors and mapping asset classes to individual macro factor. Second, define liability account and mapping as considering income and pay out of institution. Third, minimize correlation of fac-tor-based asset risk with liability volatility. Furthermore, using covariance return of assets to allocate makes Pareto improvement and supports to break Home-bias problems.

Mixing is considered as a critical process parameter (CPP) during process development due to its significant influence on reaction selectivity and process safety. Nevertheless, mixing issues are difficult to identify and solve owing to their complexity and dependence on knowledge of kinetics and hydrodynamics. In this paper, we proposed an optimization methodology using Computational Fluid Dynamics (CFD) based compartmental modelling to improve mixing and reaction selectivity. More importantly, we have demonstrated that through the implementation of surrogate-based optimization, the proposed methodology can be used as a computationally non-intensive way for rapid process development of reaction unit operations. For illustration purpose, reaction selectivity of a process with Bourne competitive reaction network is discussed. Results demonstrate that we can improve reaction selectivity by dynamically controlling rates and locations of feeding in the reactor. The proposed methodology incorporates mechanistic understanding of the reaction kinetics together with an efficient optimization algorithm to determine the optimal process operation and thus can serve as a tool for quality-by-design (QbD) during product development stage.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Directional Modulation (DM) technique, as an emerging promising approach to secure wireless communications, has been attracting increasing attention for its unique characteristic in the past decade. The baseband signal is synthesized at the antenna level for maintaining the standard constellation format along the prescribed direction(s) while simultaneously distorting the signal constellations in other undesired directions. In this paper, we present a novel DM signal synthesis method based on phased array using a hybrid genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, which takes advantages of both GA and PSO algorithm. Then, the bit error rate of the proposed method is analyzed and simulated. Simulation results are presented to verify that the proposed DM signal have a narrower information beam-width. Therefore, it can offer a better physical layer security (PLS) performance compared with the conventional directional modulation signal.

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts on solving the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL) based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding-Tao’s OL algorithm, the well-know LLL reduction is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. The experimental comparisons towards the Ding-Tao’s algorithm and ours are also provided for validating our improvements.

Blasting pattern optimization is an attempt to optimize blast design parameters aiming to achieve optimum fragmentation, reduce mining operating costs as well as environmental side consequences. The present study aims to propose a multi-objective optimization model, employing artificial intelligence and metaheuristics, to simultaneously minimize the mine-to-crusher operating costs and the impact of blasting consequences including fly-rock and back-break. To achieve the purpose of the study, a multi-variable regression model was developed to model total costs from drilling to crushing. In addition to the costs, multilayer perception neural networks were implemented to predict the blast-induced back-break and fly-rock as a function of collected variables such as number of holes, hole length, burden, spacing, hole slope, stemming, blasted rock per hole, powder factor, and charge per delay. High-precise estimations for both back-break and fly-rock were achieved with the average of 99% coefficient of determination for train, test and validation data sets. Then, the developed regression model and the neural networks were used in an optimization framework, employing Grasshopper algorithm, to find the optimum blast design satisfying practical constraints. The proposed model was tested on a lead-zinc open-pit mine, where 1032 blasting patterns were recorded and analyzed. The results of the optimization model provide a Pareto set of solutions, such that any of these solutions can be implemented according to the strategy of the mining operation management team. The blast pattern with the lowest cost, result in a relatively high fly-rock and back-break, while the pattern with low fly-rock and back-break raises the cost by 20.13 % compared the minimum cost blast design.

Phyllanthus emblica (P. emblica) has been described in many studies to have multiple therapeutic activities and is considered an important part of Ayurvedic and Unani medicinal systems. This study successfully synthesized P. emblica loaded polyvinylalcohol/gelatin based cryogels (PVA/Gel/P.emblica) to examine their potential in wound dressing applications. Swelling tests, Brunauer-Emmett-Teller (BET) and morphology analysis were conducted within the scope of characterization studies. In vitro cell culture studies were performed using HaCaT cells to illustrate the suitability of the synthesized cryogels as wound dressing material. The swelling tests and BET analysis results showed that swelling and surface area properties of cryogels increased with increasing P. emblica amounts. Morphological results displayed that the cryogels had a dense, interconnected pore morphology and a macroporous structure. 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyltetrazolium bromide (MTT), trypan blue exclusion and live-dead assay results revealed that adding of P. emblica into cryogels led to enhanced cell proliferation, increased cell number, and improved cell viability. Based on the phase contrast microscope, scanning electron microscope (SEM), immunofluorescence and giemsa staining images, it was observed that P. emblica promoted cell attachment, proliferation and penetration. In conclusion, it has been shown that PVA/Gel/P.emblica cryogels are suitable for use as wound dressing materials and can be developed with further studies.

Software stands as one of the most rapidly evolving technologies in the present era, characterized by its swift expansion in both scale and complexity which leads to challenges in quality assurance. Software Defect Prediction (SDP) emerges as a methodology crafted to anticipate undiscovered defects, leveraging known defect data from existing codes. This methodology serves to facilitate software quality management, thereby ensuring overall product quality. Machine Learning (ML) and Deep Learning (DL) methodologies exhibit superior accuracy and adaptability compared to traditional statistical approaches catalyzing active researches in this domain. However, it makes us hard to generalize not only because of the disparity between open-source project and commercial project but also the difference on each industrial sectors. Consequently, further research utilizing datasets sourced from diverse real-world sectors becomes imperative to bolster the applicability of these findings. In this study, we utilized embedded software for telecommunication systems of SAMSUNG ELECTRONICS, supplemented by the introduction of nine novel features to train the model, and subsequent analysis of results ensued. Experimental outcomes revealed that the F-measurement metric has been enhanced from 0.58 to 0.63 upon integration of the new features, thereby signifying a performance augmentation of 8.62%. This case study is anticipated to contribute to bolster the application of SDP methodologies within analogous industrial sectors.

Collaboration among individuals with diverse skills and personalities is crucial in producing high-quality software. The success of any software project depends on the team’s cohesive functionality and mutual complementation. This study introduces a data-centric methodology for forming Software Engineering (SE) teams centred around personality traits. Our study analyzed data from an SE course where 157 students in 31 teams worked through four project phases and were evaluated based on deliverables and instructor feedback. Using the Five Factor Model (FFM) and a variety of statistical tests, we determined that teams with higher levels of extraversion and conscientiousness and lower neuroticism consistently performed better. We examined team member interactions and developed a predictive model using extreme gradient boosting. The model achieved a 74% accuracy rate in predicting inter-member satisfaction rankings. Through graphical explainability, it underscored incompatibilities among members, notably those with differing levels of extraversion. Based on our findings, we introduce a team formation algorithm using Simulated Annealing (SA), built upon the insights from our predictive model and additional heuristics.

In order to overcome the limitation of the traditional adaptive Unscented Kalman Filtering (UKF) algorithm in noise covariance estimation for statement and measurement, we propose a hybrid adaptive UKF algorithm based on combining Maximum a posteriori (MAP) criterion and Maximum likelihood (ML) criterion, in this paper. First, to prevent the actual noise covariance deviating from the true value which can lead to the state estimation error and arouse the filtering divergence, a real-time covariance matrices estimation algorithm based on hybrid MAP and ML is proposed for obtaining the statement and measurement noises covariance, respectively; and then, a balance equation the two kinds of covariance matrix is structured in this proposed to minimize the statement estimation error. Compared with the UFK based MAP and based ML, the proposed algorithm provides better convergence and stability.

This paper introduces a novel multi-strategy enhanced dung beetle optimization (MSDBO) algorithm that is designed to address several issues identified in the standard dung beetle optimization algorithm. Specifically, the MSDBO aims to enhance convergence speed, reduce susceptibility to local optima, and increase search accuracy. By incorporating three strategies: tent chaotic mapping for population initialization, the golden sinusoidal strategy for position updating, and the Lévy flight strategy for balancing exploration and exploitation, the standard dung beetle optimization algorithm is enhanced. The MSDBO algorithm is evaluated using twelve benchmark test functions and compared against five state-of-the-art algorithms. The results consistently show that MSDBO exhibits faster convergence speeds and more accurate solutions than the other algorithms across most of the test functions. In addition, MSDBO is also applied to optimize the parameters of a valve plate, including the close angle, cross angle, triangle groove sizes, and wrap angle. The optimization outcomes reveal that MSDBO effectively minimizes pressure ripples in the piston chamber, resulting in reduced flow rate fluctuations and noise emission compared to the initial design. This study highlights the potential of the MSDBO algorithm in tackling complex nonlinear engineering optimization problems.

During the hand-eye calibration process of the manipulator, the Euclidean distance error of the calibration results cannot be calculated because the true values of the hand-eye conversion matrix cannot be obtained. In this paper, a new method of projection error analysis is presented. Error analysis is carried out by using a priori knowledge that the location of AR markers is fixed in the calibration process. The coordinates of the AR marker center point are reprojected to the pixel coordinate system, and then compared with the true pixel coordinates of the AR marker center point obtained by corner detection or manual labeling in order to obtain the Euclidean distance between the two coordinates as the basis for error analysis. Experimental results show that the proposed optimization method can greatly improve the accuracy of hand-eye calibration results.