compwav

图论中的匈牙利算法，对于研究网络的人十分的有用(Graph Theory in the Hungarian algorithm, for the research network of people is very useful)

说明：  this project is about ask,fsk,psk,piseranko method and sampling rate convertor by a rational factor

Using TF-IDF to Determine Word Relevance in Document Queries : In this paper, we examine the results of applying Term Frequency Inverse Document Frequency (TF-IDF) to determine what words in a corpus of documents might be more favorable to use in a query. As the term implies, TF-IDF calculates values for each word in a document through an inverse proportion of the frequency of the word in a particular document to the percentage of documents the word appears in. Words with high TF-IDF numbers imply a strong relationship with the document they appear in, suggesting that if that word were to appear in a query, the document could be of interest to the user. We provide evidence that this simple algorithm efficiently categorizes relevant words that can enhance query retri

conventional coder for LTE-A

matlab实现的计算一幅图像中相邻像素间的相关性。(calculating the correlation between adjacent pixels in a grayscal image using matlab)

一道程序编译顺序的考题，涉及到函数调用的先后顺序及运算符号的优先级等问题。下面我展开给你讲。 C的程序编译总是从main函数开始的，这道题的重点在“fun（（int）fun（a+c,b）,a-c）） ”语句。 系统首先要确定最外层 fun()函数的实参，第一个参数的确定需要递归调用fun()函数（不妨称其为内层函数）。内层函数的两个参数分别为x=a+b=2+8=10、y=b=5,执行函数体x+y=10+5=15,于是得外层函数的参数x=15。其另一个参数y=a-c=2-b=-6,再次执行函数体,得最终返回值x+y=15+(-6)=9。 (Compiling together the sequence of test procedures, involving the sequence of function calls and operator symbols, such as the priority problem. Now I give you to start speaking. Procedures for C compiler always start from the main function and at这道题the focus of " fun ((int) fun (a+ c, b), ac)) " statement. System must first determine the most outer layer of fun () function of real parameters, the first parameters of recursive calls required fun () function (may be called the inner function). Inner function separately for the two parameters x = a+ b = 2+8 = 10, y = b = 5, to execute the function body x+ y = 10+5 = 15, then the outer function parameters were x = 15 . Its another parameter y = ac = 2-b =- 6, once again to execute the function body may eventually return the value of x+ y = 15+ (-6) = 9.)

用遗传算法改进支持向量机的算法，虽然比较老点，但是还是很有用。(This program is about SVM which is improved by PSO.I think it is a good algorithm)

基于Partial Model Method的PID控制器设计，在matlab2010上完美运行(Based on Partial Model Method of PID controller design, a perfect run in matlab2010)

analyze data association algorithms (Nearest Neighbour and JCBB) in SLAM. Data association is basically a combinatorial optimization problem whose goal is to find the “best” set of associations between the observations and predictions according to a particular criterion (e.g. individual compatibility). Form this point of view, near- est neighbour (NN, a.k.a. ML) is simply a “greedy” algorithm in which the “compatibility” of individual associations with each other is not examined. On the contrary, JCBB, by considering both the individual and joint compatibility, is able to yield much better results. JCBB uses the branch and bound technique in order to prune the search tree

应用于多峰值MPPT问题，采用PSO寻找最大功率点，具体实现在S-function中，仿真时建议找一个内存大的电脑用连续仿真，离散在这种仿真时容易出问题。自行读程序只需输入光伏电压电流即可实现，仿真多峰值问题时光伏板注意反并联二极管，输出为占空比，boost、隔离boost都可以使用(For multi-peak MPPT problem, PSO is used to find the maximum power point, which is realized in S-function. It is suggested that a computer with large memory be used for continuous simulation. Discrete simulation is prone to problems. The self-reading program can be realized only by inputting photovoltaic voltage and current. In the simulation of multi-peak problem, the photovoltaic board pays attention to the anti-parallel diode.)