Smart Bubble Sort:A Novel and Dynamic Variant of Bubble Sort Algorithm

In the present era,a very huge volume of data is being stored in online and offline databases.Enterprise houses,research,medical as well as healthcare organizations,and academic institutions store data in databases and their subsequent retrievals are performed for further processing.Finding the required data from a given database within the minimum possible time is one of the key factors in achieving the best possible performance of any computer-based application.If the data is already sorted,finding or searching is comparatively faster.In real-life scenarios,the data collected from different sources may not be in sorted order.Sorting algorithms are required to arrange the data in some order in the least possible time.In this paper,I propose an intelligent approach towards designing a smart variant of the bubble sort algorithm.I call it Smart Bubble sort that exhibits dynamic footprint:The capability of adapting itself from the average-case to the best-case scenario.It is an in-place sorting algorithm and its best-case time complexity isΩ(n).It is linear and better than bubble sort,selection sort,and merge sort.In averagecase and worst-case analyses,the complexity estimates are based on its static footprint analyses.Its complexity in worst-case is O(n2)and in average-case isΘ(n^(2)).Smart Bubble sort is capable of adapting itself to the best-case scenario from the average-case scenario at any subsequent stages due to its dynamic and intelligent nature.The Smart Bubble sort outperforms bubble sort,selection sort,and merge sort in the best-case scenario whereas it outperforms bubble sort in the average-case scenario.

Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm

This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.

Accelerating Large-Scale Sorting through Parallel Algorithms

This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.

Improvement of Counting Sorting Algorithm

By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency than the original counting sort while maintaining the original stability. Compared with the original counting sort, it has a wider scope of application and better time and space efficiency. In addition, the accuracy of the above conclusions can be proved by a large amount of experimental data.

Improved non-dominated sorting genetic algorithm (NSGA)-II in multi-objective optimization studies of wind turbine blades

The non-dominated sorting genetic algorithm （NSGA） is improved with the controlled elitism and dynamic crowding distance. A novel multi-objective optimization algorithm is obtained for wind turbine blades. As an example, a 5 MW wind turbine blade design is presented by taking the maximum power coefficient and the minimum blade mass as the optimization objectives. The optimal results show that this algorithm has good performance in handling the multi-objective optimization of wind turbines, and it gives a Pareto-optimal solution set rather than the optimum solutions to the conventional multi objective optimization problems. The wind turbine blade optimization method presented in this paper provides a new and general algorithm for the multi-objective optimization of wind turbines.

Multi-objective optimization of water supply network rehabilitation with non-dominated sorting Genetic Algorithm-II

Through the transformation of hydraulic constraints into the objective functions associated with a water supply network rehabilitation problem, a non-dominated sorting Genetic Algorithm-II (NSGA-II) can be used to solve the altered multi-objective optimization model. The introduction of NSGA-II into water supply network optimal rehabilitation problem solves the conflict between one fitness value of standard genetic algorithm (SGA) and multi-objectives of rehabilitation problem. And the uncertainties brought by using weight coefficients or punish functions in conventional methods are controlled. And also by in-troduction of artificial inducement mutation (AIM) operation, the convergence speed of population is accelerated;this operation not only improves the convergence speed, but also improves the rationality and feasibility of solutions.

GREEDY NON-DOMINATED SORTING IN GENETIC ALGORITHM-ⅡFOR VEHICLE ROUTING PROBLEM IN DISTRIBUTION

Vehicle routing problem in distribution （VRPD） is a widely used type of vehicle routing problem （VRP）, which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm （GA）, non-dominated sorting in genetic algorithm-Ⅱ （NSGA-Ⅱ） also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ （GNSGA-Ⅱ） is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-Ⅱ is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-Ⅱ, premature convergence is better avoided and search efficiency has been improved sharply.

An Only-Once-Sorting Algorithm

This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The algorithm completes sorting a sequence of n elements in a calculation time of O(n ).

PMS-Sorting:A New Sorting Algorithm Based on Similarity

