数学基本函数调用库

差分微积分used to anticipate and respond to the uncertain future.-Differential calculus used to anticipate and respond to the uncertain future.

在这里，我已经旋转了一个图像使用轨迹栏。然后用户可以手动旋转所需的角度。

计算机常用数值计算算法与程序(C++),主要用于科学计算中的复数运算，多项式与连分式计算，矩阵运算，矩阵特征值与特征向量的计算，线性方程组求解，非线性方程(组)求解，插值，数值积分，常微分方程(组)求解，数值拟合与逼近，数据处理与回归分析，极值等。 -Commonly used computer algorithms and numerical procedures (C++), Mainly used for scientific computing complex in the computation, polynomials and continued fractions calculation, matrix operations, matrix eigenvalue and eigenvector calculation, solving linear equations , non-linear equation (group) to solve, interpolation, numerical integration, ordinary differential equations (group) to solve, numerical simulation and approximation, data processing and regression analysis, extreme value, etc..

这是调车作业的院子里表达式求值算法 ！！表达式转换成后缀 & 然后评估使用堆栈和队列 ！！

关于ACM分类的文档 对于初学者有帮助-ACM Documents on the classification of help for beginners

基于光学三角测量系统，采用双ccd摄像机采集激光光刀在物体表面上的扫描地带，送入程序进行处理，对扫描的图像进行轮廓提取，数据抽稀，数据拼合算法

k-means 算法的工作过程说明如下：首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。-k-means algorithm process as follows: First of all, the object data from the n choose k object as initial cluster centers and the remaining for the other object, then according to their cluster center with those of the similarity (distance) respectively assigned to them with the most similar (represented by cluster center) clustering obtained and then calculated for each new cluster center clustering (all objects in the cluster mean) repeated this process until the standard measure of function until the beginning of convergence.

计算超短脉冲非线性传输的一个比较成熟的M文件-Calculation of nonlinear transmission of ultrashort pulse of a more mature M documents

资源描述void creatWay(int (*mg)[N],int x, int y)//在迷宫中产生一条路，使用图的深度遍历思想来实现， { static int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};////将要走的4个方向保存在二维数组中 int zx = x*2; int zy = y*2; int next, turn, i; mg[zx][zy] = 0; if(rand()%2) turn = 1; else turn = 3; for(i=0,next=rand()%4;i

计算文件的32位CRC校验码.比较简单实用,Demo中一次性读完整个文件是不可取的,您需要作些修改以应用于所有大小的文件CRC.-calculations of 32 of CRC. Relatively simple and practical, Demo one time reading the entire document is undesirable, You need to make some changes to apply to all size of the CRC document.