fftft

(ForWaRD)Fourier-Wavelet Regularized Deconvolution的完整MATLAB代码，内包括相应文献，该方法用去复原图像，去模糊。((ForWaRD) Fourier-Wavelet Regularized Deconvolution of the complete MATLAB code, which includes the corresponding literature, the method used up recovery images, go fuzzy.)

采用floyd算法计算图中任意两点之间最短路程，可以有负权(Floyd algorithm to calculate the shortest distance between any two points can have a negative right to)

book:simulation and softeware radiao for mibole code:psk-based digital transmission schemes ofdm transmission technology cdma transmission technology multiple access protocals cellular telecommunication systems(book : simulation and softeware radiao for mibole cod e : psk-based digital transmission schemes ofdm t ransmission technology cdma transmission Commando hnology multiple access cellular te protocals lecommunication systems)

基于PSO的DV_hop算法，对定位系统有很好的效果，希望对你有用(The DV_hop algorithm based on PSO, the positioning system with good results, you want to be useful)

hmm MATLAB工具箱，里面有自己写的一个DEMO可直接运行，方便大家理解，相互帮助啊(hmm MATLAB toolbox, which has to write a DEMO can be run directly, to facilitate understanding, mutual help ah)

离散数学用matlab实现，包括手实例(about matlab，about sign)

各种算子对车道线边缘识别的对比，其中包括车道线图像，也包含sobel，canny，prewritt算子的差异。(The operator of lane edge recognition)

几个经典的测试函数，sphere schaffer ackel girewank rosenbrock(Several classical test functions, sphere schaffer ackel girewank rosenbrock)

该程序实现了高斯白噪声环境下直流电平的检测.画出了似然比门限,虚警,漏警随先验概率,代价因自等变化的情况.(The program to achieve the detection of DC level Gauss white noise environment. Draw the likelihood ratio threshold, the false alarm, alarm with the prior probability, cost because of the changes.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )