Search

Operational amplifiers (Op-Amps) are critical to sensor systems because they enable precise, reliable, and flexible signal processing. Current automated Op-Amp generation methods suffer from extremely low efficiency because the time-consuming SPICE-in-the-loop sizing is normally involved as its inner loop. In this paper, we propose an efficiently automated Op-Amp generation tool using a hybrid sizing method, which combines the merits together from a deterministic optimization algorithm and differential evolution algorithm. Thus, it can not only quickly find a decent local optimum, but also eventually converge to a global optimum. This feature is well fit to be serving as an acute filter in the circuit structure evaluation flow to efficiently eliminate any undesirable circuit structures in advance of detailed sizing. Our experimental results demonstrate its superiority over traditional sizing approaches and show its efficacy in highly boosting the efficiency of automated Op-Amp structure generation. [ABSTRACT FROM AUTHOR]

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ0-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ0-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. [ABSTRACT FROM AUTHOR]

The mobile node location method can find unknown nodes in real time and capture the movement trajectory of unknown nodes in time, which has attracted more and more attention from researchers. Due to their advantages of simplicity and efficiency, intelligent optimization algorithms are receiving increasing attention. Compared with other algorithms, the black hole algorithm has fewer parameters and a simple structure, which is more suitable for node location in wireless sensor networks. To address the problems of weak merit-seeking ability and slow convergence of the black hole algorithm, this paper proposed an opposition-based learning black hole (OBH) algorithm and utilized it to improve the accuracy of the mobile wireless sensor network (MWSN) localization. To verify the performance of the proposed algorithm, this paper tests it on the CEC2013 test function set. The results indicate that among the several algorithms tested, the OBH algorithm performed the best. In this paper, several optimization algorithms are applied to the Monte Carlo localization algorithm, and the experimental results show that the OBH algorithm can achieve the best optimization effect in advance. [ABSTRACT FROM AUTHOR]

In an effort to overcome the problem that the traditional stochastic resonance system cannot adjust the structural parameters adaptively in bearing fault-signal detection, this article proposes an adaptive-parameter bearing fault-detection method. First of all, the four strategies of Sobol sequence initialization, exponential convergence factor, adaptive position update, and Cauchy–Gaussian hybrid variation are used to improve the basic grey wolf optimization algorithm, which effectively improves the optimization performance of the algorithm. Then, based on the multistable stochastic resonance model, the structure parameters of the multistable stochastic resonance are optimized through improving the grey wolf algorithm, so as to enhance the fault signal and realize the effective detection of the bearing fault signal. Finally, the proposed bearing fault-detection method is used to analyze and diagnose two open-source bearing data sets, and comparative experiments are conducted with the optimization results of other improved algorithms. Meanwhile, the method proposed in this paper is used to diagnose the fault of the bearing in the lifting device of a single-crystal furnace. The experimental results show that the fault frequency of the inner ring of the first bearing data set diagnosed using the proposed method was 158 Hz, and the fault frequency of the outer ring of the second bearing data set diagnosed using the proposed method was 162 Hz. The fault-diagnosis results of the two bearings were equal to the results derived from the theory. Compared with the optimization results of other improved algorithms, the proposed method has a faster convergence speed and a higher output signal-to-noise ratio. At the same time, the fault frequency of the bearing of the lifting device of the single-crystal furnace was effectively diagnosed as 35 Hz, and the bearing fault signal was effectively detected. [ABSTRACT FROM AUTHOR]

Tungsten heavy alloys (WHAs) are an extremely hard-to-machine material extensively used in demanding applications such as missile liners, aerospace, and optical molds. However, the machining of WHAs remains a challenging task as a result of their high density and elastic stiffness which lead to the deterioration of the machined surface roughness. This paper proposes a brand-new multi-objective dung beetle algorithm. It does not take the cutting parameters (i.e., cutting speed, feed rate, and depth of cut) as the optimization objects but directly optimizes cutting forces and vibration signals monitored using a multi-sensor (i.e., dynamometer and accelerometer). The cutting parameters in the WHA turning process are analyzed through the use of the response surface method (RSM) and the improved dung beetle optimization algorithm. Experimental verification shows that the algorithm has better convergence speed and optimization ability compared with similar algorithms. The optimized forces and vibration are reduced by 9.7% and 46.47%, respectively, and the surface roughness Ra of the machined surface is reduced by 18.2%. The proposed modeling and optimization algorithms are anticipated to be powerful to provide the basis for the parameter optimization in the cutting of WHAs. [ABSTRACT FROM AUTHOR]

