Search

Transverse synchronization of vertical displacements of all jacking-up points is an important monitoring indicator to replace bearings in assembled multigirder bridges during the jacking phase. Currently, using target paper to identify the 3D coordinates of control points reduces the complexity of monitoring operations and improves the stability of data precision. However, the existing planar target locating methods have low accuracy, inefficiency, and subjectivity, which seriously hinders the construction process of bearing replacement. Accurately obtaining the center coordinates of multiple targets from a point cloud in a short monitoring period remains a challenge. This study proposes a high-precision automated algorithm to extract target center points in low-density point clouds to quickly calculate real target center points. First, we construct a standard point cloud model of the target papers for scanning, including color and geometric features. Then, we extract the measured point cloud of the typical jacking operation phase based on the reflection intensity and size information. Next, we map the intensity values of the measured point cloud into the color channel and register the measured point cloud with its standard point cloud model using the normal vector estimation and colored ICP algorithms. Finally, we extract the center point of the measured targets. Numerical experiments and engineering test results show that the proposed method converges quickly with high precision and good robustness, which saves 91.4% of the time compared with the traditional method. In general, this research can provide effective technical support for 3D laser scanning in monitoring the operation phase of bridge jacking. [ABSTRACT FROM AUTHOR]

In this paper, the reentry phase of the Aerospaceplane is taken as the research object, and the performance parameters of the reusable rocket of a private company are analyzed. Aiming at the guidance and control scheme of the spacecraft returning to the reentry trajectory in the real environment, the original natural algorithm is optimized by considering various reentry flight constraints, and the improved original natural algorithm is used to optimize the reentry trajectory of the Aerospaceplane. We obtained two types of reentry trajectories in the presence of large flight-restricted areas, the "S-type" trajectory and the "spiral-type" trajectory, and obtained data on various influencing factors. The results showed that the basic state parameters of the spiral trajectory optimized using the improved original natural algorithm after adding constraints met the constraint conditions. The aerodynamic heating rate and overload of the spiral reentry trajectory were to some extent greater than those of the S-type trajectory. Under the increasingly stringent requirements of the aerospace environment, new requirements were put forward for the thermal protection system to meet the wider environmental situation. This paper uses the improved original natural algorithm for the first time and applies it to the field of aerospace reentry and entry and adds more constraints to this algorithm for computation. Besides, for the first time, the macroscopic nature of trajectory types is used as a comparative element for parameter comparison, providing a reference basis for selecting trajectory optimization directions from the macroscopic perspective of trajectory types. [ABSTRACT FROM AUTHOR]

The rapid development of mobile Internet has promoted the rapid rise of cloud computing technology. Mobile terminal devices have greatly expanded the service capacity of mobile terminals by migrating complex computing tasks to run in the cloud. However, in the process of data exchange between mobile terminals and cloud computing centers, on the one hand, it consumes the limited power of mobile terminals, and on the other hand, it results in longer communication time, which negatively affects user QoE. Mobile cloud can effectively improve user QoE by shortening the data transmission distance, reducing the power consumption, and shortening the communication time at the same time. In this paper, we utilize the property that genetic algorithm can perform global search seeking the global optimal solution and construct a dynamic task scheduling model by combining the device-cloud link. The task scheduling model based on genetic algorithm and random scheduling algorithm is compared through comparison experiments, which show that the assignment time of the task scheduling model based on genetic algorithm is shortened by 11.82% to 48.51% and the energy consumption is reduced by 22.28% to 47.52% under different load conditions. [ABSTRACT FROM AUTHOR]

Wireless Sensor Network (WSN) has inexpensive, small, and less energy sensor nodes, which are allocated in random ways in particular areas for measuring the phenomenon or events in that field. In recent days, WSN has played a vital role in various applications, like industrial monitoring, medical treatments, agricultural monitoring, and military operations. However, the security challenges and network lifetime are the main issues in the existing methods. In order to overcome these issues, the Taylor-Spotted Cat Optimization (Taylor-SCO) approach is devised in this paper. Here, the Cluster Heads (CHs) are selected based on the developed optimization method, named Taylor CSO. Moreover, the delay, distance, and energy parameters are considered for effective Cluster Head Selection (CHS). Here, route maintenance is also done for increasing network lifetime and reducing complexities. In addition, the Modified K-Vertex Disjoint Paths Routing (KVDPR) model is established for routing. The modification of KVDPR is carried out using several factors, such as link reliability, throughput, and various trust factors. Moreover, the developed Taylor-SCO algorithm is developed by combining the Spotted Hyena Optimizer (SHO), Cat Swarm Optimization (CSO) algorithm, and Taylor series. The Taylor-SCO achieved better performance with energy consumption, trust, and throughput of 0.00037 J, 0.51, and 793160 kbps. [ABSTRACT FROM AUTHOR]

