psocode

用两种向量化和一种循环的思路计算水仙花数，并给出所需时间比较 水仙花数是指一个三位数,其各个数的立方和等于该数(Quantified in two and a loop to the idea of calculating the number of daffodils and narcissus are given the time required for comparison is a three-digit number, the individual cubes, and equal to the number of)

IIR直接型系统结构转换为级联型系统结构(IIR direct-type system structure into a cascade system structure)

说明：  曲波变换1，可以用来做曲波变换得到系数矩阵，其中含逆变换(curvelet Part)

CHOOSENK All choices of K elements taken from 1:N

最短路问题的D算法,供大家参考，谢谢，ps:j介绍要求的字好多(D-algorithm for the shortest path problem, for your reference, thank you, ps: j introduced the word required a lot of)

网络控制中最大时延的不同计算方法比较，用于确定采样间隔，可用于网络化控制系统的稳定性判别与调度边界确定(The comparison of several MADB calculation method in networked control)

几篇学习光纤陀螺误差补偿有用的文献,相信对大家有用。(Some useful papers of FOG. )

otsu算法的实现，自适应最佳阈值图像分割方法，最大类间方差算法(otsu algorithm, adaptive optimal threshold image segmentation method, Otsu Algorithm)

共轭梯度法是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。(Conjugate gradient method is between the steepest descent method and Newton method between a method that only use the first derivative information, but the steepest descent method to overcome the disadvantage of slow convergence, but also avoids the need to store and calculate Newton Hesse matrix and the shortcomings of the inverse, conjugate gradient method is not only linear equations to solve large-scale one of the most useful, large-scale nonlinear optimization solution is also the most efficient algorithms.)

time-invariant degradation models and stationary signals and noise, the classical Fourier domain Wiener filter, which can be implemented in O(N logN) time, gives the minimum mean-square-error estimate of the original undistorted signal. For time-varying degradations and nonstationary processes, however, the optimal linear estimate requires O(N2) time for implementation. We consider filtering in fractional Fourier domains, which enables significant reduction of the error compared with ordinary Fourier domain filtering for certain types of degradation and noise (especially of chirped nature), while requiring only O(N logN) implementation time. Thus, improved performance is achieved at no additional cost. Expressions for the optimal filter functions in fractional domains are derived, and several illustrative examples are given in which significant reduction of the error (by a factor of 50) is obtained.