Adaptive Algorithm Research Articles

Moving ships detection via the trajectory feature extraction from spatiotemporal slices of infrared maritime videos

In practical application scenarios, maritime infrared videosoften contain different types of sea state scenes, weather conditions, shooting time, shooting distance, etc. In these different types of maritime videos, ship targets have great differences in size, grayscaledistribution and contrast, which brings difficulties to ship target detection.At the same time, the diversity of fluctuation, grayscale distribution and reflected light of the sea surface will bring unpredictable interference noise to ship target detection.How to accurately detect ship targets in complex and changeable maritime infrared videos is a challenging task and research focus.The key to achieving accurate ship detection is to extract robust target features that can effectively distinguish targets from all thebackground noises.In this paper, a novel infrared video ship target detection algorithm based on spatiotemporal slice target trajectory features extraction is proposed. The algorithm is very sensitive to real targets and has excellentanti-noise ability.The main innovation of the algorithm is to extract the target trajectory feature from the spatiotemporal slice of the sequence image and generate the trajectory feature map.We use the trajectory texture formed by the ship target in the spatiotemporal slice to extract the target feature, which can greatly suppress the background noise.The adaptive dilation linear model algorithm can effectively detect the target trajectory line in the spatiotemporal slice. In addition, we also make full use of the gradient of the target trajectory line to distinguish different target trajectory pixels, and propose an adaptive iterative dilation target region localization algorithm combined with gradient consistency.For object segmentation, we calculate the segmentation double-threshold using the adjacent surrounding background pixels of the target, so as to achievetarget segmentationof multiple grayscaledistribution types. Finally, in the comparison experiment, our algorithm shows superior target detection performance, especially when detecting ships from a large number of highlighted sea clutter background, the robust anti-noise ability of the algorithm can be highlighted.

Extraction of association rules in a diabetic dataset using parallel FP-growth algorithm under apache spark

This research paper focuses on enhancing the frequent pattern growth (FP-growth) algorithm, an advanced version of the Apriori algorithm, by employing a parallelization approach using the Apache Spark framework. Association rule mining, particularly in healthcare data for predicting and diagnosing diabetes, necessitates the handling of large datasets which traditional methods may not process efficiently. Our method improves the FP-growth algorithm’s scalability and processing efficiency by leveraging the distributed computing capabilities of apache spark. We conducted a comprehensive analysis of diabetes data, focusing on extracting frequent itemsets and association rules to predict diabetes onset. The results demonstrate that our parallelized FP-growth (PFP-growth) algorithm significantly enhances prediction accuracy and processing speed, offering substantial improvements over traditional methods. These findings provide valuable insights into disease progression and management, suggesting a scalable solution for large-scale data environments in healthcare analytics.<p> </p>

Low-Carbon Route Optimization Model for Multimodal Freight Transport Considering Value and Time Attributes

As the international community increasingly focuses on climate change, optimizing low-carbon transportation routes in the multimodal freight transport system has become a pressing issue. However, due to the variability in cargo properties and the influence of various factors on transportation route decisions, formulating a low-carbon and economical multimodal freight transport plan remains a significant challenge. To address the issue, this study considered cargoes with different attributes in terms of both value and time attributes. Triangular fuzzy numbers were employed to represent the uncertain demand for cargo, with confidence levels introduced for clarification. A low-carbon route decision optimization model for multimodal freight transport was established to minimize the combined transportation carbon emission and time costs. The catastrophe adaptive genetic algorithm, based on Monte Carlo sampling, was employed to solve the model using arithmetic examples. Finally, parameter sensitivity analysis revealed that adjustments to carbon tax values and changes in the proportion of electric trucks and green electricity supply had the most significant impact on the low-carbon route decision-making plan for multimodal freight transport. For low value-added and timeliness-strong cargo, a 60% increase in carbon tax value shifted the mode of transportation from road to railway. When the carbon tax increased by more than 140%, the transportation mode shifted from railway to waterway. Additionally, when the proportion of electric trucks and green electricity supply both exceeded 80%, the transportation mode between some city nodes shifted from railway to road. When these proportions increased beyond 90%, road transportation became the predominant mode.

A modified adaptive large neighborhood search algorithm for solving the multi-port continuous berth allocation problem with vessel speed optimization