The goods collection and delivery process often relates to distribution logistics problems. The task is to deliver goods from warehouses to customers under specific circumstances. Efforts to optimize the process are largely aimed at reducing overall costs of goods transportation. Among the prominent algorithms for solving the basic type of the delivery (or collection) problem, which includes a single depot and a homogeneous vehicle fleet, is the algorithm developed by Clarke and Wright in 1964. This algorithm minimizes transportation costs by maximizing the savings achieved through merging multiple routes into one. This paper primarily aims to solve the pickup and delivery problem where the goods must be delivered and empty packaging collected in a single process. The request of a customer can be routed from the depot or from another customer. Similarly, the destination of the request may be the depot or another customer. Unlike the original version of the Clarke and Wright algorithm, the initial routes are created to satisfy delivery orders, and therefore, the same customer can occur in multiple routes. Consequently, a situation may arise in which two routes containing one or more common vertices must be combined during the calculation. Furthermore, these vertices need not be the outermost vertices of the routes. This situation cannot be addressed by using the original version of the Clarke and Wright algorithm, and that is why we propose its modification. Merging routes through inner vertices means that the cost savings depend on the configurations of the routes, and therefore, they cannot be calculated a priori. Instead, the dynamic savings matrix must be used. [ABSTRACT FROM AUTHOR]

Cables are important components of long-span bridge structures, whose operation is significantly affected by cable force changes. Nowadays, cable force testing is performed by physical methods; that is, sensors are installed on the cable structure to monitor its force changes. Obviously, this strategy requires an extensive amount of time to achieve cable force calculation, which makes it impossible to monitor the force of the cable structure in real time. Meanwhile, smartphones have attracted extensive attention in the field of structural health monitoring (SHM) because of their higher cost-effectiveness than accelerometers, which include price and lifespan. Besides, many people own a smartphone, which leads to the possibility of a wider range of applications. Therefore, this paper presents a framework for the rapid estimation of the cable force of long-span bridges based on smartphones-captured video and a template matching algorithm. First, the empirical mode decomposition (EMD) method with wavelet decomposition (WD) method, that is, the EMDWD model, is constructed to extract the vibration signal of the bridge cable by eliminating the effects of smartphone vibration and environmental noise on the measured dynamic displacement, thus effectively improving the accuracy of data processing. In addition, the vibration identification model of bridge cable based on a template matching algorithm is established, and the deformation curve of cable is obtained. Finally, the frequency of bridge suspender is calculated by the Fourier transform method (FFT), and the cable force is estimated based on the smartphone-captured video. [ABSTRACT FROM AUTHOR]

In recent years, solar photovoltaic (PV) energy, as a clean energy source, has received widespread attention and experienced rapid growth worldwide. However, the rapid growth of PV power deployment also brings important challenges to the maintenance of PV panels, and in order to solve this problem, this paper proposes an innovative algorithm based on PA-YOLO. First, we propose to use PA-YOLO's asymptotic feature pyramid network (AFPN) instead of YOLOv7's backbone network to support direct interactions of nonadjacent layers and avoid large semantic gaps between nonadjacent layers. For the occlusion problem of dense targets in the dataset, we introduce a repulsive loss function, which successfully reduces the occurrence of false detection situations. Finally, we propose a customized convolutional block equipped with an EMA mechanism to enhance the perceptual and expressive capabilities of the model. Experimental results on the dataset show that our proposed model achieves excellent performance with an average accuracy (mAP) of 94.5%, which is 6.8% higher than YOLOv7. In addition, our algorithm also succeeds in drastically reducing the model size from 71.3 MB to 48.4 MB, which well demonstrates the effectiveness of the model. [ABSTRACT FROM AUTHOR]