Borda sorting algorithm is a kind of improvement algorithm based on weighted position sorting algorithm,it is mainly suitable for the high duplication of search results,for the independent search results,the effect is not very good and the computing method of relative score in Borda sorting algorithm is according to the rule of the linear regressive,but position relationship cannot fully represent the correlation changes.aimed at this drawback,the new sorting algorithm is proposed in this paper,named PMS-Sorting algorithm,firstly the position score of the returned results is standardized processing,and the similarity retrieval word string with the query results is combined into the algorithm,the similarity calculation method is also improved,through the experiment,the improved algorithm is superior to traditional sorting algorithm.

An Optimization Approach for Convolutional Neural Network Using Non-Dominated Sorted Genetic Algorithm-Ⅱ

In computer vision,convolutional neural networks have a wide range of uses.Images representmost of today’s data,so it’s important to know how to handle these large amounts of data efficiently.Convolutional neural networks have been shown to solve image processing problems effectively.However,when designing the network structure for a particular problem,you need to adjust the hyperparameters for higher accuracy.This technique is time consuming and requires a lot of work and domain knowledge.Designing a convolutional neural network architecture is a classic NP-hard optimization challenge.On the other hand,different datasets require different combinations of models or hyperparameters,which can be time consuming and inconvenient.Various approaches have been proposed to overcome this problem,such as grid search limited to low-dimensional space and queuing by random selection.To address this issue,we propose an evolutionary algorithm-based approach that dynamically enhances the structure of Convolution Neural Networks(CNNs)using optimized hyperparameters.This study proposes a method using Non-dominated sorted genetic algorithms(NSGA)to improve the hyperparameters of the CNN model.In addition,different types and parameter ranges of existing genetic algorithms are used.Acomparative study was conducted with various state-of-the-art methodologies and algorithms.Experiments have shown that our proposed approach is superior to previous methods in terms of classification accuracy,and the results are published in modern computing literature.

基于SORT算法的图像轨迹跟踪混合控制方法

当目标物体被其他物体部分或完全遮挡时,目标的有效特征点数量会逐渐减少,跟踪器无法继续准确地锁定目标,导致目标轨迹中断。为此,文中研究基于SORT算法的图像轨迹跟踪混合控制方法。选取FCOS算法,利用特征金字塔结构,依据检测头层输出的目标分类得分、位置回归结果以及中心度检测图像目标。将目标检测结果作为卡尔曼滤波器的输入,利用离散控制过程系统描述视频图像中的目标运动状态,预测目标轨迹。利用SORT算法控制图像目标检测结果与目标轨迹预测结果进行级联匹配与IoU匹配,输出匹配成功的目标,即图像目标轨迹跟踪结果。实验结果表明,该方法可有效地跟踪视频图像目标轨迹,未出现ID变更情况,轨迹中断占比低于0.2%。

Modeling and Optimization of Electrical Discharge Machining of SiC Parameters, Using Neural Network and Non-Dominating Sorting Genetic Algorithm (NSGA II)

Silicon Carbide (SiC) machining by traditional methods with regards to its high hardness is not possible. Electro Discharge Machining, among non-traditional machining methods, is used for machining of SiC. The present work is aimed to optimize the surface roughness and material removal rate of electro discharge machining of SiC parameters simultaneously. As the output parameters are conflicting in nature, so there is no single combination of machining parameters, which provides the best machining performance. Artificial neural network (ANN) with back propagation algorithm is used to model the process. A multi-objective optimization method, non-dominating sorting genetic algorithm-II is used to optimize the process. Affects of three important input parameters of process viz., discharge current, pulse on time (Ton), pulse off time (Toff) on electric discharge machining of SiC are considered. Experiments have been conducted over a wide range of considered input parameters for training and verification of the model. Testing results demonstrate that the model is suitable for predicting the response parameters. A pareto-optimal set has been predicted in this work.

基于SORT映射的IRCMFDE在旋转机械故障诊断中的应用

