3level-PQ-control

说明：  几个函数的小程序 其中包含了：rect sinc xiepo jieyue 等等 (Several functions of small programs which include: rect sinc xiepo jieyue etc.)

说明：  OFDM完整仿真程序 包括QAM，qpsk调制仿真(OFDM Simulation Using Matlab,The perfect simulation of OFDM)

Function to implement Linear Discriminant Analysis Usage:- [Xnew,V,mX,D] = lda(X,index,mX) [V,D] = lda(X,index) where:- X = concatenated grand profile vectors (GPV) i = class index of each vector Xnew = new feature vectors P = eigen vectors mX = mean of GPV (optional in input) D = eigen values

本算法能够按照两种策略生成并绘制随机图，但是对于生成的随机图的属性分析不够完善，从代码中能够看出作者并没有完成本算法关于“平均路径长度”、“聚类系数”和“平均度”三个属性的求解。(The algorithm is able to follow two strategies to generate and draw random graph, but for the properties generated random graph analysis is not perfect, it can be seen from the code of the algorithm is not complete on the "average path length", "clustering coefficient" and "the average degree of" solving the three properties)

基于Creator 大地景建模的研究与实现以飞行模拟仿真为应用背景,研究基于Creator 软件平台的大地景建模关键技术(research the key technology of large landscape modeling basing on Creato)

实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))

在MATLAB环境下四个实验,压缩解压以便日后使用(change picture)

AODV网络协议的matlab实现，运行主函数文件，输入始点和末点的序号，该程序会自动生成图显示基于AODV的从该始点到末点的路由(Matlab AODV network protocol implementations, run the main function of the file, enter the starting point and the end point of the serial number, the program will automatically generate AODV based on the start point to the end point of the route from the map display)

user guide manual for IDE source navigator in HTML format

Gps positioning by kalman filter