improved_OMP_channe_estimation

应用平面波法模拟蜂窝状二维光子晶体的te模带隙结构(Application of plane-wave simulation of two-dimensional honeycomb photonic crystal band-gap structure of te model)

说明：  捕鱼策略：在实现可持续收获的前提下，追求最大产量或最佳效益。(Fishing strategy: to achieve sustainable harvesting under the premise of achieving maximum production or the best value.)

apiriori algoritm in matlab for computer students

包括模糊C均值及其改进方法FCM_S1、FCM_S2、GFCM的实现及示例(Including fuzzy c-means and its improved method FCM_S1, FCM_S2, GFCM realization and examples)

包含收发两个客户端的链路级通信程序,GPS和INS组合导航程序，考虑雨衰 阴影 和多径影响。( Contains two clients receive link-level communications program, GPS and INS navigation program, Consider shadow rain attenuation and multipath effect.)

matlab实例编程一百个源程序，里面含有matlab图像处理的基本算法(example of matlab programming source 100, which contains the basic matlab image processing algorithm)

用于斜视聚束式SAR成像的非线性频率变标算法，有完整数学模型。(Nonlinear Frequency Scaling Algorithm for High Squint Spotlight SAR Data Processing)

This code extract the Accelerometer calibration coefficients for an IMU.

利用matlab进行商品销售的计算机仿真算法 根据售货情况，计算进货情况(Merchandising using matlab simulation algorithm based on the sales situation, calculate the purchase situation)

1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始：考虑一个含有N个点的最近邻耦合网络，它们围成一个环，其中每个节点都与它左右相邻的各K/2节点相连，K是偶数。 2、随机化重连：以概率p随机地从新连接网络中的每个边，即将边的一个端点保持不变，而另一个端点取为网络中随机选择的一个节点。其中规定，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。 (In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)