Class noise is a common issue that affects the performance of classification techniques on real-world data sets. Class noise appears when a class variable in data sets has incorrect class labels. In the case of noisy data, the robustness of classification techniques against noise could be more important than the performance results on noise-free data sets. The decision tree method is one of the most popular techniques for classification tasks. The C4.5, CART, and random forest (RF) algorithms are considered to be three of the most used algorithms in decision trees. The aim of this paper is to reach conclusions on which decision tree algorithm is better to use for building decision trees in terms of its performance and robustness against class noise. In order to achieve this aim, we study and compare the performance of the models when applied to class variables with noise. The results obtained indicate that the RF algorithm is more robust to data sets with noisy class variable than other algorithms. [ABSTRACT FROM AUTHOR]

The development of the internet of things (IoT) and 6G has given rise to numerous computation-intensive and latency-sensitive applications, which can be represented as directed acyclic graphs (DAGs). However, achieving these applications poses a huge challenge for user equipment (UE) that are constrained in computational power and battery capacity. In this paper, considering different requirements in various task scenarios, we aim to optimize the execution latency and energy consumption of the entire mobile edge computing (MEC) system. The system consists of single UE and multiple heterogeneous MEC servers to improve the execution efficiency of a DAG application. In addition, the execution reliability of a DAG application is viewed as a constraint. Based on the strong search capability and Pareto optimality theory of the cuckoo search (CS) algorithm and our previously proposed improved multiobjective cuckoo search (IMOCS) algorithm, we improve the initialization process and the update strategy of the external archive, and propose a reliability-constrained multiobjective cuckoo search (RCMOCS) algorithm. According to the simulation results, our proposed RCMOCS algorithm is able to obtain better Pareto frontiers and achieve satisfactory performance while ensuring execution reliability. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms have the advantages of resilience, global optimization capacity, and coding flexibility, making them helpful in tackling difficult optimization issues. The enhanced wind-driven optimization (CHTWDO) that was proposed in this paper coupled the chaotic map approach and the hyperbolic tangent with the T-distribution mutation method. The initial air particles are evenly distributed in the system space through a tent mapping strategy. Meanwhile, the variation probability of the hyperbolic tangent model and the T-distribution variation method are used to improve the comprehensive performance of the algorithm. In this way, the global search accuracy and the ability of avoiding the extreme value of the algorithm can be taken into account. Combining the three strategies, CHTWDO had higher global search accuracy and a stronger ability to jump out of local extremum. Comparing with the eight meta-heuristic algorithms (including WDO) and the single strategy improved WDO on 24 test functions, the experimental results show that CHTWDO with two improved strategies has better convergence precision and faster convergence speed. Statistical tests such as Friedman's and Wilcoxon's rank-sum tests are used to determine significant differences between these comparison algorithms. Finally, CHTWDO also obtains the best results on four classical optimization problems in engineering applications, which verifies its practicality and effectiveness. [ABSTRACT FROM AUTHOR]

The quality of collision detection algorithm directly affects the performance of the whole simulation system. To address the low efficiency and low accuracy in detecting the collisions of flexible cloths in virtual environments, this paper proposes an oriented bounding box (OBB) algorithm with a simplified model, tree structure for a root-node double bounding box, and continuous collision detection algorithm incorporating an OpenNN-based neural network optimization. First, for objects interacting with the cloths with more complex modeling, the model is simplified with a surface simplification algorithm based on the quadric error metrics, and the simplified model is used to construct an OBB. Second, a bounding box technique commonly used for collision detection is improved, and a root-node double bounding box algorithm is proposed to reduce the construction time for the bounding box. Finally, neural networks are used to optimize the continuous collision detection algorithm, as neural networks can efficiently process large amounts of data and remove disjoint collision pairs. An experiment shows that the construction of an OBB using the simplified model is almost identical to that of the original model, but the taken to construct the OBB is reduced by a factor of approximately 2.7. For the same cloth, it takes 5.51%–11.32% less time to run the root-node double bounding box algorithm than the traditional-hybrid bounding box algorithm. With an average removal rate nearly identical to that of the traditional filtering method, the elapsed time is reduced by 7%–11% by using the continuous collision detection algorithm based on an OpenNN neural network optimization. The simulation results are realistic and in line with the requirements for real-time cloth simulations. [ABSTRACT FROM AUTHOR]

