c语言实现的离散傅立叶（DFT）变换。非快速傅里叶变换，基本的傅里叶变换。...

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.

在数据库中发现频繁模式和关联规则是数据挖掘领域的最基本、最重要的问题。大多数早期的研究采用了类似Apriori算法的产生候选级并测试迭代的途径代价是昂贵的，尤其是挖掘富模式和长模式时，Jiawei Han提出了一种新颖的数据结构FP_tree,及基于其上的FP_growth算法，主要用于有效的进行长模式与富模式的挖掘.本文在讨论了FP_growth算法的基础上，提出了用Visual C++实现该算法的方法，并编写了算法的程序。-found in the database model and the frequent association rules is the area of data mining the most fundamental and important issues. Most of the early studies used a similar Apriori algorithm for the selection of candidates and test-iterative way was costly, particularly mining the rich patterns and long model, Jiawei Han proposed a novel data structure FP_tree and on the basis of their FP_growth algorithm used effectively the model for long and rich patterns of excavation. This paper discussed the FP_growth algorithm on the basis of the Visual C of the algorithm, and the preparation procedure of the algorithm.

数理统计Stutent s检验源代码，应用Visual C#编写。-Mathematical Statistics Stutent s test source code, the application of Visual C# Prepared.

计算器源代码c。和windows自带的功能差不多。很多科学计算还没有加入。-c source code calculator. Windows and almost onboard functions. Many scientific computing has not joined.

一个能处理实的四则运算的程序，实现语言C++，支持嵌套括号，输入表达式，输出结果-A program which could accomplish four arithmetic operation of real numbers, Language used is C++.

基于多项式的矩阵积分-polynomial matrix-based Integral

CPU是计算机系统中一个十分重要的资源，本章主要介绍处理机的调度目标、策略以及评价方法等。因为处理机调度程序不可能选择全部驻留在外存的进程，因此，在调度一个进程占有处理机之前，系统必须按某种策略把外存中处于后备状态的作业选择出来，并创建进程和分配内存，为进程执行准备必需的资源。这一步称为作业调度或高级调度。作业调度的目标是尽量做到公平合理，能执行尽可能多的作业、尽快地响应时间以及高的设备利用率等。任一调度算法要同时满足这些调度目标是不可能的。大多数操作系统都是根据用户需要而采用兼顾某些目标的方法。比较常用的作业调度算法有：FCFS（先来先服务）、方法、SJP(最短作业优先)法、HRN(最高响应比)法等。这-CPU computer systems is a very important resource, this chapter introduces processor scheduling objectives, strategies and evaluation methods. Because the processor scheduling procedures could not choose Disk presence in all the process, and therefore, in the process of scheduling a possession before the processor, the system must be some kind of strategy to Disk backup were at the operational state of choice out and the process of creation and distribution of memory, the process of preparing the implementation of the necessary resources. This step as job scheduling or senior scheduling. Job Scheduling goal is to try to make it fair and reasonable to carry out the operation as much as

插值类，封装了有关插值的一些方法-interpolation category, Packaging of the interpolation methods

一个简单的计算器,用MATLAB开发-a simple calculator, developed using MATLAB

有限元求解微分问题 -Finite Element Method differential problem solving differential FEM Finite Element Method differential FEM problem solving differential problem