mli

全球卫星导航系统通信中不同卫星中的C/A(Glod码)码产生。(The generation of C/A code for different satellites in GPS communication.)

模糊PID控制在直流调速系统中的应用 ( The APPlication of Fuzzy Control lerin DCSP Regulation )

ekf的程序，这里是将其应用于目标跟踪方面(ekf s programme ,it s fitted to track traget.)

VERY GOOD FOREX SYSTEM

filter design code which describe filter design of low pass filter using window function

主要介绍16QAM调制算法，以及这个算法的简单应用(This paper mainly introduces the 16QAM modulation algorithm and its simple application.)

针对条纹图中的随机散斑噪声，编制旋滤波程序，能够去除散斑噪声的影响，同时不损害条纹信息。(Fringe pattern for the random speckle noise, the preparation of spin filtering procedures to remove the speckle noise, while not jeopardizing the fringe information.)

reduces cycles in bipartite graph

this is a simulink model of a dc motor being controlled by a phase locked loop controller how ever it does not have any load on it if you want you could add one

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)