In this paper, a variable-structure multimodel (VSMM) filtering algorithm based on the long short-term memory (LSTM) regression-deep Q network (L-DQN) is proposed to accurately track strong maneuvering targets. The algorithm can map the selection of the model set to the selection of the action label and realize the purpose of a deep reinforcement-learning agent to replace the model switching in the traditional VSMM algorithm by reasonably designing a reward function, state space, and network structure. At the same time, the algorithm introduces a LSTM algorithm, which can compensate the error of tracking results based on model history information. The simulation results show that compared with the traditional VSMM algorithm, the proposed algorithm can quickly capture the maneuvering of the target, the response time is short, the calculation accuracy is significantly improved, and the range of adaptation is wider. Precise tracking of maneuvering targets was achieved. [ABSTRACT FROM AUTHOR]

This paper is concerned with the design of a dual-loop control system for permanent magnet synchronous motor (PMSM). An improved linear extended state observer (LESO) with excellent estimation capability is employed to develop an improved linear active disturbance rejection control (LADRC) suitable for PMSM speed regulation, achieving outstanding disturbance suppression in PMSM speed control. The use of an internal model control scheme to initialize the parameters of the proportional-integral- (PI-) based current controller simplifies the search space of the control system parameter optimization. An improved particle swarm optimization (PSO) algorithm is applied to optimize the controller parameters, thereby enhancing the overall system performance. Finally, through a series of simulations and experiments, we validate that our proposed controller exhibits superior performance compared to some other control methods. [ABSTRACT FROM AUTHOR]

The Pareto dominance-based evolutionary algorithms can effectively address multiobjective optimization problems (MOPs). However, when dealing with many-objective optimization problems with more than three objectives (MaOPs), the Pareto dominance relationships cannot effectively distinguish the nondominated solutions in high-dimensional spaces. With the increase of the number of objectives, the proportion of dominance-resistant solutions (DRSs) in the population rapidly increases, which leads to insufficient selection pressure. In this paper, to address the challenges on MaOPs, a knee point-driven many-objective evolutionary algorithm with adaptive switching mechanism (KPEA) is proposed. In KPEA, the knee points determined by an adaptive strategy are introduced for not only mating selection but also environmental selection, which increases the probability of generating excellent offspring. In addition, to remove dominance-resistant solutions (DRSs) in the population, an interquartile range method is adopted, which enhances the selection pressure. Moreover, a novel adaptive switching mechanism between angle-based selection and penalty for selecting solutions is proposed, which is aimed at achieving a balance between convergence and diversity. To validate the performance of KPEA, it is compared with five state-of-the-art many-objective evolutionary algorithms. All algorithms are evaluated on 20 benchmark problems, i.e., WFG1-9, MaF1, and MaF4-13 with 3, 5, 8, and 10 objectives. The experimental results demonstrate that KPEA outperforms the compared algorithms in terms of HV and IGD in most of the test instances. [ABSTRACT FROM AUTHOR]

To improve soldiers' combat capability, weapon arms have a good development prospect. However, due to special work scenarios and tasks, new requirements are exerted on. Based on the fast-expanding random tree algorithm (RRT), path algorithm optimization (RRT-H) is proposed for the path planning of weapon arms. Overall path optimization is achieved by reducing the local path length with a closer path point planning to the obstacle. In a complex environment, the RRT-H algorithm can avoid local traps by guiding the new path extension direction and exploring multiple different paths in the map. The superiority of this algorithm is verified with 2D plane obstacle avoidance and pathfinding simulation experiments. Compared to RRT ∗ , RRT ∗ smart, and information RRT ∗ , the RRT-H can obtain high-quality calculation results in a shorter time. After setting degrees of freedom (DOF) as that of variables, the algorithm is applied to the 4-DOF weapon arm, which confirms an effective reduction to the 4-DOF weapon arm's motion costs. [ABSTRACT FROM AUTHOR]

In the construction of the civil engineering infrastructure, the noise and vibration are affected by the geological conditions, adopting specific construction techniques based on the geological conditions is of great significance in suppressing the noise and vibration caused by the construction. To classify and evaluate the rock mass quality, the rock quality designation (RQD) is adopted widely in the geological and mining engineering. Traditionally, to obtain RQD, lengths of drilling core pieces are measured and RQD is calculated manually, which is labor-expensive and time-consuming. With the development of the computational power, the image treatment driven by the computer vision creates a potential approach to obtain RQD automatically. In the present work, the image treatment process with the aid of the object detection and the image segmentation is adopted to obtain RQD automatically, based on the similarity of features such as color and texture, the segment anything model is adopted to detect the rock cores in the image, then, the YOLOv8 algorithm is adopted to train the model, and the gap features of the rock chip segments are extracted for segmentation of different rock core segments. To test the performance of the proposed approach, 10 boreholes from Shapingba Railway Comprehensive Reconstruction Project are adopted to conduct the case study. Compared to the traditional manual approach, RQD obtained by the proposed approach is relatively accurate and obviously efficient, namely, the average error is less than 5% and the time consumed is less than 70%. [ABSTRACT FROM AUTHOR]