The presence of manufacture error in large mirrors introduces high-order aberrations, which can severely influence the intensity distribution of point spread function. Therefore, high-resolution phase diversity wavefront sensing is usually needed. However, high-resolution phase diversity wavefront sensing is restricted with the problem of low efficiency and stagnation. This paper proposes a fast high-resolution phase diversity method with limited memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm, which can accurately detect aberrations in the presence of high-order aberrations. An analytical gradient of the objective function for phase-diversity is integrated into the framework of the L-BFGS nonlinear optimization algorithm. L-BFGS algorithm is specifically suitable for high-resolution wavefront sensing where a large phase matrix is optimized. The performance of phase diversity with L-BFGS is compared to other iterative method through simulations and a real experiment. This work contributes to fast high-resolution image-based wavefront sensing with a high robustness. [ABSTRACT FROM AUTHOR]

Intrusion detection systems (IDS) play a crucial role in securing networks and identifying malicious activity. This is a critical problem in cyber security. In recent years, metaheuristic optimization algorithms and deep learning techniques have been applied to IDS to improve their accuracy and efficiency. Generally, optimization algorithms can be used to boost the performance of IDS models. Deep learning methods, such as convolutional neural networks, have also been used to improve the ability of IDS to detect and classify intrusions. In this paper, we propose a new IDS model based on the combination of deep learning and optimization methods. First, a feature extraction method based on CNNs is developed. Then, a new feature selection method is used based on a modified version of Growth Optimizer (GO), called MGO. We use the Whale Optimization Algorithm (WOA) to boost the search process of the GO. Extensive evaluation and comparisons have been conducted to assess the quality of the suggested method using public datasets of cloud and Internet of Things (IoT) environments. The applied techniques have shown promising results in identifying previously unknown attacks with high accuracy rates. The MGO performed better than several previous methods in all experimental comparisons. [ABSTRACT FROM AUTHOR]

Modal-free optimization algorithms do not require specific mathematical models, and they, along with their other benefits, have great application potential in adaptive optics. In this study, two different algorithms, the single-dimensional perturbation descent algorithm (SDPD) and the second-order stochastic parallel gradient descent algorithm (2SPGD), are proposed for wavefront sensorless adaptive optics, and a theoretical analysis of the algorithms' convergence rates is presented. The results demonstrate that the single-dimensional perturbation descent algorithm outperforms the stochastic parallel gradient descent (SPGD) and 2SPGD algorithms in terms of convergence speed. Then, a 32-unit deformable mirror is constructed as the wavefront corrector, and the SPGD, single-dimensional perturbation descent, and 2SPSA algorithms are used in an adaptive optics numerical simulation model of the wavefront controller. Similarly, a 39-unit deformable mirror is constructed as the wavefront controller, and the SPGD and single-dimensional perturbation descent algorithms are used in an adaptive optics experimental verification device of the wavefront controller. The outcomes demonstrate that the convergence speed of the algorithm developed in this paper is more than twice as fast as that of the SPGD and 2SPGD algorithms, and the convergence accuracy of the algorithm is 4% better than that of the SPGD algorithm. [ABSTRACT FROM AUTHOR]