Despite its fast-growing popularity in maritime transportation, container shipping is still fraught with risks and uncertainties with its complex operating environments. This paper studies the multi-port continuous berth allocation problem with speed optimization (MCBAP). In the MCBAP, vessels visit multiple ports sequentially, and the problem aims at minimizing the sum of vessel sailing cost, waiting cost, delay cost and port handling cost, while satisfying various constraints related to vessel sailing and berthing. A mixed integer linear programming (MILP) model for MCBAP is formulated, and a modified adaptive large neighborhood search (MALNS) algorithm is proposed for solving large-scale MCBAPs. In the MALNS, an efficient initial solution generation strategy is developed, and a series of neighborhood solution generation operators are proposed. Finally, the proposed MILP model and MALNS algorithm are tested on a range of MCBAP instances. The numerical results demonstrate that the MILP model can be solved to optimality with CPLEX, and the MALNS can efficiently solve instances at various scales. In addition, sensitivity analyses on fuel prices and vessel design speeds (the planned maximum speeds) are performed, and management insights have been provided.

Improving laryngeal cancer detection using chaotic metaheuristics integration with squeeze-and-excitation resnet model.

Laryngeal cancer (LC) represents a substantial world health problem, with diminished survival rates attributed to late-stage diagnoses. Correct treatment for LC is complex, particularly in the final stages. This kind of cancer is a complex malignancy inside the head and neck region of patients. Recently, researchers serving medical consultants to recognize LC efficiently develop different analysis methods and tools. However, these existing tools and techniques have various problems regarding performance constraints, like lesser accuracy in detecting LC at the early stages, additional computational complexity, and colossal time utilization in patient screening. Deep learning (DL) approaches have been established that are effective in the recognition of LC. Therefore, this study develops an efficient LC Detection using the Chaotic Metaheuristics Integration with the DL (LCD-CMDL) technique. The LCD-CMDL technique mainly focuses on detecting and classifying LC utilizing throat region images. In the LCD-CMDL technique, the contrast enhancement process uses the CLAHE approach. For feature extraction, the LCD-CMDL technique applies the Squeeze-and-Excitation ResNet (SE-ResNet) model to learn the complex and intrinsic features from the image preprocessing. Moreover, the hyperparameter tuning of the SE-ResNet approach is performed using a chaotic adaptive sparrow search algorithm (CSSA). Finally, the extreme learning machine (ELM) model was applied to detect and classify the LC. The performance evaluation of the LCD-CMDL approach occurs utilizing a benchmark throat region image database. The experimental values implied the superior performance of the LCD-CMDL approach over recent state-of-the-art approaches.

Adaptive Pseudospectral Successive Convex Optimization for Six-Degree-of-Freedom Powered Descent Guidance

Guidance for six-degrees-of-freedom powered descent is more challenging due to its stronger nonlinearity compared to three-degrees-of-freedom. The standard convex programming algorithm has been difficult to effectively address this problem. To enhance the performance of successive convex programming in terms of both optimality and accuracy, an adaptive pseudospectral successive convex optimization algorithm is proposed in this paper. First, it transforms the nonlinear optimal control problem into a convex subproblem by integrating global pseudospectral discretization with local linearization. Second, a parameter-adaptive successive convexification algorithm is proposed, which adaptively adjusts the trust region size based on the update rate of the optimal trajectory. Last, the global error and local error are accurately calculated based on the pseudospectral method. To tackle the issue of excessively large local errors caused by nonlinearity, an adaptive grid method is proposed to refine the mesh grid. Simulation results demonstrate the efficacy of the proposed pseudospectral convex optimization method and adaptive mesh grid method in reducing local errors and improving solution accuracy. Furthermore, the proposed parameter-adaptive successive convex optimization algorithm exhibits adaptability and optimality across different initial conditions, while also improving solution accuracy.

An adaptive genetic algorithm with neighborhood search for integrated O2O takeaway order assignment and delivery optimization by e-bikes with varied compartments