Superresolution, structured illumination microscopy (SIM) is an ideal modality for imaging live cells due to its relatively high speed and low photon-induced damage to the cells. The rate-limiting step in observing a superresolution image in SIM is often the reconstruction speed of the algorithm used to form a single image from as many as nine raw images. Reconstruction algorithms impose a significant computing burden due to an intricate workflow and a large number of often complex calculations to produce the final image. Further adding to the computing burden is that the code, even within the MATLAB environment, can be inefficiently written by microscopists who are noncomputer science researchers. In addition, they do not take into consideration the processing power of the graphics processing unit (GPU) of the computer. To address these issues, we present simple but efficient approaches to first revise MATLAB code, followed by conversion to GPU-optimized code. When combined with cost-effective, high-performance GPU-enabled computers, a 4- to 500-fold improvement in algorithm execution speed is observed as shown for the image denoising Hessian-SIM algorithm. Importantly, the improved algorithm produces images identical in quality to the original. [ABSTRACT FROM AUTHOR]

The growth of the Internet of Things (IoT) has recently impacted our daily lives in many ways. As a result, a massive volume of data are generated and need to be processed in a short period of time. Therefore, a combination of computing models such as cloud computing is necessary. The main disadvantage of the cloud platform is its high latency due to the centralized mainframe. Fortunately, a distributed paradigm known as fog computing has emerged to overcome this problem, offering cloud services with low latency and high-access bandwidth to support many IoT application scenarios. However, attacks against fog servers can take many forms, such as distributed denial of service (DDoS) attacks that severely affect the reliability and availability of fog services. To address these challenges, we propose mitigation of fog computing-based SYN Flood DDoS attacks using an adaptive neuro-fuzzy inference system (ANFIS) and software defined networking (SDN) assistance (FASA). The simulation results show that the FASA system outperforms other algorithms in terms of accuracy, precision, recall, and F1-score. This shows how crucial our system is for detecting and mitigating TCP-SYN floods and DDoS attacks. [ABSTRACT FROM AUTHOR]

The concept of a "Smart City" emphasizes the need to employ information and communication technologies to strengthen the quality, connectivity, and efficiency of various municipal services. Cloud computing and the Internet of Things are shaping future tech. Both ideas greatly impact smart city application and solution development. Cloud computing is amazing at managing and storing remote service access. Several companies have switched to cloud leasing to reduce local resource burden. Due to the intricacy and flexibility of cloud-maintained services, selecting jobs that best suit client needs should be optimized. Quality of service criteria for each cloud service are the best tools for choosing and optimizing cloud carriers. Genetic algorithms (GAs) and ant colony optimization (ACO) are combined to make cloud computing. It is discovered that the recommended ACO + GA obtains an accuracy of 82% when compared to existing methods of energy- and reliability-aware multiobjective optimization method and the hybrid cuckoo particles swarm, artificial bee colony optimization (CPS + ABCO) where accuracy is 68% and 75%, respectively. [ABSTRACT FROM AUTHOR]

Aluminium alloys are gaining popularity in a diversity of engineering applications because of their extraordinary features such as strength, resistance to oxidation, and so on. AA5052 (Al-Mg series) is generally used in antirust uses, particularly in desalination related activities, due to its better resistance to corrosion in marine applications at temperature ranges up to 125°C, lower cost, better heat-carrying capacity, and nontoxicity of its corrosion components. Drilling is one of the most commonly adopted material removal processes that is adopted in numerous engineering uses. Taguchi's technique is engaged to arrange and examine the tests, by treating the drilling diameter and speed and as independent process factors. The studies were carried out using an L27 orthogonal array. Material removal rate (MRR), surface roughness (SR), and form/orientation error are deemed as output characteristics. Taguchi's analysis was engaged to discover the best process factors. ANOVA is used to examine the influence of process variables. Suitable application of artificial intelligence tools for making effective decision assists the manufacturer in accomplishing the benefits in numerous engineering domains. To obtain the maximum material removal and minimum roughness, circularity (circ), and perpendicularity errors (perp), the process variables have been optimized with the help of grey-ANFIS-amalgamated with Jaya algorithm. The multiperformance index was developed using grey theory. Statistical error analysis is used to estimate the performance of the established optimization model. Based on the investigative outcomes, the best-suited process variable combinations will be used to provide improved and enhanced multiperformance characteristics. [ABSTRACT FROM AUTHOR]

