Graphics

this is about DTFT.DTFT s matlab code and it is for Discrete time fourier transform.

DWT is any wavelet transform for which the waveletsDaubechies wavelets are discretely sampled. The code uses

⑴.设计游乐平面图，所含景点不少于10个。以图中顶点表示游乐园各景点，存放景点名称、代号、等信息；以边表示路径，存放路径长度等相关信息。 ⑵．为游人提供图中任意景点的问路查询，及查询任意两个景点之间的一条最短的简单路径。 (⑴. Designed to play plan, contained less than 10 scenic spots. To graph vertices, said the amusement park attractions, attractions store names, codes, and other information to edges, said path, the path length of storage of information. ⑵. To provide the figure for the visitors ask for directions any spots, queries, and query any two attractions of a shortest simple path.)

说明：  rossler三维相空间吸引子，X相序列(rossler three-dimensional phase space attractor, X-phase sequence)

Animation of swimming pool

绘制磁路电感随空气隙长度变化的曲线，参数数据已经列于文件中(Draw magnetic inductance changes with the air gap length of the curve)

Comparison of the performances of the LS and the MMSE channel estimators for a 64 sub carrier OFDM system based on the parameter of Mean square erro

聚类算法，不是分类算法。分类算法是给一个数据，然后判断这个数据属于已分好的类中的具体哪一类。聚类算法是给一大堆原始数据，然后通过算法将其中具有相似特征的数据聚为一类。这里的k-means聚类，是事先给出原始数据所含的类数，然后将含有相似特征的数据聚为一个类中。所有资料中还是Andrew Ng介绍的明白。首先给出原始数据{x1,x2,...,xn}，这些数据没有被标记的。初始化k个随机数据u1,u2,...,uk。这些xn和uk都是向量。根据下面两个公式迭代就能求出最终所有的u,这些u就是最终所有类的中心位置。(Clustering algorithm, not a classification algorithm. Classification algorithm is to give a figure, and then determine the data belonging to a specific class of good which category. Clustering algorithm is to give a lot of raw data, and then through the algorithm which has similar characteristics data together as a class. Here k-means clustering, is given in advance the number of classes contained in the raw data, then the data contain similar characteristics together as a class. All information presented in or Andrew Ng understand. Firstly, raw data {x1, x2, ..., xn}, the data is not labeled. K random initialization data u1, u2, ..., uk. These are the vectors xn and uk. According to the following two formulas can be obtained final iteration all u, u is the ultimate all these classes the center position.)

实现GMSK的眼图程序，其中有fait程序及sincos程序代码，以及最后眼图的生成代码(Of GMSK eye diagram the the fait program and sincos code, and the final eye diagram generated code, which)

数据链路层滑动窗口协议的设计与实现源码 信道模型为8000bps 全双工卫星信道，信道传播时延270 毫秒，信道误码率为10-5，信道提供字节流传输服务，网络层分组长度在240~256字节范围。(Sliding window data link layer protocol design and implementation of source-channel model 8000bps full-duplex satellite channel, the channel propagation delay 270 ms, the channel bit error rate of 10-5, the channel provides a byte stream transfer service, network layer packet length in the range of 240 to 256 bytes.)