To improve the dining experiences, online-to-offline (O2O) takeaway services with warm-keeping or refrigerated requirements are quickly expanding and becoming popular. However, single-compartment e-bikes are commonly used in takeaway platforms, which can only meet one kind of requirements and may result in an inflexible delivery. Within this context, a new type of e-bikes, namely e-bikes with mixed compartments, is introduced. Thus, warm-keeping and refrigerated orders can be delivered by one bike, namely on one route. This paper considers an integrated order assignment and delivery problem by e-bikes with warm, refrigerated, and mixed compartments (AD-EBM). To solve the problem, we develop a novel integer programming formulation to minimize the total cost by determining order assignments and finding optimal routes, and then some properties of the solutions are provided from the view of mathematics. An algorithm is designed by combining the self-adaptive genetic algorithm with the neighborhood search method (SGA-NS). Numerical experiments are conducted based on simulated different-scale takeaway instances. The experimental results highlight the excellent performance of the SGA-NS and the results are quite encouraging compared with Gurobi solver, SGA, and NS. The results of the model comparison demonstrate that the AD-EBM offers 12.38% total cost savings on average, compared to using only single-compartment e-bikes. A sensitivity analysis is performed to explore the effects of the mixed compartment costs, the customer acceptable delay time, the penalty costs for delays, and the e-bike capacity for the platform’s daily operations. Some management insights are provided to facilitate the O2O takeaway delivery.

Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models.

In deep learning, different kinds of deep networks typically need different optimizers, which have to be chosen after multiple trials, making the training process inefficient. To relieve this issue and consistently improve the model training speed across deep networks, we propose the ADAptive Nesterov momentum algorithm, Adan for short. Adan first reformulates the vanilla Nesterov acceleration to develop a new Nesterov momentum estimation (NME) method, which avoids the extra overhead of computing gradient at the extrapolation point. Then Adan adopts NME to estimate the gradient's first- and second-order moments in adaptive gradient algorithms for convergence acceleration. Besides, we prove that Adan finds an ϵ-approximate first-order stationary point within O(ϵ-3.5) stochastic gradient complexity on the non-convex stochastic problems (e.g., deep learning problems), matching the best-known lower bound. Extensive experimental results show that Adan consistently surpasses the corresponding SoTA optimizers on vision, language, and RL tasks and sets new SoTAs for many popular networks and frameworks, e.g., ResNet, ConvNext, ViT, Swin, MAE, DETR, GPT-2, Transformer-XL, and BERT. More surprisingly, Adan can use half of the training cost (epochs) of SoTA optimizers to achieve higher or comparable performance on ViT, GPT-2, MAE, etc, and also shows great tolerance to a large range of minibatch size, e.g., from 1 k to 32 k.

Automatic detection of subsurface defects of concrete slabs by domain adaptation algorithm

Automatic detection of subsurface defects of concrete slabs by domain adaptation algorithm

Performance analysis of cascade spline adaptive filtering based on normalized orthogonal gradient adaptive algorithm

Performance analysis of cascade spline adaptive filtering based on normalized orthogonal gradient adaptive algorithm

Quantum-enhanced algorithms for real-time processing in cryptographic systems: A path towards post-quantum security

New technologies such as quantum computing present a major challenge to the current cryptographic systems; thus, quantum-resistant techniques are required. This work describes a new approach for adapting QE schemes to real-life IT security applications, giving a glimpse of the way to post-quantum security. Hence, the architecture proposed here incorporates classical and quantum methods to present a vast enhancement in speed and the stability of security. The system seeks to solve this problem using a hybrid quantum-classical computing strategy. It achieves a 470 percent performance improvement in latency while withstanding both classical and post-quantum attacks concurrently. Field experiments and numerous tests for the accuracy and practicability of the framework established its elasticity and robustness. This research suggests many directions for further research – improving the efficiency of merging quantum-classical users, studying the adaptive quantum algorithms issue, and employing machine learning technology for the identification of threats. The applicability of quantum-enhanced cryptographic processing in producing practical and commercially viable technology highlights the significant advances that have been made in guaranteeing the security of sensitive applications in the coming years, including commerce and appeals. The findings of this type of work can be helpful to the continuous process of establishing post-quantum cryptographic standards and increasing the use of quantum-safe technologies.

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Optimum solution of power flow problem based on search and rescue algorithm