The design of new efficient maximum power point tracking (MPPT) techniques has become extremely important due to the rapid expansion of photovoltaic (PV) systems. Because under shading conditions the characteristics of PV devices become multimodal having several power peaks, traditional MPPT techniques provide crappy performance. In turn, metaheuristic algorithms have become massively employed as a typical substitute in maximum power point tracking. In this work, a new optimizer, which was named the hyperbolic slime mould algorithm (HSMA), is designed to be employed as an efficient MPPT algorithm. The hyperbolic tangent function is incorporated into the optimizer framework equations to scale down large perturbations in the tracking stage and boost its convergence trend. Moreover, to provide a strong exploration capability, a new mechanism has been developed in such a way the search process is carried out inside the best two power peak regions along the initial iterations. This region inspection mechanism is the prime hallmark of the designed optimizer in avoiding local power peaks and excessive global search operations. The developed algorithm was examined through diverse complicated partial shading conditions to challenge its global and local search abilities. A comparative analysis was carried out against the well-regarded PSO, GWO, and the standard slime mould algorithm. In overall, the designed optimizer defeated its contenders in all aspects offering higher efficiency, superior robustness, faster convergence, and fewer fluctuations to the operating point. An experimental setup that consists of the DSpace microcontroller and a PV emulator was employed to validate the algorithm overall performance. The recorded outcomes outline that the developed optimizer can achieve a tracking time of 0.6 seconds and 0.86 seconds on average, with 99.85% average efficiency under complex partial shading conditions. [ABSTRACT FROM AUTHOR]

In an automatic ultrasonic testing system constituted by an ultrasonic probe and a six-axis manipulator, the manipulator needs to run from a static state to the target velocity. To prevent equipment damage caused by sudden acceleration or deceleration, it is necessary to plan the position and pose of the end effector of the manipulator at each detected point. In this manuscript, an algorithm for planning the position and pose of the manipulator is proposed based on the information geometry structure of special orthogonal groups. As the linear operation of the orthogonal matrix corresponding to the manipulator pose is not closed, the manipulator pose at each detected point was calculated using the straightness of the Lie algebra of the special orthogonal group. The matrix information geometry algorithm enabled not only the manipulator to accelerate and decelerate uniformly along the detection trajectory, but also the angular acceleration of the end effector to accelerate uniformly at first, then keep a uniform velocity, and finally decelerate uniformly. The platform motion experiments with the Turin TKB070S six-axis manipulator are carried out to verify the effectiveness of the matrix information geometry algorithm for planning the pose of the manipulator. [ABSTRACT FROM AUTHOR]

Recently, the demand for high-precision balancing of rotors has increased in the automobile industry, as more rotors are designed to rotate at ever-higher speeds to maximize energy efficiency. The accumulation of measurement uncertainty in the balancing process decreases the accuracy of the unbalanced mass estimation, which is the ultimate goal of balancing. Here, the problem of uncertainty is shown through a Monte Carlo simulation of signals acquired from an actual production line. To reduce the effect of measurement uncertainty in the balancing procedures, a signal-processing technique that increases the dynamic reliability of the signal is proposed. The suggested method is based on density-based spatial clustering of applications with noise (DBSCAN) with the use of the orthogonality-based averaging method. Specifically, by adjusting radius values while clustering samples through the use of the DBSCAN method, the outliers that arise due to uncertainty are successfully removed. In this work, our proposed automatic-adaptive DBSCAN (AA-DBSCAN) method is validated by applying it to a balancing machine used for blower rotors in fuel cell electric vehicles. The results show that the deviation of the extracted influence coefficients is up to 0.0050, whereas the proposed method reduced it to less than 0.0037. In addition, the suggested procedure reduced the deviations of the unbalanced mass phase estimation by 35.2% as compared to the results found by the conventional method. Consequently, through the validation test, the suggested method was found to have the largest vibration decrease of any method considered in the study. [ABSTRACT FROM AUTHOR]