paper

this source code is gm2lc matlab

基于FPGA的增量式PID设计方法，Matlab、Simulink， Xilinx Block set(Incremental PID FPGA-based design methodology)

说明：  该程序试图考察一组数据服从哪种分布（正态，指数或双边指数），并利用K-S检验对各种分布作了检验。(The program attempts to examine a set of data subject to which distribution (normal, exponential or bilateral index), and use KS test has been tested in a variety of distributions.)

说明：  用Maple和Matlab解决科学计算问题，很好(With Maple and Matlab to solve problems in scientific computing, very good)

DS证据理论用于信息融合。很多学科都可能用到。(construction of the Membership function. Many disciplines may be used, in particular information class students)

第一个是path 和 CLASSPATH的问题 第二个是package和import问题 第三个是public，protected，private，static，什 么时候用，为什么要用，怎么用 第四个是制作jar文件 (article is a path CLASSPATH issues and the second is The need to package and ort third issue is public, protected, private, static, and when used, why choose, how are with the fourth production jar files)

对matlab初学者很有帮助，尤其是simulink的爱好者。(Matlab helpful for beginners, especially the simulink lovers.)

可以实现ofdm的LS信道估计，并与未采用估计时进行比较(The LS can ofdm channel estimation, and with no comparison with estimates)

SAE J1587-2002.Electronic data interchange between microcomputer systems in heavy-duty vehicle applications

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.)