AbstractIn order to solve the optimal power flow (OPF) problem, a unique algorithm based on a search and rescue method is applied in this study. For the OPF problem under three objective functions, the SAR offers a straightforward and reliable solution. The three objective functions are used to minimize the fuel cost, power loss and voltage deviation as a single objective function. The OPF problem for benchmark test system, including the IEEE-14 bus, IEEE-30 bus, and IEEE-57 bus, are solved by the Search and Rescue algorithm (SAR) under specific objective functions that are determined by the operational and economic performance indices of the power system. To demonstrate the efficacy and possibilities of the SAR algorithm, SAR is contrasted with alternative optimization techniques such as harmony search algorithm, gradient method, adaptive genetic algorithm, biogeography-based optimization, Artificial bee colony, gravitational search algorithm, particle swarm optimization, Jaya algorithm, enhanced genetic algorithm, modified shuffle frog leaping algorithm, practical swarm optimizer, Moth flam optimizer, whale and moth flam optimizer, grey wolf optimizer, cheap optimization algorithm and differential evolution algorithm. The value of minimum power losses based on SAR technique is equal to 0.459733441487247 MW for IEEE-14 bus. The value of minimum total fuel cost based on SAR technique is equal to 8051.12225602148 $/h for IEEE-14 bus. The value of minimum voltage deviation based on SAR technique is equal to 0.0357680148269292 for IEEE-14 bus. The value of minimum power losses based on SAR technique is equal to 2.71286428848434 MW for IEEE-30 bus. The value of minimum total fuel cost based on SAR technique is equal to 798.197578585806 $/h for IEEE-30 bus. The value of minimum voltage deviation based on SAR technique is equal to 0.0978069572088536 for IEEE-30 bus. The value of minimum total fuel cost based on SAR technique is equal to 38017.7691758245 $/h for IEEE-57 bus. The acquired results for the OPF compared to all competitor algorithms in every case of fitness function demonstrate the superiority of the SAR method.

PID control algorithm based on multistrategy enhanced dung beetle optimizer and back propagation neural network for DC motor control.

Traditional Proportional-Integral-Derivative (PID) control systems often encounter challenges related to nonlinearity and time-variability. Original dung beetle optimizer (DBO) offers fast convergence and strong local exploitation capabilities. However, they are limited by poor exploration capabilities, imbalance between exploration and exploitation phases, and insufficient precision in global search. This paper proposes a novel adaptive PID control algorithm based on enhanced dung beetle optimizer (EDBO) and back propagation neural network (BPNN). Firstly, the diversity of exploration is increased by incorporating a merit-oriented mechanism into the rolling behavior. Then, a sine learning factor is introduced to balance the global exploration and local exploitation capabilities. Additionally, a dynamic spiral search strategy and adaptive [Formula: see text]-distribution disturbance are presented to enhance search precision and global search capability. The BPNN is employed to fine-tune both PID and network parameters, leveraging its powerful generalization and learning ability to model nonlinear system dynamics. In the simplified motor experiments, the proposed controller achieved the lowest overshoot (0.5%) and the shortest response time (0.012s), with a settling time of 0.02s and a steady-state error of just 0.0010. In another set of experiments, the proposed controller recorded an overshoot and response time of 0.7% and 0.0010s, across five DC motor tests. These results demonstrate the proposed adaptive PID control algorithm has superior performance in optimizing control system parameters, as well as improving system robustness and stability.

Adaptive algorithms for drone flight control under communication constraints and information incompleteness

Abstract With the rapid increase in the use of drones in various applications, including commercial and governmental, and the increasing probability of communication failures and contingencies, research becomes critical to ensure the safety and efficiency of their operations. The aim of this research is to develop adaptive drone flight control algorithms capable of operating effectively under conditions of limited communication and incomplete information to ensure reliable and safe autonomous operation of these systems. The applied methods include computer modelling and simulation, analytical, statistical, functional, deductive and descriptive methods. The study found that the use of performance evaluation methods for complex systems enables the identification of safety and performance criteria for drones, and drone flight control provides basic principles and methods that can be adapted for drones, including autopiloting and navigation. In addition, analyses of satellite communication and navigation prove the need to consider the limitations of this technology when developing drone control algorithms. The combination of these techniques allows for more robust and adaptive drone control systems that can function effectively in complex environments such as communication limitations and incomplete information. Additionally, it was found that the integration of adaptive control algorithms based on these methods allows drones to effectively adapt to variable environmental conditions and make decisions quickly even when communication is lost or information is limited.

Generalized Entropy and Solution Information for Measuring Puzzle Difficulty