Currently, magnetic gradient tensor-based localization methods face challenges such as significant errors in geomagnetic field estimation, susceptibility to local optima in optimization algorithms, and inefficient performance. In addressing these issues, this article propose a two-point localization method under the constraint of overlaying geometric invariants. This method initially establishes the relationship between the target position and the magnetic gradient tensor by substituting an intermediate variable for the magnetic moment. Exploiting the property of the eigenvector corresponding to the minimum absolute eigenvalue being perpendicular to the target position vector, this constraint is superimposed to formulate a nonlinear system of equations of the target's position. In the process of determining the target position, the Nara method is employed for obtaining the initial values, followed by the utilization of the Levenberg–Marquardt algorithm to derive a precise solution. Experimental validation through both simulations and experiments confirms the effectiveness of the proposed method. The results demonstrate its capability to overcome the challenges faced by a single-point localization method in the presence of some errors in geomagnetic field estimation. In comparison to traditional two-point localization methods, the proposed method exhibits the highest precision. The localization outcomes under different noise conditions underscore the robust noise resistance and resilience of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the algorithms for traversal exploration and path coverage of target regions using multiple agents, enabling the efficient deployment of a set of agents to cover a complex region. First, the original multi-agent path planning problem (mCPP) is transformed into several single-agent sub-problems, by dividing the target region into multiple balanced sub-regions, which reduces the explosive combinatorial complexity; subsequently, closed-loop paths are planned in each sub-region by the rapidly exploring random trees (RRT) algorithm to ensure continuous exploration and repeated visits to each node of the target region. On this basis, we also propose two improvements: for the corner case of narrow regions, the use of geodesic distance is proposed to replace the Eulerian distance in Voronoi partitioning, and the iterations for balanced partitioning can be reduced by more than one order of magnitude; the Dijkstra algorithm is introduced to assign a smaller weight to the path cost when the geodesic direction changes, which makes the region division more "cohesive", thus greatly reducing the number of turns in the path and making it more robust. The final optimization algorithm ensures the following characteristics: complete coverage of the target area, wide applicability of multiple area shapes, reasonable distribution of exploration tasks, minimum average waiting time, and sustainable exploration without any preparation phase. [ABSTRACT FROM AUTHOR]

Intelligent workshop UAV inspection path planning is a typical indoor UAV path planning technology. The UAV can conduct intelligent inspection on each work area of the workshop to solve or provide timely feedback on problems in the work area. The sparrow search algorithm (SSA), as a novel swarm intelligence optimization algorithm, has been proven to have good optimization performance. However, the reduction in the SSA's search capability in the middle or late stage of iterations reduces population diversity, leading to shortcomings of the algorithm, including low convergence speed, low solution accuracy and an increased risk of falling into local optima. To overcome these difficulties, an improved sparrow search algorithm (namely the chaotic mapping–firefly sparrow search algorithm (CFSSA)) is proposed by integrating chaotic cube mapping initialization, firefly algorithm disturbance search and tent chaos mapping perturbation search. First, chaotic cube mapping was used to initialize the population to improve the distribution quality and diversity of the population. Then, after the sparrow search, the firefly algorithm disturbance and tent chaos mapping perturbation were employed to update the positions of all individuals in the population to enable a full search of the algorithm in the solution space. This technique can effectively avoid falling into local optima and improve the convergence speed and solution accuracy. The simulation results showed that, compared with the traditional intelligent bionic algorithms, the optimized algorithm provided a greatly improved convergence capability. The feasibility of the proposed algorithm was validated with a final simulation test. Compared with other SSA optimization algorithms, the results show that the CFSSA has the best efficiency. In an inspection path planning problem, the CFSSA has its advantages and applicability and is an applicable algorithm compared to SSA optimization algorithms. [ABSTRACT FROM AUTHOR]

Since the rolling bearing fault signal captured by a vibration sensor contains a large amount of background noise, fault features cannot be accurately extracted. To address this problem, a rolling bearing fault feature extraction algorithm based on improved pelican optimization algorithm (IPOA)–variable modal decomposition (VMD) and multipoint optimal minimum entropy deconvolution adjustment (MOMEDA) methods is proposed. Firstly, the pelican optimization algorithm (POA) was improved using a reverse learning strategy for dimensional-by-dimensional lens imaging and circle mapping, and the optimization performance of IPOA was verified. Secondly, the kurtosis-square envelope Gini coefficient criterion was used to select the optimal modal components from the decomposed components of the signal, and MOMEDA was used to process the optimal modal components in order to obtain the optimal deconvolution signal. Finally, the Teager energy operator (TEO) was employed to demodulate and analyze the optimally deconvoluted signal in order to enhance the transient shock component of the original fault signal. The effectiveness of the proposed method was verified using simulated and actual signals. The results showed that the proposed method can accurately extract failure characteristics in the presence of strong background noise interference. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) represents a cutting-edge technical domain, encompassing billions of intelligent objects capable of bridging the physical and virtual worlds across various locations. IoT services are responsible for delivering essential functionalities. In this dynamic and interconnected IoT landscape, providing high-quality services is paramount to enhancing user experiences and optimizing system efficiency. Service composition techniques come into play to address user requests in IoT applications, allowing various IoT services to collaborate seamlessly. Considering the resource limitations of IoT devices, they often leverage cloud infrastructures to overcome technological constraints, benefiting from unlimited resources and capabilities. Moreover, the emergence of fog computing has gained prominence, facilitating IoT application processing in edge networks closer to IoT sensors and effectively reducing delays inherent in cloud data centers. In this context, our study proposes a cloud-/fog-based service composition for IoT, introducing a novel fuzzy-based hybrid algorithm. This algorithm ingeniously combines Ant Colony Optimization (ACO) and Artificial Bee Colony (ABC) optimization algorithms, taking into account energy consumption and Quality of Service (QoS) factors during the service selection process. By leveraging this fuzzy-based hybrid algorithm, our approach aims to revolutionize service composition in IoT environments by empowering intelligent decision-making capabilities and ensuring optimal user satisfaction. Our experimental results demonstrate the effectiveness of the proposed strategy in successfully fulfilling service composition requests by identifying suitable services. When compared to recently introduced methods, our hybrid approach yields significant benefits. On average, it reduces energy consumption by 17.11%, enhances availability and reliability by 8.27% and 4.52%, respectively, and improves the average cost by 21.56%. [ABSTRACT FROM AUTHOR]

