A blockchain bee colony double inhibition labor division algorithm for spatio-temporal coupling task with application to UAV swarm task allocation

It is difficult for the double suppression division algorithm of bee colony to solve the spatio-temporal coupling or have higher dimensional attributes and undertake sudden tasks.Using the idea of clustering,after clustering tasks according to spatio-temporal attributes,the clustered groups are linked into task sub-chains according to similarity.Then,based on the correlation between clusters,the child chains are connected to form a task chain.Therefore,the limitation is solved that the task chain in the bee colony algorithm can only be connected according to one dimension.When a sudden task occurs,a method of inserting a small number of tasks into the original task chain and a task chain reconstruction method are designed according to the relative relationship between the number of sudden tasks and the number of remaining tasks.Through the above improvements,the algorithm can be used to process tasks with spatio-temporal coupling and burst tasks.In order to reflect the efficiency and applicability of the algorithm,a task allocation model for the unmanned aerial vehicle(UAV)group is constructed,and a one-to-one correspondence between the improved bee colony double suppression division algorithm and each attribute in the UAV group is proposed.Task assignment has been constructed.The study uses the self-adjusting characteristics of the bee colony to achieve task allocation.Simulation verification and algorithm comparison show that the algorithm has stronger planning advantages and algorithm performance.

Diophantine Quotients and Remainders with Applications to Fermat and Pythagorean Equations

Diophantine equations have always fascinated mathematicians about existence, finitude, and the calculation of possible solutions. Among these equations, one of them will be the object of our research. This is the Pythagoras’- Fermat’s equation defined as follows. (1) when , it is well known that this equation has an infinity of solutions but has none (non-trivial) when . We also know that the last result, named Fermat-Wiles theorem (or FLT) was obtained at great expense and its understanding remains out of reach even for a good fringe of professional mathematicians. The aim of this research is to set up new simple but effective tools in the treatment of Diophantine equations and that of Pythagoras-Fermat. The tools put forward in this research are the properties of the quotients and the Diophantine remainders which we define as follows. Let a non-trivial triplet () solution of Equation (1) such that . and are called the Diophantine quotients and remainders of solution . We compute the remainder and the quotient of b and c by a using the division algorithm. Hence, we have: and et with . We prove the following important results. if and only if and if and only if . Also, we deduce that or for any hypothetical solution . We illustrate these results by effectively computing the Diophantine quotients and remainders in the case of Pythagorean triplets using a Python program. In the end, we apply the previous properties to directly prove a partial result of FLT. .

可扩展路由器中SPT并行计算的实现

随着互联网的飞速发展,集群结构的下一代核心路由器已经成为研究的重点.在可扩展路由器中(clus- ter router),并行路由算法是关键问题之一.对于广泛部署的OSPF协议,最短路径树(SPT)的并行计算是其并行化的核心难点.本文提出了一种计算最短路径树的算法-分区Dijkstra算法(D-D),分析了算法性能,并通过模拟实验验证了算法的性能.

基于改进的RD成像算法的SAR点目标仿真

常用的RD算法对斜视角限制较严,而且RCMC插值较为复杂,降低了算法的效率。针对这一缺陷提出了在方位向分块处理的改进RD算法,从而提高了处理效率,改善了大斜视角对RD算法的限制,并通过计算机仿真以及实测数据验证了改进的RD算法的可行性。

基于Landsat-8 OLI数据的海南牛路岭水库水深的反演研究

基于遥感数据的水深反演对加快海南省基础水文数据的收集和简化整片水域水文数据的动态监测有着重要意义.利用Landsat-8 OLI卫星遥感影像和乘船采集的实测数据,在单波段法、多波段比值法和底部反照率独立水深算法(B算法)中选出了最适合水深反演的模型,即B算法模型,并针对B算法模型中对于深度小于10 m和大于30 m的水体其反演精度不佳的问题,提出了分区反演的处理方法.结果表明,对于改进后的B算法模型,其平均绝对误差降低了45.7%,平均相对误差降低了42.3%,而且水深反演精度得到了明显提高.故改进后的分区反演B算法模型与牛路岭水库的实际水深分布更为契合,可以将其用来获取整个水库的水深数据.