danxiangPR

topology opt code 110 line

节点总数目N； 平均连接度α 边的平均长度β 两点间长度d(i,j) 节点间最长的边的长度L 两点的连接概率p(i,j) (The total number of nodes N average connectivity α β average length sides between two points length d (i, j) between nodes longest side length L connecting two points of the probability p (i, j) )

预测函数控制代码通过轧辊压下实现对铝带轧制系统的纠偏(Predictive function control codes for aluminum rolling reduction achieved by correcting the system rolls)

说明：  希尔伯特黄变换，经验模态分解，包络谱分析(Hilbert yellow transform, empirical mode decomposition, envelope spectrum analysis)

C课设必备，课设常见类型都有，内容很全！(A helper for you when developing a C progrem)

Dolev算法、快速收敛算法、传感器融合算法及混合算法等4种算法，完成对拜占庭将军问题的求解(Dolev algorithm, fast convergence algorithms, sensor fusion algorithm and hybrid algorithm, four kinds of algorithms, the completion of the Byzantine generals problem solving)

数独程序，，很好用的，大家可以参考一下，呵呵呵~~~~~(Sudoku program, well used, we can refer to, Ha ha ha ~~~~~)

卡尔曼滤波器（kalman filter）的matlab代码(kalman filter matlab code)

simulate the ofdm system

In this paper we discuss the problem of recovering the vertices of a planar polygon from its measured complex moments.Because the given, measured moments can be noisy, the recovered vertices are only estimates of the true ones. The literature offers many algorithms for solving such an estimation problem. We will restrict our discussion to the Total Least Squares (TLS) data fitting models HTLS and STLS and the matrix pencil method GPOF. We show the close link between the HTLS and the GPOF method. We use the HTLS method to compute starting values for the STLS method. We compare the accuracy of these three methods on simulated data. 2005 Elsevier B.V. All rights reserved.