AOA_TOAc语言改进代码

日期时间工具函数。含有计算星期几、从0000年以来天数和毫秒数、日期加减和日期比较等-Tool functions for calculating datetime. they can calculate days and mseconds form the year 0000, also plus, minus,and comparate of datetime

用户输入起始值和终止值，若起始值大于终止值，程序会自动交换，然后程序会自动计算出该范围内的质数，并在文本框中显示。

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.

代码实现了daugman 的微积分运算符，用于虹膜边界的定位和分段，只需运行 run.m 文件

DCT快速算法64位的C语言实现，乘法次数目前最少，可嵌入解码器使用-DCT the fast algorithm 64 C language realization, the multiplication number of times at present are least, may insert the decoding use

一个自定义的SPIN控件，使用方便-a SPIN-defined controls, easy to use

使用C语言 实现国密SM2、SM3、SM4三种国密算法的实现，并包括相应的说明文档（由国密局发布的技术规范文档）

hmm model, training phase data has to be given to the model .-hmm model, training phase data has to be given to the model .

本源码实现了RSA算法。其中用libtomcrypt第三方库实现，包括加解密。不需要自己编写加解密算法代码，只要调用第三方库中国的代码即可实现，为你省去了很多时间和精力

//=== === === === === === ===== //函数说明 //函数名称：Correlation //函数功能：计算最小二乘法拟合的多项式的相关系数 //使用方法：int M------拟合多项式的项数（已知条件） // double *b---拟合曲线的系数,按升次排列（已知条件） // double *x---结点x轴数据（已知条件） // double *y---结点y轴数据（已知条件） // double *Yg--结点估计值，与*y相对应，个数为m（过程变量） // int m------结点个数（已知条件） //注意事项：多项式阶数最高为10,多项式的形式为 y = b0 + b1*(x-Xavr)... -//=== === === === === === === === === === === =====// Function that// function name: Correlation// Function: Calculation of the polynomial least squares fitting correlation coefficient// Usage: int M------ polynomial fitting the number of (known conditions)// double* b-- Fitting curve coefficient, or times by arrangement (known conditions)// double* x--- node x-axis data (known conditions)// double* y--- node y-axis data (already known conditions)// double* Yg- the estimated value of node, and* y correspond to the number for m (process variables)// int m------ node number (known conditions)// Note: polynomial order up to 10, the polynomial