这是我学习数字信号处理时编写的程序！功能就是显示一些常用的函数的图形！并可以做FFT计算！...

应用背景统计中经常会遇到求置信区间、置信区域（如置信椭圆、置信椭球）等，有时候需要把置信区域画出来，这样看起看更为直观，下面结合具体案例介绍调用自编函数ConfidenceRegion绘制置信区域。 关键技术【例1】绘制置信区间。产生一元正态分布随机数向量，绘制样本数据的95%置信区间。【例2】绘制置信椭圆。产生二元正态分布随机数矩阵，绘制样本数据的95%置信椭圆区域。【例3】绘制置信椭球。产生三元正态分布随机数矩阵，绘制样本数据的95%置信椭球区域。

adaptive dimension reduction for clustering high dimensional data

示例随机数产生方法，符合平均分部和正态分部，示波器显示-random sample method, in line with the average Division and the normal divisions, oscilloscope shows

VB 功能强大的计费算法 VB 功能强大的计费算法VB 功能强大的计费算法VB 功能强大的计费算法

This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.-This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C 6 on a Windows 2,000 platform.

资源描述FP-growth算法是一个程序来发现频繁项集（关闭和最大以及发电机）与FP-growth算法（频繁模式增长[韩等。2000），表示事务数据库的前缀树，这是加强与链接，组织节点到列表中指同一项目。搜索是通过突出的前缀进行的树，递归地工作结果，并修剪原始树。实施还支持封闭和过滤最大项目集有条件项集库在[ 2003 ]格兰恩和朱，虽然在程序中使用的方法不同于它采用自顶向下的前缀树而不是FP树。它不包括FP树的巧妙的实现两个整数数组作为[ 2004 ] rasz建议。自版本与6上面所用的程序也可以用来查找关联规则。

能运算的函数： sin,cos,tg,ctg,e^,pow(x,y),cosh,sinh,tgh,log10,ln,sqrt,arcsin,arccos, 运算方式： +,-,*,/,绝对值（“[ ]”）,^,!, 输入规则： 用键盘或按钮都可，输入完按回车运算，(光标要在最后) sin(21-32)/(12-43) 4(323-4343) 4*(323-4343) e^2-sin3-3^4,(不要输入pow(3,4)) //有无*都可 2*3^4是（2*3）^4 而不是2*(3^4) 也就是要用x^y就要一定要（x^y）加上一个括号 [3-4]是求3-4的绝对值不是中括号 -performance computing functions : sin, cos, tg, rays, e ^, pow (x, y), cosh, sinh, tgh, log10, ln, sqrt, Simulation, arccos computational methods : absolute ,-,*,/, ( "[]"),^,!, importation rules : a keyboard or buttons which can be imported by the transport operator End (cursor to the final) sin (21-32)/(12-43) 4 (323-4343) 4* ( 323-4343), e ^ 2- KF-3 ^ 4 (do not enter pow (3,4))//* there can be 2* 3 ^ 4 is (2* 3) ^ 4 rather than 2* (3 ^ 4) was needed x ^ y must have (x ^ y) with a brackets [3-4] is the pursuit of 3-4 is not the absolute value of the brackets

用C++编写的基于插值算法的两种检索算法-prepared by the interpolation algorithm based on the two Search Algorithm

使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (File format for the first four bytes is the number of points, after all points are x coordinates and y coordinates, each account for 4-byte value).

1.通过这次实验，我掌握了使用Gauss消去法解线性方程组的方法，加深了我对Gauss消元法的理解。2.Gauss消元法还可以改进，可衍生出列主元消去法和平方根法等，达到减少计算量和减小误差的作用使结果更加准确。3.迭代过程中要求主对角线元素不为零，这在一定程度上限制了可解的线性方程组。