The internal structure of wind turbines is intricate and precise, although the challenging working conditions often give rise to various operational faults. This study aims to address the limitations of traditional machine learning algorithms in wind turbine fault detection and the imbalance of positive and negative samples in the fault detection dataset. To achieve the real-time detection of wind turbine group faults and to capture wind turbine fault state information, an enhanced ASL-CatBoost algorithm is proposed. Additionally, a crawling animal search algorithm that incorporates the Tent chaotic mapping and t-distribution mutation strategy is introduced to assess the sensitivity of the ASL-CatBoost algorithm toward hyperparameters and the difficulty of manual hyperparameter setting. The effectiveness of the proposed hyperparameter optimization strategy, termed the TtRSA algorithm, is demonstrated through a comparison of traditional intelligent optimization algorithms using 11 benchmark test functions. When applied to the hyperparameter optimization of the ASL-CatBoost algorithm, the TtRSA-ASL-CatBoost algorithm exhibits notable enhancements in accuracy, recall, and other performance measures compared with the ASL-CatBoost algorithm and other ensemble learning algorithms. The experimental results affirm that the proposed algorithm model improvement strategy effectively enhances the wind turbine fault detection classification recognition rate. [ABSTRACT FROM AUTHOR]

Accurate localization is a critical task in underwater navigation. Typical localization methods use a set of acoustic sensors and beacons to estimate relative position, whose geometric configuration has a significant impact on the localization accuracy. Although there is much effort in the literature to define optimal 2D or 3D sensor placement, the optimal sensor placement in irregular and constrained 3D surfaces, such as autonomous underwater vehicles (AUVs) or other structures, is not exploited for improving localization. Additionally, most applications using AUVs employ commercial acoustic modems or compact arrays, therefore the optimization of the placement of spatially independent sensors is not a considered issue. This article tackles acoustic sensor placement optimization in irregular and constrained 3D surfaces, for inverted ultra-short baseline (USBL) approaches, to improve localization accuracy. The implemented multi-objective memetic algorithm combines an evaluation of the geometric sensor's configuration, using the Cramer-Rao Lower Bound (CRLB), with the incidence angle of the received signal. A case study is presented over a simulated homing and docking scenario to demonstrate the proposed optimization algorithm. [ABSTRACT FROM AUTHOR]

Effective scheduling algorithms are needed in the cloud paradigm to leverage services to customers seamlessly while minimizing the makespan, energy consumption and SLA violations. The ineffective scheduling of resources while not considering the suitability of tasks will affect the quality of service of the cloud provider, and much more energy will be consumed in the running of tasks by the inefficient provisioning of resources, thereby taking an enormous amount of time to process tasks, which affects the makespan. Minimizing SLA violations is an important aspect that needs to be addressed as it impacts the makespans, energy consumption, and also the quality of service in a cloud environment. Many existing studies have solved task-scheduling problems, and those algorithms gave near-optimal solutions from their perspective. In this manuscript, we developed a novel task-scheduling algorithm that considers the task priorities coming onto the cloud platform, calculates their task VM priorities, and feeds them to the scheduler. Then, the scheduler will choose appropriate tasks for the VMs based on the calculated priorities. To model this scheduling algorithm, we used the cat swarm optimization algorithm, which was inspired by the behavior of cats. It was implemented on the Cloudsim tool and OpenStack cloud platform. Extensive experimentation was carried out using real-time workloads. When compared to the baseline PSO, ACO and RATS-HM approaches and from the results, it is evident that our proposed approach outperforms all of the baseline algorithms in view of the above-mentioned parameters. [ABSTRACT FROM AUTHOR]