Metrics for problem difficulty are used by many puzzle generation algorithms, as well as by adaptive algorithms that want to provide players with the puzzles at the correct level of difficulty. A recently proposed general metric, puzzle entropy, combines an analysis of game mechanics with a model of player knowledge in the form of inference rules to predict problem difficulty. The entropy of a puzzle is the amount of information required, given a player’s knowledge about the puzzle, to describe a solution to a puzzle. This paper generalizes the concepts of puzzle entropy and solution information, providing a better foundation for the previous work and creating new algorithms, Minimum Solution Information and Total Solution Information. While functionally very similar to past work, the new algorithm allows knowledge about a puzzle to be represented as a policy, something that can be learned more easily. We then evaluate the impact of policies, inference rules, and player knowledge in the 2016 game, The Witness.

Study on intelligent recognition of urban road subgrade defect based on deep learning.

China's operational highway subgrades exhibit a trend of diversifying types and an increasing number of defects, leading to more frequent urban road safety incidents. This paper starts from the non-destructive testing of urban road subgrade defects using geological radar, aiming to achieve intelligent identification of subgrade pathologies with geological radar. The GprMax forward simulation software is used to establish multi-layer composite structural models of the subgrade, studying the characteristics of geological radar images for different types of subgrade diseases. Based on the forward simulation images of geological radar for subgrade defects and field measurement data, a geological radar subgrade defect image database is established. The Faster R-CNN deep learning algorithm is applied to achieve target detection, recognition, and classification of subgrade defect images. By comparing the loss value, total number of identified regions, and recognition accuracy as metrics, the study compares four improved versions of the Faster R-CNN algorithm. The results indicate that the faster_rcnn_inception_v2 version is more suitable for the intelligent identification of non-destructive testing of urban road subgrade defects.

Monocular Visual–Inertial Odometer Based on Adaptive Variational Bayes Algorithm

Monocular Visual–Inertial Odometer Based on Adaptive Variational Bayes Algorithm

A Helium Speech Correction Method Based on Generative Adversarial Networks

The distortion of helium speech caused by helium−oxygen gas mixtures significantly impacts the safety and communication efficiency of saturation divers. Although existing correction methods have shown some effectiveness in improving the intelligibility of helium speech, challenges remain in enhancing clarity and high−pitch correction. To address the issue of degraded speech quality post−correction, a novel helium speech correction method based on generative adversarial networks (GANs) is proposed. Firstly, a new helium speech dataset is introduced, which includes isolated words and continuous speech in both Chinese and English. By training and testing on both isolated words and continuous passages, the correction capability of the model can be accurately evaluated. Secondly, a new evaluation system for helium speech correction is proposed, which partially fills the gap in current helium speech evaluation metrics. This system uses comprehensive similarity to evaluate the similarity of keywords at the sentence level, thus assessing the correction results of helium speech from both word and sentence dimensions. Lastly, a GAN−based helium speech correction method is designed. This method solves the problems of pitch period distortion and formant shift in helium speech by introducing an adaptive speech segmentation algorithm and a fusion loss function and significantly improves the clarity and intelligibility of corrected helium speech. The experimental results show that the corrected helium speech is improved in clarity and intelligibility, which shows its practical value and application potential.

Predicting the body weight of crossbred Holstein × Zebu dairy cows using multivariate adaptive regression splines algorithm.

This study aimed to estimate live body weight from body measurements for Holstein × Zebu dairy cows (n = 156) reared under conditions of humid tropics in Mexico using multivariate adaptive regression splines algorithm (MARS) with several train-test proportions. The body measurements included withers height, rump height, hip width, heart girth, body length and diagonal body length. The data were divided into 65:35, 70:30 and 80:20 split data for training and testing sets, respectively. The MARS algorithm was used to construct a prediction model, which predicted the body weight from the body measurements of the test dataset. The results emphasized that the MARS algorithm had an explanation rate for 80:20 train and test set of 0.836 and 0.711, respectively, with minimum Akaike information criterion values. This indicates that it is a reliable way of predicting body weight from body measurements. The results suggest that body weight prediction can be performed with the MARS algorithm in a reliable way, therefore, this algorithm may be a useful tool for animal breeders and researchers in the development of feeding and selection-aimed approaches.