针对旋转机械振动信号的强非线性和非平稳性,导致故障特征提取困难的问题,提出了一种基于SORT映射的改进精细复合多尺度波动散布熵(IRCMFDE)和蝙蝠算法优化的相关向量机(BA-RVM)的旋转机械故障诊断方法。首先,利用SORT映射函数替换了精细复合多尺度波动散布熵(RCMFDE)方法的正态累积分布函数,同时对RCMFDE方法的粗粒化方式进行了改进,提出了基于SORT映射的IRCMFDE方法;随后,利用IRCMFDE方法提取了旋转机械振动信号的故障特征,构造了故障特征集;最后,采用BA-RVM分类器对旋转机械的故障类型进行了智能化的识别和分类;将基于IRCMFDE和BA-RVM的故障诊断方法应用于滚动轴承、离心泵和齿轮箱的实验数据分析,并将其与现有故障诊断方法进行了对比分析。研究结果表明:基于IRCMFDE和BA-RVM的故障诊断方法能够有效地识别旋转机械的故障状态,识别准确率分别达到了100%、98%和99%,相比基于RCMFDE、精细复合多尺度熵、精细复合多尺度模糊熵、精细复合多尺度排列熵和精细复合多尺度散布熵的故障特征提取方法,该故障诊断方法的效率和平均识别准确率均优于对比方法,其更适合应用于旋转机械的在线实时故障监测。

Strengthened Dominance Relation NSGA-Ⅲ Algorithm Based on Differential Evolution to Solve Job Shop Scheduling Problem

The job shop scheduling problem is a classical combinatorial optimization challenge frequently encountered in manufacturing systems.It involves determining the optimal execution sequences for a set of jobs on various machines to maximize production efficiency and meet multiple objectives.The Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ)is an effective approach for solving the multi-objective job shop scheduling problem.Nevertheless,it has some limitations in solving scheduling problems,including inadequate global search capability,susceptibility to premature convergence,and challenges in balancing convergence and diversity.To enhance its performance,this paper introduces a strengthened dominance relation NSGA-Ⅲ algorithm based on differential evolution(NSGA-Ⅲ-SD).By incorporating constrained differential evolution and simulated binary crossover genetic operators,this algorithm effectively improves NSGA-Ⅲ’s global search capability while mitigating pre-mature convergence issues.Furthermore,it introduces a reinforced dominance relation to address the trade-off between convergence and diversity in NSGA-Ⅲ.Additionally,effective encoding and decoding methods for discrete job shop scheduling are proposed,which can improve the overall performance of the algorithm without complex computation.To validate the algorithm’s effectiveness,NSGA-Ⅲ-SD is extensively compared with other advanced multi-objective optimization algorithms using 20 job shop scheduling test instances.The experimental results demonstrate that NSGA-Ⅲ-SD achieves better solution quality and diversity,proving its effectiveness in solving the multi-objective job shop scheduling problem.

An NC Algorithm for Sorting Real Numbers in <em>O</em>(nlogn/√<span style="font-size: 14px;font-weight: bold;margin-left:-2px;margin-right:2px;border-top:2px solid black;">loglogn</span>) Operations

We apply the recent important result of serial sorting of n real numbers in time to the design of a parallel algorithm for sorting real numbers in time and operations. This is the first NC algorithm known to take operations for sorting real numbers.

基于YOLO v5s和改进SORT算法的黑水虻幼虫计数方法

目前农业环境下的无序目标的精确计数有很高的应用需求,这种计数对其生物量、生物密度管理起到了重要的指导作用。如黑水虻幼虫目标追踪过程中,追踪对象具有高速和非线性的特征,常规算法存在追踪目标速度不足和丢失目标后的再识别困难等问题。针对以上问题,本文提出了一种改进SORT算法,通过改进卡尔曼滤波模型的方式提升目标追踪算法的快速性和准确性,提升了计数的精度。另外,针对黑水虻幼虫目标识别过程中幼虫性状的多样性和混料导致的复杂背景问题,本文通过实验对比多种深度学习网络性能选定YOLO v5s算法提取图像多维度特征,提升了目标识别精度。实验结果表明:在划线计数方面,本文提出的改进SORT算法与原模型相比,平均精度从91.36%提升到95.55%,提升4.19个百分点,通过仿真和实际应用,证明了本文模型的有效性;在目标识别方面,使用YOLO v5s模型在训练集上帧率为156 f/s,mAP@0.5为99.10%,精度为90.11%,召回率为99.22%,综合性能优于其他网络。