During the design of a wheeled mobile robot, the problem of the proper selection of the parameters of its motor controllers was encountered. Knowing the parameters of the robot's Permanent Magnet Direct Current (PMDC) motors, precise tuning of the controllers can be performed, which then results in improved robot dynamics. Among many methods of parametric model identification, optimization-based techniques, particularly genetic algorithms, have gained more and more interest recently. The articles on this topic present the results of parameter identification, but they do not refer to the search ranges for individual parameters. With too wide a range, genetic algorithms do not find solutions or are time-inefficient. This article introduces a method for determining the parameters of a PMDC motor. The proposed method performs an initial estimation of the range of searched parameters to shorten the estimation time of the bioinspired optimization algorithm. [ABSTRACT FROM AUTHOR]

In 2016, Google proposed a congestion control algorithm based on bottleneck bandwidth and round-trip propagation time (BBR). The BBR congestion control algorithm measures the network bottleneck bandwidth and minimum delay in real-time to calculate the bandwidth delay product (BDP) and then adjusts the transmission rate to maximize throughput and minimize latency. However, relevant research reveals that BBR still has issues such as RTT unfairness, high packet loss rate, and deep buffer performance degradation. This article focuses on its most prominent RTT fairness issue as a starting point for optimization research. Using fluid models to describe the data transmission process in BBR congestion control, a fairness optimization strategy based on pacing gain is proposed. Triangular functions, inverse proportional functions, and gamma correction functions are analyzed and selected to construct the pacing gain model, forming three different adjustment functions for adaptive adjustment of the transmission rate. Simulation and real experiments show that the three optimization algorithms significantly improve the fairness and network transmission performance of the original BBR algorithm. In particular, the optimization algorithm that employs the gamma correction function as the gain model exhibits the best stability. [ABSTRACT FROM AUTHOR]

The communication in quarantined areas, e.g., due to the new COVID-19 pandemic, between isolated areas and in areas with technical damage has resulted in a great deal of interest concerning the safety of the population. A new method for ensuring communication between different areas, using unmanned aerial vehicle (UAV) networks with a well-established mobility schedule is proposed. UAVs fly based on a mission plan using regular polygons covering an area from a map. The area is considered to be equidistantly covered with points, grouped in triangles which are further grouped into hexagons. In this paper, UAVs, including battery charging or battery swapping stations and light weight Wi-Fi boards, are used for the data transfer among drones and stations using delivery protocols. UAV network analysis and evaluation (lengths of the arcs in seconds) based on experimental preliminary flight tests are proposed. Multiple simulations are performed based on six DTN algorithms, single-copy, and multiple-copies algorithms, and the efficiency of data transmission (delivery rate and latency) is analyzed. A very good delivery rate of 0.973 is obtained using the newly introduced TD-UAV Dijkstra algorithm. [ABSTRACT FROM AUTHOR]

Advancements in electronics and software have enabled the rapid development of unmanned aerial vehicles (UAVs) and UAV-assisted applications. Although the mobility of UAVs allows for flexible deployment of networks, it introduces challenges regarding throughput, delay, cost, and energy. Therefore, path planning is an important aspect of UAV communications. Bio-inspired algorithms rely on the inspiration and principles of the biological evolution of nature to achieve robust survival techniques. However, the issues have many nonlinear constraints, which pose a number of problems such as time restrictions and high dimensionality. Recent trends tend to employ bio-inspired optimization algorithms, which are a potential method for handling difficult optimization problems, to address the issues associated with standard optimization algorithms. Focusing on these points, we investigate various bio-inspired algorithms for UAV path planning over the past decade. To the best of our knowledge, no survey on existing bio-inspired algorithms for UAV path planning has been reported in the literature. In this study, we investigate the prevailing bio-inspired algorithms extensively from the perspective of key features, working principles, advantages, and limitations. Subsequently, path planning algorithms are compared with each other in terms of their major features, characteristics, and performance factors. Furthermore, the challenges and future research trends in UAV path planning are summarized and discussed. [ABSTRACT FROM AUTHOR]