基于YOLOv3和Deep SORT的草原牛跟踪系统

设计了一种基于深度学习算法的草原牛跟踪系统。融合YOLOv3目标检测算法与Deep SORT目标跟踪算法实现对草原牛的检测跟踪,结合比例—积分—微分(PID)算法控制云台(PTZ)摄像头稳定跟随草原牛转动。在内蒙古苏尼特左旗牧场进行现场实验测试,实验结果表明:系统运行稳定,对草原牛检测准确率较高,跟踪效果较好,可以实现未检测到草原牛时自动巡航、对多只草原牛自动跟踪、以及指定跟踪单只草原牛的功能。

XPSort——树形数据多核并行外存排序算法

XML数据处理中一个基本问题是树形数据排序.本文针对已有算法的不足提出了一种XML文档多核并行外存排序算法——XPSort.XPSort扫描XML文档产生相互独立的排序任务,利用多核CPU对任务进行并行处理;同时,利用数据压缩、单临时文件以及避免子树匹配等策略,有效地减少磁盘I/O,提高排序性能;它克服了NEXSORT算法没能有效利用内存空间、存在大量随机I/O的问题以及难以处理"右深树"的缺陷,也克服了HERMES的数据冗余、大量磁盘开销等缺点.文章对不同特性的XML文档开展了大量比较实验,结果表明XPSort优于已有算法,所提优化方法是有效可行的.

基于Quick Sorting的快速分页排序算法

提出了分页排序的概念和基于Quick Sorting的快速分页排序算法(Quick Page Sorting) 以及基于Hint缓存机制的算法实现技术。实验表明,在数万至数百万数据总量情况下,Quick Page Soring的速度比Quick Sorting快10倍左右,大大提高了应用系统的响应速度。

利用无人机航拍视频结合YOLOv3模型和SORT算法统计云杉数量

准确、快速地统计苗木数量对苗圃的运营和管理具有重要意义,是提高苗圃运营和管理水平的有效方式。为快速准确统计完整地块内苗木数量,该研究选取云杉为研究对象,以无人机航拍完整地块云杉视频为数据源,提出一种基于YOLOv3(You Only Look Once v3,YOLOv3)和SORT(Simple Online and Realtime Tracking,SORT)的云杉数量统计方法。主要内容包括数据采集、YOLOv3检测模型构建、SORT跟踪算法和越线计数算法设计。以平均计数准确率(Mean Counting Accuracy,MCA)、平均绝对误差(Mean Absolute Error,MAE)、均方根误差(Root Mean Square Error,RMSE)和帧率(Frame Rate,FR)为评价指标,该方法对测试集中对应6个不同试验地块的视频内云杉进行数量统计的平均计数准确率MCA为92.30%,平均绝对误差MAE为72,均方根误差RMSE为98.85,帧率FR 11.5帧/s。试验结果表明该方法能够快速准确统计完整地块的云杉数量。相比SSD+SORT算法,该方法在4项评价指标中优势显著,平均计数准确率MCA高12.36个百分点,帧率FR高7.8帧/s,平均绝对误差MAE和均方根误差RMSE分别降低125.83和173.78。对比Faster R-CNN+SORT算法,该方法在保证准确率的基础上更加快速,平均计数准确率MCA仅降低1.33个百分点,但帧率FR提高了10.1帧/s。该研究从无人机航拍视频的角度为解决完整地块的苗木数量统计问题做出了有效探索。